From b3489321729e2d89779beb855ab34727cade6c38 Mon Sep 17 00:00:00 2001
From: EnderIce2 <enderice2@users.noreply.github.com>
Date: Wed, 20 Nov 2024 05:15:06 +0200
Subject: [PATCH] Merge remote-tracking branch 'Kernel/mb2_32_64_test' into
 Kernel-mb2_32_64_test

---
 Kernel/.github/workflows/flawfinder.yml       |   38 +
 Kernel/.gitignore                             |    7 +
 Kernel/.vscode/c_boilerplates.code-snippets   |   69 +
 Kernel/.vscode/c_cpp_properties.json          |  219 +
 Kernel/.vscode/extensions.json                |   13 +
 Kernel/.vscode/launch.json                    |   40 +
 Kernel/.vscode/settings.json                  |   19 +
 Kernel/Architecture/aarch64/Bootstrap/boot.S  |   36 +
 Kernel/Architecture/aarch64/Entry.cpp         |   27 +
 Kernel/Architecture/aarch64/SystemCalls.cpp   |   31 +
 .../aarch64/cpu/SymmetricMultiprocessing.cpp  |   59 +
 Kernel/Architecture/aarch64/linker.ld         |   83 +
 Kernel/Architecture/aarch64/runtime/crt0.S    |   17 +
 Kernel/Architecture/aarch64/runtime/crt1.S    |   17 +
 .../Architecture/aarch64/runtime/crtbegin.c   |    1 +
 Kernel/Architecture/aarch64/runtime/crtend.c  |    1 +
 Kernel/Architecture/aarch64/runtime/crti.S    |   13 +
 Kernel/Architecture/aarch64/runtime/crtn.S    |    7 +
 ...AdvancedConfigurationAndPowerInterface.cpp |  155 +
 Kernel/Architecture/amd64/Bootstrap/GDT32.asm |   47 +
 .../amd64/Bootstrap/Header_Multiboot.asm      |    5 +
 .../amd64/Bootstrap/Header_Multiboot2.asm     |   64 +
 Kernel/Architecture/amd64/Bootstrap/Limine.c  |  346 +
 .../amd64/Bootstrap/Multiboot.cpp             |  299 +
 .../amd64/Bootstrap/Multiboot64bitMap.cpp     |  287 +
 .../amd64/Bootstrap/Multiboot_Init.asm        |  114 +
 .../amd64/Bootstrap/Multiboot_PageTable.asm   |   45 +
 .../DifferentiatedSystemDescriptionTable.cpp  |  255 +
 .../amd64/MultipleAPICDescriptionTable.cpp    |   91 +
 Kernel/Architecture/amd64/SystemCalls.cpp     |   92 +
 Kernel/Architecture/amd64/acpi.hpp            |  294 +
 ...dvancedProgrammableInterruptController.cpp |  403 +
 .../amd64/cpu/GlobalDescriptorTable.cpp       |  214 +
 .../amd64/cpu/InterruptDescriptorTable.cpp    |  757 ++
 .../Architecture/amd64/cpu/SMPTrampoline.asm  |  136 +
 .../amd64/cpu/SymmetricMultiprocessing.cpp    |  141 +
 Kernel/Architecture/amd64/cpu/apic.hpp        |  354 +
 Kernel/Architecture/amd64/cpu/gdt.hpp         |  164 +
 Kernel/Architecture/amd64/cpu/idt.hpp         |   84 +
 Kernel/Architecture/amd64/linker.ld           |   92 +
 Kernel/Architecture/amd64/runtime/crt0.c      |   15 +
 Kernel/Architecture/amd64/runtime/crt1.c      |   15 +
 Kernel/Architecture/amd64/runtime/crtbegin.c  |    1 +
 Kernel/Architecture/amd64/runtime/crtend.c    |    1 +
 Kernel/Architecture/amd64/runtime/crti.S      |   13 +
 Kernel/Architecture/amd64/runtime/crtn.S      |    7 +
 Kernel/Architecture/amd64/rust-target.json    |   21 +
 .../Architecture/i386/ArithmeticOperations.c  |  327 +
 .../i386/Bootstrap/Header_Multiboot.asm       |    5 +
 .../i386/Bootstrap/Header_Multiboot2.asm      |   41 +
 .../Architecture/i386/Bootstrap/Multiboot.cpp |  286 +
 .../i386/Bootstrap/Multiboot_Init.asm         |   50 +
 .../i386/Bootstrap/Multiboot_PageTable.asm    |   10 +
 .../Architecture/i386/Interrupts/8259PIC.cpp  |  140 +
 Kernel/Architecture/i386/Interrupts/pic.hpp   |   59 +
 Kernel/Architecture/i386/SystemCalls.cpp      |   30 +
 Kernel/Architecture/i386/acpi.hpp             |  294 +
 .../i386/cpu/GlobalDescriptorTable.cpp        |  116 +
 .../i386/cpu/SymmetricMultiprocessing.cpp     |   54 +
 Kernel/Architecture/i386/cpu/apic.hpp         |  354 +
 Kernel/Architecture/i386/cpu/gdt.hpp          |  162 +
 Kernel/Architecture/i386/cpu/idt.hpp          |   28 +
 Kernel/Architecture/i386/linker.ld            |   93 +
 Kernel/Architecture/i386/runtime/crt0.c       |   15 +
 Kernel/Architecture/i386/runtime/crt1.c       |   15 +
 Kernel/Architecture/i386/runtime/crtbegin.c   |    1 +
 Kernel/Architecture/i386/runtime/crtend.c     |    1 +
 Kernel/Architecture/i386/runtime/crti.S       |   13 +
 Kernel/Architecture/i386/runtime/crtn.S       |    7 +
 Kernel/Core/CPU.cpp                           |  492 +
 Kernel/Core/Crash/CrashDetails.cpp            |  346 +
 Kernel/Core/Crash/CrashHandler.cpp            | 1122 ++
 Kernel/Core/Crash/KBDrv.cpp                   |  194 +
 Kernel/Core/Crash/SFrame.cpp                  |  148 +
 Kernel/Core/Crash/Screens/Console.cpp         |   42 +
 Kernel/Core/Crash/Screens/Details.cpp         |  267 +
 Kernel/Core/Crash/Screens/Main.cpp            |  390 +
 Kernel/Core/Crash/Screens/StackFrame.cpp      |   99 +
 Kernel/Core/Crash/Screens/Tasks.cpp           |   87 +
 Kernel/Core/Crash/UserHandler.cpp             |  398 +
 Kernel/Core/Crash/chfcts.hpp                  |  322 +
 Kernel/Core/Debugger.cpp                      |  155 +
 Kernel/Core/Disk.cpp                          |  169 +
 Kernel/Core/Driver/Driver.cpp                 |  343 +
 Kernel/Core/Driver/DriverAPI.cpp              |  203 +
 .../Core/Driver/DriverBinding/BindInput.cpp   |   73 +
 .../Driver/DriverBinding/BindInterrupt.cpp    |   85 +
 Kernel/Core/Driver/DriverBinding/BindPCI.cpp  |  201 +
 .../Core/Driver/DriverBinding/BindProcess.cpp |   42 +
 .../Core/Driver/DriverBinding/Input/Audio.cpp |   40 +
 .../Driver/DriverBinding/Input/Display.cpp    |   40 +
 .../Driver/DriverBinding/Input/Filesystem.cpp |   40 +
 .../Driver/DriverBinding/Input/Generic.cpp    |   40 +
 .../Core/Driver/DriverBinding/Input/Input.cpp |   67 +
 .../Driver/DriverBinding/Input/Network.cpp    |   40 +
 .../Driver/DriverBinding/Input/Storage.cpp    |   40 +
 .../Driver/DriverBinding/Interrupt/Audio.cpp  |   81 +
 .../DriverBinding/Interrupt/Display.cpp       |   81 +
 .../DriverBinding/Interrupt/Filesystem.cpp    |   81 +
 .../DriverBinding/Interrupt/Generic.cpp       |   88 +
 .../Driver/DriverBinding/Interrupt/Input.cpp  |  124 +
 .../DriverBinding/Interrupt/Network.cpp       |   81 +
 .../DriverBinding/Interrupt/Storage.cpp       |  115 +
 .../Core/Driver/DriverBinding/PCI/Audio.cpp   |  110 +
 .../Core/Driver/DriverBinding/PCI/Display.cpp |   82 +
 .../Driver/DriverBinding/PCI/Filesystem.cpp   |   82 +
 .../Core/Driver/DriverBinding/PCI/Generic.cpp |   82 +
 .../Core/Driver/DriverBinding/PCI/Input.cpp   |   82 +
 .../Core/Driver/DriverBinding/PCI/Network.cpp |  110 +
 .../Core/Driver/DriverBinding/PCI/Storage.cpp |  110 +
 .../Driver/DriverBinding/Process/Audio.cpp    |   40 +
 .../Driver/DriverBinding/Process/Display.cpp  |   40 +
 .../DriverBinding/Process/Filesystem.cpp      |   40 +
 .../Driver/DriverBinding/Process/Generic.cpp  |   40 +
 .../Driver/DriverBinding/Process/Input.cpp    |   40 +
 .../Driver/DriverBinding/Process/Network.cpp  |   40 +
 .../Driver/DriverBinding/Process/Storage.cpp  |   40 +
 Kernel/Core/Driver/api.hpp                    |   27 +
 Kernel/Core/InterruptsManager.cpp             |  235 +
 Kernel/Core/Lock.cpp                          |  207 +
 .../Memory/HeapAllocators/Xalloc/README.md    |  137 +
 .../Memory/HeapAllocators/Xalloc/Wrapper.cpp  |   40 +
 .../Memory/HeapAllocators/Xalloc/Xalloc.hpp   |  119 +
 .../Memory/HeapAllocators/Xalloc/XallocV1.cpp |  290 +
 Kernel/Core/Memory/Memory.cpp                 |  818 ++
 Kernel/Core/Memory/MemoryManager.cpp          |  250 +
 Kernel/Core/Memory/PageMapIndexer.cpp         |   45 +
 Kernel/Core/Memory/PhysicalMemoryManager.cpp  |  541 +
 Kernel/Core/Memory/StackGuard.cpp             |  110 +
 Kernel/Core/Memory/VirtualMemoryManager.cpp   |  304 +
 .../Core/PeripheralComponentInterconnect.cpp  |  886 ++
 Kernel/Core/Power.cpp                         |  139 +
 Kernel/Core/README.md                         |   22 +
 Kernel/Core/Random.cpp                        |  143 +
 Kernel/Core/StackGuard.cpp                    |   96 +
 Kernel/Core/Symbols.cpp                       |  142 +
 Kernel/Core/SystemManagementBIOS.cpp          |   85 +
 Kernel/Core/Time/HighPrecisionEventTimer.cpp  |   89 +
 Kernel/Core/Time/Time.cpp                     |  105 +
 Kernel/Core/Time/TimeStampCounter.cpp         |   81 +
 Kernel/Core/Time/Timer.cpp                    |  215 +
 Kernel/Core/UndefinedBehaviorSanitization.c   |  610 ++
 ...iversalAsynchronousReceiverTransmitter.cpp |  171 +
 Kernel/Core/Video/Display.cpp                 |  442 +
 Kernel/Core/Video/Font.cpp                    |   76 +
 Kernel/Core/crashhandler.hpp                  |   35 +
 Kernel/Core/smbios.hpp                        |  357 +
 Kernel/Core/ubsan.h                           |  111 +
 Kernel/DAPI.hpp                               |  431 +
 Kernel/Doxyfile                               | 2659 +++++
 Kernel/Execute/Elf/BaseLoad.cpp               |  287 +
 Kernel/Execute/Elf/Dyn.cpp                    |   44 +
 Kernel/Execute/Elf/Exec.cpp                   |  225 +
 Kernel/Execute/Elf/Parse.cpp                  |  310 +
 Kernel/Execute/Elf/Rel.cpp                    |  109 +
 Kernel/Execute/Elf/SharedObjects.cpp          |  256 +
 Kernel/Execute/Fex/BaseLoad.cpp               |   38 +
 Kernel/Execute/Parse.cpp                      |  102 +
 Kernel/Execute/Spawn.cpp                      |  109 +
 Kernel/Fex.hpp                                |  161 +
 Kernel/FileSystem/FS/ustar.cpp                |  137 +
 Kernel/FileSystem/Filesystem.cpp              |  644 ++
 Kernel/Files/tamsyn-font-1.11/LICENSE         |   10 +
 Kernel/Files/tamsyn-font-1.11/README          |   82 +
 .../Files/tamsyn-font-1.11/Tamsyn10x20b.psf   |  Bin 0 -> 10823 bytes
 .../Files/tamsyn-font-1.11/Tamsyn10x20r.psf   |  Bin 0 -> 10823 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn5x9b.psf  |  Bin 0 -> 2887 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn5x9r.psf  |  Bin 0 -> 2887 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn6x12b.psf |  Bin 0 -> 3655 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn6x12r.psf |  Bin 0 -> 3655 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn7x13b.psf |  Bin 0 -> 3911 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn7x13r.psf |  Bin 0 -> 3911 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn7x14b.psf |  Bin 0 -> 4167 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn7x14r.psf |  Bin 0 -> 4165 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn8x15b.psf |  Bin 0 -> 4423 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn8x15r.psf |  Bin 0 -> 4421 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn8x16b.psf |  Bin 0 -> 4679 bytes
 Kernel/Files/tamsyn-font-1.11/Tamsyn8x16r.psf |  Bin 0 -> 4677 bytes
 Kernel/GUI/GUITools.cpp                       |  218 +
 Kernel/GUI/GraphicalUserInterface.cpp         |  665 ++
 Kernel/GUI/Icons.cpp                          |  253 +
 Kernel/GUI/WidgetEvents.cpp                   |  159 +
 Kernel/GUI/Widgets.cpp                        |  141 +
 Kernel/GUI/Window.cpp                         |   82 +
 Kernel/GUI/WindowEvents.cpp                   |  137 +
 Kernel/GUI/icons.hpp                          |   34 +
 Kernel/Kernel.cpp                             |  566 +
 Kernel/KernelConfig.cpp                       |  271 +
 Kernel/KernelThread.cpp                       |  473 +
 Kernel/LICENSE                                |  676 ++
 Kernel/Library/Bitmap.cpp                     |   45 +
 Kernel/Library/Convert.cpp                    | 1081 ++
 Kernel/Library/CyclicRedundancyCheck32.c      |   96 +
 Kernel/Library/MemOp.c                        |  351 +
 Kernel/Library/MemoryCopySIMD.cpp             |  195 +
 Kernel/Library/MemoryMoveSIMD.cpp             |   60 +
 Kernel/Library/MemorySetSIMD.cpp              |   81 +
 Kernel/Library/cargs.c                        |  512 +
 Kernel/Library/cwalk.c                        | 1469 +++
 Kernel/Library/cxxabi.cpp                     |  294 +
 Kernel/Library/dumper.cpp                     |   91 +
 Kernel/Library/errno.cpp                      |   27 +
 Kernel/Library/liballoc_1_1.c                 |  793 ++
 Kernel/Library/liballoc_1_1.h                 |   74 +
 Kernel/Library/liballocimpl.cpp               |   14 +
 Kernel/Library/md5.c                          |  257 +
 Kernel/Library/printf.c                       | 1592 +++
 Kernel/Library/targp.c                        |   47 +
 Kernel/Makefile                               |  196 +
 Kernel/Network/AddressResolutionProtocol.cpp  |  245 +
 Kernel/Network/Checksum.cpp                   |   31 +
 Kernel/Network/DomainNameSystem.cpp           |   35 +
 .../DynamicHostConfigurationProtocol.cpp      |  186 +
 Kernel/Network/Ethernet.cpp                   |  148 +
 .../InternetControlMessageProtocol.cpp        |   77 +
 Kernel/Network/InternetProtocol.cpp           |  142 +
 Kernel/Network/NetworkController.cpp          |  250 +
 Kernel/Network/NetworkDebugger.cpp            |  100 +
 Kernel/Network/NetworkTimeProtocol.cpp        |   75 +
 .../Network/TransmissionControlProtocol.cpp   |   25 +
 Kernel/Network/UserDatagramProtocol.cpp       |  145 +
 Kernel/Profiling/cyg.cpp                      |  112 +
 Kernel/Profiling/gcov.cpp                     |   88 +
 Kernel/Profiling/gprof.cpp                    |   38 +
 Kernel/README.md                              |   11 +
 Kernel/Recovery/RecoveryMain.cpp              |  366 +
 Kernel/SystemCalls/Linux.cpp                  | 2458 +++++
 Kernel/SystemCalls/Native.cpp                 |  466 +
 Kernel/SystemCalls/Syscalls.cpp               |   65 +
 Kernel/Tasking/InterProcessCommunication.cpp  |  259 +
 Kernel/Tasking/Scheduler.cpp                  |  727 ++
 Kernel/Tasking/Security.cpp                   |  149 +
 Kernel/Tasking/Task.cpp                       |  874 ++
 Kernel/Tests/CPUID.cpp                        |  155 +
 Kernel/Tests/Marco.cpp                        |  107 +
 Kernel/Tests/MemoryAllocation.cpp             |  250 +
 Kernel/Tests/MemoryOperations.cpp             |  138 +
 Kernel/Tests/RandomNumberGenerator.cpp        |   68 +
 Kernel/Tests/String.cpp                       |  119 +
 Kernel/Tests/TypeSize.cpp                     |  123 +
 Kernel/Tests/std.cpp                          |   36 +
 Kernel/Tests/t.h                              |   28 +
 Kernel/dump.sh                                |    1 +
 Kernel/include/abi.h                          |   91 +
 Kernel/include/bitmap.hpp                     |   33 +
 Kernel/include/boot/binfo.h                   |  147 +
 Kernel/include/boot/protocols/multiboot2.h    |  417 +
 Kernel/include/cargs.h                        |  187 +
 Kernel/include/convert.h                      |  133 +
 Kernel/include/cpu.hpp                        |  803 ++
 Kernel/include/cpu/arm/.gitkeep               |    0
 Kernel/include/cpu/membar.hpp                 |   73 +
 Kernel/include/cpu/signatures.hpp             |  108 +
 Kernel/include/cpu/x86/cpuid_amd.hpp          | 2159 ++++
 Kernel/include/cpu/x86/cpuid_intel.hpp        | 1420 +++
 Kernel/include/cpu/x86/exceptions.hpp         |   54 +
 Kernel/include/cpu/x86/hypervisor.hpp         |   80 +
 Kernel/include/cpu/x86/interrupts.hpp         |  300 +
 Kernel/include/cpu/x86/x32/cr.hpp             |  238 +
 Kernel/include/cpu/x86/x32/msr.hpp            |  426 +
 Kernel/include/cpu/x86/x64/cr.hpp             |  294 +
 Kernel/include/cpu/x86/x64/msr.hpp            |  427 +
 Kernel/include/crc32.h                        |   25 +
 Kernel/include/cwalk.h                        |  521 +
 Kernel/include/debug.h                        |  106 +
 Kernel/include/disk.hpp                       |  182 +
 Kernel/include/display.hpp                    |  165 +
 Kernel/include/driver.hpp                     |  142 +
 Kernel/include/dumper.hpp                     |   25 +
 Kernel/include/elf.h                          |  494 +
 Kernel/include/exec.hpp                       |  148 +
 Kernel/include/filesystem.hpp                 |  182 +
 Kernel/include/filesystem/ext2.hpp            |   91 +
 Kernel/include/filesystem/fat.hpp             |   77 +
 Kernel/include/filesystem/initrd.hpp          |   48 +
 Kernel/include/filesystem/mounts.hpp          |  114 +
 Kernel/include/filesystem/ustar.hpp           |   88 +
 Kernel/include/gui.hpp                        |  408 +
 Kernel/include/hashmap.hpp                    |  121 +
 Kernel/include/intrin.hpp                     |   80 +
 Kernel/include/ints.hpp                       |   78 +
 Kernel/include/io.h                           |  237 +
 Kernel/include/ipc.hpp                        |   92 +
 Kernel/include/kconfig.hpp                    |   40 +
 Kernel/include/lock.hpp                       |  159 +
 Kernel/include/md5.h                          |   54 +
 Kernel/include/memory.hpp                     |  898 ++
 Kernel/include/msexec.h                       |  248 +
 Kernel/include/net/arp.hpp                    |  106 +
 Kernel/include/net/dhcp.hpp                   |  182 +
 Kernel/include/net/dns.hpp                    |   37 +
 Kernel/include/net/eth.hpp                    |  108 +
 Kernel/include/net/icmpv4.hpp                 |   71 +
 Kernel/include/net/icmpv6.hpp                 |   56 +
 Kernel/include/net/ipv4.hpp                   |  137 +
 Kernel/include/net/ipv6.hpp                   |   44 +
 Kernel/include/net/nc.hpp                     |  116 +
 Kernel/include/net/net.hpp                    |  232 +
 Kernel/include/net/ntp.hpp                    |  166 +
 Kernel/include/net/tcp.hpp                    |   27 +
 Kernel/include/net/udp.hpp                    |   97 +
 Kernel/include/pci.hpp                        |  240 +
 Kernel/include/power.hpp                      |   70 +
 Kernel/include/printf.h                       |  194 +
 Kernel/include/rand.hpp                       |   31 +
 Kernel/include/recovery.hpp                   |   41 +
 Kernel/include/smart_ptr.hpp                  |   19 +
 Kernel/include/smp.hpp                        |   81 +
 Kernel/include/stb/image.h                    | 9370 +++++++++++++++++
 Kernel/include/stb/image_resize.h             | 2946 ++++++
 Kernel/include/symbols.hpp                    |   43 +
 Kernel/include/syscalls.hpp                   |   44 +
 Kernel/include/targp.h                        |   32 +
 Kernel/include/task.hpp                       |  356 +
 Kernel/include/time.hpp                       |  202 +
 Kernel/include/types.h                        |  372 +
 Kernel/include/uart.hpp                       |   88 +
 Kernel/include_std/assert.h                   |   50 +
 Kernel/include_std/atomic                     |   19 +
 Kernel/include_std/cstddef                    |   24 +
 Kernel/include_std/cstring                    |   19 +
 Kernel/include_std/dlfcn.h                    |   21 +
 Kernel/include_std/errno.h                    |   59 +
 Kernel/include_std/limits.h                   |  136 +
 Kernel/include_std/math.h                     |   21 +
 Kernel/include_std/pthread.h                  |   21 +
 Kernel/include_std/sched.h                    |   21 +
 Kernel/include_std/std.hpp                    |   77 +
 Kernel/include_std/std/atomic.hpp             |  521 +
 Kernel/include_std/std/functional.hpp         |   50 +
 Kernel/include_std/std/list.hpp               |  224 +
 Kernel/include_std/std/smart_ptr.hpp          |  292 +
 Kernel/include_std/std/stdexcept.hpp          |   36 +
 Kernel/include_std/std/string.hpp             |  553 +
 Kernel/include_std/std/unordered_map.hpp      |  131 +
 Kernel/include_std/std/utility.hpp            |   39 +
 Kernel/include_std/std/vector.hpp             |  284 +
 Kernel/include_std/stddef.h                   |   23 +
 Kernel/include_std/stdint.h                   |   21 +
 Kernel/include_std/stdio.h                    |   21 +
 Kernel/include_std/stdlib.h                   |   21 +
 Kernel/include_std/string.h                   |   21 +
 Kernel/include_std/string.hpp                 |   19 +
 Kernel/include_std/strings.h                  |   21 +
 Kernel/include_std/sys/stat.h                 |   21 +
 Kernel/include_std/sys/time.h                 |   21 +
 Kernel/include_std/sys/types.h                |   21 +
 Kernel/include_std/unistd.h                   |   21 +
 Kernel/include_std/vector                     |   19 +
 Kernel/include_std/wchar.h                    |   21 +
 Kernel/ipc.h                                  |  109 +
 Kernel/kernel.h                               |   80 +
 Kernel/syscalls.h                             |  326 +
 353 files changed, 77068 insertions(+)
 create mode 100644 Kernel/.github/workflows/flawfinder.yml
 create mode 100644 Kernel/.gitignore
 create mode 100644 Kernel/.vscode/c_boilerplates.code-snippets
 create mode 100644 Kernel/.vscode/c_cpp_properties.json
 create mode 100644 Kernel/.vscode/extensions.json
 create mode 100644 Kernel/.vscode/launch.json
 create mode 100644 Kernel/.vscode/settings.json
 create mode 100644 Kernel/Architecture/aarch64/Bootstrap/boot.S
 create mode 100644 Kernel/Architecture/aarch64/Entry.cpp
 create mode 100644 Kernel/Architecture/aarch64/SystemCalls.cpp
 create mode 100644 Kernel/Architecture/aarch64/cpu/SymmetricMultiprocessing.cpp
 create mode 100644 Kernel/Architecture/aarch64/linker.ld
 create mode 100644 Kernel/Architecture/aarch64/runtime/crt0.S
 create mode 100644 Kernel/Architecture/aarch64/runtime/crt1.S
 create mode 100644 Kernel/Architecture/aarch64/runtime/crtbegin.c
 create mode 100644 Kernel/Architecture/aarch64/runtime/crtend.c
 create mode 100644 Kernel/Architecture/aarch64/runtime/crti.S
 create mode 100644 Kernel/Architecture/aarch64/runtime/crtn.S
 create mode 100644 Kernel/Architecture/amd64/AdvancedConfigurationAndPowerInterface.cpp
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/GDT32.asm
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Header_Multiboot.asm
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Header_Multiboot2.asm
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Limine.c
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Multiboot.cpp
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Multiboot64bitMap.cpp
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Multiboot_Init.asm
 create mode 100644 Kernel/Architecture/amd64/Bootstrap/Multiboot_PageTable.asm
 create mode 100644 Kernel/Architecture/amd64/DifferentiatedSystemDescriptionTable.cpp
 create mode 100644 Kernel/Architecture/amd64/MultipleAPICDescriptionTable.cpp
 create mode 100644 Kernel/Architecture/amd64/SystemCalls.cpp
 create mode 100644 Kernel/Architecture/amd64/acpi.hpp
 create mode 100644 Kernel/Architecture/amd64/cpu/AdvancedProgrammableInterruptController.cpp
 create mode 100644 Kernel/Architecture/amd64/cpu/GlobalDescriptorTable.cpp
 create mode 100644 Kernel/Architecture/amd64/cpu/InterruptDescriptorTable.cpp
 create mode 100644 Kernel/Architecture/amd64/cpu/SMPTrampoline.asm
 create mode 100644 Kernel/Architecture/amd64/cpu/SymmetricMultiprocessing.cpp
 create mode 100644 Kernel/Architecture/amd64/cpu/apic.hpp
 create mode 100644 Kernel/Architecture/amd64/cpu/gdt.hpp
 create mode 100644 Kernel/Architecture/amd64/cpu/idt.hpp
 create mode 100644 Kernel/Architecture/amd64/linker.ld
 create mode 100644 Kernel/Architecture/amd64/runtime/crt0.c
 create mode 100644 Kernel/Architecture/amd64/runtime/crt1.c
 create mode 100644 Kernel/Architecture/amd64/runtime/crtbegin.c
 create mode 100644 Kernel/Architecture/amd64/runtime/crtend.c
 create mode 100644 Kernel/Architecture/amd64/runtime/crti.S
 create mode 100644 Kernel/Architecture/amd64/runtime/crtn.S
 create mode 100644 Kernel/Architecture/amd64/rust-target.json
 create mode 100644 Kernel/Architecture/i386/ArithmeticOperations.c
 create mode 100644 Kernel/Architecture/i386/Bootstrap/Header_Multiboot.asm
 create mode 100644 Kernel/Architecture/i386/Bootstrap/Header_Multiboot2.asm
 create mode 100644 Kernel/Architecture/i386/Bootstrap/Multiboot.cpp
 create mode 100644 Kernel/Architecture/i386/Bootstrap/Multiboot_Init.asm
 create mode 100644 Kernel/Architecture/i386/Bootstrap/Multiboot_PageTable.asm
 create mode 100644 Kernel/Architecture/i386/Interrupts/8259PIC.cpp
 create mode 100644 Kernel/Architecture/i386/Interrupts/pic.hpp
 create mode 100644 Kernel/Architecture/i386/SystemCalls.cpp
 create mode 100644 Kernel/Architecture/i386/acpi.hpp
 create mode 100644 Kernel/Architecture/i386/cpu/GlobalDescriptorTable.cpp
 create mode 100644 Kernel/Architecture/i386/cpu/SymmetricMultiprocessing.cpp
 create mode 100644 Kernel/Architecture/i386/cpu/apic.hpp
 create mode 100644 Kernel/Architecture/i386/cpu/gdt.hpp
 create mode 100644 Kernel/Architecture/i386/cpu/idt.hpp
 create mode 100644 Kernel/Architecture/i386/linker.ld
 create mode 100644 Kernel/Architecture/i386/runtime/crt0.c
 create mode 100644 Kernel/Architecture/i386/runtime/crt1.c
 create mode 100644 Kernel/Architecture/i386/runtime/crtbegin.c
 create mode 100644 Kernel/Architecture/i386/runtime/crtend.c
 create mode 100644 Kernel/Architecture/i386/runtime/crti.S
 create mode 100644 Kernel/Architecture/i386/runtime/crtn.S
 create mode 100644 Kernel/Core/CPU.cpp
 create mode 100644 Kernel/Core/Crash/CrashDetails.cpp
 create mode 100644 Kernel/Core/Crash/CrashHandler.cpp
 create mode 100644 Kernel/Core/Crash/KBDrv.cpp
 create mode 100644 Kernel/Core/Crash/SFrame.cpp
 create mode 100644 Kernel/Core/Crash/Screens/Console.cpp
 create mode 100644 Kernel/Core/Crash/Screens/Details.cpp
 create mode 100644 Kernel/Core/Crash/Screens/Main.cpp
 create mode 100644 Kernel/Core/Crash/Screens/StackFrame.cpp
 create mode 100644 Kernel/Core/Crash/Screens/Tasks.cpp
 create mode 100644 Kernel/Core/Crash/UserHandler.cpp
 create mode 100644 Kernel/Core/Crash/chfcts.hpp
 create mode 100644 Kernel/Core/Debugger.cpp
 create mode 100644 Kernel/Core/Disk.cpp
 create mode 100644 Kernel/Core/Driver/Driver.cpp
 create mode 100644 Kernel/Core/Driver/DriverAPI.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/BindInput.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/BindInterrupt.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/BindPCI.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/BindProcess.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Audio.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Display.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Filesystem.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Generic.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Input.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Network.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Input/Storage.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Audio.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Display.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Filesystem.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Generic.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Input.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Network.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Interrupt/Storage.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Audio.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Display.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Filesystem.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Generic.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Input.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Network.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/PCI/Storage.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Audio.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Display.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Filesystem.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Generic.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Input.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Network.cpp
 create mode 100644 Kernel/Core/Driver/DriverBinding/Process/Storage.cpp
 create mode 100644 Kernel/Core/Driver/api.hpp
 create mode 100644 Kernel/Core/InterruptsManager.cpp
 create mode 100644 Kernel/Core/Lock.cpp
 create mode 100644 Kernel/Core/Memory/HeapAllocators/Xalloc/README.md
 create mode 100644 Kernel/Core/Memory/HeapAllocators/Xalloc/Wrapper.cpp
 create mode 100644 Kernel/Core/Memory/HeapAllocators/Xalloc/Xalloc.hpp
 create mode 100644 Kernel/Core/Memory/HeapAllocators/Xalloc/XallocV1.cpp
 create mode 100644 Kernel/Core/Memory/Memory.cpp
 create mode 100644 Kernel/Core/Memory/MemoryManager.cpp
 create mode 100644 Kernel/Core/Memory/PageMapIndexer.cpp
 create mode 100644 Kernel/Core/Memory/PhysicalMemoryManager.cpp
 create mode 100644 Kernel/Core/Memory/StackGuard.cpp
 create mode 100644 Kernel/Core/Memory/VirtualMemoryManager.cpp
 create mode 100644 Kernel/Core/PeripheralComponentInterconnect.cpp
 create mode 100644 Kernel/Core/Power.cpp
 create mode 100644 Kernel/Core/README.md
 create mode 100644 Kernel/Core/Random.cpp
 create mode 100644 Kernel/Core/StackGuard.cpp
 create mode 100644 Kernel/Core/Symbols.cpp
 create mode 100644 Kernel/Core/SystemManagementBIOS.cpp
 create mode 100644 Kernel/Core/Time/HighPrecisionEventTimer.cpp
 create mode 100644 Kernel/Core/Time/Time.cpp
 create mode 100644 Kernel/Core/Time/TimeStampCounter.cpp
 create mode 100644 Kernel/Core/Time/Timer.cpp
 create mode 100644 Kernel/Core/UndefinedBehaviorSanitization.c
 create mode 100644 Kernel/Core/UniversalAsynchronousReceiverTransmitter.cpp
 create mode 100644 Kernel/Core/Video/Display.cpp
 create mode 100644 Kernel/Core/Video/Font.cpp
 create mode 100644 Kernel/Core/crashhandler.hpp
 create mode 100644 Kernel/Core/smbios.hpp
 create mode 100644 Kernel/Core/ubsan.h
 create mode 100644 Kernel/DAPI.hpp
 create mode 100644 Kernel/Doxyfile
 create mode 100644 Kernel/Execute/Elf/BaseLoad.cpp
 create mode 100644 Kernel/Execute/Elf/Dyn.cpp
 create mode 100644 Kernel/Execute/Elf/Exec.cpp
 create mode 100644 Kernel/Execute/Elf/Parse.cpp
 create mode 100644 Kernel/Execute/Elf/Rel.cpp
 create mode 100644 Kernel/Execute/Elf/SharedObjects.cpp
 create mode 100644 Kernel/Execute/Fex/BaseLoad.cpp
 create mode 100644 Kernel/Execute/Parse.cpp
 create mode 100644 Kernel/Execute/Spawn.cpp
 create mode 100644 Kernel/Fex.hpp
 create mode 100644 Kernel/FileSystem/FS/ustar.cpp
 create mode 100644 Kernel/FileSystem/Filesystem.cpp
 create mode 100644 Kernel/Files/tamsyn-font-1.11/LICENSE
 create mode 100644 Kernel/Files/tamsyn-font-1.11/README
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn10x20b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn10x20r.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn5x9b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn5x9r.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn6x12b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn6x12r.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn7x13b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn7x13r.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn7x14b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn7x14r.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn8x15b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn8x15r.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn8x16b.psf
 create mode 100644 Kernel/Files/tamsyn-font-1.11/Tamsyn8x16r.psf
 create mode 100644 Kernel/GUI/GUITools.cpp
 create mode 100644 Kernel/GUI/GraphicalUserInterface.cpp
 create mode 100644 Kernel/GUI/Icons.cpp
 create mode 100644 Kernel/GUI/WidgetEvents.cpp
 create mode 100644 Kernel/GUI/Widgets.cpp
 create mode 100644 Kernel/GUI/Window.cpp
 create mode 100644 Kernel/GUI/WindowEvents.cpp
 create mode 100644 Kernel/GUI/icons.hpp
 create mode 100644 Kernel/Kernel.cpp
 create mode 100644 Kernel/KernelConfig.cpp
 create mode 100644 Kernel/KernelThread.cpp
 create mode 100644 Kernel/LICENSE
 create mode 100644 Kernel/Library/Bitmap.cpp
 create mode 100644 Kernel/Library/Convert.cpp
 create mode 100644 Kernel/Library/CyclicRedundancyCheck32.c
 create mode 100644 Kernel/Library/MemOp.c
 create mode 100644 Kernel/Library/MemoryCopySIMD.cpp
 create mode 100644 Kernel/Library/MemoryMoveSIMD.cpp
 create mode 100644 Kernel/Library/MemorySetSIMD.cpp
 create mode 100644 Kernel/Library/cargs.c
 create mode 100644 Kernel/Library/cwalk.c
 create mode 100644 Kernel/Library/cxxabi.cpp
 create mode 100644 Kernel/Library/dumper.cpp
 create mode 100644 Kernel/Library/errno.cpp
 create mode 100644 Kernel/Library/liballoc_1_1.c
 create mode 100644 Kernel/Library/liballoc_1_1.h
 create mode 100644 Kernel/Library/liballocimpl.cpp
 create mode 100644 Kernel/Library/md5.c
 create mode 100644 Kernel/Library/printf.c
 create mode 100644 Kernel/Library/targp.c
 create mode 100644 Kernel/Makefile
 create mode 100644 Kernel/Network/AddressResolutionProtocol.cpp
 create mode 100644 Kernel/Network/Checksum.cpp
 create mode 100644 Kernel/Network/DomainNameSystem.cpp
 create mode 100644 Kernel/Network/DynamicHostConfigurationProtocol.cpp
 create mode 100644 Kernel/Network/Ethernet.cpp
 create mode 100644 Kernel/Network/InternetControlMessageProtocol.cpp
 create mode 100644 Kernel/Network/InternetProtocol.cpp
 create mode 100644 Kernel/Network/NetworkController.cpp
 create mode 100644 Kernel/Network/NetworkDebugger.cpp
 create mode 100644 Kernel/Network/NetworkTimeProtocol.cpp
 create mode 100644 Kernel/Network/TransmissionControlProtocol.cpp
 create mode 100644 Kernel/Network/UserDatagramProtocol.cpp
 create mode 100644 Kernel/Profiling/cyg.cpp
 create mode 100644 Kernel/Profiling/gcov.cpp
 create mode 100644 Kernel/Profiling/gprof.cpp
 create mode 100644 Kernel/README.md
 create mode 100644 Kernel/Recovery/RecoveryMain.cpp
 create mode 100644 Kernel/SystemCalls/Linux.cpp
 create mode 100644 Kernel/SystemCalls/Native.cpp
 create mode 100644 Kernel/SystemCalls/Syscalls.cpp
 create mode 100644 Kernel/Tasking/InterProcessCommunication.cpp
 create mode 100644 Kernel/Tasking/Scheduler.cpp
 create mode 100644 Kernel/Tasking/Security.cpp
 create mode 100644 Kernel/Tasking/Task.cpp
 create mode 100644 Kernel/Tests/CPUID.cpp
 create mode 100644 Kernel/Tests/Marco.cpp
 create mode 100644 Kernel/Tests/MemoryAllocation.cpp
 create mode 100644 Kernel/Tests/MemoryOperations.cpp
 create mode 100644 Kernel/Tests/RandomNumberGenerator.cpp
 create mode 100644 Kernel/Tests/String.cpp
 create mode 100644 Kernel/Tests/TypeSize.cpp
 create mode 100644 Kernel/Tests/std.cpp
 create mode 100644 Kernel/Tests/t.h
 create mode 100755 Kernel/dump.sh
 create mode 100644 Kernel/include/abi.h
 create mode 100644 Kernel/include/bitmap.hpp
 create mode 100644 Kernel/include/boot/binfo.h
 create mode 100644 Kernel/include/boot/protocols/multiboot2.h
 create mode 100644 Kernel/include/cargs.h
 create mode 100644 Kernel/include/convert.h
 create mode 100644 Kernel/include/cpu.hpp
 create mode 100644 Kernel/include/cpu/arm/.gitkeep
 create mode 100644 Kernel/include/cpu/membar.hpp
 create mode 100644 Kernel/include/cpu/signatures.hpp
 create mode 100644 Kernel/include/cpu/x86/cpuid_amd.hpp
 create mode 100644 Kernel/include/cpu/x86/cpuid_intel.hpp
 create mode 100644 Kernel/include/cpu/x86/exceptions.hpp
 create mode 100644 Kernel/include/cpu/x86/hypervisor.hpp
 create mode 100644 Kernel/include/cpu/x86/interrupts.hpp
 create mode 100644 Kernel/include/cpu/x86/x32/cr.hpp
 create mode 100644 Kernel/include/cpu/x86/x32/msr.hpp
 create mode 100644 Kernel/include/cpu/x86/x64/cr.hpp
 create mode 100644 Kernel/include/cpu/x86/x64/msr.hpp
 create mode 100644 Kernel/include/crc32.h
 create mode 100644 Kernel/include/cwalk.h
 create mode 100644 Kernel/include/debug.h
 create mode 100644 Kernel/include/disk.hpp
 create mode 100644 Kernel/include/display.hpp
 create mode 100644 Kernel/include/driver.hpp
 create mode 100644 Kernel/include/dumper.hpp
 create mode 100644 Kernel/include/elf.h
 create mode 100644 Kernel/include/exec.hpp
 create mode 100644 Kernel/include/filesystem.hpp
 create mode 100644 Kernel/include/filesystem/ext2.hpp
 create mode 100644 Kernel/include/filesystem/fat.hpp
 create mode 100644 Kernel/include/filesystem/initrd.hpp
 create mode 100644 Kernel/include/filesystem/mounts.hpp
 create mode 100644 Kernel/include/filesystem/ustar.hpp
 create mode 100644 Kernel/include/gui.hpp
 create mode 100644 Kernel/include/hashmap.hpp
 create mode 100644 Kernel/include/intrin.hpp
 create mode 100644 Kernel/include/ints.hpp
 create mode 100644 Kernel/include/io.h
 create mode 100644 Kernel/include/ipc.hpp
 create mode 100644 Kernel/include/kconfig.hpp
 create mode 100644 Kernel/include/lock.hpp
 create mode 100644 Kernel/include/md5.h
 create mode 100644 Kernel/include/memory.hpp
 create mode 100644 Kernel/include/msexec.h
 create mode 100644 Kernel/include/net/arp.hpp
 create mode 100644 Kernel/include/net/dhcp.hpp
 create mode 100644 Kernel/include/net/dns.hpp
 create mode 100644 Kernel/include/net/eth.hpp
 create mode 100644 Kernel/include/net/icmpv4.hpp
 create mode 100644 Kernel/include/net/icmpv6.hpp
 create mode 100644 Kernel/include/net/ipv4.hpp
 create mode 100644 Kernel/include/net/ipv6.hpp
 create mode 100644 Kernel/include/net/nc.hpp
 create mode 100644 Kernel/include/net/net.hpp
 create mode 100644 Kernel/include/net/ntp.hpp
 create mode 100644 Kernel/include/net/tcp.hpp
 create mode 100644 Kernel/include/net/udp.hpp
 create mode 100644 Kernel/include/pci.hpp
 create mode 100644 Kernel/include/power.hpp
 create mode 100644 Kernel/include/printf.h
 create mode 100644 Kernel/include/rand.hpp
 create mode 100644 Kernel/include/recovery.hpp
 create mode 100644 Kernel/include/smart_ptr.hpp
 create mode 100644 Kernel/include/smp.hpp
 create mode 100644 Kernel/include/stb/image.h
 create mode 100644 Kernel/include/stb/image_resize.h
 create mode 100644 Kernel/include/symbols.hpp
 create mode 100644 Kernel/include/syscalls.hpp
 create mode 100644 Kernel/include/targp.h
 create mode 100644 Kernel/include/task.hpp
 create mode 100644 Kernel/include/time.hpp
 create mode 100644 Kernel/include/types.h
 create mode 100644 Kernel/include/uart.hpp
 create mode 100644 Kernel/include_std/assert.h
 create mode 100644 Kernel/include_std/atomic
 create mode 100644 Kernel/include_std/cstddef
 create mode 100644 Kernel/include_std/cstring
 create mode 100644 Kernel/include_std/dlfcn.h
 create mode 100644 Kernel/include_std/errno.h
 create mode 100644 Kernel/include_std/limits.h
 create mode 100644 Kernel/include_std/math.h
 create mode 100644 Kernel/include_std/pthread.h
 create mode 100644 Kernel/include_std/sched.h
 create mode 100644 Kernel/include_std/std.hpp
 create mode 100644 Kernel/include_std/std/atomic.hpp
 create mode 100644 Kernel/include_std/std/functional.hpp
 create mode 100644 Kernel/include_std/std/list.hpp
 create mode 100644 Kernel/include_std/std/smart_ptr.hpp
 create mode 100644 Kernel/include_std/std/stdexcept.hpp
 create mode 100644 Kernel/include_std/std/string.hpp
 create mode 100644 Kernel/include_std/std/unordered_map.hpp
 create mode 100644 Kernel/include_std/std/utility.hpp
 create mode 100644 Kernel/include_std/std/vector.hpp
 create mode 100644 Kernel/include_std/stddef.h
 create mode 100644 Kernel/include_std/stdint.h
 create mode 100644 Kernel/include_std/stdio.h
 create mode 100644 Kernel/include_std/stdlib.h
 create mode 100644 Kernel/include_std/string.h
 create mode 100644 Kernel/include_std/string.hpp
 create mode 100644 Kernel/include_std/strings.h
 create mode 100644 Kernel/include_std/sys/stat.h
 create mode 100644 Kernel/include_std/sys/time.h
 create mode 100644 Kernel/include_std/sys/types.h
 create mode 100644 Kernel/include_std/unistd.h
 create mode 100644 Kernel/include_std/vector
 create mode 100644 Kernel/include_std/wchar.h
 create mode 100644 Kernel/ipc.h
 create mode 100644 Kernel/kernel.h
 create mode 100644 Kernel/syscalls.h

diff --git a/Kernel/.github/workflows/flawfinder.yml b/Kernel/.github/workflows/flawfinder.yml
new file mode 100644
index 00000000..9aab577d
--- /dev/null
+++ b/Kernel/.github/workflows/flawfinder.yml
@@ -0,0 +1,38 @@
+# This workflow uses actions that are not certified by GitHub.
+# They are provided by a third-party and are governed by
+# separate terms of service, privacy policy, and support
+# documentation.
+
+name: flawfinder
+
+on:
+  push:
+    branches: [ "main" ]
+  pull_request:
+    # The branches below must be a subset of the branches above
+    branches: [ "main" ]
+  schedule:
+    - cron: '21 1 * * 1'
+
+jobs:
+  flawfinder:
+    name: Flawfinder
+    runs-on: ubuntu-latest
+    permissions:
+      actions: read
+      contents: read
+      security-events: write
+    steps:
+      - name: Checkout code
+        uses: actions/checkout@v3
+
+      - name: flawfinder_scan
+        uses: david-a-wheeler/flawfinder@8e4a779ad59dbfaee5da586aa9210853b701959c
+        with:
+          arguments: '--sarif ./'
+          output: 'flawfinder_results.sarif'
+
+      - name: Upload analysis results to GitHub Security tab
+        uses: github/codeql-action/upload-sarif@v2
+        with:
+          sarif_file: ${{github.workspace}}/flawfinder_results.sarif
diff --git a/Kernel/.gitignore b/Kernel/.gitignore
new file mode 100644
index 00000000..7379e127
--- /dev/null
+++ b/Kernel/.gitignore
@@ -0,0 +1,7 @@
+*.o
+*.su
+*.gcno
+*.map
+*.fsys
+*.log
+.dccache
diff --git a/Kernel/.vscode/c_boilerplates.code-snippets b/Kernel/.vscode/c_boilerplates.code-snippets
new file mode 100644
index 00000000..c91ee465
--- /dev/null
+++ b/Kernel/.vscode/c_boilerplates.code-snippets
@@ -0,0 +1,69 @@
+{
+	"Fennix Kernel Header": {
+		"prefix": [
+			"head",
+		],
+		"body": [
+			"/*",
+			"   This file is part of Fennix Kernel.",
+			"",
+			"   Fennix Kernel is free software: you can redistribute it and/or",
+			"   modify it under the terms of the GNU General Public License as",
+			"   published by the Free Software Foundation, either version 3 of",
+			"   the License, or (at your option) any later version.",
+			"",
+			"   Fennix Kernel is distributed in the hope that it will be useful,",
+			"   but WITHOUT ANY WARRANTY; without even the implied warranty of",
+			"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the",
+			"   GNU General Public License for more details.",
+			"",
+			"   You should have received a copy of the GNU General Public License",
+			"   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.",
+			"*/",
+			"",
+			"#ifndef __FENNIX_KERNEL_${2:header}_H__",
+			"#define __FENNIX_KERNEL_${2:header}_H__",
+			"",
+			"#include <types.h>",
+			"",
+			"$0",
+			"",
+			"#endif // !__FENNIX_KERNEL_${2:header}_H__",
+			""
+		],
+		"description": "Create kernel header."
+	},
+	"Fennix Kernel brief": {
+		"prefix": [
+			"brief",
+		],
+		"body": [
+			"/** @brief $0 */"
+		],
+		"description": "Create kernel documentation brief."
+	},
+	"License": {
+		"prefix": [
+			"license",
+		],
+		"body": [
+			"/*",
+			"   This file is part of Fennix Kernel.",
+			"",
+			"   Fennix Kernel is free software: you can redistribute it and/or",
+			"   modify it under the terms of the GNU General Public License as",
+			"   published by the Free Software Foundation, either version 3 of",
+			"   the License, or (at your option) any later version.",
+			"",
+			"   Fennix Kernel is distributed in the hope that it will be useful,",
+			"   but WITHOUT ANY WARRANTY; without even the implied warranty of",
+			"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the",
+			"   GNU General Public License for more details.",
+			"",
+			"   You should have received a copy of the GNU General Public License",
+			"   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.",
+			"*/"
+		],
+		"description": "Create kernel license."
+	}
+}
diff --git a/Kernel/.vscode/c_cpp_properties.json b/Kernel/.vscode/c_cpp_properties.json
new file mode 100644
index 00000000..ffff0894
--- /dev/null
+++ b/Kernel/.vscode/c_cpp_properties.json
@@ -0,0 +1,219 @@
+{
+    "configurations": [
+        {
+            "name": "Fennix x64 (Linux, GCC, debug)",
+            "includePath": [
+                "${workspaceFolder}/include",
+                "${workspaceFolder}/include/**",
+                "${workspaceFolder}/include_std",
+                "${workspaceFolder}/include_std/**"
+            ],
+            "defines": [
+                "__debug_vscode__",
+                "KERNEL_NAME=\"Fennix\"",
+                "KERNEL_VERSION=\"1.0\"",
+                "GIT_COMMIT=\"0000000000000000000000000000000000000000\"",
+                "GIT_COMMIT_SHORT=\"0000000\"",
+                "a64",
+                "a86",
+                "DEBUG=\"1\""
+            ],
+            "compilerPath": "${workspaceFolder}/../tools/cross/bin/amd64-elf-gcc",
+            "cStandard": "c17",
+            "cppStandard": "c++20",
+            "intelliSenseMode": "gcc-x64",
+            "configurationProvider": "ms-vscode.makefile-tools",
+            "compilerArgs": [
+                // Compiler flags
+                "-fno-pic",
+                "-fno-pie",
+                "-mno-red-zone",
+                "-march=core2",
+                "-pipe",
+                "-mcmodel=kernel",
+                "-fno-builtin",
+
+                // Warnings
+                "-Wall",
+                "-Wextra",
+                "-Wfloat-equal",
+                "-Wpointer-arith",
+                "-Wcast-align",
+                "-Wredundant-decls",
+                "-Winit-self",
+                "-Wswitch-default",
+                "-Wstrict-overflow=5",
+                "-Wconversion",
+
+                // C++ flags
+                "-fno-rtti",
+                "-fexceptions",
+
+                // Linker flags
+                "-T${workspaceFolder}/Architecture/amd64/linker.ld",
+                "-Wl,-static,--no-dynamic-linker,-ztext",
+                "-nostdlib",
+                "-nodefaultlibs",
+                "-nolibc",
+                "-zmax-page-size=0x1000",
+                "-shared",
+
+                // Debug flags
+                "-ggdb3",
+                "-O0",
+                "-fdiagnostics-color=always",
+                "-fverbose-asm",
+                "-fstack-usage",
+                "-fstack-check",
+                "-fsanitize=undefined",
+
+                // VSCode flags
+                "-ffreestanding",
+                "-nostdinc",
+                "-nostdinc++"
+            ]
+        },
+        {
+            "name": "Fennix x32 (Linux, GCC, debug)",
+            "includePath": [
+                "${workspaceFolder}/include",
+                "${workspaceFolder}/include/**",
+                "${workspaceFolder}/include_std",
+                "${workspaceFolder}/include_std/**"
+            ],
+            "defines": [
+                "__debug_vscode__",
+                "KERNEL_NAME=\"Fennix\"",
+                "KERNEL_VERSION=\"1.0\"",
+                "GIT_COMMIT=\"0000000000000000000000000000000000000000\"",
+                "GIT_COMMIT_SHORT=\"0000000\"",
+                "a32",
+                "a86",
+                "DEBUG=\"1\""
+            ],
+            "compilerPath": "${workspaceFolder}/../tools/cross/bin/i386-elf-gcc",
+            "cStandard": "c17",
+            "cppStandard": "c++20",
+            "intelliSenseMode": "gcc-x86",
+            "configurationProvider": "ms-vscode.makefile-tools",
+            "compilerArgs": [
+                // Compiler flags
+                "-fno-pic",
+                "-fno-pie",
+                "-mno-80387",
+                "-mno-mmx",
+                "-mno-3dnow",
+                "-mno-red-zone",
+                "-march=pentium",
+                "-pipe",
+                "-msoft-float",
+                "-fno-builtin",
+
+                // Warnings
+                "-Wall",
+                "-Wextra",
+                "-Wfloat-equal",
+                "-Wpointer-arith",
+                "-Wcast-align",
+                "-Wredundant-decls",
+                "-Winit-self",
+                "-Wswitch-default",
+                "-Wstrict-overflow=5",
+                "-Wconversion",
+
+                // C++ flags
+                "-fno-rtti",
+                "-fexceptions",
+
+                // Linker flags
+                "-T${workspaceFolder}/Architecture/i386/linker.ld",
+                "-Wl,-static,--no-dynamic-linker,-ztext",
+                "-nostdlib",
+                "-nodefaultlibs",
+                "-nolibc",
+                "-zmax-page-size=0x1000",
+                "-shared",
+
+                // Debug flags
+                "-ggdb3",
+                "-O0",
+                "-fdiagnostics-color=always",
+                "-fverbose-asm",
+                "-fstack-usage",
+                "-fstack-check",
+                "-fsanitize=undefined",
+
+                // VSCode flags
+                "-ffreestanding",
+                "-nostdinc",
+                "-nostdinc++"
+            ]
+        },
+        {
+            "name": "Fennix Aarch64 (Linux, GCC, debug)",
+            "includePath": [
+                "${workspaceFolder}/include",
+                "${workspaceFolder}/include/**",
+                "${workspaceFolder}/include_std",
+                "${workspaceFolder}/include_std/**"
+            ],
+            "defines": [
+                "__debug_vscode__",
+                "KERNEL_NAME=\"Fennix\"",
+                "KERNEL_VERSION=\"1.0\"",
+                "GIT_COMMIT=\"0000000000000000000000000000000000000000\"",
+                "GIT_COMMIT_SHORT=\"0000000\"",
+                "aa64",
+                "DEBUG=\"1\""
+            ],
+            "compilerPath": "${workspaceFolder}/../tools/cross/bin/aarch64-elf-gcc",
+            "cStandard": "c17",
+            "cppStandard": "c++20",
+            "intelliSenseMode": "linux-gcc-arm64",
+            "configurationProvider": "ms-vscode.makefile-tools",
+            "compilerArgs": [
+                // Compiler flags
+                "-pipe",
+                "-fno-builtin",
+                "-msoft-float",
+                "-fPIC",
+                "-Wstack-protector",
+
+                // Warnings
+                "-Wall",
+                "-Wextra",
+                "-Wfloat-equal",
+                "-Wpointer-arith",
+                "-Wcast-align",
+                "-Wredundant-decls",
+                "-Winit-self",
+                "-Wswitch-default",
+                "-Wstrict-overflow=5",
+                "-Wconversion",
+
+                // C++ flags
+                "-fno-rtti",
+                "-fexceptions",
+
+                // Linker flags
+                "-T${workspaceFolder}/Architecture/aarch64/linker.ld",
+                "-fPIC",
+
+                // Debug flags
+                "-ggdb3",
+                "-O0",
+                "-fdiagnostics-color=always",
+                "-fverbose-asm",
+                "-fstack-usage",
+                "-fstack-check",
+                "-fsanitize=undefined",
+
+                // VSCode flags
+                "-ffreestanding",
+                "-nostdinc",
+                "-nostdinc++"
+            ]
+        }
+    ],
+    "version": 4
+}
\ No newline at end of file
diff --git a/Kernel/.vscode/extensions.json b/Kernel/.vscode/extensions.json
new file mode 100644
index 00000000..42ea9d06
--- /dev/null
+++ b/Kernel/.vscode/extensions.json
@@ -0,0 +1,13 @@
+{
+    "recommendations": [
+        "ms-vscode.cpptools",
+        "wayou.vscode-todo-highlight",
+        "gruntfuggly.todo-tree",
+        "13xforever.language-x86-64-assembly",
+        "webfreak.debug",
+        "zixuanwang.linkerscript",
+        "maziac.hex-hover-converter",
+        "cschlosser.doxdocgen",
+        "streetsidesoftware.code-spell-checker"
+    ]
+}
\ No newline at end of file
diff --git a/Kernel/.vscode/launch.json b/Kernel/.vscode/launch.json
new file mode 100644
index 00000000..80f2cb16
--- /dev/null
+++ b/Kernel/.vscode/launch.json
@@ -0,0 +1,40 @@
+{
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "name": "Attach to a running VM instance",
+            "type": "cppdbg",
+            "request": "launch",
+            "program": "${workspaceRoot}/kernel.fsys",
+            "cwd": "${workspaceRoot}",
+            "args": [],
+            "targetArchitecture": "x64",
+            "MIMode": "gdb",
+            "miDebuggerPath": "/usr/bin/gdb",
+            "miDebuggerArgs": "",
+            "externalConsole": false,
+            "additionalSOLibSearchPath": "${workspaceRoot}",
+            "customLaunchSetupCommands": [
+                {
+                    "text": "target remote localhost:1234",
+                    "description": "Connect to QEMU remote debugger"
+                }
+            ],
+            "setupCommands": [
+                {
+                    "description": "Enable pretty-printing for gdb",
+                    "text": "-enable-pretty-printing",
+                    "ignoreFailures": true
+                },
+                {
+                    "text": "set breakpoint pending on",
+                    "description": "Make breakpoint pending on future shared library load."
+                },
+                {
+                    "text": "file ${workspaceRoot}/kernel.fsys",
+                    "description": "Load binary."
+                },
+            ]
+        }
+    ]
+}
\ No newline at end of file
diff --git a/Kernel/.vscode/settings.json b/Kernel/.vscode/settings.json
new file mode 100644
index 00000000..2d09fa10
--- /dev/null
+++ b/Kernel/.vscode/settings.json
@@ -0,0 +1,19 @@
+{
+    "C_Cpp.errorSquiggles": "Enabled",
+    "C_Cpp.autocompleteAddParentheses": true,
+    "C_Cpp.codeAnalysis.clangTidy.enabled": true,
+    "C_Cpp.clang_format_style": "Visual Studio",
+    "C_Cpp.default.intelliSenseMode": "gcc-x64",
+    "C_Cpp.default.cStandard": "c17",
+    "C_Cpp.default.cppStandard": "c++20",
+    "C_Cpp.intelliSenseMemoryLimit": 16384,
+    "editor.smoothScrolling": true,
+    "editor.cursorSmoothCaretAnimation": "on",
+    "C_Cpp.codeAnalysis.clangTidy.checks.disabled": [
+        "clang-analyzer-security.insecureAPI.strcpy",
+        "clang-diagnostic-unknown-warning-option",
+        "clang-analyzer-security.insecureAPI.DeprecatedOrUnsafeBufferHandling",
+        "clang-diagnostic-implicit-exception-spec-mismatch",
+        "clang-diagnostic-unknown-attributes"
+    ]
+}
\ No newline at end of file
diff --git a/Kernel/Architecture/aarch64/Bootstrap/boot.S b/Kernel/Architecture/aarch64/Bootstrap/boot.S
new file mode 100644
index 00000000..45ec22f1
--- /dev/null
+++ b/Kernel/Architecture/aarch64/Bootstrap/boot.S
@@ -0,0 +1,36 @@
+/* Based on this tutorial:
+   https://github.com/s-matyukevich/raspberry-pi-os */
+
+.section ".text.boot"
+
+.extern _bss_start
+.extern _bss_end
+
+.extern arm64Entry
+memzero:
+    str xzr, [x0], #8
+    subs x1, x1, #8
+    b.gt memzero
+    ret
+
+.global _start
+_start:
+    mrs x0, mpidr_el1
+    and x0, x0, #0xFF
+    cbz x0, _start2
+    b CPU_Loop
+
+_start2:
+    adr x0, _bss_start
+    adr x1, _bss_end
+    sub x1, x1, x0
+    bl memzero
+    mov sp, #0x200000
+    bl arm64Entry
+
+Halt:
+    wfe
+    b Halt
+
+CPU_Loop:
+    b CPU_Loop
diff --git a/Kernel/Architecture/aarch64/Entry.cpp b/Kernel/Architecture/aarch64/Entry.cpp
new file mode 100644
index 00000000..857cea09
--- /dev/null
+++ b/Kernel/Architecture/aarch64/Entry.cpp
@@ -0,0 +1,27 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <types.h>
+
+#include <debug.h>
+#include <cpu.hpp>
+
+EXTERNC void arm64Entry(uint64_t dtb_ptr32, uint64_t x1, uint64_t x2, uint64_t x3)
+{
+    trace("Hello, World!");
+    CPU::Halt(true);
+}
diff --git a/Kernel/Architecture/aarch64/SystemCalls.cpp b/Kernel/Architecture/aarch64/SystemCalls.cpp
new file mode 100644
index 00000000..aea86378
--- /dev/null
+++ b/Kernel/Architecture/aarch64/SystemCalls.cpp
@@ -0,0 +1,31 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <syscalls.hpp>
+
+#include <cpu.hpp>
+
+extern "C" __naked __used __no_stack_protector void SystemCallHandlerStub()
+{
+
+}
+
+extern "C" uint64_t SystemCallsHandler(SyscallsFrame *regs);
+
+void InitializeSystemCalls()
+{
+}
diff --git a/Kernel/Architecture/aarch64/cpu/SymmetricMultiprocessing.cpp b/Kernel/Architecture/aarch64/cpu/SymmetricMultiprocessing.cpp
new file mode 100644
index 00000000..f6c89b95
--- /dev/null
+++ b/Kernel/Architecture/aarch64/cpu/SymmetricMultiprocessing.cpp
@@ -0,0 +1,59 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <smp.hpp>
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <cpu.hpp>
+
+#include "../../../kernel.h"
+
+volatile bool CPUEnabled = false;
+
+#pragma GCC diagnostic ignored "-Wmissing-field-initializers"
+static __aligned(0x1000) CPUData CPUs[MAX_CPU] = {0};
+
+CPUData *GetCPU(uint64_t id) { return &CPUs[id]; }
+
+CPUData *GetCurrentCPU()
+{
+    uint64_t ret = 0;
+
+    if (!CPUs[ret].IsActive)
+    {
+        error("CPU %d is not active!", ret);
+        return &CPUs[0];
+    }
+
+    if (CPUs[ret].Checksum != CPU_DATA_CHECKSUM)
+    {
+        error("CPU %d data is corrupted!", ret);
+        return &CPUs[0];
+    }
+    return &CPUs[ret];
+}
+
+namespace SMP
+{
+    int CPUCores = 0;
+
+    void Initialize(void *madt)
+    {
+        fixme("SMP::Initialize() is not implemented!");
+    }
+}
diff --git a/Kernel/Architecture/aarch64/linker.ld b/Kernel/Architecture/aarch64/linker.ld
new file mode 100644
index 00000000..bb8c142e
--- /dev/null
+++ b/Kernel/Architecture/aarch64/linker.ld
@@ -0,0 +1,83 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+ENTRY(_start)
+
+SECTIONS
+{
+    .text.boot :
+    {
+        *(.text.boot)
+        . += CONSTANT(MAXPAGESIZE);
+        _bss_start = .;
+        *(.text.bss)
+        _bss_end = .;
+    }
+
+    _kernel_start = .;
+    .text :
+    {
+        KEEP(*(.text.boot))
+        *(.text .text.*)
+    }
+    . = ALIGN(4096);
+    _kernel_text_end = .;
+
+    .data :
+    {
+        *(.data .data.*)
+    }
+    . = ALIGN(4096);
+    _kernel_data_end = .;
+
+    .rodata :
+    {
+        *(.rodata .rodata.*)
+    }
+    . = ALIGN(4096);
+    _kernel_rodata_end = .;
+
+    .init_array :
+    {
+        PROVIDE_HIDDEN(__init_array_start = .);
+        KEEP(*(.init_array .ctors))
+        KEEP(*(SORT_BY_INIT_PRIORITY(.init_array.*) SORT_BY_INIT_PRIORITY(.ctors.*)))
+        PROVIDE_HIDDEN (__init_array_end = .);
+    }
+
+    .fini_array :
+    {
+        PROVIDE_HIDDEN(__fini_array_start = .);
+        KEEP(*(SORT_BY_INIT_PRIORITY(.fini_array.*) SORT_BY_INIT_PRIORITY(.dtors.*)))
+        KEEP(*(.fini_array .dtors))
+        PROVIDE_HIDDEN (__fini_array_end = .);
+    }
+
+    .bss :
+    {
+        *(.bss .bss.*)
+    }
+    . = ALIGN(4096);
+    _kernel_end = .;
+    _bss_size = _kernel_end - _kernel_rodata_end;
+
+    /DISCARD/ :
+    {
+        *(.comment*)
+        *(.note*)
+    }
+}
diff --git a/Kernel/Architecture/aarch64/runtime/crt0.S b/Kernel/Architecture/aarch64/runtime/crt0.S
new file mode 100644
index 00000000..ec4b0f0c
--- /dev/null
+++ b/Kernel/Architecture/aarch64/runtime/crt0.S
@@ -0,0 +1,17 @@
+// .section ".text.boot"
+// 
+// .global _start
+//     .org 0x80000
+// _start:
+//     ldr     x5, =_start
+//     mov     sp, x5
+//     ldr     x5, =_kernel_rodata_end
+//     ldr     w6, =_bss_size
+// 1:  cbz     w6, 2f
+//     str     xzr, [x5], #8
+//     sub     w6, w6, #1
+//     cbnz    w6, 1b
+// 2:  bl      arm64Entry
+// Halt:
+//     wfe
+//     b Halt
diff --git a/Kernel/Architecture/aarch64/runtime/crt1.S b/Kernel/Architecture/aarch64/runtime/crt1.S
new file mode 100644
index 00000000..d25abc91
--- /dev/null
+++ b/Kernel/Architecture/aarch64/runtime/crt1.S
@@ -0,0 +1,17 @@
+// .section ".text.boot"
+
+// .global _start
+//     .org 0x80000
+// _start:
+//     ldr     x5, =_start
+//     mov     sp, x5
+//     ldr     x5, =_kernel_rodata_end
+//     ldr     w6, =_bss_size
+// 1:  cbz     w6, 2f
+//     str     xzr, [x5], #8
+//     sub     w6, w6, #1
+//     cbnz    w6, 1b
+// 2:  bl      arm64Entry
+// Halt:
+//     wfe
+//     b Halt
diff --git a/Kernel/Architecture/aarch64/runtime/crtbegin.c b/Kernel/Architecture/aarch64/runtime/crtbegin.c
new file mode 100644
index 00000000..507125b3
--- /dev/null
+++ b/Kernel/Architecture/aarch64/runtime/crtbegin.c
@@ -0,0 +1 @@
+// C++ constructor/destructor stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/aarch64/runtime/crtend.c b/Kernel/Architecture/aarch64/runtime/crtend.c
new file mode 100644
index 00000000..507125b3
--- /dev/null
+++ b/Kernel/Architecture/aarch64/runtime/crtend.c
@@ -0,0 +1 @@
+// C++ constructor/destructor stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/aarch64/runtime/crti.S b/Kernel/Architecture/aarch64/runtime/crti.S
new file mode 100644
index 00000000..d3886db5
--- /dev/null
+++ b/Kernel/Architecture/aarch64/runtime/crti.S
@@ -0,0 +1,13 @@
+// .section .init
+// .global _init
+// .type _init, @function
+// _init:
+//	push %rbp
+//	movq %rsp, %rbp
+
+// .section .fini
+// .global _fini
+// .type _fini, @function
+// _fini:
+//	push %rbp
+//	movq %rsp, %rbp
diff --git a/Kernel/Architecture/aarch64/runtime/crtn.S b/Kernel/Architecture/aarch64/runtime/crtn.S
new file mode 100644
index 00000000..21c198b8
--- /dev/null
+++ b/Kernel/Architecture/aarch64/runtime/crtn.S
@@ -0,0 +1,7 @@
+.section .init
+//	popq %rbp
+	ret
+
+.section .fini
+//	popq %rbp
+	ret
diff --git a/Kernel/Architecture/amd64/AdvancedConfigurationAndPowerInterface.cpp b/Kernel/Architecture/amd64/AdvancedConfigurationAndPowerInterface.cpp
new file mode 100644
index 00000000..2d6499ac
--- /dev/null
+++ b/Kernel/Architecture/amd64/AdvancedConfigurationAndPowerInterface.cpp
@@ -0,0 +1,155 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "acpi.hpp"
+
+#include <debug.h>
+#include <io.h>
+
+#include "../../kernel.h"
+
+#pragma GCC diagnostic ignored "-Wint-to-pointer-cast"
+
+namespace ACPI
+{
+    void *ACPI::FindTable(ACPI::ACPIHeader *ACPIHeader, char *Signature)
+    {
+        for (uint64_t t = 0; t < ((ACPIHeader->Length - sizeof(ACPI::ACPIHeader)) / (XSDTSupported ? 8 : 4)); t++)
+        {
+            // TODO: Should I be concerned about unaligned memory access?
+            ACPI::ACPIHeader *SDTHdr = nullptr;
+            if (XSDTSupported)
+                SDTHdr = (ACPI::ACPIHeader *)(*(uint64_t *)((uint64_t)ACPIHeader + sizeof(ACPI::ACPIHeader) + (t * 8)));
+            else
+                SDTHdr = (ACPI::ACPIHeader *)(*(uint32_t *)((uint64_t)ACPIHeader + sizeof(ACPI::ACPIHeader) + (t * 4)));
+
+            for (int i = 0; i < 4; i++)
+            {
+                if (SDTHdr->Signature[i] != Signature[i])
+                    break;
+                if (i == 3)
+                {
+                    trace("%s found at address %p", Signature, (uintptr_t)SDTHdr);
+                    return SDTHdr;
+                }
+            }
+        }
+        // warn("%s not found!", Signature);
+        return nullptr;
+    }
+
+    void ACPI::SearchTables(ACPIHeader *Header)
+    {
+        if (!Header)
+            return;
+
+        HPET = (HPETHeader *)FindTable(Header, (char *)"HPET");
+        FADT = (FADTHeader *)FindTable(Header, (char *)"FACP");
+        MCFG = (MCFGHeader *)FindTable(Header, (char *)"MCFG");
+        BGRT = (BGRTHeader *)FindTable(Header, (char *)"BGRT");
+        SRAT = (SRATHeader *)FindTable(Header, (char *)"SRAT");
+        TPM2 = (TPM2Header *)FindTable(Header, (char *)"TPM2");
+        TCPA = (TCPAHeader *)FindTable(Header, (char *)"TCPA");
+        WAET = (WAETHeader *)FindTable(Header, (char *)"WAET");
+        MADT = (MADTHeader *)FindTable(Header, (char *)"APIC");
+        HEST = (HESTHeader *)FindTable(Header, (char *)"HEST");
+        FindTable(Header, (char *)"BERT");
+        FindTable(Header, (char *)"CPEP");
+        FindTable(Header, (char *)"DSDT");
+        FindTable(Header, (char *)"ECDT");
+        FindTable(Header, (char *)"EINJ");
+        FindTable(Header, (char *)"ERST");
+        FindTable(Header, (char *)"FACS");
+        FindTable(Header, (char *)"MSCT");
+        FindTable(Header, (char *)"MPST");
+        FindTable(Header, (char *)"OEMx");
+        FindTable(Header, (char *)"PMTT");
+        FindTable(Header, (char *)"PSDT");
+        FindTable(Header, (char *)"RASF");
+        FindTable(Header, (char *)"RSDT");
+        FindTable(Header, (char *)"SBST");
+        FindTable(Header, (char *)"SLIT");
+        FindTable(Header, (char *)"SSDT");
+        FindTable(Header, (char *)"XSDT");
+        FindTable(Header, (char *)"DRTM");
+        FindTable(Header, (char *)"FPDT");
+        FindTable(Header, (char *)"GTDT");
+        FindTable(Header, (char *)"PCCT");
+        FindTable(Header, (char *)"S3PT");
+        FindTable(Header, (char *)"MATR");
+        FindTable(Header, (char *)"MSDM");
+        FindTable(Header, (char *)"WPBT");
+        FindTable(Header, (char *)"OSDT");
+        FindTable(Header, (char *)"RSDP");
+        FindTable(Header, (char *)"NFIT");
+        FindTable(Header, (char *)"ASF!");
+        FindTable(Header, (char *)"BOOT");
+        FindTable(Header, (char *)"CSRT");
+        FindTable(Header, (char *)"DBG2");
+        FindTable(Header, (char *)"DBGP");
+        FindTable(Header, (char *)"DMAR");
+        FindTable(Header, (char *)"IBFT");
+        FindTable(Header, (char *)"IORT");
+        FindTable(Header, (char *)"IVRS");
+        FindTable(Header, (char *)"LPIT");
+        FindTable(Header, (char *)"MCHI");
+        FindTable(Header, (char *)"MTMR");
+        FindTable(Header, (char *)"SLIC");
+        FindTable(Header, (char *)"SPCR");
+        FindTable(Header, (char *)"SPMI");
+        FindTable(Header, (char *)"UEFI");
+        FindTable(Header, (char *)"VRTC");
+        FindTable(Header, (char *)"WDAT");
+        FindTable(Header, (char *)"WDDT");
+        FindTable(Header, (char *)"WDRT");
+        FindTable(Header, (char *)"ATKG");
+        FindTable(Header, (char *)"GSCI");
+        FindTable(Header, (char *)"IEIT");
+        FindTable(Header, (char *)"HMAT");
+        FindTable(Header, (char *)"CEDT");
+        FindTable(Header, (char *)"AEST");
+    }
+
+    ACPI::ACPI()
+    {
+        trace("Initializing ACPI");
+        if (bInfo.RSDP->Revision >= 2 && bInfo.RSDP->XSDTAddress)
+        {
+            debug("XSDT supported");
+            XSDTSupported = true;
+            XSDT = (ACPIHeader *)(bInfo.RSDP->XSDTAddress);
+        }
+        else
+        {
+            debug("RSDT supported");
+            XSDT = (ACPIHeader *)(uintptr_t)bInfo.RSDP->RSDTAddress;
+        }
+
+        this->SearchTables(XSDT);
+
+        if (FADT)
+        {
+            outb(s_cst(uint16_t, FADT->SMI_CommandPort), FADT->AcpiEnable);
+            while (!(inw(s_cst(uint16_t, FADT->PM1aControlBlock)) & 1))
+                ;
+        }
+    }
+
+    ACPI::~ACPI()
+    {
+    }
+}
diff --git a/Kernel/Architecture/amd64/Bootstrap/GDT32.asm b/Kernel/Architecture/amd64/Bootstrap/GDT32.asm
new file mode 100644
index 00000000..e9fa9804
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/GDT32.asm
@@ -0,0 +1,47 @@
+[bits 32]
+section .bootstrap.text
+
+align 32
+global gdtr
+gdtr:
+    dw GDT32_END - GDT32 - 1
+    dd GDT32
+
+align 32
+GDT32:
+    dq 0x0
+
+    dw 0xffff
+    dw 0x0000
+    db 0x00
+    dw 0xcf9a
+    db 0x00
+
+    dw 0xffff
+    dw 0x0000
+    db 0x00
+    dw 0xcf92
+    db 0x00
+
+    dw 0x0100
+    dw 0x1000
+    db 0x00
+    dw 0x4092
+    db 0x00
+GDT32_END:
+
+global LoadGDT32
+LoadGDT32:
+	lgdt [gdtr]
+
+	jmp 0x8:ActivateGDT
+	ActivateGDT:
+		mov cx, 0x10
+		mov ss, cx
+		mov ds, cx
+		mov es, cx
+		mov fs, cx
+		mov cx, 0x18
+		mov gs, cx
+
+    ret
diff --git a/Kernel/Architecture/amd64/Bootstrap/Header_Multiboot.asm b/Kernel/Architecture/amd64/Bootstrap/Header_Multiboot.asm
new file mode 100644
index 00000000..71a6efe8
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Header_Multiboot.asm
@@ -0,0 +1,5 @@
+section .multiboot
+align 4
+    dd 0x1BADB002
+    dd 1 << 0 | 1 << 1
+    dd -(0x1BADB002 + (1 << 0 | 1 << 1))
diff --git a/Kernel/Architecture/amd64/Bootstrap/Header_Multiboot2.asm b/Kernel/Architecture/amd64/Bootstrap/Header_Multiboot2.asm
new file mode 100644
index 00000000..756dcb89
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Header_Multiboot2.asm
@@ -0,0 +1,64 @@
+; https://www.gnu.org/software/grub/manual/multiboot2/multiboot.html
+section .multiboot2
+align 4096
+HEADER_START:
+    dd 0xE85250D6
+    dd 0
+    dd (HEADER_END - HEADER_START)
+    dd 0x100000000 - (HEADER_END - HEADER_START) - 0 - 0xE85250D6
+align 8
+MB2_INFO_REQUEST_TAG_START:
+    dw 1
+    dw 0
+    dd MB2_INFO_REQUEST_TAG_END - MB2_INFO_REQUEST_TAG_START
+    dd 1 ; Command Line
+    dd 2 ; Boot Loader Name
+    dd 3 ; Module
+    dd 4 ; Basic Memory Information
+    dd 5 ; BIOS Boot Device
+    dd 6 ; Memory Map
+    dd 7 ; VBE
+    dd 8 ; Framebuffer
+    dd 9 ; ELF Sections
+    dd 10 ; APM Table
+    dd 11 ; EFI 32-bit System Table Pointer
+    dd 12 ; EFI 64-bit System Table Pointer
+    ; dd 13 ; SMBIOS
+    dd 14 ; ACPI Old
+    dd 15 ; ACPI New
+    dd 16 ; Network
+    dd 17 ; EFI Memory Map
+    dd 18 ; EFI Boot Services Notifier
+    dd 19 ; EFI 32-bit Image Handle Pointer
+    dd 20 ; EFI 64-bit Image Handle Pointer
+    dd 21 ; Load Base Address
+MB2_INFO_REQUEST_TAG_END:
+align 8
+MB2_FRAMEBUFFER_TAG_START:
+    dw 5
+    dw 1
+    dd MB2_FRAMEBUFFER_TAG_END - MB2_FRAMEBUFFER_TAG_START
+    dd 0
+    dd 0
+    dd 32
+MB2_FRAMEBUFFER_TAG_END:
+align 8
+MB2_EGA_SUPPORT_TAG_START:
+    dw 4
+    dw 0
+    dd MB2_EGA_SUPPORT_TAG_END - MB2_EGA_SUPPORT_TAG_START
+    dd 1 ; https://www.gnu.org/software/grub/manual/multiboot2/html_node/Console-header-tags.html
+MB2_EGA_SUPPORT_TAG_END:
+align 8
+MB2_MODULE_ALIGN_TAG_START:
+    dw 6
+    dw 0
+    dd MB2_MODULE_ALIGN_TAG_END - MB2_MODULE_ALIGN_TAG_START
+MB2_MODULE_ALIGN_TAG_END:
+align 8
+MB2_TAG_START:
+    dw 0
+    dw 0
+    dd MB2_TAG_END - MB2_TAG_START
+MB2_TAG_END:
+HEADER_END:
diff --git a/Kernel/Architecture/amd64/Bootstrap/Limine.c b/Kernel/Architecture/amd64/Bootstrap/Limine.c
new file mode 100644
index 00000000..eceb740e
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Limine.c
@@ -0,0 +1,346 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <boot/binfo.h>
+#include <types.h>
+#include <debug.h>
+#include <convert.h>
+
+#include "../../../../tools/limine/limine.h"
+#include "../../../kernel.h"
+
+void InitLimine();
+
+static volatile struct limine_entry_point_request EntryPointRequest = {
+    .id = LIMINE_ENTRY_POINT_REQUEST,
+    .revision = 0,
+    .response = NULL,
+    .entry = InitLimine};
+static volatile struct limine_bootloader_info_request BootloaderInfoRequest = {
+    .id = LIMINE_BOOTLOADER_INFO_REQUEST,
+    .revision = 0};
+static volatile struct limine_terminal_request TerminalRequest = {
+    .id = LIMINE_TERMINAL_REQUEST,
+    .revision = 0};
+static volatile struct limine_framebuffer_request FramebufferRequest = {
+    .id = LIMINE_FRAMEBUFFER_REQUEST,
+    .revision = 0};
+static volatile struct limine_memmap_request MemmapRequest = {
+    .id = LIMINE_MEMMAP_REQUEST,
+    .revision = 0};
+static volatile struct limine_kernel_address_request KernelAddressRequest = {
+    .id = LIMINE_KERNEL_ADDRESS_REQUEST,
+    .revision = 0};
+static volatile struct limine_rsdp_request RsdpRequest = {
+    .id = LIMINE_RSDP_REQUEST,
+    .revision = 0};
+static volatile struct limine_kernel_file_request KernelFileRequest = {
+    .id = LIMINE_KERNEL_FILE_REQUEST,
+    .revision = 0};
+static volatile struct limine_module_request ModuleRequest = {
+    .id = LIMINE_MODULE_REQUEST,
+    .revision = 0};
+static volatile struct limine_smbios_request SmbiosRequest = {
+    .id = LIMINE_SMBIOS_REQUEST,
+    .revision = 0};
+
+void *TempStackPtr = NULL;
+__naked __used __no_stack_protector void InitLimine()
+{
+    asmv("mov %%rsp, %0"
+         : "=r"(TempStackPtr));
+
+    asmv("mov %0, %%rsp"
+         :
+         : "r"((uintptr_t)TempStackPtr - 0xFFFF800000000000));
+
+    asmv("mov $0, %rax\n"
+         "mov $0, %rbx\n"
+         "mov $0, %rcx\n"
+         "mov $0, %rdx\n"
+         "mov $0, %rsi\n"
+         "mov $0, %rdi\n"
+         "mov $0, %rbp\n"
+         "mov $0, %r8\n"
+         "mov $0, %r9\n"
+         "mov $0, %r10\n"
+         "mov $0, %r11\n"
+         "mov $0, %r12\n"
+         "mov $0, %r13\n"
+         "mov $0, %r14\n"
+         "mov $0, %r15");
+
+    asmv("jmp InitLimineAfterStack");
+}
+
+SafeFunction NIF void InitLimineAfterStack()
+{
+    struct BootInfo binfo = {};
+    struct limine_bootloader_info_response *BootloaderInfoResponse = BootloaderInfoRequest.response;
+    info("Bootloader: %s %s", BootloaderInfoResponse->name, BootloaderInfoResponse->version);
+
+    struct limine_terminal_response *TerminalResponse = TerminalRequest.response;
+
+    if (TerminalResponse == NULL || TerminalResponse->terminal_count < 1)
+    {
+        warn("No terminal available.");
+        inf_loop asmv("hlt");
+    }
+    TerminalResponse->write(TerminalResponse->terminals[0], "\033[37mPlease wait... ", 20);
+
+    struct limine_framebuffer_response *FrameBufferResponse = FramebufferRequest.response;
+    struct limine_memmap_response *MemmapResponse = MemmapRequest.response;
+    struct limine_kernel_address_response *KernelAddressResponse = KernelAddressRequest.response;
+    struct limine_rsdp_response *RsdpResponse = RsdpRequest.response;
+    struct limine_kernel_file_response *KernelFileResponse = KernelFileRequest.response;
+    struct limine_module_response *ModuleResponse = ModuleRequest.response;
+    struct limine_smbios_response *SmbiosResponse = SmbiosRequest.response;
+
+    if (FrameBufferResponse == NULL || FrameBufferResponse->framebuffer_count < 1)
+    {
+        error("No framebuffer available [%#lx;%ld]", FrameBufferResponse,
+              (FrameBufferResponse == NULL) ? 0 : FrameBufferResponse->framebuffer_count);
+
+        TerminalResponse->write(TerminalResponse->terminals[0], "No framebuffer available", 24);
+        inf_loop asmv("hlt");
+    }
+
+    if (MemmapResponse == NULL || MemmapResponse->entry_count < 1)
+    {
+        error("No memory map available [%#lx;%ld]", MemmapResponse,
+              (MemmapResponse == NULL) ? 0 : MemmapResponse->entry_count);
+
+        TerminalResponse->write(TerminalResponse->terminals[0], "No memory map available", 23);
+        inf_loop asmv("hlt");
+    }
+
+    if (KernelAddressResponse == NULL)
+    {
+        error("No kernel address available [%#lx]", KernelAddressResponse);
+
+        TerminalResponse->write(TerminalResponse->terminals[0], "No kernel address available", 27);
+        inf_loop asmv("hlt");
+    }
+
+    if (RsdpResponse == NULL || RsdpResponse->address == 0)
+    {
+        error("No RSDP address available [%#lx;%#lx]", RsdpResponse,
+              (RsdpResponse == NULL) ? 0 : RsdpResponse->address);
+
+        TerminalResponse->write(TerminalResponse->terminals[0], "No RSDP address available", 25);
+        inf_loop asmv("hlt");
+    }
+
+    if (KernelFileResponse == NULL || KernelFileResponse->kernel_file == NULL)
+    {
+        error("No kernel file available [%#lx;%#lx]", KernelFileResponse,
+              (KernelFileResponse == NULL) ? 0 : KernelFileResponse->kernel_file);
+
+        TerminalResponse->write(TerminalResponse->terminals[0], "No kernel file available", 24);
+        inf_loop asmv("hlt");
+    }
+
+    if (ModuleResponse == NULL || ModuleResponse->module_count < 1)
+    {
+        error("No module information available [%#lx;%ld]", ModuleResponse,
+              (ModuleResponse == NULL) ? 0 : ModuleResponse->module_count);
+
+        TerminalResponse->write(TerminalResponse->terminals[0], "No module information available", 31);
+        inf_loop asmv("hlt");
+    }
+
+    /* Actual parsing starts here */
+
+    for (uint64_t i = 0; i < FrameBufferResponse->framebuffer_count; i++)
+    {
+        struct limine_framebuffer *framebuffer = FrameBufferResponse->framebuffers[i];
+        switch (framebuffer->memory_model)
+        {
+        case LIMINE_FRAMEBUFFER_RGB:
+            binfo.Framebuffer[i].Type = RGB;
+            break;
+        default:
+        {
+            error("Unsupported framebuffer memory model %d", framebuffer->memory_model);
+            TerminalResponse->write(TerminalResponse->terminals[0], "Unsupported framebuffer memory model", 37);
+            inf_loop asmv("hlt");
+        }
+        }
+        binfo.Framebuffer[i].BaseAddress = (void *)((uintptr_t)framebuffer->address - 0xFFFF800000000000);
+        binfo.Framebuffer[i].Width = (uint32_t)framebuffer->width;
+        binfo.Framebuffer[i].Height = (uint32_t)framebuffer->height;
+        binfo.Framebuffer[i].Pitch = (uint32_t)framebuffer->pitch;
+        binfo.Framebuffer[i].BitsPerPixel = framebuffer->bpp;
+        binfo.Framebuffer[i].RedMaskSize = framebuffer->red_mask_size;
+        binfo.Framebuffer[i].RedMaskShift = framebuffer->red_mask_shift;
+        binfo.Framebuffer[i].GreenMaskSize = framebuffer->green_mask_size;
+        binfo.Framebuffer[i].GreenMaskShift = framebuffer->green_mask_shift;
+        binfo.Framebuffer[i].BlueMaskSize = framebuffer->blue_mask_size;
+        binfo.Framebuffer[i].BlueMaskShift = framebuffer->blue_mask_shift;
+        binfo.Framebuffer[i].ExtendedDisplayIdentificationData = framebuffer->edid;
+        binfo.Framebuffer[i].EDIDSize = framebuffer->edid_size;
+
+        debug("Framebuffer %d: %dx%d %d bpp", i,
+              binfo.Framebuffer[i].Width,
+              binfo.Framebuffer[i].Height,
+              binfo.Framebuffer[i].BitsPerPixel);
+
+        debug("More info:\nAddress: %#lx\nPitch: %ld\nType: %d\nRedMaskSize: %d\nRedMaskShift: %d\nGreenMaskSize: %d\nGreenMaskShift: %d\nBlueMaskSize: %d\nBlueMaskShift: %d\nEDID: %#lx\nEDIDSize: %d",
+              binfo.Framebuffer[i].BaseAddress,
+              binfo.Framebuffer[i].Pitch,
+              binfo.Framebuffer[i].Type,
+              binfo.Framebuffer[i].RedMaskSize,
+              binfo.Framebuffer[i].RedMaskShift,
+              binfo.Framebuffer[i].GreenMaskSize,
+              binfo.Framebuffer[i].GreenMaskShift,
+              binfo.Framebuffer[i].BlueMaskSize,
+              binfo.Framebuffer[i].BlueMaskShift,
+              binfo.Framebuffer[i].ExtendedDisplayIdentificationData,
+              binfo.Framebuffer[i].EDIDSize);
+    }
+
+    binfo.Memory.Entries = MemmapResponse->entry_count;
+    for (uint64_t i = 0; i < MemmapResponse->entry_count; i++)
+    {
+        if (MemmapResponse->entry_count > MAX_MEMORY_ENTRIES)
+        {
+            warn("Too many memory entries, skipping the rest...");
+            break;
+        }
+
+        struct limine_memmap_entry *entry = MemmapResponse->entries[i];
+        if (!entry)
+        {
+            warn("Null memory entry %ld (%#lx), skipping...", i, entry);
+            continue;
+        }
+
+        binfo.Memory.Size += entry->length;
+        switch (entry->type)
+        {
+        case LIMINE_MEMMAP_USABLE:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = Usable;
+            break;
+        case LIMINE_MEMMAP_RESERVED:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = Reserved;
+            break;
+        case LIMINE_MEMMAP_ACPI_RECLAIMABLE:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = ACPIReclaimable;
+            break;
+        case LIMINE_MEMMAP_ACPI_NVS:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = ACPINVS;
+            break;
+        case LIMINE_MEMMAP_BAD_MEMORY:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = BadMemory;
+            break;
+        case LIMINE_MEMMAP_BOOTLOADER_RECLAIMABLE:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = BootloaderReclaimable;
+            break;
+        case LIMINE_MEMMAP_KERNEL_AND_MODULES:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = KernelAndModules;
+            break;
+        case LIMINE_MEMMAP_FRAMEBUFFER:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = Framebuffer;
+            break;
+        default:
+            binfo.Memory.Entry[i].BaseAddress = (void *)entry->base;
+            binfo.Memory.Entry[i].Length = entry->length;
+            binfo.Memory.Entry[i].Type = Unknown;
+            break;
+        }
+    }
+
+    for (uint64_t i = 0; i < ModuleResponse->module_count; i++)
+    {
+        if (i > MAX_MODULES)
+        {
+            warn("Too many modules, skipping the rest...");
+            break;
+        }
+
+        binfo.Modules[i].Address = (void *)((uint64_t)ModuleResponse->modules[i]->address - 0xFFFF800000000000);
+        binfo.Modules[i].Size = ModuleResponse->modules[i]->size;
+
+        strncpy(binfo.Modules[i].Path,
+                ModuleResponse->modules[i]->path,
+                strlen(ModuleResponse->modules[i]->path) + 1);
+
+        strncpy(binfo.Modules[i].CommandLine,
+                ModuleResponse->modules[i]->cmdline,
+                strlen(ModuleResponse->modules[i]->cmdline) + 1);
+
+        debug("Module %d:\nAddress: %#lx\nPath: \"%s\"\nCommand Line: \"%s\"\nSize: %ld",
+              i,
+              binfo.Modules[i].Address,
+              binfo.Modules[i].Path,
+              binfo.Modules[i].CommandLine,
+              binfo.Modules[i].Size);
+    }
+
+    binfo.RSDP = (struct RSDPInfo *)((uintptr_t)RsdpResponse->address - 0xFFFF800000000000);
+    debug("RSDP: %#lx [Signature: \"%.8s\"] [OEM: \"%.6s\"]",
+          binfo.RSDP, binfo.RSDP->Signature, binfo.RSDP->OEMID);
+
+    if (SmbiosResponse->entry_64 != NULL)
+        binfo.SMBIOSPtr = (void *)((uintptr_t)SmbiosResponse->entry_64 - 0xFFFF800000000000);
+    else if (SmbiosResponse->entry_32 != NULL)
+        binfo.SMBIOSPtr = (void *)((uintptr_t)SmbiosResponse->entry_32 - 0xFFFF800000000000);
+    else
+        binfo.SMBIOSPtr = NULL;
+    debug("SMBIOS: %#lx %#lx (binfo: %#lx)",
+          SmbiosResponse->entry_32,
+          SmbiosResponse->entry_64,
+          binfo.SMBIOSPtr);
+
+    binfo.Kernel.PhysicalBase = (void *)KernelAddressResponse->physical_base;
+    binfo.Kernel.VirtualBase = (void *)KernelAddressResponse->virtual_base;
+    binfo.Kernel.FileBase = (void *)((uintptr_t)KernelFileResponse->kernel_file->address - 0xFFFF800000000000);
+    binfo.Kernel.Size = KernelFileResponse->kernel_file->size;
+
+    strncpy(binfo.Kernel.CommandLine,
+            KernelFileResponse->kernel_file->cmdline,
+            strlen(KernelFileResponse->kernel_file->cmdline) + 1);
+
+    debug("Kernel physical address: %#lx", binfo.Kernel.PhysicalBase);
+    debug("Kernel virtual address: %#lx", binfo.Kernel.VirtualBase);
+
+    strncpy(binfo.Bootloader.Name,
+            BootloaderInfoResponse->name,
+            strlen(BootloaderInfoResponse->name) + 1);
+
+    strncpy(binfo.Bootloader.Version,
+            BootloaderInfoResponse->version,
+            strlen(BootloaderInfoResponse->version) + 1);
+
+    Entry(&binfo);
+}
diff --git a/Kernel/Architecture/amd64/Bootstrap/Multiboot.cpp b/Kernel/Architecture/amd64/Bootstrap/Multiboot.cpp
new file mode 100644
index 00000000..68657920
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Multiboot.cpp
@@ -0,0 +1,299 @@
+#include <types.h>
+
+#include <boot/protocols/multiboot2.h>
+#include <memory.hpp>
+#include <io.h>
+
+#include "../../../kernel.h"
+
+EXTERNC void multiboot_main(uint64_t Magic, uint64_t Info)
+{
+    if (Info == NULL || Magic == NULL)
+    {
+        if (Magic == NULL)
+            error("Multiboot magic is NULL");
+        if (Info == NULL)
+            error("Multiboot info is NULL");
+        CPU::Stop();
+    }
+    else if (Magic != MULTIBOOT2_BOOTLOADER_MAGIC)
+    {
+        error("Multiboot magic is invalid (%#x != %#x)", Magic, MULTIBOOT2_BOOTLOADER_MAGIC);
+        CPU::Stop();
+    }
+
+    BootInfo mb2binfo{};
+
+    // Clear the BSS
+    // memset_unsafe(&_kernel_rodata_end, 0, &_kernel_end - &_kernel_rodata_end);
+
+    {
+        uint64_t div = 1193180 / 1000;
+        outb(0x43, 0xB6);
+        outb(0x42, (uint8_t)div);
+        outb(0x42, (uint8_t)(div >> 8));
+        uint8_t tmp = inb(0x61);
+        if (tmp != (tmp | 3))
+            outb(0x61, tmp | 3);
+
+        int pos = 0;
+        auto InfoAddress = Info;
+        for (auto Tag = (struct multiboot_tag *)((uint8_t *)InfoAddress + 8);
+             ;
+             Tag = (struct multiboot_tag *)((multiboot_uint8_t *)Tag + ((Tag->size + 7) & ~7)))
+        {
+            if (Tag->type == MULTIBOOT_TAG_TYPE_END)
+            {
+                debug("End of multiboot2 tags");
+                break;
+            }
+
+            switch (Tag->type)
+            {
+            case MULTIBOOT_TAG_TYPE_CMDLINE:
+            {
+                strncpy(mb2binfo.Kernel.CommandLine,
+                        ((multiboot_tag_string *)Tag)->string,
+                        strlen(((multiboot_tag_string *)Tag)->string));
+                debug("Kernel command line: %s", mb2binfo.Kernel.CommandLine);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_BOOT_LOADER_NAME:
+            {
+                strncpy(mb2binfo.Bootloader.Name,
+                        ((multiboot_tag_string *)Tag)->string,
+                        strlen(((multiboot_tag_string *)Tag)->string));
+                debug("Bootloader name: %s", mb2binfo.Bootloader.Name);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_MODULE:
+            {
+                multiboot_tag_module *module = (multiboot_tag_module *)Tag;
+                static int module_count = 0;
+                mb2binfo.Modules[module_count].Address = (void *)(uint64_t)module->mod_start;
+                mb2binfo.Modules[module_count].Size = module->size;
+                strncpy(mb2binfo.Modules[module_count].Path, "(null)", 6);
+                strncpy(mb2binfo.Modules[module_count].CommandLine, module->cmdline,
+                        strlen(module->cmdline));
+                debug("Module: %s", mb2binfo.Modules[module_count].Path);
+                module_count++;
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_BASIC_MEMINFO:
+            {
+                multiboot_tag_basic_meminfo *meminfo = (multiboot_tag_basic_meminfo *)Tag;
+                fixme("basic_meminfo->[mem_lower: %#x, mem_upper: %#x]",
+                      meminfo->mem_lower, meminfo->mem_upper);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_BOOTDEV:
+            {
+                multiboot_tag_bootdev *bootdev = (multiboot_tag_bootdev *)Tag;
+                fixme("bootdev->[biosdev: %#x, slice: %#x, part: %#x]",
+                      bootdev->biosdev, bootdev->slice, bootdev->part);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_MMAP:
+            {
+                multiboot_tag_mmap *mmap = (multiboot_tag_mmap *)Tag;
+                size_t EntryCount = mmap->size / sizeof(multiboot_mmap_entry);
+                mb2binfo.Memory.Entries = EntryCount;
+                for (uint32_t i = 0; i < EntryCount; i++)
+                {
+                    if (EntryCount > MAX_MEMORY_ENTRIES)
+                    {
+                        warn("Too many memory entries, skipping the rest...");
+                        break;
+                    }
+                    multiboot_mmap_entry entry = mmap->entries[i];
+                    mb2binfo.Memory.Size += entry.len;
+                    switch (entry.type)
+                    {
+                    case MULTIBOOT_MEMORY_AVAILABLE:
+                        mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                        mb2binfo.Memory.Entry[i].Length = entry.len;
+                        mb2binfo.Memory.Entry[i].Type = Usable;
+                        break;
+                    case MULTIBOOT_MEMORY_RESERVED:
+                        mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                        mb2binfo.Memory.Entry[i].Length = entry.len;
+                        mb2binfo.Memory.Entry[i].Type = Reserved;
+                        break;
+                    case MULTIBOOT_MEMORY_ACPI_RECLAIMABLE:
+                        mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                        mb2binfo.Memory.Entry[i].Length = entry.len;
+                        mb2binfo.Memory.Entry[i].Type = ACPIReclaimable;
+                        break;
+                    case MULTIBOOT_MEMORY_NVS:
+                        mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                        mb2binfo.Memory.Entry[i].Length = entry.len;
+                        mb2binfo.Memory.Entry[i].Type = ACPINVS;
+                        break;
+                    case MULTIBOOT_MEMORY_BADRAM:
+                        mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                        mb2binfo.Memory.Entry[i].Length = entry.len;
+                        mb2binfo.Memory.Entry[i].Type = BadMemory;
+                        break;
+                    default:
+                        mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                        mb2binfo.Memory.Entry[i].Length = entry.len;
+                        mb2binfo.Memory.Entry[i].Type = Unknown;
+                        break;
+                    }
+                    debug("Memory entry: [BaseAddress: %#x, Length: %#x, Type: %d]",
+                          mb2binfo.Memory.Entry[i].BaseAddress,
+                          mb2binfo.Memory.Entry[i].Length,
+                          mb2binfo.Memory.Entry[i].Type);
+                }
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_VBE:
+            {
+                multiboot_tag_vbe *vbe = (multiboot_tag_vbe *)Tag;
+                fixme("vbe->[vbe_mode: %#x, vbe_interface_seg: %#x, vbe_interface_off: %#x, vbe_interface_len: %#x]",
+                      vbe->vbe_mode, vbe->vbe_interface_seg, vbe->vbe_interface_off, vbe->vbe_interface_len);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_FRAMEBUFFER:
+            {
+                multiboot_tag_framebuffer *fb = (multiboot_tag_framebuffer *)Tag;
+                static int fb_count = 0;
+                mb2binfo.Framebuffer[fb_count].BaseAddress = (void *)fb->common.framebuffer_addr;
+                mb2binfo.Framebuffer[fb_count].Width = fb->common.framebuffer_width;
+                mb2binfo.Framebuffer[fb_count].Height = fb->common.framebuffer_height;
+                mb2binfo.Framebuffer[fb_count].Pitch = fb->common.framebuffer_pitch;
+                mb2binfo.Framebuffer[fb_count].BitsPerPixel = fb->common.framebuffer_bpp;
+                switch (fb->common.framebuffer_type)
+                {
+                case MULTIBOOT_FRAMEBUFFER_TYPE_INDEXED:
+                {
+                    mb2binfo.Framebuffer[fb_count].Type = Indexed;
+                    break;
+                }
+                case MULTIBOOT_FRAMEBUFFER_TYPE_RGB:
+                {
+                    mb2binfo.Framebuffer[fb_count].Type = RGB;
+                    mb2binfo.Framebuffer[fb_count].RedMaskSize = fb->framebuffer_red_mask_size;
+                    mb2binfo.Framebuffer[fb_count].RedMaskShift = fb->framebuffer_red_field_position;
+                    mb2binfo.Framebuffer[fb_count].GreenMaskSize = fb->framebuffer_green_mask_size;
+                    mb2binfo.Framebuffer[fb_count].GreenMaskShift = fb->framebuffer_green_field_position;
+                    mb2binfo.Framebuffer[fb_count].BlueMaskSize = fb->framebuffer_blue_mask_size;
+                    mb2binfo.Framebuffer[fb_count].BlueMaskShift = fb->framebuffer_blue_field_position;
+                    break;
+                }
+                case MULTIBOOT_FRAMEBUFFER_TYPE_EGA_TEXT:
+                {
+                    mb2binfo.Framebuffer[fb_count].Type = EGA;
+                    break;
+                }
+                default:
+                {
+                    mb2binfo.Framebuffer[fb_count].Type = Unknown_Framebuffer_Type;
+                    break;
+                }
+                }
+                debug("Framebuffer %d: %dx%d %d bpp", fb_count, fb->common.framebuffer_width, fb->common.framebuffer_height, fb->common.framebuffer_bpp);
+                debug("More info:\nAddress: %p\nPitch: %lld\nMemoryModel: %d\nRedMaskSize: %d\nRedMaskShift: %d\nGreenMaskSize: %d\nGreenMaskShift: %d\nBlueMaskSize: %d\nBlueMaskShift: %d",
+                      fb->common.framebuffer_addr, fb->common.framebuffer_pitch, fb->common.framebuffer_type,
+                      fb->framebuffer_red_mask_size, fb->framebuffer_red_field_position, fb->framebuffer_green_mask_size,
+                      fb->framebuffer_green_field_position, fb->framebuffer_blue_mask_size, fb->framebuffer_blue_field_position);
+                fb_count++;
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_ELF_SECTIONS:
+            {
+                multiboot_tag_elf_sections *elf = (multiboot_tag_elf_sections *)Tag;
+                fixme("elf_sections->[num=%d, size=%d, entsize=%d, shndx=%d]",
+                      elf->num, elf->size, elf->entsize, elf->shndx);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_APM:
+            {
+                multiboot_tag_apm *apm = (multiboot_tag_apm *)Tag;
+                fixme("apm->[version: %d, cseg: %d, offset: %d, cseg_16: %d, dseg: %d, flags: %d, cseg_len: %d, cseg_16_len: %d, dseg_len: %d]",
+                      apm->version, apm->cseg, apm->offset, apm->cseg_16, apm->dseg, apm->flags, apm->cseg_len, apm->cseg_16_len, apm->dseg_len);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_EFI32:
+            {
+                multiboot_tag_efi32 *efi32 = (multiboot_tag_efi32 *)Tag;
+                fixme("efi32->[pointer: %p, size: %d]", efi32->pointer, efi32->size);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_EFI64:
+            {
+                multiboot_tag_efi64 *efi64 = (multiboot_tag_efi64 *)Tag;
+                fixme("efi64->[pointer: %p, size: %d]", efi64->pointer, efi64->size);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_SMBIOS:
+            {
+                multiboot_tag_smbios *smbios = (multiboot_tag_smbios *)Tag;
+                fixme("smbios->[major: %d, minor: %d]", smbios->major, smbios->minor);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_ACPI_OLD:
+            {
+                mb2binfo.RSDP = (BootInfo::RSDPInfo *)((multiboot_tag_old_acpi *)Tag)->rsdp;
+                debug("OLD ACPI RSDP: %p", mb2binfo.RSDP);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_ACPI_NEW:
+            {
+                mb2binfo.RSDP = (BootInfo::RSDPInfo *)((multiboot_tag_new_acpi *)Tag)->rsdp;
+                debug("NEW ACPI RSDP: %p", mb2binfo.RSDP);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_NETWORK:
+            {
+                multiboot_tag_network *net = (multiboot_tag_network *)Tag;
+                fixme("network->[dhcpack: %p]", net->dhcpack);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_EFI_MMAP:
+            {
+                multiboot_tag_efi_mmap *efi_mmap = (multiboot_tag_efi_mmap *)Tag;
+                fixme("efi_mmap->[descr_size: %d, descr_vers: %d, efi_mmap: %p]",
+                      efi_mmap->descr_size, efi_mmap->descr_vers, efi_mmap->efi_mmap);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_EFI_BS:
+            {
+                fixme("efi_bs->[%p] (unknown structure)", Tag);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_EFI32_IH:
+            {
+                multiboot_tag_efi32_ih *efi32_ih = (multiboot_tag_efi32_ih *)Tag;
+                fixme("efi32_ih->[pointer: %p]", efi32_ih->pointer);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_EFI64_IH:
+            {
+                multiboot_tag_efi64_ih *efi64_ih = (multiboot_tag_efi64_ih *)Tag;
+                fixme("efi64_ih->[pointer: %p]", efi64_ih->pointer);
+                break;
+            }
+            case MULTIBOOT_TAG_TYPE_LOAD_BASE_ADDR:
+            {
+                multiboot_tag_load_base_addr *load_base_addr = (multiboot_tag_load_base_addr *)Tag;
+                mb2binfo.Kernel.PhysicalBase = (void *)(uint64_t)load_base_addr->load_base_addr;
+                mb2binfo.Kernel.VirtualBase = (void *)(uint64_t)(load_base_addr->load_base_addr + 0xFFFFFFFF80000000);
+                mb2binfo.Kernel.Size = ((uint64_t)&_kernel_end - (uint64_t)&_kernel_start) + ((uint64_t)&_bootstrap_end - (uint64_t)&_bootstrap_start);
+                debug("Kernel base: %p (physical) %p (virtual)", mb2binfo.Kernel.PhysicalBase, mb2binfo.Kernel.VirtualBase);
+                break;
+            }
+            default:
+            {
+                error("Unknown multiboot2 tag type: %d", Tag->type);
+                break;
+            }
+            }
+        }
+
+        tmp = inb(0x61) & 0xFC;
+        outb(0x61, tmp);
+    }
+
+    Entry(&mb2binfo);
+}
diff --git a/Kernel/Architecture/amd64/Bootstrap/Multiboot64bitMap.cpp b/Kernel/Architecture/amd64/Bootstrap/Multiboot64bitMap.cpp
new file mode 100644
index 00000000..9cfcac91
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Multiboot64bitMap.cpp
@@ -0,0 +1,287 @@
+#include <types.h>
+
+union __attribute__((packed)) PageTableEntry
+{
+    struct
+    {
+        bool Present : 1;            // 0
+        bool ReadWrite : 1;          // 1
+        bool UserSupervisor : 1;     // 2
+        bool WriteThrough : 1;       // 3
+        bool CacheDisable : 1;       // 4
+        bool Accessed : 1;           // 5
+        bool Dirty : 1;              // 6
+        bool PageAttributeTable : 1; // 7
+        bool Global : 1;             // 8
+        uint8_t Available0 : 3;      // 9-11
+        uint64_t Address : 40;       // 12-51
+        uint32_t Available1 : 7;     // 52-58
+        uint8_t ProtectionKey : 4;   // 59-62
+        bool ExecuteDisable : 1;     // 63
+    };
+    uint64_t raw;
+
+    __always_inline inline SafeFunction NIF void SetAddress(uintptr_t _Address)
+    {
+        _Address &= 0x000000FFFFFFFFFF;
+        this->raw &= 0xFFF0000000000FFF;
+        this->raw |= (_Address << 12);
+    }
+
+    __always_inline inline SafeFunction NIF uintptr_t GetAddress() { return (this->raw & 0x000FFFFFFFFFF000) >> 12; }
+};
+
+struct __attribute__((packed)) PageTableEntryPtr
+{
+    PageTableEntry Entries[512];
+};
+
+union __attribute__((packed)) PageDirectoryEntry
+{
+    struct
+    {
+        bool Present : 1;         // 0
+        bool ReadWrite : 1;       // 1
+        bool UserSupervisor : 1;  // 2
+        bool WriteThrough : 1;    // 3
+        bool CacheDisable : 1;    // 4
+        bool Accessed : 1;        // 5
+        bool Available0 : 1;      // 6
+        bool PageSize : 1;        // 7
+        uint8_t Available1 : 4;   // 8-11
+        uint64_t Address : 40;    // 12-51
+        uint32_t Available2 : 11; // 52-62
+        bool ExecuteDisable : 1;  // 63
+    };
+    uint64_t raw;
+
+    __always_inline inline SafeFunction NIF void SetAddress(uintptr_t _Address)
+    {
+        _Address &= 0x000000FFFFFFFFFF;
+        this->raw &= 0xFFF0000000000FFF;
+        this->raw |= (_Address << 12);
+    }
+
+    __always_inline inline SafeFunction NIF uintptr_t GetAddress() { return (this->raw & 0x000FFFFFFFFFF000) >> 12; }
+};
+
+struct __attribute__((packed)) PageDirectoryEntryPtr
+{
+    PageDirectoryEntry Entries[512];
+};
+
+union __attribute__((packed)) PageDirectoryPointerTableEntry
+{
+    struct
+    {
+        bool Present : 1;         // 0
+        bool ReadWrite : 1;       // 1
+        bool UserSupervisor : 1;  // 2
+        bool WriteThrough : 1;    // 3
+        bool CacheDisable : 1;    // 4
+        bool Accessed : 1;        // 5
+        bool Available0 : 1;      // 6
+        bool PageSize : 1;        // 7
+        uint8_t Available1 : 4;   // 8-11
+        uint64_t Address : 40;    // 12-51
+        uint32_t Available2 : 11; // 52-62
+        bool ExecuteDisable : 1;  // 63
+    };
+    uint64_t raw;
+
+    __always_inline inline SafeFunction NIF void SetAddress(uintptr_t _Address)
+    {
+        _Address &= 0x000000FFFFFFFFFF;
+        this->raw &= 0xFFF0000000000FFF;
+        this->raw |= (_Address << 12);
+    }
+
+    __always_inline inline SafeFunction NIF uintptr_t GetAddress() { return (this->raw & 0x000FFFFFFFFFF000) >> 12; }
+};
+
+struct __attribute__((packed)) PageDirectoryPointerTableEntryPtr
+{
+    PageDirectoryPointerTableEntry Entries[512];
+};
+
+union __attribute__((packed)) PageMapLevel4
+{
+    struct
+    {
+        bool Present : 1;         // 0
+        bool ReadWrite : 1;       // 1
+        bool UserSupervisor : 1;  // 2
+        bool WriteThrough : 1;    // 3
+        bool CacheDisable : 1;    // 4
+        bool Accessed : 1;        // 5
+        bool Available0 : 1;      // 6
+        bool Reserved0 : 1;       // 7
+        uint8_t Available1 : 4;   // 8-11
+        uint64_t Address : 40;    // 12-51
+        uint32_t Available2 : 11; // 52-62
+        bool ExecuteDisable : 1;  // 63
+    };
+    uint64_t raw;
+
+    __always_inline inline SafeFunction NIF void SetAddress(uintptr_t _Address)
+    {
+        _Address &= 0x000000FFFFFFFFFF;
+        this->raw &= 0xFFF0000000000FFF;
+        this->raw |= (_Address << 12);
+    }
+
+    __always_inline inline SafeFunction NIF uintptr_t GetAddress() { return (this->raw & 0x000FFFFFFFFFF000) >> 12; }
+};
+
+struct PageTable4
+{
+    PageMapLevel4 Entries[512];
+} __attribute__((aligned(0x1000)));
+
+extern "C" char BootPageTable[];
+extern uintptr_t _kernel_start, _kernel_end;
+
+__attribute__((section(".bootstrap.data"))) static PageTable4 *BPTable = (PageTable4 *)BootPageTable;
+__attribute__((section(".bootstrap.data"))) static size_t BPT_Allocated = 0x4000;
+
+__always_inline inline SafeFunction NIF void *RequestPage()
+{
+    void *Page = (void *)(BootPageTable + BPT_Allocated);
+    BPT_Allocated += 0x1000;
+    if (BPT_Allocated >= 0x10000) /* The length of BootPageTable */
+    {
+        while (true)
+            ;
+    }
+    return Page;
+}
+
+class PageMapIndexer
+{
+public:
+    uintptr_t PMLIndex = 0;
+    uintptr_t PDPTEIndex = 0;
+    uintptr_t PDEIndex = 0;
+    uintptr_t PTEIndex = 0;
+    __always_inline inline SafeFunction NIF PageMapIndexer(uintptr_t VirtualAddress)
+    {
+        uintptr_t Address = VirtualAddress;
+        Address >>= 12;
+        this->PTEIndex = Address & 0x1FF;
+        Address >>= 9;
+        this->PDEIndex = Address & 0x1FF;
+        Address >>= 9;
+        this->PDPTEIndex = Address & 0x1FF;
+        Address >>= 9;
+        this->PMLIndex = Address & 0x1FF;
+    }
+};
+
+__attribute__((section(".bootstrap.text"))) SafeFunction NIF void MB2_64_Map(void *VirtualAddress, void *PhysicalAddress, uint64_t Flags)
+{
+    PageMapIndexer Index = PageMapIndexer((uintptr_t)VirtualAddress);
+    // Clear any flags that are not 1 << 0 (Present) - 1 << 5 (Accessed) because rest are for page table entries only
+    uint64_t DirectoryFlags = Flags & 0x3F;
+
+    PageMapLevel4 PML4 = BPTable->Entries[Index.PMLIndex];
+    PageDirectoryPointerTableEntryPtr *PDPTEPtr = nullptr;
+    if (!PML4.Present)
+    {
+        PDPTEPtr = (PageDirectoryPointerTableEntryPtr *)RequestPage();
+        if (PDPTEPtr == nullptr)
+            return;
+        {
+            void *ptr = PDPTEPtr;
+            uint8_t value = 0;
+            size_t num = 0x1000;
+            uint8_t *p = (uint8_t *)ptr;
+            for (size_t i = 0; i < num; i++)
+                p[i] = value;
+        }
+        PML4.Present = true;
+        PML4.SetAddress((uintptr_t)PDPTEPtr >> 12);
+    }
+    else
+        PDPTEPtr = (PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4.GetAddress() << 12);
+    PML4.raw |= DirectoryFlags;
+    BPTable->Entries[Index.PMLIndex] = PML4;
+
+    PageDirectoryPointerTableEntry PDPTE = PDPTEPtr->Entries[Index.PDPTEIndex];
+    PageDirectoryEntryPtr *PDEPtr = nullptr;
+    if (!PDPTE.Present)
+    {
+        PDEPtr = (PageDirectoryEntryPtr *)RequestPage();
+        if (PDEPtr == nullptr)
+            return;
+        {
+            void *ptr = PDEPtr;
+            uint8_t value = 0;
+            size_t num = 0x1000;
+            uint8_t *p = (uint8_t *)ptr;
+            for (size_t i = 0; i < num; i++)
+                p[i] = value;
+        }
+        PDPTE.Present = true;
+        PDPTE.SetAddress((uintptr_t)PDEPtr >> 12);
+    }
+    else
+        PDEPtr = (PageDirectoryEntryPtr *)((uintptr_t)PDPTE.GetAddress() << 12);
+    PDPTE.raw |= DirectoryFlags;
+    PDPTEPtr->Entries[Index.PDPTEIndex] = PDPTE;
+
+    PageDirectoryEntry PDE = PDEPtr->Entries[Index.PDEIndex];
+    PageTableEntryPtr *PTEPtr = nullptr;
+    if (!PDE.Present)
+    {
+        PTEPtr = (PageTableEntryPtr *)RequestPage();
+        if (PTEPtr == nullptr)
+            return;
+        {
+            void *ptr = PTEPtr;
+            uint8_t value = 0;
+            size_t num = 0x1000;
+            uint8_t *p = (uint8_t *)ptr;
+            for (size_t i = 0; i < num; i++)
+                p[i] = value;
+        }
+        PDE.Present = true;
+        PDE.SetAddress((uintptr_t)PTEPtr >> 12);
+    }
+    else
+        PTEPtr = (PageTableEntryPtr *)((uintptr_t)PDE.GetAddress() << 12);
+    PDE.raw |= DirectoryFlags;
+    PDEPtr->Entries[Index.PDEIndex] = PDE;
+
+    PageTableEntry PTE = PTEPtr->Entries[Index.PTEIndex];
+    PTE.Present = true;
+    PTE.raw |= Flags;
+    PTE.SetAddress((uintptr_t)PhysicalAddress >> 12);
+    PTEPtr->Entries[Index.PTEIndex] = PTE;
+    asmv("invlpg (%0)"
+         :
+         : "r"(VirtualAddress)
+         : "memory");
+}
+
+EXTERNC __attribute__((section(".bootstrap.text"))) SafeFunction NIF __attribute__((section(".bootstrap.text"))) void UpdatePageTable64()
+{
+    BPTable = (PageTable4 *)BootPageTable;
+
+    // for (size_t i = 0; i < 0x10000000; i += 0x1000)
+    //     MB2_64_Map((void *)i, (void *)i, 0x3);
+
+    uintptr_t KernelStart = (uintptr_t)&_kernel_start;
+    uintptr_t KernelEnd = (uintptr_t)&_kernel_end;
+    uintptr_t PhysicalStart = KernelStart - 0xFFFFFFFF80000000;
+    for (uintptr_t i = KernelStart; i < KernelEnd; i += 0x1000)
+    {
+        MB2_64_Map((void *)i, (void *)PhysicalStart, 0x3);
+        PhysicalStart += 0x1000;
+    }
+
+    asmv("mov %%cr3, %%rax\n"
+         "mov %%rax, %%cr3\n"
+         :
+         :
+         : "rax");
+}
diff --git a/Kernel/Architecture/amd64/Bootstrap/Multiboot_Init.asm b/Kernel/Architecture/amd64/Bootstrap/Multiboot_Init.asm
new file mode 100644
index 00000000..a72c3fcc
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Multiboot_Init.asm
@@ -0,0 +1,114 @@
+[bits 32]
+KERNEL_STACK_SIZE equ 0x4000 ; 16KB
+
+extern multiboot_main
+extern LoadGDT32
+extern BootPageTable
+extern UpdatePageTable
+
+section .bootstrap.data
+
+MB_HeaderMagic:
+	dq 0
+
+MB_HeaderInfo:
+	dq 0
+
+section .bootstrap.text
+
+global _start
+_start:
+	cli
+
+	mov [MB_HeaderMagic], eax
+	mov [MB_HeaderInfo], ebx
+
+	mov ecx, cr4
+	or ecx, 0x00000010 ; Set PSE in CR4
+	or ecx, 0x00000020 ; Set PAE in CR4
+	mov cr4, ecx
+
+	call LoadGDT32
+	call UpdatePageTable
+
+	mov ecx, BootPageTable
+	mov cr3, ecx
+
+	mov ecx, 0xC0000080 ; EFER
+	rdmsr
+	or eax, 0x800 | 0x100 | 0x1 ; Set LME, LMA, SCE
+	wrmsr
+
+	mov ecx, cr0
+	or ecx, 0x80000000 | 0x1 ; Set PG and PE in CR0
+	mov cr0, ecx
+
+	lgdt [GDT64.Ptr]
+
+	jmp GDT64.code:HigherHalfStart
+
+extern UpdatePageTable64
+
+[bits 64]
+HigherHalfStart:
+	mov ax, GDT64.data
+	mov ds, ax
+	mov es, ax
+	mov fs, ax
+	mov gs, ax
+	mov ss, ax
+
+	call UpdatePageTable64
+
+	mov rsp, KernelStack + KERNEL_STACK_SIZE
+	mov rdi, [MB_HeaderMagic]
+	mov rsi, [MB_HeaderInfo]
+	push rsi
+	push rdi
+	call multiboot_main
+.Hang:
+	hlt
+	jmp .Hang
+
+
+
+; Access bits
+PRESENT equ 1 << 7
+NOT_SYS equ 1 << 4
+EXEC equ 1 << 3
+DC equ 1 << 2
+RW equ 1 << 1
+ACCESSED equ 1 << 0
+ 
+; Flags bits
+GRAN_4K equ 1 << 7
+SZ_32 equ 1 << 6
+LONG_MODE equ 1 << 5
+
+section .bootstrap.data
+GDT64:
+    .null: equ $ - GDT64
+        dq 0
+    .code: equ $ - GDT64
+        dd 0xFFFF
+        db 0
+        db PRESENT | NOT_SYS | EXEC | RW
+        db GRAN_4K | LONG_MODE | 0xF
+        db 0
+    .data: equ $ - GDT64
+        dd 0xFFFF
+        db 0
+        db PRESENT | NOT_SYS | RW
+        db GRAN_4K | SZ_32 | 0xF
+        db 0
+    .tss: equ $ - GDT64
+        dd 0x00000068
+        dd 0x00CF8900
+	.Ptr:
+		dw $ - GDT64 - 1
+		dq GDT64
+
+section .bootstrap.bss
+align 16
+KernelStack:
+	resb KERNEL_STACK_SIZE
diff --git a/Kernel/Architecture/amd64/Bootstrap/Multiboot_PageTable.asm b/Kernel/Architecture/amd64/Bootstrap/Multiboot_PageTable.asm
new file mode 100644
index 00000000..cc5caf3f
--- /dev/null
+++ b/Kernel/Architecture/amd64/Bootstrap/Multiboot_PageTable.asm
@@ -0,0 +1,45 @@
+PAGE_TABLE_SIZE equ 0x4 ; 1GB
+[bits 32]
+
+section .bootstrap.data
+align 0x1000
+global BootPageTable
+BootPageTable:
+    times (0x10000) dq 0 ; 0x4000
+
+section .bootstrap.text
+global UpdatePageTable
+UpdatePageTable:
+	mov edi, (BootPageTable + 0x0000) ; First PML4E
+	mov eax, (BootPageTable + 0x1000) ; First PDPTE
+	or eax, 11b ; Bitwise OR on rax (PDPTE) with 11b (Present, Write)
+	mov dword [edi], eax ; Write 11b to PML4E
+
+	mov edi, (BootPageTable + 0x1000) ; First PDPTE
+	mov eax, (BootPageTable + 0x2000) ; First PDE
+	or eax, 11b ; Bitwise OR on rax (PDE) with 11b (Present, Write)
+
+	mov ecx, PAGE_TABLE_SIZE ; For loop instruction
+	mov ebx, 0x0 ; Value to store in the next 4 bytes
+	.FillPageTableLevel3:
+		mov dword [edi], eax ; Store modified PDE in PDPTE
+		mov dword [edi + 4], ebx ; Store the rbx value in the next 4 bytes
+		add eax, 0x1000 ; Increment (page size)
+		adc ebx, 0 ; Add 0 to carry flag
+		add edi, 8 ; Add 8 to rdi (next PDE)
+		loop .FillPageTableLevel3 ; Loop until rcx is 0
+
+	mov edi, (BootPageTable + 0x2000) ; First PDE
+	mov eax, 10000011b ; Present, Write, Large Page
+
+	mov ecx, (512 * PAGE_TABLE_SIZE) ; For loop instruction
+	mov ebx, 0x0 ; Value to store in the next 4 bytes
+	.FillPageTableLevel2:
+		mov dword [edi], eax ; Store modified PDE in PDPTE
+		mov dword [edi + 4], ebx ; Store the rbx value in the next 4 bytes
+		add eax, 1 << 21 ; Increment (page size)
+		adc ebx, 0 ; Add 0 (carry flag) to rbx to increment if there was a carry
+		add edi, 8 ; Add 8 to rdi (next PDE)
+		loop .FillPageTableLevel2 ; Loop until rcx is 0
+
+	ret
diff --git a/Kernel/Architecture/amd64/DifferentiatedSystemDescriptionTable.cpp b/Kernel/Architecture/amd64/DifferentiatedSystemDescriptionTable.cpp
new file mode 100644
index 00000000..202fb25c
--- /dev/null
+++ b/Kernel/Architecture/amd64/DifferentiatedSystemDescriptionTable.cpp
@@ -0,0 +1,255 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "acpi.hpp"
+
+#include <time.hpp>
+#include <debug.h>
+#include <smp.hpp>
+#include <io.h>
+
+#include "cpu/apic.hpp"
+#include "../../kernel.h"
+
+#define ACPI_TIMER 0x0001
+#define ACPI_BUSMASTER 0x0010
+#define ACPI_GLOBAL 0x0020
+#define ACPI_POWER_BUTTON 0x0100
+#define ACPI_SLEEP_BUTTON 0x0200
+#define ACPI_RTC_ALARM 0x0400
+#define ACPI_PCIE_WAKE 0x4000
+#define ACPI_WAKE 0x8000
+
+namespace ACPI
+{
+    __always_inline inline bool IsCanonical(uint64_t Address)
+    {
+        return ((Address <= 0x00007FFFFFFFFFFF) || ((Address >= 0xFFFF800000000000) && (Address <= 0xFFFFFFFFFFFFFFFF)));
+    }
+
+#define ACPI_ENABLED 0x0001
+#define ACPI_SLEEP 0x2000
+
+#define ACPI_GAS_MMIO 0
+#define ACPI_GAS_IO 1
+#define ACPI_GAS_PCI 2
+
+    void DSDT::OnInterruptReceived(CPU::x64::TrapFrame *Frame)
+    {
+        debug("SCI Handle Triggered");
+        uint16_t Event = 0;
+        {
+            uint16_t a = 0, b = 0;
+            if (acpi->FADT->PM1aEventBlock)
+            {
+                a = inw(s_cst(uint16_t, acpi->FADT->PM1aEventBlock));
+                outw(s_cst(uint16_t, acpi->FADT->PM1aEventBlock), a);
+            }
+            if (acpi->FADT->PM1bEventBlock)
+            {
+                b = inw(s_cst(uint16_t, acpi->FADT->PM1bEventBlock));
+                outw(s_cst(uint16_t, acpi->FADT->PM1bEventBlock), b);
+            }
+            Event = a | b;
+        }
+
+        debug("SCI Event: %#lx", Event);
+        if (Event & ACPI_BUSMASTER)
+        {
+            fixme("ACPI Busmaster");
+        }
+        else if (Event & ACPI_GLOBAL)
+        {
+            fixme("ACPI Global");
+        }
+        else if (Event & ACPI_POWER_BUTTON)
+        {
+            if (TaskManager)
+            {
+                TaskManager->CreateThread(TaskManager->CreateProcess(nullptr,
+                                                                     "Shutdown",
+                                                                     Tasking::TaskTrustLevel::Kernel),
+                                          (Tasking::IP)KST_Shutdown);
+            }
+            else
+                KernelShutdownThread(false);
+        }
+        else if (Event & ACPI_SLEEP_BUTTON)
+        {
+            fixme("ACPI Sleep Button");
+        }
+        else if (Event & ACPI_RTC_ALARM)
+        {
+            fixme("ACPI RTC Alarm");
+        }
+        else if (Event & ACPI_PCIE_WAKE)
+        {
+            fixme("ACPI PCIe Wake");
+        }
+        else if (Event & ACPI_WAKE)
+        {
+            fixme("ACPI Wake");
+        }
+        else if (Event & ACPI_TIMER)
+        {
+            fixme("ACPI Timer");
+        }
+        else
+        {
+            error("ACPI unknown event %#lx on CPU %d", Event, GetCurrentCPU()->ID);
+            CPU::Stop();
+        }
+        UNUSED(Frame);
+    }
+
+    void DSDT::Shutdown()
+    {
+        trace("Shutting down...");
+        if (SCI_EN == 1)
+        {
+            outw(s_cst(uint16_t, acpi->FADT->PM1aControlBlock),
+                 s_cst(uint16_t,
+                       (inw(s_cst(uint16_t,
+                                  acpi->FADT->PM1aControlBlock)) &
+                        0xE3FF) |
+                           ((SLP_TYPa << 10) | ACPI_SLEEP)));
+
+            if (acpi->FADT->PM1bControlBlock)
+                outw(s_cst(uint16_t, acpi->FADT->PM1bControlBlock),
+                     s_cst(uint16_t,
+                           (inw(
+                                s_cst(uint16_t, acpi->FADT->PM1bControlBlock)) &
+                            0xE3FF) |
+                               ((SLP_TYPb << 10) | ACPI_SLEEP)));
+
+            outw(s_cst(uint16_t, PM1a_CNT), SLP_TYPa | SLP_EN);
+            if (PM1b_CNT)
+                outw(s_cst(uint16_t, PM1b_CNT), SLP_TYPb | SLP_EN);
+        }
+    }
+
+    void DSDT::Reboot()
+    {
+        trace("Rebooting...");
+        switch (acpi->FADT->ResetReg.AddressSpace)
+        {
+        case ACPI_GAS_MMIO:
+        {
+            *(uint8_t *)(acpi->FADT->ResetReg.Address) = acpi->FADT->ResetValue;
+            break;
+        }
+        case ACPI_GAS_IO:
+        {
+            outb(s_cst(uint16_t, acpi->FADT->ResetReg.Address), acpi->FADT->ResetValue);
+            break;
+        }
+        case ACPI_GAS_PCI:
+        {
+            fixme("ACPI_GAS_PCI not supported.");
+            /*
+                seg      - 0
+                bus      - 0
+                dev      - (FADT->ResetReg.Address >> 32) & 0xFFFF
+                function - (FADT->ResetReg.Address >> 16) & 0xFFFF
+                offset   - FADT->ResetReg.Address & 0xFFFF
+                value    - FADT->ResetValue
+            */
+            break;
+        }
+        default:
+        {
+            error("Unknown reset register address space: %d", acpi->FADT->ResetReg.AddressSpace);
+            break;
+        }
+        }
+    }
+
+    DSDT::DSDT(ACPI *acpi) : Interrupts::Handler(acpi->FADT->SCI_Interrupt)
+    {
+        this->acpi = acpi;
+        uint64_t Address = ((IsCanonical(acpi->FADT->X_Dsdt) && acpi->XSDTSupported) ? acpi->FADT->X_Dsdt : acpi->FADT->Dsdt);
+        uint8_t *S5Address = (uint8_t *)(Address) + 36;
+        ACPI::ACPI::ACPIHeader *Header = (ACPI::ACPI::ACPIHeader *)Address;
+        uint64_t Length = Header->Length;
+        while (Length-- > 0)
+        {
+            if (!memcmp(S5Address, "_S5_", 4))
+                break;
+            S5Address++;
+        }
+        if (Length <= 0)
+        {
+            warn("_S5 not present in ACPI");
+            return;
+        }
+        if ((*(S5Address - 1) == 0x08 || (*(S5Address - 2) == 0x08 && *(S5Address - 1) == '\\')) && *(S5Address + 4) == 0x12)
+        {
+            S5Address += 5;
+            S5Address += ((*S5Address & 0xC0) >> 6) + 2;
+            if (*S5Address == 0x0A)
+                S5Address++;
+            SLP_TYPa = s_cst(uint16_t, *(S5Address) << 10);
+            S5Address++;
+            if (*S5Address == 0x0A)
+                S5Address++;
+            SLP_TYPb = s_cst(uint16_t, *(S5Address) << 10);
+            SMI_CMD = acpi->FADT->SMI_CommandPort;
+            ACPI_ENABLE = acpi->FADT->AcpiEnable;
+            ACPI_DISABLE = acpi->FADT->AcpiDisable;
+            PM1a_CNT = acpi->FADT->PM1aControlBlock;
+            PM1b_CNT = acpi->FADT->PM1bControlBlock;
+            PM1_CNT_LEN = acpi->FADT->PM1ControlLength;
+            SLP_EN = 1 << 13;
+            SCI_EN = 1;
+            trace("ACPI Shutdown is supported");
+            ACPIShutdownSupported = true;
+
+            uint16_t value = ACPI_POWER_BUTTON | ACPI_SLEEP_BUTTON | ACPI_WAKE;
+            {
+                uint16_t a = s_cst(uint16_t, acpi->FADT->PM1aEventBlock + (acpi->FADT->PM1EventLength / 2));
+                uint16_t b = s_cst(uint16_t, acpi->FADT->PM1bEventBlock + (acpi->FADT->PM1EventLength / 2));
+                debug("SCI Event: %#llx [a:%#x b:%#x]", value, a, b);
+                if (acpi->FADT->PM1aEventBlock)
+                    outw(a, value);
+                if (acpi->FADT->PM1bEventBlock)
+                    outw(b, value);
+            }
+
+            {
+                uint16_t a = 0, b = 0;
+                if (acpi->FADT->PM1aEventBlock)
+                {
+                    a = inw(s_cst(uint16_t, acpi->FADT->PM1aEventBlock));
+                    outw(s_cst(uint16_t, acpi->FADT->PM1aEventBlock), a);
+                }
+                if (acpi->FADT->PM1bEventBlock)
+                {
+                    b = inw(s_cst(uint16_t, acpi->FADT->PM1bEventBlock));
+                    outw(s_cst(uint16_t, acpi->FADT->PM1bEventBlock), b);
+                }
+            }
+            ((APIC::APIC *)Interrupts::apic[0])->RedirectIRQ(0, acpi->FADT->SCI_Interrupt, 1);
+            return;
+        }
+        warn("Failed to parse _S5 in ACPI");
+        SCI_EN = 0;
+    }
+
+    DSDT::~DSDT()
+    {
+    }
+}
diff --git a/Kernel/Architecture/amd64/MultipleAPICDescriptionTable.cpp b/Kernel/Architecture/amd64/MultipleAPICDescriptionTable.cpp
new file mode 100644
index 00000000..70177fc3
--- /dev/null
+++ b/Kernel/Architecture/amd64/MultipleAPICDescriptionTable.cpp
@@ -0,0 +1,91 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "acpi.hpp"
+
+#include <memory.hpp>
+#include <debug.h>
+
+#include "../../kernel.h"
+
+namespace ACPI
+{
+    MADT::MADT(ACPI::MADTHeader *madt)
+    {
+        trace("Initializing MADT");
+        CPUCores = 0;
+        LAPICAddress = (LAPIC *)(uintptr_t)madt->LocalControllerAddress;
+        for (uint8_t *ptr = (uint8_t *)(madt->Entries);
+             (uintptr_t)(ptr) < (uintptr_t)(madt) + madt->Header.Length;
+             ptr += *(ptr + 1))
+        {
+            switch (*(ptr))
+            {
+            case 0:
+            {
+                if (ptr[4] & 1)
+                {
+                    lapic.push_back((LocalAPIC *)ptr);
+                    KPrint("Local APIC \e8888FF%d\eCCCCCC (APIC \e8888FF%d\eCCCCCC) found.", lapic.back()->ACPIProcessorId, lapic.back()->APICId);
+                    CPUCores++;
+                }
+                break;
+            }
+            case 1:
+            {
+                ioapic.push_back((MADTIOApic *)ptr);
+                KPrint("I/O APIC \e8888FF%d\eCCCCCC (Address \e8888FF%#lx\eCCCCCC) found.", ioapic.back()->APICID, ioapic.back()->Address);
+                Memory::Virtual(KernelPageTable).Map((void *)(uintptr_t)ioapic.back()->Address, (void *)(uintptr_t)ioapic.back()->Address, Memory::PTFlag::RW | Memory::PTFlag::PCD); // Make sure that the address is mapped.
+                break;
+            }
+            case 2:
+            {
+                iso.push_back((MADTIso *)ptr);
+                KPrint("ISO (IRQ:\e8888FF%#lx\eCCCCCC, BUS:\e8888FF%#lx\eCCCCCC, GSI:\e8888FF%#lx\eCCCCCC, %s\eCCCCCC/%s\eCCCCCC) found.",
+                       iso.back()->IRQSource, iso.back()->BuSSource, iso.back()->GSI,
+                       iso.back()->Flags & 0x00000004 ? "\e1770FFActive High" : "\e475EFFActive Low",
+                       iso.back()->Flags & 0x00000100 ? "\e00962DEdge Triggered" : "\e008F58Level Triggered");
+                break;
+            }
+            case 4:
+            {
+                nmi.push_back((MADTNmi *)ptr);
+                KPrint("NMI \e8888FF%#lx\eCCCCCC (lint:\e8888FF%#lx\eCCCCCC) found.", nmi.back()->processor, nmi.back()->lint);
+                break;
+            }
+            case 5:
+            {
+                LAPICAddress = (LAPIC *)ptr;
+                KPrint("APIC found at \e8888FF%#lx\eCCCCCC", LAPICAddress);
+                break;
+            }
+            default:
+            {
+                KPrint("Unknown MADT entry \e8888FF%#lx\eCCCCCC", *(ptr));
+                break;
+            }
+            }
+            Memory::Virtual(KernelPageTable).Map((void *)LAPICAddress, (void *)LAPICAddress, Memory::PTFlag::RW | Memory::PTFlag::PCD); // I should map more than one page?
+        }
+        CPUCores--; // We start at 0 (BSP) and end at 11 (APs), so we have 12 cores.
+        KPrint("Total CPU cores: %d", CPUCores + 1);
+    }
+
+    MADT::~MADT()
+    {
+    }
+}
diff --git a/Kernel/Architecture/amd64/SystemCalls.cpp b/Kernel/Architecture/amd64/SystemCalls.cpp
new file mode 100644
index 00000000..25775b34
--- /dev/null
+++ b/Kernel/Architecture/amd64/SystemCalls.cpp
@@ -0,0 +1,92 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <syscalls.hpp>
+
+#include <cpu.hpp>
+
+#include "cpu/gdt.hpp"
+
+// https://supercip971.github.io/02-wingos-syscalls.html
+using namespace CPU::x64;
+
+// "Core/SystemCalls.cpp"
+extern "C" uint64_t SystemCallsHandler(SyscallsFrame *regs);
+
+extern "C" void SystemCallHandlerStub();
+
+extern "C" __naked __used __no_stack_protector __aligned(16) void SystemCallHandlerStub()
+{
+    asmv("swapgs\n"
+
+         "mov %rsp, %gs:0x8\n" // CPUData->TempStack
+         "mov %gs:0x0, %rsp\n" // CPUData->SystemCallStack
+         "push $0x1b\n"        // user data segment
+         "push %gs:0x8\n"       // saved stack
+         "push %r11\n"         // saved rflags
+         "push $0x23\n"        // user code segment
+         "push %rcx\n"         // Current RIP
+
+         "push %rax\n"
+         "push %rbx\n"
+         "push %rcx\n"
+         "push %rdx\n"
+         "push %rsi\n"
+         "push %rdi\n"
+         "push %rbp\n"
+         "push %r8\n"
+         "push %r9\n"
+         "push %r10\n"
+         "push %r11\n"
+         "push %r12\n"
+         "push %r13\n"
+         "push %r14\n"
+         "push %r15\n"
+
+         "mov %rsp, %rdi\n"
+         "mov $0, %rbp\n"
+         "call SystemCallsHandler\n"
+
+         "pop %r15\n"
+         "pop %r14\n"
+         "pop %r13\n"
+         "pop %r12\n"
+         "pop %r11\n"
+         "pop %r10\n"
+         "pop %r9\n"
+         "pop %r8\n"
+         "pop %rbp\n"
+         "pop %rdi\n"
+         "pop %rsi\n"
+         "pop %rdx\n"
+         "pop %rcx\n"
+         "pop %rbx\n"
+
+         "mov %gs:0x8, %rsp\n" // CPUData->TempStack
+
+         "swapgs\n"
+         "sti\n"
+         "sysretq\n");
+}
+
+void InitializeSystemCalls()
+{
+    wrmsr(MSR_EFER, rdmsr(MSR_EFER) | 1);
+    wrmsr(MSR_STAR, ((uint64_t)(GDT_KERNEL_CODE) << 32) | ((uint64_t)(GDT_KERNEL_DATA | 3) << 48));
+    wrmsr(MSR_LSTAR, (uint64_t)SystemCallHandlerStub);
+    wrmsr(MSR_SYSCALL_MASK, (uint64_t)(1 << 9));
+}
diff --git a/Kernel/Architecture/amd64/acpi.hpp b/Kernel/Architecture/amd64/acpi.hpp
new file mode 100644
index 00000000..1a71f712
--- /dev/null
+++ b/Kernel/Architecture/amd64/acpi.hpp
@@ -0,0 +1,294 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ACPI_H__
+#define __FENNIX_KERNEL_ACPI_H__
+
+#include <types.h>
+
+#include <boot/binfo.h>
+#include <ints.hpp>
+#include <cpu.hpp>
+#include <vector>
+
+namespace ACPI
+{
+    class ACPI
+    {
+    public:
+        struct ACPIHeader
+        {
+            unsigned char Signature[4];
+            uint32_t Length;
+            uint8_t Revision;
+            uint8_t Checksum;
+            uint8_t OEMID[6];
+            uint8_t OEMTableID[8];
+            uint32_t OEMRevision;
+            uint32_t CreatorID;
+            uint32_t CreatorRevision;
+        } __packed;
+
+        struct GenericAddressStructure
+        {
+            uint8_t AddressSpace;
+            uint8_t BitWidth;
+            uint8_t BitOffset;
+            uint8_t AccessSize;
+            uint64_t Address;
+        } __packed;
+
+        struct MCFGHeader
+        {
+            struct ACPIHeader Header;
+            uint64_t Reserved;
+        } __packed;
+
+        struct HPETHeader
+        {
+            ACPIHeader Header;
+            uint8_t HardwareRevID;
+            uint8_t ComparatorCount : 5;
+            uint8_t CounterSize : 1;
+            uint8_t Reserved : 1;
+            uint8_t LegacyReplacement : 1;
+            uint16_t PCIVendorID;
+            struct GenericAddressStructure Address;
+            uint8_t HPETNumber;
+            uint16_t MinimumTick;
+            uint8_t PageProtection;
+        } __packed;
+
+        struct FADTHeader
+        {
+            ACPIHeader Header;
+            uint32_t FirmwareCtrl;
+            uint32_t Dsdt;
+            uint8_t Reserved;
+            uint8_t PreferredPowerManagementProfile;
+            uint16_t SCI_Interrupt;
+            uint32_t SMI_CommandPort;
+            uint8_t AcpiEnable;
+            uint8_t AcpiDisable;
+            uint8_t S4BIOS_REQ;
+            uint8_t PSTATE_Control;
+            uint32_t PM1aEventBlock;
+            uint32_t PM1bEventBlock;
+            uint32_t PM1aControlBlock;
+            uint32_t PM1bControlBlock;
+            uint32_t PM2ControlBlock;
+            uint32_t PMTimerBlock;
+            uint32_t GPE0Block;
+            uint32_t GPE1Block;
+            uint8_t PM1EventLength;
+            uint8_t PM1ControlLength;
+            uint8_t PM2ControlLength;
+            uint8_t PMTimerLength;
+            uint8_t GPE0Length;
+            uint8_t GPE1Length;
+            uint8_t GPE1Base;
+            uint8_t CStateControl;
+            uint16_t WorstC2Latency;
+            uint16_t WorstC3Latency;
+            uint16_t FlushSize;
+            uint16_t FlushStride;
+            uint8_t DutyOffset;
+            uint8_t DutyWidth;
+            uint8_t DayAlarm;
+            uint8_t MonthAlarm;
+            uint8_t Century;
+            uint16_t BootArchitectureFlags;
+            uint8_t Reserved2;
+            uint32_t Flags;
+            struct GenericAddressStructure ResetReg;
+            uint8_t ResetValue;
+            uint8_t Reserved3[3];
+            uint64_t X_FirmwareControl;
+            uint64_t X_Dsdt;
+            struct GenericAddressStructure X_PM1aEventBlock;
+            struct GenericAddressStructure X_PM1bEventBlock;
+            struct GenericAddressStructure X_PM1aControlBlock;
+            struct GenericAddressStructure X_PM1bControlBlock;
+            struct GenericAddressStructure X_PM2ControlBlock;
+            struct GenericAddressStructure X_PMTimerBlock;
+            struct GenericAddressStructure X_GPE0Block;
+            struct GenericAddressStructure X_GPE1Block;
+        } __packed;
+
+        struct BGRTHeader
+        {
+            ACPIHeader Header;
+            uint16_t Version;
+            uint8_t Status;
+            uint8_t ImageType;
+            uint64_t ImageAddress;
+            uint32_t ImageOffsetX;
+            uint32_t ImageOffsetY;
+        };
+
+        struct SRATHeader
+        {
+            ACPIHeader Header;
+            uint32_t TableRevision; // Must be value 1
+            uint64_t Reserved;      // Reserved, must be zero
+        };
+
+        struct TPM2Header
+        {
+            ACPIHeader Header;
+            uint32_t Flags;
+            uint64_t ControlAddress;
+            uint32_t StartMethod;
+        };
+
+        struct TCPAHeader
+        {
+            ACPIHeader Header;
+            uint16_t Reserved;
+            uint32_t MaxLogLength;
+            uint64_t LogAddress;
+        };
+
+        struct WAETHeader
+        {
+            ACPIHeader Header;
+            uint32_t Flags;
+        };
+
+        struct HESTHeader
+        {
+            ACPIHeader Header;
+            uint32_t ErrorSourceCount;
+        };
+
+        struct MADTHeader
+        {
+            ACPIHeader Header;
+            uint32_t LocalControllerAddress;
+            uint32_t Flags;
+            char Entries[];
+        } __packed;
+
+        ACPIHeader *XSDT = nullptr;
+        MCFGHeader *MCFG = nullptr;
+        HPETHeader *HPET = nullptr;
+        FADTHeader *FADT = nullptr;
+        BGRTHeader *BGRT = nullptr;
+        SRATHeader *SRAT = nullptr;
+        TPM2Header *TPM2 = nullptr;
+        TCPAHeader *TCPA = nullptr;
+        WAETHeader *WAET = nullptr;
+        MADTHeader *MADT = nullptr;
+        HESTHeader *HEST = nullptr;
+        bool XSDTSupported = false;
+
+        void *FindTable(ACPIHeader *ACPIHeader, char *Signature);
+        void SearchTables(ACPIHeader *Header);
+        ACPI();
+        ~ACPI();
+    };
+
+    class MADT
+    {
+    public:
+        struct APICHeader
+        {
+            uint8_t Type;
+            uint8_t Length;
+        } __packed;
+
+        struct MADTIOApic
+        {
+            struct APICHeader Header;
+            uint8_t APICID;
+            uint8_t reserved;
+            uint32_t Address;
+            uint32_t GSIBase;
+        } __packed;
+
+        struct MADTIso
+        {
+            struct APICHeader Header;
+            uint8_t BuSSource;
+            uint8_t IRQSource;
+            uint32_t GSI;
+            uint16_t Flags;
+        } __packed;
+
+        struct MADTNmi
+        {
+            struct APICHeader Header;
+            uint8_t processor;
+            uint16_t flags;
+            uint8_t lint;
+        } __packed;
+
+        struct LocalAPIC
+        {
+            struct APICHeader Header;
+            uint8_t ACPIProcessorId;
+            uint8_t APICId;
+            uint32_t Flags;
+        } __packed;
+
+        struct LAPIC
+        {
+            uint8_t id;
+            uintptr_t PhysicalAddress;
+            void *VirtualAddress;
+        };
+
+        std::vector<MADTIOApic *> ioapic;
+        std::vector<MADTIso *> iso;
+        std::vector<MADTNmi *> nmi;
+        std::vector<LocalAPIC *> lapic;
+        struct LAPIC *LAPICAddress;
+        uint16_t CPUCores;
+
+        MADT(ACPI::MADTHeader *madt);
+        ~MADT();
+    };
+
+    class DSDT : public Interrupts::Handler
+    {
+    private:
+        uint32_t SMI_CMD = 0;
+        uint8_t ACPI_ENABLE = 0;
+        uint8_t ACPI_DISABLE = 0;
+        uint32_t PM1a_CNT = 0;
+        uint32_t PM1b_CNT = 0;
+        uint16_t SLP_TYPa = 0;
+        uint16_t SLP_TYPb = 0;
+        uint16_t SLP_EN = 0;
+        uint16_t SCI_EN = 0;
+        uint8_t PM1_CNT_LEN = 0;
+
+        ACPI *acpi;
+        void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+
+    public:
+        bool ACPIShutdownSupported = false;
+
+        void Reboot();
+        void Shutdown();
+
+        DSDT(ACPI *acpi);
+        ~DSDT();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_ACPI_H__
diff --git a/Kernel/Architecture/amd64/cpu/AdvancedProgrammableInterruptController.cpp b/Kernel/Architecture/amd64/cpu/AdvancedProgrammableInterruptController.cpp
new file mode 100644
index 00000000..c19b7358
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/AdvancedProgrammableInterruptController.cpp
@@ -0,0 +1,403 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "apic.hpp"
+
+#include <memory.hpp>
+#include <uart.hpp>
+#include <lock.hpp>
+#include <cpu.hpp>
+#include <smp.hpp>
+#include <io.h>
+
+#include "../../../kernel.h"
+#include "../acpi.hpp"
+
+NewLock(APICLock);
+
+using namespace CPU::x64;
+using namespace CPU::x86;
+
+/*
+In constructor ‘APIC::APIC::APIC(int)’:
+warning: left shift count >= width of type
+|         APICBaseAddress = BaseStruct.ApicBaseLo << 12u | BaseStruct.ApicBaseHi << 32u;
+|                                                          ~~~~~~~~~~~~~~~~~~~~~~^~~~~~
+*/
+#pragma GCC diagnostic ignored "-Wshift-count-overflow"
+
+namespace APIC
+{
+    // headache
+    // https://www.amd.com/system/files/TechDocs/24593.pdf
+    // https://www.naic.edu/~phil/software/intel/318148.pdf
+
+    uint32_t APIC::Read(uint32_t Register)
+    {
+#ifdef DEBUG
+        if (Register != APIC_ICRLO &&
+            Register != APIC_ICRHI &&
+            Register != APIC_ID)
+            debug("APIC::Read(%#lx) [x2=%d]", Register, x2APICSupported ? 1 : 0);
+#endif
+        if (x2APICSupported)
+        {
+            if (Register != APIC_ICRHI)
+                return s_cst(uint32_t, rdmsr((Register >> 4) + 0x800));
+            else
+                return s_cst(uint32_t, rdmsr(0x30 + 0x800));
+        }
+        else
+        {
+            CPU::MemBar::Barrier();
+            uint32_t ret = *((volatile uint32_t *)((uintptr_t)APICBaseAddress + Register));
+            CPU::MemBar::Barrier();
+            return ret;
+        }
+    }
+
+    void APIC::Write(uint32_t Register, uint32_t Value)
+    {
+#ifdef DEBUG
+        if (Register != APIC_EOI &&
+            Register != APIC_TDCR &&
+            Register != APIC_TIMER &&
+            Register != APIC_TICR &&
+            Register != APIC_ICRLO &&
+            Register != APIC_ICRHI)
+            debug("APIC::Write(%#lx, %#lx) [x2=%d]", Register, Value, x2APICSupported ? 1 : 0);
+#endif
+        if (x2APICSupported)
+        {
+            if (Register != APIC_ICRHI)
+                wrmsr((Register >> 4) + 0x800, Value);
+            else
+                wrmsr(MSR_X2APIC_ICR, Value);
+        }
+        else
+        {
+            CPU::MemBar::Barrier();
+            *((volatile uint32_t *)(((uintptr_t)APICBaseAddress) + Register)) = Value;
+            CPU::MemBar::Barrier();
+        }
+    }
+
+    void APIC::IOWrite(uint64_t Base, uint32_t Register, uint32_t Value)
+    {
+        debug("APIC::IOWrite(%#lx, %#lx, %#lx)", Base, Register, Value);
+        CPU::MemBar::Barrier();
+        *((volatile uint32_t *)(((uintptr_t)Base))) = Register;
+        CPU::MemBar::Barrier();
+        *((volatile uint32_t *)(((uintptr_t)Base + 16))) = Value;
+        CPU::MemBar::Barrier();
+    }
+
+    uint32_t APIC::IORead(uint64_t Base, uint32_t Register)
+    {
+        debug("APIC::IORead(%#lx, %#lx)", Base, Register);
+        CPU::MemBar::Barrier();
+        *((volatile uint32_t *)(((uintptr_t)Base))) = Register;
+        CPU::MemBar::Barrier();
+        uint32_t ret = *((volatile uint32_t *)(((uintptr_t)Base + 16)));
+        CPU::MemBar::Barrier();
+        return ret;
+    }
+
+    void APIC::EOI() { this->Write(APIC_EOI, 0); }
+
+    void APIC::WaitForIPI()
+    {
+        InterruptCommandRegisterLow icr = {.raw = 0};
+        do
+        {
+            icr.raw = this->Read(APIC_ICRLO);
+        } while (icr.DeliveryStatus != Idle);
+    }
+
+    void APIC::IPI(int CPU, InterruptCommandRegisterLow icr)
+    {
+        SmartCriticalSection(APICLock);
+        if (x2APICSupported)
+        {
+            wrmsr(MSR_X2APIC_ICR, s_cst(uint32_t, icr.raw));
+            this->WaitForIPI();
+        }
+        else
+        {
+            this->Write(APIC_ICRHI, (CPU << 24));
+            this->Write(APIC_ICRLO, s_cst(uint32_t, icr.raw));
+            this->WaitForIPI();
+        }
+    }
+
+    void APIC::SendInitIPI(int CPU)
+    {
+        SmartCriticalSection(APICLock);
+        if (x2APICSupported)
+        {
+            InterruptCommandRegisterLow icr = {.raw = 0};
+            icr.DeliveryMode = INIT;
+            icr.Level = Assert;
+            wrmsr(MSR_X2APIC_ICR, s_cst(uint32_t, icr.raw));
+            this->WaitForIPI();
+        }
+        else
+        {
+            InterruptCommandRegisterLow icr = {.raw = 0};
+            icr.DeliveryMode = INIT;
+            icr.Level = Assert;
+            this->Write(APIC_ICRHI, (CPU << 24));
+            this->Write(APIC_ICRLO, s_cst(uint32_t, icr.raw));
+            this->WaitForIPI();
+        }
+    }
+
+    void APIC::SendStartupIPI(int CPU, uint64_t StartupAddress)
+    {
+        SmartCriticalSection(APICLock);
+        if (x2APICSupported)
+        {
+            InterruptCommandRegisterLow icr = {.raw = 0};
+            icr.Vector = s_cst(uint8_t, StartupAddress >> 12);
+            icr.DeliveryMode = Startup;
+            icr.Level = Assert;
+            wrmsr(MSR_X2APIC_ICR, s_cst(uint32_t, icr.raw));
+            this->WaitForIPI();
+        }
+        else
+        {
+            InterruptCommandRegisterLow icr = {.raw = 0};
+            icr.Vector = s_cst(uint8_t, StartupAddress >> 12);
+            icr.DeliveryMode = Startup;
+            icr.Level = Assert;
+            this->Write(APIC_ICRHI, (CPU << 24));
+            this->Write(APIC_ICRLO, s_cst(uint32_t, icr.raw));
+            this->WaitForIPI();
+        }
+    }
+
+    uint32_t APIC::IOGetMaxRedirect(uint32_t APICID)
+    {
+        uint32_t TableAddress = (this->IORead((((ACPI::MADT *)PowerManager->GetMADT())->ioapic[APICID]->Address), GetIOAPICVersion));
+        return ((IOAPICVersion *)&TableAddress)->MaximumRedirectionEntry;
+    }
+
+    void APIC::RawRedirectIRQ(uint16_t Vector, uint32_t GSI, uint16_t Flags, int CPU, int Status)
+    {
+        uint64_t Value = Vector;
+
+        int64_t IOAPICTarget = -1;
+        for (uint64_t i = 0; ((ACPI::MADT *)PowerManager->GetMADT())->ioapic[i] != 0; i++)
+            if (((ACPI::MADT *)PowerManager->GetMADT())->ioapic[i]->GSIBase <= GSI)
+                if (((ACPI::MADT *)PowerManager->GetMADT())->ioapic[i]->GSIBase + IOGetMaxRedirect(s_cst(uint32_t, i)) > GSI)
+                {
+                    IOAPICTarget = i;
+                    break;
+                }
+
+        if (IOAPICTarget == -1)
+        {
+            error("No ISO table found for I/O APIC");
+            return;
+        }
+
+        // TODO: IOAPICRedirectEntry Entry = {.raw = 0};
+
+        if (Flags & ActiveHighLow)
+            Value |= (1 << 13);
+
+        if (Flags & EdgeLevel)
+            Value |= (1 << 15);
+
+        if (!Status)
+            Value |= (1 << 16);
+
+        Value |= (((uintptr_t)CPU) << 56);
+        uint32_t IORegister = (GSI - ((ACPI::MADT *)PowerManager->GetMADT())->ioapic[IOAPICTarget]->GSIBase) * 2 + 16;
+
+        this->IOWrite(((ACPI::MADT *)PowerManager->GetMADT())->ioapic[IOAPICTarget]->Address, IORegister, (uint32_t)Value);
+        this->IOWrite(((ACPI::MADT *)PowerManager->GetMADT())->ioapic[IOAPICTarget]->Address, IORegister + 1, (uint32_t)(Value >> 32));
+    }
+
+    void APIC::RedirectIRQ(int CPU, uint16_t IRQ, int Status)
+    {
+        for (uint64_t i = 0; i < ((ACPI::MADT *)PowerManager->GetMADT())->iso.size(); i++)
+            if (((ACPI::MADT *)PowerManager->GetMADT())->iso[i]->IRQSource == IRQ)
+            {
+                debug("[ISO %d] Mapping to source IRQ%#d GSI:%#lx on CPU %d",
+                      i, ((ACPI::MADT *)PowerManager->GetMADT())->iso[i]->IRQSource, ((ACPI::MADT *)PowerManager->GetMADT())->iso[i]->GSI, CPU);
+
+                this->RawRedirectIRQ(((ACPI::MADT *)PowerManager->GetMADT())->iso[i]->IRQSource + 0x20, ((ACPI::MADT *)PowerManager->GetMADT())->iso[i]->GSI, ((ACPI::MADT *)PowerManager->GetMADT())->iso[i]->Flags, CPU, Status);
+                return;
+            }
+        debug("Mapping IRQ%d on CPU %d", IRQ, CPU);
+        this->RawRedirectIRQ(IRQ + 0x20, IRQ, 0, CPU, Status);
+    }
+
+    void APIC::RedirectIRQs(int CPU)
+    {
+        SmartCriticalSection(APICLock);
+        debug("Redirecting IRQs...");
+        for (uint8_t i = 0; i < 16; i++)
+            this->RedirectIRQ(CPU, i, 1);
+        debug("Redirecting IRQs completed.");
+    }
+
+    APIC::APIC(int Core)
+    {
+        SmartCriticalSection(APICLock);
+        APIC_BASE BaseStruct = {.raw = rdmsr(MSR_APIC_BASE)};
+        uint64_t BaseLow = BaseStruct.ApicBaseLo;
+        uint64_t BaseHigh = BaseStruct.ApicBaseHi;
+        this->APICBaseAddress = BaseLow << 12u | BaseHigh << 32u;
+        trace("APIC Address: %#lx", this->APICBaseAddress);
+        Memory::Virtual().Map((void *)this->APICBaseAddress, (void *)this->APICBaseAddress, Memory::PTFlag::RW | Memory::PTFlag::PCD);
+
+        bool x2APICSupported = false;
+        if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+        {
+            CPU::x86::AMD::CPUID0x00000001 cpuid;
+            cpuid.Get();
+            if (cpuid.ECX.x2APIC)
+            {
+                // x2APICSupported = cpuid.ECX.x2APIC;
+                fixme("x2APIC is supported");
+            }
+        }
+        else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+        {
+            CPU::x86::Intel::CPUID0x00000001 cpuid;
+            cpuid.Get();
+            if (cpuid.ECX.x2APIC)
+            {
+                // x2APICSupported = cpuid.ECX.x2APIC;
+                fixme("x2APIC is supported");
+            }
+        }
+
+        if (x2APICSupported)
+        {
+            this->x2APICSupported = true;
+            wrmsr(MSR_APIC_BASE, (rdmsr(MSR_APIC_BASE) | (1 << 11)) & ~(1 << 10));
+            BaseStruct.EN = 1;
+            wrmsr(MSR_APIC_BASE, BaseStruct.raw);
+        }
+        else
+        {
+            BaseStruct.EN = 1;
+            wrmsr(MSR_APIC_BASE, BaseStruct.raw);
+        }
+
+        this->Write(APIC_TPR, 0x0);
+        // this->Write(APIC_SVR, this->Read(APIC_SVR) | 0x100); // 0x1FF or 0x100 ? on https://wiki.osdev.org/APIC is 0x100
+
+        if (!this->x2APICSupported)
+        {
+            this->Write(APIC_DFR, 0xF0000000);
+            this->Write(APIC_LDR, this->Read(APIC_ID));
+        }
+
+        ACPI::MADT *madt = (ACPI::MADT *)PowerManager->GetMADT();
+
+        for (size_t i = 0; i < madt->nmi.size(); i++)
+        {
+            if (madt->nmi[i]->processor != 0xFF && Core != madt->nmi[i]->processor)
+                return;
+
+            uint32_t nmi = 0x402;
+            if (madt->nmi[i]->flags & 2)
+                nmi |= 1 << 13;
+            if (madt->nmi[i]->flags & 8)
+                nmi |= 1 << 15;
+            if (madt->nmi[i]->lint == 0)
+                this->Write(APIC_LINT0, nmi);
+            else if (madt->nmi[i]->lint == 1)
+                this->Write(APIC_LINT1, nmi);
+        }
+
+        // Setup the spurrious interrupt vector
+        Spurious Spurious = {.raw = this->Read(APIC_SVR)};
+        Spurious.Vector = IRQ223; // TODO: Should I map the IRQ to something?
+        Spurious.Software = 1;
+        this->Write(APIC_SVR, s_cst(uint32_t, Spurious.raw));
+
+        static int once = 0;
+        if (!once++)
+        {
+            // Disable PIT
+            outb(0x43, 0x28);
+            outb(0x40, 0x0);
+
+            // Disable PIC
+            outb(0x21, 0xFF);
+            outb(0xA1, 0xFF);
+        }
+    }
+
+    APIC::~APIC() {}
+
+    void Timer::OnInterruptReceived(TrapFrame *Frame) { UNUSED(Frame); }
+
+    void Timer::OneShot(uint32_t Vector, uint64_t Miliseconds)
+    {
+        SmartCriticalSection(APICLock);
+        LVTTimer timer = {.raw = 0};
+        timer.Vector = s_cst(uint8_t, Vector);
+        timer.TimerMode = 0;
+        if (strcmp(CPU::Hypervisor(), x86_CPUID_VENDOR_TCG) != 0)
+            this->lapic->Write(APIC_TDCR, DivideBy128);
+        else
+            this->lapic->Write(APIC_TDCR, DivideBy16);
+        this->lapic->Write(APIC_TICR, s_cst(uint32_t, Ticks * Miliseconds));
+        this->lapic->Write(APIC_TIMER, s_cst(uint32_t, timer.raw));
+    }
+
+    Timer::Timer(APIC *apic) : Interrupts::Handler(0) /* IRQ0 */
+    {
+        SmartCriticalSection(APICLock);
+        this->lapic = apic;
+        LVTTimerDivide Divider = DivideBy16;
+
+        trace("Initializing APIC timer on CPU %d", GetCurrentCPU()->ID);
+
+        this->lapic->Write(APIC_TDCR, Divider);
+        this->lapic->Write(APIC_TICR, 0xFFFFFFFF);
+
+        TimeManager->Sleep(1, Time::Units::Milliseconds);
+
+        // Mask the timer
+        this->lapic->Write(APIC_TIMER, 0x10000 /* LVTTimer.Mask flag */);
+        Ticks = 0xFFFFFFFF - this->lapic->Read(APIC_TCCR);
+
+        // Config for IRQ0 timer
+        LVTTimer timer = {.raw = 0};
+        timer.Vector = IRQ0;
+        timer.Mask = Unmasked;
+        timer.TimerMode = LVTTimerMode::OneShot;
+
+        // Initialize APIC timer
+        this->lapic->Write(APIC_TDCR, Divider);
+        this->lapic->Write(APIC_TICR, s_cst(uint32_t, Ticks));
+        this->lapic->Write(APIC_TIMER, s_cst(uint32_t, timer.raw));
+        trace("%d APIC Timer %d ticks in.", GetCurrentCPU()->ID, Ticks);
+        KPrint("APIC Timer: \e8888FF%ld\eCCCCCC ticks.", Ticks);
+    }
+
+    Timer::~Timer()
+    {
+    }
+}
diff --git a/Kernel/Architecture/amd64/cpu/GlobalDescriptorTable.cpp b/Kernel/Architecture/amd64/cpu/GlobalDescriptorTable.cpp
new file mode 100644
index 00000000..5dc43dea
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/GlobalDescriptorTable.cpp
@@ -0,0 +1,214 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "gdt.hpp"
+
+#include <memory.hpp>
+#include <smp.hpp>
+#include <cpu.hpp>
+#include <debug.h>
+
+namespace GlobalDescriptorTable
+{
+    static GlobalDescriptorTableEntries GDTEntriesTemplate = {
+        .Null =
+            {
+                .Length = 0x0,
+                .BaseLow = 0x0,
+                .BaseMiddle = 0x0,
+                .Access = {.Raw = 0x0},
+                .Flags = {.Raw = 0x0},
+                .BaseHigh = 0x0,
+            },
+
+        .Code =
+            {
+                .Length = 0x0,
+                .BaseLow = 0x0,
+                .BaseMiddle = 0x0,
+                .Access = {
+                    .A = 0,
+                    .RW = 1,
+                    .DC = 0,
+                    .E = 1,
+                    .S = 1,
+                    .DPL = 0,
+                    .P = 1,
+                },
+                .Flags = {
+                    .Unknown = 0x0,
+                    .L = 1,
+                },
+                .BaseHigh = 0x0,
+            },
+
+        .Data = {
+            .Length = 0x0,
+            .BaseLow = 0x0,
+            .BaseMiddle = 0x0,
+            .Access = {
+                .A = 0,
+                .RW = 1,
+                .DC = 0,
+                .E = 0,
+                .S = 1,
+                .DPL = 0,
+                .P = 1,
+            },
+            .Flags = {.Raw = 0x0},
+            .BaseHigh = 0x0,
+        },
+
+        .UserData = {
+            .Length = 0x0,
+            .BaseLow = 0x0,
+            .BaseMiddle = 0x0,
+            .Access = {
+                .A = 0,
+                .RW = 1,
+                .DC = 0,
+                .E = 0,
+                .S = 1,
+                .DPL = 3,
+                .P = 1,
+            },
+            .Flags = {
+                .Raw = 0x0,
+            },
+            .BaseHigh = 0x0,
+        },
+
+        .UserCode = {
+            .Length = 0x0,
+            .BaseLow = 0x0,
+            .BaseMiddle = 0x0,
+            .Access = {
+                .A = 0,
+                .RW = 1,
+                .DC = 0,
+                .E = 1,
+                .S = 1,
+                .DPL = 3,
+                .P = 1,
+            },
+            .Flags = {
+                .Unknown = 0x0,
+                .L = 1,
+            },
+            .BaseHigh = 0x0,
+        },
+
+        .TaskStateSegment = {},
+    };
+
+    GlobalDescriptorTableEntries GDTEntries[MAX_CPU] __aligned(16);
+    GlobalDescriptorTableDescriptor gdt[MAX_CPU] __aligned(16);
+
+    TaskStateSegment tss[MAX_CPU] = {
+        0,
+        {0, 0, 0},
+        0,
+        {0, 0, 0, 0, 0, 0, 0},
+        0,
+        0,
+        0,
+    };
+
+    void *CPUStackPointer[MAX_CPU];
+
+    SafeFunction void Init(int Core)
+    {
+        memcpy(&GDTEntries[Core], &GDTEntriesTemplate, sizeof(GlobalDescriptorTableEntries));
+        gdt[Core] = {.Length = sizeof(GlobalDescriptorTableEntries) - 1, .Entries = &GDTEntries[Core]};
+
+        debug("Kernel: Code Access: %ld; Data Access: %ld", GDTEntries[Core].Code.Access.Raw, GDTEntries[Core].Data.Access.Raw);
+        debug("Kernel: Code Flags: %ld; Data Flags: %ld", GDTEntries[Core].Code.Flags.Raw, GDTEntries[Core].Data.Flags.Raw);
+        debug("User: Code Access: %ld; Data Access: %ld", GDTEntries[Core].UserCode.Access.Raw, GDTEntries[Core].UserData.Access.Raw);
+        debug("User: Code Flags: %ld; Data Flags: %ld", GDTEntries[Core].UserCode.Flags.Raw, GDTEntries[Core].UserData.Flags.Raw);
+        CPU::x64::lgdt(&gdt[Core]);
+
+        asmv("movq %%rsp, %%rax\n"
+             "pushq $16\n"
+             "pushq %%rax\n"
+             "pushfq\n"
+             "pushq $8\n"
+             "pushq $1f\n"
+             "iretq\n"
+             "1:\n"
+             "movw $16, %%ax\n"
+             "movw %%ax, %%ds\n"
+             "movw %%ax, %%es\n" ::
+                 : "memory", "rax");
+
+        CPUStackPointer[Core] = KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE + 1));
+        memset(CPUStackPointer[Core], 0, STACK_SIZE);
+        debug("CPU %d Stack Pointer: %#lx-%#lx (%d pages)", Core,
+              CPUStackPointer[Core], (uintptr_t)CPUStackPointer[Core] + STACK_SIZE,
+              TO_PAGES(STACK_SIZE + 1));
+
+        uintptr_t Base = (uintptr_t)&tss[Core];
+        size_t Limit = Base + sizeof(TaskStateSegment);
+        gdt[Core].Entries->TaskStateSegment.Length = Limit & 0xFFFF;
+        gdt[Core].Entries->TaskStateSegment.BaseLow = Base & 0xFFFF;
+        gdt[Core].Entries->TaskStateSegment.BaseMiddle = (Base >> 16) & 0xFF;
+        gdt[Core].Entries->TaskStateSegment.BaseHigh = (Base >> 24) & 0xFF;
+        gdt[Core].Entries->TaskStateSegment.BaseUpper = s_cst(uint32_t, (Base >> 32) & 0xFFFFFFFF);
+        gdt[Core].Entries->TaskStateSegment.Flags = {.A = 1, .RW = 0, .DC = 0, .E = 1, .S = 0, .DPL = 0, .P = 1};
+        gdt[Core].Entries->TaskStateSegment.Granularity = (0 << 4) | ((Limit >> 16) & 0xF);
+
+        tss[Core].IOMapBaseAddressOffset = sizeof(TaskStateSegment);
+        tss[Core].StackPointer[0] = (uint64_t)CPUStackPointer[Core] + STACK_SIZE;
+
+        for (size_t i = 0; i < sizeof(tss[Core].InterruptStackTable) / sizeof(tss[Core].InterruptStackTable[7]); i++)
+        {
+            void *NewStack = KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE + 1));
+
+            tss[Core].InterruptStackTable[i] = (uint64_t)NewStack + STACK_SIZE;
+            memset((void *)(tss[Core].InterruptStackTable[i] - STACK_SIZE), 0, STACK_SIZE);
+            debug("IST-%d: %#lx-%#lx", i, NewStack, (uintptr_t)NewStack + STACK_SIZE);
+        }
+
+        CPU::x64::ltr(GDT_TSS);
+
+        debug("GDT_KERNEL_CODE: %#lx", GDT_KERNEL_CODE);
+        debug("GDT_KERNEL_DATA: %#lx", GDT_KERNEL_DATA);
+        debug("GDT_USER_CODE: %#lx", GDT_USER_CODE);
+        debug("GDT_USER_DATA: %#lx", GDT_USER_DATA);
+        debug("GDT_TSS: %#lx", GDT_TSS);
+        debug("Global Descriptor Table initialized");
+    }
+
+    SafeFunction void SetKernelStack(void *Stack)
+    {
+        long CPUID = GetCurrentCPU()->ID;
+        if (Stack != nullptr)
+            tss[CPUID].StackPointer[0] = (uint64_t)Stack;
+        else
+            tss[CPUID].StackPointer[0] = (uint64_t)CPUStackPointer[CPUID] + STACK_SIZE;
+
+        /*
+        FIXME: There's a bug in kernel which if
+        we won't update "tss[CPUID].StackPointer[0]"
+        with the current stack pointer, the kernel
+        will crash.
+        */
+        asmv("mov %%rsp, %0"
+             : "=r"(tss[CPUID].StackPointer[0]));
+    }
+
+    void *GetKernelStack() { return (void *)tss[GetCurrentCPU()->ID].StackPointer[0]; }
+}
diff --git a/Kernel/Architecture/amd64/cpu/InterruptDescriptorTable.cpp b/Kernel/Architecture/amd64/cpu/InterruptDescriptorTable.cpp
new file mode 100644
index 00000000..3cf6f9c3
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/InterruptDescriptorTable.cpp
@@ -0,0 +1,757 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "idt.hpp"
+
+#include <memory.hpp>
+#include <cpu.hpp>
+#include <debug.h>
+#include <io.h>
+
+#include "gdt.hpp"
+#include "../../../kernel.h"
+
+/* conversion from ‘uint64_t’ {aka ‘long unsigned int’} to ‘unsigned char:2’ may change value */
+#pragma GCC diagnostic ignored "-Wconversion"
+
+extern "C" void MainInterruptHandler(void *Data);
+extern "C" void ExceptionHandler(void *Data);
+
+namespace InterruptDescriptorTable
+{
+    static InterruptDescriptorTableEntry Entries[0x100];
+
+    InterruptDescriptorTableDescriptor idtd = {
+        .Length = sizeof(Entries) - 1,
+        .Entries = Entries,
+    };
+
+    void SetEntry(uint8_t Index,
+                  void (*Base)(),
+                  InterruptStackTableType InterruptStackTable,
+                  InterruptGateType Gate,
+                  InterruptRingType Ring,
+                  bool Present,
+                  uint16_t SegmentSelector)
+    {
+        Entries[Index].BaseLow = s_cst(uint16_t, ((uint64_t)Base & 0xFFFF));
+        Entries[Index].BaseHigh = s_cst(uint64_t, ((uint64_t)Base >> 16 /* & 0xFFFF */));
+        Entries[Index].SegmentSelector = SegmentSelector;
+        Entries[Index].Flags = Gate;
+        Entries[Index].Reserved1 = 0;
+        Entries[Index].Reserved2 = 0;
+        Entries[Index].Reserved3 = 0;
+        Entries[Index].InterruptStackTable = InterruptStackTable;
+        Entries[Index].Ring = Ring;
+        Entries[Index].Present = Present;
+    }
+
+    extern "C" __naked __used __no_stack_protector __aligned(16) void ExceptionHandlerStub()
+    {
+        asm("cld\n"
+            "cli\n"
+
+            "pushq %rax\n"
+            "pushq %rbx\n"
+            "pushq %rcx\n"
+            "pushq %rdx\n"
+            "pushq %rsi\n"
+            "pushq %rdi\n"
+            "pushq %rbp\n"
+            "pushq %r8\n"
+            "pushq %r9\n"
+            "pushq %r10\n"
+            "pushq %r11\n"
+            "pushq %r12\n"
+            "pushq %r13\n"
+            "pushq %r14\n"
+            "pushq %r15\n"
+
+            "movq %rsp, %rdi\n"
+            "call ExceptionHandler\n"
+
+            "popq %r15\n"
+            "popq %r14\n"
+            "popq %r13\n"
+            "popq %r12\n"
+            "popq %r11\n"
+            "popq %r10\n"
+            "popq %r9\n"
+            "popq %r8\n"
+            "popq %rbp\n"
+            "popq %rdi\n"
+            "popq %rsi\n"
+            "popq %rdx\n"
+            "popq %rcx\n"
+            "popq %rbx\n"
+            "popq %rax\n"
+
+            "addq $16, %rsp\n"
+
+            "iretq"); // pop CS RIP RFLAGS SS RSP
+    }
+
+    extern "C" __naked __used __no_stack_protector __aligned(16) void InterruptHandlerStub()
+    {
+        asm("cld\n"
+            "cli\n"
+
+            "pushq %rax\n"
+            "pushq %rbx\n"
+            "pushq %rcx\n"
+            "pushq %rdx\n"
+            "pushq %rsi\n"
+            "pushq %rdi\n"
+            "pushq %rbp\n"
+            "pushq %r8\n"
+            "pushq %r9\n"
+            "pushq %r10\n"
+            "pushq %r11\n"
+            "pushq %r12\n"
+            "pushq %r13\n"
+            "pushq %r14\n"
+            "pushq %r15\n"
+
+            "movq %rsp, %rdi\n"
+            "call MainInterruptHandler\n"
+
+            "popq %r15\n"
+            "popq %r14\n"
+            "popq %r13\n"
+            "popq %r12\n"
+            "popq %r11\n"
+            "popq %r10\n"
+            "popq %r9\n"
+            "popq %r8\n"
+            "popq %rbp\n"
+            "popq %rdi\n"
+            "popq %rsi\n"
+            "popq %rdx\n"
+            "popq %rcx\n"
+            "popq %rbx\n"
+            "popq %rax\n"
+
+            "addq $16, %rsp\n"
+
+            "sti\n"
+            "iretq"); // pop CS RIP RFLAGS SS RSP
+    }
+
+#pragma region Exceptions
+
+#define EXCEPTION_HANDLER(num)                                                             \
+    __naked __used __no_stack_protector __aligned(16) static void InterruptHandler_##num() \
+    {                                                                                      \
+        asm("pushq $0\npushq $" #num "\n"                                                  \
+            "jmp ExceptionHandlerStub");                                                   \
+    }
+
+#define EXCEPTION_ERROR_HANDLER(num)                                                       \
+    __naked __used __no_stack_protector __aligned(16) static void InterruptHandler_##num() \
+    {                                                                                      \
+        asm("pushq $" #num "\n"                                                            \
+            "jmp ExceptionHandlerStub");                                                   \
+    }
+
+#define INTERRUPT_HANDLER(num)                                                      \
+    __naked __used __no_stack_protector __aligned(16) void InterruptHandler_##num() \
+    {                                                                               \
+        asm("pushq $0\npushq $" #num "\n"                                           \
+            "jmp InterruptHandlerStub\n");                                          \
+    }
+
+    /* ISR */
+
+    EXCEPTION_HANDLER(0x0);
+    EXCEPTION_HANDLER(0x1);
+    EXCEPTION_HANDLER(0x2);
+    EXCEPTION_HANDLER(0x3);
+    EXCEPTION_HANDLER(0x4);
+    EXCEPTION_HANDLER(0x5);
+    EXCEPTION_HANDLER(0x6);
+    EXCEPTION_HANDLER(0x7);
+    EXCEPTION_ERROR_HANDLER(0x8);
+    EXCEPTION_HANDLER(0x9);
+    EXCEPTION_ERROR_HANDLER(0xa);
+    EXCEPTION_ERROR_HANDLER(0xb);
+    EXCEPTION_ERROR_HANDLER(0xc);
+    EXCEPTION_ERROR_HANDLER(0xd);
+    EXCEPTION_ERROR_HANDLER(0xe);
+    EXCEPTION_HANDLER(0xf);
+    EXCEPTION_ERROR_HANDLER(0x10);
+    EXCEPTION_HANDLER(0x11);
+    EXCEPTION_HANDLER(0x12);
+    EXCEPTION_HANDLER(0x13);
+    EXCEPTION_HANDLER(0x14);
+    EXCEPTION_HANDLER(0x15);
+    EXCEPTION_HANDLER(0x16);
+    EXCEPTION_HANDLER(0x17);
+    EXCEPTION_HANDLER(0x18);
+    EXCEPTION_HANDLER(0x19);
+    EXCEPTION_HANDLER(0x1a);
+    EXCEPTION_HANDLER(0x1b);
+    EXCEPTION_HANDLER(0x1c);
+    EXCEPTION_HANDLER(0x1d);
+    EXCEPTION_HANDLER(0x1e);
+    EXCEPTION_HANDLER(0x1f);
+
+    /* IRQ */
+
+    INTERRUPT_HANDLER(0x20)
+    INTERRUPT_HANDLER(0x21)
+    INTERRUPT_HANDLER(0x22)
+    INTERRUPT_HANDLER(0x23)
+    INTERRUPT_HANDLER(0x24)
+    INTERRUPT_HANDLER(0x25)
+    INTERRUPT_HANDLER(0x26)
+    INTERRUPT_HANDLER(0x27)
+    INTERRUPT_HANDLER(0x28)
+    INTERRUPT_HANDLER(0x29)
+    INTERRUPT_HANDLER(0x2a)
+    INTERRUPT_HANDLER(0x2b)
+    INTERRUPT_HANDLER(0x2c)
+    INTERRUPT_HANDLER(0x2d)
+    INTERRUPT_HANDLER(0x2e)
+    INTERRUPT_HANDLER(0x2f)
+
+    /* Reserved by OS */
+
+    INTERRUPT_HANDLER(0x30)
+    INTERRUPT_HANDLER(0x31)
+    INTERRUPT_HANDLER(0x32)
+    INTERRUPT_HANDLER(0x33)
+    INTERRUPT_HANDLER(0x34)
+    INTERRUPT_HANDLER(0x35)
+    INTERRUPT_HANDLER(0x36)
+    INTERRUPT_HANDLER(0x37)
+    INTERRUPT_HANDLER(0x38)
+    INTERRUPT_HANDLER(0x39)
+    INTERRUPT_HANDLER(0x3a)
+    INTERRUPT_HANDLER(0x3b)
+    INTERRUPT_HANDLER(0x3c)
+    INTERRUPT_HANDLER(0x3d)
+
+    /* Free */
+
+    INTERRUPT_HANDLER(0x3e)
+    INTERRUPT_HANDLER(0x3f)
+    INTERRUPT_HANDLER(0x40)
+    INTERRUPT_HANDLER(0x41)
+    INTERRUPT_HANDLER(0x42)
+    INTERRUPT_HANDLER(0x43)
+    INTERRUPT_HANDLER(0x44)
+    INTERRUPT_HANDLER(0x45)
+    INTERRUPT_HANDLER(0x46)
+    INTERRUPT_HANDLER(0x47)
+    INTERRUPT_HANDLER(0x48)
+    INTERRUPT_HANDLER(0x49)
+    INTERRUPT_HANDLER(0x4a)
+    INTERRUPT_HANDLER(0x4b)
+    INTERRUPT_HANDLER(0x4c)
+    INTERRUPT_HANDLER(0x4d)
+    INTERRUPT_HANDLER(0x4e)
+    INTERRUPT_HANDLER(0x4f)
+    INTERRUPT_HANDLER(0x50)
+    INTERRUPT_HANDLER(0x51)
+    INTERRUPT_HANDLER(0x52)
+    INTERRUPT_HANDLER(0x53)
+    INTERRUPT_HANDLER(0x54)
+    INTERRUPT_HANDLER(0x55)
+    INTERRUPT_HANDLER(0x56)
+    INTERRUPT_HANDLER(0x57)
+    INTERRUPT_HANDLER(0x58)
+    INTERRUPT_HANDLER(0x59)
+    INTERRUPT_HANDLER(0x5a)
+    INTERRUPT_HANDLER(0x5b)
+    INTERRUPT_HANDLER(0x5c)
+    INTERRUPT_HANDLER(0x5d)
+    INTERRUPT_HANDLER(0x5e)
+    INTERRUPT_HANDLER(0x5f)
+    INTERRUPT_HANDLER(0x60)
+    INTERRUPT_HANDLER(0x61)
+    INTERRUPT_HANDLER(0x62)
+    INTERRUPT_HANDLER(0x63)
+    INTERRUPT_HANDLER(0x64)
+    INTERRUPT_HANDLER(0x65)
+    INTERRUPT_HANDLER(0x66)
+    INTERRUPT_HANDLER(0x67)
+    INTERRUPT_HANDLER(0x68)
+    INTERRUPT_HANDLER(0x69)
+    INTERRUPT_HANDLER(0x6a)
+    INTERRUPT_HANDLER(0x6b)
+    INTERRUPT_HANDLER(0x6c)
+    INTERRUPT_HANDLER(0x6d)
+    INTERRUPT_HANDLER(0x6e)
+    INTERRUPT_HANDLER(0x6f)
+    INTERRUPT_HANDLER(0x70)
+    INTERRUPT_HANDLER(0x71)
+    INTERRUPT_HANDLER(0x72)
+    INTERRUPT_HANDLER(0x73)
+    INTERRUPT_HANDLER(0x74)
+    INTERRUPT_HANDLER(0x75)
+    INTERRUPT_HANDLER(0x76)
+    INTERRUPT_HANDLER(0x77)
+    INTERRUPT_HANDLER(0x78)
+    INTERRUPT_HANDLER(0x79)
+    INTERRUPT_HANDLER(0x7a)
+    INTERRUPT_HANDLER(0x7b)
+    INTERRUPT_HANDLER(0x7c)
+    INTERRUPT_HANDLER(0x7d)
+    INTERRUPT_HANDLER(0x7e)
+    INTERRUPT_HANDLER(0x7f)
+    INTERRUPT_HANDLER(0x80)
+    INTERRUPT_HANDLER(0x81)
+    INTERRUPT_HANDLER(0x82)
+    INTERRUPT_HANDLER(0x83)
+    INTERRUPT_HANDLER(0x84)
+    INTERRUPT_HANDLER(0x85)
+    INTERRUPT_HANDLER(0x86)
+    INTERRUPT_HANDLER(0x87)
+    INTERRUPT_HANDLER(0x88)
+    INTERRUPT_HANDLER(0x89)
+    INTERRUPT_HANDLER(0x8a)
+    INTERRUPT_HANDLER(0x8b)
+    INTERRUPT_HANDLER(0x8c)
+    INTERRUPT_HANDLER(0x8d)
+    INTERRUPT_HANDLER(0x8e)
+    INTERRUPT_HANDLER(0x8f)
+    INTERRUPT_HANDLER(0x90)
+    INTERRUPT_HANDLER(0x91)
+    INTERRUPT_HANDLER(0x92)
+    INTERRUPT_HANDLER(0x93)
+    INTERRUPT_HANDLER(0x94)
+    INTERRUPT_HANDLER(0x95)
+    INTERRUPT_HANDLER(0x96)
+    INTERRUPT_HANDLER(0x97)
+    INTERRUPT_HANDLER(0x98)
+    INTERRUPT_HANDLER(0x99)
+    INTERRUPT_HANDLER(0x9a)
+    INTERRUPT_HANDLER(0x9b)
+    INTERRUPT_HANDLER(0x9c)
+    INTERRUPT_HANDLER(0x9d)
+    INTERRUPT_HANDLER(0x9e)
+    INTERRUPT_HANDLER(0x9f)
+    INTERRUPT_HANDLER(0xa0)
+    INTERRUPT_HANDLER(0xa1)
+    INTERRUPT_HANDLER(0xa2)
+    INTERRUPT_HANDLER(0xa3)
+    INTERRUPT_HANDLER(0xa4)
+    INTERRUPT_HANDLER(0xa5)
+    INTERRUPT_HANDLER(0xa6)
+    INTERRUPT_HANDLER(0xa7)
+    INTERRUPT_HANDLER(0xa8)
+    INTERRUPT_HANDLER(0xa9)
+    INTERRUPT_HANDLER(0xaa)
+    INTERRUPT_HANDLER(0xab)
+    INTERRUPT_HANDLER(0xac)
+    INTERRUPT_HANDLER(0xad)
+    INTERRUPT_HANDLER(0xae)
+    INTERRUPT_HANDLER(0xaf)
+    INTERRUPT_HANDLER(0xb0)
+    INTERRUPT_HANDLER(0xb1)
+    INTERRUPT_HANDLER(0xb2)
+    INTERRUPT_HANDLER(0xb3)
+    INTERRUPT_HANDLER(0xb4)
+    INTERRUPT_HANDLER(0xb5)
+    INTERRUPT_HANDLER(0xb6)
+    INTERRUPT_HANDLER(0xb7)
+    INTERRUPT_HANDLER(0xb8)
+    INTERRUPT_HANDLER(0xb9)
+    INTERRUPT_HANDLER(0xba)
+    INTERRUPT_HANDLER(0xbb)
+    INTERRUPT_HANDLER(0xbc)
+    INTERRUPT_HANDLER(0xbd)
+    INTERRUPT_HANDLER(0xbe)
+    INTERRUPT_HANDLER(0xbf)
+    INTERRUPT_HANDLER(0xc0)
+    INTERRUPT_HANDLER(0xc1)
+    INTERRUPT_HANDLER(0xc2)
+    INTERRUPT_HANDLER(0xc3)
+    INTERRUPT_HANDLER(0xc4)
+    INTERRUPT_HANDLER(0xc5)
+    INTERRUPT_HANDLER(0xc6)
+    INTERRUPT_HANDLER(0xc7)
+    INTERRUPT_HANDLER(0xc8)
+    INTERRUPT_HANDLER(0xc9)
+    INTERRUPT_HANDLER(0xca)
+    INTERRUPT_HANDLER(0xcb)
+    INTERRUPT_HANDLER(0xcc)
+    INTERRUPT_HANDLER(0xcd)
+    INTERRUPT_HANDLER(0xce)
+    INTERRUPT_HANDLER(0xcf)
+    INTERRUPT_HANDLER(0xd0)
+    INTERRUPT_HANDLER(0xd1)
+    INTERRUPT_HANDLER(0xd2)
+    INTERRUPT_HANDLER(0xd3)
+    INTERRUPT_HANDLER(0xd4)
+    INTERRUPT_HANDLER(0xd5)
+    INTERRUPT_HANDLER(0xd6)
+    INTERRUPT_HANDLER(0xd7)
+    INTERRUPT_HANDLER(0xd8)
+    INTERRUPT_HANDLER(0xd9)
+    INTERRUPT_HANDLER(0xda)
+    INTERRUPT_HANDLER(0xdb)
+    INTERRUPT_HANDLER(0xdc)
+    INTERRUPT_HANDLER(0xdd)
+    INTERRUPT_HANDLER(0xde)
+    INTERRUPT_HANDLER(0xdf)
+    INTERRUPT_HANDLER(0xe0)
+    INTERRUPT_HANDLER(0xe1)
+    INTERRUPT_HANDLER(0xe2)
+    INTERRUPT_HANDLER(0xe3)
+    INTERRUPT_HANDLER(0xe4)
+    INTERRUPT_HANDLER(0xe5)
+    INTERRUPT_HANDLER(0xe6)
+    INTERRUPT_HANDLER(0xe7)
+    INTERRUPT_HANDLER(0xe8)
+    INTERRUPT_HANDLER(0xe9)
+    INTERRUPT_HANDLER(0xea)
+    INTERRUPT_HANDLER(0xeb)
+    INTERRUPT_HANDLER(0xec)
+    INTERRUPT_HANDLER(0xed)
+    INTERRUPT_HANDLER(0xee)
+    INTERRUPT_HANDLER(0xef)
+    INTERRUPT_HANDLER(0xf0)
+    INTERRUPT_HANDLER(0xf1)
+    INTERRUPT_HANDLER(0xf2)
+    INTERRUPT_HANDLER(0xf3)
+    INTERRUPT_HANDLER(0xf4)
+    INTERRUPT_HANDLER(0xf5)
+    INTERRUPT_HANDLER(0xf6)
+    INTERRUPT_HANDLER(0xf7)
+    INTERRUPT_HANDLER(0xf8)
+    INTERRUPT_HANDLER(0xf9)
+    INTERRUPT_HANDLER(0xfa)
+    INTERRUPT_HANDLER(0xfb)
+    INTERRUPT_HANDLER(0xfc)
+    INTERRUPT_HANDLER(0xfd)
+    INTERRUPT_HANDLER(0xfe)
+    INTERRUPT_HANDLER(0xff)
+
+#pragma endregion Exceptions
+
+    void Init(int Core)
+    {
+        if (Core == 0) /* Disable PIC using BSP */
+        {
+            // PIC
+            outb(0x20, 0x10 | 0x1);
+            outb(0x80, 0);
+            outb(0xA0, 0x10 | 0x10);
+            outb(0x80, 0);
+
+            outb(0x21, 0x20);
+            outb(0x80, 0);
+            outb(0xA1, 0x28);
+            outb(0x80, 0);
+
+            outb(0x21, 0x04);
+            outb(0x80, 0);
+            outb(0xA1, 0x02);
+            outb(0x80, 0);
+
+            outb(0x21, 1);
+            outb(0x80, 0);
+            outb(0xA1, 1);
+            outb(0x80, 0);
+
+            // Masking and disabling PIC
+            outb(0x21, 0xff);
+            outb(0x80, 0);
+            outb(0xA1, 0xff);
+        }
+
+        /* ISR */
+
+#ifdef DEBUG
+        // if (!DebuggerIsAttached)
+        if (true)
+        {
+#endif
+            SetEntry(0x0, InterruptHandler_0x0, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1, InterruptHandler_0x1, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x2, InterruptHandler_0x2, IST2, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x3, InterruptHandler_0x3, IST1, TRAP_32BIT, RING3, (!DebuggerIsAttached), GDT_KERNEL_CODE); /* Do not handle breakpoints if we are debugging the kernel. */
+            SetEntry(0x4, InterruptHandler_0x4, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x5, InterruptHandler_0x5, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x6, InterruptHandler_0x6, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x7, InterruptHandler_0x7, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x8, InterruptHandler_0x8, IST3, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x9, InterruptHandler_0x9, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0xa, InterruptHandler_0xa, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0xb, InterruptHandler_0xb, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0xc, InterruptHandler_0xc, IST3, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0xd, InterruptHandler_0xd, IST3, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0xe, InterruptHandler_0xe, IST3, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0xf, InterruptHandler_0xf, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x10, InterruptHandler_0x10, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x11, InterruptHandler_0x11, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x12, InterruptHandler_0x12, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x13, InterruptHandler_0x13, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x14, InterruptHandler_0x14, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x15, InterruptHandler_0x15, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x16, InterruptHandler_0x16, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x17, InterruptHandler_0x17, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x18, InterruptHandler_0x18, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x19, InterruptHandler_0x19, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1a, InterruptHandler_0x1a, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1b, InterruptHandler_0x1b, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1c, InterruptHandler_0x1c, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1d, InterruptHandler_0x1d, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1e, InterruptHandler_0x1e, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+            SetEntry(0x1f, InterruptHandler_0x1f, IST1, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+#ifdef DEBUG
+        }
+        else
+            KPrint("\eFFA500The debugger is attached, not setting up the ISR.");
+#endif
+
+        /* IRQ */
+
+        SetEntry(0x20, InterruptHandler_0x20, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x21, InterruptHandler_0x21, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x22, InterruptHandler_0x22, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x23, InterruptHandler_0x23, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x24, InterruptHandler_0x24, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x25, InterruptHandler_0x25, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x26, InterruptHandler_0x26, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x27, InterruptHandler_0x27, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x28, InterruptHandler_0x28, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x29, InterruptHandler_0x29, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x2a, InterruptHandler_0x2a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x2b, InterruptHandler_0x2b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x2c, InterruptHandler_0x2c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x2d, InterruptHandler_0x2d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x2e, InterruptHandler_0x2e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x2f, InterruptHandler_0x2f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+
+        /* Reserved by OS */
+
+        SetEntry(0x30, InterruptHandler_0x30, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x31, InterruptHandler_0x31, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x32, InterruptHandler_0x32, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x33, InterruptHandler_0x33, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x34, InterruptHandler_0x34, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x35, InterruptHandler_0x35, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x36, InterruptHandler_0x36, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x37, InterruptHandler_0x37, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x38, InterruptHandler_0x38, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x39, InterruptHandler_0x39, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x3a, InterruptHandler_0x3a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x3b, InterruptHandler_0x3b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x3c, InterruptHandler_0x3c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x3d, InterruptHandler_0x3d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+
+        /* Free */
+
+        SetEntry(0x3e, InterruptHandler_0x3e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x3f, InterruptHandler_0x3f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x40, InterruptHandler_0x40, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x41, InterruptHandler_0x41, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x42, InterruptHandler_0x42, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x43, InterruptHandler_0x43, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x44, InterruptHandler_0x44, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x45, InterruptHandler_0x45, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x46, InterruptHandler_0x46, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x47, InterruptHandler_0x47, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x48, InterruptHandler_0x48, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x49, InterruptHandler_0x49, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x4a, InterruptHandler_0x4a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x4b, InterruptHandler_0x4b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x4c, InterruptHandler_0x4c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x4d, InterruptHandler_0x4d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x4e, InterruptHandler_0x4e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x4f, InterruptHandler_0x4f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x50, InterruptHandler_0x50, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x51, InterruptHandler_0x51, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x52, InterruptHandler_0x52, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x53, InterruptHandler_0x53, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x54, InterruptHandler_0x54, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x55, InterruptHandler_0x55, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x56, InterruptHandler_0x56, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x57, InterruptHandler_0x57, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x58, InterruptHandler_0x58, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x59, InterruptHandler_0x59, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x5a, InterruptHandler_0x5a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x5b, InterruptHandler_0x5b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x5c, InterruptHandler_0x5c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x5d, InterruptHandler_0x5d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x5e, InterruptHandler_0x5e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x5f, InterruptHandler_0x5f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x60, InterruptHandler_0x60, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x61, InterruptHandler_0x61, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x62, InterruptHandler_0x62, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x63, InterruptHandler_0x63, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x64, InterruptHandler_0x64, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x65, InterruptHandler_0x65, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x66, InterruptHandler_0x66, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x67, InterruptHandler_0x67, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x68, InterruptHandler_0x68, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x69, InterruptHandler_0x69, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x6a, InterruptHandler_0x6a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x6b, InterruptHandler_0x6b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x6c, InterruptHandler_0x6c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x6d, InterruptHandler_0x6d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x6e, InterruptHandler_0x6e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x6f, InterruptHandler_0x6f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x70, InterruptHandler_0x70, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x71, InterruptHandler_0x71, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x72, InterruptHandler_0x72, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x73, InterruptHandler_0x73, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x74, InterruptHandler_0x74, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x75, InterruptHandler_0x75, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x76, InterruptHandler_0x76, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x77, InterruptHandler_0x77, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x78, InterruptHandler_0x78, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x79, InterruptHandler_0x79, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x7a, InterruptHandler_0x7a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x7b, InterruptHandler_0x7b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x7c, InterruptHandler_0x7c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x7d, InterruptHandler_0x7d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x7e, InterruptHandler_0x7e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x7f, InterruptHandler_0x7f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x80, InterruptHandler_0x80, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x81, InterruptHandler_0x81, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x82, InterruptHandler_0x82, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x83, InterruptHandler_0x83, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x84, InterruptHandler_0x84, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x85, InterruptHandler_0x85, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x86, InterruptHandler_0x86, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x87, InterruptHandler_0x87, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x88, InterruptHandler_0x88, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x89, InterruptHandler_0x89, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x8a, InterruptHandler_0x8a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x8b, InterruptHandler_0x8b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x8c, InterruptHandler_0x8c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x8d, InterruptHandler_0x8d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x8e, InterruptHandler_0x8e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x8f, InterruptHandler_0x8f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x90, InterruptHandler_0x90, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x91, InterruptHandler_0x91, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x92, InterruptHandler_0x92, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x93, InterruptHandler_0x93, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x94, InterruptHandler_0x94, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x95, InterruptHandler_0x95, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x96, InterruptHandler_0x96, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x97, InterruptHandler_0x97, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x98, InterruptHandler_0x98, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x99, InterruptHandler_0x99, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x9a, InterruptHandler_0x9a, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x9b, InterruptHandler_0x9b, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x9c, InterruptHandler_0x9c, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x9d, InterruptHandler_0x9d, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x9e, InterruptHandler_0x9e, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0x9f, InterruptHandler_0x9f, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa0, InterruptHandler_0xa0, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa1, InterruptHandler_0xa1, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa2, InterruptHandler_0xa2, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa3, InterruptHandler_0xa3, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa4, InterruptHandler_0xa4, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa5, InterruptHandler_0xa5, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa6, InterruptHandler_0xa6, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa7, InterruptHandler_0xa7, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa8, InterruptHandler_0xa8, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xa9, InterruptHandler_0xa9, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xaa, InterruptHandler_0xaa, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xab, InterruptHandler_0xab, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xac, InterruptHandler_0xac, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xad, InterruptHandler_0xad, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xae, InterruptHandler_0xae, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xaf, InterruptHandler_0xaf, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb0, InterruptHandler_0xb0, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb1, InterruptHandler_0xb1, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb2, InterruptHandler_0xb2, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb3, InterruptHandler_0xb3, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb4, InterruptHandler_0xb4, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb5, InterruptHandler_0xb5, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb6, InterruptHandler_0xb6, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb7, InterruptHandler_0xb7, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb8, InterruptHandler_0xb8, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xb9, InterruptHandler_0xb9, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xba, InterruptHandler_0xba, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xbb, InterruptHandler_0xbb, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xbc, InterruptHandler_0xbc, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xbd, InterruptHandler_0xbd, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xbe, InterruptHandler_0xbe, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xbf, InterruptHandler_0xbf, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc0, InterruptHandler_0xc0, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc1, InterruptHandler_0xc1, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc2, InterruptHandler_0xc2, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc3, InterruptHandler_0xc3, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc4, InterruptHandler_0xc4, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc5, InterruptHandler_0xc5, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc6, InterruptHandler_0xc6, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc7, InterruptHandler_0xc7, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc8, InterruptHandler_0xc8, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xc9, InterruptHandler_0xc9, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xca, InterruptHandler_0xca, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xcb, InterruptHandler_0xcb, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xcc, InterruptHandler_0xcc, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xcd, InterruptHandler_0xcd, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xce, InterruptHandler_0xce, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xcf, InterruptHandler_0xcf, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd0, InterruptHandler_0xd0, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd1, InterruptHandler_0xd1, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd2, InterruptHandler_0xd2, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd3, InterruptHandler_0xd3, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd4, InterruptHandler_0xd4, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd5, InterruptHandler_0xd5, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd6, InterruptHandler_0xd6, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd7, InterruptHandler_0xd7, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd8, InterruptHandler_0xd8, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xd9, InterruptHandler_0xd9, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xda, InterruptHandler_0xda, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xdb, InterruptHandler_0xdb, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xdc, InterruptHandler_0xdc, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xdd, InterruptHandler_0xdd, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xde, InterruptHandler_0xde, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xdf, InterruptHandler_0xdf, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe0, InterruptHandler_0xe0, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe1, InterruptHandler_0xe1, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe2, InterruptHandler_0xe2, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe3, InterruptHandler_0xe3, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe4, InterruptHandler_0xe4, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe5, InterruptHandler_0xe5, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe6, InterruptHandler_0xe6, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe7, InterruptHandler_0xe7, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe8, InterruptHandler_0xe8, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xe9, InterruptHandler_0xe9, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xea, InterruptHandler_0xea, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xeb, InterruptHandler_0xeb, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xec, InterruptHandler_0xec, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xed, InterruptHandler_0xed, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xee, InterruptHandler_0xee, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xef, InterruptHandler_0xef, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf0, InterruptHandler_0xf0, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf1, InterruptHandler_0xf1, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf2, InterruptHandler_0xf2, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf3, InterruptHandler_0xf3, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf4, InterruptHandler_0xf4, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf5, InterruptHandler_0xf5, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf6, InterruptHandler_0xf6, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf7, InterruptHandler_0xf7, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf8, InterruptHandler_0xf8, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xf9, InterruptHandler_0xf9, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xfa, InterruptHandler_0xfa, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xfb, InterruptHandler_0xfb, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xfc, InterruptHandler_0xfc, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xfd, InterruptHandler_0xfd, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xfe, InterruptHandler_0xfe, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        SetEntry(0xff, InterruptHandler_0xff, IST0, TRAP_32BIT, RING0, true, GDT_KERNEL_CODE);
+        CPU::x64::lidt(&idtd);
+    }
+}
diff --git a/Kernel/Architecture/amd64/cpu/SMPTrampoline.asm b/Kernel/Architecture/amd64/cpu/SMPTrampoline.asm
new file mode 100644
index 00000000..ca690e67
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/SMPTrampoline.asm
@@ -0,0 +1,136 @@
+;   This file is part of Fennix Kernel.
+;
+;   Fennix Kernel is free software: you can redistribute it and/or
+;   modify it under the terms of the GNU General Public License as
+;   published by the Free Software Foundation, either version 3 of
+;   the License, or (at your option) any later version.
+;
+;   Fennix Kernel is distributed in the hope that it will be useful,
+;   but WITHOUT ANY WARRANTY; without even the implied warranty of
+;   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+;   GNU General Public License for more details.
+;
+;   You should have received a copy of the GNU General Public License
+;   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+
+; This has to be the same as enum SMPTrampolineAddress.
+TRAMPOLINE_PAGE_TABLE equ 0x500
+TRAMPOLINE_START_ADDR equ 0x520
+TRAMPOLINE_STACK equ 0x570
+TRAMPOLINE_GDT equ 0x580
+TRAMPOLINE_IDT equ 0x590
+TRAMPOLINE_CORE equ 0x600
+TRAMPOLINE_START equ 0x2000
+
+[bits 16]
+
+extern StartCPU
+global _trampoline_start
+_trampoline_start:
+    cli
+    mov ax, 0x0
+    mov ds, ax
+    mov es, ax
+    mov fs, ax
+    mov gs, ax
+    mov ss, ax
+    o32 lgdt [ProtectedMode_gdtr - _trampoline_start + TRAMPOLINE_START]
+    mov eax, cr0
+    or al, 0x1
+    mov cr0, eax
+    jmp 0x8:(Trampoline32 - _trampoline_start + TRAMPOLINE_START)
+
+[bits 32]
+section .text
+Trampoline32:
+    mov bx, 0x10
+    mov ds, bx
+    mov es, bx
+    mov ss, bx
+    mov eax, dword [TRAMPOLINE_PAGE_TABLE]
+    mov cr3, eax
+    mov eax, cr4
+    or eax, 1 << 5 ; Set the PAE-bit, which is the 6th bit (bit 5).
+    or eax, 1 << 7
+    mov cr4, eax
+    mov ecx, 0xc0000080
+    rdmsr
+    or eax,1 << 8 ; LME
+    wrmsr
+    mov eax, cr0
+    or eax, 1 << 31
+    mov cr0, eax
+    lgdt [LongMode_gdtr - _trampoline_start + TRAMPOLINE_START]
+    jmp 0x8:(Trampoline64 - _trampoline_start + TRAMPOLINE_START)
+
+[bits 64]
+Trampoline64:
+    mov ax, 0x10
+    mov ds, ax
+    mov es, ax
+    mov ss, ax
+    mov ax, 0x0
+    mov fs, ax
+    mov gs, ax
+    lgdt [TRAMPOLINE_GDT]
+    lidt [TRAMPOLINE_IDT]
+    mov rsp, [TRAMPOLINE_STACK]
+    mov rbp, 0x0 ; Terminate stack traces here.
+    ; Reset RFLAGS.
+    push 0x0
+    popf
+    mov rax, qword vcode64
+    call vcode64
+
+vcode64:
+    push rbp
+    ; Set up SSE
+    mov rax, cr0
+    ; btr eax, 2
+    ; bts eax, 1
+    ; mov cr0, rax
+    mov rax, cr4
+    bts eax, 9
+    bts eax, 10
+    mov cr4, rax
+    mov rax, qword TrampolineExit
+    call rax
+
+align 16
+LongMode_gdtr:
+    dw LongModeGDTEnd - LongModeGDTStart - 1
+    dq LongModeGDTStart - _trampoline_start + TRAMPOLINE_START
+
+align 16
+LongModeGDTStart:
+    dq 0 ; NULL segment
+    dq 0x00AF98000000FFFF ; Code segment
+    dq 0x00CF92000000FFFF ; Data segment
+LongModeGDTEnd:
+
+align 16
+ProtectedMode_gdtr:
+    dw ProtectedModeGDTEnd - ProtectedModeGDTStart - 1
+    dd ProtectedModeGDTStart - _trampoline_start + TRAMPOLINE_START
+
+align 16
+ProtectedModeGDTStart:
+    dq 0 ; NULL segment
+    dq 0x00CF9A000000FFFF ; Code segment
+    dq 0x00CF92000000FFFF ; Data segment
+ProtectedModeGDTEnd:
+
+align 16
+ProtectedMode_idtr:
+    dw 0
+    dd 0
+    dd 0
+    align 16
+
+global _trampoline_end
+_trampoline_end:
+
+TrampolineExit:
+    call StartCPU
+
+times 512 - ($-$$) db 0
diff --git a/Kernel/Architecture/amd64/cpu/SymmetricMultiprocessing.cpp b/Kernel/Architecture/amd64/cpu/SymmetricMultiprocessing.cpp
new file mode 100644
index 00000000..fce30d26
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/SymmetricMultiprocessing.cpp
@@ -0,0 +1,141 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <smp.hpp>
+
+#include <memory.hpp>
+#include <ints.hpp>
+#include <assert.h>
+#include <cpu.hpp>
+#include <atomic>
+
+#include "../../../kernel.h"
+#include "../acpi.hpp"
+#include "apic.hpp"
+
+extern "C" uint64_t _trampoline_start, _trampoline_end;
+
+/* https://wiki.osdev.org/Memory_Map_(x86) */
+enum SMPTrampolineAddress
+{
+    PAGE_TABLE = 0x500,
+    START_ADDR = 0x520,
+    STACK = 0x570,
+    GDT = 0x580,
+    IDT = 0x590,
+    CORE = 0x600,
+    TRAMPOLINE_START = 0x2000
+};
+
+std::atomic_bool CPUEnabled = false;
+
+#pragma GCC diagnostic ignored "-Wmissing-field-initializers"
+static __aligned(PAGE_SIZE) CPUData CPUs[MAX_CPU] = {0};
+
+SafeFunction CPUData *GetCPU(long id) { return &CPUs[id]; }
+
+SafeFunction CPUData *GetCurrentCPU()
+{
+    if (unlikely(!Interrupts::apic[0]))
+        return &CPUs[0]; /* No APIC means we are on the BSP. */
+
+    int CoreID = ((APIC::APIC *)Interrupts::apic[0])->Read(APIC::APIC_ID) >> 24;
+
+    if (unlikely((&CPUs[CoreID])->IsActive != true))
+    {
+        error("CPU %d is not active!", CoreID);
+        assert((&CPUs[0])->IsActive == true); /* We can't continue without the BSP. */
+        return &CPUs[0];
+    }
+
+    assert((&CPUs[CoreID])->Checksum == CPU_DATA_CHECKSUM); /* This should never happen. */
+    return &CPUs[CoreID];
+}
+
+extern "C" void StartCPU()
+{
+    CPU::Interrupts(CPU::Disable);
+    int CoreID = (int)*reinterpret_cast<int *>(CORE);
+    CPU::InitializeFeatures(CoreID);
+    // Initialize GDT and IDT
+    Interrupts::Initialize(CoreID);
+    Interrupts::Enable(CoreID);
+    Interrupts::InitializeTimer(CoreID);
+    asmv("mov %0, %%rsp" ::"r"((&CPUs[CoreID])->Stack));
+
+    CPU::Interrupts(CPU::Enable);
+    KPrint("\e058C19CPU \e8888FF%d \e058C19is online", CoreID);
+    CPUEnabled.store(true, std::memory_order_release);
+    CPU::Halt(true);
+}
+
+namespace SMP
+{
+    int CPUCores = 0;
+
+    void Initialize(void *madt)
+    {
+        int Cores = ((ACPI::MADT *)madt)->CPUCores + 1;
+
+        if (Config.Cores > ((ACPI::MADT *)madt)->CPUCores + 1)
+            KPrint("More cores requested than available. Using %d cores", ((ACPI::MADT *)madt)->CPUCores + 1);
+        else if (Config.Cores != 0)
+            Cores = Config.Cores;
+
+        CPUCores = Cores;
+
+        uint64_t TrampolineLength = (uintptr_t)&_trampoline_end - (uintptr_t)&_trampoline_start;
+        Memory::Virtual().Map(0x0, 0x0, Memory::PTFlag::RW);
+        /* We reserved the TRAMPOLINE_START address inside Physical class. */
+        Memory::Virtual().Map((void *)TRAMPOLINE_START, (void *)TRAMPOLINE_START, TrampolineLength, Memory::PTFlag::RW);
+        memcpy((void *)TRAMPOLINE_START, &_trampoline_start, TrampolineLength);
+        debug("Trampoline address: %#lx-%#lx", TRAMPOLINE_START, TRAMPOLINE_START + TrampolineLength);
+
+        void *CPUTmpStack = KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE + 1));
+        asmv("sgdt [0x580]\n"
+             "sidt [0x590]\n");
+        VPOKE(uintptr_t, STACK) = (uintptr_t)CPUTmpStack + STACK_SIZE;
+        VPOKE(uintptr_t, PAGE_TABLE) = (uintptr_t)KernelPageTable;
+        VPOKE(uint64_t, START_ADDR) = (uintptr_t)&StartCPU;
+
+        for (int i = 0; i < Cores; i++)
+        {
+            debug("Initializing CPU %d", i);
+            if ((((APIC::APIC *)Interrupts::apic[0])->Read(APIC::APIC_ID) >> 24) != ((ACPI::MADT *)madt)->lapic[i]->ACPIProcessorId)
+            {
+                VPOKE(int, CORE) = i;
+
+                ((APIC::APIC *)Interrupts::apic[0])->Write(APIC::APIC_ICRHI, (((ACPI::MADT *)madt)->lapic[i]->APICId << 24));
+                ((APIC::APIC *)Interrupts::apic[0])->Write(APIC::APIC_ICRLO, 0x500);
+
+                ((APIC::APIC *)Interrupts::apic[0])->SendInitIPI(((ACPI::MADT *)madt)->lapic[i]->APICId);
+                ((APIC::APIC *)Interrupts::apic[0])->SendStartupIPI(((ACPI::MADT *)madt)->lapic[i]->APICId, TRAMPOLINE_START);
+
+                while (!CPUEnabled.load(std::memory_order_acquire))
+                    CPU::Pause();
+                CPUEnabled.store(false, std::memory_order_release);
+                trace("CPU %d loaded.", ((ACPI::MADT *)madt)->lapic[i]->APICId);
+            }
+            else
+                KPrint("\e058C19CPU \e8888FF%d \e058C19is the BSP", ((ACPI::MADT *)madt)->lapic[i]->APICId);
+        }
+
+        KernelAllocator.FreePages(CPUTmpStack, TO_PAGES(STACK_SIZE + 1));
+        /* We are going to unmap the page after we are done with it. */
+        Memory::Virtual().Unmap(0x0);
+    }
+}
diff --git a/Kernel/Architecture/amd64/cpu/apic.hpp b/Kernel/Architecture/amd64/cpu/apic.hpp
new file mode 100644
index 00000000..e93c33a0
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/apic.hpp
@@ -0,0 +1,354 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_APIC_H__
+#define __FENNIX_KERNEL_APIC_H__
+
+#include <types.h>
+
+#include <ints.hpp>
+#include <cpu.hpp>
+
+namespace APIC
+{
+    enum APICRegisters
+    {
+        // source from: https://github.com/pdoane/osdev/blob/master/intr/local_apic.c
+        APIC_ID = 0x20,       // Local APIC ID
+        APIC_VER = 0x30,      // Local APIC Version
+        APIC_TPR = 0x80,      // Task Priority
+        APIC_APR = 0x90,      // Arbitration Priority
+        APIC_PPR = 0xA0,      // Processor Priority
+        APIC_EOI = 0xB0,      // EOI
+        APIC_RRD = 0xC0,      // Remote Read
+        APIC_LDR = 0xD0,      // Logical Destination
+        APIC_DFR = 0xE0,      // Destination Format
+        APIC_SVR = 0xF0,      // Spurious Interrupt Vector
+        APIC_ISR = 0x100,     // In-Service (8 registers)
+        APIC_TMR = 0x180,     // Trigger Mode (8 registers)
+        APIC_IRR = 0x200,     // Interrupt Request (8 registers)
+        APIC_ESR = 0x280,     // Error Status
+        APIC_ICRLO = 0x300,   // Interrupt Command
+        APIC_ICRHI = 0x310,   // Interrupt Command [63:32]
+        APIC_TIMER = 0x320,   // LVT Timer
+        APIC_THERMAL = 0x330, // LVT Thermal Sensor
+        APIC_PERF = 0x340,    // LVT Performance Counter
+        APIC_LINT0 = 0x350,   // LVT LINT0
+        APIC_LINT1 = 0x360,   // LVT LINT1
+        APIC_ERROR = 0x370,   // LVT Error
+        APIC_TICR = 0x380,    // Initial Count (for Timer)
+        APIC_TCCR = 0x390,    // Current Count (for Timer)
+        APIC_TDCR = 0x3E0,    // Divide Configuration (for Timer)
+    };
+
+    enum IOAPICRegisters
+    {
+        GetIOAPICVersion = 0x1
+    };
+
+    enum IOAPICFlags
+    {
+        ActiveHighLow = 2,
+        EdgeLevel = 8
+    };
+
+    enum APICDeliveryMode
+    {
+        Fixed = 0b000,
+        LowestPriority = 0b001, /* Reserved */
+        SMI = 0b010,
+        APIC_DELIVERY_MODE_RESERVED0 = 0b011, /* Reserved */
+        NMI = 0b100,
+        INIT = 0b101,
+        Startup = 0b110,
+        ExtINT = 0b111 /* Reserved */
+    };
+
+    enum APICDestinationMode
+    {
+        Physical = 0b0,
+        Logical = 0b1
+    };
+
+    enum APICDeliveryStatus
+    {
+        Idle = 0b0,
+        SendPending = 0b1
+    };
+
+    enum APICLevel
+    {
+        DeAssert = 0b0,
+        Assert = 0b1
+    };
+
+    enum APICTriggerMode
+    {
+        Edge = 0b0,
+        Level = 0b1
+    };
+
+    enum APICDestinationShorthand
+    {
+        NoShorthand = 0b00,
+        Self = 0b01,
+        AllIncludingSelf = 0b10,
+        AllExcludingSelf = 0b11
+    };
+
+    enum LVTTimerDivide
+    {
+        DivideBy2 = 0b000,
+        DivideBy4 = 0b001,
+        DivideBy8 = 0b010,
+        DivideBy16 = 0b011,
+        DivideBy32 = 0b100,
+        DivideBy64 = 0b101,
+        DivideBy128 = 0b110,
+        DivideBy1 = 0b111
+    };
+
+    enum LVTTimerMask
+    {
+        Unmasked = 0b0,
+        Masked = 0b1
+    };
+
+    enum LVTTimerMode
+    {
+        OneShot = 0b00,
+        Periodic = 0b01,
+        TSCDeadline = 0b10
+    };
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Interrupt Vector */
+            uint64_t Vector : 8;
+            /** @brief Reserved */
+            uint64_t Reserved0 : 4;
+            /**
+             * @brief Delivery Status
+             *
+             * 0: Idle
+             * 1: Send Pending
+             */
+            uint64_t DeliveryStatus : 1;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 3;
+            /**
+             * @brief Mask
+             *
+             * 0: Not masked
+             * 1: Masked
+             */
+            uint64_t Mask : 1;
+            /** @brief Timer Mode
+             *
+             * 0: One-shot
+             * 1: Periodic
+             * 2: TSC-Deadline
+             */
+            uint64_t TimerMode : 1;
+            /** @brief Reserved */
+            uint64_t Reserved2 : 14;
+        };
+        uint64_t raw;
+    } __packed LVTTimer;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Spurious Vector */
+            uint64_t Vector : 8;
+            /** @brief Enable or disable APIC software */
+            uint64_t Software : 1;
+            /** @brief Focus Processor Checking */
+            uint64_t FocusProcessorChecking : 1;
+            /** @brief Reserved */
+            uint64_t Reserved : 2;
+            /** @brief Disable EOI Broadcast */
+            uint64_t DisableEOIBroadcast : 1;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 19;
+        };
+        uint64_t raw;
+    } __packed Spurious;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Interrupt Vector */
+            uint64_t Vector : 8;
+            /** @brief Delivery Mode */
+            uint64_t DeliveryMode : 3;
+            /** @brief Destination Mode
+             *
+             * 0: Physical
+             * 1: Logical
+             */
+            uint64_t DestinationMode : 1;
+            /** @brief Delivery Status
+             *
+             * @note Reserved when in x2APIC mode
+             */
+            uint64_t DeliveryStatus : 1;
+            /** @brief Reserved */
+            uint64_t Reserved0 : 1;
+            /** @brief Level
+             *
+             * 0: Deassert
+             * 1: Assert
+             */
+            uint64_t Level : 1;
+            /** @brief Trigger Mode
+             *
+             * 0: Edge
+             * 1: Level
+             */
+            uint64_t TriggerMode : 1;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 2;
+            /** @brief Destination Shorthand
+             *
+             * 0: No shorthand
+             * 1: Self
+             * 2: All including self
+             * 3: All excluding self
+             */
+            uint64_t DestinationShorthand : 2;
+            /** @brief Reserved */
+            uint64_t Reserved2 : 12;
+        };
+        uint64_t raw;
+    } __packed InterruptCommandRegisterLow;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Reserved */
+            uint64_t Reserved0 : 24;
+            /** @brief Destination */
+            uint64_t Destination : 8;
+        };
+        uint64_t raw;
+    } __packed InterruptCommandRegisterHigh;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Interrupt Vector */
+            uint64_t Vector : 8;
+            /** @brief Delivery Mode */
+            uint64_t DeliveryMode : 3;
+            /** @brief Destination Mode
+             *
+             * 0: Physical
+             * 1: Logical
+             */
+            uint64_t DestinationMode : 1;
+            /** @brief Delivery Status */
+            uint64_t DeliveryStatus : 1;
+            /** @brief Interrupt Input Pin Polarity
+             *
+             * 0: Active High
+             * 1: Active Low
+             */
+            uint64_t Polarity : 1;
+            /** @brief Remote IRR */
+            uint64_t RemoteIRR : 1;
+            /** @brief Trigger Mode
+             *
+             * 0: Edge
+             * 1: Level
+             */
+            uint64_t TriggerMode : 1;
+            /** @brief Mask */
+            uint64_t Mask : 1;
+            /** @brief Reserved */
+            uint64_t Reserved0 : 15;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 24;
+            /** @brief Destination */
+            uint64_t DestinationID : 8;
+        };
+        struct
+        {
+            uint64_t Low;
+            uint64_t High;
+        } split;
+        uint64_t raw;
+    } __packed IOAPICRedirectEntry;
+
+    typedef union
+    {
+        struct
+        {
+            uint64_t Version : 8;
+            uint64_t Reserved : 8;
+            uint64_t MaximumRedirectionEntry : 8;
+            uint64_t Reserved2 : 8;
+        };
+        uint64_t raw;
+    } __packed IOAPICVersion;
+
+    class APIC
+    {
+    private:
+        bool x2APICSupported = false;
+        uint64_t APICBaseAddress = 0;
+
+    public:
+        uint32_t Read(uint32_t Register);
+        void Write(uint32_t Register, uint32_t Value);
+        void IOWrite(uint64_t Base, uint32_t Register, uint32_t Value);
+        uint32_t IORead(uint64_t Base, uint32_t Register);
+        void EOI();
+        void RedirectIRQs(int CPU = 0);
+        void WaitForIPI();
+        void IPI(int CPU, InterruptCommandRegisterLow icr);
+        void SendInitIPI(int CPU);
+        void SendStartupIPI(int CPU, uint64_t StartupAddress);
+        uint32_t IOGetMaxRedirect(uint32_t APICID);
+        void RawRedirectIRQ(uint16_t Vector, uint32_t GSI, uint16_t Flags, int CPU, int Status);
+        void RedirectIRQ(int CPU, uint16_t IRQ, int Status);
+        APIC(int Core);
+        ~APIC();
+    };
+
+    class Timer : public Interrupts::Handler
+    {
+    private:
+        APIC *lapic;
+        uint64_t Ticks = 0;
+        void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+
+    public:
+        uint64_t GetTicks() { return Ticks; }
+        void OneShot(uint32_t Vector, uint64_t Miliseconds);
+        Timer(APIC *apic);
+        ~Timer();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_APIC_H__
diff --git a/Kernel/Architecture/amd64/cpu/gdt.hpp b/Kernel/Architecture/amd64/cpu/gdt.hpp
new file mode 100644
index 00000000..7eec05d6
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/gdt.hpp
@@ -0,0 +1,164 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_GDT_H__
+#define __FENNIX_KERNEL_GDT_H__
+
+#include <types.h>
+
+namespace GlobalDescriptorTable
+{
+    /** @brief The GDT Access Table
+     * @details For more information, see https://wiki.osdev.org/Global_Descriptor_Table
+     */
+    union GlobalDescriptorTableAccess
+    {
+        struct
+        {
+            /** @brief Access bit.
+             * @note The CPU sets this bit to 1 when the segment is accessed.
+             */
+            uint64_t A : 1;
+
+            /** @brief Readable bit for code segments, writable bit for data segments.
+             * @details For code segments, this bit must be 1 for the segment to be readable.
+             * @details For data segments, this bit must be 1 for the segment to be writable.
+             */
+            uint64_t RW : 1;
+
+            /** @brief Direction bit for data segments, conforming bit for code segments.
+             * @details For data segments, this bit must be 1 for the segment to grow up (higher addresses).
+             * @details For code segments, this bit must be 1 for code in the segment to be able to be executed from an equal or lower privilege level.
+             */
+            uint64_t DC : 1;
+
+            /** @brief Executable bit.
+             * @details This bit must be 1 for code-segment descriptors.
+             * @details This bit must be 0 for data-segment and system descriptors.
+             */
+            uint64_t E : 1;
+
+            /** @brief Descriptor type.
+             * @details This bit must be 0 for system descriptors.
+             * @details This bit must be 1 for code or data segment descriptor.
+             */
+            uint64_t S : 1;
+
+            /** @brief Descriptor privilege level.
+             * @details This field determines the privilege level of the segment.
+             * @details 0 = kernel mode, 3 = user mode.
+             */
+            uint64_t DPL : 2;
+
+            /** @brief Present bit.
+             * @details This bit must be 1 for all valid descriptors.
+             */
+            uint64_t P : 1;
+        } __packed;
+        uint8_t Raw;
+    };
+
+    union GlobalDescriptorTableFlags
+    {
+        // TODO: Add more flags.
+        struct
+        {
+            /** @brief Unknown. */
+            uint64_t Unknown : 5;
+
+            /** @brief Long mode.
+             * @details If the long mode bit is clear, the segment is in 32-bit protected mode.
+             * @details If the long mode bit is set, the segment is in 64-bit long mode.
+             */
+            uint64_t L : 1;
+        } __packed;
+        uint8_t Raw;
+    };
+
+    typedef struct _TaskStateSegmentEntry
+    {
+        /* LOW */
+        uint16_t Length;
+        uint16_t BaseLow;
+        uint8_t BaseMiddle;
+        GlobalDescriptorTableAccess Flags;
+        uint8_t Granularity;
+        uint8_t BaseHigh;
+        /* HIGH */
+        uint32_t BaseUpper;
+        uint32_t Reserved;
+    } __packed TaskStateSegmentEntry;
+
+    typedef struct _TaskStateSegment
+    {
+        uint32_t Reserved0 __aligned(16);
+        uint64_t StackPointer[3];
+        uint64_t Reserved1;
+        uint64_t InterruptStackTable[7];
+        uint64_t Reserved2;
+        uint16_t Reserved3;
+        uint16_t IOMapBaseAddressOffset;
+    } __packed TaskStateSegment;
+
+    typedef struct _GlobalDescriptorTableEntry
+    {
+        /** @brief Length */
+        uint16_t Length;
+        /** @brief Low Base */
+        uint16_t BaseLow;
+        /** @brief Middle Base */
+        uint8_t BaseMiddle;
+        /** @brief Access */
+        GlobalDescriptorTableAccess Access;
+        /** @brief Flags */
+        GlobalDescriptorTableFlags Flags;
+        /** @brief High Base */
+        uint8_t BaseHigh;
+    } __packed GlobalDescriptorTableEntry;
+
+    typedef struct _GlobalDescriptorTableEntries
+    {
+        GlobalDescriptorTableEntry Null;
+        GlobalDescriptorTableEntry Code;
+        GlobalDescriptorTableEntry Data;
+        GlobalDescriptorTableEntry UserData;
+        GlobalDescriptorTableEntry UserCode;
+        TaskStateSegmentEntry TaskStateSegment;
+    } __packed GlobalDescriptorTableEntries;
+
+    typedef struct _GlobalDescriptorTableDescriptor
+    {
+        /** @brief GDT entries length */
+        uint16_t Length;
+        /** @brief GDT entries address */
+        GlobalDescriptorTableEntries *Entries;
+    } __packed GlobalDescriptorTableDescriptor;
+
+    extern void *CPUStackPointer[];
+    extern TaskStateSegment tss[];
+    void Init(int Core);
+    void SetKernelStack(void *Stack);
+    void *GetKernelStack();
+}
+
+#define GDT_KERNEL_CODE offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, Code)
+#define GDT_KERNEL_DATA offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, Data)
+#define GDT_USER_CODE (offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, UserCode) | 3)
+#define GDT_USER_DATA (offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, UserData) | 3)
+#define GDT_TSS (offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, TaskStateSegment) | 3)
+
+#endif // !__FENNIX_KERNEL_GDT_H__
diff --git a/Kernel/Architecture/amd64/cpu/idt.hpp b/Kernel/Architecture/amd64/cpu/idt.hpp
new file mode 100644
index 00000000..ccc1da87
--- /dev/null
+++ b/Kernel/Architecture/amd64/cpu/idt.hpp
@@ -0,0 +1,84 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_IDT_H__
+#define __FENNIX_KERNEL_IDT_H__
+
+#include <types.h>
+
+namespace InterruptDescriptorTable
+{
+    typedef enum _InterruptGateType
+    {
+        TASK = 0b101,
+        INT_16BIT = 0b110,
+        TRAP_16BIT = 0b111,
+        INT_32BIT = 0b1110,
+        TRAP_32BIT = 0b1111,
+    } InterruptGateType;
+
+    typedef enum _InterruptRingType
+    {
+        RING0 = 0b0,
+        RING1 = 0b1,
+        RING2 = 0b10,
+        RING3 = 0b11,
+    } InterruptRingType;
+
+    typedef enum _InterruptStackTableType
+    {
+        IST0 = 0b0,
+        IST1 = 0b1,
+        IST2 = 0b10,
+        IST3 = 0b11,
+        IST4 = 0b100,
+        IST5 = 0b101,
+        IST6 = 0b110,
+    } InterruptStackTableType;
+
+    typedef struct _InterruptDescriptorTableEntry
+    {
+        uint64_t BaseLow : 16;
+        uint64_t SegmentSelector : 16;
+        uint64_t InterruptStackTable : 3;
+        uint64_t Reserved1 : 5;
+        uint64_t Flags : 4;
+        uint64_t Reserved2 : 1;
+        uint64_t Ring : 2;
+        uint64_t Present : 1;
+        uint64_t BaseHigh : 48;
+        uint64_t Reserved3 : 32;
+    } __packed InterruptDescriptorTableEntry;
+
+    typedef struct _InterruptDescriptorTableDescriptor
+    {
+        uint16_t Length;
+        InterruptDescriptorTableEntry *Entries;
+    } __packed InterruptDescriptorTableDescriptor;
+
+    void SetEntry(uint8_t Index,
+                  void (*Base)(),
+                  InterruptStackTableType InterruptStackTable,
+                  InterruptGateType Gate,
+                  InterruptRingType Ring,
+                  bool Present,
+                  uint16_t SegmentSelector);
+
+    void Init(int Core);
+}
+
+#endif // !__FENNIX_KERNEL_IDT_H__
diff --git a/Kernel/Architecture/amd64/linker.ld b/Kernel/Architecture/amd64/linker.ld
new file mode 100644
index 00000000..47dbe0e5
--- /dev/null
+++ b/Kernel/Architecture/amd64/linker.ld
@@ -0,0 +1,92 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+OUTPUT_FORMAT(elf64-x86-64)
+OUTPUT_ARCH(i386:x86-64)
+
+KERNEL_VMA = 0xFFFFFFFF80000000;
+
+ENTRY(_start)
+
+SECTIONS
+{
+    . = 0x100000;
+
+    _bootstrap_start = .;
+    .bootstrap :
+    {
+        *(.multiboot)
+        *(.multiboot2)
+        *(.bootstrap .bootstrap.*)
+    }
+    . += CONSTANT(MAXPAGESIZE);
+    _bootstrap_end = ALIGN(CONSTANT(MAXPAGESIZE));
+
+    . += KERNEL_VMA;
+    . += CONSTANT(MAXPAGESIZE);
+    _kernel_start = ALIGN(CONSTANT(MAXPAGESIZE));
+    .text : AT(ADDR(.text) - KERNEL_VMA)
+    {
+        *(.text .text.*)
+    }
+    _kernel_text_end = ALIGN(CONSTANT(MAXPAGESIZE));
+    . += CONSTANT(MAXPAGESIZE);
+
+    .data : AT(ADDR(.data) - KERNEL_VMA)
+    {
+        *(.data .data.*)
+    }
+    _kernel_data_end = ALIGN(CONSTANT(MAXPAGESIZE));
+    . += CONSTANT(MAXPAGESIZE);
+
+    .rodata : AT(ADDR(.rodata) - KERNEL_VMA)
+    {
+        *(.rodata .rodata.*)
+    }
+
+    .init_array : AT(ADDR(.init_array) - KERNEL_VMA)
+    {
+        PROVIDE_HIDDEN(__init_array_start = .);
+        KEEP(*(.init_array .ctors))
+        KEEP(*(SORT_BY_INIT_PRIORITY(.init_array.*) SORT_BY_INIT_PRIORITY(.ctors.*)))
+        PROVIDE_HIDDEN (__init_array_end = .);
+    }
+
+    .fini_array : AT(ADDR(.fini_array) - KERNEL_VMA)
+    {
+        PROVIDE_HIDDEN(__fini_array_start = .);
+        KEEP(*(SORT_BY_INIT_PRIORITY(.fini_array.*) SORT_BY_INIT_PRIORITY(.dtors.*)))
+        KEEP(*(.fini_array .dtors))
+        PROVIDE_HIDDEN (__fini_array_end = .);
+    }
+    _kernel_rodata_end = ALIGN(CONSTANT(MAXPAGESIZE));
+    . += CONSTANT(MAXPAGESIZE);
+
+    .bss : AT(ADDR(.bss) - KERNEL_VMA)
+    {
+        *(COMMON)
+        *(.bss .bss.*)
+    }
+    . += CONSTANT(MAXPAGESIZE);
+    _kernel_end = ALIGN(CONSTANT(MAXPAGESIZE));
+
+    /DISCARD/ :
+    {
+        *(.comment*)
+        *(.note*)
+    }
+}
diff --git a/Kernel/Architecture/amd64/runtime/crt0.c b/Kernel/Architecture/amd64/runtime/crt0.c
new file mode 100644
index 00000000..35cf1abd
--- /dev/null
+++ b/Kernel/Architecture/amd64/runtime/crt0.c
@@ -0,0 +1,15 @@
+// #include <types.h>
+
+// #include <debug.h>
+
+// int Entry(void *Info);
+
+// void _start(void *Raw)
+// {
+//     error("Todo");
+//     while (1)
+//         asmv("hlt");
+//     Entry(NULL);
+//     return;
+// }
+// C stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/amd64/runtime/crt1.c b/Kernel/Architecture/amd64/runtime/crt1.c
new file mode 100644
index 00000000..1369bfeb
--- /dev/null
+++ b/Kernel/Architecture/amd64/runtime/crt1.c
@@ -0,0 +1,15 @@
+#include <types.h>
+
+#include <debug.h>
+
+int Entry(void *Info);
+
+// void _start(void *Raw)
+// {
+//     UNUSED(Raw);
+//     error("ERROR! INVALID BOOT PROTOCOL!");
+//     while (1)
+//         asmv("hlt");
+//     Entry(NULL);
+//     return;
+// }
diff --git a/Kernel/Architecture/amd64/runtime/crtbegin.c b/Kernel/Architecture/amd64/runtime/crtbegin.c
new file mode 100644
index 00000000..507125b3
--- /dev/null
+++ b/Kernel/Architecture/amd64/runtime/crtbegin.c
@@ -0,0 +1 @@
+// C++ constructor/destructor stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/amd64/runtime/crtend.c b/Kernel/Architecture/amd64/runtime/crtend.c
new file mode 100644
index 00000000..507125b3
--- /dev/null
+++ b/Kernel/Architecture/amd64/runtime/crtend.c
@@ -0,0 +1 @@
+// C++ constructor/destructor stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/amd64/runtime/crti.S b/Kernel/Architecture/amd64/runtime/crti.S
new file mode 100644
index 00000000..93855715
--- /dev/null
+++ b/Kernel/Architecture/amd64/runtime/crti.S
@@ -0,0 +1,13 @@
+.section .init
+.global _init
+.type _init, @function
+_init:
+	push %rbp
+	movq %rsp, %rbp
+
+.section .fini
+.global _fini
+.type _fini, @function
+_fini:
+	push %rbp
+	movq %rsp, %rbp
diff --git a/Kernel/Architecture/amd64/runtime/crtn.S b/Kernel/Architecture/amd64/runtime/crtn.S
new file mode 100644
index 00000000..2fe55b4d
--- /dev/null
+++ b/Kernel/Architecture/amd64/runtime/crtn.S
@@ -0,0 +1,7 @@
+.section .init
+	popq %rbp
+	ret
+
+.section .fini
+	popq %rbp
+	ret
diff --git a/Kernel/Architecture/amd64/rust-target.json b/Kernel/Architecture/amd64/rust-target.json
new file mode 100644
index 00000000..f3697f10
--- /dev/null
+++ b/Kernel/Architecture/amd64/rust-target.json
@@ -0,0 +1,21 @@
+{
+    "llvm-target": "x86_64-unknown-none",
+    "data-layout": "e-m:e-i64:64-f80:128-n8:16:32:64-S128",
+    "cpu": "x86-64",
+    "arch": "x86_64",
+    "features": "-mmx,-sse,+soft-float",
+    "target-endian": "little",
+    "target-pointer-width": "64",
+    "target-c-int-width": "32",
+    "os": "none",
+    "linker-flavor": "ld",
+    "pre-link-args": {
+        "ld": [
+            "-m64"
+        ]
+    },
+    "no-compiler-rt": true,
+    "disable-redzone": true,
+    "eliminate-frame-pointer": false,
+    "morestack": false
+}
\ No newline at end of file
diff --git a/Kernel/Architecture/i386/ArithmeticOperations.c b/Kernel/Architecture/i386/ArithmeticOperations.c
new file mode 100644
index 00000000..91a9db63
--- /dev/null
+++ b/Kernel/Architecture/i386/ArithmeticOperations.c
@@ -0,0 +1,327 @@
+/* Source: https://github.com/glitchub/arith64 */
+#define arith64_u64 unsigned long long int
+#define arith64_s64 signed long long int
+#define arith64_u32 unsigned int
+#define arith64_s32 int
+
+typedef union
+{
+    arith64_u64 u64;
+    arith64_s64 s64;
+    struct
+    {
+#if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+        arith64_u32 hi;
+        arith64_u32 lo;
+#else
+        arith64_u32 lo;
+        arith64_u32 hi;
+#endif
+    } u32;
+    struct
+    {
+#if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+        arith64_s32 hi;
+        arith64_s32 lo;
+#else
+        arith64_s32 lo;
+        arith64_s32 hi;
+#endif
+    } s32;
+} arith64_word;
+
+#define arith64_hi(n) (arith64_word){.u64 = n}.u32.hi
+#define arith64_lo(n) (arith64_word){.u64 = n}.u32.lo
+#define arith64_neg(a, b) (((a) ^ ((((arith64_s64)(b)) >= 0) - 1)) + (((arith64_s64)(b)) < 0))
+#define arith64_abs(a) arith64_neg(a, a)
+
+arith64_s64 __absvdi2(arith64_s64 a)
+{
+    return arith64_abs(a);
+}
+
+arith64_s64 __ashldi3(arith64_s64 a, int b)
+{
+    arith64_word w = {.s64 = a};
+
+    b &= 63;
+
+    if (b >= 32)
+    {
+        w.u32.hi = w.u32.lo << (b - 32);
+        w.u32.lo = 0;
+    }
+    else if (b)
+    {
+        w.u32.hi = (w.u32.lo >> (32 - b)) | (w.u32.hi << b);
+        w.u32.lo <<= b;
+    }
+    return w.s64;
+}
+
+arith64_s64 __ashrdi3(arith64_s64 a, int b)
+{
+    arith64_word w = {.s64 = a};
+
+    b &= 63;
+
+    if (b >= 32)
+    {
+        w.s32.lo = w.s32.hi >> (b - 32);
+        w.s32.hi >>= 31; // 0xFFFFFFFF or 0
+    }
+    else if (b)
+    {
+        w.u32.lo = (w.u32.hi << (32 - b)) | (w.u32.lo >> b);
+        w.s32.hi >>= b;
+    }
+    return w.s64;
+}
+
+int __clzsi2(arith64_u32 a)
+{
+    int b, n = 0;
+    b = !(a & 0xffff0000) << 4;
+    n += b;
+    a <<= b;
+    b = !(a & 0xff000000) << 3;
+    n += b;
+    a <<= b;
+    b = !(a & 0xf0000000) << 2;
+    n += b;
+    a <<= b;
+    b = !(a & 0xc0000000) << 1;
+    n += b;
+    a <<= b;
+    return n + !(a & 0x80000000);
+}
+
+int __clzdi2(arith64_u64 a)
+{
+    int b, n = 0;
+    b = !(a & 0xffffffff00000000ULL) << 5;
+    n += b;
+    a <<= b;
+    b = !(a & 0xffff000000000000ULL) << 4;
+    n += b;
+    a <<= b;
+    b = !(a & 0xff00000000000000ULL) << 3;
+    n += b;
+    a <<= b;
+    b = !(a & 0xf000000000000000ULL) << 2;
+    n += b;
+    a <<= b;
+    b = !(a & 0xc000000000000000ULL) << 1;
+    n += b;
+    a <<= b;
+    return n + !(a & 0x8000000000000000ULL);
+}
+
+int __ctzsi2(arith64_u32 a)
+{
+    int b, n = 0;
+    b = !(a & 0x0000ffff) << 4;
+    n += b;
+    a >>= b;
+    b = !(a & 0x000000ff) << 3;
+    n += b;
+    a >>= b;
+    b = !(a & 0x0000000f) << 2;
+    n += b;
+    a >>= b;
+    b = !(a & 0x00000003) << 1;
+    n += b;
+    a >>= b;
+    return n + !(a & 0x00000001);
+}
+
+int __ctzdi2(arith64_u64 a)
+{
+    int b, n = 0;
+    b = !(a & 0x00000000ffffffffULL) << 5;
+    n += b;
+    a >>= b;
+    b = !(a & 0x000000000000ffffULL) << 4;
+    n += b;
+    a >>= b;
+    b = !(a & 0x00000000000000ffULL) << 3;
+    n += b;
+    a >>= b;
+    b = !(a & 0x000000000000000fULL) << 2;
+    n += b;
+    a >>= b;
+    b = !(a & 0x0000000000000003ULL) << 1;
+    n += b;
+    a >>= b;
+    return n + !(a & 0x0000000000000001ULL);
+}
+
+arith64_u64 __divmoddi4(arith64_u64 a, arith64_u64 b, arith64_u64 *c)
+{
+    if (b > a)
+    {
+        if (c)
+            *c = a;
+        return 0;
+    }
+    if (!arith64_hi(b))
+    {
+        if (b == 0)
+        {
+            volatile char x = 0;
+            x = 1 / x;
+        }
+        if (b == 1)
+        {
+            if (c)
+                *c = 0;
+            return a;
+        }
+        if (!arith64_hi(a))
+        {
+            if (c)
+                *c = arith64_lo(a) % arith64_lo(b);
+            return arith64_lo(a) / arith64_lo(b);
+        }
+    }
+
+    char bits = __clzdi2(b) - __clzdi2(a) + 1;
+    arith64_u64 rem = a >> bits;
+    a <<= 64 - bits;
+    arith64_u64 wrap = 0;
+    while (bits-- > 0)
+    {
+        rem = (rem << 1) | (a >> 63);
+        a = (a << 1) | (wrap & 1);
+        wrap = ((arith64_s64)(b - rem - 1) >> 63);
+        rem -= b & wrap;
+    }
+    if (c)
+        *c = rem;
+    return (a << 1) | (wrap & 1);
+}
+
+arith64_s64 __divdi3(arith64_s64 a, arith64_s64 b)
+{
+    arith64_u64 q = __divmoddi4(arith64_abs(a), arith64_abs(b), (void *)0);
+    return arith64_neg(q, a ^ b);
+}
+
+int __ffsdi2(arith64_u64 a) { return a ? __ctzdi2(a) + 1 : 0; }
+
+arith64_u64 __lshrdi3(arith64_u64 a, int b)
+{
+    arith64_word w = {.u64 = a};
+
+    b &= 63;
+
+    if (b >= 32)
+    {
+        w.u32.lo = w.u32.hi >> (b - 32);
+        w.u32.hi = 0;
+    }
+    else if (b)
+    {
+        w.u32.lo = (w.u32.hi << (32 - b)) | (w.u32.lo >> b);
+        w.u32.hi >>= b;
+    }
+    return w.u64;
+}
+
+arith64_s64 __moddi3(arith64_s64 a, arith64_s64 b)
+{
+    arith64_u64 r;
+    __divmoddi4(arith64_abs(a), arith64_abs(b), &r);
+    return arith64_neg(r, a);
+}
+
+int __popcountsi2(arith64_u32 a)
+{
+
+    a = a - ((a >> 1) & 0x55555555);
+    a = ((a >> 2) & 0x33333333) + (a & 0x33333333);
+    a = (a + (a >> 4)) & 0x0F0F0F0F;
+    a = (a + (a >> 16));
+
+    return (a + (a >> 8)) & 63;
+}
+
+int __popcountdi2(arith64_u64 a)
+{
+
+    a = a - ((a >> 1) & 0x5555555555555555ULL);
+    a = ((a >> 2) & 0x3333333333333333ULL) + (a & 0x3333333333333333ULL);
+    a = (a + (a >> 4)) & 0x0F0F0F0F0F0F0F0FULL;
+    a = (a + (a >> 32));
+    a = (a + (a >> 16));
+
+    return (a + (a >> 8)) & 127;
+}
+
+arith64_u64 __udivdi3(arith64_u64 a, arith64_u64 b) { return __divmoddi4(a, b, (void *)0); }
+
+arith64_u64 __umoddi3(arith64_u64 a, arith64_u64 b)
+{
+    arith64_u64 r;
+    __divmoddi4(a, b, &r);
+    return r;
+}
+
+/* Good documentation: https://splichal.eu/scripts/sphinx/gccint/_build/html/the-gcc-low-level-runtime-library/routines-for-floating-point-emulation.html */
+
+double __adddf3(double a, double b) { return a + b; }
+double __muldf3(double a, double b) { return a * b; }
+double __floatsidf(int i) { return (double)i; }
+int __ltdf2(double a, double b) { return a < b; }
+int __gtdf2(double a, double b) { return a > b; }
+int __nedf2(double a, double b) { return a != b; }
+int __eqdf2(double a, double b) { return a == b; }
+double __floatdidf(long i) { return (double)i; }
+double __divdf3(double a, double b) { return a / b; }
+double __subdf3(double a, double b) { return a - b; }
+int __gedf2(double a, double b) { return a >= b; }
+int __fixdfsi(double a) { return (int)a; }
+long __fixdfdi(double a) { return (long)a; }
+int __ledf2(double a, double b) { return a <= b; }
+
+/* FIXME: Check if these functions are implemented correctly */
+
+typedef long long int64_t;
+typedef unsigned long long uint64_t;
+typedef unsigned int uint32_t;
+typedef struct
+{
+    uint64_t value;
+} atomic_uint64_t;
+
+uint64_t __atomic_load_8(const atomic_uint64_t *p)
+{
+    uint64_t value;
+    __asm__ volatile("lock cmpxchg8b %1"
+                     : "=A"(value)
+                     : "m"(*p)
+                     : "memory");
+    return value;
+}
+
+void __atomic_store_8(atomic_uint64_t *p, uint64_t value)
+{
+    __asm__ volatile("lock cmpxchg8b %0"
+                     : "=m"(p->value)
+                     : "a"((uint32_t)value), "d"((uint32_t)(value >> 32)), "m"(*p)
+                     : "memory");
+}
+
+/* FIXME: __fixsfsi is not implemented correctly(?) */
+int __fixsfsi(float a) { return (int)a; }
+
+int __ltsf2(float a, float b) { return a < b; }
+int __eqsf2(float a, float b) { return a == b; }
+float __divsf3(float a, float b) { return a / b; }
+double __extendsfdf2(float a) { return (double)a; }
+float __truncdfsf2(double a) { return (float)a; }
+float __subsf3(float a, float b) { return a - b; }
+float __floatsisf(int a) { return (float)a; }
+int __fixunssfsi(float a) { return (int)a; }
+float __mulsf3(float a, float b) { return a * b; }
+float __addsf3(float a, float b) { return a + b; }
diff --git a/Kernel/Architecture/i386/Bootstrap/Header_Multiboot.asm b/Kernel/Architecture/i386/Bootstrap/Header_Multiboot.asm
new file mode 100644
index 00000000..71a6efe8
--- /dev/null
+++ b/Kernel/Architecture/i386/Bootstrap/Header_Multiboot.asm
@@ -0,0 +1,5 @@
+section .multiboot
+align 4
+    dd 0x1BADB002
+    dd 1 << 0 | 1 << 1
+    dd -(0x1BADB002 + (1 << 0 | 1 << 1))
diff --git a/Kernel/Architecture/i386/Bootstrap/Header_Multiboot2.asm b/Kernel/Architecture/i386/Bootstrap/Header_Multiboot2.asm
new file mode 100644
index 00000000..a0a9a71e
--- /dev/null
+++ b/Kernel/Architecture/i386/Bootstrap/Header_Multiboot2.asm
@@ -0,0 +1,41 @@
+section .multiboot2
+align 4096
+HEADER_START:
+    dd 0xE85250D6
+    dd 0
+    dd (HEADER_END - HEADER_START)
+    dd 0x100000000 - (HEADER_END - HEADER_START) - 0 - 0xE85250D6
+align 8
+MB2_INFO_REQUEST_TAG_START:
+    dw 1
+    dw 0
+    dd MB2_INFO_REQUEST_TAG_END - MB2_INFO_REQUEST_TAG_START
+    dd 1 ; Command Line
+    dd 2 ; Boot Loader Name
+    dd 3 ; Module
+    dd 4 ; Basic Memory Information
+    dd 5 ; BIOS Boot Device
+    dd 6 ; Memory Map
+    dd 7 ; VBE
+    dd 8 ; Framebuffer
+    dd 9 ; ELF Sections
+    dd 10 ; APM Table
+    dd 11 ; EFI 32-bit System Table Pointer
+    dd 12 ; EFI 64-bit System Table Pointer
+    ; dd 13 ; SMBIOS
+    dd 14 ; ACPI Old
+    dd 15 ; ACPI New
+    dd 16 ; Network
+    dd 17 ; EFI Memory Map
+    dd 18 ; EFI Boot Services Notifier
+    dd 19 ; EFI 32-bit Image Handle Pointer
+    dd 20 ; EFI 64-bit Image Handle Pointer
+    dd 21 ; Load Base Address
+MB2_INFO_REQUEST_TAG_END:
+align 8
+MB2_TAG_START:
+    dw 0
+    dw 0
+    dd MB2_TAG_END - MB2_TAG_START
+MB2_TAG_END:
+HEADER_END:
diff --git a/Kernel/Architecture/i386/Bootstrap/Multiboot.cpp b/Kernel/Architecture/i386/Bootstrap/Multiboot.cpp
new file mode 100644
index 00000000..a048bdf9
--- /dev/null
+++ b/Kernel/Architecture/i386/Bootstrap/Multiboot.cpp
@@ -0,0 +1,286 @@
+#include <types.h>
+
+#include <boot/protocols/multiboot2.h>
+#include <memory.hpp>
+#include <io.h>
+
+#include "../../../kernel.h"
+
+EXTERNC void multiboot_main(uint32_t Magic, uint32_t Info)
+{
+    if (Info == NULL || Magic == NULL)
+    {
+        if (Magic == NULL)
+            error("Multiboot magic is NULL");
+        if (Info == NULL)
+            error("Multiboot info is NULL");
+        CPU::Stop();
+    }
+    else if (Magic != MULTIBOOT2_BOOTLOADER_MAGIC)
+    {
+        error("Multiboot magic is invalid (%#x != %#x)", Magic, MULTIBOOT2_BOOTLOADER_MAGIC);
+        CPU::Stop();
+    }
+
+    uint64_t div = 1193180 / 1000;
+    outb(0x43, 0xB6);
+    outb(0x42, (uint8_t)div);
+    outb(0x42, (uint8_t)(div >> 8));
+    uint8_t tmp = inb(0x61);
+    if (tmp != (tmp | 3))
+        outb(0x61, tmp | 3);
+
+    BootInfo mb2binfo;
+    int pos = 0;
+    auto InfoAddress = Info;
+    for (auto Tag = (struct multiboot_tag *)((uint8_t *)InfoAddress + 8);
+         ;
+         Tag = (struct multiboot_tag *)((multiboot_uint8_t *)Tag + ((Tag->size + 7) & ~7)))
+    {
+        if (Tag->type == MULTIBOOT_TAG_TYPE_END)
+        {
+            debug("End of multiboot2 tags");
+            break;
+        }
+
+        switch (Tag->type)
+        {
+        case MULTIBOOT_TAG_TYPE_CMDLINE:
+        {
+            strncpy(mb2binfo.Kernel.CommandLine,
+                    ((multiboot_tag_string *)Tag)->string,
+                    strlen(((multiboot_tag_string *)Tag)->string));
+            debug("Kernel command line: %s", mb2binfo.Kernel.CommandLine);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_BOOT_LOADER_NAME:
+        {
+            strncpy(mb2binfo.Bootloader.Name,
+                    ((multiboot_tag_string *)Tag)->string,
+                    strlen(((multiboot_tag_string *)Tag)->string));
+            debug("Bootloader name: %s", mb2binfo.Bootloader.Name);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_MODULE:
+        {
+            multiboot_tag_module *module = (multiboot_tag_module *)Tag;
+            static int module_count = 0;
+            mb2binfo.Modules[module_count++].Address = (void *)(uint64_t)module->mod_start;
+            mb2binfo.Modules[module_count++].Size = module->size;
+            strncpy(mb2binfo.Modules[module_count++].Path, "(null)", 6);
+            strncpy(mb2binfo.Modules[module_count++].CommandLine, module->cmdline,
+                    strlen(module->cmdline));
+            debug("Module: %s", mb2binfo.Modules[module_count++].Path);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_BASIC_MEMINFO:
+        {
+            multiboot_tag_basic_meminfo *meminfo = (multiboot_tag_basic_meminfo *)Tag;
+            fixme("basic_meminfo->[mem_lower: %#x, mem_upper: %#x]",
+                  meminfo->mem_lower, meminfo->mem_upper);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_BOOTDEV:
+        {
+            multiboot_tag_bootdev *bootdev = (multiboot_tag_bootdev *)Tag;
+            fixme("bootdev->[biosdev: %#x, slice: %#x, part: %#x]",
+                  bootdev->biosdev, bootdev->slice, bootdev->part);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_MMAP:
+        {
+            multiboot_tag_mmap *mmap = (multiboot_tag_mmap *)Tag;
+            uint32_t EntryCount = mmap->size / sizeof(multiboot_mmap_entry);
+            mb2binfo.Memory.Entries = EntryCount;
+            for (uint32_t i = 0; i < EntryCount; i++)
+            {
+                if (EntryCount > MAX_MEMORY_ENTRIES)
+                {
+                    warn("Too many memory entries, skipping the rest...");
+                    break;
+                }
+                multiboot_mmap_entry entry = mmap->entries[i];
+                mb2binfo.Memory.Size += entry.len;
+                switch (entry.type)
+                {
+                case MULTIBOOT_MEMORY_AVAILABLE:
+                    mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                    mb2binfo.Memory.Entry[i].Length = entry.len;
+                    mb2binfo.Memory.Entry[i].Type = Usable;
+                    break;
+                case MULTIBOOT_MEMORY_RESERVED:
+                    mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                    mb2binfo.Memory.Entry[i].Length = entry.len;
+                    mb2binfo.Memory.Entry[i].Type = Reserved;
+                    break;
+                case MULTIBOOT_MEMORY_ACPI_RECLAIMABLE:
+                    mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                    mb2binfo.Memory.Entry[i].Length = entry.len;
+                    mb2binfo.Memory.Entry[i].Type = ACPIReclaimable;
+                    break;
+                case MULTIBOOT_MEMORY_NVS:
+                    mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                    mb2binfo.Memory.Entry[i].Length = entry.len;
+                    mb2binfo.Memory.Entry[i].Type = ACPINVS;
+                    break;
+                case MULTIBOOT_MEMORY_BADRAM:
+                    mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                    mb2binfo.Memory.Entry[i].Length = entry.len;
+                    mb2binfo.Memory.Entry[i].Type = BadMemory;
+                    break;
+                default:
+                    mb2binfo.Memory.Entry[i].BaseAddress = (void *)entry.addr;
+                    mb2binfo.Memory.Entry[i].Length = entry.len;
+                    mb2binfo.Memory.Entry[i].Type = Unknown;
+                    break;
+                }
+                debug("Memory entry: [BaseAddress: %#x, Length: %#x, Type: %d]",
+                      mb2binfo.Memory.Entry[i].BaseAddress,
+                      mb2binfo.Memory.Entry[i].Length,
+                      mb2binfo.Memory.Entry[i].Type);
+            }
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_VBE:
+        {
+            multiboot_tag_vbe *vbe = (multiboot_tag_vbe *)Tag;
+            fixme("vbe->[vbe_mode: %#x, vbe_interface_seg: %#x, vbe_interface_off: %#x, vbe_interface_len: %#x]",
+                  vbe->vbe_mode, vbe->vbe_interface_seg, vbe->vbe_interface_off, vbe->vbe_interface_len);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_FRAMEBUFFER:
+        {
+            multiboot_tag_framebuffer *fb = (multiboot_tag_framebuffer *)Tag;
+            static int fb_count = 0;
+            mb2binfo.Framebuffer[fb_count].BaseAddress = (void *)fb->common.framebuffer_addr;
+            mb2binfo.Framebuffer[fb_count].Width = fb->common.framebuffer_width;
+            mb2binfo.Framebuffer[fb_count].Height = fb->common.framebuffer_height;
+            mb2binfo.Framebuffer[fb_count].Pitch = fb->common.framebuffer_pitch;
+            mb2binfo.Framebuffer[fb_count].BitsPerPixel = fb->common.framebuffer_bpp;
+            switch (fb->common.framebuffer_type)
+            {
+            case MULTIBOOT_FRAMEBUFFER_TYPE_INDEXED:
+            {
+                mb2binfo.Framebuffer[fb_count].Type = Indexed;
+                break;
+            }
+            case MULTIBOOT_FRAMEBUFFER_TYPE_RGB:
+            {
+                mb2binfo.Framebuffer[fb_count].Type = RGB;
+                mb2binfo.Framebuffer[fb_count].RedMaskSize = fb->framebuffer_red_mask_size;
+                mb2binfo.Framebuffer[fb_count].RedMaskShift = fb->framebuffer_red_field_position;
+                mb2binfo.Framebuffer[fb_count].GreenMaskSize = fb->framebuffer_green_mask_size;
+                mb2binfo.Framebuffer[fb_count].GreenMaskShift = fb->framebuffer_green_field_position;
+                mb2binfo.Framebuffer[fb_count].BlueMaskSize = fb->framebuffer_blue_mask_size;
+                mb2binfo.Framebuffer[fb_count].BlueMaskShift = fb->framebuffer_blue_field_position;
+                break;
+            }
+            case MULTIBOOT_FRAMEBUFFER_TYPE_EGA_TEXT:
+            {
+                mb2binfo.Framebuffer[fb_count].Type = EGA;
+                break;
+            }
+            }
+            debug("Framebuffer %d: %dx%d %d bpp", fb_count, fb->common.framebuffer_width, fb->common.framebuffer_height, fb->common.framebuffer_bpp);
+            debug("More info:\nAddress: %p\nPitch: %lld\nMemoryModel: %d\nRedMaskSize: %d\nRedMaskShift: %d\nGreenMaskSize: %d\nGreenMaskShift: %d\nBlueMaskSize: %d\nBlueMaskShift: %d",
+                  fb->common.framebuffer_addr, fb->common.framebuffer_pitch, fb->common.framebuffer_type,
+                  fb->framebuffer_red_mask_size, fb->framebuffer_red_field_position, fb->framebuffer_green_mask_size,
+                  fb->framebuffer_green_field_position, fb->framebuffer_blue_mask_size, fb->framebuffer_blue_field_position);
+            fb_count++;
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_ELF_SECTIONS:
+        {
+            multiboot_tag_elf_sections *elf = (multiboot_tag_elf_sections *)Tag;
+            fixme("elf_sections->[num=%d, size=%d, entsize=%d, shndx=%d]",
+                  elf->num, elf->size, elf->entsize, elf->shndx);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_APM:
+        {
+            multiboot_tag_apm *apm = (multiboot_tag_apm *)Tag;
+            fixme("apm->[version: %d, cseg: %d, offset: %d, cseg_16: %d, dseg: %d, flags: %d, cseg_len: %d, cseg_16_len: %d, dseg_len: %d]",
+                  apm->version, apm->cseg, apm->offset, apm->cseg_16, apm->dseg, apm->flags, apm->cseg_len, apm->cseg_16_len, apm->dseg_len);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_EFI32:
+        {
+            multiboot_tag_efi32 *efi32 = (multiboot_tag_efi32 *)Tag;
+            fixme("efi32->[pointer: %p, size: %d]", efi32->pointer, efi32->size);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_EFI64:
+        {
+            multiboot_tag_efi64 *efi64 = (multiboot_tag_efi64 *)Tag;
+            fixme("efi64->[pointer: %p, size: %d]", efi64->pointer, efi64->size);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_SMBIOS:
+        {
+            multiboot_tag_smbios *smbios = (multiboot_tag_smbios *)Tag;
+            fixme("smbios->[major: %d, minor: %d]", smbios->major, smbios->minor);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_ACPI_OLD:
+        {
+            mb2binfo.RSDP = (BootInfo::RSDPInfo *)((multiboot_tag_old_acpi *)Tag)->rsdp;
+            debug("OLD ACPI RSDP: %p", mb2binfo.RSDP);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_ACPI_NEW:
+        {
+            mb2binfo.RSDP = (BootInfo::RSDPInfo *)((multiboot_tag_new_acpi *)Tag)->rsdp;
+            debug("NEW ACPI RSDP: %p", mb2binfo.RSDP);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_NETWORK:
+        {
+            multiboot_tag_network *net = (multiboot_tag_network *)Tag;
+            fixme("network->[dhcpack: %p]", net->dhcpack);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_EFI_MMAP:
+        {
+            multiboot_tag_efi_mmap *efi_mmap = (multiboot_tag_efi_mmap *)Tag;
+            fixme("efi_mmap->[descr_size: %d, descr_vers: %d, efi_mmap: %p]",
+                  efi_mmap->descr_size, efi_mmap->descr_vers, efi_mmap->efi_mmap);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_EFI_BS:
+        {
+            fixme("efi_bs->[%p] (unknown structure)", Tag);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_EFI32_IH:
+        {
+            multiboot_tag_efi32_ih *efi32_ih = (multiboot_tag_efi32_ih *)Tag;
+            fixme("efi32_ih->[pointer: %p]", efi32_ih->pointer);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_EFI64_IH:
+        {
+            multiboot_tag_efi64_ih *efi64_ih = (multiboot_tag_efi64_ih *)Tag;
+            fixme("efi64_ih->[pointer: %p]", efi64_ih->pointer);
+            break;
+        }
+        case MULTIBOOT_TAG_TYPE_LOAD_BASE_ADDR:
+        {
+            multiboot_tag_load_base_addr *load_base_addr = (multiboot_tag_load_base_addr *)Tag;
+            mb2binfo.Kernel.PhysicalBase = (void *)(uint64_t)load_base_addr->load_base_addr;
+            mb2binfo.Kernel.VirtualBase = (void *)(uint64_t)(load_base_addr->load_base_addr + 0xFFFFFFFF80000000);
+            debug("Kernel base: %p (physical) %p (virtual)", mb2binfo.Kernel.PhysicalBase, mb2binfo.Kernel.VirtualBase);
+            break;
+        }
+        default:
+        {
+            error("Unknown multiboot2 tag type: %d", Tag->type);
+            break;
+        }
+        }
+    }
+
+    tmp = inb(0x61) & 0xFC;
+    outb(0x61, tmp);
+
+    Entry(&mb2binfo);
+}
diff --git a/Kernel/Architecture/i386/Bootstrap/Multiboot_Init.asm b/Kernel/Architecture/i386/Bootstrap/Multiboot_Init.asm
new file mode 100644
index 00000000..c8212a96
--- /dev/null
+++ b/Kernel/Architecture/i386/Bootstrap/Multiboot_Init.asm
@@ -0,0 +1,50 @@
+[bits 32]
+KERNEL_VIRTUAL_BASE equ 0xC0000000 ; 3GB
+KERNEL_STACK_SIZE equ 0x4000 ; 16KB
+
+extern multiboot_main
+extern BootPageTable
+global _start
+
+section .text
+
+MB_HeaderMagic:
+	dq 0
+
+MB_HeaderInfo:
+	dq 0
+
+_start:
+	cli
+	mov ecx, (BootPageTable - KERNEL_VIRTUAL_BASE)
+	mov cr3, ecx
+
+	mov ecx, cr4
+	or ecx, 0x00000010 ; Set PSE in CR4
+	mov cr4, ecx
+
+	mov ecx, cr0
+	or ecx, 0x80000000 ; Set PG in CR0
+	mov cr0, ecx
+
+	lea ecx, [HigherHalfStart]
+	jmp ecx
+
+HigherHalfStart:
+	mov [MB_HeaderMagic], eax
+	mov [MB_HeaderInfo], ebx
+	mov esp, KernelStack + KERNEL_STACK_SIZE
+	mov eax, [MB_HeaderMagic]
+	mov ebx, [MB_HeaderInfo]
+	push ebx ; Multiboot2 Header
+	add ebx, KERNEL_VIRTUAL_BASE
+	push eax ; Multiboot2 Magic
+	call multiboot_main
+.Hang:
+	hlt
+	jmp .Hang
+
+section .bss
+align 16
+KernelStack:
+	resb KERNEL_STACK_SIZE
diff --git a/Kernel/Architecture/i386/Bootstrap/Multiboot_PageTable.asm b/Kernel/Architecture/i386/Bootstrap/Multiboot_PageTable.asm
new file mode 100644
index 00000000..9df80899
--- /dev/null
+++ b/Kernel/Architecture/i386/Bootstrap/Multiboot_PageTable.asm
@@ -0,0 +1,10 @@
+KERNEL_PAGE_NUMBER equ 768 ; 0xC0000000
+
+section .data
+global BootPageTable
+align 0x1000
+BootPageTable:
+    dd 0x00000083
+    times (KERNEL_PAGE_NUMBER - 1) dd 0
+    dd 0x00000083
+    times (1024 - KERNEL_PAGE_NUMBER - 1) dd 0
diff --git a/Kernel/Architecture/i386/Interrupts/8259PIC.cpp b/Kernel/Architecture/i386/Interrupts/8259PIC.cpp
new file mode 100644
index 00000000..1be69a88
--- /dev/null
+++ b/Kernel/Architecture/i386/Interrupts/8259PIC.cpp
@@ -0,0 +1,140 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "pic.hpp"
+
+#include <io.h>
+
+namespace PIC
+{
+    PIC::PIC(uint8_t MasterCommandPort, uint8_t MasterDataPort, uint8_t SlaveCommandPort, uint8_t SlaveDataPort, uint8_t MasterOffset, uint8_t SlaveOffset)
+    {
+        this->MasterCommandPort = MasterCommandPort;
+        this->MasterDataPort = MasterDataPort;
+        this->SlaveCommandPort = SlaveCommandPort;
+        this->SlaveDataPort = SlaveDataPort;
+        this->MasterOffset = MasterOffset;
+        this->SlaveOffset = SlaveOffset;
+
+        MasterMask = 0xFF;
+        SlaveMask = 0xFF;
+
+        // ICW1
+        outb(MasterCommandPort, 0x11);
+        outb(SlaveCommandPort, 0x11);
+
+        // ICW2
+        outb(MasterDataPort, MasterOffset);
+        outb(SlaveDataPort, SlaveOffset);
+
+        // ICW3
+        outb(MasterDataPort, 0x04);
+        outb(SlaveDataPort, 0x02);
+
+        // ICW4
+        outb(MasterDataPort, 0x01);
+        outb(SlaveDataPort, 0x01);
+
+        // OCW1
+        outb(MasterDataPort, MasterMask);
+        outb(SlaveDataPort, SlaveMask);
+    }
+
+    PIC::~PIC()
+    {
+        outb(MasterDataPort, 0xFF);
+        outb(SlaveDataPort, 0xFF);
+    }
+
+    void PIC::Mask(uint8_t IRQ)
+    {
+        uint16_t Port;
+        uint8_t Value;
+
+        if (IRQ < 8)
+        {
+            Port = MasterDataPort;
+            Value = MasterMask & ~(1 << IRQ);
+            MasterMask = Value;
+        }
+        else
+        {
+            Port = SlaveDataPort;
+            Value = SlaveMask & ~(1 << (IRQ - 8));
+            SlaveMask = Value;
+        }
+
+        outb(Port, Value);
+    }
+
+    void PIC::Unmask(uint8_t IRQ)
+    {
+        uint16_t Port;
+        uint8_t Value;
+
+        if (IRQ < 8)
+        {
+            Port = MasterDataPort;
+            Value = MasterMask | (1 << IRQ);
+            MasterMask = Value;
+        }
+        else
+        {
+            Port = SlaveDataPort;
+            Value = SlaveMask | (1 << (IRQ - 8));
+            SlaveMask = Value;
+        }
+
+        outb(Port, Value);
+    }
+
+    void PIC::SendEOI(uint8_t IRQ)
+    {
+        if (IRQ >= 8)
+            outb(SlaveCommandPort, 0x20);
+
+        outb(MasterCommandPort, 0x20);
+    }
+
+    PIT::PIT(uint16_t Port, uint16_t Frequency)
+    {
+        this->Port = Port;
+        this->Frequency = Frequency;
+    }
+
+    PIT::~PIT()
+    {
+    }
+
+    void PIT::PrepareSleep(uint32_t Milliseconds)
+    {
+        uint16_t Divisor = 1193182 / Frequency;
+        uint8_t Low = (uint8_t)(Divisor & 0xFF);
+        uint8_t High = (uint8_t)((Divisor >> 8) & 0xFF);
+
+        outb(Port + 3, 0x36);
+        outb(Port + 0, Low);
+        outb(Port + 1, High);
+    }
+
+    void PIT::PerformSleep()
+    {
+        uint8_t Value = inb(Port + 0);
+        while (Value != 0)
+            Value = inb(Port + 0);
+    }
+}
diff --git a/Kernel/Architecture/i386/Interrupts/pic.hpp b/Kernel/Architecture/i386/Interrupts/pic.hpp
new file mode 100644
index 00000000..fb0e5f1a
--- /dev/null
+++ b/Kernel/Architecture/i386/Interrupts/pic.hpp
@@ -0,0 +1,59 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_8259PIC_H__
+#define __FENNIX_KERNEL_8259PIC_H__
+
+#include <types.h>
+
+namespace PIC
+{
+    class PIC
+    {
+    private:
+        uint8_t MasterCommandPort;
+        uint8_t MasterDataPort;
+        uint8_t SlaveCommandPort;
+        uint8_t SlaveDataPort;
+        uint8_t MasterOffset;
+        uint8_t SlaveOffset;
+        uint8_t MasterMask;
+        uint8_t SlaveMask;
+
+    public:
+        PIC(uint8_t MasterCommandPort, uint8_t MasterDataPort, uint8_t SlaveCommandPort, uint8_t SlaveDataPort, uint8_t MasterOffset, uint8_t SlaveOffset);
+        ~PIC();
+        void Mask(uint8_t IRQ);
+        void Unmask(uint8_t IRQ);
+        void SendEOI(uint8_t IRQ);
+    };
+
+    class PIT
+    {
+    private:
+        uint16_t Port;
+        uint16_t Frequency;
+
+    public:
+        PIT(uint16_t Port, uint16_t Frequency);
+        ~PIT();
+        void PrepareSleep(uint32_t Milliseconds);
+        void PerformSleep();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_8259PIC_H__
diff --git a/Kernel/Architecture/i386/SystemCalls.cpp b/Kernel/Architecture/i386/SystemCalls.cpp
new file mode 100644
index 00000000..cc9c5007
--- /dev/null
+++ b/Kernel/Architecture/i386/SystemCalls.cpp
@@ -0,0 +1,30 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <syscalls.hpp>
+
+#include <cpu.hpp>
+
+#include "cpu/gdt.hpp"
+
+using namespace CPU::x32;
+
+extern "C" uint32_t SystemCallsHandler(SyscallsFrame *regs);
+
+void InitializeSystemCalls()
+{
+}
diff --git a/Kernel/Architecture/i386/acpi.hpp b/Kernel/Architecture/i386/acpi.hpp
new file mode 100644
index 00000000..1a71f712
--- /dev/null
+++ b/Kernel/Architecture/i386/acpi.hpp
@@ -0,0 +1,294 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ACPI_H__
+#define __FENNIX_KERNEL_ACPI_H__
+
+#include <types.h>
+
+#include <boot/binfo.h>
+#include <ints.hpp>
+#include <cpu.hpp>
+#include <vector>
+
+namespace ACPI
+{
+    class ACPI
+    {
+    public:
+        struct ACPIHeader
+        {
+            unsigned char Signature[4];
+            uint32_t Length;
+            uint8_t Revision;
+            uint8_t Checksum;
+            uint8_t OEMID[6];
+            uint8_t OEMTableID[8];
+            uint32_t OEMRevision;
+            uint32_t CreatorID;
+            uint32_t CreatorRevision;
+        } __packed;
+
+        struct GenericAddressStructure
+        {
+            uint8_t AddressSpace;
+            uint8_t BitWidth;
+            uint8_t BitOffset;
+            uint8_t AccessSize;
+            uint64_t Address;
+        } __packed;
+
+        struct MCFGHeader
+        {
+            struct ACPIHeader Header;
+            uint64_t Reserved;
+        } __packed;
+
+        struct HPETHeader
+        {
+            ACPIHeader Header;
+            uint8_t HardwareRevID;
+            uint8_t ComparatorCount : 5;
+            uint8_t CounterSize : 1;
+            uint8_t Reserved : 1;
+            uint8_t LegacyReplacement : 1;
+            uint16_t PCIVendorID;
+            struct GenericAddressStructure Address;
+            uint8_t HPETNumber;
+            uint16_t MinimumTick;
+            uint8_t PageProtection;
+        } __packed;
+
+        struct FADTHeader
+        {
+            ACPIHeader Header;
+            uint32_t FirmwareCtrl;
+            uint32_t Dsdt;
+            uint8_t Reserved;
+            uint8_t PreferredPowerManagementProfile;
+            uint16_t SCI_Interrupt;
+            uint32_t SMI_CommandPort;
+            uint8_t AcpiEnable;
+            uint8_t AcpiDisable;
+            uint8_t S4BIOS_REQ;
+            uint8_t PSTATE_Control;
+            uint32_t PM1aEventBlock;
+            uint32_t PM1bEventBlock;
+            uint32_t PM1aControlBlock;
+            uint32_t PM1bControlBlock;
+            uint32_t PM2ControlBlock;
+            uint32_t PMTimerBlock;
+            uint32_t GPE0Block;
+            uint32_t GPE1Block;
+            uint8_t PM1EventLength;
+            uint8_t PM1ControlLength;
+            uint8_t PM2ControlLength;
+            uint8_t PMTimerLength;
+            uint8_t GPE0Length;
+            uint8_t GPE1Length;
+            uint8_t GPE1Base;
+            uint8_t CStateControl;
+            uint16_t WorstC2Latency;
+            uint16_t WorstC3Latency;
+            uint16_t FlushSize;
+            uint16_t FlushStride;
+            uint8_t DutyOffset;
+            uint8_t DutyWidth;
+            uint8_t DayAlarm;
+            uint8_t MonthAlarm;
+            uint8_t Century;
+            uint16_t BootArchitectureFlags;
+            uint8_t Reserved2;
+            uint32_t Flags;
+            struct GenericAddressStructure ResetReg;
+            uint8_t ResetValue;
+            uint8_t Reserved3[3];
+            uint64_t X_FirmwareControl;
+            uint64_t X_Dsdt;
+            struct GenericAddressStructure X_PM1aEventBlock;
+            struct GenericAddressStructure X_PM1bEventBlock;
+            struct GenericAddressStructure X_PM1aControlBlock;
+            struct GenericAddressStructure X_PM1bControlBlock;
+            struct GenericAddressStructure X_PM2ControlBlock;
+            struct GenericAddressStructure X_PMTimerBlock;
+            struct GenericAddressStructure X_GPE0Block;
+            struct GenericAddressStructure X_GPE1Block;
+        } __packed;
+
+        struct BGRTHeader
+        {
+            ACPIHeader Header;
+            uint16_t Version;
+            uint8_t Status;
+            uint8_t ImageType;
+            uint64_t ImageAddress;
+            uint32_t ImageOffsetX;
+            uint32_t ImageOffsetY;
+        };
+
+        struct SRATHeader
+        {
+            ACPIHeader Header;
+            uint32_t TableRevision; // Must be value 1
+            uint64_t Reserved;      // Reserved, must be zero
+        };
+
+        struct TPM2Header
+        {
+            ACPIHeader Header;
+            uint32_t Flags;
+            uint64_t ControlAddress;
+            uint32_t StartMethod;
+        };
+
+        struct TCPAHeader
+        {
+            ACPIHeader Header;
+            uint16_t Reserved;
+            uint32_t MaxLogLength;
+            uint64_t LogAddress;
+        };
+
+        struct WAETHeader
+        {
+            ACPIHeader Header;
+            uint32_t Flags;
+        };
+
+        struct HESTHeader
+        {
+            ACPIHeader Header;
+            uint32_t ErrorSourceCount;
+        };
+
+        struct MADTHeader
+        {
+            ACPIHeader Header;
+            uint32_t LocalControllerAddress;
+            uint32_t Flags;
+            char Entries[];
+        } __packed;
+
+        ACPIHeader *XSDT = nullptr;
+        MCFGHeader *MCFG = nullptr;
+        HPETHeader *HPET = nullptr;
+        FADTHeader *FADT = nullptr;
+        BGRTHeader *BGRT = nullptr;
+        SRATHeader *SRAT = nullptr;
+        TPM2Header *TPM2 = nullptr;
+        TCPAHeader *TCPA = nullptr;
+        WAETHeader *WAET = nullptr;
+        MADTHeader *MADT = nullptr;
+        HESTHeader *HEST = nullptr;
+        bool XSDTSupported = false;
+
+        void *FindTable(ACPIHeader *ACPIHeader, char *Signature);
+        void SearchTables(ACPIHeader *Header);
+        ACPI();
+        ~ACPI();
+    };
+
+    class MADT
+    {
+    public:
+        struct APICHeader
+        {
+            uint8_t Type;
+            uint8_t Length;
+        } __packed;
+
+        struct MADTIOApic
+        {
+            struct APICHeader Header;
+            uint8_t APICID;
+            uint8_t reserved;
+            uint32_t Address;
+            uint32_t GSIBase;
+        } __packed;
+
+        struct MADTIso
+        {
+            struct APICHeader Header;
+            uint8_t BuSSource;
+            uint8_t IRQSource;
+            uint32_t GSI;
+            uint16_t Flags;
+        } __packed;
+
+        struct MADTNmi
+        {
+            struct APICHeader Header;
+            uint8_t processor;
+            uint16_t flags;
+            uint8_t lint;
+        } __packed;
+
+        struct LocalAPIC
+        {
+            struct APICHeader Header;
+            uint8_t ACPIProcessorId;
+            uint8_t APICId;
+            uint32_t Flags;
+        } __packed;
+
+        struct LAPIC
+        {
+            uint8_t id;
+            uintptr_t PhysicalAddress;
+            void *VirtualAddress;
+        };
+
+        std::vector<MADTIOApic *> ioapic;
+        std::vector<MADTIso *> iso;
+        std::vector<MADTNmi *> nmi;
+        std::vector<LocalAPIC *> lapic;
+        struct LAPIC *LAPICAddress;
+        uint16_t CPUCores;
+
+        MADT(ACPI::MADTHeader *madt);
+        ~MADT();
+    };
+
+    class DSDT : public Interrupts::Handler
+    {
+    private:
+        uint32_t SMI_CMD = 0;
+        uint8_t ACPI_ENABLE = 0;
+        uint8_t ACPI_DISABLE = 0;
+        uint32_t PM1a_CNT = 0;
+        uint32_t PM1b_CNT = 0;
+        uint16_t SLP_TYPa = 0;
+        uint16_t SLP_TYPb = 0;
+        uint16_t SLP_EN = 0;
+        uint16_t SCI_EN = 0;
+        uint8_t PM1_CNT_LEN = 0;
+
+        ACPI *acpi;
+        void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+
+    public:
+        bool ACPIShutdownSupported = false;
+
+        void Reboot();
+        void Shutdown();
+
+        DSDT(ACPI *acpi);
+        ~DSDT();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_ACPI_H__
diff --git a/Kernel/Architecture/i386/cpu/GlobalDescriptorTable.cpp b/Kernel/Architecture/i386/cpu/GlobalDescriptorTable.cpp
new file mode 100644
index 00000000..d7cb3d0d
--- /dev/null
+++ b/Kernel/Architecture/i386/cpu/GlobalDescriptorTable.cpp
@@ -0,0 +1,116 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "gdt.hpp"
+
+#include <memory.hpp>
+#include <smp.hpp>
+#include <cpu.hpp>
+#include <debug.h>
+
+namespace GlobalDescriptorTable
+{
+    static GlobalDescriptorTableEntries GDTEntriesTemplate = {
+        // null
+        {.Length = 0x0,
+         .BaseLow = 0x0,
+         .BaseMiddle = 0x0,
+         .Access = {.Raw = 0x0},
+         .Flags = {.Raw = 0x0},
+         .BaseHigh = 0x0},
+
+        // kernel code
+        {.Length = 0x0,
+         .BaseLow = 0x0,
+         .BaseMiddle = 0x0,
+         .Access = {.A = 0,
+                    .RW = 1,
+                    .DC = 0,
+                    .E = 1,
+                    .S = 1,
+                    .DPL = 0,
+                    .P = 1},
+         .Flags = {.Unknown = 0x0, .L = 1},
+         .BaseHigh = 0x0},
+
+        // kernel data
+        {.Length = 0x0,
+         .BaseLow = 0x0,
+         .BaseMiddle = 0x0,
+         .Access = {.A = 0,
+                    .RW = 1,
+                    .DC = 0,
+                    .E = 0,
+                    .S = 1,
+                    .DPL = 0,
+                    .P = 1},
+         .Flags = {.Raw = 0x0},
+         .BaseHigh = 0x0},
+
+        // user data
+        {.Length = 0x0,
+         .BaseLow = 0x0,
+         .BaseMiddle = 0x0,
+         .Access = {.A = 0,
+                    .RW = 1,
+                    .DC = 0,
+                    .E = 0,
+                    .S = 1,
+                    .DPL = 3,
+                    .P = 1},
+         .Flags = {.Raw = 0x0},
+         .BaseHigh = 0x0},
+
+        // user code
+        {.Length = 0x0,
+         .BaseLow = 0x0,
+         .BaseMiddle = 0x0,
+         .Access = {.A = 0,
+                    .RW = 1,
+                    .DC = 0,
+                    .E = 1,
+                    .S = 1,
+                    .DPL = 3,
+                    .P = 1},
+         .Flags = {.Unknown = 0x0, .L = 1},
+         .BaseHigh = 0x0},
+
+        // tss
+        {}};
+
+    GlobalDescriptorTableEntries GDTEntries[MAX_CPU];
+    GlobalDescriptorTableDescriptor gdt[MAX_CPU];
+
+    TaskStateSegment tss[MAX_CPU] = {
+        0,
+        {0, 0, 0},
+        0,
+        {0, 0, 0, 0, 0, 0, 0},
+        0,
+        0,
+    };
+
+    void *CPUStackPointer[MAX_CPU];
+
+    SafeFunction void Init(int Core)
+    {
+    }
+
+    SafeFunction void SetKernelStack(void *Stack)
+    {
+    }
+}
diff --git a/Kernel/Architecture/i386/cpu/SymmetricMultiprocessing.cpp b/Kernel/Architecture/i386/cpu/SymmetricMultiprocessing.cpp
new file mode 100644
index 00000000..eff12718
--- /dev/null
+++ b/Kernel/Architecture/i386/cpu/SymmetricMultiprocessing.cpp
@@ -0,0 +1,54 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <smp.hpp>
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <assert.h>
+#include <cpu.hpp>
+
+#include "../../../kernel.h"
+
+volatile bool CPUEnabled = false;
+
+#pragma GCC diagnostic ignored "-Wmissing-field-initializers"
+static __aligned(0x1000) CPUData CPUs[MAX_CPU] = {0};
+
+CPUData *GetCPU(uint64_t id) { return &CPUs[id]; }
+
+CPUData *GetCurrentCPU()
+{
+    uint64_t ret = 0;
+    if (!(&CPUs[ret])->IsActive)
+    {
+        // error("CPU %d is not active!", ret);
+        return &CPUs[0];
+    }
+    assert((&CPUs[ret])->Checksum == CPU_DATA_CHECKSUM);
+    return &CPUs[ret];
+}
+
+namespace SMP
+{
+    int CPUCores = 0;
+
+    void Initialize(void *madt)
+    {
+        fixme("SMP::Initialize() is not implemented!");
+    }
+}
diff --git a/Kernel/Architecture/i386/cpu/apic.hpp b/Kernel/Architecture/i386/cpu/apic.hpp
new file mode 100644
index 00000000..24887b48
--- /dev/null
+++ b/Kernel/Architecture/i386/cpu/apic.hpp
@@ -0,0 +1,354 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_APIC_H__
+#define __FENNIX_KERNEL_APIC_H__
+
+#include <types.h>
+
+#include <ints.hpp>
+#include <cpu.hpp>
+
+namespace APIC
+{
+    enum APICRegisters
+    {
+        // source from: https://github.com/pdoane/osdev/blob/master/intr/local_apic.c
+        APIC_ID = 0x20,       // Local APIC ID
+        APIC_VER = 0x30,      // Local APIC Version
+        APIC_TPR = 0x80,      // Task Priority
+        APIC_APR = 0x90,      // Arbitration Priority
+        APIC_PPR = 0xA0,      // Processor Priority
+        APIC_EOI = 0xB0,      // EOI
+        APIC_RRD = 0xC0,      // Remote Read
+        APIC_LDR = 0xD0,      // Logical Destination
+        APIC_DFR = 0xE0,      // Destination Format
+        APIC_SVR = 0xF0,      // Spurious Interrupt Vector
+        APIC_ISR = 0x100,     // In-Service (8 registers)
+        APIC_TMR = 0x180,     // Trigger Mode (8 registers)
+        APIC_IRR = 0x200,     // Interrupt Request (8 registers)
+        APIC_ESR = 0x280,     // Error Status
+        APIC_ICRLO = 0x300,   // Interrupt Command
+        APIC_ICRHI = 0x310,   // Interrupt Command [63:32]
+        APIC_TIMER = 0x320,   // LVT Timer
+        APIC_THERMAL = 0x330, // LVT Thermal Sensor
+        APIC_PERF = 0x340,    // LVT Performance Counter
+        APIC_LINT0 = 0x350,   // LVT LINT0
+        APIC_LINT1 = 0x360,   // LVT LINT1
+        APIC_ERROR = 0x370,   // LVT Error
+        APIC_TICR = 0x380,    // Initial Count (for Timer)
+        APIC_TCCR = 0x390,    // Current Count (for Timer)
+        APIC_TDCR = 0x3E0,    // Divide Configuration (for Timer)
+    };
+
+    enum IOAPICRegisters
+    {
+        GetIOAPICVersion = 0x1
+    };
+
+    enum IOAPICFlags
+    {
+        ActiveHighLow = 2,
+        EdgeLevel = 8
+    };
+
+    enum APICDeliveryMode
+    {
+        Fixed = 0b000,
+        LowestPriority = 0b001, /* Reserved */
+        SMI = 0b010,
+        APIC_DELIVERY_MODE_RESERVED0 = 0b011, /* Reserved */
+        NMI = 0b100,
+        INIT = 0b101,
+        Startup = 0b110,
+        ExtINT = 0b111 /* Reserved */
+    };
+
+    enum APICDestinationMode
+    {
+        Physical = 0b0,
+        Logical = 0b1
+    };
+
+    enum APICDeliveryStatus
+    {
+        Idle = 0b0,
+        SendPending = 0b1
+    };
+
+    enum APICLevel
+    {
+        DeAssert = 0b0,
+        Assert = 0b1
+    };
+
+    enum APICTriggerMode
+    {
+        Edge = 0b0,
+        Level = 0b1
+    };
+
+    enum APICDestinationShorthand
+    {
+        NoShorthand = 0b00,
+        Self = 0b01,
+        AllIncludingSelf = 0b10,
+        AllExcludingSelf = 0b11
+    };
+
+    enum LVTTimerDivide
+    {
+        DivideBy2 = 0b000,
+        DivideBy4 = 0b001,
+        DivideBy8 = 0b010,
+        DivideBy16 = 0b011,
+        DivideBy32 = 0b100,
+        DivideBy64 = 0b101,
+        DivideBy128 = 0b110,
+        DivideBy1 = 0b111
+    };
+
+    enum LVTTimerMask
+    {
+        Unmasked = 0b0,
+        Masked = 0b1
+    };
+
+    enum LVTTimerMode
+    {
+        OneShot = 0b00,
+        Periodic = 0b01,
+        TSCDeadline = 0b10
+    };
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Interrupt Vector */
+            uint64_t Vector : 8;
+            /** @brief Reserved */
+            uint64_t Reserved0 : 4;
+            /**
+             * @brief Delivery Status
+             *
+             * 0: Idle
+             * 1: Send Pending
+             */
+            uint64_t DeliveryStatus : 1;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 3;
+            /**
+             * @brief Mask
+             *
+             * 0: Not masked
+             * 1: Masked
+             */
+            uint64_t Mask : 1;
+            /** @brief Timer Mode
+             *
+             * 0: One-shot
+             * 1: Periodic
+             * 2: TSC-Deadline
+             */
+            uint64_t TimerMode : 1;
+            /** @brief Reserved */
+            uint64_t Reserved2 : 14;
+        };
+        uint64_t raw;
+    } __packed LVTTimer;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Spurious Vector */
+            uint64_t Vector : 8;
+            /** @brief Enable or disable APIC software */
+            uint64_t Software : 1;
+            /** @brief Focus Processor Checking */
+            uint64_t FocusProcessorChecking : 1;
+            /** @brief Reserved */
+            uint64_t Reserved : 2;
+            /** @brief Disable EOI Broadcast */
+            uint64_t DisableEOIBroadcast : 1;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 19;
+        };
+        uint64_t raw;
+    } __packed Spurious;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Interrupt Vector */
+            uint64_t Vector : 8;
+            /** @brief Delivery Mode */
+            uint64_t DeliveryMode : 3;
+            /** @brief Destination Mode
+             *
+             * 0: Physical
+             * 1: Logical
+             */
+            uint64_t DestinationMode : 1;
+            /** @brief Delivery Status
+             *
+             * @note Reserved when in x2APIC mode
+             */
+            uint64_t DeliveryStatus : 1;
+            /** @brief Reserved */
+            uint64_t Reserved0 : 1;
+            /** @brief Level
+             *
+             * 0: Deassert
+             * 1: Assert
+             */
+            uint64_t Level : 1;
+            /** @brief Trigger Mode
+             *
+             * 0: Edge
+             * 1: Level
+             */
+            uint64_t TriggerMode : 1;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 2;
+            /** @brief Destination Shorthand
+             *
+             * 0: No shorthand
+             * 1: Self
+             * 2: All including self
+             * 3: All excluding self
+             */
+            uint64_t DestinationShorthand : 2;
+            /** @brief Reserved */
+            uint64_t Reserved2 : 12;
+        };
+        uint64_t raw;
+    } __packed InterruptCommandRegisterLow;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Reserved */
+            uint64_t Reserved0 : 24;
+            /** @brief Destination */
+            uint64_t Destination : 8;
+        };
+        uint64_t raw;
+    } __packed InterruptCommandRegisterHigh;
+
+    typedef union
+    {
+        struct
+        {
+            /** @brief Interrupt Vector */
+            uint64_t Vector : 8;
+            /** @brief Delivery Mode */
+            uint64_t DeliveryMode : 3;
+            /** @brief Destination Mode
+             *
+             * 0: Physical
+             * 1: Logical
+             */
+            uint64_t DestinationMode : 1;
+            /** @brief Delivery Status */
+            uint64_t DeliveryStatus : 1;
+            /** @brief Interrupt Input Pin Polarity
+             *
+             * 0: Active High
+             * 1: Active Low
+             */
+            uint64_t Polarity : 1;
+            /** @brief Remote IRR */
+            uint64_t RemoteIRR : 1;
+            /** @brief Trigger Mode
+             *
+             * 0: Edge
+             * 1: Level
+             */
+            uint64_t TriggerMode : 1;
+            /** @brief Mask */
+            uint64_t Mask : 1;
+            /** @brief Reserved */
+            uint64_t Reserved0 : 15;
+            /** @brief Reserved */
+            uint64_t Reserved1 : 24;
+            /** @brief Destination */
+            uint64_t DestinationID : 8;
+        };
+        struct
+        {
+            uint64_t Low;
+            uint64_t High;
+        } split;
+        uint64_t raw;
+    } __packed IOAPICRedirectEntry;
+
+    typedef union
+    {
+        struct
+        {
+            uint64_t Version : 8;
+            uint64_t Reserved : 8;
+            uint64_t MaximumRedirectionEntry : 8;
+            uint64_t Reserved2 : 8;
+        };
+        uint64_t raw;
+    } __packed IOAPICVersion;
+
+    class APIC
+    {
+    private:
+        bool x2APICSupported = false;
+        uint64_t APICBaseAddress = 0;
+
+    public:
+        uint32_t Read(uint32_t Register);
+        void Write(uint32_t Register, uint32_t Value);
+        void IOWrite(uint64_t Base, uint32_t Register, uint32_t Value);
+        uint32_t IORead(uint64_t Base, uint32_t Register);
+        void EOI();
+        void RedirectIRQs(int CPU = 0);
+        void WaitForIPI();
+        void IPI(uint8_t CPU, InterruptCommandRegisterLow icr);
+        void SendInitIPI(uint8_t CPU);
+        void SendStartupIPI(uint8_t CPU, uint64_t StartupAddress);
+        uint32_t IOGetMaxRedirect(uint32_t APICID);
+        void RawRedirectIRQ(uint8_t Vector, uint32_t GSI, uint16_t Flags, int CPU, int Status);
+        void RedirectIRQ(int CPU, uint16_t IRQ, int Status);
+        APIC(int Core);
+        ~APIC();
+    };
+
+    class Timer : public Interrupts::Handler
+    {
+    private:
+        APIC *lapic;
+        uint64_t Ticks = 0;
+        void OnInterruptReceived(CPU::x32::TrapFrame *Frame);
+
+    public:
+        uint64_t GetTicks() { return Ticks; }
+        void OneShot(uint32_t Vector, uint64_t Miliseconds);
+        Timer(APIC *apic);
+        ~Timer();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_APIC_H__
diff --git a/Kernel/Architecture/i386/cpu/gdt.hpp b/Kernel/Architecture/i386/cpu/gdt.hpp
new file mode 100644
index 00000000..92e43015
--- /dev/null
+++ b/Kernel/Architecture/i386/cpu/gdt.hpp
@@ -0,0 +1,162 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_GDT_H__
+#define __FENNIX_KERNEL_GDT_H__
+
+#include <types.h>
+
+namespace GlobalDescriptorTable
+{
+    /** @brief The GDT Access Table
+     * @details For more information, see https://wiki.osdev.org/Global_Descriptor_Table
+     */
+    union GlobalDescriptorTableAccess
+    {
+        struct
+        {
+            /** @brief Access bit.
+             * @note The CPU sets this bit to 1 when the segment is accessed.
+             */
+            uint8_t A : 1;
+
+            /** @brief Readable bit for code segments, writable bit for data segments.
+             * @details For code segments, this bit must be 1 for the segment to be readable.
+             * @details For data segments, this bit must be 1 for the segment to be writable.
+             */
+            uint8_t RW : 1;
+
+            /** @brief Direction bit for data segments, conforming bit for code segments.
+             * @details For data segments, this bit must be 1 for the segment to grow up (higher addresses).
+             * @details For code segments, this bit must be 1 for code in the segment to be able to be executed from an equal or lower privilege level.
+             */
+            uint8_t DC : 1;
+
+            /** @brief Executable bit.
+             * @details This bit must be 1 for code-segment descriptors.
+             * @details This bit must be 0 for data-segment and system descriptors.
+             */
+            uint8_t E : 1;
+
+            /** @brief Descriptor type.
+             * @details This bit must be 0 for system descriptors.
+             * @details This bit must be 1 for code or data segment descriptor.
+             */
+            uint8_t S : 1;
+
+            /** @brief Descriptor privilege level.
+             * @details This field determines the privilege level of the segment.
+             * @details 0 = kernel mode, 3 = user mode.
+             */
+            uint8_t DPL : 2;
+
+            /** @brief Present bit.
+             * @details This bit must be 1 for all valid descriptors.
+             */
+            uint8_t P : 1;
+        } __packed;
+        uint8_t Raw;
+    };
+
+    union GlobalDescriptorTableFlags
+    {
+        // TODO: Add more flags.
+        struct
+        {
+            /** @brief Unknown. */
+            uint8_t Unknown : 5;
+
+            /** @brief Long mode.
+             * @details If the long mode bit is clear, the segment is in 32-bit protected mode.
+             * @details If the long mode bit is set, the segment is in 64-bit long mode.
+             */
+            uint8_t L : 1;
+        } __packed;
+        uint8_t Raw;
+    };
+
+    typedef struct _TaskStateSegmentEntry
+    {
+        /* LOW */
+        uint16_t Length;
+        uint16_t BaseLow;
+        uint8_t BaseMiddle;
+        GlobalDescriptorTableAccess Flags;
+        uint8_t Granularity;
+        uint8_t BaseHigh;
+        /* HIGH */
+        uint32_t BaseUpper;
+        uint32_t Reserved;
+    } __packed TaskStateSegmentEntry;
+
+    typedef struct _TaskStateSegment
+    {
+        uint32_t Reserved0 __aligned(16);
+        uint64_t StackPointer[3];
+        uint64_t Reserved1;
+        uint64_t InterruptStackTable[7];
+        uint16_t Reserved2;
+        uint16_t IOMapBaseAddressOffset;
+    } __packed TaskStateSegment;
+
+    typedef struct _GlobalDescriptorTableEntry
+    {
+        /** @brief Length */
+        uint16_t Length;
+        /** @brief Low Base */
+        uint16_t BaseLow;
+        /** @brief Middle Base */
+        uint8_t BaseMiddle;
+        /** @brief Access */
+        GlobalDescriptorTableAccess Access;
+        /** @brief Flags */
+        GlobalDescriptorTableFlags Flags;
+        /** @brief High Base */
+        uint8_t BaseHigh;
+    } __packed GlobalDescriptorTableEntry;
+
+    typedef struct _GlobalDescriptorTableEntries
+    {
+        GlobalDescriptorTableEntry Null;
+        GlobalDescriptorTableEntry Code;
+        GlobalDescriptorTableEntry Data;
+        GlobalDescriptorTableEntry UserData;
+        GlobalDescriptorTableEntry UserCode;
+        TaskStateSegmentEntry TaskStateSegment;
+    } __packed GlobalDescriptorTableEntries;
+
+    typedef struct _GlobalDescriptorTableDescriptor
+    {
+        /** @brief GDT entries length */
+        uint16_t Length;
+        /** @brief GDT entries address */
+        GlobalDescriptorTableEntries *Entries;
+    } __packed GlobalDescriptorTableDescriptor;
+
+    extern void *CPUStackPointer[];
+    extern TaskStateSegment tss[];
+    void Init(int Core);
+    void SetKernelStack(void *Stack);
+}
+
+#define GDT_KERNEL_CODE offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, Code)
+#define GDT_KERNEL_DATA offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, Data)
+#define GDT_USER_CODE (offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, UserCode) | 3)
+#define GDT_USER_DATA (offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, UserData) | 3)
+#define GDT_TSS (offsetof(GlobalDescriptorTable::GlobalDescriptorTableEntries, TaskStateSegment) | 3)
+
+#endif // !__FENNIX_KERNEL_GDT_H__
diff --git a/Kernel/Architecture/i386/cpu/idt.hpp b/Kernel/Architecture/i386/cpu/idt.hpp
new file mode 100644
index 00000000..204072aa
--- /dev/null
+++ b/Kernel/Architecture/i386/cpu/idt.hpp
@@ -0,0 +1,28 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_IDT_H__
+#define __FENNIX_KERNEL_IDT_H__
+
+#include <types.h>
+
+namespace InterruptDescriptorTable
+{
+    void Init(int Core);
+}
+
+#endif // !__FENNIX_KERNEL_IDT_H__
diff --git a/Kernel/Architecture/i386/linker.ld b/Kernel/Architecture/i386/linker.ld
new file mode 100644
index 00000000..2e427dd4
--- /dev/null
+++ b/Kernel/Architecture/i386/linker.ld
@@ -0,0 +1,93 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+OUTPUT_FORMAT(elf32-i386)
+OUTPUT_ARCH(i386)
+
+KERNEL_VMA = 0xC0000000;
+
+ENTRY(_start)
+
+SECTIONS
+{
+    . = 0x100000;
+
+    _bootstrap_start = .;
+    .bootstrap :
+    {
+        *(.multiboot)
+        *(.multiboot2)
+        *(.bootstrap .bootstrap.*)
+    }
+    . += CONSTANT(MAXPAGESIZE);
+    _bootstrap_end = ALIGN(CONSTANT(MAXPAGESIZE));
+
+    . += KERNEL_VMA;
+    . += CONSTANT(MAXPAGESIZE);
+    _kernel_start = ALIGN(CONSTANT(MAXPAGESIZE));
+    .text : AT(ADDR(.text) - KERNEL_VMA)
+    {
+        *(.text .text.*)
+    }
+    _kernel_text_end = ALIGN(CONSTANT(MAXPAGESIZE));
+    . += CONSTANT(MAXPAGESIZE);
+
+    .data : AT(ADDR(.data) - KERNEL_VMA)
+    {
+        *(.data .data.*)
+    }
+    _kernel_data_end = ALIGN(CONSTANT(MAXPAGESIZE));
+    . += CONSTANT(MAXPAGESIZE);
+
+    .rodata : AT(ADDR(.rodata) - KERNEL_VMA)
+    {
+        *(.rodata .rodata.*)
+    }
+    _kernel_rodata_end = ALIGN(CONSTANT(MAXPAGESIZE));
+    . += CONSTANT(MAXPAGESIZE);
+
+    .init_array : AT(ADDR(.init_array) - KERNEL_VMA)
+    {
+        PROVIDE_HIDDEN(__init_array_start = .);
+        KEEP(*(.init_array .ctors))
+        KEEP(*(SORT_BY_INIT_PRIORITY(.init_array.*) SORT_BY_INIT_PRIORITY(.ctors.*)))
+        PROVIDE_HIDDEN (__init_array_end = .);
+    }
+
+    .fini_array : AT(ADDR(.fini_array) - KERNEL_VMA)
+    {
+        PROVIDE_HIDDEN(__fini_array_start = .);
+        KEEP(*(SORT_BY_INIT_PRIORITY(.fini_array.*) SORT_BY_INIT_PRIORITY(.dtors.*)))
+        KEEP(*(.fini_array .dtors))
+        PROVIDE_HIDDEN (__fini_array_end = .);
+    }
+    . += CONSTANT(MAXPAGESIZE);
+
+    .bss : AT(ADDR(.bss) - KERNEL_VMA)
+    {
+        *(COMMON)
+        *(.bss .bss.*)
+    }
+    . += CONSTANT(MAXPAGESIZE);
+    _kernel_end = ALIGN(CONSTANT(MAXPAGESIZE));
+
+    /DISCARD/ :
+    {
+        *(.comment*)
+        *(.note*)
+    }
+}
diff --git a/Kernel/Architecture/i386/runtime/crt0.c b/Kernel/Architecture/i386/runtime/crt0.c
new file mode 100644
index 00000000..35cf1abd
--- /dev/null
+++ b/Kernel/Architecture/i386/runtime/crt0.c
@@ -0,0 +1,15 @@
+// #include <types.h>
+
+// #include <debug.h>
+
+// int Entry(void *Info);
+
+// void _start(void *Raw)
+// {
+//     error("Todo");
+//     while (1)
+//         asmv("hlt");
+//     Entry(NULL);
+//     return;
+// }
+// C stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/i386/runtime/crt1.c b/Kernel/Architecture/i386/runtime/crt1.c
new file mode 100644
index 00000000..1369bfeb
--- /dev/null
+++ b/Kernel/Architecture/i386/runtime/crt1.c
@@ -0,0 +1,15 @@
+#include <types.h>
+
+#include <debug.h>
+
+int Entry(void *Info);
+
+// void _start(void *Raw)
+// {
+//     UNUSED(Raw);
+//     error("ERROR! INVALID BOOT PROTOCOL!");
+//     while (1)
+//         asmv("hlt");
+//     Entry(NULL);
+//     return;
+// }
diff --git a/Kernel/Architecture/i386/runtime/crtbegin.c b/Kernel/Architecture/i386/runtime/crtbegin.c
new file mode 100644
index 00000000..507125b3
--- /dev/null
+++ b/Kernel/Architecture/i386/runtime/crtbegin.c
@@ -0,0 +1 @@
+// C++ constructor/destructor stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/i386/runtime/crtend.c b/Kernel/Architecture/i386/runtime/crtend.c
new file mode 100644
index 00000000..507125b3
--- /dev/null
+++ b/Kernel/Architecture/i386/runtime/crtend.c
@@ -0,0 +1 @@
+// C++ constructor/destructor stuff
\ No newline at end of file
diff --git a/Kernel/Architecture/i386/runtime/crti.S b/Kernel/Architecture/i386/runtime/crti.S
new file mode 100644
index 00000000..7f9924ad
--- /dev/null
+++ b/Kernel/Architecture/i386/runtime/crti.S
@@ -0,0 +1,13 @@
+.section .init
+.global _init
+.type _init, @function
+_init:
+	push %ebp
+	mov %esp, %ebp
+
+.section .fini
+.global _fini
+.type _fini, @function
+_fini:
+	push %ebp
+	mov %esp, %ebp
diff --git a/Kernel/Architecture/i386/runtime/crtn.S b/Kernel/Architecture/i386/runtime/crtn.S
new file mode 100644
index 00000000..aa67ce13
--- /dev/null
+++ b/Kernel/Architecture/i386/runtime/crtn.S
@@ -0,0 +1,7 @@
+.section .init
+	pop %ebp
+	ret
+
+.section .fini
+	pop %ebp
+	ret
diff --git a/Kernel/Core/CPU.cpp b/Kernel/Core/CPU.cpp
new file mode 100644
index 00000000..8c5d5547
--- /dev/null
+++ b/Kernel/Core/CPU.cpp
@@ -0,0 +1,492 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <cpu.hpp>
+
+#include <memory.hpp>
+#include <convert.h>
+#include <debug.h>
+#include <smp.hpp>
+
+#include "../kernel.h"
+
+namespace CPU
+{
+	static bool SSEEnabled = false;
+
+	char *Vendor()
+	{
+		static char Vendor[13] = {0};
+		if (Vendor[0] != 0)
+			return Vendor;
+#if defined(a64)
+		uint32_t eax, ebx, ecx, edx;
+		x64::cpuid(0x0, &eax, &ebx, &ecx, &edx);
+		memcpy(Vendor + 0, &ebx, 4);
+		memcpy(Vendor + 4, &edx, 4);
+		memcpy(Vendor + 8, &ecx, 4);
+#elif defined(a32)
+		uint32_t eax, ebx, ecx, edx;
+		x32::cpuid(0x0, &eax, &ebx, &ecx, &edx);
+		memcpy(Vendor + 0, &ebx, 4);
+		memcpy(Vendor + 4, &edx, 4);
+		memcpy(Vendor + 8, &ecx, 4);
+#elif defined(aa64)
+		asmv("mrs %0, MIDR_EL1"
+			 : "=r"(Vendor[0]));
+#endif
+		return Vendor;
+	}
+
+	char *Name()
+	{
+		static char Name[49] = {0};
+		if (Name[0] != 0)
+			return Name;
+#if defined(a64)
+		uint32_t eax, ebx, ecx, edx;
+		x64::cpuid(0x80000002, &eax, &ebx, &ecx, &edx);
+		memcpy(Name + 0, &eax, 4);
+		memcpy(Name + 4, &ebx, 4);
+		memcpy(Name + 8, &ecx, 4);
+		memcpy(Name + 12, &edx, 4);
+		x64::cpuid(0x80000003, &eax, &ebx, &ecx, &edx);
+		memcpy(Name + 16, &eax, 4);
+		memcpy(Name + 20, &ebx, 4);
+		memcpy(Name + 24, &ecx, 4);
+		memcpy(Name + 28, &edx, 4);
+		x64::cpuid(0x80000004, &eax, &ebx, &ecx, &edx);
+		memcpy(Name + 32, &eax, 4);
+		memcpy(Name + 36, &ebx, 4);
+		memcpy(Name + 40, &ecx, 4);
+		memcpy(Name + 44, &edx, 4);
+#elif defined(a32)
+		uint32_t eax, ebx, ecx, edx;
+		x32::cpuid(0x80000002, &eax, &ebx, &ecx, &edx);
+		memcpy(Name + 0, &eax, 4);
+		memcpy(Name + 4, &ebx, 4);
+		memcpy(Name + 8, &ecx, 4);
+		memcpy(Name + 12, &edx, 4);
+		x32::cpuid(0x80000003, &eax, &ebx, &ecx, &edx);
+		memcpy(Name + 16, &eax, 4);
+		memcpy(Name + 20, &ebx, 4);
+		memcpy(Name + 24, &ecx, 4);
+		memcpy(Name + 28, &edx, 4);
+		x32::cpuid(0x80000004, &eax, &ebx, &ecx, &edx);
+		memcpy(Name + 32, &eax, 4);
+		memcpy(Name + 36, &ebx, 4);
+		memcpy(Name + 40, &ecx, 4);
+		memcpy(Name + 44, &edx, 4);
+#elif defined(aa64)
+		asmv("mrs %0, MIDR_EL1"
+			 : "=r"(Name[0]));
+#endif
+		return Name;
+	}
+
+	char *Hypervisor()
+	{
+		static char Hypervisor[13] = {0};
+		if (Hypervisor[0] != 0)
+			return Hypervisor;
+#if defined(a64)
+		uint32_t eax, ebx, ecx, edx;
+		x64::cpuid(0x40000000, &eax, &ebx, &ecx, &edx);
+		memcpy(Hypervisor + 0, &ebx, 4);
+		memcpy(Hypervisor + 4, &ecx, 4);
+		memcpy(Hypervisor + 8, &edx, 4);
+#elif defined(a32)
+		uint32_t eax, ebx, ecx, edx;
+		x64::cpuid(0x40000000, &eax, &ebx, &ecx, &edx);
+		memcpy(Hypervisor + 0, &ebx, 4);
+		memcpy(Hypervisor + 4, &ecx, 4);
+		memcpy(Hypervisor + 8, &edx, 4);
+#elif defined(aa64)
+		asmv("mrs %0, MIDR_EL1"
+			 : "=r"(Hypervisor[0]));
+#endif
+		return Hypervisor;
+	}
+
+	bool Interrupts(InterruptsType Type)
+	{
+		switch (Type)
+		{
+		case Check:
+		{
+			uintptr_t Flags;
+#if defined(a64)
+			asmv("pushfq");
+			asmv("popq %0"
+				 : "=r"(Flags));
+			return Flags & (1 << 9);
+#elif defined(a32)
+			asmv("pushfl");
+			asmv("popl %0"
+				 : "=r"(Flags));
+			return Flags & (1 << 9);
+#elif defined(aa64)
+			asmv("mrs %0, daif"
+				 : "=r"(Flags));
+			return !(Flags & (1 << 2));
+#endif
+		}
+		case Enable:
+		{
+#if defined(a86)
+			asmv("sti");
+#elif defined(aa64)
+			asmv("msr daifclr, #2");
+#endif
+			return true;
+		}
+		case Disable:
+		{
+#if defined(a86)
+			asmv("cli");
+#elif defined(aa64)
+			asmv("msr daifset, #2");
+#endif
+			return true;
+		}
+		default:
+			break;
+		}
+		return false;
+	}
+
+	void *PageTable(void *PT)
+	{
+#if defined(a64)
+		if (PT)
+			asmv("movq %0, %%cr3"
+				 :
+				 : "r"(PT));
+		else
+			asmv("movq %%cr3, %0"
+				 : "=r"(PT));
+#elif defined(a32)
+		if (PT)
+			asmv("movl %0, %%cr3"
+				 :
+				 : "r"(PT));
+		else
+			asmv("movl %%cr3, %0"
+				 : "=r"(PT));
+#elif defined(aa64)
+		if (PT)
+			asmv("msr ttbr0_el1, %0"
+				 :
+				 : "r"(PT));
+		else
+			asmv("mrs %0, ttbr0_el1"
+				 : "=r"(PT));
+#endif
+		return PT;
+	}
+
+	void InitializeFeatures(long Core)
+	{
+#if defined(a64)
+		bool PGESupport = false;
+		bool SSESupport = false;
+		bool UMIPSupport = false;
+		bool SMEPSupport = false;
+		bool SMAPSupport = false;
+
+		static int BSP = 0;
+		x64::CR0 cr0 = x64::readcr0();
+		x64::CR4 cr4 = x64::readcr4();
+
+		if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+		{
+			CPU::x86::AMD::CPUID0x00000001 cpuid1;
+			CPU::x86::AMD::CPUID0x00000007 cpuid7;
+			cpuid1.Get();
+			cpuid7.Get();
+
+			PGESupport = cpuid1.EDX.PGE;
+			SSESupport = cpuid1.EDX.SSE;
+			SMEPSupport = cpuid7.EBX.SMEP;
+			SMAPSupport = cpuid7.EBX.SMAP;
+			UMIPSupport = cpuid7.ECX.UMIP;
+		}
+		else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+		{
+			CPU::x86::Intel::CPUID0x00000001 cpuid1;
+			CPU::x86::Intel::CPUID0x00000007_0 cpuid7_0;
+			cpuid1.Get();
+			cpuid7_0.Get();
+			PGESupport = cpuid1.EDX.PGE;
+			SSESupport = cpuid1.EDX.SSE;
+			SMEPSupport = cpuid7_0.EBX.SMEP;
+			SMAPSupport = cpuid7_0.EBX.SMAP;
+			UMIPSupport = cpuid7_0.ECX.UMIP;
+		}
+
+		if (Config.SIMD == false)
+		{
+			debug("Disabling SSE support...");
+			SSESupport = false;
+		}
+
+		if (PGESupport)
+		{
+			debug("Enabling global pages support...");
+			if (!BSP)
+				KPrint("Global Pages is supported.");
+			cr4.PGE = 1;
+		}
+
+		bool SSEEnableAfter = false;
+
+		/* Not sure if my code is not working properly or something else is the issue. */
+		if ((strcmp(Hypervisor(), x86_CPUID_VENDOR_TCG) != 0 &&
+			 strcmp(Hypervisor(), x86_CPUID_VENDOR_VIRTUALBOX) != 0) &&
+			SSESupport)
+		{
+			debug("Enabling SSE support...");
+			if (!BSP)
+				KPrint("SSE is supported.");
+			cr0.EM = 0;
+			cr0.MP = 1;
+			cr4.OSFXSR = 1;
+			cr4.OSXMMEXCPT = 1;
+
+			CPUData *CoreData = GetCPU(Core);
+			CoreData->Data.FPU = (CPU::x64::FXState *)KernelAllocator.RequestPages(TO_PAGES(sizeof(CPU::x64::FXState) + 1));
+			memset(CoreData->Data.FPU, 0, FROM_PAGES(TO_PAGES(sizeof(CPU::x64::FXState))));
+			CoreData->Data.FPU->mxcsr = 0b0001111110000000;
+			CoreData->Data.FPU->mxcsrmask = 0b1111111110111111;
+			CoreData->Data.FPU->fcw = 0b0000001100111111;
+			CPU::x64::fxrstor(CoreData->Data.FPU);
+
+			SSEEnableAfter = true;
+		}
+
+		cr0.NW = 0;
+		cr0.CD = 0;
+		cr0.WP = 1;
+
+		x64::writecr0(cr0);
+
+		if (strcmp(Hypervisor(), x86_CPUID_VENDOR_VIRTUALBOX) != 0 &&
+			strcmp(Hypervisor(), x86_CPUID_VENDOR_TCG) != 0)
+		{
+			// FIXME: I don't think this is reporting correctly. This has to be fixed asap.
+			debug("Enabling UMIP, SMEP & SMAP support...");
+			if (UMIPSupport)
+			{
+				if (!BSP)
+					KPrint("UMIP is supported.");
+				debug("UMIP is supported.");
+				// cr4.UMIP = 1;
+			}
+
+			if (SMEPSupport)
+			{
+				if (!BSP)
+					KPrint("SMEP is supported.");
+				debug("SMEP is supported.");
+				// cr4.SMEP = 1;
+			}
+
+			if (SMAPSupport)
+			{
+				if (!BSP)
+					KPrint("SMAP is supported.");
+				debug("SMAP is supported.");
+				// cr4.SMAP = 1;
+			}
+		}
+		else
+		{
+			if (!BSP)
+			{
+				if (strcmp(Hypervisor(), x86_CPUID_VENDOR_VIRTUALBOX) == 0)
+					KPrint("VirtualBox detected. Not using UMIP, SMEP & SMAP");
+				else if (strcmp(Hypervisor(), x86_CPUID_VENDOR_TCG) == 0)
+					KPrint("QEMU (TCG) detected. Not using UMIP, SMEP & SMAP");
+			}
+		}
+
+		debug("Writing CR4...");
+		x64::writecr4(cr4);
+		debug("Wrote CR4.");
+
+		debug("Enabling PAT support...");
+		x64::wrmsr(x64::MSR_CR_PAT, 0x6 | (0x0 << 8) | (0x1 << 16));
+		if (!BSP++)
+			trace("Features for BSP initialized.");
+		if (SSEEnableAfter)
+			SSEEnabled = true;
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+	}
+
+	uintptr_t Counter()
+	{
+		// TODO: Get the counter from the x2APIC or any other timer that is available. (TSC is not available on all CPUs)
+		uintptr_t Counter;
+#if defined(a64)
+		asmv("rdtsc"
+			 : "=A"(Counter));
+#elif defined(a32)
+		asmv("rdtsc"
+			 : "=A"(Counter));
+#elif defined(aa64)
+		asmv("mrs %0, cntvct_el0"
+			 : "=r"(Counter));
+#endif
+		return Counter;
+	}
+
+	uint64_t CheckSIMD()
+	{
+#if defined(a32)
+		return SIMD_NONE; /* TODO: Support x86 SIMD on x32 */
+#endif
+
+		if (unlikely(!SSEEnabled))
+			return SIMD_NONE;
+
+			// return SIMD_SSE;
+
+#if defined(a86)
+		static uint64_t SIMDType = SIMD_NONE;
+
+		if (likely(SIMDType != SIMD_NONE))
+			return SIMDType;
+
+		if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+		{
+			CPU::x86::AMD::CPUID0x00000001 cpuid;
+			asmv("cpuid"
+				 : "=a"(cpuid.EAX.raw), "=b"(cpuid.EBX.raw), "=c"(cpuid.ECX.raw), "=d"(cpuid.EDX.raw)
+				 : "a"(0x1));
+
+			if (cpuid.ECX.SSE42)
+				SIMDType |= SIMD_SSE42;
+			else if (cpuid.ECX.SSE41)
+				SIMDType |= SIMD_SSE41;
+			else if (cpuid.ECX.SSE3)
+				SIMDType |= SIMD_SSE3;
+			else if (cpuid.EDX.SSE2)
+				SIMDType |= SIMD_SSE2;
+			else if (cpuid.EDX.SSE)
+				SIMDType |= SIMD_SSE;
+
+#ifdef DEBUG
+			if (cpuid.ECX.SSE42)
+				debug("SSE4.2 is supported.");
+			if (cpuid.ECX.SSE41)
+				debug("SSE4.1 is supported.");
+			if (cpuid.ECX.SSE3)
+				debug("SSE3 is supported.");
+			if (cpuid.EDX.SSE2)
+				debug("SSE2 is supported.");
+			if (cpuid.EDX.SSE)
+				debug("SSE is supported.");
+#endif
+
+			return SIMDType;
+		}
+		else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+		{
+			CPU::x86::Intel::CPUID0x00000001 cpuid;
+			asmv("cpuid"
+				 : "=a"(cpuid.EAX.raw), "=b"(cpuid.EBX.raw), "=c"(cpuid.ECX.raw), "=d"(cpuid.EDX.raw)
+				 : "a"(0x1));
+
+			if (cpuid.ECX.SSE4_2)
+				SIMDType |= SIMD_SSE42;
+			else if (cpuid.ECX.SSE4_1)
+				SIMDType |= SIMD_SSE41;
+			else if (cpuid.ECX.SSE3)
+				SIMDType |= SIMD_SSE3;
+			else if (cpuid.EDX.SSE2)
+				SIMDType |= SIMD_SSE2;
+			else if (cpuid.EDX.SSE)
+				SIMDType |= SIMD_SSE;
+
+#ifdef DEBUG
+			if (cpuid.ECX.SSE4_2)
+				debug("SSE4.2 is supported.");
+			if (cpuid.ECX.SSE4_1)
+				debug("SSE4.1 is supported.");
+			if (cpuid.ECX.SSE3)
+				debug("SSE3 is supported.");
+			if (cpuid.EDX.SSE2)
+				debug("SSE2 is supported.");
+			if (cpuid.EDX.SSE)
+				debug("SSE is supported.");
+#endif
+			return SIMDType;
+		}
+
+		debug("No SIMD support.");
+#endif // a64 || a32
+		return SIMD_NONE;
+	}
+
+	bool CheckSIMD(x86SIMDType Type)
+	{
+		if (unlikely(!SSEEnabled))
+			return false;
+
+#if defined(a86)
+		if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+		{
+			CPU::x86::AMD::CPUID0x00000001 cpuid;
+			asmv("cpuid"
+				 : "=a"(cpuid.EAX.raw), "=b"(cpuid.EBX.raw), "=c"(cpuid.ECX.raw), "=d"(cpuid.EDX.raw)
+				 : "a"(0x1));
+
+			if (Type == SIMD_SSE42)
+				return cpuid.ECX.SSE42;
+			else if (Type == SIMD_SSE41)
+				return cpuid.ECX.SSE41;
+			else if (Type == SIMD_SSE3)
+				return cpuid.ECX.SSE3;
+			else if (Type == SIMD_SSE2)
+				return cpuid.EDX.SSE2;
+			else if (Type == SIMD_SSE)
+				return cpuid.EDX.SSE;
+		}
+		else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+		{
+			CPU::x86::Intel::CPUID0x00000001 cpuid;
+			asmv("cpuid"
+				 : "=a"(cpuid.EAX.raw), "=b"(cpuid.EBX.raw), "=c"(cpuid.ECX.raw), "=d"(cpuid.EDX.raw)
+				 : "a"(0x1));
+
+			if (Type == SIMD_SSE42)
+				return cpuid.ECX.SSE4_2;
+			else if (Type == SIMD_SSE41)
+				return cpuid.ECX.SSE4_1;
+			else if (Type == SIMD_SSE3)
+				return cpuid.ECX.SSE3;
+			else if (Type == SIMD_SSE2)
+				return cpuid.EDX.SSE2;
+			else if (Type == SIMD_SSE)
+				return cpuid.EDX.SSE;
+		}
+#endif // a64 || a32
+		return false;
+	}
+}
diff --git a/Kernel/Core/Crash/CrashDetails.cpp b/Kernel/Core/Crash/CrashDetails.cpp
new file mode 100644
index 00000000..bc1b85ec
--- /dev/null
+++ b/Kernel/Core/Crash/CrashDetails.cpp
@@ -0,0 +1,346 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../crashhandler.hpp"
+#include "chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+static const char *PageFaultDescriptions[8] = {
+    "Supervisory process tried to read a non-present page entry\n",
+    "Supervisory process tried to read a page and caused a protection fault\n",
+    "Supervisory process tried to write to a non-present page entry\n",
+    "Supervisory process tried to write a page and caused a protection fault\n",
+    "User process tried to read a non-present page entry\n",
+    "User process tried to read a page and caused a protection fault\n",
+    "User process tried to write to a non-present page entry\n",
+    "User process tried to write a page and caused a protection fault\n"};
+
+SafeFunction void DivideByZeroExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Divide by zero exception\n");
+    UNUSED(Frame);
+}
+
+SafeFunction void DebugExceptionHandler(CHArchTrapFrame *Frame)
+{
+    CrashHandler::EHPrint("Kernel triggered debug exception.\n");
+    UNUSED(Frame);
+}
+
+SafeFunction void NonMaskableInterruptExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("NMI exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void BreakpointExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Breakpoint exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void OverflowExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Overflow exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void BoundRangeExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Bound range exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void InvalidOpcodeExceptionHandler(CHArchTrapFrame *Frame)
+{
+    CrashHandler::EHPrint("Kernel tried to execute an invalid opcode.\n");
+    UNUSED(Frame);
+}
+
+SafeFunction void DeviceNotAvailableExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Device not available exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void DoubleFaultExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Double fault exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void CoprocessorSegmentOverrunExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Coprocessor segment overrun exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void InvalidTSSExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Invalid TSS exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void SegmentNotPresentExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Segment not present exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void StackFaultExceptionHandler(CHArchTrapFrame *Frame)
+{
+    CPU::x64::SelectorErrorCode SelCode = {.raw = Frame->ErrorCode};
+#if defined(a64)
+    CrashHandler::EHPrint("Stack segment fault at address %#lx\n", Frame->rip);
+#elif defined(a32)
+    CrashHandler::EHPrint("Stack segment fault at address %#lx\n", Frame->eip);
+#elif defined(aa64)
+#endif
+    CrashHandler::EHPrint("External: %d\n", SelCode.External);
+    CrashHandler::EHPrint("Table: %d\n", SelCode.Table);
+    CrashHandler::EHPrint("Index: %#x\n", SelCode.Idx);
+    CrashHandler::EHPrint("Error code: %#lx\n", Frame->ErrorCode);
+}
+
+SafeFunction void GeneralProtectionExceptionHandler(CHArchTrapFrame *Frame)
+{
+    CPU::x64::SelectorErrorCode SelCode = {.raw = Frame->ErrorCode};
+    // switch (SelCode.Table)
+    // {
+    // case CPU::x64::0b00:
+    //     memcpy(desc_tmp, "GDT", 3);
+    //     break;
+    // case CPU::x64::0b01:
+    //     memcpy(desc_tmp, "IDT", 3);
+    //     break;
+    // case CPU::x64::0b10:
+    //     memcpy(desc_tmp, "LDT", 3);
+    //     break;
+    // case CPU::x64::0b11:
+    //     memcpy(desc_tmp, "IDT", 3);
+    //     break;
+    // default:
+    //     memcpy(desc_tmp, "Unknown", 7);
+    //     break;
+    // }
+    CrashHandler::EHPrint("Kernel performed an illegal operation.\n");
+    CrashHandler::EHPrint("External: %d\n", SelCode.External);
+    CrashHandler::EHPrint("Table: %d\n", SelCode.Table);
+    CrashHandler::EHPrint("Index: %#x\n", SelCode.Idx);
+}
+
+SafeFunction void PageFaultExceptionHandler(CHArchTrapFrame *Frame)
+{
+    CPU::x64::PageFaultErrorCode params = {.raw = (uint32_t)Frame->ErrorCode};
+#if defined(a64)
+    CrashHandler::EHPrint("\eAFAFAFAn exception occurred at %#lx by %#lx\n", CrashHandler::PageFaultAddress, Frame->rip);
+#elif defined(a32)
+    CrashHandler::EHPrint("\eAFAFAFAn exception occurred at %#lx by %#lx\n", CrashHandler::PageFaultAddress, Frame->eip);
+#elif defined(aa64)
+#endif
+    CrashHandler::EHPrint("Page: %s\n", params.P ? "Present" : "Not Present");
+    CrashHandler::EHPrint("Write Operation: %s\n", params.W ? "Read-Only" : "Read-Write");
+    CrashHandler::EHPrint("Processor Mode: %s\n", params.U ? "User-Mode" : "Kernel-Mode");
+    CrashHandler::EHPrint("CPU Reserved Bits: %s\n", params.R ? "Reserved" : "Unreserved");
+    CrashHandler::EHPrint("Caused By An Instruction Fetch: %s\n", params.I ? "Yes" : "No");
+    CrashHandler::EHPrint("Caused By A Protection-Key Violation: %s\n", params.PK ? "Yes" : "No");
+    CrashHandler::EHPrint("Caused By A Shadow Stack Access: %s\n", params.SS ? "Yes" : "No");
+    CrashHandler::EHPrint("Caused By An SGX Violation: %s\n", params.SGX ? "Yes" : "No");
+    if (Frame->ErrorCode & 0x00000008)
+        CrashHandler::EHPrint("One or more page directory entries contain reserved bits which are set to 1.\n");
+    else
+        CrashHandler::EHPrint(PageFaultDescriptions[Frame->ErrorCode & 0b111]);
+
+#ifdef DEBUG
+    uintptr_t CheckPageFaultAddress = 0;
+    CheckPageFaultAddress = CrashHandler::PageFaultAddress;
+    if (CheckPageFaultAddress == 0)
+#ifdef a64
+        CheckPageFaultAddress = Frame->rip;
+#elif defined(a32)
+        CheckPageFaultAddress = Frame->eip;
+#elif defined(aa64)
+        CheckPageFaultAddress = 0;
+#endif
+
+#if defined(a64)
+    Memory::Virtual vma = Memory::Virtual(((Memory::PageTable4 *)CPU::x64::readcr3().raw));
+#elif defined(a32)
+    Memory::Virtual vma = Memory::Virtual(((Memory::PageTable4 *)CPU::x32::readcr3().raw));
+#elif defined(aa64)
+    Memory::Virtual vma = Memory::Virtual();
+#warning "TODO: aa64"
+#endif
+
+    bool PageAvailable = vma.Check((void *)CheckPageFaultAddress);
+    debug("Page available (Check(...)): %s. %s",
+          PageAvailable ? "Yes" : "No",
+          (params.P && !PageAvailable) ? "CR2 == Present; Check() != Present??????" : "CR2 confirms Check() result.");
+
+    if (PageAvailable)
+    {
+        bool Present = vma.Check((void *)CheckPageFaultAddress);
+        bool ReadWrite = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::RW);
+        bool User = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::US);
+        bool WriteThrough = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::PWT);
+        bool CacheDisabled = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::PCD);
+        bool Accessed = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::A);
+        bool Dirty = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::D);
+        bool Global = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::G);
+        /* ... */
+
+        debug("Page available: %s", Present ? "Yes" : "No");
+        debug("Page read/write: %s", ReadWrite ? "Yes" : "No");
+        debug("Page user/kernel: %s", User ? "User" : "Kernel");
+        debug("Page write-through: %s", WriteThrough ? "Yes" : "No");
+        debug("Page cache disabled: %s", CacheDisabled ? "Yes" : "No");
+        debug("Page accessed: %s", Accessed ? "Yes" : "No");
+        debug("Page dirty: %s", Dirty ? "Yes" : "No");
+        debug("Page global: %s", Global ? "Yes" : "No");
+
+        if (Present)
+        {
+            uintptr_t CheckPageFaultLinearAddress = (uintptr_t)CheckPageFaultAddress;
+            CheckPageFaultLinearAddress &= 0xFFFFFFFFFFFFF000;
+            debug("%#lx -> %#lx", CheckPageFaultAddress, CheckPageFaultLinearAddress);
+
+            Memory::Virtual::PageMapIndexer Index = Memory::Virtual::PageMapIndexer((uintptr_t)CheckPageFaultLinearAddress);
+            debug("Index for %#lx is PML:%d PDPTE:%d PDE:%d PTE:%d",
+                  CheckPageFaultLinearAddress,
+                  Index.PMLIndex,
+                  Index.PDPTEIndex,
+                  Index.PDEIndex,
+                  Index.PTEIndex);
+#if defined(a64)
+            Memory::PageMapLevel4 PML4 = ((Memory::PageTable4 *)CPU::x64::readcr3().raw)->Entries[Index.PMLIndex];
+#elif defined(a32)
+            Memory::PageMapLevel4 PML4 = ((Memory::PageTable4 *)CPU::x32::readcr3().raw)->Entries[Index.PMLIndex];
+#elif defined(aa64)
+            Memory::PageMapLevel4 PML4 = {.raw = 0};
+#warning "TODO: aa64"
+#endif
+
+            Memory::PageDirectoryPointerTableEntryPtr *PDPTE = (Memory::PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4.GetAddress() << 12);
+            Memory::PageDirectoryEntryPtr *PDE = (Memory::PageDirectoryEntryPtr *)((uintptr_t)PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+            Memory::PageTableEntryPtr *PTE = (Memory::PageTableEntryPtr *)((uintptr_t)PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+
+            debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:%#lx",
+                  Index.PMLIndex, 0, 0, 0,
+                  PML4.Present ? "1" : "0",
+                  PML4.ReadWrite ? "1" : "0",
+                  PML4.UserSupervisor ? "1" : "0",
+                  PML4.WriteThrough ? "1" : "0",
+                  PML4.CacheDisable ? "1" : "0",
+                  PML4.Accessed ? "1" : "0",
+                  PML4.ExecuteDisable ? "1" : "0",
+                  PML4.GetAddress() << 12);
+
+            debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:%#lx",
+                  Index.PMLIndex, Index.PDPTEIndex, 0, 0,
+                  PDPTE->Entries[Index.PDPTEIndex].Present ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].ReadWrite ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].UserSupervisor ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].WriteThrough ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].CacheDisable ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].Accessed ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].ExecuteDisable ? "1" : "0",
+                  PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+
+            debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:%#lx",
+                  Index.PMLIndex, Index.PDPTEIndex, Index.PDEIndex, 0,
+                  PDE->Entries[Index.PDEIndex].Present ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].ReadWrite ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].UserSupervisor ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].WriteThrough ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].CacheDisable ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].Accessed ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].ExecuteDisable ? "1" : "0",
+                  PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+
+            debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s D:%s PAT:%s G:%s PK:%d NX:%s Address:%#lx",
+                  Index.PMLIndex, Index.PDPTEIndex, Index.PDEIndex, Index.PTEIndex,
+                  PTE->Entries[Index.PTEIndex].Present ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].ReadWrite ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].UserSupervisor ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].WriteThrough ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].CacheDisable ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].Accessed ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].Dirty ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].PageAttributeTable ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].Global ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].ProtectionKey,
+                  PTE->Entries[Index.PTEIndex].ExecuteDisable ? "1" : "0",
+                  PTE->Entries[Index.PTEIndex].GetAddress() << 12);
+        }
+    }
+#endif
+}
+
+SafeFunction void x87FloatingPointExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("x87 floating point exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void AlignmentCheckExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Alignment check exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void MachineCheckExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Machine check exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void SIMDFloatingPointExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("SIMD floating point exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void VirtualizationExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Virtualization exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void SecurityExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Security exception");
+    UNUSED(Frame);
+}
+
+SafeFunction void UnknownExceptionHandler(CHArchTrapFrame *Frame)
+{
+    fixme("Unknown exception");
+    UNUSED(Frame);
+}
diff --git a/Kernel/Core/Crash/CrashHandler.cpp b/Kernel/Core/Crash/CrashHandler.cpp
new file mode 100644
index 00000000..6eabd5b0
--- /dev/null
+++ b/Kernel/Core/Crash/CrashHandler.cpp
@@ -0,0 +1,1122 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../crashhandler.hpp"
+#include "chfcts.hpp"
+
+#include <display.hpp>
+#include <bitmap.hpp>
+#include <convert.h>
+#include <printf.h>
+#include <lock.hpp>
+#include <rand.hpp>
+#include <uart.hpp>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+#include <io.h>
+
+#if defined(a64)
+#include "../../Architecture/amd64/cpu/gdt.hpp"
+#include "../Architecture/amd64/cpu/apic.hpp"
+#elif defined(a32)
+#include "../../Architecture/i386/cpu/gdt.hpp"
+#include "../Architecture/i386/cpu/apic.hpp"
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+#include "../../DAPI.hpp"
+
+NewLock(UserInputLock);
+
+namespace CrashHandler
+{
+    uintptr_t PageFaultAddress = 0;
+    void *EHIntFrames[INT_FRAMES_MAX];
+    static bool ExceptionOccurred = false;
+    int SBIdx = 255;
+
+    SafeFunction void printfWrapper(char c, void *unused)
+    {
+        Display->Print(c, SBIdx, true);
+        UNUSED(unused);
+    }
+
+    SafeFunction void EHPrint(const char *Format, ...)
+    {
+        va_list args;
+        va_start(args, Format);
+        vfctprintf(printfWrapper, NULL, Format, args);
+        va_end(args);
+    }
+
+    SafeFunction void EHDumpData(void *Address, unsigned long Length)
+    {
+        EHPrint("-------------------------------------------------------------------------\n");
+        Display->SetBuffer(SBIdx);
+        unsigned char *AddressChar = (unsigned char *)Address;
+        unsigned char Buffer[17];
+        unsigned long Iterate;
+        for (Iterate = 0; Iterate < Length; Iterate++)
+        {
+            if ((Iterate % 16) == 0)
+            {
+                if (Iterate != 0)
+                    EHPrint("  \e8A78FF%s\eAABBCC\n", Buffer);
+                EHPrint("  \e9E9E9E%04x\eAABBCC ", Iterate);
+                Display->SetBuffer(SBIdx);
+            }
+            EHPrint(" \e4287f5%02x\eAABBCC", AddressChar[Iterate]);
+            if ((AddressChar[Iterate] < 0x20) || (AddressChar[Iterate] > 0x7e))
+                Buffer[Iterate % 16] = '.';
+            else
+                Buffer[Iterate % 16] = AddressChar[Iterate];
+            Buffer[(Iterate % 16) + 1] = '\0';
+        }
+
+        while ((Iterate % 16) != 0)
+        {
+            EHPrint("   ");
+            Display->SetBuffer(SBIdx);
+            Iterate++;
+        }
+
+        EHPrint("  \e8A78FF%s\eAABBCC\n", Buffer);
+        EHPrint("-------------------------------------------------------------------------\n\n.");
+        Display->SetBuffer(SBIdx);
+    }
+
+    SafeFunction char *TrimWhiteSpace(char *str)
+    {
+        char *end;
+        while (*str == ' ')
+            str++;
+        if (*str == 0)
+            return str;
+        end = str + strlen(str) - 1;
+        while (end > str && *end == ' ')
+            end--;
+        *(end + 1) = 0;
+        return str;
+    }
+
+    CRData crashdata = {};
+
+    SafeFunction void DisplayTopOverlay()
+    {
+        Video::ScreenBuffer *sb = Display->GetBuffer(SBIdx);
+        Video::Font *f = Display->GetCurrentFont();
+        Video::FontInfo fi = f->GetInfo();
+
+        for (uint32_t i = 0; i < sb->Width; i++)
+            for (uint32_t j = 0; j < fi.Height + 8; j++)
+                Display->SetPixel(i, j, 0x282828, SBIdx);
+
+        Display->SetBufferCursor(SBIdx, 8, (fi.Height + 8) / 6);
+        switch (SBIdx)
+        {
+        case 255:
+        {
+            EHPrint("\eAAAAAAMAIN \e606060DETAILS \e606060FRAMES \e606060TASKS \e606060CONSOLE");
+            break;
+        }
+        case 254:
+        {
+            EHPrint("\e606060MAIN \eAAAAAADETAILS \e606060FRAMES \e606060TASKS \e606060CONSOLE");
+            break;
+        }
+        case 253:
+        {
+            EHPrint("\e606060MAIN \e606060DETAILS \eAAAAAAFRAMES \e606060TASKS \e606060CONSOLE");
+            break;
+        }
+        case 252:
+        {
+            EHPrint("\e606060MAIN \e606060DETAILS \e606060FRAMES \eAAAAAATASKS \e606060CONSOLE");
+            break;
+        }
+        case 251:
+        {
+            EHPrint("\e606060MAIN \e606060DETAILS \e606060FRAMES \e606060TASKS \eAAAAAACONSOLE");
+            break;
+        }
+        default:
+        {
+            EHPrint("\e606060MAIN \e606060DETAILS \e606060FRAMES \e606060TASKS \e606060CONSOLE");
+            break;
+        }
+        }
+        EHPrint("  \e00AAFF%ldMB / %ldMB (%ldMB Reserved)",
+                TO_MB(KernelAllocator.GetUsedMemory()),
+                TO_MB(KernelAllocator.GetTotalMemory()),
+                TO_MB(KernelAllocator.GetReservedMemory()));
+        EHPrint("  \eAA0F0F%s", CPU::Hypervisor());
+        EHPrint(" \eAAF00F%s", CPU::Vendor());
+        EHPrint(" \eAA00FF%s", CPU::Name());
+        Display->SetBufferCursor(SBIdx, 0, fi.Height + 10);
+
+        /* https://imgflip.com/i/77slbl */
+        if ((Random::rand32() % 100) >= 98)
+        {
+            debug("Easter egg activated!");
+            int BaseXOffset = sb->Width - 14;
+            int BaseYOffset = 8;
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 0, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 0, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 0, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 7, BaseYOffset + 0, 0x21852E, SBIdx);
+
+            Display->SetPixel(BaseXOffset + 2, BaseYOffset + 1, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 1, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 1, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 5, BaseYOffset + 1, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 1, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 7, BaseYOffset + 1, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 8, BaseYOffset + 1, 0x21852E, SBIdx);
+
+            Display->SetPixel(BaseXOffset + 1, BaseYOffset + 2, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 2, BaseYOffset + 2, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 2, 0xFFFFFF, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 2, 0x000000, SBIdx);
+            Display->SetPixel(BaseXOffset + 5, BaseYOffset + 2, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 2, 0xFFFFFF, SBIdx);
+            Display->SetPixel(BaseXOffset + 7, BaseYOffset + 2, 0x000000, SBIdx);
+            Display->SetPixel(BaseXOffset + 8, BaseYOffset + 2, 0x21852E, SBIdx);
+
+            Display->SetPixel(BaseXOffset + 1, BaseYOffset + 3, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 2, BaseYOffset + 3, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 3, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 3, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 5, BaseYOffset + 3, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 3, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 7, BaseYOffset + 3, 0x21852E, SBIdx);
+
+            Display->SetPixel(BaseXOffset + 0, BaseYOffset + 4, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 1, BaseYOffset + 4, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 2, BaseYOffset + 4, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 4, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 4, 0xA84832, SBIdx);
+            Display->SetPixel(BaseXOffset + 5, BaseYOffset + 4, 0xA84832, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 4, 0xA84832, SBIdx);
+            Display->SetPixel(BaseXOffset + 7, BaseYOffset + 4, 0xA84832, SBIdx);
+
+            Display->SetPixel(BaseXOffset + 0, BaseYOffset + 5, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 1, BaseYOffset + 5, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 2, BaseYOffset + 5, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 5, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 5, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 5, BaseYOffset + 5, 0x21852E, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 5, 0x21852E, SBIdx);
+
+            Display->SetPixel(BaseXOffset + 0, BaseYOffset + 6, 0x1216FF, SBIdx);
+            Display->SetPixel(BaseXOffset + 1, BaseYOffset + 6, 0x1216FF, SBIdx);
+            Display->SetPixel(BaseXOffset + 2, BaseYOffset + 6, 0x1216FF, SBIdx);
+            Display->SetPixel(BaseXOffset + 3, BaseYOffset + 6, 0x1216FF, SBIdx);
+            Display->SetPixel(BaseXOffset + 4, BaseYOffset + 6, 0x1216FF, SBIdx);
+            Display->SetPixel(BaseXOffset + 5, BaseYOffset + 6, 0x1216FF, SBIdx);
+            Display->SetPixel(BaseXOffset + 6, BaseYOffset + 6, 0x1216FF, SBIdx);
+
+            Display->SetBuffer(SBIdx);
+        }
+    }
+
+    SafeFunction void DisplayBottomOverlay()
+    {
+        Video::ScreenBuffer *sb = Display->GetBuffer(SBIdx);
+        Video::Font *f = Display->GetCurrentFont();
+        Video::FontInfo fi = f->GetInfo();
+
+        for (uint32_t i = 0; i < sb->Width; i++)
+            for (uint32_t j = sb->Height - fi.Height - 8; j < sb->Height; j++)
+                Display->SetPixel(i, j, 0x282828, SBIdx);
+
+        Display->SetBufferCursor(SBIdx, 8, sb->Height - fi.Height - 4);
+        EHPrint("\eAAAAAA> \eFAFAFA");
+    }
+
+    SafeFunction void ArrowInput(uint8_t key)
+    {
+        switch (key)
+        {
+        case KEY_D_UP:
+            if (SBIdx < 255)
+                SBIdx++;
+            else
+                return;
+            break;
+        case KEY_D_LEFT:
+            if (SBIdx < 255)
+                SBIdx++;
+            else
+                return;
+            break;
+        case KEY_D_RIGHT:
+            if (SBIdx > 251)
+                SBIdx--;
+            else
+                return;
+            break;
+        case KEY_D_DOWN:
+            if (SBIdx > 251)
+                SBIdx--;
+            else
+                return;
+            break;
+        default:
+            break;
+        }
+        Display->ClearBuffer(SBIdx);
+        DisplayTopOverlay();
+        EHPrint("\eFAFAFA");
+
+        switch (SBIdx)
+        {
+        case 255:
+        {
+            DisplayMainScreen(crashdata);
+            break;
+        }
+        case 254:
+        {
+            DisplayDetailsScreen(crashdata);
+            break;
+        }
+        case 253:
+        {
+            DisplayStackFrameScreen(crashdata);
+            break;
+        }
+        case 252:
+        {
+            DisplayTasksScreen(crashdata);
+            break;
+        }
+        case 251:
+        {
+            DisplayConsoleScreen(crashdata);
+            break;
+        }
+        default:
+        {
+            break;
+        }
+        }
+        DisplayBottomOverlay();
+        Display->SetBuffer(SBIdx);
+    }
+
+    SafeFunction void UserInput(char *Input)
+    {
+        SmartCriticalSection(UserInputLock);
+        Display->ClearBuffer(SBIdx);
+        DisplayTopOverlay();
+        EHPrint("\eFAFAFA");
+
+        if (strcmp(Input, "help") == 0)
+        {
+            EHPrint("Available commands are:\n");
+            EHPrint("exit - Shutdown the OS.\n");
+            EHPrint("reboot - Reboot the OS.\n");
+            EHPrint("help - Display this help message.\n");
+            EHPrint("showbuf,sb <INDEX> - Display the contents of a screen buffer.\n");
+            EHPrint("       - A sleep timer will be enabled. This will cause the OS to sleep for an unknown amount of time.\n");
+            EHPrint("       - \eFF4400WARNING: This can crash the system if a wrong buffer is selected.\eFAFAFA\n");
+            EHPrint("ifr <COUNT> - Show interrupt frames.\n");
+            EHPrint("tlb <ADDRESS> - Print the page table entries\n");
+            EHPrint("bitmap - Print the memory bitmap\n");
+            EHPrint("mem - Print the memory allocation\n");
+            EHPrint("cr<INDEX> - Print the CPU control register\n");
+            EHPrint("tss <CORE> - Print the CPU task state segment\n");
+            EHPrint("dump <ADDRESS HEX> <LENGTH DEC> - Dump memory\n");
+            EHPrint("       - \eFF4400WARNING: This can crash the system if you try to read from an unmapped page.\eFAFAFA\n");
+            EHPrint("uartmemdmp <INDEX> <SKIP INACCESSIBLE (bool 0,1)> - Dump the memory of a UART.\n");
+            EHPrint("main - Show the main screen.\n");
+            EHPrint("details - Show the details screen.\n");
+            EHPrint("frames - Show the stack frame screen.\n");
+            EHPrint("tasks - Show the tasks screen.\n");
+            EHPrint("console - Show the console screen.\n");
+            EHPrint("Also, you can use the arrow keys to navigate between the screens.\n");
+            EHPrint("=========================================================================\n");
+            EHPrint("Kernel Compiled at: %s %s with C++ Standard: %d\n", __DATE__, __TIME__, CPP_LANGUAGE_STANDARD);
+            EHPrint("C++ Language Version (__cplusplus): %ld\n", __cplusplus);
+        }
+        else if (strcmp(Input, "exit") == 0)
+        {
+            PowerManager->Shutdown();
+            EHPrint("\eFFFFFFNow it's safe to turn off your computer.");
+            Display->SetBuffer(SBIdx);
+            CPU::Stop();
+        }
+        else if (strcmp(Input, "reboot") == 0)
+        {
+            PowerManager->Reboot();
+            EHPrint("\eFFFFFFNow it's safe to reboot your computer.");
+            Display->SetBuffer(SBIdx);
+            CPU::Stop();
+        }
+        else if (strncmp(Input, "showbuf", 7) == 0 || strncmp(Input, "sb", 2) == 0)
+        {
+            char *arg = TrimWhiteSpace(Input + 7);
+            int tmpidx = SBIdx;
+            SBIdx = atoi(arg);
+            Display->SetBuffer(SBIdx);
+#if defined(a86)
+            for (int i = 0; i < 5000000; i++)
+                inb(0x80);
+#endif // a64 || a32
+            SBIdx = tmpidx;
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strncmp(Input, "ifr", 3) == 0)
+        {
+            char *arg = TrimWhiteSpace(Input + 3);
+            int CountI = atoi(arg);
+            int TotalCount = sizeof(EHIntFrames) / sizeof(EHIntFrames[0]);
+
+            debug("Printing %ld interrupt frames.", CountI);
+
+            if (CountI > TotalCount)
+            {
+                EHPrint("\eFF4400Count too big! Maximum allowed is %ld\eFAFAFA\n", TotalCount);
+                Display->SetBuffer(SBIdx);
+            }
+            else
+            {
+                for (int i = 0; i < CountI; i++)
+                {
+                    if (EHIntFrames[i])
+                    {
+                        if (!Memory::Virtual().Check(EHIntFrames[i]))
+                            continue;
+                        EHPrint("\n\e2565CC%p", EHIntFrames[i]);
+                        EHPrint("\e7925CC-");
+#if defined(a64)
+                        if ((uintptr_t)EHIntFrames[i] >= 0xFFFFFFFF80000000 && (uintptr_t)EHIntFrames[i] <= (uintptr_t)&_kernel_end)
+#elif defined(a32)
+                        if ((uintptr_t)EHIntFrames[i] >= 0xC0000000 && (uintptr_t)EHIntFrames[i] <= (uintptr_t)&_kernel_end)
+#elif defined(aa64)
+                        if ((uintptr_t)EHIntFrames[i] >= 0xFFFFFFFF80000000 && (uintptr_t)EHIntFrames[i] <= (uintptr_t)&_kernel_end)
+#endif
+                            EHPrint("\e25CCC9%s", KernelSymbolTable->GetSymbolFromAddress((uintptr_t)EHIntFrames[i]));
+                        else
+                            EHPrint("\eFF4CA9Outside Kernel");
+#if defined(a86)
+                        for (int i = 0; i < 20000; i++)
+                            inb(0x80);
+#endif // a64 || a32
+                        Display->SetBuffer(SBIdx);
+                    }
+                }
+            }
+        }
+        else if (strncmp(Input, "tlb", 3) == 0)
+        {
+            char *arg = TrimWhiteSpace(Input + 3);
+            uintptr_t Address = NULL;
+            Address = strtol(arg, NULL, 16);
+            debug("Converted %s to %#lx", arg, Address);
+            Memory::PageTable4 *BasePageTable = (Memory::PageTable4 *)Address;
+            if (Memory::Virtual().Check(BasePageTable))
+            {
+                for (int PMLIndex = 0; PMLIndex < 512; PMLIndex++)
+                {
+                    Memory::PageMapLevel4 PML4 = BasePageTable->Entries[PMLIndex];
+                    EHPrint("\e888888# \eAABBCC%03d-%03d-%03d-%03d\e4500F5: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:\e888888%#lx\n",
+                            PMLIndex, 0, 0, 0,
+                            PML4.Present ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.ReadWrite ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.UserSupervisor ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.WriteThrough ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.CacheDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.Accessed ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.ExecuteDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                            PML4.GetAddress() << 12);
+                    Display->SetBuffer(SBIdx);
+                    if (PML4.Present)
+                    {
+                        Memory::PageDirectoryPointerTableEntryPtr *PDPTE = (Memory::PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4.GetAddress() << 12);
+                        if (PDPTE)
+                        {
+                            for (int PDPTEIndex = 0; PDPTEIndex < 512; PDPTEIndex++)
+                            {
+                                EHPrint("\e888888# \eAABBCC%03d-%03d-%03d-%03d\e4500F5: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:\e888888%#lx\n",
+                                        PMLIndex, PDPTEIndex, 0, 0,
+                                        PDPTE->Entries[PDPTEIndex].Present ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].ReadWrite ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].UserSupervisor ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].WriteThrough ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].CacheDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].Accessed ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].ExecuteDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                        PDPTE->Entries[PDPTEIndex].GetAddress() << 12);
+                                Display->SetBuffer(SBIdx);
+                                if ((PDPTE->Entries[PDPTEIndex].Present))
+                                {
+                                    Memory::PageDirectoryEntryPtr *PDE = (Memory::PageDirectoryEntryPtr *)((uintptr_t)PDPTE->Entries[PDPTEIndex].GetAddress() << 12);
+                                    if (PDE)
+                                    {
+                                        for (int PDEIndex = 0; PDEIndex < 512; PDEIndex++)
+                                        {
+                                            EHPrint("\e888888# \eAABBCC%03d-%03d-%03d-%03d\e4500F5: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:\e888888%#lx\n",
+                                                    PMLIndex, PDPTEIndex, PDEIndex, 0,
+                                                    PDE->Entries[PDEIndex].Present ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].ReadWrite ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].UserSupervisor ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].WriteThrough ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].CacheDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].Accessed ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].ExecuteDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                    PDE->Entries[PDEIndex].GetAddress() << 12);
+                                            Display->SetBuffer(SBIdx);
+                                            if ((PDE->Entries[PDEIndex].Present))
+                                            {
+                                                Memory::PageTableEntryPtr *PTE = (Memory::PageTableEntryPtr *)((uintptr_t)PDE->Entries[PDEIndex].GetAddress() << 12);
+                                                if (PTE)
+                                                {
+                                                    for (int PTEIndex = 0; PTEIndex < 512; PTEIndex++)
+                                                    {
+                                                        EHPrint("\e888888# \eAABBCC%03d-%03d-%03d-%03d\e4500F5: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s D:%s PAT:%s G:%s PK:%d NX:%s Address:\e888888%#lx\n",
+                                                                PMLIndex, PDPTEIndex, PDEIndex, PTEIndex,
+                                                                PTE->Entries[PTEIndex].Present ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].ReadWrite ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].UserSupervisor ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].WriteThrough ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].CacheDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].Accessed ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].Dirty ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].PageAttributeTable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].Global ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].ProtectionKey,
+                                                                PTE->Entries[PTEIndex].ExecuteDisable ? "\e00FF001\e4500F5" : "\eFF00000\e4500F5",
+                                                                PTE->Entries[PTEIndex].GetAddress() << 12);
+                                                        Display->SetBuffer(SBIdx);
+                                                    }
+                                                }
+                                            }
+                                        }
+                                    }
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        else if (strncmp(Input, "bitmap", 6) == 0)
+        {
+            Bitmap bm = KernelAllocator.GetPageBitmap();
+
+            EHPrint("\n\eFAFAFA[0%%] %08ld: ", 0);
+            for (size_t i = 0; i < bm.Size; i++)
+            {
+                if (bm.Get(i))
+                    EHPrint("\eFF00001");
+                else
+                    EHPrint("\e00FF000");
+                if (i % 128 == 127)
+                {
+                    short Percentage = s_cst(short, (i * 100) / bm.Size);
+                    EHPrint("\n\eFAFAFA[%03ld%%] %08ld: ", Percentage, i);
+                    Display->SetBuffer(SBIdx);
+                }
+            }
+            EHPrint("\n\e22AA44--- END OF BITMAP ---\nBitmap size: %ld\n\n.", bm.Size);
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strcmp(Input, "mem") == 0)
+        {
+            uint64_t Total = KernelAllocator.GetTotalMemory();
+            uint64_t Used = KernelAllocator.GetUsedMemory();
+            uint64_t Free = KernelAllocator.GetFreeMemory();
+            uint64_t Reserved = KernelAllocator.GetReservedMemory();
+
+            EHPrint("\e22AA44Total: %ld bytes\n\eFF0000Used: %ld bytes\n\e00FF00Free: %ld bytes\n\eFF00FFReserved: %ld bytes\n", Total, Used, Free, Reserved);
+            int Progress = s_cst(int, (Used * 100) / Total);
+            int ReservedProgress = s_cst(int, (Reserved * 100) / Total);
+            EHPrint("\e22AA44%3d%% \eCCCCCC[", Progress);
+            for (int i = 0; i < Progress; i++)
+                EHPrint("\eFF0000|");
+            for (int i = 0; i < 100 - Progress; i++)
+                EHPrint("\e00FF00|");
+            for (int i = 0; i < ReservedProgress; i++)
+                EHPrint("\eFF00FF|");
+            EHPrint("\eCCCCCC]\n");
+
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strncmp(Input, "cr", 2) == 0)
+        {
+            char *cr = TrimWhiteSpace(Input + 2);
+            switch (cr[0])
+            {
+            case '0':
+            {
+#if defined(a64)
+                EHPrint("\e44AA000: %#lx\n", CPU::x64::readcr0());
+#elif defined(a32)
+                EHPrint("\e44AA000: %#lx\n", CPU::x32::readcr0());
+#endif
+                break;
+            }
+            case '2':
+            {
+#if defined(a64)
+                EHPrint("\e44AA002: %#lx\n", PageFaultAddress);
+#elif defined(a32)
+                EHPrint("\e44AA002: %#lx\n", CPU::x32::readcr2());
+#endif
+                break;
+            }
+            case '3':
+            {
+#if defined(a64)
+                EHPrint("\e44AA003: %#lx\n", CPU::x64::readcr3());
+#elif defined(a32)
+                EHPrint("\e44AA003: %#lx\n", CPU::x32::readcr3());
+#endif
+                break;
+            }
+            case '4':
+            {
+#if defined(a64)
+                EHPrint("\e44AA004: %#lx\n", CPU::x64::readcr4());
+#elif defined(a32)
+                EHPrint("\e44AA004: %#lx\n", CPU::x32::readcr4());
+#endif
+                break;
+            }
+            case '8':
+            {
+#if defined(a64)
+                EHPrint("\e44AA008: %#lx\n", CPU::x64::readcr8());
+#elif defined(a32)
+                EHPrint("\e44AA008: %#lx\n", CPU::x32::readcr8());
+#endif
+                break;
+            }
+            default:
+                EHPrint("\eFF0000Invalid CR\n");
+                break;
+            }
+        }
+        else if (strncmp(Input, "tss", 3) == 0)
+        {
+            char *arg = TrimWhiteSpace(Input + 3);
+            int TSSIndex = atoi(arg);
+            if (TSSIndex > SMP::CPUCores)
+            {
+                EHPrint("\eFF0000Invalid TSS index\n");
+            }
+            else
+            {
+#if defined(a86)
+                GlobalDescriptorTable::TaskStateSegment tss = GlobalDescriptorTable::tss[TSSIndex];
+                EHPrint("\eFAFAFAStack Pointer 0: \eAABB22%#lx\n", tss.StackPointer[0]);
+                EHPrint("\eFAFAFAStack Pointer 1: \eAABB22%#lx\n", tss.StackPointer[1]);
+                EHPrint("\eFAFAFAStack Pointer 2: \eAABB22%#lx\n", tss.StackPointer[2]);
+
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[0]);
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[1]);
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[2]);
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[3]);
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[4]);
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[5]);
+                EHPrint("\eFAFAFAInterrupt Stack Table: \eAABB22%#lx\n", tss.InterruptStackTable[6]);
+
+                EHPrint("\eFAFAFAI/O Map Base Address Offset: \eAABB22%#lx\n", tss.IOMapBaseAddressOffset);
+
+                EHPrint("\eFAFAFAReserved 0: \eAABB22%#lx\n", tss.Reserved0);
+                EHPrint("\eFAFAFAReserved 1: \eAABB22%#lx\n", tss.Reserved1);
+                EHPrint("\eFAFAFAReserved 2: \eAABB22%#lx\n", tss.Reserved2);
+#elif defined(aa64)
+                EHPrint("\eFF0000AArch64 does not have TSS\n");
+#endif
+            }
+        }
+        else if (strncmp(Input, "dump", 4) == 0)
+        {
+            char *arg = TrimWhiteSpace(Input + 4);
+            char *addr = strtok(arg, " ");
+            char *len = strtok(NULL, " ");
+            if (addr == NULL || len == NULL)
+            {
+                EHPrint("\eFF0000Invalid arguments\n");
+            }
+            else
+            {
+                uint64_t Address = strtoul(addr, NULL, 16);
+                uint64_t Length = strtoul(len, NULL, 10);
+                debug("Dumping %ld bytes from %#lx\n", Length, Address);
+                EHDumpData((void *)Address, Length);
+            }
+        }
+        else if (strncmp(Input, "uartmemdmp", 10) == 0)
+        {
+            char *arg = TrimWhiteSpace(Input + 10);
+            char *cPort = strtok(arg, " ");
+            char *cBoolSkip = strtok(NULL, " ");
+            UniversalAsynchronousReceiverTransmitter::SerialPorts port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM1;
+            switch (cPort[0])
+            {
+            case '1':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM1;
+                break;
+            case '2':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM2;
+                break;
+            case '3':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM3;
+                break;
+            case '4':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM4;
+                break;
+            case '5':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM5;
+                break;
+            case '6':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM6;
+                break;
+            case '7':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM7;
+                break;
+            case '8':
+                port = UniversalAsynchronousReceiverTransmitter::SerialPorts::COM8;
+                break;
+            default:
+                EHPrint("\eFF0000Invalid port! Defaulting to 1.\n");
+                break;
+            }
+            EHPrint("\eF8F8F8Dumping memory to UART port %c (%#lx) and %s inaccessible pages.\n", cPort[0], port, cBoolSkip[0] == '1' ? "skipping" : "zeroing");
+            Display->SetBuffer(SBIdx);
+            uint64_t Length = KernelAllocator.GetTotalMemory();
+            uint64_t ProgressLength = Length;
+            UniversalAsynchronousReceiverTransmitter::UART uart(port);
+            Memory::Virtual vma;
+            uint8_t *Address = reinterpret_cast<uint8_t *>(0x0);
+            int Progress = 0;
+            for (size_t i = 0; i < Length; i++)
+            {
+                if (vma.Check(Address))
+                    uart.Write(*Address);
+                else if (cBoolSkip[0] == '0')
+                    uart.Write((uint8_t)0);
+                else
+                    ProgressLength--;
+                Address++;
+
+                if (unlikely(i % 0x1000 == 0))
+                {
+                    int NewProgress = (int)((i * 100) / ProgressLength);
+                    if (unlikely(NewProgress != Progress))
+                    {
+                        Progress = NewProgress;
+                        EHPrint("\n%d%%\n", Progress);
+                        Display->SetBuffer(SBIdx);
+                    }
+                    Display->Print('.', SBIdx);
+                    if (unlikely(i % 0x500 == 0))
+                        Display->SetBuffer(SBIdx);
+                }
+            }
+            EHPrint("\nDone.\n");
+        }
+        else if (strcmp(Input, "main") == 0)
+        {
+            SBIdx = 255;
+            DisplayTopOverlay();
+            DisplayMainScreen(crashdata);
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strcmp(Input, "details") == 0)
+        {
+            SBIdx = 254;
+            DisplayTopOverlay();
+            DisplayDetailsScreen(crashdata);
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strcmp(Input, "frames") == 0)
+        {
+            SBIdx = 253;
+            DisplayTopOverlay();
+            DisplayStackFrameScreen(crashdata);
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strcmp(Input, "tasks") == 0)
+        {
+            SBIdx = 252;
+            DisplayTopOverlay();
+            DisplayTasksScreen(crashdata);
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strcmp(Input, "console") == 0)
+        {
+            SBIdx = 251;
+            DisplayTopOverlay();
+            DisplayConsoleScreen(crashdata);
+            Display->SetBuffer(SBIdx);
+        }
+        else if (strlen(Input) > 0)
+            EHPrint("Unknown command: %s", Input);
+
+        DisplayBottomOverlay();
+        Display->SetBuffer(SBIdx);
+    }
+
+    SafeFunction void StopAllCores()
+    {
+#if defined(a86)
+        /* FIXME: Can't send IPIs to other cores
+         * because it causes another exception on
+         * the other cores.
+         *
+         * Also it makes every core to stay at 100% usage for some reason.
+         */
+
+        // if (SMP::CPUCores > 1)
+        // {
+        //     for (int i = 1; i < SMP::CPUCores; i++)
+        //     {
+        //         APIC::InterruptCommandRegisterLow icr;
+        //         icr.Vector = CPU::x86::IRQ29;
+        //         icr.Level = APIC::APICLevel::Assert;
+        //         ((APIC::APIC *)Interrupts::apic[i])->IPI(i, icr);
+        //         __sync;
+        //     }
+        // }
+        // APIC::InterruptCommandRegisterLow icr;
+        // icr.Vector = CPU::x86::IRQ29;
+        // icr.Level = APIC::APICLevel::Assert;
+        // icr.DestinationShorthand = APIC::APICDestinationShorthand::AllExcludingSelf;
+        // ((APIC::APIC *)Interrupts::apic[0])->IPI(0, icr);
+        // CPU::Interrupts(CPU::Enable);
+        __sync;
+        CPU::Interrupts(CPU::Disable);
+        // }
+#elif defined(aa64)
+#endif
+    }
+
+    SafeFunction void Handle(void *Data)
+    {
+        // TODO: SUPPORT SMP
+        CPU::Interrupts(CPU::Disable);
+        SBIdx = 255;
+        CHArchTrapFrame *Frame = (CHArchTrapFrame *)Data;
+#if defined(a64)
+        debug("-----------------------------------------------------------------------------------");
+        error("Exception: %#llx", Frame->InterruptNumber);
+        for (size_t i = 0; i < INT_FRAMES_MAX; i++)
+            EHIntFrames[i] = Interrupts::InterruptFrames[i];
+        PageFaultAddress = CPU::x64::readcr2().PFLA;
+
+        if (Frame->cs != GDT_USER_CODE && Frame->cs != GDT_USER_DATA)
+        {
+            if (PageFaultAddress)
+            {
+                debug("Exception in kernel mode (ip: %#lx cr2: %#lx (%s))",
+                      Frame->rip, PageFaultAddress, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress(Frame->rip) : "No symbol");
+            }
+            else
+            {
+                debug("Exception in kernel mode (ip: %#lx (%s))",
+                      Frame->rip, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress(Frame->rip) : "No symbol");
+            }
+
+            CPUData *data = GetCurrentCPU();
+            if (data)
+            {
+                if (data->CurrentThread)
+                {
+                    if (!data->CurrentThread->Security.IsCritical)
+                    {
+                        fixme("Exception in non-critical thread (kernel mode)");
+                    }
+                }
+            }
+
+            if (TaskManager)
+                TaskManager->Panic();
+            ForceUnlock = true;
+            Display->CreateBuffer(0, 0, SBIdx);
+            StopAllCores();
+        }
+        else
+        {
+            if (PageFaultAddress)
+            {
+                debug("Exception in user mode (ip: %#lx cr2: %#lx (%s))",
+                      Frame->rip, PageFaultAddress, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress(Frame->rip) : "No symbol");
+            }
+            else
+            {
+                debug("Exception in user mode (ip: %#lx (%s))",
+                      Frame->rip, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress(Frame->rip) : "No symbol");
+            }
+            CPUData *data = GetCurrentCPU();
+            if (!data)
+            {
+                ForceUnlock = true;
+                Display->CreateBuffer(0, 0, SBIdx);
+                StopAllCores();
+                EHPrint("\eFF0000Cannot get CPU data! This results in a kernel crash!");
+                error("Cannot get CPU data! This results in a kernel crash!");
+                error("This should never happen!");
+            }
+            else
+            {
+                debug("CPU %ld data is valid", data->ID);
+                if (data->CurrentThread->Security.IsCritical)
+                {
+                    debug("Critical thread \"%s\"(%d) died", data->CurrentThread->Name, data->CurrentThread->ID);
+                    if (TaskManager)
+                        TaskManager->Panic();
+                    ForceUnlock = true;
+                    Display->CreateBuffer(0, 0, SBIdx);
+                    StopAllCores();
+                }
+                else
+                {
+                    debug("Current thread is valid %#lx", data->CurrentThread);
+                    UserModeExceptionHandler(Frame);
+                    return;
+                }
+            }
+        }
+
+        if (ExceptionOccurred)
+        {
+            SBIdx = 255;
+            Display->ClearBuffer(SBIdx);
+            Display->SetBufferCursor(SBIdx, 0, 0);
+
+            CPU::x64::CR0 cr0 = CPU::x64::readcr0();
+            CPU::x64::CR2 cr2 = CPU::x64::CR2{.PFLA = PageFaultAddress};
+            CPU::x64::CR3 cr3 = CPU::x64::readcr3();
+            CPU::x64::CR4 cr4 = CPU::x64::readcr4();
+            CPU::x64::CR8 cr8 = CPU::x64::readcr8();
+            CPU::x64::EFER efer;
+            efer.raw = CPU::x64::rdmsr(CPU::x64::MSR_EFER);
+            uintptr_t ds;
+            asmv("mov %%ds, %0"
+                 : "=r"(ds));
+
+            EHPrint("\eFF2525FS=%#llx  GS=%#llx  SS=%#llx  CS=%#llx  DS=%#llx\n",
+                    CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE), CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE),
+                    Frame->ss, Frame->cs, ds);
+            EHPrint("R8=%#llx  R9=%#llx  R10=%#llx  R11=%#llx\n", Frame->r8, Frame->r9, Frame->r10, Frame->r11);
+            EHPrint("R12=%#llx  R13=%#llx  R14=%#llx  R15=%#llx\n", Frame->r12, Frame->r13, Frame->r14, Frame->r15);
+            EHPrint("RAX=%#llx  RBX=%#llx  RCX=%#llx  RDX=%#llx\n", Frame->rax, Frame->rbx, Frame->rcx, Frame->rdx);
+            EHPrint("RSI=%#llx  RDI=%#llx  RBP=%#llx  RSP=%#llx\n", Frame->rsi, Frame->rdi, Frame->rbp, Frame->rsp);
+            EHPrint("RIP=%#llx  RFL=%#llx  INT=%#llx  ERR=%#llx  EFER=%#llx\n", Frame->rip, Frame->rflags.raw, Frame->InterruptNumber, Frame->ErrorCode, efer.raw);
+            EHPrint("CR0=%#llx  CR2=%#llx  CR3=%#llx  CR4=%#llx  CR8=%#llx\n", cr0.raw, cr2.raw, cr3.raw, cr4.raw, cr8.raw);
+            EHPrint("CR0: PE:%s     MP:%s     EM:%s     TS:%s\n     ET:%s     NE:%s     WP:%s     AM:%s\n     NW:%s     CD:%s     PG:%s\n     R0:%#x R1:%#x R2:%#x\n",
+                    cr0.PE ? "True " : "False", cr0.MP ? "True " : "False", cr0.EM ? "True " : "False", cr0.TS ? "True " : "False",
+                    cr0.ET ? "True " : "False", cr0.NE ? "True " : "False", cr0.WP ? "True " : "False", cr0.AM ? "True " : "False",
+                    cr0.NW ? "True " : "False", cr0.CD ? "True " : "False", cr0.PG ? "True " : "False",
+                    cr0.Reserved0, cr0.Reserved1, cr0.Reserved2);
+            EHPrint("CR2: PFLA: %#llx\n",
+                    cr2.PFLA);
+            EHPrint("CR3: PWT:%s     PCD:%s    PDBR:%#llx\n",
+                    cr3.PWT ? "True " : "False", cr3.PCD ? "True " : "False", cr3.PDBR);
+            EHPrint("CR4: VME:%s     PVI:%s     TSD:%s      DE:%s\n     PSE:%s     PAE:%s     MCE:%s     PGE:%s\n     PCE:%s    UMIP:%s  OSFXSR:%s OSXMMEXCPT:%s\n    LA57:%s    VMXE:%s    SMXE:%s   PCIDE:%s\n OSXSAVE:%s    SMEP:%s    SMAP:%s     PKE:%s\n     R0:%#x R1:%#x R2:%#x\n",
+                    cr4.VME ? "True " : "False", cr4.PVI ? "True " : "False", cr4.TSD ? "True " : "False", cr4.DE ? "True " : "False",
+                    cr4.PSE ? "True " : "False", cr4.PAE ? "True " : "False", cr4.MCE ? "True " : "False", cr4.PGE ? "True " : "False",
+                    cr4.PCE ? "True " : "False", cr4.UMIP ? "True " : "False", cr4.OSFXSR ? "True " : "False", cr4.OSXMMEXCPT ? "True " : "False",
+                    cr4.LA57 ? "True " : "False", cr4.VMXE ? "True " : "False", cr4.SMXE ? "True " : "False", cr4.PCIDE ? "True " : "False",
+                    cr4.OSXSAVE ? "True " : "False", cr4.SMEP ? "True " : "False", cr4.SMAP ? "True " : "False", cr4.PKE ? "True " : "False",
+                    cr4.Reserved0, cr4.Reserved1, cr4.Reserved2);
+            EHPrint("CR8: TPL:%d\n", cr8.TPL);
+            EHPrint("RFL: CF:%s     PF:%s     AF:%s     ZF:%s\n     SF:%s     TF:%s     IF:%s     DF:%s\n     OF:%s   IOPL:%s     NT:%s     RF:%s\n     VM:%s     AC:%s    VIF:%s    VIP:%s\n     ID:%s     AlwaysOne:%d\n     R0:%#x R1:%#x R2:%#x R3:%#x\n",
+                    Frame->rflags.CF ? "True " : "False", Frame->rflags.PF ? "True " : "False", Frame->rflags.AF ? "True " : "False", Frame->rflags.ZF ? "True " : "False",
+                    Frame->rflags.SF ? "True " : "False", Frame->rflags.TF ? "True " : "False", Frame->rflags.IF ? "True " : "False", Frame->rflags.DF ? "True " : "False",
+                    Frame->rflags.OF ? "True " : "False", Frame->rflags.IOPL ? "True " : "False", Frame->rflags.NT ? "True " : "False", Frame->rflags.RF ? "True " : "False",
+                    Frame->rflags.VM ? "True " : "False", Frame->rflags.AC ? "True " : "False", Frame->rflags.VIF ? "True " : "False", Frame->rflags.VIP ? "True " : "False",
+                    Frame->rflags.ID ? "True " : "False", Frame->rflags.AlwaysOne,
+                    Frame->rflags.Reserved0, Frame->rflags.Reserved1, Frame->rflags.Reserved2, Frame->rflags.Reserved3);
+            EHPrint("EFER: SCE:%s      LME:%s      LMA:%s      NXE:%s\n     SVME:%s    LMSLE:%s    FFXSR:%s      TCE:%s\n     R0:%#x R1:%#x R2:%#x\n",
+                    efer.SCE ? "True " : "False", efer.LME ? "True " : "False", efer.LMA ? "True " : "False", efer.NXE ? "True " : "False",
+                    efer.SVME ? "True " : "False", efer.LMSLE ? "True " : "False", efer.FFXSR ? "True " : "False", efer.TCE ? "True " : "False",
+                    efer.Reserved0, efer.Reserved1, efer.Reserved2);
+
+            EHPrint("\nException occurred while handling exception! HALTED!");
+            Display->SetBuffer(SBIdx);
+            Interrupts::RemoveAll();
+            CPU::Stop();
+        }
+
+        ExceptionOccurred = true;
+
+        if (DriverManager)
+            DriverManager->Panic();
+
+        debug("Reading control registers...");
+        crashdata.Frame = Frame;
+        crashdata.cr0 = CPU::x64::readcr0();
+        crashdata.cr2 = CPU::x64::CR2{.PFLA = PageFaultAddress};
+        crashdata.cr3 = CPU::x64::readcr3();
+        crashdata.cr4 = CPU::x64::readcr4();
+        crashdata.cr8 = CPU::x64::readcr8();
+        crashdata.efer.raw = CPU::x64::rdmsr(CPU::x64::MSR_EFER);
+        uintptr_t ds;
+        asmv("mov %%ds, %0"
+             : "=r"(ds));
+
+        // Get debug registers
+        asmv("movq %%dr0, %0"
+             : "=r"(crashdata.dr0));
+        asmv("movq %%dr1, %0"
+             : "=r"(crashdata.dr1));
+        asmv("movq %%dr2, %0"
+             : "=r"(crashdata.dr2));
+        asmv("movq %%dr3, %0"
+             : "=r"(crashdata.dr3));
+        asmv("movq %%dr6, %0"
+             : "=r"(crashdata.dr6));
+        asmv("movq %%dr7, %0"
+             : "=r"(crashdata.dr7));
+
+        CPUData *cpudata = GetCurrentCPU();
+
+        if (cpudata == nullptr)
+        {
+            EHPrint("\eFFA500Invalid CPU data!\n");
+            for (long i = 0; i < MAX_CPU; i++)
+            {
+                cpudata = GetCPU(i);
+                if (cpudata != nullptr)
+                    break;
+                if (i == MAX_CPU - 1)
+                {
+                    EHPrint("\eFF0000No CPU data found!\n");
+                    cpudata = nullptr;
+                }
+            }
+            debug("CPU ptr %#lx", cpudata);
+        }
+
+        if (cpudata != nullptr)
+        {
+            crashdata.ID = cpudata->ID;
+            crashdata.CPUData = cpudata;
+            error("Technical Informations on CPU %lld:", cpudata->ID);
+        }
+
+        if (TaskManager && cpudata != nullptr)
+        {
+            crashdata.Process = cpudata->CurrentProcess.load();
+            crashdata.Thread = cpudata->CurrentThread.load();
+
+            error("Current Process: %s(%ld)",
+                  cpudata->CurrentProcess->Name,
+                  cpudata->CurrentProcess->ID);
+            error("Current Thread: %s(%ld)",
+                  cpudata->CurrentThread->Name,
+                  cpudata->CurrentThread->ID);
+        }
+
+        {
+            error("FS=%#llx  GS=%#llx  SS=%#llx  CS=%#llx  DS=%#llx",
+                  CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE), CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE),
+                  Frame->ss, Frame->cs, ds);
+            error("R8=%#llx  R9=%#llx  R10=%#llx  R11=%#llx", Frame->r8, Frame->r9, Frame->r10, Frame->r11);
+            error("R12=%#llx  R13=%#llx  R14=%#llx  R15=%#llx", Frame->r12, Frame->r13, Frame->r14, Frame->r15);
+            error("RAX=%#llx  RBX=%#llx  RCX=%#llx  RDX=%#llx", Frame->rax, Frame->rbx, Frame->rcx, Frame->rdx);
+            error("RSI=%#llx  RDI=%#llx  RBP=%#llx  RSP=%#llx", Frame->rsi, Frame->rdi, Frame->rbp, Frame->rsp);
+            error("RIP=%#llx  RFL=%#llx  INT=%#llx  ERR=%#llx  EFER=%#llx", Frame->rip, Frame->rflags.raw, Frame->InterruptNumber, Frame->ErrorCode, crashdata.efer.raw);
+            error("CR0=%#llx  CR2=%#llx  CR3=%#llx  CR4=%#llx  CR8=%#llx", crashdata.cr0.raw, crashdata.cr2.raw, crashdata.cr3.raw, crashdata.cr4.raw, crashdata.cr8.raw);
+            error("DR0=%#llx  DR1=%#llx  DR2=%#llx  DR3=%#llx  DR6=%#llx  DR7=%#llx", crashdata.dr0, crashdata.dr1, crashdata.dr2, crashdata.dr3, crashdata.dr6, crashdata.dr7.raw);
+
+            error("CR0: PE:%s     MP:%s     EM:%s     TS:%s     ET:%s     NE:%s     WP:%s     AM:%s     NW:%s     CD:%s     PG:%s     R0:%#x R1:%#x R2:%#x",
+                  crashdata.cr0.PE ? "True " : "False", crashdata.cr0.MP ? "True " : "False", crashdata.cr0.EM ? "True " : "False", crashdata.cr0.TS ? "True " : "False",
+                  crashdata.cr0.ET ? "True " : "False", crashdata.cr0.NE ? "True " : "False", crashdata.cr0.WP ? "True " : "False", crashdata.cr0.AM ? "True " : "False",
+                  crashdata.cr0.NW ? "True " : "False", crashdata.cr0.CD ? "True " : "False", crashdata.cr0.PG ? "True " : "False",
+                  crashdata.cr0.Reserved0, crashdata.cr0.Reserved1, crashdata.cr0.Reserved2);
+
+            error("CR2: PFLA: %#llx",
+                  crashdata.cr2.PFLA);
+
+            error("CR3: PWT:%s     PCD:%s    PDBR:%#llx",
+                  crashdata.cr3.PWT ? "True " : "False", crashdata.cr3.PCD ? "True " : "False", crashdata.cr3.PDBR);
+
+            error("CR4: VME:%s     PVI:%s     TSD:%s      DE:%s     PSE:%s     PAE:%s     MCE:%s     PGE:%s     PCE:%s    UMIP:%s  OSFXSR:%s OSXMMEXCPT:%s    LA57:%s    VMXE:%s    SMXE:%s   PCIDE:%s OSXSAVE:%s    SMEP:%s    SMAP:%s     PKE:%s     R0:%#x R1:%#x R2:%#x",
+                  crashdata.cr4.VME ? "True " : "False", crashdata.cr4.PVI ? "True " : "False", crashdata.cr4.TSD ? "True " : "False", crashdata.cr4.DE ? "True " : "False",
+                  crashdata.cr4.PSE ? "True " : "False", crashdata.cr4.PAE ? "True " : "False", crashdata.cr4.MCE ? "True " : "False", crashdata.cr4.PGE ? "True " : "False",
+                  crashdata.cr4.PCE ? "True " : "False", crashdata.cr4.UMIP ? "True " : "False", crashdata.cr4.OSFXSR ? "True " : "False", crashdata.cr4.OSXMMEXCPT ? "True " : "False",
+                  crashdata.cr4.LA57 ? "True " : "False", crashdata.cr4.VMXE ? "True " : "False", crashdata.cr4.SMXE ? "True " : "False", crashdata.cr4.PCIDE ? "True " : "False",
+                  crashdata.cr4.OSXSAVE ? "True " : "False", crashdata.cr4.SMEP ? "True " : "False", crashdata.cr4.SMAP ? "True " : "False", crashdata.cr4.PKE ? "True " : "False",
+                  crashdata.cr4.Reserved0, crashdata.cr4.Reserved1, crashdata.cr4.Reserved2);
+
+            error("CR8: TPL:%d", crashdata.cr8.TPL);
+
+            error("RFL: CF:%s     PF:%s     AF:%s     ZF:%s     SF:%s     TF:%s     IF:%s     DF:%s     OF:%s   IOPL:%s     NT:%s     RF:%s     VM:%s     AC:%s    VIF:%s    VIP:%s     ID:%s     AlwaysOne:%d     R0:%#x R1:%#x R2:%#x R3:%#x",
+                  Frame->rflags.CF ? "True " : "False", Frame->rflags.PF ? "True " : "False", Frame->rflags.AF ? "True " : "False", Frame->rflags.ZF ? "True " : "False",
+                  Frame->rflags.SF ? "True " : "False", Frame->rflags.TF ? "True " : "False", Frame->rflags.IF ? "True " : "False", Frame->rflags.DF ? "True " : "False",
+                  Frame->rflags.OF ? "True " : "False", Frame->rflags.IOPL ? "True " : "False", Frame->rflags.NT ? "True " : "False", Frame->rflags.RF ? "True " : "False",
+                  Frame->rflags.VM ? "True " : "False", Frame->rflags.AC ? "True " : "False", Frame->rflags.VIF ? "True " : "False", Frame->rflags.VIP ? "True " : "False",
+                  Frame->rflags.ID ? "True " : "False", Frame->rflags.AlwaysOne,
+                  Frame->rflags.Reserved0, Frame->rflags.Reserved1, Frame->rflags.Reserved2, Frame->rflags.Reserved3);
+
+            error("DR7: LDR0:%s     GDR0:%s     LDR1:%s     GDR1:%s     LDR2:%s     GDR2:%s     LDR3:%s     GDR3:%s     CDR0:%s     SDR0:%s     CDR1:%s     SDR1:%s     CDR2:%s     SDR2:%s     CDR3:%s     SDR3:%s     R:%#x",
+                  crashdata.dr7.LocalDR0 ? "True " : "False", crashdata.dr7.GlobalDR0 ? "True " : "False", crashdata.dr7.LocalDR1 ? "True " : "False", crashdata.dr7.GlobalDR1 ? "True " : "False",
+                  crashdata.dr7.LocalDR2 ? "True " : "False", crashdata.dr7.GlobalDR2 ? "True " : "False", crashdata.dr7.LocalDR3 ? "True " : "False", crashdata.dr7.GlobalDR3 ? "True " : "False",
+                  crashdata.dr7.ConditionsDR0 ? "True " : "False", crashdata.dr7.SizeDR0 ? "True " : "False", crashdata.dr7.ConditionsDR1 ? "True " : "False", crashdata.dr7.SizeDR1 ? "True " : "False",
+                  crashdata.dr7.ConditionsDR2 ? "True " : "False", crashdata.dr7.SizeDR2 ? "True " : "False", crashdata.dr7.ConditionsDR3 ? "True " : "False", crashdata.dr7.SizeDR3 ? "True " : "False",
+                  crashdata.dr7.Reserved);
+
+            error("EFER: SCE:%s      LME:%s      LMA:%s      NXE:%s     SVME:%s    LMSLE:%s    FFXSR:%s      TCE:%s     R0:%#x R1:%#x R2:%#x",
+                  crashdata.efer.SCE ? "True " : "False", crashdata.efer.LME ? "True " : "False", crashdata.efer.LMA ? "True " : "False", crashdata.efer.NXE ? "True " : "False",
+                  crashdata.efer.SVME ? "True " : "False", crashdata.efer.LMSLE ? "True " : "False", crashdata.efer.FFXSR ? "True " : "False", crashdata.efer.TCE ? "True " : "False",
+                  crashdata.efer.Reserved0, crashdata.efer.Reserved1, crashdata.efer.Reserved2);
+        }
+        goto CrashEnd;
+
+#elif defined(a32)
+        goto CrashEnd;
+#elif defined(aa64)
+        goto CrashEnd;
+#endif
+
+    CrashEnd:
+        if (Config.InterruptsOnCrash)
+        {
+            // 255 // Main
+            Display->CreateBuffer(0, 0, 254); // Details
+            Display->CreateBuffer(0, 0, 253); // Frames
+            Display->CreateBuffer(0, 0, 252); // Tasks
+            Display->CreateBuffer(0, 0, 251); // Console
+            Display->CreateBuffer(0, 0, 250); // Empty
+
+            DisplayTopOverlay();
+            DisplayMainScreen(crashdata);
+            DisplayBottomOverlay();
+            Display->SetBuffer(255);
+            debug("Interrupts are enabled, waiting for user input");
+            CPU::Interrupts(CPU::Enable);
+            HookKeyboard();
+        }
+        else
+        {
+            /*
+            TODO: Stuff that should be done when IOC is disabled.
+            */
+            Display->SetBuffer(255);
+        }
+
+        CPU::Halt(true);
+    }
+}
diff --git a/Kernel/Core/Crash/KBDrv.cpp b/Kernel/Core/Crash/KBDrv.cpp
new file mode 100644
index 00000000..19a1e62f
--- /dev/null
+++ b/Kernel/Core/Crash/KBDrv.cpp
@@ -0,0 +1,194 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../crashhandler.hpp"
+#include "chfcts.hpp"
+
+#include <display.hpp>
+#include <convert.h>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+#include <io.h>
+
+#if defined(a64)
+#include "../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+const char sc_ascii_low[] = {'?', '?', '1', '2', '3', '4', '5', '6',
+                             '7', '8', '9', '0', '-', '=', '?', '?', 'q', 'w', 'e', 'r', 't', 'y',
+                             'u', 'i', 'o', 'p', '[', ']', '?', '?', 'a', 's', 'd', 'f', 'g',
+                             'h', 'j', 'k', 'l', ';', '\'', '`', '?', '\\', 'z', 'x', 'c', 'v',
+                             'b', 'n', 'm', ',', '.', '/', '?', '?', '?', ' '};
+
+const char sc_ascii_high[] = {'?', '?', '!', '@', '#', '$', '%', '^',
+                              '&', '*', '(', ')', '_', '+', '?', '?', 'Q', 'W', 'E', 'R', 'T', 'Y',
+                              'U', 'I', 'O', 'P', '{', '}', '?', '?', 'A', 'S', 'D', 'F', 'G',
+                              'H', 'J', 'K', 'L', ';', '\"', '~', '?', '|', 'Z', 'X', 'C', 'V',
+                              'B', 'N', 'M', '<', '>', '?', '?', '?', '?', ' '};
+
+static int LowerCase = true;
+
+static inline int GetLetterFromScanCode(uint8_t ScanCode)
+{
+    if (ScanCode & 0x80)
+    {
+        switch (ScanCode)
+        {
+        case KEY_U_LSHIFT:
+            LowerCase = true;
+            return KEY_INVALID;
+        case KEY_U_RSHIFT:
+            LowerCase = true;
+            return KEY_INVALID;
+        default:
+            return KEY_INVALID;
+        }
+    }
+    else
+    {
+        switch (ScanCode)
+        {
+        case KEY_D_RETURN:
+            return '\n';
+        case KEY_D_LSHIFT:
+            LowerCase = false;
+            return KEY_INVALID;
+        case KEY_D_RSHIFT:
+            LowerCase = false;
+            return KEY_INVALID;
+        case KEY_D_BACKSPACE:
+            return ScanCode;
+        default:
+        {
+            if (ScanCode > 0x39)
+                break;
+            if (LowerCase)
+                return sc_ascii_low[ScanCode];
+            else
+                return sc_ascii_high[ScanCode];
+        }
+        }
+    }
+    return KEY_INVALID;
+}
+
+namespace CrashHandler
+{
+    CrashKeyboardDriver::CrashKeyboardDriver() : Interrupts::Handler(1) /* IRQ1 */
+    {
+#if defined(a86)
+        while (inb(0x64) & 0x1)
+            inb(0x60);
+
+        outb(0x64, 0xAE);
+        outb(0x64, 0x20);
+        uint8_t ret = (inb(0x60) | 1) & ~0x10;
+        outb(0x64, 0x60);
+        outb(0x60, ret);
+        outb(0x60, 0xF4);
+
+        outb(0x21, 0xFD);
+        outb(0xA1, 0xFF);
+#endif // defined(a86)
+
+        CPU::Interrupts(CPU::Enable); // Just to be sure.
+    }
+
+    CrashKeyboardDriver::~CrashKeyboardDriver()
+    {
+        error("CrashKeyboardDriver::~CrashKeyboardDriver() called!");
+    }
+
+    int BackSpaceLimit = 0;
+    static char UserInputBuffer[1024];
+
+#if defined(a64)
+    SafeFunction void CrashKeyboardDriver::OnInterruptReceived(CPU::x64::TrapFrame *Frame)
+#elif defined(a32)
+    SafeFunction void CrashKeyboardDriver::OnInterruptReceived(CPU::x32::TrapFrame *Frame)
+#elif defined(aa64)
+    SafeFunction void CrashKeyboardDriver::OnInterruptReceived(CPU::aarch64::TrapFrame *Frame)
+#endif
+    {
+#if defined(a86)
+        UNUSED(Frame);
+        uint8_t scanCode = inb(0x60);
+        if (scanCode == KEY_D_TAB ||
+            scanCode == KEY_D_LCTRL ||
+            scanCode == KEY_D_LALT ||
+            scanCode == KEY_U_LCTRL ||
+            scanCode == KEY_U_LALT)
+            return;
+
+        switch (scanCode)
+        {
+        case KEY_D_UP:
+        case KEY_D_LEFT:
+        case KEY_D_RIGHT:
+        case KEY_D_DOWN:
+            ArrowInput(scanCode);
+            break;
+        default:
+            break;
+        }
+
+        int key = GetLetterFromScanCode(scanCode);
+        if (key != KEY_INVALID)
+        {
+            if (key == KEY_D_BACKSPACE)
+            {
+                if (BackSpaceLimit > 0)
+                {
+                    Display->Print('\b', SBIdx);
+                    backspace(UserInputBuffer);
+                    BackSpaceLimit--;
+                }
+            }
+            else if (key == '\n')
+            {
+                UserInput(UserInputBuffer);
+                BackSpaceLimit = 0;
+                UserInputBuffer[0] = '\0';
+            }
+            else
+            {
+                append(UserInputBuffer, s_cst(char, key));
+                Display->Print((char)key, SBIdx);
+                BackSpaceLimit++;
+            }
+            Display->SetBuffer(SBIdx); // Update as we type.
+        }
+#endif // a64 || a32
+    }
+
+    SafeFunction void HookKeyboard()
+    {
+        CrashKeyboardDriver kbd; // We don't want to allocate memory.
+#if defined(a86)
+        asmv("KeyboardHookLoop: nop; jmp KeyboardHookLoop;");
+#elif defined(aa64)
+        asmv("KeyboardHookLoop: nop; b KeyboardHookLoop;");
+#endif
+        // CPU::Halt(true); // This is an infinite loop.
+    }
+}
diff --git a/Kernel/Core/Crash/SFrame.cpp b/Kernel/Core/Crash/SFrame.cpp
new file mode 100644
index 00000000..026177f4
--- /dev/null
+++ b/Kernel/Core/Crash/SFrame.cpp
@@ -0,0 +1,148 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../crashhandler.hpp"
+#include "chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+namespace CrashHandler
+{
+    struct StackFrame
+    {
+        struct StackFrame *rbp;
+        uintptr_t rip;
+    };
+
+    SafeFunction void TraceFrames(CRData data, int Count, SymbolResolver::Symbols *SymHandle, bool Kernel)
+    {
+        if (!Memory::Virtual().Check(data.Frame))
+        {
+            EHPrint("Invalid frame pointer: %p\n", data.Frame);
+            return;
+        }
+
+        if (!Memory::Virtual().Check(SymHandle))
+        {
+            EHPrint("Invalid symbol handle: %p\n", SymHandle);
+            return;
+        }
+
+        bool TriedRetryBP = false;
+        struct StackFrame *frames = nullptr;
+    RetryBP:
+#if defined(a64)
+        if (TriedRetryBP == false)
+            frames = (struct StackFrame *)data.Frame->rbp;
+#elif defined(a32)
+        if (TriedRetryBP == false)
+            frames = (struct StackFrame *)data.Frame->ebp;
+#elif defined(aa64)
+#endif
+        if (!Memory::Virtual().Check((void *)frames))
+        {
+            if (TriedRetryBP == false)
+            {
+                frames = (struct StackFrame *)Memory::Virtual(data.Process->PageTable).GetPhysical((void *)frames);
+                TriedRetryBP = true;
+                goto RetryBP;
+            }
+#if defined(a64)
+            EHPrint("Invalid rbp pointer: %p\n", data.Frame->rbp);
+#elif defined(a32)
+            EHPrint("Invalid ebp pointer: %p\n", data.Frame->ebp);
+#elif defined(aa64)
+#endif
+            return;
+        }
+
+        debug("\nStack tracing... %p %d %p %d", data.Frame, Count, frames, Kernel);
+        EHPrint("\e7981FC\nStack Trace:\n");
+        if (!frames || !frames->rip || !frames->rbp)
+        {
+#if defined(a64)
+            EHPrint("\e2565CC%p", (void *)data.Frame->rip);
+#elif defined(a32)
+            EHPrint("\e2565CC%p", (void *)data.Frame->eip);
+#elif defined(aa64)
+#endif
+            EHPrint("\e7925CC-");
+#if defined(a64)
+            EHPrint("\eAA25CC%s", SymHandle->GetSymbolFromAddress(data.Frame->rip));
+#elif defined(a32)
+            EHPrint("\eAA25CC%s", SymHandle->GetSymbolFromAddress(data.Frame->eip));
+#elif defined(aa64)
+#endif
+            EHPrint("\e7981FC <- Exception");
+            EHPrint("\eFF0000\n< No stack trace available. >\n");
+        }
+        else
+        {
+#if defined(a64)
+            EHPrint("\e2565CC%p", (void *)data.Frame->rip);
+            EHPrint("\e7925CC-");
+            if ((data.Frame->rip >= 0xFFFFFFFF80000000 && data.Frame->rip <= (uintptr_t)&_kernel_end) || !Kernel)
+                EHPrint("\eAA25CC%s", SymHandle->GetSymbolFromAddress(data.Frame->rip));
+            else
+                EHPrint("Outside Kernel");
+#elif defined(a32)
+            EHPrint("\e2565CC%p", (void *)data.Frame->eip);
+            EHPrint("\e7925CC-");
+            if ((data.Frame->eip >= 0xC0000000 && data.Frame->eip <= (uintptr_t)&_kernel_end) || !Kernel)
+                EHPrint("\eAA25CC%s", SymHandle->GetSymbolFromAddress(data.Frame->eip));
+            else
+                EHPrint("Outside Kernel");
+#elif defined(aa64)
+#endif
+            EHPrint("\e7981FC <- Exception");
+            for (int frame = 0; frame < Count; ++frame)
+            {
+                if (!frames->rip)
+                    break;
+                EHPrint("\n\e2565CC%p", (void *)frames->rip);
+                EHPrint("\e7925CC-");
+#if defined(a64)
+                if ((frames->rip >= 0xFFFFFFFF80000000 && frames->rip <= (uintptr_t)&_kernel_end) || !Kernel)
+#elif defined(a32)
+                if ((frames->rip >= 0xC0000000 && frames->rip <= (uintptr_t)&_kernel_end) || !Kernel)
+#elif defined(aa64)
+                if ((frames->rip >= 0xFFFFFFFF80000000 && frames->rip <= (uintptr_t)&_kernel_end) || !Kernel)
+#endif
+                    EHPrint("\e25CCC9%s", SymHandle->GetSymbolFromAddress(frames->rip));
+                else
+                    EHPrint("\eFF4CA9Outside Kernel");
+
+                if (!Memory::Virtual().Check(frames->rbp))
+                    return;
+                frames = frames->rbp;
+            }
+        }
+        EHPrint("\n");
+    }
+}
diff --git a/Kernel/Core/Crash/Screens/Console.cpp b/Kernel/Core/Crash/Screens/Console.cpp
new file mode 100644
index 00000000..44da0909
--- /dev/null
+++ b/Kernel/Core/Crash/Screens/Console.cpp
@@ -0,0 +1,42 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../crashhandler.hpp"
+#include "../chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../../kernel.h"
+
+namespace CrashHandler
+{
+    SafeFunction void DisplayConsoleScreen(CRData data)
+    {
+        EHPrint("TODO");
+        UNUSED(data);
+    }
+}
\ No newline at end of file
diff --git a/Kernel/Core/Crash/Screens/Details.cpp b/Kernel/Core/Crash/Screens/Details.cpp
new file mode 100644
index 00000000..f23e97db
--- /dev/null
+++ b/Kernel/Core/Crash/Screens/Details.cpp
@@ -0,0 +1,267 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../crashhandler.hpp"
+#include "../chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../../kernel.h"
+
+namespace CrashHandler
+{
+    SafeFunction void DisplayDetailsScreen(CRData data)
+    {
+        if (data.Process)
+            EHPrint("\e7981FCCurrent Process: %s(%ld)\n",
+                    data.Process->Name,
+                    data.Process->ID);
+        if (data.Thread)
+            EHPrint("\e7981FCCurrent Thread: %s(%ld)\n",
+                    data.Thread->Name,
+                    data.Thread->ID);
+        EHPrint("\e7981FCTechnical Informations on CPU %lld:\n", data.ID);
+        uintptr_t ds;
+#if defined(a64)
+
+        CPUData *cpu = (CPUData *)data.CPUData;
+        if (cpu)
+        {
+            EHPrint("\eE46CEBCPU Data Address: %#lx\n", cpu);
+            EHPrint("Syscalls Stack: %#lx, TempStack: %#lx\n", cpu->SystemCallStack, cpu->TempStack);
+            EHPrint("Core Stack: %#lx, Core ID: %ld, Error Code: %ld\n", cpu->Stack, cpu->ID, cpu->ErrorCode);
+            EHPrint("Is Active: %s\n", cpu->IsActive ? "true" : "false");
+            EHPrint("Current Process: %#lx, Current Thread: %#lx\n", cpu->CurrentProcess, cpu->CurrentThread);
+            EHPrint("Arch Specific Data: %#lx\n", cpu->Data);
+            EHPrint("Checksum: 0x%X\n", cpu->Checksum);
+        }
+
+        asmv("mov %%ds, %0"
+             : "=r"(ds));
+#elif defined(a32)
+        asmv("mov %%ds, %0"
+             : "=r"(ds));
+#elif defined(aa64)
+#endif
+
+#if defined(a64)
+        EHPrint("\e7981FCFS=%#llx  GS=%#llx  SS=%#llx  CS=%#llx  DS=%#llx\n",
+                CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE), CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE),
+                data.Frame->ss, data.Frame->cs, ds);
+        EHPrint("R8=%#llx  R9=%#llx  R10=%#llx  R11=%#llx\n", data.Frame->r8, data.Frame->r9, data.Frame->r10, data.Frame->r11);
+        EHPrint("R12=%#llx  R13=%#llx  R14=%#llx  R15=%#llx\n", data.Frame->r12, data.Frame->r13, data.Frame->r14, data.Frame->r15);
+        EHPrint("RAX=%#llx  RBX=%#llx  RCX=%#llx  RDX=%#llx\n", data.Frame->rax, data.Frame->rbx, data.Frame->rcx, data.Frame->rdx);
+        EHPrint("RSI=%#llx  RDI=%#llx  RBP=%#llx  RSP=%#llx\n", data.Frame->rsi, data.Frame->rdi, data.Frame->rbp, data.Frame->rsp);
+        EHPrint("RIP=%#llx  RFL=%#llx  INT=%#llx  ERR=%#llx  EFER=%#llx\n", data.Frame->rip, data.Frame->rflags.raw, data.Frame->InterruptNumber, data.Frame->ErrorCode, data.efer.raw);
+#elif defined(a32)
+        EHPrint("\e7981FCFS=%#llx  GS=%#llx  SS=%#llx  CS=%#llx  DS=%#llx\n",
+                CPU::x32::rdmsr(CPU::x32::MSR_FS_BASE), CPU::x32::rdmsr(CPU::x32::MSR_GS_BASE),
+                data.Frame->ss, data.Frame->cs, ds);
+        EHPrint("EAX=%#llx  EBX=%#llx  ECX=%#llx  EDX=%#llx\n", data.Frame->eax, data.Frame->ebx, data.Frame->ecx, data.Frame->edx);
+        EHPrint("ESI=%#llx  EDI=%#llx  EBP=%#llx  ESP=%#llx\n", data.Frame->esi, data.Frame->edi, data.Frame->ebp, data.Frame->esp);
+        EHPrint("EIP=%#llx  EFL=%#llx  INT=%#llx  ERR=%#llx  EFER=%#llx\n", data.Frame->eip, data.Frame->eflags.raw, data.Frame->InterruptNumber, data.Frame->ErrorCode, data.efer.raw);
+#elif defined(aa64)
+#endif
+
+#if defined(a86)
+        EHPrint("CR0=%#llx  CR2=%#llx  CR3=%#llx  CR4=%#llx  CR8=%#llx\n", data.cr0.raw, data.cr2.raw, data.cr3.raw, data.cr4.raw, data.cr8.raw);
+        EHPrint("DR0=%#llx  DR1=%#llx  DR2=%#llx  DR3=%#llx  DR6=%#llx  DR7=%#llx\n", data.dr0, data.dr1, data.dr2, data.dr3, data.dr6, data.dr7.raw);
+
+        EHPrint("\eFC797BCR0: PE:%s     MP:%s     EM:%s     TS:%s\n     ET:%s     NE:%s     WP:%s     AM:%s\n     NW:%s     CD:%s     PG:%s\n     R0:%#x R1:%#x R2:%#x\n",
+                data.cr0.PE ? "True " : "False", data.cr0.MP ? "True " : "False", data.cr0.EM ? "True " : "False", data.cr0.TS ? "True " : "False",
+                data.cr0.ET ? "True " : "False", data.cr0.NE ? "True " : "False", data.cr0.WP ? "True " : "False", data.cr0.AM ? "True " : "False",
+                data.cr0.NW ? "True " : "False", data.cr0.CD ? "True " : "False", data.cr0.PG ? "True " : "False",
+                data.cr0.Reserved0, data.cr0.Reserved1, data.cr0.Reserved2);
+
+        EHPrint("\eFCBD79CR2: PFLA: %#llx\n",
+                data.cr2.PFLA);
+
+        EHPrint("\e79FC84CR3: PWT:%s     PCD:%s    PDBR:%#llx\n",
+                data.cr3.PWT ? "True " : "False", data.cr3.PCD ? "True " : "False", data.cr3.PDBR);
+
+        EHPrint("\eBD79FCCR4: VME:%s     PVI:%s     TSD:%s      DE:%s\n     PSE:%s     PAE:%s     MCE:%s     PGE:%s\n     PCE:%s    UMIP:%s  OSFXSR:%s OSXMMEXCPT:%s\n    LA57:%s    VMXE:%s    SMXE:%s   PCIDE:%s\n OSXSAVE:%s    SMEP:%s    SMAP:%s     PKE:%s\n     R0:%#x R1:%#x R2:%#x\n",
+                data.cr4.VME ? "True " : "False", data.cr4.PVI ? "True " : "False", data.cr4.TSD ? "True " : "False", data.cr4.DE ? "True " : "False",
+                data.cr4.PSE ? "True " : "False", data.cr4.PAE ? "True " : "False", data.cr4.MCE ? "True " : "False", data.cr4.PGE ? "True " : "False",
+                data.cr4.PCE ? "True " : "False", data.cr4.UMIP ? "True " : "False", data.cr4.OSFXSR ? "True " : "False", data.cr4.OSXMMEXCPT ? "True " : "False",
+                data.cr4.LA57 ? "True " : "False", data.cr4.VMXE ? "True " : "False", data.cr4.SMXE ? "True " : "False", data.cr4.PCIDE ? "True " : "False",
+                data.cr4.OSXSAVE ? "True " : "False", data.cr4.SMEP ? "True " : "False", data.cr4.SMAP ? "True " : "False", data.cr4.PKE ? "True " : "False",
+#if defined(a64)
+                data.cr4.Reserved0, data.cr4.Reserved1, data.cr4.Reserved2);
+#elif defined(a32)
+                data.cr4.Reserved0, data.cr4.Reserved1, 0);
+#endif
+        EHPrint("\e79FCF5CR8: TPL:%d\n", data.cr8.TPL);
+#endif // a64 || a32
+
+#if defined(a64)
+        EHPrint("\eFCFC02RFL: CF:%s     PF:%s     AF:%s     ZF:%s\n     SF:%s     TF:%s     IF:%s     DF:%s\n     OF:%s   IOPL:%s     NT:%s     RF:%s\n     VM:%s     AC:%s    VIF:%s    VIP:%s\n     ID:%s     AlwaysOne:%d\n     R0:%#x R1:%#x R2:%#x R3:%#x\n",
+                data.Frame->rflags.CF ? "True " : "False", data.Frame->rflags.PF ? "True " : "False", data.Frame->rflags.AF ? "True " : "False", data.Frame->rflags.ZF ? "True " : "False",
+                data.Frame->rflags.SF ? "True " : "False", data.Frame->rflags.TF ? "True " : "False", data.Frame->rflags.IF ? "True " : "False", data.Frame->rflags.DF ? "True " : "False",
+                data.Frame->rflags.OF ? "True " : "False", data.Frame->rflags.IOPL ? "True " : "False", data.Frame->rflags.NT ? "True " : "False", data.Frame->rflags.RF ? "True " : "False",
+                data.Frame->rflags.VM ? "True " : "False", data.Frame->rflags.AC ? "True " : "False", data.Frame->rflags.VIF ? "True " : "False", data.Frame->rflags.VIP ? "True " : "False",
+                data.Frame->rflags.ID ? "True " : "False", data.Frame->rflags.AlwaysOne,
+                data.Frame->rflags.Reserved0, data.Frame->rflags.Reserved1, data.Frame->rflags.Reserved2, data.Frame->rflags.Reserved3);
+#elif defined(a32)
+        EHPrint("\eFCFC02EFL: CF:%s     PF:%s     AF:%s     ZF:%s\n     SF:%s     TF:%s     IF:%s     DF:%s\n     OF:%s   IOPL:%s     NT:%s     RF:%s\n     VM:%s     AC:%s    VIF:%s    VIP:%s\n     ID:%s     AlwaysOne:%d\n     R0:%#x R1:%#x R2:%#x\n",
+                data.Frame->eflags.CF ? "True " : "False", data.Frame->eflags.PF ? "True " : "False", data.Frame->eflags.AF ? "True " : "False", data.Frame->eflags.ZF ? "True " : "False",
+                data.Frame->eflags.SF ? "True " : "False", data.Frame->eflags.TF ? "True " : "False", data.Frame->eflags.IF ? "True " : "False", data.Frame->eflags.DF ? "True " : "False",
+                data.Frame->eflags.OF ? "True " : "False", data.Frame->eflags.IOPL ? "True " : "False", data.Frame->eflags.NT ? "True " : "False", data.Frame->eflags.RF ? "True " : "False",
+                data.Frame->eflags.VM ? "True " : "False", data.Frame->eflags.AC ? "True " : "False", data.Frame->eflags.VIF ? "True " : "False", data.Frame->eflags.VIP ? "True " : "False",
+                data.Frame->eflags.ID ? "True " : "False", data.Frame->eflags.AlwaysOne,
+                data.Frame->eflags.Reserved0, data.Frame->eflags.Reserved1, data.Frame->eflags.Reserved2);
+#elif defined(aa64)
+#endif
+
+#if defined(a86)
+        EHPrint("\eA0F0F0DR7: LDR0:%s     GDR0:%s     LDR1:%s     GDR1:%s\n     LDR2:%s     GDR2:%s     LDR3:%s     GDR3:%s\n     CDR0:%s     SDR0:%s     CDR1:%s     SDR1:%s\n     CDR2:%s     SDR2:%s     CDR3:%s     SDR3:%s\n     R:%#x\n",
+                data.dr7.LocalDR0 ? "True " : "False", data.dr7.GlobalDR0 ? "True " : "False", data.dr7.LocalDR1 ? "True " : "False", data.dr7.GlobalDR1 ? "True " : "False",
+                data.dr7.LocalDR2 ? "True " : "False", data.dr7.GlobalDR2 ? "True " : "False", data.dr7.LocalDR3 ? "True " : "False", data.dr7.GlobalDR3 ? "True " : "False",
+                data.dr7.ConditionsDR0 ? "True " : "False", data.dr7.SizeDR0 ? "True " : "False", data.dr7.ConditionsDR1 ? "True " : "False", data.dr7.SizeDR1 ? "True " : "False",
+                data.dr7.ConditionsDR2 ? "True " : "False", data.dr7.SizeDR2 ? "True " : "False", data.dr7.ConditionsDR3 ? "True " : "False", data.dr7.SizeDR3 ? "True " : "False",
+                data.dr7.Reserved);
+
+        EHPrint("\e009FF0EFER: SCE:%s      LME:%s      LMA:%s      NXE:%s\n     SVME:%s    LMSLE:%s    FFXSR:%s      TCE:%s\n     R0:%#x R1:%#x R2:%#x\n",
+                data.efer.SCE ? "True " : "False", data.efer.LME ? "True " : "False", data.efer.LMA ? "True " : "False", data.efer.NXE ? "True " : "False",
+                data.efer.SVME ? "True " : "False", data.efer.LMSLE ? "True " : "False", data.efer.FFXSR ? "True " : "False", data.efer.TCE ? "True " : "False",
+                data.efer.Reserved0, data.efer.Reserved1, data.efer.Reserved2);
+#endif
+
+        switch (data.Frame->InterruptNumber)
+        {
+        case CPU::x86::DivideByZero:
+        {
+            DivideByZeroExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::Debug:
+        {
+            DebugExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::NonMaskableInterrupt:
+        {
+            NonMaskableInterruptExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::Breakpoint:
+        {
+            BreakpointExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::Overflow:
+        {
+            OverflowExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::BoundRange:
+        {
+            BoundRangeExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::InvalidOpcode:
+        {
+            InvalidOpcodeExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::DeviceNotAvailable:
+        {
+            DeviceNotAvailableExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::DoubleFault:
+        {
+            DoubleFaultExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::CoprocessorSegmentOverrun:
+        {
+            CoprocessorSegmentOverrunExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::InvalidTSS:
+        {
+            InvalidTSSExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::SegmentNotPresent:
+        {
+            SegmentNotPresentExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::StackSegmentFault:
+        {
+            StackFaultExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::GeneralProtectionFault:
+        {
+            GeneralProtectionExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::PageFault:
+        {
+            PageFaultExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::x87FloatingPoint:
+        {
+            x87FloatingPointExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::AlignmentCheck:
+        {
+            AlignmentCheckExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::MachineCheck:
+        {
+            MachineCheckExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::SIMDFloatingPoint:
+        {
+            SIMDFloatingPointExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::Virtualization:
+        {
+            VirtualizationExceptionHandler(data.Frame);
+            break;
+        }
+        case CPU::x86::Security:
+        {
+            SecurityExceptionHandler(data.Frame);
+            break;
+        }
+        default:
+        {
+            UnknownExceptionHandler(data.Frame);
+            break;
+        }
+        }
+    }
+}
diff --git a/Kernel/Core/Crash/Screens/Main.cpp b/Kernel/Core/Crash/Screens/Main.cpp
new file mode 100644
index 00000000..437324fc
--- /dev/null
+++ b/Kernel/Core/Crash/Screens/Main.cpp
@@ -0,0 +1,390 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../crashhandler.hpp"
+#include "../chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../../kernel.h"
+
+static const char *PagefaultDescriptions[8] = {
+    "Supervisory process tried to read a non-present page entry\n",
+    "Supervisory process tried to read a page and caused a protection fault\n",
+    "Supervisory process tried to write to a non-present page entry\n",
+    "Supervisory process tried to write a page and caused a protection fault\n",
+    "User process tried to read a non-present page entry\n",
+    "User process tried to read a page and caused a protection fault\n",
+    "User process tried to write to a non-present page entry\n",
+    "User process tried to write a page and caused a protection fault\n"};
+
+namespace CrashHandler
+{
+    SafeFunction void DisplayMainScreen(CRData data)
+    {
+        CHArchTrapFrame *Frame = data.Frame;
+
+        /*
+ _______ ___ ___ _______ _______ _______ _______      ______ ______ _______ _______ _______ _______ _____
+|     __|   |   |     __|_     _|    ___|   |   |    |      |   __ \   _   |     __|   |   |    ___|     \
+|__     |\     /|__     | |   | |    ___|       |    |   ---|      <       |__     |       |    ___|  --  |
+|_______| |___| |_______| |___| |_______|__|_|__|    |______|___|__|___|___|_______|___|___|_______|_____/
+        */
+        EHPrint("\eFF5500 _______ ___ ___ _______ _______ _______ _______      ______ ______ _______ _______ _______ _______ _____  \n");
+        EHPrint("|     __|   |   |     __|_     _|    ___|   |   |    |      |   __ \\   _   |     __|   |   |    ___|     \\ \n");
+        EHPrint("|__     |\\     /|__     | |   | |    ___|       |    |   ---|      <       |__     |       |    ___|  --  |\n");
+        EHPrint("|_______| |___| |_______| |___| |_______|__|_|__|    |______|___|__|___|___|_______|___|___|_______|_____/ \n\eFAFAFA");
+
+        switch (Frame->InterruptNumber)
+        {
+        case CPU::x86::DivideByZero:
+        {
+            EHPrint("Exception: Divide By Zero\n");
+            EHPrint("The processor attempted to divide a number by zero.\n");
+            break;
+        }
+        case CPU::x86::Debug:
+        {
+            EHPrint("Exception: Debug\n");
+            EHPrint("A debug exception has occurred.\n");
+            break;
+        }
+        case CPU::x86::NonMaskableInterrupt:
+        {
+            EHPrint("Exception: Non-Maskable Interrupt\n");
+            EHPrint("A non-maskable interrupt was received.\n");
+            break;
+        }
+        case CPU::x86::Breakpoint:
+        {
+            EHPrint("Exception: Breakpoint\n");
+            EHPrint("The processor encountered a breakpoint.\n");
+            break;
+        }
+        case CPU::x86::Overflow:
+        {
+            EHPrint("Exception: Overflow\n");
+            EHPrint("The processor attempted to add a number to a number that was too large.\n");
+            break;
+        }
+        case CPU::x86::BoundRange:
+        {
+            EHPrint("Exception: Bound Range\n");
+            EHPrint("The processor attempted to access an array element that is out of bounds.\n");
+            break;
+        }
+        case CPU::x86::InvalidOpcode:
+        {
+            EHPrint("Exception: Invalid Opcode\n");
+            EHPrint("The processor attempted to execute an invalid opcode.\n");
+            break;
+        }
+        case CPU::x86::DeviceNotAvailable:
+        {
+            EHPrint("Exception: Device Not Available\n");
+            EHPrint("The processor attempted to use a device that is not available.\n");
+            break;
+        }
+        case CPU::x86::DoubleFault:
+        {
+            EHPrint("Exception: Double Fault\n");
+            EHPrint("The processor encountered a double fault.\n");
+            break;
+        }
+        case CPU::x86::CoprocessorSegmentOverrun:
+        {
+            EHPrint("Exception: Coprocessor Segment Overrun\n");
+            EHPrint("The processor attempted to access a segment that is not available.\n");
+            break;
+        }
+        case CPU::x86::InvalidTSS:
+        {
+            EHPrint("Exception: Invalid TSS\n");
+            EHPrint("The processor attempted to access a task state segment that is not available or valid.\n");
+            CPU::x64::SelectorErrorCode SelCode = {.raw = Frame->ErrorCode};
+            EHPrint("External? %s\n", SelCode.External ? "Yes" : "No");
+            EHPrint("GDT  IDT  LDT  IDT\n");
+            switch (SelCode.Table)
+            {
+            case 0b00:
+            {
+                EHPrint(" ^                \n");
+                EHPrint(" |                \n");
+                EHPrint(" %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b01:
+            {
+                EHPrint("      ^           \n");
+                EHPrint("      |           \n");
+                EHPrint("      %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b10:
+            {
+                EHPrint("           ^      \n");
+                EHPrint("           |      \n");
+                EHPrint("           %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b11:
+            {
+                EHPrint("                ^ \n");
+                EHPrint("                | \n");
+                EHPrint("                %ld\n", SelCode.Idx);
+                break;
+            }
+            default:
+            {
+                EHPrint("         ?        \n");
+                EHPrint("         ?        \n");
+                EHPrint("         %ld\n", SelCode.Idx);
+                break;
+            }
+            }
+            break;
+        }
+        case CPU::x86::SegmentNotPresent:
+        {
+            EHPrint("Exception: Segment Not Present\n");
+            EHPrint("The processor attempted to access a segment that is not present.\n");
+            CPU::x64::SelectorErrorCode SelCode = {.raw = Frame->ErrorCode};
+            EHPrint("External? %s\n", SelCode.External ? "Yes" : "No");
+            EHPrint("GDT  IDT  LDT  IDT\n");
+            switch (SelCode.Table)
+            {
+            case 0b00:
+            {
+                EHPrint(" ^                \n");
+                EHPrint(" |                \n");
+                EHPrint(" %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b01:
+            {
+                EHPrint("      ^           \n");
+                EHPrint("      |           \n");
+                EHPrint("      %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b10:
+            {
+                EHPrint("           ^      \n");
+                EHPrint("           |      \n");
+                EHPrint("           %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b11:
+            {
+                EHPrint("                ^ \n");
+                EHPrint("                | \n");
+                EHPrint("                %ld\n", SelCode.Idx);
+                break;
+            }
+            default:
+            {
+                EHPrint("         ?        \n");
+                EHPrint("         ?        \n");
+                EHPrint("         %ld\n", SelCode.Idx);
+                break;
+            }
+            }
+            break;
+        }
+        case CPU::x86::StackSegmentFault:
+        {
+            EHPrint("Exception: Stack Segment Fault\n");
+            CPU::x64::SelectorErrorCode SelCode = {.raw = Frame->ErrorCode};
+            EHPrint("External? %s\n", SelCode.External ? "Yes" : "No");
+            EHPrint("GDT  IDT  LDT  IDT\n");
+            switch (SelCode.Table)
+            {
+            case 0b00:
+            {
+                EHPrint(" ^                \n");
+                EHPrint(" |                \n");
+                EHPrint(" %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b01:
+            {
+                EHPrint("      ^           \n");
+                EHPrint("      |           \n");
+                EHPrint("      %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b10:
+            {
+                EHPrint("           ^      \n");
+                EHPrint("           |      \n");
+                EHPrint("           %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b11:
+            {
+                EHPrint("                ^ \n");
+                EHPrint("                | \n");
+                EHPrint("                %ld\n", SelCode.Idx);
+                break;
+            }
+            default:
+            {
+                EHPrint("         ?        \n");
+                EHPrint("         ?        \n");
+                EHPrint("         %ld\n", SelCode.Idx);
+                break;
+            }
+            }
+            break;
+        }
+        case CPU::x86::GeneralProtectionFault:
+        {
+            EHPrint("Exception: General Protection Fault\n");
+            EHPrint("Kernel performed an illegal operation.\n");
+            CPU::x64::SelectorErrorCode SelCode = {.raw = Frame->ErrorCode};
+            EHPrint("External? %s\n", SelCode.External ? "Yes" : "No");
+            EHPrint("GDT  IDT  LDT  IDT\n");
+            switch (SelCode.Table)
+            {
+            case 0b00:
+            {
+                EHPrint(" ^                \n");
+                EHPrint(" |                \n");
+                EHPrint(" %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b01:
+            {
+                EHPrint("      ^           \n");
+                EHPrint("      |           \n");
+                EHPrint("      %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b10:
+            {
+                EHPrint("           ^      \n");
+                EHPrint("           |      \n");
+                EHPrint("           %ld\n", SelCode.Idx);
+                break;
+            }
+            case 0b11:
+            {
+                EHPrint("                ^ \n");
+                EHPrint("                | \n");
+                EHPrint("                %ld\n", SelCode.Idx);
+                break;
+            }
+            default:
+            {
+                EHPrint("         ?        \n");
+                EHPrint("         ?        \n");
+                EHPrint("         %ld\n", SelCode.Idx);
+                break;
+            }
+            }
+            break;
+        }
+        case CPU::x86::PageFault:
+        {
+            EHPrint("Exception: Page Fault\n");
+            EHPrint("The processor attempted to access a page that is not present.\n");
+
+            CPU::x64::PageFaultErrorCode params = {.raw = (uint32_t)Frame->ErrorCode};
+#if defined(a64)
+            EHPrint("At \e8888FF%#lx \eFAFAFAby \e8888FF%#lx\eFAFAFA\n", PageFaultAddress, Frame->rip);
+#elif defined(a32)
+            EHPrint("At \e8888FF%#lx \eFAFAFAby \e8888FF%#lx\eFAFAFA\n", PageFaultAddress, Frame->eip);
+#elif defined(aa64)
+#endif
+            EHPrint("Page: %s\eFAFAFA\n", params.P ? "\e058C19Present" : "\eE85230Not Present");
+            EHPrint("Write Operation: \e8888FF%s\eFAFAFA\n", params.W ? "Read-Only" : "Read-Write");
+            EHPrint("Processor Mode: \e8888FF%s\eFAFAFA\n", params.U ? "User-Mode" : "Kernel-Mode");
+            EHPrint("CPU Reserved Bits: %s\eFAFAFA\n", params.R ? "\eE85230Reserved" : "\e058C19Unreserved");
+            EHPrint("Caused By An Instruction Fetch: %s\eFAFAFA\n", params.I ? "\eE85230Yes" : "\e058C19No");
+            EHPrint("Caused By A Protection-Key Violation: %s\eFAFAFA\n", params.PK ? "\eE85230Yes" : "\e058C19No");
+            EHPrint("Caused By A Shadow Stack Access: %s\eFAFAFA\n", params.SS ? "\eE85230Yes" : "\e058C19No");
+            EHPrint("Caused By An SGX Violation: %s\eFAFAFA\n", params.SGX ? "\eE85230Yes" : "\e058C19No");
+            EHPrint("More Info: \e8888FF");
+            if (Frame->ErrorCode & 0x00000008)
+                EHPrint("One or more page directory entries contain reserved bits which are set to 1.\n");
+            else
+                EHPrint(PagefaultDescriptions[Frame->ErrorCode & 0b111]);
+            EHPrint("\eFAFAFA");
+            break;
+        }
+        case CPU::x86::x87FloatingPoint:
+        {
+            EHPrint("Exception: x87 Floating Point\n");
+            EHPrint("The x87 FPU generated an error.\n");
+            break;
+        }
+        case CPU::x86::AlignmentCheck:
+        {
+            EHPrint("Exception: Alignment Check\n");
+            EHPrint("The CPU detected an unaligned memory access.\n");
+            break;
+        }
+        case CPU::x86::MachineCheck:
+        {
+            EHPrint("Exception: Machine Check\n");
+            EHPrint("The CPU detected a hardware error.\n");
+            break;
+        }
+        case CPU::x86::SIMDFloatingPoint:
+        {
+            EHPrint("Exception: SIMD Floating Point\n");
+            EHPrint("The CPU detected an error in the SIMD unit.\n");
+            break;
+        }
+        case CPU::x86::Virtualization:
+        {
+            EHPrint("Exception: Virtualization\n");
+            EHPrint("The CPU detected a virtualization error.\n");
+            break;
+        }
+        case CPU::x86::Security:
+        {
+            EHPrint("Exception: Security\n");
+            EHPrint("The CPU detected a security violation.\n");
+            break;
+        }
+        default:
+        {
+            EHPrint("Exception: Unknown\n");
+            EHPrint("The CPU generated an unknown exception.\n");
+            break;
+        }
+        }
+
+#if defined(a64)
+        EHPrint("The exception happened at \e8888FF%#lx\eFAFAFA\n", Frame->rip);
+#elif defined(a32)
+        EHPrint("The exception happened at \e8888FF%#lx\eFAFAFA\n", Frame->eip);
+#elif defined(aa64)
+#endif
+    }
+}
diff --git a/Kernel/Core/Crash/Screens/StackFrame.cpp b/Kernel/Core/Crash/Screens/StackFrame.cpp
new file mode 100644
index 00000000..0b23cf5b
--- /dev/null
+++ b/Kernel/Core/Crash/Screens/StackFrame.cpp
@@ -0,0 +1,99 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../crashhandler.hpp"
+#include "../chfcts.hpp"
+
+#include <ints.hpp>
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../../kernel.h"
+
+namespace CrashHandler
+{
+    SafeFunction void DisplayStackFrameScreen(CRData data)
+    {
+        EHPrint("\eFAFAFATracing 10 frames...");
+        TraceFrames(data, 10, KernelSymbolTable, true);
+        if (data.Process)
+        {
+            EHPrint("\n\eFAFAFATracing 10 process frames...");
+            SymbolResolver::Symbols *sh = data.Process->ELFSymbolTable;
+            if (!sh)
+                EHPrint("\n\eFF0000< No symbol table available. >\n");
+            else
+                TraceFrames(data, 10, sh, false);
+        }
+        EHPrint("\n\eFAFAFATracing interrupt frames...");
+        for (short i = 0; i < 8; i++)
+        {
+            if (EHIntFrames[i])
+            {
+                if (!Memory::Virtual().Check(EHIntFrames[i]))
+                    continue;
+                EHPrint("\n\e2565CC%p", EHIntFrames[i]);
+                EHPrint("\e7925CC-");
+#if defined(a64)
+                if ((uintptr_t)EHIntFrames[i] >= 0xFFFFFFFF80000000 && (uintptr_t)EHIntFrames[i] <= (uintptr_t)&_kernel_end)
+#elif defined(a32)
+                if ((uintptr_t)EHIntFrames[i] >= 0xC0000000 && (uintptr_t)EHIntFrames[i] <= (uintptr_t)&_kernel_end)
+#elif defined(aa64)
+                if ((uintptr_t)EHIntFrames[i] >= 0xFFFFFFFF80000000 && (uintptr_t)EHIntFrames[i] <= (uintptr_t)&_kernel_end)
+#endif
+                    EHPrint("\e25CCC9%s", KernelSymbolTable->GetSymbolFromAddress((uintptr_t)EHIntFrames[i]));
+                else
+                    EHPrint("\eFF4CA9Outside Kernel");
+            }
+        }
+        if (data.Process && data.Thread)
+        {
+            EHPrint("\n\n\eFAFAFATracing thread instruction pointer history...");
+            SymbolResolver::Symbols *sh = data.Process->ELFSymbolTable;
+            if (!sh)
+                EHPrint("\n\eFFA500Warning: No symbol table available.");
+            int SameItr = 0;
+            uintptr_t LastRIP = 0;
+            for (size_t i = 0; i < sizeof(data.Thread->IPHistory) / sizeof(data.Thread->IPHistory[0]); i++)
+            {
+                if (data.Thread->IPHistory[i] == LastRIP)
+                {
+                    SameItr++;
+                    if (SameItr > 2)
+                        continue;
+                }
+                else
+                    SameItr = 0;
+                LastRIP = data.Thread->IPHistory[i];
+                if (!sh)
+                    EHPrint("\n\eCCCCCC%d: \e2565CC%p", i, data.Thread->IPHistory[i]);
+                else
+                    EHPrint("\n\eCCCCCC%d: \e2565CC%p\e7925CC-\e25CCC9%s", i, data.Thread->IPHistory[i], sh->GetSymbolFromAddress(data.Thread->IPHistory[i]));
+            }
+            EHPrint("\n\e7925CCNote: \e2565CCSame instruction pointers are not shown more than 3 times.\n");
+        }
+    }
+}
diff --git a/Kernel/Core/Crash/Screens/Tasks.cpp b/Kernel/Core/Crash/Screens/Tasks.cpp
new file mode 100644
index 00000000..27be8327
--- /dev/null
+++ b/Kernel/Core/Crash/Screens/Tasks.cpp
@@ -0,0 +1,87 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../crashhandler.hpp"
+#include "../chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../../kernel.h"
+
+namespace CrashHandler
+{
+    SafeFunction void DisplayTasksScreen(CRData data)
+    {
+        const char *StatusColor[7] = {
+            "FF0000", // Unknown
+            "AAFF00", // Ready
+            "00AA00", // Running
+            "FFAA00", // Sleeping
+            "FFAA00", // Waiting
+            "FF0088", // Stopped
+            "FF0000", // Terminated
+        };
+
+        const char *StatusString[7] = {
+            "Unknown",    // Unknown
+            "Ready",      // Ready
+            "Running",    // Running
+            "Sleeping",   // Sleeping
+            "Waiting",    // Waiting
+            "Stopped",    // Stopped
+            "Terminated", // Terminated
+        };
+
+        std::vector<Tasking::PCB *> Plist = TaskManager->GetProcessList();
+
+        if (TaskManager)
+        {
+            if (data.Thread)
+#if defined(a64)
+                EHPrint("\eFAFAFACrash occurred in thread \eAA0F0F%s\eFAFAFA(%ld) at \e00AAAA%#lx\n", data.Thread->Name, data.Thread->ID, data.Frame->rip);
+#elif defined(a32)
+                EHPrint("\eFAFAFACrash occurred in thread \eAA0F0F%s\eFAFAFA(%ld) at \e00AAAA%#lx\n", data.Thread->Name, data.Thread->ID, data.Frame->eip);
+#elif defined(aa64)
+#endif
+
+            EHPrint("\eFAFAFAProcess list (%ld):\n", Plist.size());
+            foreach (auto Process in Plist)
+            {
+                EHPrint("\e%s-> \eFAFAFA%s\eCCCCCC(%ld) \e00AAAA%s\eFAFAFA PT:\e00AAAA%#lx\n",
+                        StatusColor[Process->Status], Process->Name, Process->ID, StatusString[Process->Status],
+                        Process->PageTable);
+
+                foreach (auto Thread in Process->Threads)
+                    EHPrint("\e%s  -> \eFAFAFA%s\eCCCCCC(%ld) \e00AAAA%s\eFAFAFA Stack:\e00AAAA%#lx\n",
+                            StatusColor[Thread->Status], Thread->Name, Thread->ID, StatusString[Thread->Status],
+                            Thread->Stack);
+            }
+        }
+        else
+            EHPrint("\eFAFAFATaskManager is not initialized!\n");
+    }
+}
diff --git a/Kernel/Core/Crash/UserHandler.cpp b/Kernel/Core/Crash/UserHandler.cpp
new file mode 100644
index 00000000..89e3958a
--- /dev/null
+++ b/Kernel/Core/Crash/UserHandler.cpp
@@ -0,0 +1,398 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../crashhandler.hpp"
+#include "chfcts.hpp"
+
+#include <display.hpp>
+#include <printf.h>
+#include <debug.h>
+#include <smp.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+#include "../../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+static const char *PageFaultDescriptions[8] = {
+    "Supervisory process tried to read a non-present page entry\n",
+    "Supervisory process tried to read a page and caused a protection fault\n",
+    "Supervisory process tried to write to a non-present page entry\n",
+    "Supervisory process tried to write a page and caused a protection fault\n",
+    "User process tried to read a non-present page entry\n",
+    "User process tried to read a page and caused a protection fault\n",
+    "User process tried to write to a non-present page entry\n",
+    "User process tried to write a page and caused a protection fault\n"};
+
+SafeFunction void UserModeExceptionHandler(CHArchTrapFrame *Frame)
+{
+    CriticalSection cs;
+    debug("Interrupts? %s.", cs.IsInterruptsEnabled() ? "Yes" : "No");
+    fixme("Handling user mode exception");
+    TaskManager->GetCurrentThread()->Status = Tasking::TaskStatus::Stopped;
+    CPUData *CurCPU = GetCurrentCPU();
+
+    {
+#if defined(a64)
+        CPU::x64::CR0 cr0 = CPU::x64::readcr0();
+        CPU::x64::CR2 cr2 = CPU::x64::CR2{.PFLA = CrashHandler::PageFaultAddress};
+        CPU::x64::CR3 cr3 = CPU::x64::readcr3();
+        CPU::x64::CR4 cr4 = CPU::x64::readcr4();
+        CPU::x64::CR8 cr8 = CPU::x64::readcr8();
+        CPU::x64::EFER efer;
+        efer.raw = CPU::x64::rdmsr(CPU::x64::MSR_EFER);
+
+        error("Technical Informations on CPU %lld:", CurCPU->ID);
+        uintptr_t ds;
+        asmv("mov %%ds, %0"
+             : "=r"(ds));
+#elif defined(a32)
+        CPU::x32::CR0 cr0 = CPU::x32::readcr0();
+        CPU::x32::CR2 cr2 = CPU::x32::CR2{.PFLA = CrashHandler::PageFaultAddress};
+        CPU::x32::CR3 cr3 = CPU::x32::readcr3();
+        CPU::x32::CR4 cr4 = CPU::x32::readcr4();
+        CPU::x32::CR8 cr8 = CPU::x32::readcr8();
+        CPU::x32::EFER efer;
+        efer.raw = CPU::x32::rdmsr(CPU::x32::MSR_EFER);
+
+        error("Technical Informations on CPU %lld:", CurCPU->ID);
+        uintptr_t ds;
+        asmv("mov %%ds, %0"
+             : "=r"(ds));
+#elif defined(aa64)
+#endif
+
+#if defined(a64)
+        error("FS=%#llx GS=%#llx SS=%#llx CS=%#llx DS=%#llx",
+              CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE), CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE),
+              Frame->ss, Frame->cs, ds);
+        error("R8=%#llx R9=%#llx R10=%#llx R11=%#llx", Frame->r8, Frame->r9, Frame->r10, Frame->r11);
+        error("R12=%#llx R13=%#llx R14=%#llx R15=%#llx", Frame->r12, Frame->r13, Frame->r14, Frame->r15);
+        error("RAX=%#llx RBX=%#llx RCX=%#llx RDX=%#llx", Frame->rax, Frame->rbx, Frame->rcx, Frame->rdx);
+        error("RSI=%#llx RDI=%#llx RBP=%#llx RSP=%#llx", Frame->rsi, Frame->rdi, Frame->rbp, Frame->rsp);
+        error("RIP=%#llx RFL=%#llx INT=%#llx ERR=%#llx EFER=%#llx", Frame->rip, Frame->rflags.raw, Frame->InterruptNumber, Frame->ErrorCode, efer.raw);
+#elif defined(a32)
+        error("FS=%#llx GS=%#llx SS=%#llx CS=%#llx DS=%#llx",
+              CPU::x32::rdmsr(CPU::x32::MSR_FS_BASE), CPU::x32::rdmsr(CPU::x32::MSR_GS_BASE),
+              Frame->ss, Frame->cs, ds);
+        error("EAX=%#llx EBX=%#llx ECX=%#llx EDX=%#llx", Frame->eax, Frame->ebx, Frame->ecx, Frame->edx);
+        error("ESI=%#llx EDI=%#llx EBP=%#llx ESP=%#llx", Frame->esi, Frame->edi, Frame->ebp, Frame->esp);
+        error("EIP=%#llx EFL=%#llx INT=%#llx ERR=%#llx EFER=%#llx", Frame->eip, Frame->eflags.raw, Frame->InterruptNumber, Frame->ErrorCode, efer.raw);
+#elif defined(aa64)
+#endif
+
+#if defined(a86)
+        error("CR0=%#llx CR2=%#llx CR3=%#llx CR4=%#llx CR8=%#llx", cr0.raw, cr2.raw, cr3.raw, cr4.raw, cr8.raw);
+
+        error("CR0: PE:%s MP:%s EM:%s TS:%s ET:%s NE:%s WP:%s AM:%s NW:%s CD:%s PG:%s R0:%#x R1:%#x R2:%#x",
+              cr0.PE ? "True " : "False", cr0.MP ? "True " : "False", cr0.EM ? "True " : "False", cr0.TS ? "True " : "False",
+              cr0.ET ? "True " : "False", cr0.NE ? "True " : "False", cr0.WP ? "True " : "False", cr0.AM ? "True " : "False",
+              cr0.NW ? "True " : "False", cr0.CD ? "True " : "False", cr0.PG ? "True " : "False",
+              cr0.Reserved0, cr0.Reserved1, cr0.Reserved2);
+
+        error("CR2: PFLA: %#llx",
+              cr2.PFLA);
+
+        error("CR3: PWT:%s PCD:%s PDBR:%#llx",
+              cr3.PWT ? "True " : "False", cr3.PCD ? "True " : "False", cr3.PDBR);
+#endif // defined(a86)
+
+#if defined(a64)
+        error("CR4: VME:%s PVI:%s TSD:%s DE:%s PSE:%s PAE:%s MCE:%s PGE:%s PCE:%s UMIP:%s OSFXSR:%s OSXMMEXCPT:%s    LA57:%s    VMXE:%s    SMXE:%s   PCIDE:%s OSXSAVE:%s    SMEP:%s    SMAP:%s PKE:%s R0:%#x R1:%#x R2:%#x",
+              cr4.VME ? "True " : "False", cr4.PVI ? "True " : "False", cr4.TSD ? "True " : "False", cr4.DE ? "True " : "False",
+              cr4.PSE ? "True " : "False", cr4.PAE ? "True " : "False", cr4.MCE ? "True " : "False", cr4.PGE ? "True " : "False",
+              cr4.PCE ? "True " : "False", cr4.UMIP ? "True " : "False", cr4.OSFXSR ? "True " : "False", cr4.OSXMMEXCPT ? "True " : "False",
+              cr4.LA57 ? "True " : "False", cr4.VMXE ? "True " : "False", cr4.SMXE ? "True " : "False", cr4.PCIDE ? "True " : "False",
+              cr4.OSXSAVE ? "True " : "False", cr4.SMEP ? "True " : "False", cr4.SMAP ? "True " : "False", cr4.PKE ? "True " : "False",
+              cr4.Reserved0, cr4.Reserved1, cr4.Reserved2);
+#elif defined(a32)
+        error("CR4: VME:%s PVI:%s TSD:%s DE:%s PSE:%s PAE:%s MCE:%s PGE:%s PCE:%s UMIP:%s OSFXSR:%s OSXMMEXCPT:%s    LA57:%s    VMXE:%s    SMXE:%s   PCIDE:%s OSXSAVE:%s    SMEP:%s    SMAP:%s PKE:%s R0:%#x R1:%#x",
+              cr4.VME ? "True " : "False", cr4.PVI ? "True " : "False", cr4.TSD ? "True " : "False", cr4.DE ? "True " : "False",
+              cr4.PSE ? "True " : "False", cr4.PAE ? "True " : "False", cr4.MCE ? "True " : "False", cr4.PGE ? "True " : "False",
+              cr4.PCE ? "True " : "False", cr4.UMIP ? "True " : "False", cr4.OSFXSR ? "True " : "False", cr4.OSXMMEXCPT ? "True " : "False",
+              cr4.LA57 ? "True " : "False", cr4.VMXE ? "True " : "False", cr4.SMXE ? "True " : "False", cr4.PCIDE ? "True " : "False",
+              cr4.OSXSAVE ? "True " : "False", cr4.SMEP ? "True " : "False", cr4.SMAP ? "True " : "False", cr4.PKE ? "True " : "False",
+              cr4.Reserved0, cr4.Reserved1);
+#endif
+
+#if defined(a86)
+        error("CR8: TPL:%d", cr8.TPL);
+#endif // defined(a86)
+
+#if defined(a64)
+        error("RFL: CF:%s PF:%s AF:%s ZF:%s SF:%s TF:%s IF:%s DF:%s OF:%s IOPL:%s NT:%s RF:%s VM:%s AC:%s VIF:%s VIP:%s ID:%s AlwaysOne:%d R0:%#x R1:%#x R2:%#x R3:%#x",
+              Frame->rflags.CF ? "True " : "False", Frame->rflags.PF ? "True " : "False", Frame->rflags.AF ? "True " : "False", Frame->rflags.ZF ? "True " : "False",
+              Frame->rflags.SF ? "True " : "False", Frame->rflags.TF ? "True " : "False", Frame->rflags.IF ? "True " : "False", Frame->rflags.DF ? "True " : "False",
+              Frame->rflags.OF ? "True " : "False", Frame->rflags.IOPL ? "True " : "False", Frame->rflags.NT ? "True " : "False", Frame->rflags.RF ? "True " : "False",
+              Frame->rflags.VM ? "True " : "False", Frame->rflags.AC ? "True " : "False", Frame->rflags.VIF ? "True " : "False", Frame->rflags.VIP ? "True " : "False",
+              Frame->rflags.ID ? "True " : "False", Frame->rflags.AlwaysOne,
+              Frame->rflags.Reserved0, Frame->rflags.Reserved1, Frame->rflags.Reserved2, Frame->rflags.Reserved3);
+#elif defined(a32)
+        error("EFL: CF:%s PF:%s AF:%s ZF:%s SF:%s TF:%s IF:%s DF:%s OF:%s IOPL:%s NT:%s RF:%s VM:%s AC:%s VIF:%s VIP:%s ID:%s AlwaysOne:%d R0:%#x R1:%#x R2:%#x",
+              Frame->eflags.CF ? "True " : "False", Frame->eflags.PF ? "True " : "False", Frame->eflags.AF ? "True " : "False", Frame->eflags.ZF ? "True " : "False",
+              Frame->eflags.SF ? "True " : "False", Frame->eflags.TF ? "True " : "False", Frame->eflags.IF ? "True " : "False", Frame->eflags.DF ? "True " : "False",
+              Frame->eflags.OF ? "True " : "False", Frame->eflags.IOPL ? "True " : "False", Frame->eflags.NT ? "True " : "False", Frame->eflags.RF ? "True " : "False",
+              Frame->eflags.VM ? "True " : "False", Frame->eflags.AC ? "True " : "False", Frame->eflags.VIF ? "True " : "False", Frame->eflags.VIP ? "True " : "False",
+              Frame->eflags.ID ? "True " : "False", Frame->eflags.AlwaysOne,
+              Frame->eflags.Reserved0, Frame->eflags.Reserved1, Frame->eflags.Reserved2);
+#elif defined(aa64)
+#endif
+
+#if defined(a86)
+        error("EFER: SCE:%s LME:%s LMA:%s NXE:%s SVME:%s LMSLE:%s FFXSR:%s TCE:%s R0:%#x R1:%#x R2:%#x",
+              efer.SCE ? "True " : "False", efer.LME ? "True " : "False", efer.LMA ? "True " : "False", efer.NXE ? "True " : "False",
+              efer.SVME ? "True " : "False", efer.LMSLE ? "True " : "False", efer.FFXSR ? "True " : "False", efer.TCE ? "True " : "False",
+              efer.Reserved0, efer.Reserved1, efer.Reserved2);
+#endif // a64 || a32
+    }
+
+    switch (Frame->InterruptNumber)
+    {
+    case CPU::x86::DivideByZero:
+    {
+        break;
+    }
+    case CPU::x86::Debug:
+    {
+        break;
+    }
+    case CPU::x86::NonMaskableInterrupt:
+    {
+        break;
+    }
+    case CPU::x86::Breakpoint:
+    {
+        break;
+    }
+    case CPU::x86::Overflow:
+    {
+        break;
+    }
+    case CPU::x86::BoundRange:
+    {
+        break;
+    }
+    case CPU::x86::InvalidOpcode:
+    {
+        break;
+    }
+    case CPU::x86::DeviceNotAvailable:
+    {
+        break;
+    }
+    case CPU::x86::DoubleFault:
+    {
+        break;
+    }
+    case CPU::x86::CoprocessorSegmentOverrun:
+    {
+        break;
+    }
+    case CPU::x86::InvalidTSS:
+    {
+        break;
+    }
+    case CPU::x86::SegmentNotPresent:
+    {
+        break;
+    }
+    case CPU::x86::StackSegmentFault:
+    {
+        break;
+    }
+    case CPU::x86::GeneralProtectionFault:
+    {
+        break;
+    }
+    case CPU::x86::PageFault:
+    {
+        uintptr_t CheckPageFaultAddress = 0;
+        CPU::x64::PageFaultErrorCode params = {.raw = (uint32_t)Frame->ErrorCode};
+#if defined(a64)
+        CheckPageFaultAddress = CrashHandler::PageFaultAddress;
+        if (CheckPageFaultAddress == 0)
+            CheckPageFaultAddress = Frame->rip;
+
+        error("An exception occurred at %#lx by %#lx", CrashHandler::PageFaultAddress, Frame->rip);
+#elif defined(a32)
+        error("An exception occurred at %#lx by %#lx", CrashHandler::PageFaultAddress, Frame->eip);
+#elif defined(aa64)
+#endif
+        error("Page: %s", params.P ? "Present" : "Not Present");
+        error("Write Operation: %s", params.W ? "Read-Only" : "Read-Write");
+        error("Processor Mode: %s", params.U ? "User-Mode" : "Kernel-Mode");
+        error("CPU Reserved Bits: %s", params.R ? "Reserved" : "Unreserved");
+        error("Caused By An Instruction Fetch: %s", params.I ? "Yes" : "No");
+        error("Caused By A Protection-Key Violation: %s", params.PK ? "Yes" : "No");
+        error("Caused By A Shadow Stack Access: %s", params.SS ? "Yes" : "No");
+        error("Caused By An SGX Violation: %s", params.SGX ? "Yes" : "No");
+        if (Frame->ErrorCode & 0x00000008)
+            error("One or more page directory entries contain reserved bits which are set to 1.");
+        else
+            error(PageFaultDescriptions[Frame->ErrorCode & 0b111]);
+
+#ifdef DEBUG
+        if (CurCPU)
+        {
+            Memory::Virtual vma = Memory::Virtual(CurCPU->CurrentProcess->PageTable);
+            bool PageAvailable = vma.Check((void *)CheckPageFaultAddress);
+            debug("Page available (Check(...)): %s. %s",
+                  PageAvailable ? "Yes" : "No",
+                  (params.P && !PageAvailable) ? "CR2 == Present; Check() != Present??????" : "CR2 confirms Check() result.");
+
+            if (PageAvailable)
+            {
+                bool Present = vma.Check((void *)CheckPageFaultAddress);
+                bool ReadWrite = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::RW);
+                bool User = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::US);
+                bool WriteThrough = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::PWT);
+                bool CacheDisabled = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::PCD);
+                bool Accessed = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::A);
+                bool Dirty = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::D);
+                bool Global = vma.Check((void *)CheckPageFaultAddress, Memory::PTFlag::G);
+                /* ... */
+
+                debug("Page available: %s", Present ? "Yes" : "No");
+                debug("Page read/write: %s", ReadWrite ? "Yes" : "No");
+                debug("Page user/kernel: %s", User ? "User" : "Kernel");
+                debug("Page write-through: %s", WriteThrough ? "Yes" : "No");
+                debug("Page cache disabled: %s", CacheDisabled ? "Yes" : "No");
+                debug("Page accessed: %s", Accessed ? "Yes" : "No");
+                debug("Page dirty: %s", Dirty ? "Yes" : "No");
+                debug("Page global: %s", Global ? "Yes" : "No");
+
+                if (Present)
+                {
+                    uintptr_t CheckPageFaultLinearAddress = (uintptr_t)CheckPageFaultAddress;
+                    CheckPageFaultLinearAddress &= 0xFFFFFFFFFFFFF000;
+                    debug("%#lx -> %#lx", CheckPageFaultAddress, CheckPageFaultLinearAddress);
+
+                    Memory::Virtual::PageMapIndexer Index = Memory::Virtual::PageMapIndexer((uintptr_t)CheckPageFaultLinearAddress);
+                    debug("Index for %#lx is PML:%d PDPTE:%d PDE:%d PTE:%d",
+                          CheckPageFaultLinearAddress,
+                          Index.PMLIndex,
+                          Index.PDPTEIndex,
+                          Index.PDEIndex,
+                          Index.PTEIndex);
+                    Memory::PageMapLevel4 PML4 = CurCPU->CurrentProcess->PageTable->Entries[Index.PMLIndex];
+
+                    Memory::PageDirectoryPointerTableEntryPtr *PDPTE = (Memory::PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4.GetAddress() << 12);
+                    Memory::PageDirectoryEntryPtr *PDE = (Memory::PageDirectoryEntryPtr *)((uintptr_t)PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+                    Memory::PageTableEntryPtr *PTE = (Memory::PageTableEntryPtr *)((uintptr_t)PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+
+                    debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:%#lx",
+                          Index.PMLIndex, 0, 0, 0,
+                          PML4.Present ? "1" : "0",
+                          PML4.ReadWrite ? "1" : "0",
+                          PML4.UserSupervisor ? "1" : "0",
+                          PML4.WriteThrough ? "1" : "0",
+                          PML4.CacheDisable ? "1" : "0",
+                          PML4.Accessed ? "1" : "0",
+                          PML4.ExecuteDisable ? "1" : "0",
+                          PML4.GetAddress() << 12);
+
+                    debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:%#lx",
+                          Index.PMLIndex, Index.PDPTEIndex, 0, 0,
+                          PDPTE->Entries[Index.PDPTEIndex].Present ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].ReadWrite ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].UserSupervisor ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].WriteThrough ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].CacheDisable ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].Accessed ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].ExecuteDisable ? "1" : "0",
+                          PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+
+                    debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s NX:%s Address:%#lx",
+                          Index.PMLIndex, Index.PDPTEIndex, Index.PDEIndex, 0,
+                          PDE->Entries[Index.PDEIndex].Present ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].ReadWrite ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].UserSupervisor ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].WriteThrough ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].CacheDisable ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].Accessed ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].ExecuteDisable ? "1" : "0",
+                          PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+
+                    debug("# %03d-%03d-%03d-%03d: P:%s RW:%s US:%s PWT:%s PCB:%s A:%s D:%s PAT:%s G:%s PK:%d NX:%s Address:%#lx",
+                          Index.PMLIndex, Index.PDPTEIndex, Index.PDEIndex, Index.PTEIndex,
+                          PTE->Entries[Index.PTEIndex].Present ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].ReadWrite ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].UserSupervisor ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].WriteThrough ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].CacheDisable ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].Accessed ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].Dirty ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].PageAttributeTable ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].Global ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].ProtectionKey,
+                          PTE->Entries[Index.PTEIndex].ExecuteDisable ? "1" : "0",
+                          PTE->Entries[Index.PTEIndex].GetAddress() << 12);
+                }
+            }
+        }
+#endif
+
+        if (CurCPU)
+            if (CurCPU->CurrentThread->Stack->Expand(CrashHandler::PageFaultAddress))
+            {
+                debug("Stack expanded");
+                TaskManager->GetCurrentThread()->Status = Tasking::TaskStatus::Ready;
+                return;
+            }
+        break;
+    }
+    case CPU::x86::x87FloatingPoint:
+    {
+        break;
+    }
+    case CPU::x86::AlignmentCheck:
+    {
+        break;
+    }
+    case CPU::x86::MachineCheck:
+    {
+        break;
+    }
+    case CPU::x86::SIMDFloatingPoint:
+    {
+        break;
+    }
+    case CPU::x86::Virtualization:
+    {
+        break;
+    }
+    case CPU::x86::Security:
+    {
+        break;
+    }
+    default:
+    {
+        break;
+    }
+    }
+
+    TaskManager->GetCurrentThread()->Status = Tasking::TaskStatus::Terminated;
+    __sync;
+    error("End of report.");
+    CPU::Interrupts(CPU::Enable);
+    debug("Interrupts enabled back.");
+    return;
+}
diff --git a/Kernel/Core/Crash/chfcts.hpp b/Kernel/Core/Crash/chfcts.hpp
new file mode 100644
index 00000000..41a7a700
--- /dev/null
+++ b/Kernel/Core/Crash/chfcts.hpp
@@ -0,0 +1,322 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CRASH_HANDLERS_FUNCTIONS_H__
+#define __FENNIX_KERNEL_CRASH_HANDLERS_FUNCTIONS_H__
+
+#include <types.h>
+
+#include <ints.hpp>
+#include <task.hpp>
+#include <cpu.hpp>
+
+#if defined(a64)
+typedef struct CPU::x64::TrapFrame CHArchTrapFrame;
+
+struct CRData
+{
+    CHArchTrapFrame *Frame;
+
+    CPU::x64::CR0 cr0;
+    CPU::x64::CR2 cr2;
+    CPU::x64::CR3 cr3;
+    CPU::x64::CR4 cr4;
+    CPU::x64::CR8 cr8;
+    CPU::x64::EFER efer;
+    uintptr_t dr0, dr1, dr2, dr3, dr6;
+    CPU::x64::DR7 dr7;
+
+    long ID;
+    void *CPUData;
+    Tasking::PCB *Process;
+    Tasking::TCB *Thread;
+};
+
+#elif defined(a32)
+typedef struct CPU::x32::TrapFrame CHArchTrapFrame;
+
+struct CRData
+{
+    CHArchTrapFrame *Frame;
+
+    CPU::x32::CR0 cr0;
+    CPU::x32::CR2 cr2;
+    CPU::x32::CR3 cr3;
+    CPU::x32::CR4 cr4;
+    CPU::x32::CR8 cr8;
+    CPU::x32::EFER efer;
+    uintptr_t dr0, dr1, dr2, dr3, dr6;
+    CPU::x32::DR7 dr7;
+
+    long ID;
+    Tasking::PCB *Process;
+    Tasking::TCB *Thread;
+};
+#elif defined(aa64)
+typedef struct CPU::aarch64::TrapFrame CHArchTrapFrame;
+
+struct CRData
+{
+    CHArchTrapFrame *Frame;
+
+    long ID;
+    Tasking::PCB *Process;
+    Tasking::TCB *Thread;
+};
+#endif
+
+enum Keys
+{
+    KEY_INVALID = 0x0,
+    KEY_D_ESCAPE = 0x1,
+    KEY_D_1 = 0x2,
+    KEY_D_2 = 0x3,
+    KEY_D_3 = 0x4,
+    KEY_D_4 = 0x5,
+    KEY_D_5 = 0x6,
+    KEY_D_6 = 0x7,
+    KEY_D_7 = 0x8,
+    KEY_D_8 = 0x9,
+    KEY_D_9 = 0xa,
+    KEY_D_0 = 0xb,
+    KEY_D_MINUS = 0xc,
+    KEY_D_EQUALS = 0xd,
+    KEY_D_BACKSPACE = 0xe,
+    KEY_D_TAB = 0xf,
+    KEY_D_Q = 0x10,
+    KEY_D_W = 0x11,
+    KEY_D_E = 0x12,
+    KEY_D_R = 0x13,
+    KEY_D_T = 0x14,
+    KEY_D_Y = 0x15,
+    KEY_D_U = 0x16,
+    KEY_D_I = 0x17,
+    KEY_D_O = 0x18,
+    KEY_D_P = 0x19,
+    KEY_D_LBRACKET = 0x1a,
+    KEY_D_RBRACKET = 0x1b,
+    KEY_D_RETURN = 0x1c,
+    KEY_D_LCTRL = 0x1d,
+    KEY_D_A = 0x1e,
+    KEY_D_S = 0x1f,
+    KEY_D_D = 0x20,
+    KEY_D_F = 0x21,
+    KEY_D_G = 0x22,
+    KEY_D_H = 0x23,
+    KEY_D_J = 0x24,
+    KEY_D_K = 0x25,
+    KEY_D_L = 0x26,
+    KEY_D_SEMICOLON = 0x27,
+    KEY_D_APOSTROPHE = 0x28,
+    KEY_D_GRAVE = 0x29,
+    KEY_D_LSHIFT = 0x2a,
+    KEY_D_BACKSLASH = 0x2b,
+    KEY_D_Z = 0x2c,
+    KEY_D_X = 0x2d,
+    KEY_D_C = 0x2e,
+    KEY_D_V = 0x2f,
+    KEY_D_B = 0x30,
+    KEY_D_N = 0x31,
+    KEY_D_M = 0x32,
+    KEY_D_COMMA = 0x33,
+    KEY_D_PERIOD = 0x34,
+    KEY_D_SLASH = 0x35,
+    KEY_D_RSHIFT = 0x36,
+    KEY_D_PRTSC = 0x37,
+    KEY_D_LALT = 0x38,
+    KEY_D_SPACE = 0x39,
+    KEY_D_CAPSLOCK = 0x3a,
+    KEY_D_NUMLOCK = 0x45,
+    KEY_D_SCROLLLOCK = 0x46,
+
+    KEY_D_KP_MULTIPLY = 0x37,
+    KEY_D_KP_7 = 0x47,
+    KEY_D_KP_8 = 0x48,
+    KEY_D_KP_9 = 0x49,
+    KEY_D_KP_MINUS = 0x4a,
+    KEY_D_KP_4 = 0x4b,
+    KEY_D_KP_5 = 0x4c,
+    KEY_D_KP_6 = 0x4d,
+    KEY_D_KP_PLUS = 0x4e,
+    KEY_D_KP_1 = 0x4f,
+    KEY_D_KP_2 = 0x50,
+    KEY_D_KP_3 = 0x51,
+    KEY_D_KP_0 = 0x52,
+    KEY_D_KP_PERIOD = 0x53,
+
+    KEY_D_F1 = 0x3b,
+    KEY_D_F2 = 0x3c,
+    KEY_D_F3 = 0x3d,
+    KEY_D_F4 = 0x3e,
+    KEY_D_F5 = 0x3f,
+    KEY_D_F6 = 0x40,
+    KEY_D_F7 = 0x41,
+    KEY_D_F8 = 0x42,
+    KEY_D_F9 = 0x43,
+    KEY_D_F10 = 0x44,
+    KEY_D_F11 = 0x57,
+    KEY_D_F12 = 0x58,
+
+    KEY_D_UP = 0x48,
+    KEY_D_LEFT = 0x4b,
+    KEY_D_RIGHT = 0x4d,
+    KEY_D_DOWN = 0x50,
+
+    KEY_U_ESCAPE = 0x81,
+    KEY_U_1 = 0x82,
+    KEY_U_2 = 0x83,
+    KEY_U_3 = 0x84,
+    KEY_U_4 = 0x85,
+    KEY_U_5 = 0x86,
+    KEY_U_6 = 0x87,
+    KEY_U_7 = 0x88,
+    KEY_U_8 = 0x89,
+    KEY_U_9 = 0x8a,
+    KEY_U_0 = 0x8b,
+    KEY_U_MINUS = 0x8c,
+    KEY_U_EQUALS = 0x8d,
+    KEY_U_BACKSPACE = 0x8e,
+    KEY_U_TAB = 0x8f,
+    KEY_U_Q = 0x90,
+    KEY_U_W = 0x91,
+    KEY_U_E = 0x92,
+    KEY_U_R = 0x93,
+    KEY_U_T = 0x94,
+    KEY_U_Y = 0x95,
+    KEY_U_U = 0x96,
+    KEY_U_I = 0x97,
+    KEY_U_O = 0x98,
+    KEY_U_P = 0x99,
+    KEY_U_LBRACKET = 0x9a,
+    KEY_U_RBRACKET = 0x9b,
+    KEY_U_RETURN = 0x9c,
+    KEY_U_LCTRL = 0x9d,
+    KEY_U_A = 0x9e,
+    KEY_U_S = 0x9f,
+    KEY_U_D = 0xa0,
+    KEY_U_F = 0xa1,
+    KEY_U_G = 0xa2,
+    KEY_U_H = 0xa3,
+    KEY_U_J = 0xa4,
+    KEY_U_K = 0xa5,
+    KEY_U_L = 0xa6,
+    KEY_U_SEMICOLON = 0xa7,
+    KEY_U_APOSTROPHE = 0xa8,
+    KEY_U_GRAVE = 0xa9,
+    KEY_U_LSHIFT = 0xaa,
+    KEY_U_BACKSLASH = 0xab,
+    KEY_U_Z = 0xac,
+    KEY_U_X = 0xad,
+    KEY_U_C = 0xae,
+    KEY_U_V = 0xaf,
+    KEY_U_B = 0xb0,
+    KEY_U_N = 0xb1,
+    KEY_U_M = 0xb2,
+    KEY_U_COMMA = 0xb3,
+    KEY_U_PERIOD = 0xb4,
+    KEY_U_SLASH = 0xb5,
+    KEY_U_RSHIFT = 0xb6,
+    KEY_U_KP_MULTIPLY = 0xb7,
+    KEY_U_LALT = 0xb8,
+    KEY_U_SPACE = 0xb9,
+    KEY_U_CAPSLOCK = 0xba,
+    KEY_U_F1 = 0xbb,
+    KEY_U_F2 = 0xbc,
+    KEY_U_F3 = 0xbd,
+    KEY_U_F4 = 0xbe,
+    KEY_U_F5 = 0xbf,
+    KEY_U_F6 = 0xc0,
+    KEY_U_F7 = 0xc1,
+    KEY_U_F8 = 0xc2,
+    KEY_U_F9 = 0xc3,
+    KEY_U_F10 = 0xc4,
+    KEY_U_NUMLOCK = 0xc5,
+    KEY_U_SCROLLLOCK = 0xc6,
+    KEY_U_KP_7 = 0xc7,
+    KEY_U_KP_8 = 0xc8,
+    KEY_U_KP_9 = 0xc9,
+    KEY_U_KP_MINUS = 0xca,
+    KEY_U_KP_4 = 0xcb,
+    KEY_U_KP_5 = 0xcc,
+    KEY_U_KP_6 = 0xcd,
+    KEY_U_KP_PLUS = 0xce,
+    KEY_U_KP_1 = 0xcf,
+    KEY_U_KP_2 = 0xd0,
+    KEY_U_KP_3 = 0xd1,
+    KEY_U_KP_0 = 0xd2,
+    KEY_U_KP_PERIOD = 0xd3,
+    KEY_U_F11 = 0xd7,
+    KEY_U_F12 = 0xd8,
+};
+
+namespace CrashHandler
+{
+    extern int SBIdx;
+
+    class CrashKeyboardDriver : public Interrupts::Handler
+    {
+    private:
+#if defined(a64)
+        void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+#elif defined(a32)
+        void OnInterruptReceived(CPU::x32::TrapFrame *Frame);
+#elif defined(aa64)
+        void OnInterruptReceived(CPU::aarch64::TrapFrame *Frame);
+#endif
+    public:
+        CrashKeyboardDriver();
+        ~CrashKeyboardDriver();
+    };
+
+    void TraceFrames(CRData data, int Count, SymbolResolver::Symbols *SymHandle, bool Kernel);
+
+    void ArrowInput(uint8_t key);
+    void UserInput(char *Input);
+    void HookKeyboard();
+
+    void DisplayMainScreen(CRData data);
+    void DisplayDetailsScreen(CRData data);
+    void DisplayStackFrameScreen(CRData data);
+    void DisplayTasksScreen(CRData data);
+    void DisplayConsoleScreen(CRData data);
+}
+
+void DivideByZeroExceptionHandler(CHArchTrapFrame *Frame);
+void DebugExceptionHandler(CHArchTrapFrame *Frame);
+void NonMaskableInterruptExceptionHandler(CHArchTrapFrame *Frame);
+void BreakpointExceptionHandler(CHArchTrapFrame *Frame);
+void OverflowExceptionHandler(CHArchTrapFrame *Frame);
+void BoundRangeExceptionHandler(CHArchTrapFrame *Frame);
+void InvalidOpcodeExceptionHandler(CHArchTrapFrame *Frame);
+void DeviceNotAvailableExceptionHandler(CHArchTrapFrame *Frame);
+void DoubleFaultExceptionHandler(CHArchTrapFrame *Frame);
+void CoprocessorSegmentOverrunExceptionHandler(CHArchTrapFrame *Frame);
+void InvalidTSSExceptionHandler(CHArchTrapFrame *Frame);
+void SegmentNotPresentExceptionHandler(CHArchTrapFrame *Frame);
+void StackFaultExceptionHandler(CHArchTrapFrame *Frame);
+void GeneralProtectionExceptionHandler(CHArchTrapFrame *Frame);
+void PageFaultExceptionHandler(CHArchTrapFrame *Frame);
+void x87FloatingPointExceptionHandler(CHArchTrapFrame *Frame);
+void AlignmentCheckExceptionHandler(CHArchTrapFrame *Frame);
+void MachineCheckExceptionHandler(CHArchTrapFrame *Frame);
+void SIMDFloatingPointExceptionHandler(CHArchTrapFrame *Frame);
+void VirtualizationExceptionHandler(CHArchTrapFrame *Frame);
+void SecurityExceptionHandler(CHArchTrapFrame *Frame);
+void UnknownExceptionHandler(CHArchTrapFrame *Frame);
+void UserModeExceptionHandler(CHArchTrapFrame *Frame);
+
+#endif // !__FENNIX_KERNEL_CRASH_HANDLERS_FUNCTIONS_H__
diff --git a/Kernel/Core/Debugger.cpp b/Kernel/Core/Debugger.cpp
new file mode 100644
index 00000000..7d29c4ee
--- /dev/null
+++ b/Kernel/Core/Debugger.cpp
@@ -0,0 +1,155 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <debug.h>
+
+#include <uart.hpp>
+#include <printf.h>
+#include <lock.hpp>
+
+NewLock(DebuggerLock);
+
+using namespace UniversalAsynchronousReceiverTransmitter;
+
+static inline NIF void uart_wrapper(char c, void *unused)
+{
+    UART(COM1).Write(c);
+    UNUSED(unused);
+}
+
+static inline NIF void WritePrefix(DebugLevel Level, const char *File, int Line, const char *Function)
+{
+    const char *DbgLvlString;
+    switch (Level)
+    {
+    case DebugLevelError:
+        DbgLvlString = "ERROR";
+        break;
+    case DebugLevelWarning:
+        DbgLvlString = "WARN ";
+        break;
+    case DebugLevelInfo:
+        DbgLvlString = "INFO ";
+        break;
+    case DebugLevelDebug:
+        DbgLvlString = "DEBUG";
+        break;
+    case DebugLevelTrace:
+        DbgLvlString = "TRACE";
+        break;
+    case DebugLevelFixme:
+        DbgLvlString = "FIXME";
+        break;
+    case DebugLevelUbsan:
+    {
+        DbgLvlString = "UBSAN";
+        fctprintf(uart_wrapper, nullptr, "%s|%s: ", DbgLvlString, Function);
+        return;
+    }
+    default:
+        DbgLvlString = "UNKNW";
+        break;
+    }
+    fctprintf(uart_wrapper, nullptr, "%s|%s->%s:%d: ", DbgLvlString, File, Function, Line);
+}
+
+namespace SysDbg
+{
+    NIF void Write(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+    {
+        WritePrefix(Level, File, Line, Function);
+        va_list args;
+        va_start(args, Format);
+        vfctprintf(uart_wrapper, nullptr, Format, args);
+        va_end(args);
+    }
+
+    NIF void WriteLine(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+    {
+        WritePrefix(Level, File, Line, Function);
+        va_list args;
+        va_start(args, Format);
+        vfctprintf(uart_wrapper, nullptr, Format, args);
+        va_end(args);
+        uart_wrapper('\n', nullptr);
+    }
+
+    NIF void LockedWrite(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+    {
+        SmartTimeoutLock(DebuggerLock, 1000);
+        WritePrefix(Level, File, Line, Function);
+        va_list args;
+        va_start(args, Format);
+        vfctprintf(uart_wrapper, nullptr, Format, args);
+        va_end(args);
+    }
+
+    NIF void LockedWriteLine(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+    {
+        SmartTimeoutLock(DebuggerLock, 1000);
+        WritePrefix(Level, File, Line, Function);
+        va_list args;
+        va_start(args, Format);
+        vfctprintf(uart_wrapper, nullptr, Format, args);
+        va_end(args);
+        uart_wrapper('\n', nullptr);
+    }
+}
+
+// C compatibility
+extern "C" NIF void SysDbgWrite(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+{
+    WritePrefix(Level, File, Line, Function);
+    va_list args;
+    va_start(args, Format);
+    vfctprintf(uart_wrapper, nullptr, Format, args);
+    va_end(args);
+}
+
+// C compatibility
+extern "C" NIF void SysDbgWriteLine(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+{
+    WritePrefix(Level, File, Line, Function);
+    va_list args;
+    va_start(args, Format);
+    vfctprintf(uart_wrapper, nullptr, Format, args);
+    va_end(args);
+    uart_wrapper('\n', nullptr);
+}
+
+// C compatibility
+extern "C" NIF void SysDbgLockedWrite(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+{
+    SmartTimeoutLock(DebuggerLock, 1000);
+    WritePrefix(Level, File, Line, Function);
+    va_list args;
+    va_start(args, Format);
+    vfctprintf(uart_wrapper, nullptr, Format, args);
+    va_end(args);
+}
+
+// C compatibility
+extern "C" NIF void SysDbgLockedWriteLine(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...)
+{
+    SmartTimeoutLock(DebuggerLock, 1000);
+    WritePrefix(Level, File, Line, Function);
+    va_list args;
+    va_start(args, Format);
+    vfctprintf(uart_wrapper, nullptr, Format, args);
+    va_end(args);
+    uart_wrapper('\n', nullptr);
+}
diff --git a/Kernel/Core/Disk.cpp b/Kernel/Core/Disk.cpp
new file mode 100644
index 00000000..0a734ad9
--- /dev/null
+++ b/Kernel/Core/Disk.cpp
@@ -0,0 +1,169 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <disk.hpp>
+
+#include <memory.hpp>
+#include <printf.h>
+
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+namespace Disk
+{
+    void Manager::FetchDisks(unsigned long DriverUID)
+    {
+        KernelCallback callback{};
+        callback.Reason = FetchReason;
+        DriverManager->IOCB(DriverUID, &callback);
+        this->AvailablePorts = callback.DiskCallback.Fetch.Ports;
+        this->BytesPerSector = callback.DiskCallback.Fetch.BytesPerSector;
+        debug("AvailablePorts:%ld BytesPerSector:%ld", this->AvailablePorts, this->BytesPerSector);
+
+        if (this->AvailablePorts <= 0)
+            return;
+
+        uint8_t *RWBuffer = (uint8_t *)KernelAllocator.RequestPages(TO_PAGES(this->BytesPerSector + 1));
+
+        for (unsigned char ItrPort = 0; ItrPort < this->AvailablePorts; ItrPort++)
+        {
+            Drive drive{};
+            sprintf(drive.Name, "sd%ld-%d", DriverUID, this->AvailablePorts);
+            debug("Drive Name: %s", drive.Name);
+            // TODO: Implement disk type detection. Very useful in the future.
+            drive.MechanicalDisk = true;
+
+            memset(RWBuffer, 0, this->BytesPerSector);
+            callback.Reason = ReceiveReason;
+            callback.DiskCallback.RW = {
+                .Sector = 0,
+                .SectorCount = 2,
+                .Port = ItrPort,
+                .Buffer = RWBuffer,
+                .Write = false,
+            };
+            DriverManager->IOCB(DriverUID, &callback);
+            memcpy(&drive.Table, RWBuffer, sizeof(PartitionTable));
+
+            /*
+            TODO: Add to devfs the disk
+            */
+
+            if (drive.Table.GPT.Signature == GPT_MAGIC)
+            {
+                drive.Style = GPT;
+                uint32_t Entries = 512 / drive.Table.GPT.EntrySize;
+                uint32_t Sectors = drive.Table.GPT.PartCount / Entries;
+                for (uint32_t Block = 0; Block < Sectors; Block++)
+                {
+                    memset(RWBuffer, 0, this->BytesPerSector);
+                    callback.Reason = ReceiveReason;
+                    callback.DiskCallback.RW = {
+                        .Sector = 2 + Block,
+                        .SectorCount = 1,
+                        .Port = ItrPort,
+                        .Buffer = RWBuffer,
+                        .Write = false,
+                    };
+                    DriverManager->IOCB(DriverUID, &callback);
+
+                    for (uint32_t e = 0; e < Entries; e++)
+                    {
+                        GUIDPartitionTablePartition GPTPartition = reinterpret_cast<GUIDPartitionTablePartition *>(RWBuffer)[e];
+                        if (GPTPartition.TypeLow || GPTPartition.TypeHigh)
+                        {
+                            Partition partition{};
+                            memcpy(partition.Label, GPTPartition.Label, sizeof(partition.Label));
+                            partition.StartLBA = GPTPartition.StartLBA;
+                            partition.EndLBA = GPTPartition.EndLBA;
+                            partition.Sectors = partition.EndLBA - partition.StartLBA;
+                            partition.Port = ItrPort;
+                            partition.Flags = Present;
+                            partition.Style = GPT;
+                            if (GPTPartition.Attributes & 1)
+                                partition.Flags |= EFISystemPartition;
+                            partition.Index = drive.Partitions.size();
+                            // why there is NUL (\0) between every char?????
+                            char PartName[72];
+                            memcpy(PartName, GPTPartition.Label, 72);
+                            for (int i = 0; i < 72; i++)
+                                if (PartName[i] == '\0')
+                                    PartName[i] = ' ';
+                            PartName[71] = '\0';
+                            trace("GPT partition \"%s\" found with %lld sectors", PartName, partition.Sectors);
+                            drive.Partitions.push_back(partition);
+
+                            // char *PartitionName = new char[64];
+                            // sprintf(PartitionName, "sd%ldp%ld", drives.size() - 1, partition.Index);
+
+                            /*
+                            TODO: Add to devfs the disk
+                            */
+
+                            // delete[] PartitionName;
+                        }
+                    }
+                }
+                trace("%d GPT partitions found.", drive.Partitions.size());
+            }
+            else if (drive.Table.MBR.Signature[0] == MBR_MAGIC0 && drive.Table.MBR.Signature[1] == MBR_MAGIC1)
+            {
+                drive.Style = MBR;
+                for (size_t p = 0; p < 4; p++)
+                    if (drive.Table.MBR.Partitions[p].LBAFirst != 0)
+                    {
+                        Partition partition{};
+                        partition.StartLBA = drive.Table.MBR.Partitions[p].LBAFirst;
+                        partition.EndLBA = drive.Table.MBR.Partitions[p].LBAFirst + drive.Table.MBR.Partitions[p].Sectors;
+                        partition.Sectors = drive.Table.MBR.Partitions[p].Sectors;
+                        partition.Port = ItrPort;
+                        partition.Flags = Present;
+                        partition.Style = MBR;
+                        partition.Index = drive.Partitions.size();
+                        trace("Partition \"%#llx\" found with %lld sectors.", drive.Table.MBR.UniqueID, partition.Sectors);
+                        drive.Partitions.push_back(partition);
+
+                        // char *PartitionName = new char[64];
+                        // sprintf(PartitionName, "sd%ldp%ld", drives.size() - 1, partition.Index);
+
+                        /*
+                        TODO: Add to devfs the disk
+                        */
+
+                        // delete[] PartitionName;
+                    }
+                trace("%d MBR partitions found.", drive.Partitions.size());
+            }
+            else
+                warn("No partition table found on port %d!", ItrPort);
+
+            drives.push_back(drive);
+        }
+
+        KernelAllocator.FreePages(RWBuffer, TO_PAGES(this->BytesPerSector + 1));
+    }
+
+    Manager::Manager()
+    {
+    }
+
+    Manager::~Manager()
+    {
+        debug("Destructor called");
+    }
+}
diff --git a/Kernel/Core/Driver/Driver.cpp b/Kernel/Core/Driver/Driver.cpp
new file mode 100644
index 00000000..0f392e37
--- /dev/null
+++ b/Kernel/Core/Driver/Driver.cpp
@@ -0,0 +1,343 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <driver.hpp>
+
+#include <memory.hpp>
+#include <ints.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../kernel.h"
+#include "../../DAPI.hpp"
+#include "../../Fex.hpp"
+#include "api.hpp"
+
+NewLock(DriverInitLock);
+NewLock(DriverInterruptLock);
+
+namespace Driver
+{
+    void Driver::Panic()
+    {
+#ifdef DEBUG
+        size_t DriversNum = Drivers.size();
+        debug("%ld drivers loaded, [DUIDs: %ld]", DriversNum, DriverUIDs);
+        debug("driver size %ld", DriversNum);
+#endif
+
+        foreach (auto drv in Drivers)
+        {
+            KernelCallback callback{};
+            callback.Reason = StopReason;
+            DriverManager->IOCB(drv.DriverUID, &callback);
+
+            for (size_t j = 0; j < sizeof(drv.InterruptHook) / sizeof(drv.InterruptHook[0]); j++)
+            {
+                if (!drv.InterruptHook[j])
+                    continue;
+                drv.InterruptHook[j]->Disable();
+                debug("Interrupt hook %#lx disabled", drv.InterruptHook[j]);
+            }
+        }
+    }
+
+    void Driver::UnloadAllDrivers()
+    {
+#ifdef DEBUG
+        size_t DriversNum = Drivers.size();
+        debug("%ld drivers loaded, [DUIDs: %ld]", DriversNum, DriverUIDs);
+        debug("driver size %ld", DriversNum);
+#endif
+
+        foreach (auto drv in Drivers)
+        {
+            KernelCallback callback{};
+            callback.Reason = StopReason;
+            debug("Stopping & unloading driver %ld [%#lx]", drv.DriverUID, drv.Address);
+            DriverManager->IOCB(drv.DriverUID, &callback);
+
+            for (size_t j = 0; j < sizeof(drv.InterruptHook) / sizeof(drv.InterruptHook[0]); j++)
+            {
+                if (!drv.InterruptHook[j])
+                    continue;
+                debug("Interrupt hook %#lx", drv.InterruptHook[j]);
+                delete drv.InterruptHook[j], drv.InterruptHook[j] = nullptr;
+            }
+            if (drv.MemTrk)
+                delete drv.MemTrk, drv.MemTrk = nullptr;
+        }
+        Drivers.clear();
+    }
+
+    bool Driver::UnloadDriver(unsigned long DUID)
+    {
+        debug("Searching for driver %ld", DUID);
+
+        foreach (auto drv in Drivers)
+        {
+            if (drv.DriverUID == DUID)
+            {
+                KernelCallback callback{};
+                callback.Reason = StopReason;
+                debug("Stopping and unloading driver %ld [%#lx]", drv.DriverUID, drv.Address);
+                this->IOCB(drv.DriverUID, &callback);
+
+                for (size_t j = 0; j < sizeof(drv.InterruptHook) / sizeof(drv.InterruptHook[0]); j++)
+                {
+                    if (!drv.InterruptHook[j])
+                        continue;
+                    debug("Interrupt hook %#lx", drv.InterruptHook[j]);
+                    delete drv.InterruptHook[j], drv.InterruptHook[j] = nullptr;
+                }
+                delete drv.MemTrk, drv.MemTrk = nullptr;
+                Drivers.remove(drv);
+                return true;
+            }
+        }
+        return false;
+    }
+
+    int Driver::IOCB(unsigned long DUID, void *KCB)
+    {
+        foreach (auto Drv in Drivers)
+        {
+            if (Drv.DriverUID == DUID)
+            {
+                FexExtended *DrvExtHdr = (FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS);
+                int ret = ((int (*)(void *))((uintptr_t)DrvExtHdr->Driver.Callback + (uintptr_t)Drv.Address))(KCB);
+                __sync;
+                return ret;
+            }
+        }
+        return -1;
+    }
+
+    DriverCode Driver::CallDriverEntryPoint(void *fex, void *KAPIAddress)
+    {
+        memcpy(KAPIAddress, &KernelAPITemplate, sizeof(KernelAPI));
+
+        ((KernelAPI *)KAPIAddress)->Info.Offset = (unsigned long)fex;
+        ((KernelAPI *)KAPIAddress)->Info.DriverUID = DriverUIDs++;
+        ((KernelAPI *)KAPIAddress)->Info.KernelDebug = DebuggerIsAttached;
+
+#ifdef DEBUG
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+        debug("DRIVER: %s HAS DRIVER ID %ld", fexExtended->Driver.Name, ((KernelAPI *)KAPIAddress)->Info.DriverUID);
+#endif
+
+        debug("Calling driver entry point ( %#lx %ld )", (unsigned long)fex, ((KernelAPI *)KAPIAddress)->Info.DriverUID);
+        int ret = ((int (*)(KernelAPI *))((uintptr_t)((Fex *)fex)->EntryPoint + (uintptr_t)fex))(((KernelAPI *)KAPIAddress));
+
+        if (DriverReturnCode::OK != ret)
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        return DriverCode::OK;
+    }
+
+    DriverCode Driver::LoadDriver(uintptr_t DriverAddress, uintptr_t Size)
+    {
+        Fex *DrvHdr = (Fex *)DriverAddress;
+        if (DrvHdr->Magic[0] != 'F' || DrvHdr->Magic[1] != 'E' || DrvHdr->Magic[2] != 'X' || DrvHdr->Magic[3] != '\0')
+        {
+            if (Size > 0x1000)
+            {
+                Fex *ElfDrvHdr = (Fex *)(DriverAddress + 0x1000);
+                if (ElfDrvHdr->Magic[0] != 'F' || ElfDrvHdr->Magic[1] != 'E' || ElfDrvHdr->Magic[2] != 'X' || ElfDrvHdr->Magic[3] != '\0')
+                    return DriverCode::INVALID_FEX_HEADER;
+                else
+                {
+                    debug("Fex Magic: \"%s\"; Type: %d; OS: %d; EntryPoint: %#lx", ElfDrvHdr->Magic, ElfDrvHdr->Type, ElfDrvHdr->OS, ElfDrvHdr->EntryPoint);
+
+                    if (ElfDrvHdr->Type == FexFormatType::FexFormatType_Driver)
+                    {
+                        FexExtended *ElfDrvExtHdr = (FexExtended *)((uintptr_t)ElfDrvHdr + EXTENDED_SECTION_ADDRESS);
+                        debug("Name: \"%s\"; Type: %d; Callback: %#lx", ElfDrvExtHdr->Driver.Name, ElfDrvExtHdr->Driver.Type, ElfDrvExtHdr->Driver.Callback);
+
+                        if (ElfDrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_PCI)
+                            return this->DriverLoadBindPCI(ElfDrvExtHdr, DriverAddress, Size, true);
+                        else if (ElfDrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_INTERRUPT)
+                            return this->DriverLoadBindInterrupt(ElfDrvExtHdr, DriverAddress, Size, true);
+                        else if (ElfDrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_PROCESS)
+                            return this->DriverLoadBindProcess(ElfDrvExtHdr, DriverAddress, Size, true);
+                        else if (ElfDrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_INPUT)
+                            return this->DriverLoadBindInput(ElfDrvExtHdr, DriverAddress, Size, true);
+                        else
+                            error("Unknown driver bind type: %d", ElfDrvExtHdr->Driver.Bind.Type);
+                    }
+                    else
+                        return DriverCode::NOT_DRIVER;
+                }
+            }
+            else
+                return DriverCode::INVALID_FEX_HEADER;
+        }
+        debug("Fex Magic: \"%s\"; Type: %d; OS: %d; EntryPoint: %#lx", DrvHdr->Magic, DrvHdr->Type, DrvHdr->OS, DrvHdr->EntryPoint);
+
+        if (DrvHdr->Type == FexFormatType::FexFormatType_Driver)
+        {
+            FexExtended *DrvExtHdr = (FexExtended *)((uintptr_t)DrvHdr + EXTENDED_SECTION_ADDRESS);
+            debug("Name: \"%s\"; Type: %d; Callback: %#lx", DrvExtHdr->Driver.Name, DrvExtHdr->Driver.Type, DrvExtHdr->Driver.Callback);
+
+            if (DrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_PCI)
+                return this->DriverLoadBindPCI(DrvExtHdr, DriverAddress, Size);
+            else if (DrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_INTERRUPT)
+                return this->DriverLoadBindInterrupt(DrvExtHdr, DriverAddress, Size);
+            else if (DrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_PROCESS)
+                return this->DriverLoadBindProcess(DrvExtHdr, DriverAddress, Size);
+            else if (DrvExtHdr->Driver.Bind.Type == DriverBindType::BIND_INPUT)
+                return this->DriverLoadBindInput(DrvExtHdr, DriverAddress, Size);
+            else
+                error("Unknown driver bind type: %d", DrvExtHdr->Driver.Bind.Type);
+        }
+        else
+            return DriverCode::NOT_DRIVER;
+        return DriverCode::ERROR;
+    }
+
+    Driver::Driver()
+    {
+        SmartCriticalSection(DriverInitLock);
+
+        std::string DriverConfigFile = Config.DriverDirectory;
+        DriverConfigFile << "/config.ini";
+        fixme("Loading driver config file: %s", DriverConfigFile.c_str());
+
+        VirtualFileSystem::File DriverDirectory = vfs->Open(Config.DriverDirectory);
+        if (DriverDirectory.IsOK())
+        {
+            foreach (auto driver in DriverDirectory.node->Children)
+                if (driver->Flags == VirtualFileSystem::NodeFlags::FILE)
+                    if (cwk_path_has_extension(driver->Name))
+                    {
+                        const char *extension;
+                        size_t extension_length;
+                        cwk_path_get_extension(driver->Name, &extension, &extension_length);
+                        debug("Driver: %s; Extension: %s", driver->Name, extension);
+                        if (strcmp(extension, ".fex") == 0 || strcmp(extension, ".elf") == 0)
+                        {
+                            uintptr_t ret = this->LoadDriver(driver->Address, driver->Length);
+                            char RetString[128];
+                            if (ret == DriverCode::OK)
+                                strncpy(RetString, "\e058C19OK", 10);
+                            else if (ret == DriverCode::NOT_AVAILABLE)
+                                strncpy(RetString, "\eFF7900NOT AVAILABLE", 21);
+                            else
+                                sprintf(RetString, "\eE85230FAILED (%#lx)", ret);
+                            KPrint("%s %s", driver->Name, RetString);
+                        }
+                    }
+        }
+        else
+        {
+            KPrint("\eE85230Failed to open driver directory: %s! (Status: %#lx)", Config.DriverDirectory, DriverDirectory.Status);
+            CPU::Stop();
+        }
+        vfs->Close(DriverDirectory);
+    }
+
+    Driver::~Driver()
+    {
+        debug("Destructor called");
+        this->UnloadAllDrivers();
+    }
+
+#if defined(a64)
+    SafeFunction void DriverInterruptHook::OnInterruptReceived(CPU::x64::TrapFrame *Frame)
+#elif defined(a32)
+    SafeFunction void DriverInterruptHook::OnInterruptReceived(CPU::x32::TrapFrame *Frame)
+#elif defined(aa64)
+    SafeFunction void DriverInterruptHook::OnInterruptReceived(CPU::aarch64::TrapFrame *Frame)
+#endif
+    {
+        SmartLock(DriverInterruptLock); /* Lock in case of multiple interrupts firing at the same time */
+        if (!this->Enabled)
+        {
+            debug("Interrupt hook is not enabled");
+            return;
+        }
+
+        if (!Handle.InterruptCallback)
+        {
+#if defined(a86)
+            uint64_t IntNum = Frame->InterruptNumber - 32;
+#elif defined(aa64)
+            uint64_t IntNum = Frame->InterruptNumber;
+#endif
+            warn("Interrupt callback for %ld is not set for driver %ld!", IntNum, Handle.DriverUID);
+            return;
+        }
+        CPURegisters regs;
+#if defined(a64)
+        regs.r15 = Frame->r15;
+        regs.r14 = Frame->r14;
+        regs.r13 = Frame->r13;
+        regs.r12 = Frame->r12;
+        regs.r11 = Frame->r11;
+        regs.r10 = Frame->r10;
+        regs.r9 = Frame->r9;
+        regs.r8 = Frame->r8;
+
+        regs.rbp = Frame->rbp;
+        regs.rdi = Frame->rdi;
+        regs.rsi = Frame->rsi;
+        regs.rdx = Frame->rdx;
+        regs.rcx = Frame->rcx;
+        regs.rbx = Frame->rbx;
+        regs.rax = Frame->rax;
+
+        regs.InterruptNumber = Frame->InterruptNumber;
+        regs.ErrorCode = Frame->ErrorCode;
+        regs.rip = Frame->rip;
+        regs.cs = Frame->cs;
+        regs.rflags = Frame->rflags.raw;
+        regs.rsp = Frame->rsp;
+        regs.ss = Frame->ss;
+#elif defined(a32)
+        regs.ebp = Frame->ebp;
+        regs.edi = Frame->edi;
+        regs.esi = Frame->esi;
+        regs.edx = Frame->edx;
+        regs.ecx = Frame->ecx;
+        regs.ebx = Frame->ebx;
+        regs.eax = Frame->eax;
+
+        regs.InterruptNumber = Frame->InterruptNumber;
+        regs.ErrorCode = Frame->ErrorCode;
+        regs.eip = Frame->eip;
+        regs.cs = Frame->cs;
+        regs.eflags = Frame->eflags.raw;
+        regs.esp = Frame->esp;
+        regs.ss = Frame->ss;
+#elif defined(aa64)
+#endif
+        ((int (*)(void *))(Handle.InterruptCallback))(&regs);
+        UNUSED(Frame);
+    }
+
+    DriverInterruptHook::DriverInterruptHook(int Interrupt, DriverFile Handle) : Interrupts::Handler(Interrupt)
+    {
+        this->Handle = Handle;
+#if defined(a86)
+        trace("Interrupt %d hooked to driver %ld", Interrupt, Handle.DriverUID);
+#elif defined(aa64)
+        trace("Interrupt %d hooked to driver %ld", Interrupt, Handle.DriverUID);
+#endif
+    }
+}
diff --git a/Kernel/Core/Driver/DriverAPI.cpp b/Kernel/Core/Driver/DriverAPI.cpp
new file mode 100644
index 00000000..e9e26407
--- /dev/null
+++ b/Kernel/Core/Driver/DriverAPI.cpp
@@ -0,0 +1,203 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <driver.hpp>
+
+#include <dumper.hpp>
+#include <lock.hpp>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+#include "api.hpp"
+
+// show debug messages
+// #define DEBUG_DRIVER_API 1
+
+#ifdef DEBUG_DRIVER_API
+#define drvdbg(m, ...) debug(m, ##__VA_ARGS__)
+#else
+#define drvdbg(m, ...)
+#endif
+
+NewLock(DriverDisplayPrintLock);
+
+void DriverDebugPrint(char *String, unsigned long DriverUID) { trace("[%ld] %s", DriverUID, String); }
+
+void DriverDisplayPrint(char *String)
+{
+    SmartLock(DriverDisplayPrintLock);
+    for (unsigned long i = 0; i < strlen(String); i++)
+        Display->Print(String[i], 0, true);
+}
+
+void *RequestPage(unsigned long Size)
+{
+    void *ret = KernelAllocator.RequestPages(Size + 1);
+    drvdbg("Allocated %ld pages (%#lx-%#lx)", Size, (unsigned long)ret, (unsigned long)ret + FROM_PAGES(Size));
+    return ret;
+}
+
+void FreePage(void *Page, unsigned long Size)
+{
+    drvdbg("Freeing %ld pages (%#lx-%#lx)", Size, (unsigned long)Page, (unsigned long)Page + FROM_PAGES(Size));
+    KernelAllocator.FreePages(Page, Size + 1);
+}
+
+void MapMemory(void *VirtualAddress, void *PhysicalAddress, unsigned long Flags)
+{
+    SmartLock(DriverDisplayPrintLock);
+    drvdbg("Mapping %#lx to %#lx with flags %#lx...", (unsigned long)VirtualAddress, (unsigned long)PhysicalAddress, Flags);
+    Memory::Virtual(KernelPageTable).Map(VirtualAddress, PhysicalAddress, Flags);
+}
+
+void UnmapMemory(void *VirtualAddress)
+{
+    SmartLock(DriverDisplayPrintLock);
+    drvdbg("Unmapping %#lx...", (unsigned long)VirtualAddress);
+    Memory::Virtual(KernelPageTable).Unmap(VirtualAddress);
+}
+
+void *Drivermemcpy(void *Destination, void *Source, unsigned long Size)
+{
+    SmartLock(DriverDisplayPrintLock);
+    drvdbg("Copying %ld bytes from %#lx-%#lx to %#lx-%#lx...", Size,
+           (unsigned long)Source, (unsigned long)Source + Size,
+           (unsigned long)Destination, (unsigned long)Destination + Size);
+    return memcpy(Destination, Source, Size);
+}
+
+void *Drivermemset(void *Destination, int Value, unsigned long Size)
+{
+    SmartLock(DriverDisplayPrintLock);
+    drvdbg("Setting value %#x at %#lx-%#lx (%ld bytes)...", Value,
+           (unsigned long)Destination, (unsigned long)Destination + Size,
+           Size);
+    return memset(Destination, Value, Size);
+}
+
+void DriverNetSend(unsigned int DriverID, unsigned char *Data, unsigned short Size)
+{
+    // This is useless I guess...
+    if (NIManager)
+        NIManager->DrvSend(DriverID, Data, Size);
+}
+
+void DriverNetReceive(unsigned int DriverID, unsigned char *Data, unsigned short Size)
+{
+    if (NIManager)
+        NIManager->DrvReceive(DriverID, Data, Size);
+}
+
+void DriverAHCIDiskRead(unsigned int DriverID, unsigned long Sector, unsigned char *Data, unsigned int SectorCount, unsigned char Port)
+{
+    DumpData("DriverDiskRead", Data, SectorCount * 512);
+    UNUSED(DriverID);
+    UNUSED(Sector);
+    UNUSED(Port);
+}
+
+void DriverAHCIDiskWrite(unsigned int DriverID, unsigned long Sector, unsigned char *Data, unsigned int SectorCount, unsigned char Port)
+{
+    DumpData("DriverDiskWrite", Data, SectorCount * 512);
+    UNUSED(DriverID);
+    UNUSED(Sector);
+    UNUSED(Port);
+}
+
+char *DriverPCIGetDeviceName(unsigned int VendorID, unsigned int DeviceID)
+{
+    UNUSED(VendorID);
+    UNUSED(DeviceID);
+    return (char *)"Unknown";
+}
+
+unsigned int DriverGetWidth()
+{
+    /* TODO: We won't rely only on display buffers, what about graphics drivers and changing resolutions? */
+    return Display->GetBuffer(0)->Width;
+}
+
+unsigned int DriverGetHeight()
+{
+    /* TODO: We won't rely only on display buffers, what about graphics drivers and changing resolutions? */
+    return Display->GetBuffer(0)->Height;
+}
+
+void DriverSleep(unsigned long Milliseconds)
+{
+    SmartLock(DriverDisplayPrintLock);
+    drvdbg("Sleeping for %ld milliseconds...", Milliseconds);
+    if (TaskManager)
+        TaskManager->Sleep(Milliseconds);
+    else
+        TimeManager->Sleep(Milliseconds, Time::Units::Milliseconds);
+}
+
+int Driversprintf(char *Buffer, const char *Format, ...)
+{
+    va_list args;
+    va_start(args, Format);
+    int ret = vsprintf(Buffer, Format, args);
+    va_end(args);
+    return ret;
+}
+
+KernelAPI KernelAPITemplate = {
+    .Version = {
+        .Major = 0,
+        .Minor = 0,
+        .Patch = 1},
+    .Info = {
+        .Offset = 0,
+        .DriverUID = 0,
+        .KernelDebug = false,
+    },
+    .Memory = {
+        .PageSize = PAGE_SIZE,
+        .RequestPage = RequestPage,
+        .FreePage = FreePage,
+        .Map = MapMemory,
+        .Unmap = UnmapMemory,
+    },
+    .PCI = {
+        .GetDeviceName = DriverPCIGetDeviceName,
+    },
+    .Util = {
+        .DebugPrint = DriverDebugPrint,
+        .DisplayPrint = DriverDisplayPrint,
+        .memcpy = Drivermemcpy,
+        .memset = Drivermemset,
+        .Sleep = DriverSleep,
+        .sprintf = Driversprintf,
+    },
+    .Command = {
+        .Network = {
+            .SendPacket = DriverNetSend,
+            .ReceivePacket = DriverNetReceive,
+        },
+        .Disk = {
+            .AHCI = {
+                .ReadSector = DriverAHCIDiskRead,
+                .WriteSector = DriverAHCIDiskWrite,
+            },
+        },
+    },
+    .Display = {
+        .GetWidth = DriverGetWidth,
+        .GetHeight = DriverGetHeight,
+    },
+};
diff --git a/Kernel/Core/Driver/DriverBinding/BindInput.cpp b/Kernel/Core/Driver/DriverBinding/BindInput.cpp
new file mode 100644
index 00000000..b93d02af
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/BindInput.cpp
@@ -0,0 +1,73 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../kernel.h"
+#include "../../../DAPI.hpp"
+#include "../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::DriverLoadBindInput(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf)
+    {
+        UNUSED(DrvExtHdr);
+        UNUSED(IsElf);
+        Memory::MemMgr *mem = new Memory::MemMgr(nullptr, TaskManager->GetCurrentProcess()->memDirectory);
+        Fex *fex = (Fex *)mem->RequestPages(TO_PAGES(Size + 1));
+        memcpy(fex, (void *)DriverAddress, Size);
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+        debug("Driver allocated at %#lx-%#lx", fex, (uintptr_t)fex + Size);
+#ifdef DEBUG
+        uint8_t *result = md5File((uint8_t *)fex, Size);
+        debug("MD5: %02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x",
+              result[0], result[1], result[2], result[3], result[4], result[5], result[6], result[7],
+              result[8], result[9], result[10], result[11], result[12], result[13], result[14], result[15]);
+        kfree(result);
+#endif
+        KernelAPI *KAPI = (KernelAPI *)mem->RequestPages(TO_PAGES(sizeof(KernelAPI) + 1));
+
+        if (CallDriverEntryPoint(fex, KAPI) != DriverCode::OK)
+        {
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+        debug("Starting driver %s (offset: %#lx)", fexExtended->Driver.Name, fex);
+
+        switch (fexExtended->Driver.Type)
+        {
+        case FexDriverType::FexDriverType_Input:
+            return BindInputInput(mem, fex);
+        default:
+        {
+            warn("Unknown driver type: %d", fexExtended->Driver.Type);
+            delete mem, mem = nullptr;
+            return DriverCode::UNKNOWN_DRIVER_TYPE;
+        }
+        }
+
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/BindInterrupt.cpp b/Kernel/Core/Driver/DriverBinding/BindInterrupt.cpp
new file mode 100644
index 00000000..7bab3886
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/BindInterrupt.cpp
@@ -0,0 +1,85 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../kernel.h"
+#include "../../../DAPI.hpp"
+#include "../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::DriverLoadBindInterrupt(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf)
+    {
+        UNUSED(DrvExtHdr);
+        UNUSED(IsElf);
+        Memory::MemMgr *mem = new Memory::MemMgr(nullptr, TaskManager->GetCurrentProcess()->memDirectory);
+        Fex *fex = (Fex *)mem->RequestPages(TO_PAGES(Size + 1));
+        memcpy(fex, (void *)DriverAddress, Size);
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+        debug("Driver allocated at %#lx-%#lx", fex, (uintptr_t)fex + Size);
+#ifdef DEBUG
+        uint8_t *result = md5File((uint8_t *)fex, Size);
+        debug("MD5: %02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x",
+              result[0], result[1], result[2], result[3], result[4], result[5], result[6], result[7],
+              result[8], result[9], result[10], result[11], result[12], result[13], result[14], result[15]);
+        kfree(result);
+#endif
+        KernelAPI *KAPI = (KernelAPI *)mem->RequestPages(TO_PAGES(sizeof(KernelAPI) + 1));
+
+        if (CallDriverEntryPoint(fex, KAPI) != DriverCode::OK)
+        {
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+        debug("Starting driver %s (offset: %#lx)", fexExtended->Driver.Name, fex);
+
+        switch (fexExtended->Driver.Type)
+        {
+        case FexDriverType::FexDriverType_Generic:
+            return BindInterruptGeneric(mem, fex);
+        case FexDriverType::FexDriverType_Display:
+            return BindInterruptDisplay(mem, fex);
+        case FexDriverType::FexDriverType_Network:
+            return BindInterruptNetwork(mem, fex);
+        case FexDriverType::FexDriverType_Storage:
+            return BindInterruptStorage(mem, fex);
+        case FexDriverType::FexDriverType_FileSystem:
+            return BindInterruptFileSystem(mem, fex);
+        case FexDriverType::FexDriverType_Input:
+            return BindInterruptInput(mem, fex);
+        case FexDriverType::FexDriverType_Audio:
+            return BindInterruptAudio(mem, fex);
+        default:
+        {
+            warn("Unknown driver type: %d", fexExtended->Driver.Type);
+            delete mem, mem = nullptr;
+            return DriverCode::UNKNOWN_DRIVER_TYPE;
+        }
+        }
+
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/BindPCI.cpp b/Kernel/Core/Driver/DriverBinding/BindPCI.cpp
new file mode 100644
index 00000000..c432885f
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/BindPCI.cpp
@@ -0,0 +1,201 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../kernel.h"
+#include "../../../DAPI.hpp"
+#include "../../../Fex.hpp"
+
+namespace Driver
+{
+    void Driver::MapPCIAddresses(PCI::PCIDeviceHeader *PCIDevice)
+    {
+        debug("Header Type: %d", PCIDevice->HeaderType);
+        switch (PCIDevice->HeaderType)
+        {
+        case 0: // PCI Header 0
+        {
+            uint32_t BAR[6] = {0};
+            size_t BARsSize[6] = {0};
+
+            BAR[0] = ((PCI::PCIHeader0 *)PCIDevice)->BAR0;
+            BAR[1] = ((PCI::PCIHeader0 *)PCIDevice)->BAR1;
+            BAR[2] = ((PCI::PCIHeader0 *)PCIDevice)->BAR2;
+            BAR[3] = ((PCI::PCIHeader0 *)PCIDevice)->BAR3;
+            BAR[4] = ((PCI::PCIHeader0 *)PCIDevice)->BAR4;
+            BAR[5] = ((PCI::PCIHeader0 *)PCIDevice)->BAR5;
+
+#ifdef DEBUG
+            uintptr_t BAR_Type = BAR[0] & 1;
+            uintptr_t BAR_IOBase = BAR[1] & (~3);
+            uintptr_t BAR_MemoryBase = BAR[0] & (~15);
+
+            debug("Type: %d; IOBase: %#lx; MemoryBase: %#lx", BAR_Type, BAR_IOBase, BAR_MemoryBase);
+#endif
+
+            /* BARs Size */
+            for (short i = 0; i < 6; i++)
+            {
+                if (BAR[i] == 0)
+                    continue;
+
+                if ((BAR[i] & 1) == 0) // Memory Base
+                {
+                    ((PCI::PCIHeader0 *)PCIDevice)->BAR0 = 0xFFFFFFFF;
+                    size_t size = ((PCI::PCIHeader0 *)PCIDevice)->BAR0;
+                    ((PCI::PCIHeader0 *)PCIDevice)->BAR0 = BAR[i];
+                    BARsSize[i] = size & (~15);
+                    BARsSize[i] = ~BARsSize[i] + 1;
+                    BARsSize[i] = BARsSize[i] & 0xFFFFFFFF;
+                    debug("BAR%d %#lx size: %d", i, BAR[i], BARsSize[i]);
+                }
+                else if ((BAR[i] & 1) == 1) // I/O Base
+                {
+                    ((PCI::PCIHeader0 *)PCIDevice)->BAR1 = 0xFFFFFFFF;
+                    size_t size = ((PCI::PCIHeader0 *)PCIDevice)->BAR1;
+                    ((PCI::PCIHeader0 *)PCIDevice)->BAR1 = BAR[i];
+                    BARsSize[i] = size & (~3);
+                    BARsSize[i] = ~BARsSize[i] + 1;
+                    BARsSize[i] = BARsSize[i] & 0xFFFF;
+                    debug("BAR%d %#lx size: %d", i, BAR[i], BARsSize[i]);
+                }
+            }
+
+            /* Mapping the BARs */
+            for (short i = 0; i < 6; i++)
+            {
+                if (BAR[i] == 0)
+                    continue;
+
+                if ((BAR[i] & 1) == 0) // Memory Base
+                {
+                    uintptr_t BARBase = BAR[i] & (~15);
+                    size_t BARSize = BARsSize[i];
+
+                    debug("Mapping BAR%d %#lx-%#lx", i, BARBase, BARBase + BARSize);
+                    Memory::Virtual().Map((void *)BARBase, (void *)BARBase, BARSize, Memory::PTFlag::RW | Memory::PTFlag::PWT);
+                }
+                else if ((BAR[i] & 1) == 1) // I/O Base
+                {
+                    uintptr_t BARBase = BAR[i] & (~3);
+                    size_t BARSize = BARsSize[i];
+
+                    debug("Mapping BAR%d %#x-%#x", i, BARBase, BARBase + BARSize);
+                    Memory::Virtual().Map((void *)BARBase, (void *)BARBase, BARSize, Memory::PTFlag::RW | Memory::PTFlag::PWT);
+                }
+            }
+            break;
+        }
+        case 1: // PCI Header 1 (PCI-to-PCI Bridge)
+        {
+            fixme("PCI Header 1 (PCI-to-PCI Bridge) not implemented yet");
+            break;
+        }
+        case 2: // PCI Header 2 (PCI-to-CardBus Bridge)
+        {
+            fixme("PCI Header 2 (PCI-to-CardBus Bridge) not implemented yet");
+            break;
+        }
+        default:
+        {
+            error("Unknown header type %d", PCIDevice->HeaderType);
+            return;
+        }
+        }
+    }
+
+    DriverCode Driver::DriverLoadBindPCI(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf)
+    {
+        UNUSED(IsElf);
+        for (unsigned long Vidx = 0; Vidx < sizeof(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.VendorID) / sizeof(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.VendorID[0]); Vidx++)
+        {
+            for (unsigned long Didx = 0; Didx < sizeof(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.DeviceID) / sizeof(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.DeviceID[0]); Didx++)
+            {
+                if (Vidx >= sizeof(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.VendorID) && Didx >= sizeof(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.DeviceID))
+                    break;
+
+                if (((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.VendorID[Vidx] == 0 || ((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.DeviceID[Didx] == 0)
+                    continue;
+
+                std::vector<PCI::PCIDeviceHeader *> devices = PCIManager->FindPCIDevice(((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.VendorID[Vidx], ((FexExtended *)DrvExtHdr)->Driver.Bind.PCI.DeviceID[Didx]);
+                if (devices.size() == 0)
+                    continue;
+
+                foreach (auto PCIDevice in devices)
+                {
+                    debug("[%ld] VendorID: %#x; DeviceID: %#x", devices.size(), PCIDevice->VendorID, PCIDevice->DeviceID);
+                    Memory::MemMgr *mem = new Memory::MemMgr(nullptr, TaskManager->GetCurrentProcess()->memDirectory);
+                    Fex *fex = (Fex *)mem->RequestPages(TO_PAGES(Size + 1));
+                    memcpy(fex, (void *)DriverAddress, Size);
+                    FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+                    debug("Driver allocated at %#lx-%#lx", fex, (uintptr_t)fex + Size);
+#ifdef DEBUG
+                    uint8_t *result = md5File((uint8_t *)fex, Size);
+                    debug("MD5: %02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x",
+                          result[0], result[1], result[2], result[3], result[4], result[5], result[6], result[7],
+                          result[8], result[9], result[10], result[11], result[12], result[13], result[14], result[15]);
+                    kfree(result);
+#endif
+                    KernelAPI *KAPI = (KernelAPI *)mem->RequestPages(TO_PAGES(sizeof(KernelAPI) + 1));
+
+                    if (CallDriverEntryPoint(fex, KAPI) != DriverCode::OK)
+                    {
+                        delete mem, mem = nullptr;
+                        return DriverCode::DRIVER_RETURNED_ERROR;
+                    }
+                    debug("Starting driver %s", fexExtended->Driver.Name);
+
+                    MapPCIAddresses(PCIDevice);
+
+                    switch (fexExtended->Driver.Type)
+                    {
+                    case FexDriverType::FexDriverType_Generic:
+                        return BindPCIGeneric(mem, fex, PCIDevice);
+                    case FexDriverType::FexDriverType_Display:
+                        return BindPCIDisplay(mem, fex, PCIDevice);
+                    case FexDriverType::FexDriverType_Network:
+                        return BindPCINetwork(mem, fex, PCIDevice);
+                    case FexDriverType::FexDriverType_Storage:
+                        return BindPCIStorage(mem, fex, PCIDevice);
+                    case FexDriverType::FexDriverType_FileSystem:
+                        return BindPCIFileSystem(mem, fex, PCIDevice);
+                    case FexDriverType::FexDriverType_Input:
+                        return BindPCIInput(mem, fex, PCIDevice);
+                    case FexDriverType::FexDriverType_Audio:
+                        return BindPCIAudio(mem, fex, PCIDevice);
+                    default:
+                    {
+                        warn("Unknown driver type: %d", fexExtended->Driver.Type);
+                        delete mem, mem = nullptr;
+                        return DriverCode::UNKNOWN_DRIVER_TYPE;
+                    }
+                    }
+                }
+            }
+        }
+        return DriverCode::PCI_DEVICE_NOT_FOUND;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/BindProcess.cpp b/Kernel/Core/Driver/DriverBinding/BindProcess.cpp
new file mode 100644
index 00000000..98cadbfe
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/BindProcess.cpp
@@ -0,0 +1,42 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../kernel.h"
+#include "../../../DAPI.hpp"
+#include "../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::DriverLoadBindProcess(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf)
+    {
+        fixme("Process driver: %s", ((FexExtended *)DrvExtHdr)->Driver.Name);
+        UNUSED(Size);
+        UNUSED(DriverAddress);
+        UNUSED(IsElf);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Audio.cpp b/Kernel/Core/Driver/DriverBinding/Input/Audio.cpp
new file mode 100644
index 00000000..659680a2
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Audio.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputAudio(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Display.cpp b/Kernel/Core/Driver/DriverBinding/Input/Display.cpp
new file mode 100644
index 00000000..7b4d6979
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Display.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputDisplay(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Filesystem.cpp b/Kernel/Core/Driver/DriverBinding/Input/Filesystem.cpp
new file mode 100644
index 00000000..140f038c
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Filesystem.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputFileSystem(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Generic.cpp b/Kernel/Core/Driver/DriverBinding/Input/Generic.cpp
new file mode 100644
index 00000000..5a17fea1
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Generic.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputGeneric(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Input.cpp b/Kernel/Core/Driver/DriverBinding/Input/Input.cpp
new file mode 100644
index 00000000..11169046
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Input.cpp
@@ -0,0 +1,67 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputInput(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+        KernelCallback KCallback{};
+
+        fixme("Input driver: %s", fexExtended->Driver.Name);
+        KCallback.RawPtr = nullptr;
+        KCallback.Reason = CallbackReason::ConfigurationReason;
+        int CallbackRet = ((int (*)(KernelCallback *))((uintptr_t)fexExtended->Driver.Callback + (uintptr_t)fex))(&KCallback);
+        if (CallbackRet == DriverReturnCode::NOT_IMPLEMENTED)
+        {
+            delete mem, mem = nullptr;
+            error("Driver %s is not implemented", fexExtended->Driver.Name);
+            return DriverCode::NOT_IMPLEMENTED;
+        }
+        else if (CallbackRet != DriverReturnCode::OK)
+        {
+            delete mem, mem = nullptr;
+            error("Driver %s returned error %d", fexExtended->Driver.Name, CallbackRet);
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+
+        fixme("Input driver: %s", fexExtended->Driver.Name);
+
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .MemTrk = mem,
+        };
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Network.cpp b/Kernel/Core/Driver/DriverBinding/Input/Network.cpp
new file mode 100644
index 00000000..4ddbe241
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Network.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputNetwork(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Input/Storage.cpp b/Kernel/Core/Driver/DriverBinding/Input/Storage.cpp
new file mode 100644
index 00000000..d051fd10
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Input/Storage.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInputStorage(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Audio.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Audio.cpp
new file mode 100644
index 00000000..bdf20d3a
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Audio.cpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptAudio(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Audio driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Display.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Display.cpp
new file mode 100644
index 00000000..8db09606
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Display.cpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptDisplay(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Display driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Filesystem.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Filesystem.cpp
new file mode 100644
index 00000000..751920af
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Filesystem.cpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptFileSystem(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Filesystem driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Generic.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Generic.cpp
new file mode 100644
index 00000000..1a01cbd2
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Generic.cpp
@@ -0,0 +1,88 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptGeneric(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Generic driver: %s", fexExtended->Driver.Name);
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .InterruptCallback = (void *)((uintptr_t)fex + (uintptr_t)fexExtended->Driver.InterruptCallback),
+            .MemTrk = mem,
+        };
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Input.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Input.cpp
new file mode 100644
index 00000000..520630f1
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Input.cpp
@@ -0,0 +1,124 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptInput(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        debug("Searching for conflicting drivers...");
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if ((fe->Driver.TypeFlags & FexDriverInputTypes_Mouse &&
+                     fexExtended->Driver.TypeFlags & FexDriverInputTypes_Mouse) ||
+                    (fe->Driver.TypeFlags & FexDriverInputTypes_Keyboard &&
+                     fexExtended->Driver.TypeFlags & FexDriverInputTypes_Keyboard))
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    if (fe->Driver.OverrideOnConflict)
+                        return DriverCode::DRIVER_CONFLICT;
+
+                    DriversToRemove.push_back(Drv.DriverUID);
+                }
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if ((fe->Driver.TypeFlags & FexDriverInputTypes_Mouse &&
+                     fexExtended->Driver.TypeFlags & FexDriverInputTypes_Mouse) ||
+                    (fe->Driver.TypeFlags & FexDriverInputTypes_Keyboard &&
+                     fexExtended->Driver.TypeFlags & FexDriverInputTypes_Keyboard))
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    if (fe->Driver.OverrideOnConflict)
+                        return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .InterruptCallback = (void *)((uintptr_t)fex + (uintptr_t)fexExtended->Driver.InterruptCallback),
+            .MemTrk = mem,
+        };
+        if (fexExtended->Driver.InterruptCallback)
+        {
+            for (unsigned long i = 0; i < sizeof(fexExtended->Driver.Bind.Interrupt.Vector) / sizeof(fexExtended->Driver.Bind.Interrupt.Vector[0]); i++)
+            {
+                if (fexExtended->Driver.Bind.Interrupt.Vector[i] == 0)
+                    break;
+                DrvFile.InterruptHook[i] = new DriverInterruptHook(fexExtended->Driver.Bind.Interrupt.Vector[i], DrvFile);
+            }
+        }
+
+        KernelCallback KCallback{};
+        KCallback.RawPtr = nullptr;
+        KCallback.Reason = CallbackReason::ConfigurationReason;
+        int CallbackRet = ((int (*)(KernelCallback *))((uintptr_t)fexExtended->Driver.Callback + (uintptr_t)fex))(&KCallback);
+
+        if (CallbackRet == DriverReturnCode::NOT_IMPLEMENTED)
+        {
+            error("Driver %s is not implemented", fexExtended->Driver.Name);
+            delete mem, mem = nullptr;
+            return DriverCode::NOT_IMPLEMENTED;
+        }
+        else if (CallbackRet != DriverReturnCode::OK)
+        {
+            error("Driver %s returned error %d", fexExtended->Driver.Name, CallbackRet);
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Network.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Network.cpp
new file mode 100644
index 00000000..8e718933
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Network.cpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptNetwork(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Network driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Interrupt/Storage.cpp b/Kernel/Core/Driver/DriverBinding/Interrupt/Storage.cpp
new file mode 100644
index 00000000..470cf71f
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Interrupt/Storage.cpp
@@ -0,0 +1,115 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindInterruptStorage(Memory::MemMgr *mem, void *fex)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .InterruptCallback = (void *)((uintptr_t)fex + (uintptr_t)fexExtended->Driver.InterruptCallback),
+            .MemTrk = mem,
+        };
+        if (fexExtended->Driver.InterruptCallback)
+        {
+            for (unsigned long i = 0; i < sizeof(fexExtended->Driver.Bind.Interrupt.Vector) / sizeof(fexExtended->Driver.Bind.Interrupt.Vector[0]); i++)
+            {
+                if (fexExtended->Driver.Bind.Interrupt.Vector[i] == 0)
+                    break;
+                DrvFile.InterruptHook[i] = new DriverInterruptHook(fexExtended->Driver.Bind.Interrupt.Vector[i], DrvFile);
+            }
+        }
+
+        KernelCallback KCallback{};
+        KCallback.RawPtr = nullptr;
+        KCallback.Reason = CallbackReason::ConfigurationReason;
+        int CallbackRet = ((int (*)(KernelCallback *))((uintptr_t)fexExtended->Driver.Callback + (uintptr_t)fex))(&KCallback);
+
+        if (CallbackRet == DriverReturnCode::NOT_IMPLEMENTED)
+        {
+            error("Driver %s is not implemented", fexExtended->Driver.Name);
+            delete mem, mem = nullptr;
+            return DriverCode::NOT_IMPLEMENTED;
+        }
+        else if (CallbackRet != DriverReturnCode::OK)
+        {
+            error("Driver %s returned error %d", fexExtended->Driver.Name, CallbackRet);
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Audio.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Audio.cpp
new file mode 100644
index 00000000..1e657572
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Audio.cpp
@@ -0,0 +1,110 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCIAudio(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .InterruptCallback = (void *)((uintptr_t)fex + (uintptr_t)fexExtended->Driver.InterruptCallback),
+            .MemTrk = mem,
+        };
+        if (fexExtended->Driver.InterruptCallback)
+            DrvFile.InterruptHook[0] = new DriverInterruptHook(((int)((PCI::PCIHeader0 *)PCIDevice)->InterruptLine), DrvFile);
+
+        KernelCallback KCallback{};
+        KCallback.RawPtr = PCIDevice;
+        KCallback.Reason = CallbackReason::ConfigurationReason;
+        int CallbackRet = ((int (*)(KernelCallback *))((uintptr_t)fexExtended->Driver.Callback + (uintptr_t)fex))(&KCallback);
+
+        if (CallbackRet == DriverReturnCode::NOT_IMPLEMENTED)
+        {
+            error("Driver %s is not implemented", fexExtended->Driver.Name);
+            delete mem, mem = nullptr;
+            return DriverCode::NOT_IMPLEMENTED;
+        }
+        else if (CallbackRet == DriverReturnCode::OK)
+            trace("Device found for driver: %s", fexExtended->Driver.Name);
+        else
+        {
+            error("Driver %s returned error %d", fexExtended->Driver.Name, CallbackRet);
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Display.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Display.cpp
new file mode 100644
index 00000000..46fa64cd
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Display.cpp
@@ -0,0 +1,82 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCIDisplay(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        UNUSED(PCIDevice);
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Display driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Filesystem.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Filesystem.cpp
new file mode 100644
index 00000000..decd4757
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Filesystem.cpp
@@ -0,0 +1,82 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCIFileSystem(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        UNUSED(PCIDevice);
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Filesystem driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Generic.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Generic.cpp
new file mode 100644
index 00000000..4dba1562
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Generic.cpp
@@ -0,0 +1,82 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCIGeneric(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        UNUSED(PCIDevice);
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Generic driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Input.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Input.cpp
new file mode 100644
index 00000000..01e4b95f
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Input.cpp
@@ -0,0 +1,82 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCIInput(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        UNUSED(PCIDevice);
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        fixme("Input driver: %s", fexExtended->Driver.Name);
+        delete mem, mem = nullptr;
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Network.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Network.cpp
new file mode 100644
index 00000000..5e28fdcc
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Network.cpp
@@ -0,0 +1,110 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCINetwork(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .InterruptCallback = (void *)((uintptr_t)fex + (uintptr_t)fexExtended->Driver.InterruptCallback),
+            .MemTrk = mem,
+        };
+        if (fexExtended->Driver.InterruptCallback)
+            DrvFile.InterruptHook[0] = new DriverInterruptHook(((int)((PCI::PCIHeader0 *)PCIDevice)->InterruptLine), DrvFile);
+
+        KernelCallback KCallback{};
+        KCallback.RawPtr = PCIDevice;
+        KCallback.Reason = CallbackReason::ConfigurationReason;
+        int CallbackRet = ((int (*)(KernelCallback *))((uintptr_t)fexExtended->Driver.Callback + (uintptr_t)fex))(&KCallback);
+
+        if (CallbackRet == DriverReturnCode::NOT_IMPLEMENTED)
+        {
+            error("Driver %s is not implemented", fexExtended->Driver.Name);
+            delete mem, mem = nullptr;
+            return DriverCode::NOT_IMPLEMENTED;
+        }
+        else if (CallbackRet == DriverReturnCode::OK)
+            trace("Device found for driver: %s", fexExtended->Driver.Name);
+        else
+        {
+            error("Driver %s returned error %d", fexExtended->Driver.Name, CallbackRet);
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/PCI/Storage.cpp b/Kernel/Core/Driver/DriverBinding/PCI/Storage.cpp
new file mode 100644
index 00000000..2e3a3eaa
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/PCI/Storage.cpp
@@ -0,0 +1,110 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindPCIStorage(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice)
+    {
+        FexExtended *fexExtended = (FexExtended *)((uintptr_t)fex + EXTENDED_SECTION_ADDRESS);
+
+        if (fexExtended->Driver.OverrideOnConflict)
+        {
+            std::vector<uint64_t> DriversToRemove = std::vector<uint64_t>();
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+
+                DriversToRemove.push_back(Drv.DriverUID);
+            }
+
+            foreach (auto DrvID in DriversToRemove)
+            {
+                if (!this->UnloadDriver(DrvID))
+                {
+                    error("Failed to unload conflicting driver %d", DrvID);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+        else
+        {
+            foreach (auto Drv in Drivers)
+            {
+                FexExtended *fe = ((FexExtended *)((uintptr_t)Drv.Address + EXTENDED_SECTION_ADDRESS));
+
+                if (fe->Driver.OverrideOnConflict)
+                {
+                    debug("Driver %s is conflicting with %s", fe->Driver.Name, fexExtended->Driver.Name);
+                    return DriverCode::DRIVER_CONFLICT;
+                }
+            }
+        }
+
+        DriverFile DrvFile = {
+            .Enabled = true,
+            .DriverUID = this->DriverUIDs - 1,
+            .Address = (void *)fex,
+            .InterruptCallback = (void *)((uintptr_t)fex + (uintptr_t)fexExtended->Driver.InterruptCallback),
+            .MemTrk = mem,
+        };
+        if (fexExtended->Driver.InterruptCallback)
+            DrvFile.InterruptHook[0] = new DriverInterruptHook(((int)((PCI::PCIHeader0 *)PCIDevice)->InterruptLine), DrvFile);
+
+        KernelCallback KCallback{};
+        KCallback.RawPtr = PCIDevice;
+        KCallback.Reason = CallbackReason::ConfigurationReason;
+        int CallbackRet = ((int (*)(KernelCallback *))((uintptr_t)fexExtended->Driver.Callback + (uintptr_t)fex))(&KCallback);
+
+        if (CallbackRet == DriverReturnCode::NOT_IMPLEMENTED)
+        {
+            error("Driver %s is not implemented", fexExtended->Driver.Name);
+            delete mem, mem = nullptr;
+            return DriverCode::NOT_IMPLEMENTED;
+        }
+        else if (CallbackRet == DriverReturnCode::OK)
+            trace("Device found for driver: %s", fexExtended->Driver.Name);
+        else
+        {
+            error("Driver %s returned error %d", fexExtended->Driver.Name, CallbackRet);
+            delete mem, mem = nullptr;
+            return DriverCode::DRIVER_RETURNED_ERROR;
+        }
+
+        Drivers.push_back(DrvFile);
+        return DriverCode::OK;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Audio.cpp b/Kernel/Core/Driver/DriverBinding/Process/Audio.cpp
new file mode 100644
index 00000000..c821bb0c
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Audio.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessAudio(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Display.cpp b/Kernel/Core/Driver/DriverBinding/Process/Display.cpp
new file mode 100644
index 00000000..12d221fb
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Display.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessDisplay(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Filesystem.cpp b/Kernel/Core/Driver/DriverBinding/Process/Filesystem.cpp
new file mode 100644
index 00000000..079182dc
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Filesystem.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessFileSystem(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Generic.cpp b/Kernel/Core/Driver/DriverBinding/Process/Generic.cpp
new file mode 100644
index 00000000..22a46c3f
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Generic.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessGeneric(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Input.cpp b/Kernel/Core/Driver/DriverBinding/Process/Input.cpp
new file mode 100644
index 00000000..c7285f88
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Input.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessInput(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Network.cpp b/Kernel/Core/Driver/DriverBinding/Process/Network.cpp
new file mode 100644
index 00000000..a67d2241
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Network.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessNetwork(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/DriverBinding/Process/Storage.cpp b/Kernel/Core/Driver/DriverBinding/Process/Storage.cpp
new file mode 100644
index 00000000..139c258a
--- /dev/null
+++ b/Kernel/Core/Driver/DriverBinding/Process/Storage.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "../../api.hpp"
+
+#include <ints.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <cwalk.h>
+#include <md5.h>
+
+#include "../../../../kernel.h"
+#include "../../../../DAPI.hpp"
+#include "../../../../Fex.hpp"
+
+namespace Driver
+{
+    DriverCode Driver::BindProcessStorage(Memory::MemMgr *mem, void *fex)
+    {
+        UNUSED(mem);
+        UNUSED(fex);
+        return DriverCode::NOT_IMPLEMENTED;
+    }
+}
diff --git a/Kernel/Core/Driver/api.hpp b/Kernel/Core/Driver/api.hpp
new file mode 100644
index 00000000..46367260
--- /dev/null
+++ b/Kernel/Core/Driver/api.hpp
@@ -0,0 +1,27 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DRIVER_API_H__
+#define __FENNIX_KERNEL_DRIVER_API_H__
+
+#include <types.h>
+
+#include "../../DAPI.hpp"
+
+extern KernelAPI KernelAPITemplate;
+
+#endif // !__FENNIX_KERNEL_DRIVER_API_H__
diff --git a/Kernel/Core/InterruptsManager.cpp b/Kernel/Core/InterruptsManager.cpp
new file mode 100644
index 00000000..c169c0c0
--- /dev/null
+++ b/Kernel/Core/InterruptsManager.cpp
@@ -0,0 +1,235 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <ints.hpp>
+
+#include <syscalls.hpp>
+#include <smp.hpp>
+#include <vector>
+#include <io.h>
+
+#if defined(a64)
+#include "../Architecture/amd64/cpu/gdt.hpp"
+#include "../Architecture/amd64/cpu/idt.hpp"
+#include "../Architecture/amd64/acpi.hpp"
+#include "../Architecture/amd64/cpu/apic.hpp"
+#elif defined(a32)
+#include "../Architecture/i386/cpu/gdt.hpp"
+#include "../Architecture/i386/cpu/idt.hpp"
+#elif defined(aa64)
+#endif
+
+#include "crashhandler.hpp"
+#include "../kernel.h"
+
+extern "C" SafeFunction void ExceptionHandler(void *Data) { CrashHandler::Handle(Data); }
+
+namespace Interrupts
+{
+    struct Event
+    {
+        int ID;
+        void *Data;
+    };
+    std::vector<Event> RegisteredEvents;
+
+#if defined(a64)
+    /* APIC::APIC */ void *apic[MAX_CPU];
+    /* APIC::Timer */ void *apicTimer[MAX_CPU];
+#elif defined(a32)
+    /* APIC::APIC */ void *apic[MAX_CPU];
+#elif defined(aa64)
+#endif
+    void *InterruptFrames[INT_FRAMES_MAX];
+
+    void Initialize(int Core)
+    {
+#if defined(a64)
+        GlobalDescriptorTable::Init(Core);
+        InterruptDescriptorTable::Init(Core);
+        CPUData *CoreData = GetCPU(Core);
+        CoreData->Checksum = CPU_DATA_CHECKSUM;
+        CPU::x64::wrmsr(CPU::x64::MSR_GS_BASE, (uint64_t)CoreData);
+        CPU::x64::wrmsr(CPU::x64::MSR_SHADOW_GS_BASE, (uint64_t)CoreData);
+        CoreData->ID = Core;
+        CoreData->IsActive = true;
+        CoreData->SystemCallStack = (uint8_t *)((uintptr_t)KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE + 1)) + STACK_SIZE);
+        CoreData->Stack = (uintptr_t)KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE + 1)) + STACK_SIZE;
+        if (CoreData->Checksum != CPU_DATA_CHECKSUM)
+        {
+            KPrint("CPU %d checksum mismatch! %x != %x", Core, CoreData->Checksum, CPU_DATA_CHECKSUM);
+            CPU::Stop();
+        }
+        debug("Stack for core %d is %#lx (Address: %#lx)", Core, CoreData->Stack, CoreData->Stack - STACK_SIZE);
+        InitializeSystemCalls();
+#elif defined(a32)
+        warn("i386 is not supported yet");
+#elif defined(aa64)
+        warn("aarch64 is not supported yet");
+#endif
+    }
+
+    void Enable(int Core)
+    {
+#if defined(a64)
+        if (((ACPI::MADT *)PowerManager->GetMADT())->LAPICAddress != nullptr)
+        {
+            // TODO: This function is called by SMP too. Do not initialize timers that doesn't support multiple cores.
+            apic[Core] = new APIC::APIC(Core);
+            if (Core == Config.IOAPICInterruptCore) // Redirect IRQs to the specified core.
+                ((APIC::APIC *)apic[Core])->RedirectIRQs(Core);
+        }
+        else
+        {
+            error("LAPIC not found");
+            // TODO: PIC
+        }
+#elif defined(a32)
+        warn("i386 is not supported yet");
+#elif defined(aa64)
+        warn("aarch64 is not supported yet");
+#endif
+    }
+
+    void InitializeTimer(int Core)
+    {
+        // TODO: This function is called by SMP too. Do not initialize timers that doesn't support multiple cores.
+#if defined(a64)
+        if (apic[Core] != nullptr)
+            apicTimer[Core] = new APIC::Timer((APIC::APIC *)apic[Core]);
+        else
+        {
+            fixme("apic not found");
+        }
+#elif defined(a32)
+        warn("i386 is not supported yet");
+#elif defined(aa64)
+        warn("aarch64 is not supported yet");
+#endif
+    }
+
+    SafeFunction void RemoveAll()
+    {
+        RegisteredEvents.clear();
+    }
+
+    extern "C" SafeFunction void MainInterruptHandler(void *Data)
+    {
+#if defined(a64)
+        CPU::x64::TrapFrame *Frame = (CPU::x64::TrapFrame *)Data;
+        // debug("IRQ%ld", Frame->InterruptNumber - 32);
+
+        memmove(InterruptFrames + 1, InterruptFrames, sizeof(InterruptFrames) - sizeof(InterruptFrames[0]));
+        InterruptFrames[0] = (void *)Frame->rip;
+
+        CPUData *CoreData = GetCurrentCPU();
+        int Core = 0;
+        if (likely(CoreData != nullptr))
+            Core = CoreData->ID;
+
+        /* If this is false, we have a big problem. */
+        if (likely(Frame->InterruptNumber < CPU::x86::IRQ223 && Frame->InterruptNumber > CPU::x86::ISR0))
+        {
+            /* Halt core interrupt */
+            if (unlikely(Frame->InterruptNumber == CPU::x86::IRQ29))
+                CPU::Stop();
+
+            bool InterruptHandled = false;
+            foreach (auto ev in RegisteredEvents)
+            {
+#if defined(a86)
+                if ((ev.ID + CPU::x86::IRQ0) == static_cast<int>(Frame->InterruptNumber))
+#elif defined(aa64)
+                if (ev.ID == static_cast<int>(Frame->InterruptNumber))
+#endif
+                {
+                    ((Handler *)ev.Data)->OnInterruptReceived(Frame);
+                    InterruptHandled = true;
+                }
+            }
+
+            if (!InterruptHandled)
+            {
+                error("IRQ%ld is unhandled on CPU %d.", Frame->InterruptNumber - 32, Core);
+                if (Frame->InterruptNumber == CPU::x86::IRQ1)
+                {
+                    uint8_t scancode = inb(0x60);
+                    warn("IRQ1 is the keyboard interrupt. Scancode: %#x", scancode);
+                }
+            }
+
+            if (likely(apic[Core]))
+            {
+                ((APIC::APIC *)Interrupts::apic[Core])->EOI();
+                // TODO: Handle PIC too
+                return;
+            }
+            // TODO: PIC
+        }
+#elif defined(a32)
+        void *Frame = Data;
+#elif defined(aa64)
+        CPU::aarch64::TrapFrame *Frame = (CPU::aarch64::TrapFrame *)Data;
+#endif
+        error("HALT HALT HALT HALT HALT HALT HALT HALT HALT");
+        CPU::Stop();
+    }
+
+    Handler::Handler(int InterruptNumber)
+    {
+        foreach (auto ev in RegisteredEvents)
+        {
+            if (ev.ID == InterruptNumber)
+            {
+                warn("IRQ%d is already registered.", InterruptNumber);
+            }
+        }
+
+        debug("Registering interrupt handler for IRQ%d.", InterruptNumber);
+        this->InterruptNumber = InterruptNumber;
+        RegisteredEvents.push_back({InterruptNumber, this});
+    }
+
+    Handler::~Handler()
+    {
+        debug("Unregistering interrupt handler for IRQ%d.", this->InterruptNumber);
+        for (size_t i = 0; i < RegisteredEvents.size(); i++)
+        {
+            if (RegisteredEvents[i].ID == this->InterruptNumber)
+            {
+                RegisteredEvents.remove(i);
+                return;
+            }
+        }
+        warn("Event %d not found.", this->InterruptNumber);
+    }
+
+#if defined(a64)
+    void Handler::OnInterruptReceived(CPU::x64::TrapFrame *Frame)
+    {
+        trace("Unhandled interrupt IRQ%d", Frame->InterruptNumber - 32);
+#elif defined(a32)
+    void Handler::OnInterruptReceived(CPU::x32::TrapFrame *Frame)
+    {
+        trace("Unhandled interrupt received");
+#elif defined(aa64)
+    void Handler::OnInterruptReceived(CPU::aarch64::TrapFrame *Frame)
+    {
+        trace("Unhandled interrupt received");
+#endif
+    }
+}
diff --git a/Kernel/Core/Lock.cpp b/Kernel/Core/Lock.cpp
new file mode 100644
index 00000000..f1b0cfb6
--- /dev/null
+++ b/Kernel/Core/Lock.cpp
@@ -0,0 +1,207 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <lock.hpp>
+
+#include <debug.h>
+#include <smp.hpp>
+
+#include "../kernel.h"
+
+// #define PRINT_BACKTRACE
+
+#ifdef PRINT_BACKTRACE
+#pragma GCC diagnostic ignored "-Wframe-address"
+#endif
+
+bool ForceUnlock = false;
+std::atomic_size_t LocksCount = 0;
+
+size_t GetLocksCount() { return LocksCount.load(); }
+
+void LockClass::DeadLock(SpinLockData Lock)
+{
+    if (ForceUnlock)
+    {
+        warn("Unlocking lock '%s' which it was held by '%s'...", Lock.AttemptingToGet, Lock.CurrentHolder);
+        this->DeadLocks = 0;
+        this->Unlock();
+        return;
+    }
+
+    CPUData *CoreData = GetCurrentCPU();
+    long CCore = 0xdead;
+    if (CoreData != nullptr)
+        CCore = CoreData->ID;
+
+    warn("Potential deadlock in lock '%s' held by '%s'! %ld %s in queue. Interrupts are %s. Core %ld held by %ld. (%ld times happened)",
+         Lock.AttemptingToGet, Lock.CurrentHolder,
+         Lock.Count, Lock.Count > 1 ? "locks" : "lock",
+         CPU::Interrupts(CPU::Check) ? "enabled" : "disabled",
+         CCore, Lock.Core, this->DeadLocks);
+
+#ifdef PRINT_BACKTRACE
+    if (KernelSymbolTable)
+    {
+        debug("\t\t%s<-%s<-%s<-%s<-%s<-%s<-%s<-%s<-%s<-%s",
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(1)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(2)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(3)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(4)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(5)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(6)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(7)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(8)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(9)));
+    }
+#endif
+
+    // TODO: Print on screen too.
+
+    this->DeadLocks++;
+
+    if (Config.UnlockDeadLock && this->DeadLocks.load() > 10)
+    {
+        warn("Unlocking lock '%s' to prevent deadlock. (this is enabled in the kernel config)", Lock.AttemptingToGet);
+        this->DeadLocks = 0;
+        this->Unlock();
+    }
+
+    if (TaskManager)
+        TaskManager->Schedule();
+}
+
+int LockClass::Lock(const char *FunctionName)
+{
+    LockData.AttemptingToGet = FunctionName;
+    LockData.StackPointerAttempt = (uintptr_t)__builtin_frame_address(0);
+
+Retry:
+    int i = 0;
+    while (IsLocked.exchange(true, std::memory_order_acquire) && ++i < (DebuggerIsAttached ? 0x100000 : 0x10000000))
+        CPU::Pause();
+
+    if (i >= (DebuggerIsAttached ? 0x100000 : 0x10000000))
+    {
+        DeadLock(LockData);
+        goto Retry;
+    }
+
+    LockData.Count++;
+    LockData.CurrentHolder = FunctionName;
+    LockData.StackPointerHolder = (uintptr_t)__builtin_frame_address(0);
+
+    CPUData *CoreData = GetCurrentCPU();
+    if (CoreData != nullptr)
+        LockData.Core = CoreData->ID;
+
+    LocksCount++;
+
+    __sync;
+    return 0;
+}
+
+int LockClass::Unlock()
+{
+    __sync;
+
+    IsLocked.store(false, std::memory_order_release);
+    LockData.Count--;
+    LocksCount--;
+
+    return 0;
+}
+
+void LockClass::TimeoutDeadLock(SpinLockData Lock, uint64_t Timeout)
+{
+    CPUData *CoreData = GetCurrentCPU();
+    long CCore = 0xdead;
+
+    if (CoreData != nullptr)
+        CCore = CoreData->ID;
+
+    uint64_t Counter = TimeManager->GetCounter();
+
+    warn("Potential deadlock in lock '%s' held by '%s'! %ld %s in queue. Interrupts are %s. Core %ld held by %ld. Timeout in %ld (%ld ticks remaining).",
+         Lock.AttemptingToGet, Lock.CurrentHolder,
+         Lock.Count, Lock.Count > 1 ? "locks" : "lock",
+         CPU::Interrupts(CPU::Check) ? "enabled" : "disabled",
+         CCore, Lock.Core, Timeout, Timeout - Counter);
+
+#ifdef PRINT_BACKTRACE
+    if (KernelSymbolTable)
+    {
+        debug("\t\t%s<-%s<-%s<-%s<-%s<-%s<-%s<-%s<-%s<-%s",
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(1)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(2)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(3)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(4)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(5)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(6)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(7)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(8)),
+              KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(9)));
+    }
+#endif
+
+    if (Timeout < Counter)
+    {
+        warn("Unlocking lock '%s' because of timeout. (%ld < %ld)", Lock.AttemptingToGet, Timeout, Counter);
+        this->Unlock();
+    }
+
+    if (TaskManager)
+        TaskManager->Schedule();
+}
+
+int LockClass::TimeoutLock(const char *FunctionName, uint64_t Timeout)
+{
+    if (!TimeManager)
+        return Lock(FunctionName);
+
+    LockData.AttemptingToGet = FunctionName;
+    LockData.StackPointerAttempt = (uintptr_t)__builtin_frame_address(0);
+
+    std::atomic_uint64_t Target = 0;
+Retry:
+    int i = 0;
+    while (IsLocked.exchange(true, std::memory_order_acquire) && ++i < (DebuggerIsAttached ? 0x100000 : 0x10000000))
+        CPU::Pause();
+
+    if (i >= (DebuggerIsAttached ? 0x100000 : 0x10000000))
+    {
+        if (Target.load() == 0)
+            Target.store(TimeManager->CalculateTarget(Timeout, Time::Units::Milliseconds));
+        TimeoutDeadLock(LockData, Target.load());
+        goto Retry;
+    }
+
+    LockData.Count++;
+    LockData.CurrentHolder = FunctionName;
+    LockData.StackPointerHolder = (uintptr_t)__builtin_frame_address(0);
+
+    CPUData *CoreData = GetCurrentCPU();
+    if (CoreData != nullptr)
+        LockData.Core = CoreData->ID;
+
+    LocksCount++;
+
+    __sync;
+    return 0;
+}
diff --git a/Kernel/Core/Memory/HeapAllocators/Xalloc/README.md b/Kernel/Core/Memory/HeapAllocators/Xalloc/README.md
new file mode 100644
index 00000000..4c54e9ca
--- /dev/null
+++ b/Kernel/Core/Memory/HeapAllocators/Xalloc/README.md
@@ -0,0 +1,137 @@
+# Xalloc
+
+Xalloc is a custom memory allocator designed for hobby operating systems. It is written in C++ and provides a simple and efficient way to manage memory in your hobby OS.
+
+#### ❗ This project is still in development and is not ready for use in production environments. ❗
+
+---
+
+## Features
+
+- **Simple API** - Xalloc provides a simple API for allocating and freeing memory. It is designed to be easy to use and understand.
+
+- [ ] todo complete this
+
+---
+
+## Getting Started
+
+### Implementing missing functions
+
+You will need to implement the following functions in your OS:
+
+##### Wrapper.cpp
+```cpp
+extern "C" void *Xalloc_REQUEST_PAGES(Xsize_t Pages)
+{
+    // ...
+}
+
+extern "C" void Xalloc_FREE_PAGES(void *Address, Xsize_t Pages)
+{
+    // ...
+}
+
+extern "C" void Xalloc_MAP_MEMORY(void *VirtualAddress, void *PhysicalAddress, Xsize_t Flags)
+{
+    // ...
+}
+
+extern "C" void Xalloc_UNMAP_MEMORY(void *VirtualAddress)
+{
+    // ...
+}
+```
+
+##### Xalloc.hpp
+```cpp
+#define Xalloc_PAGE_SIZE <page size> /* <-- Replace with your page size */
+#define Xalloc_trace(m, ...) <trace function>
+#define Xalloc_warn(m, ...) <warning function>
+#define Xalloc_err(m, ...) <error function>
+#define Xalloc_def <define a lock> /* eg. std::mutex Xalloc_lock; */
+#define Xalloc_lock <lock function>
+#define Xalloc_unlock <unlock function>
+```
+
+### Typical usage
+
+```cpp
+#include "Xalloc.hpp"
+
+Xalloc::V1 *XallocV1Allocator = nullptr;
+
+int main()
+{
+    /*                                            Virtual Base     User   SMAP */
+    XallocV1Allocator = new Xalloc::V1((void *)0xFFFFA00000000000, false, false);
+
+    void *p = XallocV1Allocator->malloc(1234);
+    /* ... */
+    XallocV1Allocator->free(p);
+    delete XallocV1Allocator;
+    return 0;
+}
+```
+
+or
+
+```cpp
+#include "Xalloc.hpp"
+
+int main()
+{
+    /*                                      Virtual Base     User   SMAP */
+    Xalloc::V1 XallocV1Allocator((void *)0xFFFFA00000000000, false, false);
+
+    void *p = XallocV1Allocator.malloc(1234);
+    /* ... */
+    XallocV1Allocator.free(p);
+    return 0;
+}
+```
+
+---
+
+## API
+
+### Xalloc::V1
+
+```cpp
+void *malloc(Xsize_t Size);
+```
+Allocates a block of memory of size `Size` bytes.
+If `Size` is 0, then `nullptr` is returned.
+- `Size` - The size of the block to allocate in bytes.
+
+<br><br>
+
+```cpp
+void free(void *Address);
+```
+Frees the memory block pointed to by `Address`.
+If `Address` is `nullptr`, then no operation is performed.
+- `Address` - The address of the memory block to free.
+
+<br><br>
+
+```cpp
+void *calloc(Xsize_t NumberOfBlocks, Xsize_t Size);
+```
+Allocates a block of memory for an array of `NumberOfBlocks` elements, each of them `Size` bytes long.
+If `NumberOfBlocks` or `Size` is 0, then `nullptr` is returned.
+- `NumberOfBlocks` - The number of elements to allocate.
+- `Size` - The size of each element in bytes.
+
+<br><br>
+
+```cpp
+void *realloc(void *Address, Xsize_t Size);
+```
+Changes the size of the memory block pointed to by `Address` to `Size` bytes.
+If `Address` is `nullptr`, then the call is equivalent to `malloc(Size)`.
+If `Size` is equal to zero, and `Address` is not `nullptr`, then the call is equivalent to `free(Address)`.
+- `Address` - The address of the memory block to resize.
+- `Size` - The new size of the memory block in bytes.
+
+---
diff --git a/Kernel/Core/Memory/HeapAllocators/Xalloc/Wrapper.cpp b/Kernel/Core/Memory/HeapAllocators/Xalloc/Wrapper.cpp
new file mode 100644
index 00000000..68258d70
--- /dev/null
+++ b/Kernel/Core/Memory/HeapAllocators/Xalloc/Wrapper.cpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "Xalloc.hpp"
+
+#include <memory.hpp>
+
+extern "C" void *Xalloc_REQUEST_PAGES(Xsize_t Pages)
+{
+    return KernelAllocator.RequestPages(Pages);
+}
+
+extern "C" void Xalloc_FREE_PAGES(void *Address, Xsize_t Pages)
+{
+    KernelAllocator.FreePages(Address, Pages);
+}
+
+extern "C" void Xalloc_MAP_MEMORY(void *VirtualAddress, void *PhysicalAddress, Xsize_t Flags)
+{
+    Memory::Virtual(KernelPageTable).Map(VirtualAddress, PhysicalAddress, Flags);
+}
+
+extern "C" void Xalloc_UNMAP_MEMORY(void *VirtualAddress)
+{
+    Memory::Virtual(KernelPageTable).Unmap(VirtualAddress);
+}
diff --git a/Kernel/Core/Memory/HeapAllocators/Xalloc/Xalloc.hpp b/Kernel/Core/Memory/HeapAllocators/Xalloc/Xalloc.hpp
new file mode 100644
index 00000000..07006a96
--- /dev/null
+++ b/Kernel/Core/Memory/HeapAllocators/Xalloc/Xalloc.hpp
@@ -0,0 +1,119 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_Xalloc_H__
+#define __FENNIX_KERNEL_Xalloc_H__
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <debug.h>
+
+typedef long unsigned Xuint64_t;
+typedef long unsigned Xsize_t;
+
+#define Xalloc_StopOnFail true
+#define Xalloc_PAGE_SIZE PAGE_SIZE
+#define Xalloc_trace(m, ...) trace(m, ##__VA_ARGS__)
+#define Xalloc_warn(m, ...) warn(m, ##__VA_ARGS__)
+#define Xalloc_err(m, ...) error(m, ##__VA_ARGS__)
+#define Xalloc_def NewLock(XallocLock)
+#define Xalloc_lock XallocLock.Lock(__FUNCTION__)
+#define Xalloc_unlock XallocLock.Unlock()
+
+namespace Xalloc
+{
+    class V1
+    {
+    private:
+        void *BaseVirtualAddress = nullptr;
+        void *FirstBlock = nullptr;
+        void *LastBlock = nullptr;
+
+        bool UserMapping = false;
+        bool SMAPUsed = false;
+
+    public:
+        /** @brief Execute "stac" instruction if the kernel has SMAP enabled */
+        void Xstac();
+
+        /** @brief Execute "clac" instruction if the kernel has SMAP enabled */
+        void Xclac();
+
+        /**
+         * @brief Arrange the blocks to optimize the memory usage
+         * The allocator is not arranged by default
+         * to avoid performance issues.
+         * This function will defragment the memory
+         * and free the unused blocks.
+         *
+         * You should call this function when the
+         * kernel is idle or when is not using
+         * the allocator.
+         */
+        void Arrange();
+
+        /**
+         * @brief Allocate a new memory block
+         *
+         * @param Size Size of the block to allocate.
+         * @return void* Pointer to the allocated block.
+         */
+        void *malloc(Xsize_t Size);
+
+        /**
+         * @brief Free a previously allocated block
+         *
+         * @param Address Address of the block to free.
+         */
+        void free(void *Address);
+
+        /**
+         * @brief Allocate a new memory block
+         *
+         * @param NumberOfBlocks Number of blocks to allocate.
+         * @param Size Size of the block to allocate.
+         * @return void* Pointer to the allocated block.
+         */
+        void *calloc(Xsize_t NumberOfBlocks, Xsize_t Size);
+
+        /**
+         * @brief Reallocate a previously allocated block
+         *
+         * @param Address Address of the block to reallocate.
+         * @param Size New size of the block.
+         * @return void* Pointer to the reallocated block.
+         */
+        void *realloc(void *Address, Xsize_t Size);
+
+        /**
+         * @brief Construct a new Allocator object
+         *
+         * @param BaseVirtualAddress Virtual address to map the pages.
+         * @param UserMode Map the new pages with USER flag?
+         * @param SMAPEnabled Does the kernel has Supervisor Mode Access Prevention enabled?
+         */
+        V1(void *BaseVirtualAddress, bool UserMode, bool SMAPEnabled);
+
+        /**
+         * @brief Destroy the Allocator object
+         *
+         */
+        ~V1();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_Xalloc_H__
diff --git a/Kernel/Core/Memory/HeapAllocators/Xalloc/XallocV1.cpp b/Kernel/Core/Memory/HeapAllocators/Xalloc/XallocV1.cpp
new file mode 100644
index 00000000..12f38372
--- /dev/null
+++ b/Kernel/Core/Memory/HeapAllocators/Xalloc/XallocV1.cpp
@@ -0,0 +1,290 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "Xalloc.hpp"
+
+Xalloc_def;
+
+#define XALLOC_CONCAT(x, y) x##y
+#define XStoP(d) (((d) + PAGE_SIZE - 1) / PAGE_SIZE)
+#define XPtoS(d) ((d)*PAGE_SIZE)
+#define Xalloc_BlockChecksum 0xA110C
+
+extern "C" void *Xalloc_REQUEST_PAGES(Xsize_t Pages);
+extern "C" void Xalloc_FREE_PAGES(void *Address, Xsize_t Pages);
+extern "C" void Xalloc_MAP_MEMORY(void *VirtualAddress, void *PhysicalAddress, Xsize_t Flags);
+extern "C" void Xalloc_UNMAP_MEMORY(void *VirtualAddress);
+
+// TODO: Change memcpy with an optimized version
+void *Xmemcpy(void *__restrict__ Destination, const void *__restrict__ Source, Xuint64_t Length)
+{
+    unsigned char *dst = (unsigned char *)Destination;
+    const unsigned char *src = (const unsigned char *)Source;
+    for (Xuint64_t i = 0; i < Length; i++)
+        dst[i] = src[i];
+    return Destination;
+}
+
+// TODO: Change memset with an optimized version
+void *Xmemset(void *__restrict__ Destination, int Data, Xuint64_t Length)
+{
+    unsigned char *Buffer = (unsigned char *)Destination;
+    for (Xuint64_t i = 0; i < Length; i++)
+        Buffer[i] = (unsigned char)Data;
+    return Destination;
+}
+
+namespace Xalloc
+{
+    class Block
+    {
+    public:
+        void *Address = nullptr;
+
+        int Checksum = Xalloc_BlockChecksum;
+        Xsize_t Size = 0;
+        Block *Next = nullptr;
+        Block *Last = nullptr;
+        bool IsFree = true;
+
+        bool Check()
+        {
+            if (this->Checksum != Xalloc_BlockChecksum)
+                return false;
+            return true;
+        }
+
+        Block(Xsize_t Size)
+        {
+            this->Address = Xalloc_REQUEST_PAGES(XStoP(Size + 1));
+            this->Size = Size;
+            Xmemset(this->Address, 0, Size);
+        }
+
+        ~Block()
+        {
+            Xalloc_FREE_PAGES(this->Address, XStoP(this->Size + 1));
+        }
+
+        /**
+         * @brief Overload new operator to allocate memory from the heap
+         * @param Size Unused
+         * @return void* Pointer to the allocated memory
+         */
+        void *operator new(Xsize_t Size)
+        {
+            void *ptr = Xalloc_REQUEST_PAGES(XStoP(sizeof(Block)));
+            return ptr;
+            (void)(Size);
+        }
+
+        /**
+         * @brief Overload delete operator to free memory from the heap
+         * @param Address Pointer to the memory to free
+         */
+        void operator delete(void *Address)
+        {
+            Xalloc_FREE_PAGES(Address, XStoP(sizeof(Block)));
+        }
+    } __attribute__((packed, aligned((16))));
+
+    class SmartSMAPClass
+    {
+    private:
+        V1 *allocator = nullptr;
+
+    public:
+        SmartSMAPClass(V1 *allocator)
+        {
+            this->allocator = allocator;
+            this->allocator->Xstac();
+        }
+        ~SmartSMAPClass() { this->allocator->Xclac(); }
+    };
+#define SmartSMAP SmartSMAPClass XALLOC_CONCAT(SmartSMAP##_, __COUNTER__)(this)
+
+    void V1::Xstac()
+    {
+        if (this->SMAPUsed)
+        {
+#if defined(a86)
+            asm volatile("stac" ::
+                             : "cc");
+#endif
+        }
+    }
+
+    void V1::Xclac()
+    {
+        if (this->SMAPUsed)
+        {
+#if defined(a86)
+            asm volatile("clac" ::
+                             : "cc");
+#endif
+        }
+    }
+
+    void V1::Arrange()
+    {
+        Xalloc_err("Arrange() is not implemented yet!");
+    }
+
+    void *V1::malloc(Xsize_t Size)
+    {
+        if (Size == 0)
+        {
+            Xalloc_warn("Attempted to allocate 0 bytes!");
+            return nullptr;
+        }
+
+        SmartSMAP;
+        Xalloc_lock;
+
+        if (this->FirstBlock == nullptr)
+        {
+            this->FirstBlock = new Block(Size);
+            ((Block *)this->FirstBlock)->IsFree = false;
+            Xalloc_unlock;
+            return ((Block *)this->FirstBlock)->Address;
+        }
+
+        Block *CurrentBlock = ((Block *)this->FirstBlock);
+        while (CurrentBlock != nullptr)
+        {
+            if (!CurrentBlock->Check())
+            {
+                Xalloc_err("Block %#lx has an invalid checksum! (%#x != %#x)",
+                           (Xuint64_t)CurrentBlock, CurrentBlock->Checksum, Xalloc_BlockChecksum);
+                while (Xalloc_StopOnFail)
+                    ;
+            }
+            else if (CurrentBlock->IsFree && CurrentBlock->Size >= Size)
+            {
+                CurrentBlock->IsFree = false;
+                Xmemset(CurrentBlock->Address, 0, Size);
+                Xalloc_unlock;
+                return CurrentBlock->Address;
+            }
+            CurrentBlock = CurrentBlock->Next;
+        }
+
+        CurrentBlock = ((Block *)this->FirstBlock);
+        while (CurrentBlock->Next != nullptr)
+            CurrentBlock = CurrentBlock->Next;
+
+        CurrentBlock->Next = new Block(Size);
+        ((Block *)CurrentBlock->Next)->Last = CurrentBlock;
+        ((Block *)CurrentBlock->Next)->IsFree = false;
+        Xalloc_unlock;
+        return ((Block *)CurrentBlock->Next)->Address;
+    }
+
+    void V1::free(void *Address)
+    {
+        if (Address == nullptr)
+        {
+            Xalloc_warn("Attempted to free a null pointer!");
+            return;
+        }
+
+        SmartSMAP;
+        Xalloc_lock;
+
+        Block *CurrentBlock = ((Block *)this->FirstBlock);
+        while (CurrentBlock != nullptr)
+        {
+            if (!CurrentBlock->Check())
+            {
+                Xalloc_err("Block %#lx has an invalid checksum! (%#x != %#x)",
+                           (Xuint64_t)CurrentBlock, CurrentBlock->Checksum, Xalloc_BlockChecksum);
+                while (Xalloc_StopOnFail)
+                    ;
+            }
+            else if (CurrentBlock->Address == Address)
+            {
+                if (CurrentBlock->IsFree)
+                {
+                    Xalloc_warn("Attempted to free an already freed pointer!");
+                    Xalloc_unlock;
+                    return;
+                }
+
+                CurrentBlock->IsFree = true;
+                Xalloc_unlock;
+                return;
+            }
+            CurrentBlock = CurrentBlock->Next;
+        }
+
+        Xalloc_err("Invalid address %#lx.", Address);
+        Xalloc_unlock;
+    }
+
+    void *V1::calloc(Xsize_t NumberOfBlocks, Xsize_t Size)
+    {
+        if (NumberOfBlocks == 0 || Size == 0)
+        {
+            Xalloc_warn("The %s%s%s is 0!",
+                        NumberOfBlocks == 0 ? "NumberOfBlocks" : "",
+                        NumberOfBlocks == 0 && Size == 0 ? " and " : "",
+                        Size == 0 ? "Size" : "");
+            return nullptr;
+        }
+
+        return this->malloc(NumberOfBlocks * Size);
+    }
+
+    void *V1::realloc(void *Address, Xsize_t Size)
+    {
+        if (Address == nullptr)
+            return this->malloc(Size);
+
+        if (Size == 0)
+        {
+            this->free(Address);
+            return nullptr;
+        }
+
+        // SmartSMAP;
+        // Xalloc_lock;
+        // ...
+        // Xalloc_unlock;
+
+        // TODO: Implement realloc
+        this->free(Address);
+        return this->malloc(Size);
+    }
+
+    V1::V1(void *BaseVirtualAddress, bool UserMode, bool SMAPEnabled)
+    {
+        SmartSMAP;
+        Xalloc_lock;
+        this->SMAPUsed = SMAPEnabled;
+        this->UserMapping = UserMode;
+        this->BaseVirtualAddress = BaseVirtualAddress;
+        Xalloc_unlock;
+    }
+
+    V1::~V1()
+    {
+        SmartSMAP;
+        Xalloc_lock;
+        Xalloc_trace("Destructor not implemented yet.");
+        Xalloc_unlock;
+    }
+}
diff --git a/Kernel/Core/Memory/Memory.cpp b/Kernel/Core/Memory/Memory.cpp
new file mode 100644
index 00000000..4ad7c63b
--- /dev/null
+++ b/Kernel/Core/Memory/Memory.cpp
@@ -0,0 +1,818 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <memory.hpp>
+
+#include <convert.h>
+#include <lock.hpp>
+#include <debug.h>
+#ifdef DEBUG
+#include <uart.hpp>
+#endif
+
+#include "HeapAllocators/Xalloc/Xalloc.hpp"
+#include "../Library/liballoc_1_1.h"
+#include "../../kernel.h"
+
+// #define DEBUG_ALLOCATIONS_SL 1
+// #define DEBUG_ALLOCATIONS 1
+
+#ifdef DEBUG_ALLOCATIONS
+#define memdbg(m, ...)       \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define memdbg(m, ...)
+#endif
+
+#ifdef DEBUG_ALLOCATIONS_SL
+NewLock(AllocatorLock);
+NewLock(OperatorAllocatorLock);
+#endif
+
+using namespace Memory;
+
+Physical KernelAllocator;
+PageTable4 *KernelPageTable = nullptr;
+bool Page1GBSupport = false;
+bool PSESupport = false;
+
+static MemoryAllocatorType AllocatorType = MemoryAllocatorType::Pages;
+Xalloc::V1 *XallocV1Allocator = nullptr;
+
+#ifdef DEBUG
+NIF void tracepagetable(PageTable4 *pt)
+{
+    for (int i = 0; i < 512; i++)
+    {
+#if defined(a64)
+        if (pt->Entries[i].Present)
+            debug("Entry %03d: %x %x %x %x %x %x %x %p-%#llx", i,
+                  pt->Entries[i].Present, pt->Entries[i].ReadWrite,
+                  pt->Entries[i].UserSupervisor, pt->Entries[i].WriteThrough,
+                  pt->Entries[i].CacheDisable, pt->Entries[i].Accessed,
+                  pt->Entries[i].ExecuteDisable, pt->Entries[i].Address << 12,
+                  pt->Entries[i]);
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+    }
+}
+#endif
+
+NIF void MapFromZero(PageTable4 *PT, BootInfo *Info)
+{
+    debug("Mapping from 0x0 to %#llx", Info->Memory.Size);
+    Virtual va = Virtual(PT);
+    size_t MemSize = Info->Memory.Size;
+
+    if (Page1GBSupport && PSESupport)
+    {
+        /* Map the first 100MB of memory as 4KB pages */
+
+        // uintptr_t Physical4KBSectionStart = 0x10000000;
+        // va.Map((void *)0,
+        //        (void *)0,
+        //        Physical4KBSectionStart,
+        //        PTFlag::RW);
+
+        // va.Map((void *)Physical4KBSectionStart,
+        //        (void *)Physical4KBSectionStart,
+        //        MemSize - Physical4KBSectionStart,
+        //        PTFlag::RW,
+        //        Virtual::MapType::OneGB);
+
+        va.Map((void *)0, (void *)0, MemSize, PTFlag::RW);
+    }
+    else
+        va.Map((void *)0, (void *)0, MemSize, PTFlag::RW);
+
+    va.Unmap((void *)0);
+}
+
+NIF void MapFramebuffer(PageTable4 *PT, BootInfo *Info)
+{
+    debug("Mapping Framebuffer");
+    Virtual va = Virtual(PT);
+    int itrfb = 0;
+    while (1)
+    {
+        if (!Info->Framebuffer[itrfb].BaseAddress)
+            break;
+
+        va.OptimizedMap((void *)Info->Framebuffer[itrfb].BaseAddress,
+                        (void *)Info->Framebuffer[itrfb].BaseAddress,
+                        Info->Framebuffer[itrfb].Pitch * Info->Framebuffer[itrfb].Height,
+                        PTFlag::RW | PTFlag::US | PTFlag::G);
+        itrfb++;
+
+#ifdef DEBUG
+        if (EnableExternalMemoryTracer)
+        {
+            char LockTmpStr[64];
+            strcpy_unsafe(LockTmpStr, __FUNCTION__);
+            strcat_unsafe(LockTmpStr, "_memTrk");
+            mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+            sprintf(mExtTrkLog, "Rsrv( %p %ld )\n\r",
+                    Info->Framebuffer[itrfb].BaseAddress,
+                    (Info->Framebuffer[itrfb].Pitch * Info->Framebuffer[itrfb].Height) + PAGE_SIZE);
+            UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+            for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+            {
+                if (mExtTrkLog[i] == '\r')
+                    break;
+                mTrkUART.Write(mExtTrkLog[i]);
+            }
+            mExtTrkLock.Unlock();
+        }
+#endif
+    }
+}
+
+NIF void MapKernel(PageTable4 *PT, BootInfo *Info)
+{
+    debug("Mapping Kernel");
+    uintptr_t BootstrapStart = (uintptr_t)&_bootstrap_start;
+    uintptr_t KernelStart = (uintptr_t)&_kernel_start;
+    uintptr_t KernelTextEnd = (uintptr_t)&_kernel_text_end;
+    uintptr_t KernelDataEnd = (uintptr_t)&_kernel_data_end;
+    uintptr_t KernelRoDataEnd = (uintptr_t)&_kernel_rodata_end;
+    uintptr_t KernelEnd = (uintptr_t)&_kernel_end;
+    uintptr_t KernelFileStart = (uintptr_t)Info->Kernel.FileBase;
+    uintptr_t KernelFileEnd = KernelFileStart + Info->Kernel.Size;
+
+    debug("Kernel physical address: %#lx - %#lx", Info->Kernel.PhysicalBase, (uintptr_t)Info->Kernel.PhysicalBase + Info->Kernel.Size);
+    debug("Kernel file base: %#lx - %#lx", KernelFileStart, KernelFileEnd);
+
+    debug("File size: %ld KB", TO_KB(Info->Kernel.Size));
+    debug(".text size: %ld KB", TO_KB(KernelTextEnd - KernelStart));
+    debug(".data size: %ld KB", TO_KB(KernelDataEnd - KernelTextEnd));
+    debug(".rodata size: %ld KB", TO_KB(KernelRoDataEnd - KernelDataEnd));
+    debug(".bss size: %ld KB", TO_KB(KernelEnd - KernelRoDataEnd));
+
+    uintptr_t BaseKernelMapAddress = (uintptr_t)Info->Kernel.PhysicalBase;
+    uintptr_t k;
+    Virtual va = Virtual(PT);
+
+    /* Bootstrap section */
+    for (k = BootstrapStart; k < KernelStart - KERNEL_VMA_OFFSET; k += PAGE_SIZE)
+    {
+#ifdef DEBUG /* vscode debugging */
+        void *BKMA = (void *)BaseKernelMapAddress, *K_ = (void *)k;
+#endif
+        va.Map((void *)k, (void *)BaseKernelMapAddress, PTFlag::RW | PTFlag::G);
+        KernelAllocator.ReservePage((void *)BaseKernelMapAddress);
+        BaseKernelMapAddress += PAGE_SIZE;
+    }
+
+    /* Text section */
+    for (k = KernelStart; k < KernelTextEnd; k += PAGE_SIZE)
+    {
+#ifdef DEBUG /* vscode debugging */
+        void *BKMA = (void *)BaseKernelMapAddress, *K_ = (void *)k;
+#endif
+        va.Map((void *)k, (void *)BaseKernelMapAddress, PTFlag::RW | PTFlag::G);
+        KernelAllocator.ReservePage((void *)BaseKernelMapAddress);
+        BaseKernelMapAddress += PAGE_SIZE;
+    }
+
+    /* Data section */
+    for (k = KernelTextEnd; k < KernelDataEnd; k += PAGE_SIZE)
+    {
+#ifdef DEBUG /* vscode debugging */
+        void *BKMA = (void *)BaseKernelMapAddress, *K_ = (void *)k;
+#endif
+        va.Map((void *)k, (void *)BaseKernelMapAddress, PTFlag::RW | PTFlag::G);
+        KernelAllocator.ReservePage((void *)BaseKernelMapAddress);
+        BaseKernelMapAddress += PAGE_SIZE;
+    }
+
+    /* Read only data section */
+    for (k = KernelDataEnd; k < KernelRoDataEnd; k += PAGE_SIZE)
+    {
+#ifdef DEBUG /* vscode debugging */
+        void *BKMA = (void *)BaseKernelMapAddress, *K_ = (void *)k;
+#endif
+        va.Map((void *)k, (void *)BaseKernelMapAddress, PTFlag::G);
+        KernelAllocator.ReservePage((void *)BaseKernelMapAddress);
+        BaseKernelMapAddress += PAGE_SIZE;
+    }
+
+    /* BSS section */
+    for (k = KernelRoDataEnd; k < KernelEnd; k += PAGE_SIZE)
+    {
+#ifdef DEBUG /* vscode debugging */
+        void *BKMA = (void *)BaseKernelMapAddress, *K_ = (void *)k;
+#endif
+        va.Map((void *)k, (void *)BaseKernelMapAddress, PTFlag::RW | PTFlag::G);
+        KernelAllocator.ReservePage((void *)BaseKernelMapAddress);
+        BaseKernelMapAddress += PAGE_SIZE;
+    }
+
+    debug("BaseKernelMapAddress: %#lx - %#lx", Info->Kernel.PhysicalBase, BaseKernelMapAddress);
+
+    /* Kernel file */
+    if (KernelFileStart != 0)
+        for (k = KernelFileStart; k < KernelFileEnd; k += PAGE_SIZE)
+        {
+            va.Map((void *)k, (void *)k, PTFlag::G);
+            KernelAllocator.ReservePage((void *)k);
+        }
+
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "Rsrv( %p %ld )\n\r",
+                Info->Kernel.PhysicalBase,
+                Info->Kernel.Size);
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+
+        sprintf(mExtTrkLog, "Rsrv( %p %ld )\n\r",
+                Info->Kernel.VirtualBase,
+                Info->Kernel.Size);
+        mExtTrkLock.Unlock();
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+    }
+#endif
+}
+
+NIF void InitializeMemoryManagement(BootInfo *Info)
+{
+#ifdef DEBUG
+    for (uint64_t i = 0; i < Info->Memory.Entries; i++)
+    {
+        uintptr_t Base = r_cst(uintptr_t, Info->Memory.Entry[i].BaseAddress);
+        size_t Length = Info->Memory.Entry[i].Length;
+        uintptr_t End = Base + Length;
+        const char *Type = "Unknown";
+
+        switch (Info->Memory.Entry[i].Type)
+        {
+        case likely(Usable):
+            Type = "Usable";
+            break;
+        case Reserved:
+            Type = "Reserved";
+            break;
+        case ACPIReclaimable:
+            Type = "ACPI Reclaimable";
+            break;
+        case ACPINVS:
+            Type = "ACPI NVS";
+            break;
+        case BadMemory:
+            Type = "Bad Memory";
+            break;
+        case BootloaderReclaimable:
+            Type = "Bootloader Reclaimable";
+            break;
+        case KernelAndModules:
+            Type = "Kernel and Modules";
+            break;
+        case Framebuffer:
+            Type = "Framebuffer";
+            break;
+        default:
+            break;
+        }
+
+        debug("%ld: %p-%p %s",
+              i,
+              Base,
+              End,
+              Type);
+    }
+#endif
+    trace("Initializing Physical Memory Manager");
+    // KernelAllocator = Physical(); <- Already called in the constructor
+    KernelAllocator.Init(Info);
+    debug("Memory Info: %lldMB / %lldMB (%lldMB reserved)",
+          TO_MB(KernelAllocator.GetUsedMemory()),
+          TO_MB(KernelAllocator.GetTotalMemory()),
+          TO_MB(KernelAllocator.GetReservedMemory()));
+
+    /* -- Debugging --
+        size_t bmap_size = KernelAllocator.GetPageBitmap().Size;
+        for (size_t i = 0; i < bmap_size; i++)
+        {
+            bool idx = KernelAllocator.GetPageBitmap().Get(i);
+            if (idx == true)
+                debug("Page %04d: %#lx", i, i * PAGE_SIZE);
+        }
+
+        inf_loop debug("Alloc.: %#lx", KernelAllocator.RequestPage());
+    */
+
+    trace("Initializing Virtual Memory Manager");
+    KernelPageTable = (PageTable4 *)KernelAllocator.RequestPages(TO_PAGES(PAGE_SIZE + 1));
+    debug("Page table allocated at %#lx", KernelPageTable);
+    memset(KernelPageTable, 0, PAGE_SIZE);
+
+    if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+    {
+        CPU::x86::AMD::CPUID0x80000001 cpuid;
+        cpuid.Get();
+        PSESupport = cpuid.EDX.PSE;
+        Page1GBSupport = cpuid.EDX.Page1GB;
+    }
+    else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+    {
+        CPU::x86::Intel::CPUID0x80000001 cpuid;
+        cpuid.Get();
+        fixme("Intel PSE support");
+    }
+
+    if (Page1GBSupport && PSESupport)
+    {
+        debug("1GB Page Support Enabled");
+#if defined(a64)
+        CPU::x64::CR4 cr4 = CPU::x64::readcr4();
+        cr4.PSE = 1;
+        CPU::x64::writecr4(cr4);
+#elif defined(a32)
+        CPU::x32::CR4 cr4 = CPU::x32::readcr4();
+        cr4.PSE = 1;
+        CPU::x32::writecr4(cr4);
+#elif defined(aa64)
+#endif
+    }
+
+    MapFromZero(KernelPageTable, Info);
+    MapFramebuffer(KernelPageTable, Info);
+    MapKernel(KernelPageTable, Info);
+
+    trace("Applying new page table from address %#lx", KernelPageTable);
+#ifdef DEBUG
+    tracepagetable(KernelPageTable);
+#endif
+#if defined(a86)
+    asmv("mov %0, %%cr3" ::"r"(KernelPageTable));
+#elif defined(aa64)
+    asmv("msr ttbr0_el1, %0" ::"r"(KernelPageTable));
+#endif
+    debug("Page table updated.");
+    if (strstr(Info->Kernel.CommandLine, "xallocv1"))
+    {
+        XallocV1Allocator = new Xalloc::V1((void *)KERNEL_HEAP_BASE, false, false);
+        AllocatorType = MemoryAllocatorType::XallocV1;
+        trace("XallocV1 Allocator initialized (%p)", XallocV1Allocator);
+    }
+    else if (strstr(Info->Kernel.CommandLine, "liballoc11"))
+    {
+        AllocatorType = MemoryAllocatorType::liballoc11;
+    }
+}
+
+void *malloc(size_t Size)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(AllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("malloc(%d)->[%s]", Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    void *ret = nullptr;
+    switch (AllocatorType)
+    {
+    case MemoryAllocatorType::Pages:
+    {
+        ret = KernelAllocator.RequestPages(TO_PAGES(Size + 1));
+        memset(ret, 0, Size);
+        break;
+    }
+    case MemoryAllocatorType::XallocV1:
+    {
+        ret = XallocV1Allocator->malloc(Size);
+        break;
+    }
+    case MemoryAllocatorType::liballoc11:
+    {
+        ret = PREFIX(malloc)(Size);
+        memset(ret, 0, Size);
+        break;
+    }
+    default:
+        throw;
+    }
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "malloc( %ld )=%p~%p\n\r",
+                Size,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+void *calloc(size_t n, size_t Size)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(AllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("calloc(%d, %d)->[%s]", n, Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    void *ret = nullptr;
+    switch (AllocatorType)
+    {
+    case MemoryAllocatorType::Pages:
+    {
+        ret = KernelAllocator.RequestPages(TO_PAGES(n * Size + 1));
+        memset(ret, 0, n * Size);
+        break;
+    }
+    case MemoryAllocatorType::XallocV1:
+    {
+        ret = XallocV1Allocator->calloc(n, Size);
+        break;
+    }
+    case MemoryAllocatorType::liballoc11:
+    {
+        void *ret = PREFIX(calloc)(n, Size);
+        memset(ret, 0, Size);
+        return ret;
+    }
+    default:
+        throw;
+    }
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "calloc( %ld %ld )=%p~%p\n\r",
+                n, Size,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+void *realloc(void *Address, size_t Size)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(AllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("realloc(%#lx, %d)->[%s]", Address, Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    void *ret = nullptr;
+    switch (AllocatorType)
+    {
+    case unlikely(MemoryAllocatorType::Pages):
+    {
+        ret = KernelAllocator.RequestPages(TO_PAGES(Size + 1)); // WARNING: Potential memory leak
+        memset(ret, 0, Size);
+        break;
+    }
+    case MemoryAllocatorType::XallocV1:
+    {
+        ret = XallocV1Allocator->realloc(Address, Size);
+        break;
+    }
+    case MemoryAllocatorType::liballoc11:
+    {
+        void *ret = PREFIX(realloc)(Address, Size);
+        memset(ret, 0, Size);
+        return ret;
+    }
+    default:
+        throw;
+    }
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "realloc( %p %ld )=%p~%p\n\r",
+                Address, Size,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+void free(void *Address)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(AllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("free(%#lx)->[%s]", Address, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    switch (AllocatorType)
+    {
+    case unlikely(MemoryAllocatorType::Pages):
+    {
+        KernelAllocator.FreePage(Address); // WARNING: Potential memory leak
+        break;
+    }
+    case MemoryAllocatorType::XallocV1:
+    {
+        XallocV1Allocator->free(Address);
+        break;
+    }
+    case MemoryAllocatorType::liballoc11:
+    {
+        PREFIX(free)
+        (Address);
+        break;
+    }
+    default:
+        throw;
+    }
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "free( %p )~%p\n\r",
+                Address,
+                __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+}
+
+void *operator new(size_t Size)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("new(%d)->[%s]", Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    void *ret = malloc(Size);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "new( %ld )=%p~%p\n\r",
+                Size,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+void *operator new[](size_t Size)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("new[](%d)->[%s]", Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    void *ret = malloc(Size);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "new[]( %ld )=%p~%p\n\r",
+                Size,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+void *operator new(unsigned long Size, std::align_val_t Alignment)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("new(%d, %d)->[%s]", Size, Alignment, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+    fixme("operator new with alignment(%#lx) is not implemented", Alignment);
+
+    void *ret = malloc(Size);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "new( %ld %#lx )=%p~%p\n\r",
+                Size, (uintptr_t)Alignment,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+void operator delete(void *Pointer)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("delete(%#lx)->[%s]", Pointer, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    free(Pointer);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "delete( %p )~%p\n\r",
+                Pointer,
+                __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+}
+
+void operator delete[](void *Pointer)
+{
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("delete[](%#lx)->[%s]", Pointer, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    free(Pointer);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "delete[]( %p )~%p\n\r",
+                Pointer,
+                __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+}
+
+void operator delete(void *Pointer, long unsigned int Size)
+{
+    UNUSED(Size);
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("delete(%#lx, %d)->[%s]", Pointer, Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    free(Pointer);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "delete( %p %ld )~%p\n\r",
+                Pointer, Size,
+                __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+}
+
+void operator delete[](void *Pointer, long unsigned int Size)
+{
+    UNUSED(Size);
+#ifdef DEBUG_ALLOCATIONS_SL
+    SmartLockClass lock___COUNTER__(OperatorAllocatorLock, (KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown"));
+#endif
+    memdbg("delete[](%#lx, %d)->[%s]", Pointer, Size, KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+
+    free(Pointer);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "delete[]( %p %ld )~%p\n\r",
+                Pointer, Size,
+                __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+}
diff --git a/Kernel/Core/Memory/MemoryManager.cpp b/Kernel/Core/Memory/MemoryManager.cpp
new file mode 100644
index 00000000..11d7ee8a
--- /dev/null
+++ b/Kernel/Core/Memory/MemoryManager.cpp
@@ -0,0 +1,250 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <memory.hpp>
+#include <debug.h>
+
+#include "../../kernel.h"
+
+namespace Memory
+{
+    ReadFSFunction(MEM_Read)
+    {
+        if (!Size)
+            Size = node->Length;
+        if (Offset > node->Length)
+            return 0;
+        if (Offset + Size > node->Length)
+            Size = node->Length - Offset;
+        memcpy(Buffer, (uint8_t *)(node->Address + Offset), Size);
+        return Size;
+    }
+
+    WriteFSFunction(MEM_Write)
+    {
+        if (!Size)
+            Size = node->Length;
+        if (Offset > node->Length)
+            return 0;
+        if (Offset + Size > node->Length)
+            Size = node->Length - Offset;
+        memcpy((uint8_t *)(node->Address + Offset), Buffer, Size);
+        return Size;
+    }
+
+    VirtualFileSystem::FileSystemOperations mem_op = {
+        .Name = "mem",
+        .Read = MEM_Read,
+        .Write = MEM_Write,
+    };
+
+    uint64_t MemMgr::GetAllocatedMemorySize()
+    {
+        uint64_t Size = 0;
+        foreach (auto ap in AllocatedPagesList)
+            Size += ap.PageCount;
+        return FROM_PAGES(Size);
+    }
+
+    bool MemMgr::Add(void *Address, size_t Count)
+    {
+        if (Address == nullptr)
+        {
+            error("Address is null!");
+            return false;
+        }
+
+        if (Count == 0)
+        {
+            error("Count is 0!");
+            return false;
+        }
+
+        for (size_t i = 0; i < AllocatedPagesList.size(); i++)
+        {
+            if (AllocatedPagesList[i].Address == Address)
+            {
+                error("Address already exists!");
+                return false;
+            }
+            else if ((uintptr_t)Address < (uintptr_t)AllocatedPagesList[i].Address)
+            {
+                if ((uintptr_t)Address + (Count * PAGE_SIZE) > (uintptr_t)AllocatedPagesList[i].Address)
+                {
+                    error("Address intersects with an allocated page!");
+                    return false;
+                }
+            }
+            else
+            {
+                if ((uintptr_t)AllocatedPagesList[i].Address + (AllocatedPagesList[i].PageCount * PAGE_SIZE) > (uintptr_t)Address)
+                {
+                    error("Address intersects with an allocated page!");
+                    return false;
+                }
+            }
+        }
+
+        if (this->Directory)
+        {
+            char FileName[64];
+            sprintf(FileName, "%lx-%ld", (uintptr_t)Address, Count);
+            VirtualFileSystem::Node *n = vfs->Create(FileName, VirtualFileSystem::NodeFlags::FILE, this->Directory);
+            if (n)
+            {
+                n->Address = (uintptr_t)Address;
+                n->Length = Count * PAGE_SIZE;
+                n->Operator = &mem_op;
+            }
+        }
+
+        AllocatedPagesList.push_back({Address, Count});
+        return true;
+    }
+
+    void *MemMgr::RequestPages(size_t Count, bool User)
+    {
+        void *Address = KernelAllocator.RequestPages(Count);
+        for (size_t i = 0; i < Count; i++)
+        {
+            int Flags = Memory::PTFlag::RW;
+            if (User)
+                Flags |= Memory::PTFlag::US;
+
+            Memory::Virtual(this->PageTable).Remap((void *)((uintptr_t)Address + (i * PAGE_SIZE)), (void *)((uint64_t)Address + (i * PAGE_SIZE)), Flags);
+        }
+
+        if (this->Directory)
+        {
+            char FileName[64];
+            sprintf(FileName, "%lx-%ld", (uintptr_t)Address, Count);
+            VirtualFileSystem::Node *n = vfs->Create(FileName, VirtualFileSystem::NodeFlags::FILE, this->Directory);
+            if (n) // If null, error or file already exists
+            {
+                n->Address = (uintptr_t)Address;
+                n->Length = Count * PAGE_SIZE;
+                n->Operator = &mem_op;
+            }
+        }
+
+        AllocatedPagesList.push_back({Address, Count});
+
+        /* For security reasons, we clear the allocated page
+           if it's a user page. */
+        if (User)
+            memset(Address, 0, Count * PAGE_SIZE);
+
+        return Address;
+    }
+
+    void MemMgr::FreePages(void *Address, size_t Count)
+    {
+        for (size_t i = 0; i < AllocatedPagesList.size(); i++)
+        {
+            if (AllocatedPagesList[i].Address == Address)
+            {
+                /** TODO: Advanced checks. Allow if the page count is less than the requested one.
+                 * This will allow the user to free only a part of the allocated pages.
+                 *
+                 * But this will be in a separate function because we need to specify if we
+                 * want to free from the start or from the end and return the new address.
+                 */
+                if (AllocatedPagesList[i].PageCount != Count)
+                {
+                    error("Page count mismatch! (Allocated: %lld, Requested: %lld)", AllocatedPagesList[i].PageCount, Count);
+                    return;
+                }
+
+                KernelAllocator.FreePages(Address, Count);
+
+                for (size_t i = 0; i < Count; i++)
+                {
+                    Memory::Virtual(this->PageTable).Remap((void *)((uintptr_t)Address + (i * PAGE_SIZE)), (void *)((uint64_t)Address + (i * PAGE_SIZE)), Memory::PTFlag::RW);
+                    // Memory::Virtual(this->PageTable).Unmap((void *)((uintptr_t)Address + (i * PAGE_SIZE)));
+                }
+
+                if (this->Directory)
+                {
+                    char FileName[64];
+                    sprintf(FileName, "%lx-%ld", (uintptr_t)Address, Count);
+                    VirtualFileSystem::FileStatus s = vfs->Delete(FileName, false, this->Directory);
+                    if (s != VirtualFileSystem::FileStatus::OK)
+                        error("Failed to delete file %s", FileName);
+                }
+
+                AllocatedPagesList.remove(i);
+                return;
+            }
+        }
+    }
+
+    void MemMgr::DetachAddress(void *Address)
+    {
+        for (size_t i = 0; i < AllocatedPagesList.size(); i++)
+        {
+            if (AllocatedPagesList[i].Address == Address)
+            {
+                if (this->Directory)
+                {
+                    char FileName[64];
+                    sprintf(FileName, "%lx-%ld", (uintptr_t)Address, AllocatedPagesList[i].PageCount);
+                    VirtualFileSystem::FileStatus s = vfs->Delete(FileName, false, this->Directory);
+                    if (s != VirtualFileSystem::FileStatus::OK)
+                        error("Failed to delete file %s", FileName);
+                }
+
+                AllocatedPagesList.remove(i);
+                return;
+            }
+        }
+    }
+
+    MemMgr::MemMgr(PageTable4 *PageTable, VirtualFileSystem::Node *Directory)
+    {
+        if (PageTable)
+            this->PageTable = PageTable;
+        else
+        {
+#if defined(a64)
+            this->PageTable = (PageTable4 *)CPU::x64::readcr3().raw;
+#elif defined(a32)
+            this->PageTable = (PageTable4 *)CPU::x32::readcr3().raw;
+#endif
+        }
+
+        this->Directory = Directory;
+        debug("+ %#lx", this);
+    }
+
+    MemMgr::~MemMgr()
+    {
+        foreach (auto ap in AllocatedPagesList)
+        {
+            KernelAllocator.FreePages(ap.Address, ap.PageCount);
+            for (size_t i = 0; i < ap.PageCount; i++)
+                Memory::Virtual(this->PageTable).Remap((void *)((uintptr_t)ap.Address + (i * PAGE_SIZE)), (void *)((uintptr_t)ap.Address + (i * PAGE_SIZE)), Memory::PTFlag::RW);
+        }
+
+        if (this->Directory)
+        {
+            foreach (auto Child in this->Directory->Children)
+                vfs->Delete(Child, true);
+        }
+
+        debug("- %#lx", this);
+    }
+}
diff --git a/Kernel/Core/Memory/PageMapIndexer.cpp b/Kernel/Core/Memory/PageMapIndexer.cpp
new file mode 100644
index 00000000..d16212e3
--- /dev/null
+++ b/Kernel/Core/Memory/PageMapIndexer.cpp
@@ -0,0 +1,45 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <memory.hpp>
+
+namespace Memory
+{
+        Virtual::PageMapIndexer::PageMapIndexer(uintptr_t VirtualAddress)
+        {
+#if defined(a64)
+                uintptr_t Address = VirtualAddress;
+                Address >>= 12;
+                this->PTEIndex = Address & 0x1FF;
+                Address >>= 9;
+                this->PDEIndex = Address & 0x1FF;
+                Address >>= 9;
+                this->PDPTEIndex = Address & 0x1FF;
+                Address >>= 9;
+                this->PMLIndex = Address & 0x1FF;
+#elif defined(a32)
+                uintptr_t Address = VirtualAddress;
+                Address >>= 12;
+                this->PTEIndex = Address & 0x3FF;
+                Address >>= 10;
+                this->PDEIndex = Address & 0x3FF;
+                Address >>= 10;
+                this->PDPTEIndex = Address & 0x3FF;
+#elif defined(aa64)
+#endif
+        }
+}
diff --git a/Kernel/Core/Memory/PhysicalMemoryManager.cpp b/Kernel/Core/Memory/PhysicalMemoryManager.cpp
new file mode 100644
index 00000000..67e3280b
--- /dev/null
+++ b/Kernel/Core/Memory/PhysicalMemoryManager.cpp
@@ -0,0 +1,541 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <memory.hpp>
+
+#include <debug.h>
+#ifdef DEBUG
+#include <uart.hpp>
+#endif
+
+#include "../../Architecture/amd64/acpi.hpp"
+
+#include "../../kernel.h"
+
+extern "C" char BootPageTable[]; // 0x10000 in length
+
+namespace Memory
+{
+    uint64_t Physical::GetTotalMemory()
+    {
+        SmartLock(this->MemoryLock);
+        return this->TotalMemory;
+    }
+
+    uint64_t Physical::GetFreeMemory()
+    {
+        SmartLock(this->MemoryLock);
+        return this->FreeMemory;
+    }
+
+    uint64_t Physical::GetReservedMemory()
+    {
+        SmartLock(this->MemoryLock);
+        return this->ReservedMemory;
+    }
+
+    uint64_t Physical::GetUsedMemory()
+    {
+        SmartLock(this->MemoryLock);
+        return this->UsedMemory;
+    }
+
+    bool Physical::SwapPage(void *Address)
+    {
+        fixme("%p", Address);
+        return false;
+    }
+
+    bool Physical::SwapPages(void *Address, size_t PageCount)
+    {
+        for (size_t i = 0; i < PageCount; i++)
+        {
+            if (!this->SwapPage((void *)((uintptr_t)Address + (i * PAGE_SIZE))))
+                return false;
+        }
+        return false;
+    }
+
+    bool Physical::UnswapPage(void *Address)
+    {
+        fixme("%p", Address);
+        return false;
+    }
+
+    bool Physical::UnswapPages(void *Address, size_t PageCount)
+    {
+        for (size_t i = 0; i < PageCount; i++)
+        {
+            if (!this->UnswapPage((void *)((uintptr_t)Address + (i * PAGE_SIZE))))
+                return false;
+        }
+        return false;
+    }
+
+    void *Physical::RequestPage()
+    {
+        SmartLock(this->MemoryLock);
+
+        for (; PageBitmapIndex < PageBitmap.Size * 8; PageBitmapIndex++)
+        {
+            if (PageBitmap[PageBitmapIndex] == true)
+                continue;
+
+            this->LockPage((void *)(PageBitmapIndex * PAGE_SIZE));
+#ifdef DEBUG
+            if (EnableExternalMemoryTracer)
+            {
+                char LockTmpStr[64];
+                strcpy_unsafe(LockTmpStr, __FUNCTION__);
+                strcat_unsafe(LockTmpStr, "_memTrk");
+                mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+                sprintf(mExtTrkLog, "RequestPage( )=%p~%p\n\r",
+                        (void *)(PageBitmapIndex * PAGE_SIZE), __builtin_return_address(0));
+                UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+                for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+                {
+                    if (mExtTrkLog[i] == '\r')
+                        break;
+                    mTrkUART.Write(mExtTrkLog[i]);
+                }
+                mExtTrkLock.Unlock();
+            }
+#endif
+            return (void *)(PageBitmapIndex * PAGE_SIZE);
+        }
+
+        if (this->SwapPage((void *)(PageBitmapIndex * PAGE_SIZE)))
+        {
+            this->LockPage((void *)(PageBitmapIndex * PAGE_SIZE));
+            return (void *)(PageBitmapIndex * PAGE_SIZE);
+        }
+
+        error("Out of memory! (Free: %ldMB; Used: %ldMB; Reserved: %ldMB)", TO_MB(FreeMemory), TO_MB(UsedMemory), TO_MB(ReservedMemory));
+        CPU::Stop();
+        __builtin_unreachable();
+    }
+
+    void *Physical::RequestPages(size_t Count)
+    {
+        SmartLock(this->MemoryLock);
+
+        for (; PageBitmapIndex < PageBitmap.Size * 8; PageBitmapIndex++)
+        {
+            if (PageBitmap[PageBitmapIndex] == true)
+                continue;
+
+            for (uint64_t Index = PageBitmapIndex; Index < PageBitmap.Size * 8; Index++)
+            {
+                if (PageBitmap[Index] == true)
+                    continue;
+
+                for (size_t i = 0; i < Count; i++)
+                {
+                    if (PageBitmap[Index + i] == true)
+                        goto NextPage;
+                }
+
+                this->LockPages((void *)(Index * PAGE_SIZE), Count);
+#ifdef DEBUG
+                if (EnableExternalMemoryTracer)
+                {
+                    char LockTmpStr[64];
+                    strcpy_unsafe(LockTmpStr, __FUNCTION__);
+                    strcat_unsafe(LockTmpStr, "_memTrk");
+                    mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+                    sprintf(mExtTrkLog, "RequestPages( %ld )=%p~%p\n\r",
+                            Count,
+                            (void *)(Index * PAGE_SIZE), __builtin_return_address(0));
+                    UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+                    for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+                    {
+                        if (mExtTrkLog[i] == '\r')
+                            break;
+                        mTrkUART.Write(mExtTrkLog[i]);
+                    }
+                    mExtTrkLock.Unlock();
+                }
+#endif
+                return (void *)(Index * PAGE_SIZE);
+
+            NextPage:
+                Index += Count;
+                continue;
+            }
+        }
+
+        if (this->SwapPages((void *)(PageBitmapIndex * PAGE_SIZE), Count))
+        {
+            this->LockPages((void *)(PageBitmapIndex * PAGE_SIZE), Count);
+            return (void *)(PageBitmapIndex * PAGE_SIZE);
+        }
+
+        error("Out of memory! (Free: %ldMB; Used: %ldMB; Reserved: %ldMB)", TO_MB(FreeMemory), TO_MB(UsedMemory), TO_MB(ReservedMemory));
+        CPU::Halt(true);
+        __builtin_unreachable();
+    }
+
+    void Physical::FreePage(void *Address)
+    {
+        SmartLock(this->MemoryLock);
+
+        if (unlikely(Address == nullptr))
+        {
+            warn("Null pointer passed to FreePage.");
+            return;
+        }
+
+        size_t Index = (size_t)Address / PAGE_SIZE;
+
+        if (unlikely(PageBitmap[Index] == false))
+        {
+            warn("Tried to free an already free page. (%p)", Address);
+            return;
+        }
+
+        if (PageBitmap.Set(Index, false))
+        {
+            FreeMemory += PAGE_SIZE;
+            UsedMemory -= PAGE_SIZE;
+            if (PageBitmapIndex > Index)
+                PageBitmapIndex = Index;
+        }
+
+#ifdef DEBUG
+        if (EnableExternalMemoryTracer)
+        {
+            char LockTmpStr[64];
+            strcpy_unsafe(LockTmpStr, __FUNCTION__);
+            strcat_unsafe(LockTmpStr, "_memTrk");
+            mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+            sprintf(mExtTrkLog, "FreePage( %p )~%p\n\r",
+                    Address,
+                    __builtin_return_address(0));
+            UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+            for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+            {
+                if (mExtTrkLog[i] == '\r')
+                    break;
+                mTrkUART.Write(mExtTrkLog[i]);
+            }
+            mExtTrkLock.Unlock();
+        }
+#endif
+    }
+
+    void Physical::FreePages(void *Address, size_t Count)
+    {
+        if (unlikely(Address == nullptr || Count == 0))
+        {
+            warn("%s%s%s passed to FreePages.", Address == nullptr ? "Null pointer " : "", Address == nullptr && Count == 0 ? "and " : "", Count == 0 ? "Zero count" : "");
+            return;
+        }
+#ifdef DEBUG
+        if (EnableExternalMemoryTracer)
+        {
+            char LockTmpStr[64];
+            strcpy_unsafe(LockTmpStr, __FUNCTION__);
+            strcat_unsafe(LockTmpStr, "_memTrk");
+            mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+            sprintf(mExtTrkLog, "!FreePages( %p %ld )~%p\n\r",
+                    Address, Count,
+                    __builtin_return_address(0));
+            UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+            for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+            {
+                if (mExtTrkLog[i] == '\r')
+                    break;
+                mTrkUART.Write(mExtTrkLog[i]);
+            }
+            mExtTrkLock.Unlock();
+        }
+#endif
+        for (size_t t = 0; t < Count; t++)
+            this->FreePage((void *)((uintptr_t)Address + (t * PAGE_SIZE)));
+    }
+
+    void Physical::LockPage(void *Address)
+    {
+        if (unlikely(Address == nullptr))
+            warn("Trying to lock null address.");
+
+        uintptr_t Index = (uintptr_t)Address / PAGE_SIZE;
+
+        if (unlikely(PageBitmap[Index] == true))
+            return;
+
+        if (PageBitmap.Set(Index, true))
+        {
+            FreeMemory -= PAGE_SIZE;
+            UsedMemory += PAGE_SIZE;
+        }
+    }
+
+    void Physical::LockPages(void *Address, size_t PageCount)
+    {
+        if (unlikely(Address == nullptr || PageCount == 0))
+            warn("Trying to lock %s%s.", Address ? "null address" : "", PageCount ? "0 pages" : "");
+
+        for (size_t i = 0; i < PageCount; i++)
+            this->LockPage((void *)((uintptr_t)Address + (i * PAGE_SIZE)));
+    }
+
+    void Physical::ReservePage(void *Address)
+    {
+        if (unlikely(Address == nullptr))
+            warn("Trying to reserve null address.");
+
+        uintptr_t Index = (Address == NULL) ? 0 : (uintptr_t)Address / PAGE_SIZE;
+
+        if (unlikely(PageBitmap[Index] == true))
+            return;
+
+        if (PageBitmap.Set(Index, true))
+        {
+            FreeMemory -= PAGE_SIZE;
+            ReservedMemory += PAGE_SIZE;
+        }
+    }
+
+    void Physical::ReservePages(void *Address, size_t PageCount)
+    {
+        if (unlikely(Address == nullptr || PageCount == 0))
+            warn("Trying to reserve %s%s.", Address ? "null address" : "", PageCount ? "0 pages" : "");
+
+        for (size_t t = 0; t < PageCount; t++)
+        {
+            uintptr_t Index = ((uintptr_t)Address + (t * PAGE_SIZE)) / PAGE_SIZE;
+
+            if (unlikely(PageBitmap[Index] == true))
+                return;
+
+            if (PageBitmap.Set(Index, true))
+            {
+                FreeMemory -= PAGE_SIZE;
+                ReservedMemory += PAGE_SIZE;
+            }
+        }
+    }
+
+    void Physical::UnreservePage(void *Address)
+    {
+        if (unlikely(Address == nullptr))
+            warn("Trying to unreserve null address.");
+
+        uintptr_t Index = (Address == NULL) ? 0 : (uintptr_t)Address / PAGE_SIZE;
+
+        if (unlikely(PageBitmap[Index] == false))
+            return;
+
+        if (PageBitmap.Set(Index, false))
+        {
+            FreeMemory += PAGE_SIZE;
+            ReservedMemory -= PAGE_SIZE;
+            if (PageBitmapIndex > Index)
+                PageBitmapIndex = Index;
+        }
+    }
+
+    void Physical::UnreservePages(void *Address, size_t PageCount)
+    {
+        if (unlikely(Address == nullptr || PageCount == 0))
+            warn("Trying to unreserve %s%s.", Address ? "null address" : "", PageCount ? "0 pages" : "");
+
+        for (size_t t = 0; t < PageCount; t++)
+        {
+            uintptr_t Index = ((uintptr_t)Address + (t * PAGE_SIZE)) / PAGE_SIZE;
+
+            if (unlikely(PageBitmap[Index] == false))
+                return;
+
+            if (PageBitmap.Set(Index, false))
+            {
+                FreeMemory += PAGE_SIZE;
+                ReservedMemory -= PAGE_SIZE;
+                if (PageBitmapIndex > Index)
+                    PageBitmapIndex = Index;
+            }
+        }
+    }
+
+    void Physical::Init(BootInfo *Info)
+    {
+        SmartLock(this->MemoryLock);
+
+        uint64_t MemorySize = Info->Memory.Size;
+        debug("Memory size: %lld bytes (%ld pages)", MemorySize, TO_PAGES(MemorySize));
+        TotalMemory = MemorySize;
+        FreeMemory = MemorySize;
+
+        size_t BitmapSize = (MemorySize / PAGE_SIZE) / 8 + 1;
+        void *LargestFreeMemorySegment = nullptr;
+        uint64_t LargestFreeMemorySegmentSize = 0;
+
+        for (uint64_t i = 0; i < Info->Memory.Entries; i++)
+        {
+            if (Info->Memory.Entry[i].Type == Usable)
+            {
+                if (Info->Memory.Entry[i].Length > LargestFreeMemorySegmentSize)
+                {
+                    /* We don't want to use 0 as a memory address. */
+                    if (Info->Memory.Entry[i].BaseAddress == 0x0)
+                    {
+                        debug("Ignoring memory segment at 0x0");
+                        continue;
+                    }
+
+                    if (Info->Memory.Entry[i].Length > BitmapSize + 0x1000)
+                    {
+                        LargestFreeMemorySegment = (void *)Info->Memory.Entry[i].BaseAddress;
+                        LargestFreeMemorySegmentSize = Info->Memory.Entry[i].Length;
+
+#define ROUND_UP(N, S) ((((N) + (S)-1) / (S)) * (S))
+                        if (LargestFreeMemorySegment >= Info->Kernel.PhysicalBase &&
+                            LargestFreeMemorySegment <= (void *)((uintptr_t)Info->Kernel.PhysicalBase + Info->Kernel.Size))
+                        {
+                            debug("Kernel range: %#lx-%#lx", Info->Kernel.PhysicalBase, (void *)((uintptr_t)Info->Kernel.PhysicalBase + Info->Kernel.Size));
+
+                            void *NewLargestFreeMemorySegment = (void *)((uintptr_t)Info->Kernel.PhysicalBase + Info->Kernel.Size);
+                            void *RoundNewLargestFreeMemorySegment = (void *)ROUND_UP((uintptr_t)NewLargestFreeMemorySegment, PAGE_SIZE);
+                            RoundNewLargestFreeMemorySegment = (void *)((uintptr_t)RoundNewLargestFreeMemorySegment + PAGE_SIZE); /* Leave a page between the kernel and the bitmap */
+
+                            debug("Rounding %p to %p", NewLargestFreeMemorySegment, RoundNewLargestFreeMemorySegment);
+                            info("Memory bitmap's memory segment is in the kernel, moving it to %p", RoundNewLargestFreeMemorySegment);
+                            LargestFreeMemorySegmentSize = (uintptr_t)LargestFreeMemorySegmentSize - ((uintptr_t)RoundNewLargestFreeMemorySegment - (uintptr_t)LargestFreeMemorySegment);
+                            LargestFreeMemorySegment = RoundNewLargestFreeMemorySegment;
+                        }
+#undef ROUND_UP
+
+                        if (LargestFreeMemorySegmentSize < BitmapSize + 0x1000)
+                        {
+                            trace("Largest free memory segment is too small (%lld bytes), skipping...",
+                                  LargestFreeMemorySegmentSize);
+                            continue;
+                        }
+
+                        debug("Found a memory segment of %lld bytes (%lldMB) at %llp (out segment is %lld bytes (%lldKB)))",
+                              LargestFreeMemorySegmentSize,
+                              TO_MB(LargestFreeMemorySegmentSize),
+                              LargestFreeMemorySegment,
+                              BitmapSize,
+                              TO_KB(BitmapSize));
+                        break;
+                    }
+
+                    //     LargestFreeMemorySegment = (void *)Info->Memory.Entry[i].BaseAddress;
+                    //     LargestFreeMemorySegmentSize = Info->Memory.Entry[i].Length;
+
+                    //     debug("Largest free memory segment: %llp (%lldMB)",
+                    //           (void *)Info->Memory.Entry[i].BaseAddress,
+                    //           TO_MB(Info->Memory.Entry[i].Length));
+                }
+            }
+        }
+
+        if (LargestFreeMemorySegment == nullptr)
+        {
+            error("No free memory found!");
+            CPU::Stop();
+        }
+
+        /* TODO: Read swap config and make the configure the bitmap size correctly */
+        debug("Initializing Bitmap at %llp-%llp (%lld Bytes)",
+              LargestFreeMemorySegment,
+              (void *)((uintptr_t)LargestFreeMemorySegment + BitmapSize),
+              BitmapSize);
+
+        PageBitmap.Size = BitmapSize;
+        PageBitmap.Buffer = (uint8_t *)LargestFreeMemorySegment;
+        for (size_t i = 0; i < BitmapSize; i++)
+            *(uint8_t *)(PageBitmap.Buffer + i) = 0;
+
+        debug("Reserving pages...");
+        this->ReservePages(0, TO_PAGES(Info->Memory.Size));
+        debug("Unreserving usable pages...");
+
+        for (uint64_t i = 0; i < Info->Memory.Entries; i++)
+        {
+            if (Info->Memory.Entry[i].Type == Usable && Info->Memory.Entry[i].BaseAddress != 0x0)
+                this->UnreservePages(Info->Memory.Entry[i].BaseAddress, TO_PAGES(Info->Memory.Entry[i].Length));
+        }
+
+        debug("Reserving pages for SMP...");
+        this->ReservePage((void *)0x0);        /* Trampoline stack, gdt, idt, etc... */
+        this->ReservePages((void *)0x2000, 4); /* TRAMPOLINE_START */
+
+        debug("Reserving bitmap region %#lx-%#lx...", PageBitmap.Buffer, (void *)((uintptr_t)PageBitmap.Buffer + PageBitmap.Size));
+        this->ReservePages(PageBitmap.Buffer, TO_PAGES(PageBitmap.Size));
+        // debug("Reserving page table...");
+        // this->ReservePages(BootPageTable, TO_PAGES(0x10000)); << in the bootstrap region
+        debug("Reserving kernel bootstrap region %#lx-%#lx...", &_bootstrap_start, &_bootstrap_end);
+        this->ReservePages(&_bootstrap_start, TO_PAGES((uintptr_t)&_bootstrap_end - (uintptr_t)&_bootstrap_start));
+        void *KernelPhysicalStart = (void *)(((uintptr_t)&_kernel_start - KERNEL_VMA_OFFSET));
+        void *KernelPhysicalEnd = (void *)(((uintptr_t)&_kernel_end - KERNEL_VMA_OFFSET));
+        debug("Reserving kernel region %#lx-%#lx...", KernelPhysicalStart, KernelPhysicalEnd);
+        this->ReservePages((void *)KernelPhysicalStart, TO_PAGES((uintptr_t)&_kernel_end - (uintptr_t)&_kernel_start));
+
+        ACPI::ACPI::ACPIHeader *hdr = nullptr;
+        bool XSDT = false;
+
+        if (Info->RSDP->Revision >= 2 && Info->RSDP->XSDTAddress)
+        {
+            hdr = (ACPI::ACPI::ACPIHeader *)(Info->RSDP->XSDTAddress);
+            XSDT = true;
+        }
+        else
+        {
+            hdr = (ACPI::ACPI::ACPIHeader *)(uintptr_t)Info->RSDP->RSDTAddress;
+        }
+
+        debug("Reserving RSDT...");
+        this->ReservePages((void*)Info->RSDP, TO_PAGES(sizeof(BootInfo::RSDPInfo)));
+
+        debug("Reserving ACPI tables...");
+
+        uint64_t TableSize = ((hdr->Length - sizeof(ACPI::ACPI::ACPIHeader)) / (XSDT ? 8 : 4));
+        debug("Table size: %lld", TableSize);
+
+        for (uint64_t t = 0; t < TableSize; t++)
+        {
+            // TODO: Should I be concerned about unaligned memory access?
+            ACPI::ACPI::ACPIHeader *SDTHdr = nullptr;
+            if (XSDT)
+                SDTHdr = (ACPI::ACPI::ACPIHeader *)(*(uint64_t *)((uint64_t)hdr + sizeof(ACPI::ACPI::ACPIHeader) + (t * 8)));
+            else
+                SDTHdr = (ACPI::ACPI::ACPIHeader *)(*(uint32_t *)((uint64_t)hdr + sizeof(ACPI::ACPI::ACPIHeader) + (t * 4)));
+
+            this->ReservePages(SDTHdr, TO_PAGES(SDTHdr->Length));
+        }
+
+        debug("Reserving kernel modules...");
+
+        for (uint64_t i = 0; i < MAX_MODULES; i++)
+        {
+            if (Info->Modules[i].Address == 0x0)
+                continue;
+
+            debug("Reserving module %s (%#lx-%#lx)...", Info->Modules[i].CommandLine,
+                  Info->Modules[i].Address, (void *)((uintptr_t)Info->Modules[i].Address + Info->Modules[i].Size));
+        
+            this->ReservePages((void *)Info->Modules[i].Address, TO_PAGES(Info->Modules[i].Size));
+        }
+
+    }
+
+    Physical::Physical() {}
+    Physical::~Physical() {}
+}
diff --git a/Kernel/Core/Memory/StackGuard.cpp b/Kernel/Core/Memory/StackGuard.cpp
new file mode 100644
index 00000000..e9ac4024
--- /dev/null
+++ b/Kernel/Core/Memory/StackGuard.cpp
@@ -0,0 +1,110 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <memory.hpp>
+
+#include <debug.h>
+
+namespace Memory
+{
+    StackGuard::StackGuard(bool User, PageTable4 *Table)
+    {
+        this->UserMode = User;
+        this->Table = Table;
+
+        if (this->UserMode)
+        {
+            void *AllocatedStack = KernelAllocator.RequestPages(TO_PAGES(USER_STACK_SIZE + 1));
+            memset(AllocatedStack, 0, USER_STACK_SIZE);
+            debug("AllocatedStack: %p", AllocatedStack);
+
+            Virtual va = Virtual(Table);
+            for (size_t i = 0; i < TO_PAGES(USER_STACK_SIZE); i++)
+            {
+                va.Map((void *)(USER_STACK_BASE + (i * PAGE_SIZE)),
+                                   (void *)((uintptr_t)AllocatedStack + (i * PAGE_SIZE)),
+                                   PTFlag::RW | PTFlag::US);
+
+                debug("Mapped %p to %p", (void *)(USER_STACK_BASE + (i * PAGE_SIZE)),
+                      (void *)((uintptr_t)AllocatedStack + (i * PAGE_SIZE)));
+            }
+
+            this->StackBottom = (void *)USER_STACK_BASE;
+            this->StackTop = (void *)(USER_STACK_BASE + USER_STACK_SIZE);
+
+            this->StackPhyiscalBottom = AllocatedStack;
+            this->StackPhyiscalTop = (void *)((uintptr_t)AllocatedStack + USER_STACK_SIZE);
+
+            this->Size = USER_STACK_SIZE;
+        }
+        else
+        {
+            this->StackBottom = KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE + 1));
+            memset(this->StackBottom, 0, STACK_SIZE);
+            debug("StackBottom: %p", this->StackBottom);
+
+            this->StackTop = (void *)((uintptr_t)this->StackBottom + STACK_SIZE);
+
+            this->StackPhyiscalBottom = this->StackBottom;
+            this->StackPhyiscalTop = this->StackTop;
+
+            this->Size = STACK_SIZE;
+        }
+
+        debug("Allocated stack at %p", this->StackBottom);
+    }
+
+    StackGuard::~StackGuard()
+    {
+        fixme("Temporarily disabled stack guard deallocation");
+        // KernelAllocator.FreePages(this->StackBottom, TO_PAGES(this->Size + 1));
+        // debug("Freed stack at %p", this->StackBottom);
+    }
+
+    bool StackGuard::Expand(uintptr_t FaultAddress)
+    {
+        if (this->UserMode)
+        {
+            if (FaultAddress < (uintptr_t)this->StackBottom - USER_STACK_SIZE ||
+                FaultAddress > (uintptr_t)this->StackTop)
+            {
+                return false; /* It's not about the stack. */
+            }
+            else
+            {
+                void *AllocatedStack = KernelAllocator.RequestPages(TO_PAGES(USER_STACK_SIZE + 1));
+                debug("AllocatedStack: %p", AllocatedStack);
+                memset(AllocatedStack, 0, USER_STACK_SIZE);
+                Virtual va = Virtual(this->Table);
+                for (uintptr_t i = 0; i < TO_PAGES(USER_STACK_SIZE); i++)
+                {
+                    va.Map((void *)((uintptr_t)this->StackBottom - (i * PAGE_SIZE)), (void *)((uintptr_t)AllocatedStack + (i * PAGE_SIZE)), PTFlag::RW | PTFlag::US);
+                    debug("Mapped %p to %p", (void *)((uintptr_t)this->StackBottom - (i * PAGE_SIZE)), (void *)((uintptr_t)AllocatedStack + (i * PAGE_SIZE)));
+                }
+                this->StackBottom = (void *)((uintptr_t)this->StackBottom - USER_STACK_SIZE);
+                this->Size += USER_STACK_SIZE;
+                info("Stack expanded to %p", this->StackBottom);
+                return true;
+            }
+        }
+        else
+        {
+            fixme("Not implemented and probably not needed");
+            return false;
+        }
+    }
+}
diff --git a/Kernel/Core/Memory/VirtualMemoryManager.cpp b/Kernel/Core/Memory/VirtualMemoryManager.cpp
new file mode 100644
index 00000000..a758c71a
--- /dev/null
+++ b/Kernel/Core/Memory/VirtualMemoryManager.cpp
@@ -0,0 +1,304 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <memory.hpp>
+
+#include <convert.h>
+#include <debug.h>
+
+namespace Memory
+{
+    bool Virtual::Check(void *VirtualAddress, PTFlag Flag, MapType Type)
+    {
+        // 0x1000 aligned
+        uintptr_t Address = (uintptr_t)VirtualAddress;
+        Address &= 0xFFFFFFFFFFFFF000;
+
+        PageMapIndexer Index = PageMapIndexer(Address);
+        PageMapLevel4 PML4 = this->Table->Entries[Index.PMLIndex];
+
+        PageDirectoryPointerTableEntryPtr *PDPTE = nullptr;
+        PageDirectoryEntryPtr *PDE = nullptr;
+        PageTableEntryPtr *PTE = nullptr;
+
+        if ((PML4.raw & Flag) > 0)
+        {
+            PDPTE = (PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4.GetAddress() << 12);
+            if (PDPTE)
+            {
+                if ((PDPTE->Entries[Index.PDPTEIndex].Present))
+                {
+                    if (Type == MapType::OneGB && PDPTE->Entries[Index.PDPTEIndex].PageSize)
+                        return true;
+
+                    PDE = (PageDirectoryEntryPtr *)((uintptr_t)PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+                    if (PDE)
+                    {
+                        if (Type == MapType::TwoMB && PDE->Entries[Index.PDEIndex].PageSize)
+                            return true;
+
+                        if ((PDE->Entries[Index.PDEIndex].Present))
+                        {
+                            PTE = (PageTableEntryPtr *)((uintptr_t)PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+                            if (PTE)
+                            {
+                                if ((PTE->Entries[Index.PTEIndex].Present))
+                                    return true;
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        return false;
+    }
+
+    void *Virtual::GetPhysical(void *VirtualAddress)
+    {
+        // 0x1000 aligned
+        uintptr_t Address = (uintptr_t)VirtualAddress;
+        Address &= 0xFFFFFFFFFFFFF000;
+
+        PageMapIndexer Index = PageMapIndexer(Address);
+        PageMapLevel4 PML4 = this->Table->Entries[Index.PMLIndex];
+
+        PageDirectoryPointerTableEntryPtr *PDPTE = nullptr;
+        PageDirectoryEntryPtr *PDE = nullptr;
+        PageTableEntryPtr *PTE = nullptr;
+
+        if (PML4.Present)
+        {
+            PDPTE = (PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4.GetAddress() << 12);
+            if (PDPTE)
+            {
+                if (PDPTE->Entries[Index.PDPTEIndex].Present)
+                {
+                    if (PDPTE->Entries[Index.PDPTEIndex].PageSize)
+                        return (void *)((uintptr_t)PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+
+                    PDE = (PageDirectoryEntryPtr *)((uintptr_t)PDPTE->Entries[Index.PDPTEIndex].GetAddress() << 12);
+                    if (PDE)
+                    {
+                        if (PDE->Entries[Index.PDEIndex].Present)
+                        {
+                            if (PDE->Entries[Index.PDEIndex].PageSize)
+                                return (void *)((uintptr_t)PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+
+                            PTE = (PageTableEntryPtr *)((uintptr_t)PDE->Entries[Index.PDEIndex].GetAddress() << 12);
+                            if (PTE)
+                            {
+                                if (PTE->Entries[Index.PTEIndex].Present)
+                                    return (void *)((uintptr_t)PTE->Entries[Index.PTEIndex].GetAddress() << 12);
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        return nullptr;
+    }
+
+    void Virtual::Map(void *VirtualAddress, void *PhysicalAddress, uint64_t Flags, MapType Type)
+    {
+        SmartLock(this->MemoryLock);
+        if (unlikely(!this->Table))
+        {
+            error("No page table");
+            return;
+        }
+
+        Flags |= PTFlag::P;
+
+        PageMapIndexer Index = PageMapIndexer((uintptr_t)VirtualAddress);
+        // Clear any flags that are not 1 << 0 (Present) - 1 << 5 (Accessed) because rest are for page table entries only
+        uint64_t DirectoryFlags = Flags & 0x3F;
+
+        PageMapLevel4 *PML4 = &this->Table->Entries[Index.PMLIndex];
+        PageDirectoryPointerTableEntryPtr *PDPTEPtr = nullptr;
+        if (!PML4->Present)
+        {
+            PDPTEPtr = (PageDirectoryPointerTableEntryPtr *)KernelAllocator.RequestPages(TO_PAGES(sizeof(PageDirectoryPointerTableEntryPtr) + 1));
+            memset(PDPTEPtr, 0, sizeof(PageDirectoryPointerTableEntryPtr));
+            PML4->Present = true;
+            PML4->SetAddress((uintptr_t)PDPTEPtr >> 12);
+        }
+        else
+            PDPTEPtr = (PageDirectoryPointerTableEntryPtr *)(PML4->GetAddress() << 12);
+        PML4->raw |= DirectoryFlags;
+
+        PageDirectoryPointerTableEntry *PDPTE = &PDPTEPtr->Entries[Index.PDPTEIndex];
+        if (Type == MapType::OneGB)
+        {
+            PDPTE->raw |= Flags;
+            PDPTE->PageSize = true;
+            PDPTE->SetAddress((uintptr_t)PhysicalAddress >> 12);
+            debug("Mapped 1GB page at %p to %p", VirtualAddress, PhysicalAddress);
+            return;
+        }
+
+        PageDirectoryEntryPtr *PDEPtr = nullptr;
+        if (!PDPTE->Present)
+        {
+            PDEPtr = (PageDirectoryEntryPtr *)KernelAllocator.RequestPages(TO_PAGES(sizeof(PageDirectoryEntryPtr) + 1));
+            memset(PDEPtr, 0, sizeof(PageDirectoryEntryPtr));
+            PDPTE->Present = true;
+            PDPTE->SetAddress((uintptr_t)PDEPtr >> 12);
+        }
+        else
+            PDEPtr = (PageDirectoryEntryPtr *)(PDPTE->GetAddress() << 12);
+        PDPTE->raw |= DirectoryFlags;
+
+        PageDirectoryEntry *PDE = &PDEPtr->Entries[Index.PDEIndex];
+        if (Type == MapType::TwoMB)
+        {
+            PDE->raw |= Flags;
+            PDE->PageSize = true;
+            PDE->SetAddress((uintptr_t)PhysicalAddress >> 12);
+            debug("Mapped 2MB page at %p to %p", VirtualAddress, PhysicalAddress);
+            return;
+        }
+
+        PageTableEntryPtr *PTEPtr = nullptr;
+        if (!PDE->Present)
+        {
+            PTEPtr = (PageTableEntryPtr *)KernelAllocator.RequestPages(TO_PAGES(sizeof(PageTableEntryPtr) + 1));
+            memset(PTEPtr, 0, sizeof(PageTableEntryPtr));
+            PDE->Present = true;
+            PDE->SetAddress((uintptr_t)PTEPtr >> 12);
+        }
+        else
+            PTEPtr = (PageTableEntryPtr *)(PDE->GetAddress() << 12);
+        PDE->raw |= DirectoryFlags;
+
+        PageTableEntry *PTE = &PTEPtr->Entries[Index.PTEIndex];
+        PTE->Present = true;
+        PTE->raw |= Flags;
+        PTE->SetAddress((uintptr_t)PhysicalAddress >> 12);
+
+#if defined(a64)
+        CPU::x64::invlpg(VirtualAddress);
+#elif defined(a32)
+        CPU::x32::invlpg(VirtualAddress);
+#elif defined(aa64)
+        asmv("dsb sy");
+        asmv("tlbi vae1is, %0"
+             :
+             : "r"(VirtualAddress)
+             : "memory");
+        asmv("dsb sy");
+        asmv("isb");
+#endif
+
+#ifdef DEBUG
+/* https://stackoverflow.com/a/3208376/9352057 */
+#define BYTE_TO_BINARY_PATTERN "%c%c%c%c%c%c%c%c"
+#define BYTE_TO_BINARY(byte)       \
+    (byte & 0x80 ? '1' : '0'),     \
+        (byte & 0x40 ? '1' : '0'), \
+        (byte & 0x20 ? '1' : '0'), \
+        (byte & 0x10 ? '1' : '0'), \
+        (byte & 0x08 ? '1' : '0'), \
+        (byte & 0x04 ? '1' : '0'), \
+        (byte & 0x02 ? '1' : '0'), \
+        (byte & 0x01 ? '1' : '0')
+
+        if (!this->Check(VirtualAddress, (PTFlag)Flags, Type)) // quick workaround just to see where it fails
+            warn("Failed to map v:%#lx p:%#lx with flags: " BYTE_TO_BINARY_PATTERN, VirtualAddress, PhysicalAddress, BYTE_TO_BINARY(Flags));
+#endif
+    }
+
+    void Virtual::Unmap(void *VirtualAddress, MapType Type)
+    {
+        SmartLock(this->MemoryLock);
+        if (!this->Table)
+        {
+            error("No page table");
+            return;
+        }
+
+        PageMapIndexer Index = PageMapIndexer((uintptr_t)VirtualAddress);
+        PageMapLevel4 *PML4 = &this->Table->Entries[Index.PMLIndex];
+        if (!PML4->Present)
+        {
+            error("Page %#lx not present", PML4->GetAddress());
+            return;
+        }
+
+        PageDirectoryPointerTableEntryPtr *PDPTEPtr = (PageDirectoryPointerTableEntryPtr *)((uintptr_t)PML4->Address << 12);
+        PageDirectoryPointerTableEntry *PDPTE = &PDPTEPtr->Entries[Index.PDPTEIndex];
+        if (!PDPTE->Present)
+        {
+            error("Page %#lx not present", PDPTE->GetAddress());
+            return;
+        }
+
+        if (Type == MapType::OneGB && PDPTE->PageSize)
+        {
+            PDPTE->Present = false;
+            return;
+        }
+
+        PageDirectoryEntryPtr *PDEPtr = (PageDirectoryEntryPtr *)((uintptr_t)PDPTE->Address << 12);
+        PageDirectoryEntry *PDE = &PDEPtr->Entries[Index.PDEIndex];
+        if (!PDE->Present)
+        {
+            error("Page %#lx not present", PDE->GetAddress());
+            return;
+        }
+
+        if (Type == MapType::TwoMB && PDE->PageSize)
+        {
+            PDE->Present = false;
+            return;
+        }
+
+        PageTableEntryPtr *PTEPtr = (PageTableEntryPtr *)((uintptr_t)PDE->Address << 12);
+        PageTableEntry PTE = PTEPtr->Entries[Index.PTEIndex];
+        if (!PTE.Present)
+        {
+            error("Page %#lx not present", PTE.GetAddress());
+            return;
+        }
+
+        PTE.Present = false;
+        PTEPtr->Entries[Index.PTEIndex] = PTE;
+
+#if defined(a64)
+        CPU::x64::invlpg(VirtualAddress);
+#elif defined(a32)
+        CPU::x32::invlpg(VirtualAddress);
+#elif defined(aa64)
+        asmv("dsb sy");
+        asmv("tlbi vae1is, %0"
+             :
+             : "r"(VirtualAddress)
+             : "memory");
+        asmv("dsb sy");
+        asmv("isb");
+#endif
+    }
+
+    Virtual::Virtual(PageTable4 *Table)
+    {
+        if (Table)
+            this->Table = Table;
+        else
+            this->Table = (PageTable4 *)CPU::PageTable();
+    }
+
+    Virtual::~Virtual() {}
+}
diff --git a/Kernel/Core/PeripheralComponentInterconnect.cpp b/Kernel/Core/PeripheralComponentInterconnect.cpp
new file mode 100644
index 00000000..1ea91fd5
--- /dev/null
+++ b/Kernel/Core/PeripheralComponentInterconnect.cpp
@@ -0,0 +1,886 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <pci.hpp>
+
+#include <memory.hpp>
+#include <power.hpp>
+#if defined(a64)
+#include "../Architecture/amd64/acpi.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../kernel.h"
+
+namespace PCI
+{
+    namespace Descriptors
+    {
+        const char *u8ToHexString(uint8_t Value)
+        {
+            static char Buffer[3];
+            memset(Buffer, 0, 3);
+            for (size_t i = 0; i < 2; i++)
+            {
+                uint8_t Digit = (Value >> (4 - (i * 4))) & 0xF;
+                if (Digit < 10)
+                    Buffer[i] = s_cst(char, '0' + Digit);
+                else
+                    Buffer[i] = s_cst(char, 'A' + (Digit - 10));
+            }
+            return Buffer;
+        }
+
+        const char *u32ToHexString(uint32_t Value)
+        {
+            static char Buffer[9];
+            memset(Buffer, 0, 9);
+            for (size_t i = 0; i < 8; i++)
+            {
+                uint8_t Digit = (Value >> (28 - (i * 4))) & 0xF;
+                if (Digit < 10)
+                    Buffer[i] = s_cst(char, '0' + Digit);
+                else
+                    Buffer[i] = s_cst(char, 'A' + (Digit - 10));
+            }
+            return Buffer;
+        }
+
+        const char *MassStorageControllerSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "SCSI Bus Controller";
+            case 0x01:
+                return "IDE Controller";
+            case 0x02:
+                return "Floppy Disk Controller";
+            case 0x03:
+                return "IPI Bus Controller";
+            case 0x04:
+                return "RAID Controller";
+            case 0x05:
+                return "ATA Controller";
+            case 0x06:
+                return "Serial ATA";
+            case 0x07:
+                return "Serial Attached SCSI Controller";
+            case 0x08:
+                return "Non-Volatile Memory Controller";
+            case 0x80:
+                return "Mass Storage Controller";
+            default:
+                break;
+            }
+            fixme("Unknown mass storage controller %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *NetworkControllerSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "Ethernet Controller";
+            case 0x01:
+                return "Token Ring Controller";
+            case 0x02:
+                return "FDDI Controller";
+            case 0x03:
+                return "ATM Controller";
+            case 0x04:
+                return "ISDN Controller";
+            case 0x05:
+                return "WorldFip Controller";
+            case 0x06:
+                return "PICMG HyperCard Controller";
+            case 0x07:
+                return "Infiniband Controller";
+            case 0x08:
+                return "Fabric Controller";
+            case 0x80:
+                return "Network Controller";
+            default:
+                break;
+            }
+            fixme("Unknown network controller %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *DisplayControllerSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "VGA Compatible Controller";
+            case 0x01:
+                return "XGA Controller";
+            case 0x02:
+                return "3D Controller";
+            case 0x80:
+                return "Display Controller";
+            default:
+                break;
+            }
+            fixme("Unknown display controller %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *CommunicationControllerSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "Serial Controller";
+            case 0x01:
+                return "Parallel Controller";
+            case 0x02:
+                return "Multi-Serial Controller";
+            case 0x03:
+                return "IEEE-1284 Controller";
+            case 0x04:
+                return "ATM Controller";
+            case 0x05:
+                return "Object Storage Controller";
+            case 0x80:
+                return "Communication controller";
+            default:
+                break;
+            }
+            fixme("Unknown communication controller %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *BaseSystemPeripheralSubclassName(uint8_t SubclassCode)
+        {
+            // not sure if it's right
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "Unclassified";
+            case 0x01:
+                return "Keyboard";
+            case 0x02:
+                return "Pointing Device";
+            case 0x03:
+                return "Mouse";
+            case 0x04:
+                return "Scanner";
+            case 0x05:
+                return "Gameport";
+            case 0x80:
+                return "Unclassified";
+            default:
+                break;
+            }
+            fixme("Unknown base system peripheral %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *SerialBusControllerSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "FireWire (IEEE 1394) Controller";
+            case 0x01:
+                return "ACCESS Bus Controller";
+            case 0x02:
+                return "SSA Controller";
+            case 0x03:
+                return "USB Controller";
+            case 0x04:
+                return "Fibre Channel Controller";
+            case 0x05:
+                return "SMBus Controller";
+            case 0x06:
+                return "Infiniband Controller";
+            case 0x07:
+                return "IPMI Interface Controller";
+            case 0x08:
+                return "SERCOS Interface (IEC 61491) Controller";
+            case 0x09:
+                return "CANbus Controller";
+            case 0x80:
+                return "Serial Bus Controller";
+            default:
+                break;
+            }
+            fixme("Unknown serial bus controller %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *BridgeDeviceSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x00:
+                return "Host Bridge";
+            case 0x01:
+                return "ISA Bridge";
+            case 0x02:
+                return "EISA Bridge";
+            case 0x03:
+                return "MCA Bridge";
+            case 0x04:
+                return "PCI-to-PCI Bridge";
+            case 0x05:
+                return "PCMCIA Bridge";
+            case 0x06:
+                return "NuBus Bridge";
+            case 0x07:
+                return "CardBus Bridge";
+            case 0x08:
+                return "RACEway Bridge";
+            case 0x09:
+                return "PCI-to-PCI Bridge";
+            case 0x0A:
+                return "InfiniBand-to-PCI Host Bridge";
+            case 0x80:
+                return "Bridge Device";
+            default:
+                break;
+            }
+            fixme("Unknown bridge device %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *WirelessControllerSubclassName(uint8_t SubclassCode)
+        {
+            switch (SubclassCode)
+            {
+            case 0x11:
+                return "Bluetooth";
+            case 0x20:
+                return "802.1a controller";
+            case 0x21:
+                return "802.1b controller";
+            case 0x80:
+                return "Wireless controller";
+            default:
+                break;
+            }
+            fixme("Unknown wireless controller %02x", SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *GetVendorName(uint32_t VendorID)
+        {
+            switch (VendorID)
+            {
+            case 0x1000:
+                return "Symbios Logic";
+            case 0x1B36:
+            case 0x1AF4:
+                return "Red Hat, Inc.";
+            case 0x10EC:
+                return "Realtek Semiconductor Co., Ltd.";
+            case 0x80EE:
+                return "VirtualBox";
+            case 0x1274:
+                return "Ensoniq";
+            case 0x1234:
+                return "QEMU";
+            case 0x15AD:
+                return "VMware";
+            case 0x8086:
+                return "Intel Corporation";
+            case 0x1022:
+                return "Advanced Micro Devices, Inc.";
+            case 0x10DE:
+                return "NVIDIA Corporation";
+            case 0x1AE0:
+                return "Google, Inc.";
+            case 0x1a58:
+                return "Razer USA Ltd.";
+            case 0x1414:
+                return "Microsoft Corporation";
+            default:
+                break;
+            }
+            fixme("Unknown vendor %04x", VendorID);
+            return u32ToHexString(VendorID);
+        }
+
+        const char *GetDeviceName(uint32_t VendorID, uint32_t DeviceID)
+        {
+            switch (VendorID)
+            {
+            case SymbiosLogic:
+            {
+                switch (DeviceID)
+                {
+                case 0x30:
+                    return "53c1030 PCI-X Fusion-MPT Dual Ultra320 SCSI";
+                case 0x1000:
+                    return "63C815";
+                default:
+                    break;
+                }
+                break;
+            }
+            case RedHat:
+            {
+                switch (DeviceID)
+                {
+                case 0x1000:
+                case 0x1041:
+                    return "Virtio network device";
+                case 0x1001:
+                case 0x1042:
+                    return "Virtio block device";
+                case 0x1002:
+                case 0x1045:
+                    return "Virtio memory balloon";
+                case 0x1003:
+                case 0x1043:
+                    return "Virtio console";
+                case 0x1004:
+                case 0x1048:
+                    return "Virtio SCSI";
+                case 0x1005:
+                case 0x1044:
+                    return "Virtio RNG";
+                case 0x1009:
+                case 0x1049:
+                case 0x105a:
+                    return "Virtio filesystem";
+                case 0x1050:
+                    return "Virtio GPU";
+                case 0x1052:
+                    return "Virtio input";
+                case 0x1053:
+                    return "Virtio socket";
+                case 1110:
+                    return "Inter-VM shared memory";
+                case 0x1af41100:
+                    return "QEMU Virtual Machine";
+                default:
+                    break;
+                }
+                break;
+            }
+            case REDHat2:
+            {
+                switch (DeviceID)
+                {
+                case 0x0001:
+                    return "QEMU PCI-PCI bridge";
+                case 0x0002:
+                    return "QEMU PCI 16550A Adapter";
+                case 0x0003:
+                    return "QEMU PCI Dual-port 16550A Adapter";
+                case 0x0004:
+                    return "QEMU PCI Quad-port 16550A Adapter";
+                case 0x0005:
+                    return "QEMU PCI Test Device";
+                case 0x0006:
+                    return "PCI Rocker Ethernet switch device";
+                case 0x0007:
+                    return "PCI SD Card Host Controller Interface";
+                case 0x0008:
+                    return "QEMU PCIe Host bridge";
+                case 0x0009:
+                    return "QEMU PCI Expander bridge";
+                case 0x000A:
+                    return "PCI-PCI bridge (multiseat)";
+                case 0x000B:
+                    return "QEMU PCIe Expander bridge";
+                case 0x000C:
+                    return "QEMU PCIe Root Port";
+                case 0x000D:
+                    return "QEMU XHCI Host Controller";
+                case 0x0010:
+                    return "QEMU NVM Express Controller";
+                case 0x0100:
+                    return "QXL Paravirtual Graphic Card";
+                case 0x1AF41100:
+                    return "QEMU Virtual Machine";
+                default:
+                    break;
+                }
+                break;
+            }
+            case Realtek:
+            {
+                switch (DeviceID)
+                {
+                case 0x8029:
+                    return "RTL-8029(AS)";
+                case 0x8139:
+                    return "RTL-8139/8139C/8139C+ Ethernet Controller";
+                default:
+                    break;
+                }
+                break;
+            }
+            case VirtualBox:
+            {
+                switch (DeviceID)
+                {
+                case 0xCAFE:
+                    return "VirtualBox Guest Service";
+                case 0xBEEF:
+                    return "VirtualBox Graphics Adapter";
+                case 0x0021:
+                    return "USB Tablet";
+                case 0x0022:
+                    return "Multitouch tablet";
+                case 0x4E56:
+                    return "NVM Express";
+                default:
+                    break;
+                }
+                break;
+            }
+            case Ensoniq:
+            {
+                switch (DeviceID)
+                {
+                case 0x1371:
+                    return "ES1371/ES1373 / Creative Labs CT2518";
+                case 0x5000:
+                    return "ES1370 [AudioPCI]";
+                default:
+                    break;
+                }
+                break;
+            }
+            case QEMU:
+            {
+                switch (DeviceID)
+                {
+                case 0x1111:
+                    return "QEMU Display";
+                default:
+                    break;
+                }
+                break;
+            }
+            case VMware:
+            {
+                switch (DeviceID)
+                {
+                case 0x0740:
+                    return "Virtual Machine Communication Interface";
+                case 0x0405:
+                    return "SVGA II Adapter";
+                case 0x0790:
+                    return "PCI bridge";
+                case 0x07A0:
+                    return "PCI Express Root Port";
+                case 0x0774:
+                    return "USB1.1 UHCI Controller";
+                case 0x0770:
+                    return "USB2 EHCI Controller";
+                case 0x0779:
+                    return "USB3 xHCI 1.0 Controller";
+                case 0x07E0:
+                    return "SATA AHCI controller";
+                case 0x07F0:
+                    return "NVM Express";
+                default:
+                    break;
+                }
+                break;
+            }
+            case IntelCorporation:
+            {
+                switch (DeviceID)
+                {
+                case 0x1229:
+                    return "82557/8/9/0/1 Ethernet Pro 100";
+                case 0x1209:
+                    return "8255xER/82551IT Fast Ethernet Controller";
+                case 0x100E:
+                    return "82540EM Gigabit Ethernet Controller";
+                case 0x7190:
+                    return "440BX/ZX/DX - 82443BX/ZX/DX Host bridge";
+                case 0x7191:
+                    return "440BX/ZX/DX - 82443BX/ZX/DX AGP bridge";
+                case 0x7110:
+                    return "82371AB/EB/MB PIIX4 ISA";
+                case 0x7111:
+                    return "82371AB/EB/MB PIIX4 IDE";
+                case 0x7113:
+                    return "82371AB/EB/MB PIIX4 ACPI";
+                case 0x1e31:
+                    return "7 Series/C210 Series Chipset Family USB xHCI Host Controller";
+                case 0x100F:
+                    return "82545EM Gigabit Ethernet Controller (Copper)";
+                case 0x1371:
+                    return "ES1371/ES1373 / Creative Labs CT2518";
+                case 0x27b9:
+                    return "82801GBM (ICH7-M) LPC Interface Bridge";
+                case 0x07E0:
+                    return "SATA AHCI controller";
+                case 0x293E:
+                    return "82801I (ICH9 Family) HD Audio Controller";
+                case 0x2935:
+                    return "82801I (ICH9 Family) USB UHCI Controller #2";
+                case 0x2936:
+                    return "82801I (ICH9 Family) USB UHCI Controller #3";
+                case 0x293A:
+                    return "82801I (ICH9 Family) USB2 EHCI Controller #1";
+                case 0x2934:
+                    return "82801I (ICH9 Family) USB UHCI Controller #1";
+                case 0x2668:
+                    return "82801FB/FBM/FR/FW/FRW (ICH6 Family) High Definition Audio Controller";
+                case 0x2415:
+                    return "82801AA AC'97 Audio Controller";
+                case 0x10D3:
+                    return "82574L Gigabit Network Connection";
+                case 0x29C0:
+                    return "82G33/G31/P35/P31 Express DRAM Controller";
+                case 0x2918:
+                    return "82801IB (ICH9) LPC Interface Controller";
+                case 0x2829:
+                    return "82801HM/HEM (ICH8M/ICH8M-E) SATA Controller [AHCI mode]";
+                case 0x2922:
+                    return "82801IR/IO/IH (ICH9R/DO/DH) 6 port SATA Controller [AHCI mode]";
+                case 0x2930:
+                    return "82801I (ICH9 Family) SMBus Controller";
+                default:
+                    break;
+                }
+                break;
+            }
+            case AdvancedMicroDevices:
+            {
+                switch (DeviceID)
+                {
+                case 0x2000:
+                    return "79C970 [PCnet32 LANCE]";
+                default:
+                    break;
+                }
+                break;
+            }
+            default:
+                break;
+            }
+            fixme("Unknown device %04x:%04x", VendorID, DeviceID);
+            return u32ToHexString(DeviceID);
+        }
+
+        const char *GetSubclassName(uint8_t ClassCode, uint8_t SubclassCode)
+        {
+            switch (ClassCode)
+            {
+            case 0x00:
+                return "Unclassified";
+            case 0x01:
+                return MassStorageControllerSubclassName(SubclassCode);
+            case 0x02:
+                return NetworkControllerSubclassName(SubclassCode);
+            case 0x03:
+                return DisplayControllerSubclassName(SubclassCode);
+            case 0x04:
+                return "Multimedia controller";
+            case 0x05:
+                return "Memory Controller";
+            case 0x06:
+                return BridgeDeviceSubclassName(SubclassCode);
+            case 0x07:
+                return CommunicationControllerSubclassName(SubclassCode);
+            case 0x08:
+                return BaseSystemPeripheralSubclassName(SubclassCode);
+            case 0x09:
+                return "Input device controller";
+            case 0x0A:
+                return "Docking station";
+            case 0x0B:
+                return "Processor";
+            case 0x0C:
+                return SerialBusControllerSubclassName(SubclassCode);
+            case 0x0D:
+                return WirelessControllerSubclassName(SubclassCode);
+            case 0x0E:
+                return "Intelligent controller";
+            case 0x0F:
+                return "Satellite communication controller";
+            case 0x10:
+                return "Encryption controller";
+            case 0x11:
+                return "Signal processing accelerators";
+            case 0x12:
+                return "Processing accelerators";
+            case 0x13:
+                return "Non-Essential Instrumentation";
+            case 0x40:
+                return "Coprocessor";
+            default:
+                break;
+            }
+            fixme("Unknown subclass name %02x:%02x", ClassCode, SubclassCode);
+            return u8ToHexString(SubclassCode);
+        }
+
+        const char *GetProgIFName(uint8_t ClassCode, uint8_t SubclassCode, uint8_t ProgIF)
+        {
+            switch (ClassCode)
+            {
+            case 0x01:
+            {
+                switch (SubclassCode)
+                {
+                case 0x06:
+                {
+                    switch (ProgIF)
+                    {
+                    case 0:
+                        return "Vendor Specific SATA Controller";
+                    case 1:
+                        return "AHCI SATA Controller";
+                    case 2:
+                        return "Serial Storage Bus SATA Controller";
+                    default:
+                        return "SATA controller";
+                    }
+                    break;
+                }
+                case 0x08:
+                {
+                    switch (ProgIF)
+                    {
+                    case 0x01:
+                        return "NVMHCI Controller";
+                    case 0x02:
+                        return "NVM Express Controller";
+                    default:
+                        return "Non-Volatile Memory Controller";
+                    }
+                    break;
+                }
+                default:
+                    break;
+                }
+            default:
+                break;
+            }
+            case 0x03:
+            {
+                switch (SubclassCode)
+                {
+                case 0x00:
+                    switch (ProgIF)
+                    {
+                    case 0x00:
+                        return "VGA Controller";
+                    case 0x01:
+                        return "8514-Compatible Controller";
+                    default:
+                        return "VGA Compatible Controller";
+                    }
+                    break;
+                default:
+                    break;
+                }
+                break;
+            }
+            case 0x07:
+            {
+                switch (SubclassCode)
+                {
+                case 0x00:
+                {
+                    switch (ProgIF)
+                    {
+                    case 0x00:
+                        return "Serial controller <8250>";
+                    case 0x01:
+                        return "Serial controller <16450>";
+                    case 0x02:
+                        return "Serial controller <16550>";
+                    case 0x03:
+                        return "Serial controller <16650>";
+                    case 0x04:
+                        return "Serial controller <16750>";
+                    case 0x05:
+                        return "Serial controller <16850>";
+                    case 0x06:
+                        return "Serial controller <16950";
+                    default:
+                        return "Serial controller";
+                    }
+                    break;
+                }
+                default:
+                    break;
+                }
+                break;
+            }
+            case 0x0C:
+            {
+                switch (SubclassCode)
+                {
+                case 0x00:
+                {
+                    switch (ProgIF)
+                    {
+                    case 0x00:
+                        return "Generic FireWire (IEEE 1394) Controller";
+                    case 0x10:
+                        return "OHCI FireWire (IEEE 1394) Controller";
+                    default:
+                        break;
+                    }
+                    break;
+                }
+                case 0x03:
+                {
+                    switch (ProgIF)
+                    {
+                    case 0x00:
+                        return "UHCI (USB1) Controller";
+                    case 0x10:
+                        return "OHCI (USB1) Controller";
+                    case 0x20:
+                        return "EHCI (USB2) Controller";
+                    case 0x30:
+                        return "XHCI (USB3) Controller";
+                    case 0x80:
+                        return "Unspecified";
+                    case 0xFE:
+                        return "USB Device";
+                    default:
+                        break;
+                    }
+                    break;
+                }
+                default:
+                    break;
+                }
+                break;
+            }
+            }
+            // not really a fixme
+            // fixme("Unknown prog IF name %02x:%02x:%02x", ClassCode, SubclassCode, ProgIF);
+            return u8ToHexString(ProgIF);
+        }
+    }
+
+#ifdef DEBUG
+    void e(PCIDeviceHeader *hdr)
+    {
+        debug("%#x:%#x\t\t%s / %s / %s / %s / %s",
+              hdr->VendorID, hdr->DeviceID,
+              Descriptors::GetVendorName(hdr->VendorID),
+              Descriptors::GetDeviceName(hdr->VendorID, hdr->DeviceID),
+              Descriptors::DeviceClasses[hdr->Class],
+              Descriptors::GetSubclassName(hdr->Class, hdr->Subclass),
+              Descriptors::GetProgIFName(hdr->Class, hdr->Subclass, hdr->ProgIF));
+    }
+#endif
+
+    void PCI::EnumerateFunction(uintptr_t DeviceAddress, uint64_t Function)
+    {
+        uintptr_t Offset = Function << 12;
+        uintptr_t FunctionAddress = DeviceAddress + Offset;
+        Memory::Virtual(KernelPageTable).Map((void *)FunctionAddress, (void *)FunctionAddress, Memory::PTFlag::RW);
+        PCIDeviceHeader *PCIDeviceHdr = (PCIDeviceHeader *)FunctionAddress;
+        if (PCIDeviceHdr->DeviceID == 0)
+            return;
+        if (PCIDeviceHdr->DeviceID == 0xFFFF)
+            return;
+        Devices.push_back(PCIDeviceHdr);
+#ifdef DEBUG
+        e(PCIDeviceHdr);
+#endif
+    }
+
+    void PCI::EnumerateDevice(uintptr_t BusAddress, uint64_t Device)
+    {
+        uintptr_t Offset = Device << 15;
+        uintptr_t DeviceAddress = BusAddress + Offset;
+        Memory::Virtual(KernelPageTable).Map((void *)DeviceAddress, (void *)DeviceAddress, Memory::PTFlag::RW);
+        PCIDeviceHeader *PCIDeviceHdr = (PCIDeviceHeader *)DeviceAddress;
+        if (PCIDeviceHdr->DeviceID == 0)
+            return;
+        if (PCIDeviceHdr->DeviceID == 0xFFFF)
+            return;
+        for (uintptr_t Function = 0; Function < 8; Function++)
+            EnumerateFunction(DeviceAddress, Function);
+    }
+
+    void PCI::EnumerateBus(uintptr_t BaseAddress, uint64_t Bus)
+    {
+        uintptr_t Offset = Bus << 20;
+        uintptr_t BusAddress = BaseAddress + Offset;
+        Memory::Virtual(KernelPageTable).Map((void *)BusAddress, (void *)BusAddress, Memory::PTFlag::RW);
+        PCIDeviceHeader *PCIDeviceHdr = (PCIDeviceHeader *)BusAddress;
+        if (Bus != 0) // TODO: VirtualBox workaround (UNTESTED ON REAL HARDWARE!)
+        {
+            if (PCIDeviceHdr->DeviceID == 0)
+                return;
+            if (PCIDeviceHdr->DeviceID == 0xFFFF)
+                return;
+        }
+        debug("PCI Bus DeviceID:%#llx VendorID:%#llx BIST:%#llx Cache:%#llx Class:%#llx Cmd:%#llx HdrType:%#llx LatencyTimer:%#llx ProgIF:%#llx RevID:%#llx Status:%#llx SubClass:%#llx ",
+              PCIDeviceHdr->DeviceID, PCIDeviceHdr->VendorID, PCIDeviceHdr->BIST,
+              PCIDeviceHdr->CacheLineSize, PCIDeviceHdr->Class, PCIDeviceHdr->Command,
+              PCIDeviceHdr->HeaderType, PCIDeviceHdr->LatencyTimer, PCIDeviceHdr->ProgIF,
+              PCIDeviceHdr->RevisionID, PCIDeviceHdr->Status, PCIDeviceHdr->Subclass);
+        for (uintptr_t Device = 0; Device < 32; Device++)
+            EnumerateDevice(BusAddress, Device);
+    }
+
+    std::vector<PCIDeviceHeader *> PCI::FindPCIDevice(uint8_t Class, uint8_t Subclass, uint8_t ProgIF)
+    {
+        std::vector<PCIDeviceHeader *> DeviceFound;
+        for (auto var : Devices)
+            if (var->Class == Class && var->Subclass == Subclass && var->ProgIF == ProgIF)
+                DeviceFound.push_back(var);
+        return DeviceFound;
+    }
+
+    std::vector<PCIDeviceHeader *> PCI::FindPCIDevice(int VendorID, int DeviceID)
+    {
+        std::vector<PCIDeviceHeader *> DeviceFound;
+        for (auto var : Devices)
+            if (var->VendorID == VendorID && var->DeviceID == DeviceID)
+                DeviceFound.push_back(var);
+        return DeviceFound;
+    }
+
+    PCI::PCI()
+    {
+#if defined(a64)
+        int Entries = s_cst(int, ((((ACPI::ACPI *)PowerManager->GetACPI())->MCFG->Header.Length) - sizeof(ACPI::ACPI::MCFGHeader)) / sizeof(DeviceConfig));
+        Memory::Virtual vma = Memory::Virtual(KernelPageTable);
+        for (int t = 0; t < Entries; t++)
+        {
+            DeviceConfig *NewDeviceConfig = (DeviceConfig *)((uintptr_t)((ACPI::ACPI *)PowerManager->GetACPI())->MCFG + sizeof(ACPI::ACPI::MCFGHeader) + (sizeof(DeviceConfig) * t));
+            vma.Map((void *)NewDeviceConfig->BaseAddress, (void *)NewDeviceConfig->BaseAddress, Memory::PTFlag::RW);
+            debug("PCI Entry %d Address:%#llx BUS:%#llx-%#llx", t, NewDeviceConfig->BaseAddress,
+                  NewDeviceConfig->StartBus, NewDeviceConfig->EndBus);
+            for (uintptr_t Bus = NewDeviceConfig->StartBus; Bus < NewDeviceConfig->EndBus; Bus++)
+                EnumerateBus(NewDeviceConfig->BaseAddress, Bus);
+        }
+#elif defined(a32)
+        error("PCI not implemented on i386");
+#elif defined(aa64)
+        error("PCI not implemented on aarch64");
+#endif
+    }
+
+    PCI::~PCI()
+    {
+    }
+}
diff --git a/Kernel/Core/Power.cpp b/Kernel/Core/Power.cpp
new file mode 100644
index 00000000..c1cb86cc
--- /dev/null
+++ b/Kernel/Core/Power.cpp
@@ -0,0 +1,139 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <power.hpp>
+
+#include <memory.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+#if defined(a64)
+#include <io.h>
+
+#include "../Architecture/amd64/acpi.hpp"
+
+namespace Power
+{
+    void Power::Reboot()
+    {
+        if (((ACPI::ACPI *)this->acpi)->FADT)
+            if (((ACPI::DSDT *)this->dsdt)->ACPIShutdownSupported)
+                ((ACPI::DSDT *)this->dsdt)->Reboot();
+
+        uint8_t val = 0x02;
+        while (val & 0x02)
+            val = inb(0x64);
+        outb(0x64, 0xFE);
+
+        warn("Executing the second attempt to reboot...");
+
+        // second attempt to reboot
+        // https://wiki.osdev.org/Reboot
+        uint8_t temp;
+        asmv("cli");
+        do
+        {
+            temp = inb(0x64);
+            if (((temp) & (1 << (0))) != 0)
+                inb(0x60);
+        } while (((temp) & (1 << (1))) != 0);
+        outb(0x64, 0xFE);
+
+        CPU::Stop();
+    }
+
+    void Power::Shutdown()
+    {
+        if (((ACPI::ACPI *)this->acpi)->FADT)
+            if (((ACPI::DSDT *)this->dsdt)->ACPIShutdownSupported)
+                ((ACPI::DSDT *)this->dsdt)->Shutdown();
+
+        outl(0xB004, 0x2000); // for qemu
+        outl(0x604, 0x2000);  // if qemu not working, bochs and older versions of qemu
+        outl(0x4004, 0x3400); // virtual box
+        CPU::Stop();
+    }
+
+    void Power::InitDSDT()
+    {
+        if (((ACPI::ACPI *)this->acpi)->FADT)
+            this->dsdt = new ACPI::DSDT((ACPI::ACPI *)acpi);
+    }
+
+    Power::Power()
+    {
+        this->acpi = new ACPI::ACPI;
+        this->madt = new ACPI::MADT(((ACPI::ACPI *)acpi)->MADT);
+        trace("Power manager initialized");
+    }
+
+    Power::~Power()
+    {
+        debug("Destructor called");
+    }
+}
+
+#elif defined(a32)
+
+namespace Power
+{
+    void Power::Reboot()
+    {
+        warn("Reboot not implemented for i386");
+    }
+
+    void Power::Shutdown()
+    {
+        warn("Shutdown not implemented for i386");
+    }
+
+    Power::Power()
+    {
+        error("Power not implemented for i386");
+    }
+
+    Power::~Power()
+    {
+    }
+}
+
+#elif defined(aa64)
+
+namespace Power
+{
+    void Power::Reboot()
+    {
+        warn("Reboot not implemented for aarch64");
+    }
+
+    void Power::Shutdown()
+    {
+        warn("Shutdown not implemented for aarch64");
+    }
+
+    Power::Power()
+    {
+        error("Power not implemented for aarch64");
+    }
+
+    Power::~Power()
+    {
+    }
+}
+
+#endif
diff --git a/Kernel/Core/README.md b/Kernel/Core/README.md
new file mode 100644
index 00000000..a2ef85f5
--- /dev/null
+++ b/Kernel/Core/README.md
@@ -0,0 +1,22 @@
+# Core components
+
+This directory contains the core components of the project. These components are used by the kernel to provide the basic functionality of the operating system.
+
+---
+
+## 💾 Memory
+
+Contains the memory management code.
+It is responsible for allocating and freeing memory.
+It also provides the `kmalloc`, `kcalloc`, `krealloc` and `kfree` functions that are used by the rest of the kernel.
+
+## 📺 Video
+
+Contains the video management code.
+It is responsible for printing text to the screen.
+
+## 🖥 CPU
+
+Contains the CPU management code.
+It is responsible for initializing the GDT and IDT.
+More code related is in the `Architecture` directory.
diff --git a/Kernel/Core/Random.cpp b/Kernel/Core/Random.cpp
new file mode 100644
index 00000000..10c160e9
--- /dev/null
+++ b/Kernel/Core/Random.cpp
@@ -0,0 +1,143 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <rand.hpp>
+#include <cpu.hpp>
+
+namespace Random
+{
+    static uint64_t Seed = 0xdeadbeef;
+
+    uint16_t rand16()
+    {
+#if defined(a86)
+        static int RDRANDFlag = 0x1A1A;
+        if (unlikely(RDRANDFlag == 0x1A1A))
+        {
+            if (strcmp(CPU::Hypervisor(), x86_CPUID_VENDOR_TCG) != 0)
+            {
+                if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+                {
+                    CPU::x86::AMD::CPUID0x00000001 cpuid;
+                    cpuid.Get();
+                    RDRANDFlag = cpuid.ECX.RDRAND;
+                }
+                else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+                {
+                    CPU::x86::Intel::CPUID0x00000001 cpuid;
+                    cpuid.Get();
+                    RDRANDFlag = cpuid.ECX.RDRAND;
+                }
+            }
+            else
+                RDRANDFlag = 0;
+        }
+
+        if (RDRANDFlag)
+        {
+            uint16_t RDRANDValue = 0;
+            asmv("1: rdrand %0; jnc 1b"
+                 : "=r"(RDRANDValue));
+            return RDRANDValue;
+        }
+
+        Seed = Seed * 1103515245 + 12345;
+        return (uint16_t)(Seed / 65536) % __UINT16_MAX__;
+#endif
+        return 0;
+    }
+
+    uint32_t rand32()
+    {
+#if defined(a86)
+        static int RDRANDFlag = 0x1A1A;
+        if (unlikely(RDRANDFlag == 0x1A1A))
+        {
+            if (strcmp(CPU::Hypervisor(), x86_CPUID_VENDOR_TCG) != 0)
+            {
+                if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+                {
+                    CPU::x86::AMD::CPUID0x00000001 cpuid;
+                    cpuid.Get();
+                    RDRANDFlag = cpuid.ECX.RDRAND;
+                }
+                else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+                {
+                    CPU::x86::Intel::CPUID0x00000001 cpuid;
+                    cpuid.Get();
+                    RDRANDFlag = cpuid.ECX.RDRAND;
+                }
+            }
+            else
+                RDRANDFlag = 0;
+        }
+
+        if (RDRANDFlag)
+        {
+            uint32_t RDRANDValue = 0;
+            asmv("1: rdrand %0; jnc 1b"
+                 : "=r"(RDRANDValue));
+            return RDRANDValue;
+        }
+
+        Seed = Seed * 1103515245 + 12345;
+        return (uint32_t)(Seed / 65536) % __UINT32_MAX__;
+#endif
+        return 0;
+    }
+
+    uint64_t rand64()
+    {
+#if defined(a86)
+        static int RDRANDFlag = 0x1A1A;
+        if (unlikely(RDRANDFlag == 0x1A1A))
+        {
+            if (strcmp(CPU::Hypervisor(), x86_CPUID_VENDOR_TCG) != 0)
+            {
+                if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+                {
+                    CPU::x86::AMD::CPUID0x00000001 cpuid;
+                    cpuid.Get();
+                    RDRANDFlag = cpuid.ECX.RDRAND;
+                }
+                else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+                {
+                    CPU::x86::Intel::CPUID0x00000001 cpuid;
+                    cpuid.Get();
+                    RDRANDFlag = cpuid.ECX.RDRAND;
+                }
+            }
+            else
+                RDRANDFlag = 0;
+        }
+
+        if (RDRANDFlag)
+        {
+            uint64_t RDRANDValue = 0;
+            asmv("1: rdrand %0; jnc 1b"
+                 : "=r"(RDRANDValue));
+            return RDRANDValue;
+        }
+
+        Seed = Seed * 1103515245 + 12345;
+        return (uint64_t)(Seed / 65536) % __UINT64_MAX__;
+#endif
+        return 0;
+    }
+
+    void ChangeSeed(uint64_t CustomSeed) { Seed = CustomSeed; }
+}
diff --git a/Kernel/Core/StackGuard.cpp b/Kernel/Core/StackGuard.cpp
new file mode 100644
index 00000000..2a139f94
--- /dev/null
+++ b/Kernel/Core/StackGuard.cpp
@@ -0,0 +1,96 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <types.h>
+#include <debug.h>
+#include <rand.hpp>
+
+#include "../kernel.h"
+
+/* EXTERNC */ __weak uintptr_t __stack_chk_guard = 0;
+
+EXTERNC __weak __no_stack_protector uintptr_t __stack_chk_guard_init(void)
+{
+    int MaxRetries = 0;
+#if UINTPTR_MAX == UINT32_MAX
+    uint32_t num;
+Retry:
+    num = Random::rand32();
+    if (num < 0x1000 && MaxRetries++ < 10)
+        goto Retry;
+    return num;
+
+#else
+    uint64_t num;
+Retry:
+    num = Random::rand64();
+    if (num < 0x100000 && MaxRetries++ < 10)
+        goto Retry;
+    return num;
+#endif
+}
+
+EXTERNC __constructor __no_stack_protector void __guard_setup(void)
+{
+    debug("StackGuard: __guard_setup");
+    if (__stack_chk_guard == 0)
+        __stack_chk_guard = __stack_chk_guard_init();
+    debug("Stack guard value: %ld", __stack_chk_guard);
+}
+
+EXTERNC __weak __noreturn __no_stack_protector void __stack_chk_fail(void)
+{
+    TaskingPanic();
+    for (short i = 0; i < 10; i++)
+        error("Stack smashing detected!");
+    debug("Current stack check guard value: %#lx", __stack_chk_guard);
+    KPrint("\eFF0000Stack smashing detected!");
+
+#if defined(a86)
+    void *Stack = nullptr;
+#if defined(a64)
+    asmv("movq %%rsp, %0"
+         : "=r"(Stack));
+#elif defined(a32)
+    asmv("movl %%esp, %0"
+         : "=r"(Stack));
+#endif
+    error("Stack address: %#lx", Stack);
+
+    while (1)
+        asmv("cli; hlt");
+#elif defined(aa64)
+    asmv("wfe");
+#endif
+    CPU::Stop();
+}
+
+// https://github.com/gcc-mirror/gcc/blob/master/libssp/ssp.c
+EXTERNC __weak __noreturn __no_stack_protector void __chk_fail(void)
+{
+    TaskingPanic();
+    for (short i = 0; i < 10; i++)
+        error("Buffer overflow detected!");
+    KPrint("\eFF0000Buffer overflow detected!");
+
+#if defined(a86)
+    while (1)
+        asmv("cli; hlt");
+#elif defined(aa64)
+    asmv("wfe");
+#endif
+}
diff --git a/Kernel/Core/Symbols.cpp b/Kernel/Core/Symbols.cpp
new file mode 100644
index 00000000..6d362b9d
--- /dev/null
+++ b/Kernel/Core/Symbols.cpp
@@ -0,0 +1,142 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <symbols.hpp>
+#include <memory.hpp>
+#include <convert.h>
+#include <debug.h>
+#include <elf.h>
+
+// #pragma GCC diagnostic ignored "-Wignored-qualifiers"
+
+namespace SymbolResolver
+{
+    Symbols::Symbols(uintptr_t ImageAddress)
+    {
+        debug("Solving symbols for address: %#llx", ImageAddress);
+
+        if (ImageAddress == 0)
+        {
+            error("Invalid image address");
+            return;
+        }
+
+        Elf64_Ehdr *Header = (Elf64_Ehdr *)ImageAddress;
+        if (Header->e_ident[0] != 0x7F &&
+            Header->e_ident[1] != 'E' &&
+            Header->e_ident[2] != 'L' &&
+            Header->e_ident[3] != 'F')
+        {
+            error("Invalid ELF header");
+            return;
+        }
+        Elf64_Shdr *ElfSections = (Elf64_Shdr *)(ImageAddress + Header->e_shoff);
+        Elf64_Sym *ElfSymbols = nullptr;
+        char *strtab = nullptr;
+
+        for (uint16_t i = 0; i < Header->e_shnum; i++)
+            switch (ElfSections[i].sh_type)
+            {
+            case SHT_SYMTAB:
+                ElfSymbols = (Elf64_Sym *)(ImageAddress + ElfSections[i].sh_offset);
+                this->TotalEntries = ElfSections[i].sh_size / sizeof(Elf64_Sym);
+                if (this->TotalEntries >= 0x10000)
+                    this->TotalEntries = 0x10000 - 1;
+
+                debug("Symbol table found, %d entries", this->TotalEntries);
+                break;
+            case SHT_STRTAB:
+                if (Header->e_shstrndx == i)
+                {
+                    debug("String table found, %d entries", ElfSections[i].sh_size);
+                }
+                else
+                {
+                    strtab = (char *)(ImageAddress + ElfSections[i].sh_offset);
+                    debug("String table found, %d entries", ElfSections[i].sh_size);
+                }
+                break;
+            default:
+                break;
+            }
+
+        if (ElfSymbols != nullptr && strtab != nullptr)
+        {
+            uintptr_t Index, MinimumIndex;
+            for (uintptr_t i = 0; i < this->TotalEntries - 1; i++)
+            {
+                MinimumIndex = i;
+                for (Index = i + 1; Index < this->TotalEntries; Index++)
+                    if (ElfSymbols[Index].st_value < ElfSymbols[MinimumIndex].st_value)
+                        MinimumIndex = Index;
+                Elf64_Sym tmp = ElfSymbols[MinimumIndex];
+                ElfSymbols[MinimumIndex] = ElfSymbols[i];
+                ElfSymbols[i] = tmp;
+            }
+
+            while (ElfSymbols[0].st_value == 0)
+            {
+                ElfSymbols++;
+                this->TotalEntries--;
+            }
+
+#ifdef DEBUG
+            static int once = 0;
+#endif
+
+            trace("Symbol table loaded, %d entries (%ldKB)", this->TotalEntries, TO_KB(this->TotalEntries * sizeof(SymbolTable)));
+            for (uintptr_t i = 0, g = this->TotalEntries; i < g; i++)
+            {
+                this->SymTable[i].Address = ElfSymbols[i].st_value;
+                this->SymTable[i].FunctionName = &strtab[ElfSymbols[i].st_name];
+#ifdef DEBUG
+                if (once)
+                    debug("Symbol %d: %#llx %s", i, this->SymTable[i].Address, this->SymTable[i].FunctionName);
+#endif
+            }
+
+#ifdef DEBUG
+            if (!once)
+                once++;
+#endif
+        }
+    }
+
+    Symbols::~Symbols() {}
+
+    const NIF char *Symbols::GetSymbolFromAddress(uintptr_t Address)
+    {
+        Symbols::SymbolTable Result{0, (char *)"<unknown>"};
+        for (uintptr_t i = 0; i < this->TotalEntries; i++)
+            if (this->SymTable[i].Address <= Address && this->SymTable[i].Address > Result.Address)
+                Result = this->SymTable[i];
+        return Result.FunctionName;
+    }
+
+    NIF void Symbols::AddSymbol(uintptr_t Address, const char *Name)
+    {
+        if (this->TotalEntries >= 0x10000)
+        {
+            error("Symbol table is full");
+            return;
+        }
+
+        this->SymTable[this->TotalEntries].Address = Address;
+        strcpy(this->SymTable[this->TotalEntries].FunctionName, Name);
+        this->TotalEntries++;
+    }
+}
diff --git a/Kernel/Core/SystemManagementBIOS.cpp b/Kernel/Core/SystemManagementBIOS.cpp
new file mode 100644
index 00000000..a58caa43
--- /dev/null
+++ b/Kernel/Core/SystemManagementBIOS.cpp
@@ -0,0 +1,85 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "smbios.hpp"
+
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace SMBIOS
+{
+    bool CheckSMBIOS()
+    {
+        if (bInfo.SMBIOSPtr != nullptr && bInfo.SMBIOSPtr < (void *)0xFFFFFFFFFFFF0000)
+        {
+            debug("SMBIOS is available (%#lx).", bInfo.SMBIOSPtr);
+            return true;
+        }
+        debug("SMBIOS is not available. (%#lx)", bInfo.SMBIOSPtr);
+        return false;
+    }
+
+    SMBIOSEntryPoint *GetSMBIOSEntryPoint() { return (SMBIOSEntryPoint *)bInfo.SMBIOSPtr; }
+
+    static inline int SMBIOSTableLength(SMBIOSHeader *Hdr)
+    {
+        int i;
+        const char *strtab = (char *)Hdr + Hdr->Length;
+        for (i = 1; strtab[i - 1] != '\0' || strtab[i] != '\0'; i++)
+            ;
+        return Hdr->Length + i + 1;
+    }
+
+    void *GetSMBIOSHeader(SMBIOSType Type)
+    {
+        if (!CheckSMBIOS())
+            return nullptr;
+
+        SMBIOSEntryPoint *Header = (SMBIOSEntryPoint *)bInfo.SMBIOSPtr;
+        debug("Getting SMBIOS header for type %d", Type);
+
+        struct SMBIOSHeader *hdr = (SMBIOSHeader *)(uintptr_t)Header->TableAddress;
+        for (int i = 0; i <= 11; i++)
+        {
+            if (hdr < (void *)(uintptr_t)(Header->TableAddress + Header->TableLength))
+                if (hdr->Type == Type)
+                {
+                    debug("Found SMBIOS header for type %d at %#lx", Type, hdr);
+                    return hdr;
+                }
+            hdr = (struct SMBIOSHeader *)((uintptr_t)hdr + SMBIOSTableLength(hdr));
+        }
+        return nullptr;
+    }
+
+    SMBIOSBIOSInformation *GetBIOSInformation() { return (SMBIOSBIOSInformation *)GetSMBIOSHeader(SMBIOSTypeBIOSInformation); }
+
+    SMBIOSSystemInformation *GetSystemInformation() { return (SMBIOSSystemInformation *)GetSMBIOSHeader(SMBIOSTypeSystemInformation); }
+
+    SMBIOSBaseBoardInformation *GetBaseBoardInformation() { return (SMBIOSBaseBoardInformation *)GetSMBIOSHeader(SMBIOSTypeBaseBoardInformation); }
+
+    SMBIOSProcessorInformation *GetProcessorInformation() { return (SMBIOSProcessorInformation *)GetSMBIOSHeader(SMBIOSTypeProcessorInformation); }
+
+    SMBIOSMemoryArray *GetMemoryArray() { return (SMBIOSMemoryArray *)GetSMBIOSHeader(SMBIOSTypePhysicalMemoryArray); }
+
+    SMBIOSMemoryDevice *GetMemoryDevice() { return (SMBIOSMemoryDevice *)GetSMBIOSHeader(SMBIOSTypeMemoryDevice); }
+
+    SMBIOSMemoryArrayMappedAddress *GetMemoryArrayMappedAddress() { return (SMBIOSMemoryArrayMappedAddress *)GetSMBIOSHeader(SMBIOSTypeMemoryArrayMappedAddress); }
+
+    SMBIOSMemoryDeviceMappedAddress *GetMemoryDeviceMappedAddress() { return (SMBIOSMemoryDeviceMappedAddress *)GetSMBIOSHeader(SMBIOSTypeMemoryDeviceMappedAddress); }
+}
diff --git a/Kernel/Core/Time/HighPrecisionEventTimer.cpp b/Kernel/Core/Time/HighPrecisionEventTimer.cpp
new file mode 100644
index 00000000..e8699ae9
--- /dev/null
+++ b/Kernel/Core/Time/HighPrecisionEventTimer.cpp
@@ -0,0 +1,89 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <time.hpp>
+
+#include <memory.hpp>
+#include <debug.h>
+#include <io.h>
+
+#if defined(a64)
+#include "../../Architecture/amd64/acpi.hpp"
+#elif defined(a32)
+#include "../../Architecture/i386/acpi.hpp"
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+namespace Time
+{
+    bool HighPrecisionEventTimer::Sleep(uint64_t Duration, Units Unit)
+    {
+#if defined(a86)
+        uint64_t Target = mminq(&((HPET *)hpet)->MainCounterValue) + (Duration * ConvertUnit(Unit)) / clk;
+        while (mminq(&((HPET *)hpet)->MainCounterValue) < Target)
+            CPU::Pause();
+        return true;
+#endif
+    }
+
+    uint64_t HighPrecisionEventTimer::GetCounter()
+    {
+#if defined(a86)
+        return mminq(&((HPET *)hpet)->MainCounterValue);
+#endif
+    }
+
+    uint64_t HighPrecisionEventTimer::CalculateTarget(uint64_t Target, Units Unit)
+    {
+#if defined(a86)
+        return mminq(&((HPET *)hpet)->MainCounterValue) + (Target * ConvertUnit(Unit)) / clk;
+#endif
+    }
+
+    uint64_t HighPrecisionEventTimer::GetNanosecondsSinceClassCreation()
+    {
+#if defined(a86)
+        uint64_t Subtraction = this->GetCounter() - this->ClassCreationTime;
+        if (Subtraction <= 0 || this->clk <= 0)
+            return 0;
+        return Subtraction / (this->clk / ConvertUnit(Units::Nanoseconds));
+#endif
+    }
+
+    HighPrecisionEventTimer::HighPrecisionEventTimer(void *hpet)
+    {
+#if defined(a86)
+        ACPI::ACPI::HPETHeader *HPET_HDR = (ACPI::ACPI::HPETHeader *)hpet;
+        Memory::Virtual().Remap((void *)HPET_HDR->Address.Address,
+                                (void *)HPET_HDR->Address.Address,
+                                Memory::PTFlag::RW | Memory::PTFlag::PCD);
+        this->hpet = (HPET *)HPET_HDR->Address.Address;
+        trace("%s timer is at address %016p", HPET_HDR->Header.OEMID, (void *)HPET_HDR->Address.Address);
+        clk = s_cst(uint32_t, this->hpet->GeneralCapabilities >> 32);
+        mmoutq(&this->hpet->GeneralConfiguration, 0);
+        mmoutq(&this->hpet->MainCounterValue, 0);
+        mmoutq(&this->hpet->GeneralConfiguration, 1);
+        ClassCreationTime = this->GetCounter();
+#endif
+    }
+
+    HighPrecisionEventTimer::~HighPrecisionEventTimer()
+    {
+    }
+}
diff --git a/Kernel/Core/Time/Time.cpp b/Kernel/Core/Time/Time.cpp
new file mode 100644
index 00000000..acb66fe9
--- /dev/null
+++ b/Kernel/Core/Time/Time.cpp
@@ -0,0 +1,105 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <time.hpp>
+#include <debug.h>
+#include <io.h>
+
+namespace Time
+{
+    Clock ReadClock()
+    {
+        Clock tm;
+#if defined(a86)
+        uint32_t t = 0;
+        outb(0x70, 0x00);
+        t = inb(0x71);
+        tm.Second = ((t & 0x0F) + ((t >> 4) * 10));
+        outb(0x70, 0x02);
+        t = inb(0x71);
+        tm.Minute = ((t & 0x0F) + ((t >> 4) * 10));
+        outb(0x70, 0x04);
+        t = inb(0x71);
+        tm.Hour = ((t & 0x0F) + ((t >> 4) * 10));
+        outb(0x70, 0x07);
+        t = inb(0x71);
+        tm.Day = ((t & 0x0F) + ((t >> 4) * 10));
+        outb(0x70, 0x08);
+        t = inb(0x71);
+        tm.Month = ((t & 0x0F) + ((t >> 4) * 10));
+        outb(0x70, 0x09);
+        t = inb(0x71);
+        tm.Year = ((t & 0x0F) + ((t >> 4) * 10));
+        tm.Counter = 0;
+#elif defined(aa64)
+        tm.Year = 0;
+        tm.Month = 0;
+        tm.Day = 0;
+        tm.Hour = 0;
+        tm.Minute = 0;
+        tm.Second = 0;
+        tm.Counter = 0;
+#endif
+        return tm;
+    }
+
+    Clock ConvertFromUnix(int Timestamp)
+    {
+        Clock result;
+
+        uint64_t Seconds = Timestamp;
+        uint64_t Minutes = Seconds / 60;
+        uint64_t Hours = Minutes / 60;
+        uint64_t Days = Hours / 24;
+
+        result.Year = 1970;
+        while (Days >= 365)
+        {
+            if (result.Year % 4 == 0 && (result.Year % 100 != 0 || result.Year % 400 == 0))
+            {
+                if (Days >= 366)
+                {
+                    Days -= 366;
+                    result.Year++;
+                }
+                else
+                    break;
+            }
+            else
+            {
+                Days -= 365;
+                result.Year++;
+            }
+        }
+
+        int DaysInMonth[] = {31, result.Year % 4 == 0 ? 29 : 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+        for (result.Month = 0; result.Month < 12; result.Month++)
+        {
+            if (Days < static_cast<uint64_t>(DaysInMonth[result.Month]))
+                break;
+            Days -= DaysInMonth[result.Month];
+        }
+        result.Month++;
+
+        result.Day = static_cast<int>(Days) + 1;
+        result.Hour = static_cast<int>(Hours % 24);
+        result.Minute = static_cast<int>(Minutes % 60);
+        result.Second = static_cast<int>(Seconds % 60);
+        result.Counter = static_cast<uint64_t>(Timestamp);
+        return result;
+    }
+}
diff --git a/Kernel/Core/Time/TimeStampCounter.cpp b/Kernel/Core/Time/TimeStampCounter.cpp
new file mode 100644
index 00000000..61ab3afa
--- /dev/null
+++ b/Kernel/Core/Time/TimeStampCounter.cpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <time.hpp>
+
+#include <memory.hpp>
+#include <debug.h>
+#include <io.h>
+
+#if defined(a64)
+#include "../../Architecture/amd64/acpi.hpp"
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+namespace Time
+{
+    bool TimeStampCounter::Sleep(uint64_t Duration, Units Unit)
+    {
+#if defined(a86)
+        uint64_t Target = this->GetCounter() + (Duration * ConvertUnit(Unit)) / this->clk;
+        while (this->GetCounter() < Target)
+            CPU::Pause();
+        return true;
+#endif
+    }
+
+    uint64_t TimeStampCounter::GetCounter()
+    {
+#if defined(a86)
+        return CPU::Counter();
+#endif
+    }
+
+    uint64_t TimeStampCounter::CalculateTarget(uint64_t Target, Units Unit)
+    {
+#if defined(a86)
+        return this->GetCounter() + (Target * ConvertUnit(Unit)) / this->clk;
+#endif
+    }
+
+    uint64_t TimeStampCounter::GetNanosecondsSinceClassCreation()
+    {
+#if defined(a86)
+        return (this->GetCounter() - this->ClassCreationTime) / this->clk;
+#endif
+    }
+
+    TimeStampCounter::TimeStampCounter()
+    {
+#if defined(a86)
+        fixme(""); // FIXME: This is not a good way to measure the clock speed
+        uint64_t Start = CPU::Counter();
+        TimeManager->Sleep(1, Units::Milliseconds);
+        uint64_t End = CPU::Counter();
+
+        this->clk = End - Start;
+        this->ClassCreationTime = this->GetCounter();
+#endif
+    }
+
+    TimeStampCounter::~TimeStampCounter()
+    {
+    }
+}
diff --git a/Kernel/Core/Time/Timer.cpp b/Kernel/Core/Time/Timer.cpp
new file mode 100644
index 00000000..837bd123
--- /dev/null
+++ b/Kernel/Core/Time/Timer.cpp
@@ -0,0 +1,215 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <time.hpp>
+
+#include <memory.hpp>
+#include <debug.h>
+#include <io.h>
+
+#if defined(a64)
+#include "../../Architecture/amd64/acpi.hpp"
+#elif defined(a32)
+#include "../../Architecture/i386/acpi.hpp"
+#elif defined(aa64)
+#endif
+
+#include "../../kernel.h"
+
+namespace Time
+{
+    bool time::Sleep(uint64_t Duration, Units Unit)
+    {
+        switch (ActiveTimer)
+        {
+        case NONE:
+            error("No timer is active");
+            return false;
+        case RTC:
+            fixme("RTC sleep not implemented");
+            return false;
+        case PIT:
+            fixme("PIT sleep not implemented");
+            return false;
+        case HPET:
+            return this->hpet->Sleep(Duration, Unit);
+        case ACPI:
+            fixme("ACPI sleep not implemented");
+            return false;
+        case APIC:
+            fixme("APIC sleep not implemented");
+            return false;
+        case TSC:
+            return this->tsc->Sleep(Duration, Unit);
+        default:
+            error("Unknown timer");
+            return false;
+        }
+    }
+
+    uint64_t time::GetCounter()
+    {
+        switch (ActiveTimer)
+        {
+        case NONE:
+            error("No timer is active");
+            return false;
+        case RTC:
+            fixme("RTC sleep not implemented");
+            return false;
+        case PIT:
+            fixme("PIT sleep not implemented");
+            return false;
+        case HPET:
+            return this->hpet->GetCounter();
+        case ACPI:
+            fixme("ACPI sleep not implemented");
+            return false;
+        case APIC:
+            fixme("APIC sleep not implemented");
+            return false;
+        case TSC:
+            return this->tsc->GetCounter();
+        default:
+            error("Unknown timer");
+            return false;
+        }
+    }
+
+    uint64_t time::CalculateTarget(uint64_t Target, Units Unit)
+    {
+        switch (ActiveTimer)
+        {
+        case NONE:
+            error("No timer is active");
+            return false;
+        case RTC:
+            fixme("RTC sleep not implemented");
+            return false;
+        case PIT:
+            fixme("PIT sleep not implemented");
+            return false;
+        case HPET:
+            return this->hpet->CalculateTarget(Target, Unit);
+        case ACPI:
+            fixme("ACPI sleep not implemented");
+            return false;
+        case APIC:
+            fixme("APIC sleep not implemented");
+            return false;
+        case TSC:
+            return this->tsc->CalculateTarget(Target, Unit);
+        default:
+            error("Unknown timer");
+            return false;
+        }
+    }
+
+    uint64_t time::GetNanosecondsSinceClassCreation()
+    {
+        switch (ActiveTimer)
+        {
+        case NONE:
+            error("No timer is active");
+            return false;
+        case RTC:
+            fixme("RTC sleep not implemented");
+            return false;
+        case PIT:
+            fixme("PIT sleep not implemented");
+            return false;
+        case HPET:
+            return this->hpet->GetNanosecondsSinceClassCreation();
+        case ACPI:
+            fixme("ACPI sleep not implemented");
+            return false;
+        case APIC:
+            fixme("APIC sleep not implemented");
+            return false;
+        case TSC:
+            return this->tsc->GetNanosecondsSinceClassCreation();
+        default:
+            error("Unknown timer");
+            return false;
+        }
+    }
+
+    void time::FindTimers(void *acpi)
+    {
+#if defined(a86)
+        /* TODO: RTC check */
+        /* TODO: PIT check */
+
+        if (acpi)
+        {
+            if (((ACPI::ACPI *)acpi)->HPET)
+            {
+                hpet = new HighPrecisionEventTimer(((ACPI::ACPI *)acpi)->HPET);
+                ActiveTimer = HPET;
+                SupportedTimers |= HPET;
+                KPrint("\e11FF11HPET found");
+            }
+            else
+            {
+                KPrint("\eFF2200HPET not found");
+            }
+
+            /* TODO: ACPI check */
+            /* TODO: APIC check */
+        }
+        else
+        {
+            KPrint("\eFF2200ACPI not found");
+        }
+
+        bool TSCInvariant = false;
+        if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+        {
+            CPU::x86::AMD::CPUID0x80000007 cpuid80000007;
+            cpuid80000007.Get();
+            if (cpuid80000007.EDX.TscInvariant)
+                TSCInvariant = true;
+        }
+        else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+        {
+            // TODO: Intel 0x80000007
+            CPU::x86::AMD::CPUID0x80000007 cpuid80000007;
+            cpuid80000007.Get();
+            if (cpuid80000007.EDX.TscInvariant)
+                TSCInvariant = true;
+        }
+
+        if (TSCInvariant)
+        {
+            tsc = new TimeStampCounter;
+            // FIXME: ActiveTimer = TSC;
+            SupportedTimers |= TSC;
+            KPrint("\e11FF11Invariant TSC found");
+        }
+        else
+            KPrint("\eFF2200TSC is not invariant");
+#endif
+    }
+
+    time::time()
+    {
+    }
+
+    time::~time()
+    {
+    }
+}
diff --git a/Kernel/Core/UndefinedBehaviorSanitization.c b/Kernel/Core/UndefinedBehaviorSanitization.c
new file mode 100644
index 00000000..8d19125a
--- /dev/null
+++ b/Kernel/Core/UndefinedBehaviorSanitization.c
@@ -0,0 +1,610 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "ubsan.h"
+
+#include <convert.h>
+#include <debug.h>
+
+// TODO: implement:
+/*
+__ubsan_handle_type_mismatch_v1_abort
+__ubsan_handle_add_overflow_abort
+__ubsan_handle_sub_overflow_abort
+__ubsan_handle_mul_overflow_abort
+__ubsan_handle_negate_overflow_abort
+__ubsan_handle_divrem_overflow_abort
+__ubsan_handle_shift_out_of_bounds_abort
+__ubsan_handle_out_of_bounds_abort
+__ubsan_handle_vla_bound_not_positive_abort
+__ubsan_handle_float_cast_overflow
+__ubsan_handle_float_cast_overflow_abort
+__ubsan_handle_load_invalid_value_abort
+__ubsan_handle_invalid_builtin_abort
+__ubsan_handle_function_type_mismatch_abort
+__ubsan_handle_nonnull_return_v1
+__ubsan_handle_nonnull_return_v1_abort
+__ubsan_handle_nullability_return_v1
+__ubsan_handle_nullability_return_v1_abort
+__ubsan_handle_nonnull_arg_abort
+__ubsan_handle_nullability_arg
+__ubsan_handle_nullability_arg_abort
+__ubsan_handle_pointer_overflow_abort
+__ubsan_handle_cfi_check_fail
+*/
+
+extern void __asan_report_load1(void *unknown)
+{
+    ubsan("load1");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load2(void *unknown)
+{
+    ubsan("load2");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load4(void *unknown)
+{
+    ubsan("load4");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load8(void *unknown)
+{
+    ubsan("load8");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load16(void *unknown)
+{
+    ubsan("load16");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load_n(void *unknown, uintptr_t size)
+{
+    ubsan("loadn");
+    UNUSED(unknown);
+    UNUSED(size);
+}
+
+extern void __asan_report_store1(void *unknown)
+{
+    ubsan("store1");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store2(void *unknown)
+{
+    ubsan("store2");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store4(void *unknown)
+{
+    ubsan("store4");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store8(void *unknown)
+{
+    ubsan("store8");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store16(void *unknown)
+{
+    ubsan("store16");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store_n(void *unknown, uintptr_t size)
+{
+    ubsan("storen");
+    UNUSED(unknown);
+    UNUSED(size);
+}
+
+extern void __asan_report_load1_noabort(void *unknown)
+{
+    ubsan("load1");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load2_noabort(void *unknown)
+{
+    ubsan("load2");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load4_noabort(void *unknown)
+{
+    ubsan("load4");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load8_noabort(void *unknown)
+{
+    ubsan("load8");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load16_noabort(void *unknown)
+{
+    ubsan("load16");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_load_n_noabort(void *unknown, uintptr_t size)
+{
+    ubsan("loadn");
+    UNUSED(unknown);
+    UNUSED(size);
+}
+
+extern void __asan_report_store1_noabort(void *unknown)
+{
+    ubsan("store1");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store2_noabort(void *unknown)
+{
+    ubsan("store2");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store4_noabort(void *unknown)
+{
+    ubsan("store4");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store8_noabort(void *unknown)
+{
+    ubsan("store8");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store16_noabort(void *unknown)
+{
+    ubsan("store16");
+    UNUSED(unknown);
+}
+
+extern void __asan_report_store_n_noabort(void *unknown, uintptr_t size)
+{
+    ubsan("storen");
+    UNUSED(unknown);
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_0(uintptr_t size)
+{
+    ubsan("stack malloc 0");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_1(uintptr_t size)
+{
+    ubsan("stack malloc 1");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_2(uintptr_t size)
+{
+    ubsan("stack malloc 2");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_3(uintptr_t size)
+{
+    ubsan("stack malloc 3");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_4(uintptr_t size)
+{
+    ubsan("stack malloc 4");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_5(uintptr_t size)
+{
+    ubsan("stack malloc 5");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_6(uintptr_t size)
+{
+    ubsan("stack malloc 6");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_7(uintptr_t size)
+{
+    ubsan("stack malloc 7");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_8(uintptr_t size)
+{
+    ubsan("stack malloc 8");
+    UNUSED(size);
+}
+
+extern void __asan_stack_malloc_9(uintptr_t size)
+{
+    ubsan("stack malloc 9");
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_0(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 0");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_1(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 1");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_2(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 2");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_3(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 3");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_4(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 4");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_5(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 5");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_6(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 6");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_7(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 7");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_8(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 8");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_stack_free_9(void *ptr, uintptr_t size)
+{
+    ubsan("stack free 9");
+    UNUSED(ptr);
+    UNUSED(size);
+}
+
+extern void __asan_poison_stack_memory(void *addr, uintptr_t size)
+{
+    ubsan("poison stack memory");
+    UNUSED(addr);
+    UNUSED(size);
+}
+
+extern void __asan_unpoison_stack_memory(void *addr, uintptr_t size)
+{
+    ubsan("unpoison stack memory");
+    UNUSED(addr);
+    UNUSED(size);
+}
+
+extern void __asan_before_dynamic_init(const char *module_name)
+{
+    ubsan("before dynamic init");
+    UNUSED(module_name);
+}
+
+extern void __asan_after_dynamic_init(void) { ubsan("after dynamic init"); }
+
+extern void __asan_register_globals(void *unknown, size_t size)
+{
+    ubsan("register_globals");
+    UNUSED(unknown);
+    UNUSED(size);
+}
+
+extern void __asan_unregister_globals(void) { ubsan("unregister_globals"); }
+
+extern void __asan_init(void) { ubsan("init"); }
+extern void __asan_version_mismatch_check_v8(void) { ubsan("version_mismatch_check_v8"); }
+extern void __asan_option_detect_stack_use_after_return(void) { ubsan("stack use after return"); }
+
+extern __noreturn void __asan_handle_no_return(void)
+{
+    ubsan("no_return");
+    while (1)
+        ;
+}
+
+#define is_aligned(value, alignment) !(value & (alignment - 1))
+
+const char *Type_Check_Kinds[] = {
+    "Load of",
+    "Store to",
+    "Reference binding to",
+    "Member access within",
+    "Member call on",
+    "Constructor call on",
+    "Downcast of",
+    "Downcast of",
+    "Upcast of",
+    "Cast to virtual base of",
+};
+
+bool UBSANMsg(const char *file, uint32_t line, uint32_t column)
+{
+    /* This can be ignored (unaligned memory access) */
+    if (strstr(file, "AdvancedConfigurationAndPowerInterface.cpp") &&
+        ((line == 34 && column == 47) ||
+         (line == 36 && column == 47)))
+        return false;
+
+    /* This can be ignored (unaligned memory access) */
+    if (strstr(file, "SystemManagementBIOS.cpp") &&
+        ((line == 47 && column == 21) ||
+         (line == 44 && column == 49) ||
+         (line == 62 && column == 26)))
+        return false;
+
+    /* This can be ignored (unaligned memory access) */
+    if (strstr(file, "DynamicHostConfigurationProtocol.cpp") &&
+        (line == 63 && column == 30))
+        return false;
+
+    if (strstr(file, "liballoc_1_1.c"))
+        return false;
+
+    /* This can be ignored (store address x with insufficient space for object of type 'y') */
+    if (strstr(file, "Task.cpp") && line > 500)
+        return false;
+
+    /* This can be ignored (store address x with insufficient space for object of type 'y') */
+    if (strstr(file, "InternetProtocol.cpp") &&
+        ((line == 66 && column == 13) ||
+         (line == 66 && column == 93) ||
+         (line == 68 && column == 51) ||
+         (line == 68 && column == 165) ||
+         (line == 73 && column == 36) ||
+         (line == 78 && column == 54) ||
+         (line == 79 && column == 64) ||
+
+         (line == 81 && column == 126) ||
+         (line == 81 && column == 165) ||
+
+         (line == 81 && column == 15) ||
+         (line == 156 && column == 38) ||
+         (line == 157 && column == 47) ||
+         (line == 158 && column == 45)))
+        return false;
+
+    /* This can be ignored (store address x with insufficient space for object of type 'y') */
+    if (strstr(file, "DynamicHostConfigurationProtocol.cpp") &&
+        ((line == 156 && column == 38) ||
+         (line == 157 && column == 47) ||
+         (line == 158 && column == 45)))
+        return false;
+
+    ubsan("\t\tIn File: %s:%i:%i", file, line, column);
+    return true;
+}
+
+void __ubsan_handle_type_mismatch_v1(struct type_mismatch_v1_data *type_mismatch, uintptr_t pointer)
+{
+    struct source_location *location = &type_mismatch->location;
+    if (pointer == 0)
+    {
+        if (UBSANMsg(location->file, location->line, location->column))
+        {
+            ubsan("Null pointer access.");
+        }
+    }
+    else if (type_mismatch->alignment != 0 && is_aligned(pointer, type_mismatch->alignment))
+    {
+        if (UBSANMsg(location->file, location->line, location->column))
+        {
+            ubsan("Unaligned memory access %#llx.", pointer);
+        }
+    }
+    else
+    {
+        if (UBSANMsg(location->file, location->line, location->column))
+        {
+            ubsan("%s address %#llx with insufficient space for object of type %s",
+                  Type_Check_Kinds[type_mismatch->type_check_kind], (void *)pointer, type_mismatch->type->name);
+        }
+    }
+}
+
+void __ubsan_handle_add_overflow(struct overflow_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Addition overflow.");
+    }
+}
+
+void __ubsan_handle_sub_overflow(struct overflow_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Subtraction overflow.");
+    }
+}
+
+void __ubsan_handle_mul_overflow(struct overflow_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Multiplication overflow.");
+    }
+}
+
+void __ubsan_handle_divrem_overflow(struct overflow_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Division overflow.");
+    }
+}
+
+void __ubsan_handle_negate_overflow(struct overflow_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Negation overflow.");
+    }
+}
+
+void __ubsan_handle_pointer_overflow(struct overflow_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Pointer overflow.");
+    }
+}
+
+void __ubsan_handle_shift_out_of_bounds(struct shift_out_of_bounds_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Shift out of bounds.");
+    }
+}
+
+void __ubsan_handle_load_invalid_value(struct invalid_value_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Invalid load value.");
+    }
+}
+
+void __ubsan_handle_out_of_bounds(struct array_out_of_bounds_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Array out of bounds.");
+    }
+}
+
+void __ubsan_handle_vla_bound_not_positive(struct negative_vla_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Variable-length argument is negative.");
+    }
+}
+
+void __ubsan_handle_nonnull_return(struct nonnull_return_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Non-null return is null.");
+    }
+}
+
+void __ubsan_handle_nonnull_return_v1(struct nonnull_return_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Non-null return is null.");
+    }
+}
+
+void __ubsan_handle_nonnull_arg(struct nonnull_arg_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Non-null argument is null.");
+    }
+}
+
+void __ubsan_handle_builtin_unreachable(struct unreachable_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Unreachable code reached.");
+    }
+}
+
+void __ubsan_handle_invalid_builtin(struct invalid_builtin_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Invalid builtin.");
+    }
+}
+
+void __ubsan_handle_missing_return(struct unreachable_data *data)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Missing return.");
+    }
+}
+
+void __ubsan_vptr_type_cache(uintptr_t *cache, uintptr_t ptr)
+{
+    ubsan("Vptr type cache.");
+    *cache = ptr;
+}
+
+void __ubsan_handle_dynamic_type_cache_miss(struct dynamic_type_cache_miss_data *data, uintptr_t ptr)
+{
+    if (UBSANMsg(data->location.file, data->location.line, data->location.column))
+    {
+        ubsan("Dynamic type cache miss.");
+    }
+    UNUSED(ptr);
+}
\ No newline at end of file
diff --git a/Kernel/Core/UniversalAsynchronousReceiverTransmitter.cpp b/Kernel/Core/UniversalAsynchronousReceiverTransmitter.cpp
new file mode 100644
index 00000000..e9b79617
--- /dev/null
+++ b/Kernel/Core/UniversalAsynchronousReceiverTransmitter.cpp
@@ -0,0 +1,171 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <uart.hpp>
+
+#include <debug.h>
+#include <vector>
+
+volatile bool serialports[8] = {false, false, false, false, false, false, false, false};
+std::vector<UniversalAsynchronousReceiverTransmitter::Events *> RegisteredEvents;
+
+#if defined(a86)
+NIF __always_inline inline uint8_t NoProfiler_inportb(uint16_t Port)
+{
+    uint8_t Result;
+    asm("in %%dx, %%al"
+        : "=a"(Result)
+        : "d"(Port));
+    return Result;
+}
+
+NIF __always_inline inline void NoProfiler_outportb(uint16_t Port, uint8_t Data)
+{
+    asmv("out %%al, %%dx"
+         :
+         : "a"(Data), "d"(Port));
+}
+#endif
+
+namespace UniversalAsynchronousReceiverTransmitter
+{
+#define SERIAL_ENABLE_DLAB 0x80
+#define SERIAL_RATE_115200_LO 0x01
+#define SERIAL_RATE_115200_HI 0x00
+#define SERIAL_RATE_57600_LO 0x02
+#define SERIAL_RATE_57600_HI 0x00
+#define SERIAL_RATE_38400_LO 0x03
+#define SERIAL_RATE_38400_HI 0x00
+#define SERIAL_BUFFER_EMPTY 0x20
+
+    /* TODO: Serial Port implementation needs reword. https://wiki.osdev.org/Serial_Ports */
+
+    SafeFunction NIF UART::UART(SerialPorts Port)
+    {
+#if defined(a86)
+        if (Port == COMNULL)
+            return;
+
+        this->Port = Port;
+        int PortNumber = 0;
+
+        switch (Port)
+        {
+        case COM1:
+            PortNumber = 0;
+            break;
+        case COM2:
+            PortNumber = 1;
+            break;
+        case COM3:
+            PortNumber = 2;
+            break;
+        case COM4:
+            PortNumber = 3;
+            break;
+        case COM5:
+            PortNumber = 4;
+            break;
+        case COM6:
+            PortNumber = 5;
+            break;
+        case COM7:
+            PortNumber = 6;
+            break;
+        case COM8:
+            PortNumber = 7;
+            break;
+        default:
+            return;
+        }
+
+        if (serialports[PortNumber])
+            return;
+
+        // Initialize the serial port
+        NoProfiler_outportb(s_cst(uint16_t, Port + 1), 0x00);                  // Disable all interrupts
+        NoProfiler_outportb(s_cst(uint16_t, Port + 3), SERIAL_ENABLE_DLAB);    // Enable DLAB (set baud rate divisor)
+        NoProfiler_outportb(s_cst(uint16_t, Port + 0), SERIAL_RATE_115200_LO); // Set divisor to 1 (lo byte) 115200 baud
+        NoProfiler_outportb(s_cst(uint16_t, Port + 1), SERIAL_RATE_115200_HI); //                  (hi byte)
+        NoProfiler_outportb(s_cst(uint16_t, Port + 3), 0x03);                  // 8 bits, no parity, one stop bit
+        NoProfiler_outportb(s_cst(uint16_t, Port + 2), 0xC7);                  // Enable FIFO, clear them, with 14-byte threshold
+        NoProfiler_outportb(s_cst(uint16_t, Port + 4), 0x0B);                  // IRQs enabled, RTS/DSR set
+
+        // Check if the serial port is faulty.
+        if (NoProfiler_inportb(s_cst(uint16_t, Port + 0)) != 0xAE)
+        {
+            static int once = 0;
+            if (!once++)
+                warn("Serial port %#llx is faulty.", Port);
+            // serialports[Port] = false; // ignore for now
+            // return;
+        }
+
+        // Set to normal operation mode.
+        NoProfiler_outportb(s_cst(uint16_t, Port + 4), 0x0F);
+        serialports[PortNumber] = true;
+#endif
+    }
+
+    SafeFunction NIF UART::~UART() {}
+
+    SafeFunction NIF void UART::Write(uint8_t Char)
+    {
+#if defined(a86)
+        while ((NoProfiler_inportb(s_cst(uint16_t, Port + 5)) & SERIAL_BUFFER_EMPTY) == 0)
+            ;
+        NoProfiler_outportb(Port, Char);
+#endif
+        foreach (auto e in RegisteredEvents)
+            if (e->GetRegisteredPort() == Port || e->GetRegisteredPort() == COMNULL)
+                e->OnSent(Char);
+    }
+
+    SafeFunction NIF uint8_t UART::Read()
+    {
+#if defined(a86)
+        while ((NoProfiler_inportb(s_cst(uint16_t, Port + 5)) & 1) == 0)
+            ;
+        return NoProfiler_inportb(Port);
+#endif
+        foreach (auto e in RegisteredEvents)
+        {
+            if (e->GetRegisteredPort() == Port || e->GetRegisteredPort() == COMNULL)
+            {
+#if defined(a86)
+                e->OnReceived(NoProfiler_inportb(Port));
+#endif
+            }
+        }
+    }
+
+    SafeFunction NIF Events::Events(SerialPorts Port)
+    {
+        this->Port = Port;
+        RegisteredEvents.push_back(this);
+    }
+
+    SafeFunction NIF Events::~Events()
+    {
+        for (size_t i = 0; i < RegisteredEvents.size(); i++)
+            if (RegisteredEvents[i] == this)
+            {
+                RegisteredEvents.remove(i);
+                return;
+            }
+    }
+}
diff --git a/Kernel/Core/Video/Display.cpp b/Kernel/Core/Video/Display.cpp
new file mode 100644
index 00000000..c3462929
--- /dev/null
+++ b/Kernel/Core/Video/Display.cpp
@@ -0,0 +1,442 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <display.hpp>
+#include <lock.hpp>
+#include <uart.hpp>
+#include <debug.h>
+
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_start;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_end;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_size;
+
+NewLock(PrintLock);
+
+namespace Video
+{
+    Font *Display::GetCurrentFont() { return CurrentFont; }
+    void Display::SetCurrentFont(Font *Font) { CurrentFont = Font; }
+    uint16_t Display::GetBitsPerPixel() { return this->framebuffer.BitsPerPixel; }
+    uint64_t Display::GetPitch() { return this->framebuffer.Pitch; }
+
+    void Display::CreateBuffer(uint32_t Width, uint32_t Height, int Index)
+    {
+        if (Width == 0 || Height == 0)
+        {
+            Width = this->framebuffer.Width;
+            Height = this->framebuffer.Height;
+            debug("Buffer %d created with default size (%d, %d)", Index, Width, Height);
+        }
+
+        if (this->Buffers[Index].Checksum == 0xBBFFE515A117E)
+        {
+            warn("Buffer %d already exists, skipping creation", Index);
+            return;
+        }
+
+        size_t Size = this->framebuffer.Pitch * Height;
+
+        this->Buffers[Index].Buffer = KernelAllocator.RequestPages(TO_PAGES(Size + 1));
+        memset(this->Buffers[Index].Buffer, 0, Size);
+
+        this->Buffers[Index].Width = Width;
+        this->Buffers[Index].Height = Height;
+        this->Buffers[Index].Size = Size;
+        this->Buffers[Index].Color = 0xFFFFFF;
+        this->Buffers[Index].CursorX = 0;
+        this->Buffers[Index].CursorY = 0;
+        this->Buffers[Index].Brightness = 100;
+        this->Buffers[Index].Checksum = 0xBBFFE515A117E;
+        debug("Buffer %d created", Index);
+    }
+
+    void Display::SetBuffer(int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        if (this->Buffers[Index].Brightness != 100)
+            this->SetBrightness(this->Buffers[Index].Brightness, Index);
+
+        if (this->Buffers[Index].Brightness == 0) /* Just clear the buffer */
+            memset(this->Buffers[Index].Buffer, 0, this->Buffers[Index].Size);
+
+        memcpy(this->framebuffer.BaseAddress, this->Buffers[Index].Buffer, this->Buffers[Index].Size);
+    }
+
+    ScreenBuffer *Display::GetBuffer(int Index) { return &this->Buffers[Index]; }
+
+    void Display::ClearBuffer(int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        memset(this->Buffers[Index].Buffer, 0, this->Buffers[Index].Size);
+    }
+
+    void Display::DeleteBuffer(int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        KernelAllocator.FreePages(this->Buffers[Index].Buffer, TO_PAGES(this->Buffers[Index].Size + 1));
+        this->Buffers[Index].Buffer = nullptr;
+        this->Buffers[Index].Checksum = 0;
+        debug("Buffer %d deleted", Index);
+    }
+
+    void Display::SetBrightness(int Value, int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        if (Value > 100)
+            Value = 100;
+        else if (Value < 0)
+            Value = 0;
+
+        uint32_t *pixel = (uint32_t *)this->Buffers[Index].Buffer;
+
+        for (uint32_t y = 0; y < this->Buffers[Index].Height; y++)
+        {
+            for (uint32_t x = 0; x < this->Buffers[Index].Width; x++)
+            {
+                uint32_t color = pixel[y * this->Buffers[Index].Width + x];
+
+                uint8_t r = color & 0xff;
+                uint8_t g = (color >> 8) & 0xff;
+                uint8_t b = (color >> 16) & 0xff;
+
+                r = s_cst(uint8_t, (r * Value) / 100);
+                g = s_cst(uint8_t, (g * Value) / 100);
+                b = s_cst(uint8_t, (b * Value) / 100);
+
+                pixel[y * this->Buffers[Index].Width + x] = (b << 16) | (g << 8) | r;
+            }
+        }
+        this->Buffers[Index].Brightness = s_cst(char, Value);
+    }
+
+    void Display::SetBufferCursor(int Index, uint32_t X, uint32_t Y)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        this->Buffers[Index].CursorX = X;
+        this->Buffers[Index].CursorY = Y;
+    }
+
+    void Display::GetBufferCursor(int Index, uint32_t *X, uint32_t *Y)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        *X = this->Buffers[Index].CursorX;
+        *Y = this->Buffers[Index].CursorY;
+    }
+
+    void Display::SetPixel(uint32_t X, uint32_t Y, uint32_t Color, int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        if (unlikely(X >= this->Buffers[Index].Width))
+            X = this->Buffers[Index].Width - 1;
+
+        if (unlikely(Y >= this->Buffers[Index].Height))
+            Y = this->Buffers[Index].Height - 1;
+
+        uint32_t *Pixel = (uint32_t *)((uintptr_t)this->Buffers[Index].Buffer + (Y * this->Buffers[Index].Width + X) * (this->framebuffer.BitsPerPixel / 8));
+        *Pixel = Color;
+    }
+
+    uint32_t Display::GetPixel(uint32_t X, uint32_t Y, int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+            return 0;
+
+        if (unlikely(X >= this->Buffers[Index].Width || Y >= this->Buffers[Index].Height))
+            return 0;
+
+        uint32_t *Pixel = (uint32_t *)((uintptr_t)this->Buffers[Index].Buffer + (Y * this->Buffers[Index].Width + X) * (this->framebuffer.BitsPerPixel / 8));
+        return *Pixel;
+    }
+
+    void Display::Scroll(int Index, int Lines)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        if (this->Buffers[Index].DoNotScroll)
+            return;
+
+        if (Lines == 0)
+            return;
+
+        if (Lines > 0)
+        {
+            uint32_t LineSize = this->Buffers[Index].Width * (this->framebuffer.BitsPerPixel / 8);
+            uint32_t BytesToMove = LineSize * Lines * this->CurrentFont->GetInfo().Height;
+            size_t BytesToClear = this->Buffers[Index].Size - BytesToMove;
+            memmove(this->Buffers[Index].Buffer, (uint8_t *)this->Buffers[Index].Buffer + BytesToMove, BytesToClear);
+            memset((uint8_t *)this->Buffers[Index].Buffer + BytesToClear, 0, BytesToMove);
+        }
+    }
+
+    void Display::SetDoNotScroll(bool Value, int Index)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        this->Buffers[Index].DoNotScroll = Value;
+    }
+
+    char Display::Print(char Char, int Index, bool WriteToUART)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+            return 0;
+
+        // SmartLock(PrintLock);
+
+        if (this->ColorIteration)
+        {
+            // RRGGBB
+            if (Char >= '0' && Char <= '9')
+                this->Buffers[Index].Color = (this->Buffers[Index].Color << 4) | (Char - '0');
+            else if (Char >= 'a' && Char <= 'f')
+                this->Buffers[Index].Color = (this->Buffers[Index].Color << 4) | (Char - 'a' + 10);
+            else if (Char >= 'A' && Char <= 'F')
+                this->Buffers[Index].Color = (this->Buffers[Index].Color << 4) | (Char - 'A' + 10);
+            else
+                this->Buffers[Index].Color = 0xFFFFFF;
+            if (WriteToUART)
+                UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM1).Write(Char);
+            this->ColorPickerIteration++;
+            if (this->ColorPickerIteration == 6)
+            {
+                this->ColorPickerIteration = 0;
+                if (WriteToUART)
+                    UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM1).Write(']');
+                this->ColorIteration = false;
+            }
+            return Char;
+        }
+
+        if (WriteToUART)
+            UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM1).Write(Char);
+
+        switch (Char)
+        {
+        case '\e':
+        {
+            if (WriteToUART)
+                UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM1).Write('[');
+            this->ColorIteration = true;
+            return Char;
+        }
+        case '\b':
+        {
+            switch (this->CurrentFont->GetInfo().Type)
+            {
+            case FontType::PCScreenFont1:
+            {
+                fixme("PCScreenFont1");
+                break;
+            }
+            case FontType::PCScreenFont2:
+            {
+                uint32_t fonthdrWidth = this->CurrentFont->GetInfo().PSF2Font->Header->width;
+                uint32_t fonthdrHeight = this->CurrentFont->GetInfo().PSF2Font->Header->height;
+
+                for (unsigned long Y = this->Buffers[Index].CursorY; Y < this->Buffers[Index].CursorY + fonthdrHeight; Y++)
+                    for (unsigned long X = this->Buffers[Index].CursorX - fonthdrWidth; X < this->Buffers[Index].CursorX; X++)
+                        *(uint32_t *)((uintptr_t)this->Buffers[Index].Buffer +
+                                      (Y * this->Buffers[Index].Width + X) * (this->framebuffer.BitsPerPixel / 8)) = 0;
+                break;
+            }
+            default:
+                warn("Unsupported font type");
+                break;
+            }
+
+            if (this->Buffers[Index].CursorX > 0)
+                this->Buffers[Index].CursorX -= this->GetCurrentFont()->GetInfo().Width;
+
+            return Char;
+        }
+        case '\t':
+        {
+            this->Buffers[Index].CursorX = (this->Buffers[Index].CursorX + 8) & ~(8 - 1);
+            return Char;
+        }
+        case '\r':
+        {
+            this->Buffers[Index].CursorX = 0;
+            return Char;
+        }
+        case '\n':
+        {
+            this->Buffers[Index].CursorX = 0;
+            this->Buffers[Index].CursorY += this->GetCurrentFont()->GetInfo().Height;
+            return Char;
+        }
+        default:
+            break;
+        }
+
+        uint32_t FontHeight = this->GetCurrentFont()->GetInfo().Height;
+
+        if (this->Buffers[Index].CursorX + this->GetCurrentFont()->GetInfo().Width >= this->Buffers[Index].Width)
+        {
+            this->Buffers[Index].CursorX = 0;
+            this->Buffers[Index].CursorY += FontHeight;
+        }
+
+        if (this->Buffers[Index].CursorY + FontHeight >= this->Buffers[Index].Height)
+        {
+            if (!this->Buffers[Index].DoNotScroll)
+            {
+                this->Buffers[Index].CursorY -= FontHeight;
+                this->Scroll(Index, 1);
+            }
+        }
+
+        switch (this->CurrentFont->GetInfo().Type)
+        {
+        case FontType::PCScreenFont1:
+        {
+            uint32_t *PixelPtr = (uint32_t *)this->Buffers[Index].Buffer;
+            char *FontPtr = (char *)this->CurrentFont->GetInfo().PSF1Font->GlyphBuffer + (Char * this->CurrentFont->GetInfo().PSF1Font->Header->charsize);
+            for (uint64_t Y = this->Buffers[Index].CursorY; Y < this->Buffers[Index].CursorY + 16; Y++)
+            {
+                for (uint64_t X = this->Buffers[Index].CursorX; X < this->Buffers[Index].CursorX + 8; X++)
+                    if ((*FontPtr & (0b10000000 >> (X - this->Buffers[Index].CursorX))) > 0)
+                        *(unsigned int *)(PixelPtr + X + (Y * this->Buffers[Index].Width)) = this->Buffers[Index].Color;
+                FontPtr++;
+            }
+            this->Buffers[Index].CursorX += 8;
+
+            break;
+        }
+        case FontType::PCScreenFont2:
+        {
+            // if (this->CurrentFont->PSF2Font->GlyphBuffer == (uint16_t *)0x01) // HAS UNICODE TABLE
+            //     Char = this->CurrentFont->PSF2Font->GlyphBuffer[Char];
+            int BytesPerLine = (this->CurrentFont->GetInfo().PSF2Font->Header->width + 7) / 8;
+            char *FontAddress = (char *)this->CurrentFont->GetInfo().StartAddress;
+            uint32_t FontHeaderSize = this->CurrentFont->GetInfo().PSF2Font->Header->headersize;
+            uint32_t FontCharSize = this->CurrentFont->GetInfo().PSF2Font->Header->charsize;
+            uint32_t FontLength = this->CurrentFont->GetInfo().PSF2Font->Header->length;
+            char *FontPtr = FontAddress + FontHeaderSize + (Char > 0 && (uint32_t)Char < FontLength ? Char : 0) * FontCharSize;
+
+            uint32_t FontHdrWidth = this->CurrentFont->GetInfo().PSF2Font->Header->width;
+            uint32_t FontHdrHeight = this->CurrentFont->GetInfo().PSF2Font->Header->height;
+
+            for (size_t Y = this->Buffers[Index].CursorY; Y < this->Buffers[Index].CursorY + FontHdrHeight; Y++)
+            {
+                for (size_t X = this->Buffers[Index].CursorX; X < this->Buffers[Index].CursorX + FontHdrWidth; X++)
+                {
+                    if ((*FontPtr & (0b10000000 >> (X - this->Buffers[Index].CursorX))) > 0)
+                    {
+                        void *FramebufferAddress = (void *)((uintptr_t)this->Buffers[Index].Buffer +
+                                                            (Y * this->Buffers[Index].Width + X) *
+                                                                (this->framebuffer.BitsPerPixel / 8));
+                        *(uint32_t *)FramebufferAddress = this->Buffers[Index].Color;
+                    }
+                }
+                FontPtr += BytesPerLine;
+            }
+            this->Buffers[Index].CursorX += FontHdrWidth;
+            break;
+        }
+        default:
+            warn("Unsupported font type");
+            break;
+        }
+        return Char;
+    }
+
+    void Display::DrawString(const char *String, uint32_t X, uint32_t Y, int Index, bool WriteToUART)
+    {
+        if (unlikely(this->Buffers[Index].Checksum != 0xBBFFE515A117E))
+        {
+            debug("Invalid buffer %d", Index);
+            return;
+        }
+
+        this->Buffers[Index].CursorX = X;
+        this->Buffers[Index].CursorY = Y;
+
+        for (int i = 0; String[i] != '\0'; i++)
+            this->Print(String[i], Index, WriteToUART);
+    }
+
+    Display::Display(BootInfo::FramebufferInfo Info, bool LoadDefaultFont)
+    {
+        this->framebuffer = Info;
+        if (LoadDefaultFont)
+        {
+            this->CurrentFont = new Font(&_binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_start, &_binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_end, FontType::PCScreenFont2);
+#ifdef DEBUG
+            FontInfo Info = this->CurrentFont->GetInfo();
+            debug("Font loaded: %dx%d %s",
+                  Info.Width, Info.Height, Info.Type == FontType::PCScreenFont1 ? "PSF1" : "PSF2");
+#endif
+        }
+        this->CreateBuffer(Info.Width, Info.Height, 0);
+    }
+
+    Display::~Display()
+    {
+        debug("Destructor called");
+        this->ClearBuffer(0);
+        this->SetBuffer(0);
+
+        for (int i = 0; i < s_cst(int, sizeof(this->Buffers) / sizeof(this->Buffers[0])); i++)
+        {
+            if (this->Buffers[i].Checksum == 0xBBFFE515A117E)
+                this->DeleteBuffer(i);
+        }
+    }
+}
diff --git a/Kernel/Core/Video/Font.cpp b/Kernel/Core/Video/Font.cpp
new file mode 100644
index 00000000..20cd3053
--- /dev/null
+++ b/Kernel/Core/Video/Font.cpp
@@ -0,0 +1,76 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <display.hpp>
+#include <debug.h>
+#include <cstring>
+
+namespace Video
+{
+    Font::Font(uintptr_t *Start, uintptr_t *End, FontType Type)
+    {
+        trace("Initializing font with start %#llx and end %#llx Type: %d", Start, End, Type);
+        this->Info.StartAddress = Start;
+        this->Info.EndAddress = End;
+        this->Info.Type = Type;
+        size_t FontDataLength = End - Start;
+
+        if (Type == FontType::PCScreenFont2)
+        {
+            this->Info.PSF2Font = new PSF2_FONT;
+
+            PSF2_HEADER *font2 = (PSF2_HEADER *)KernelAllocator.RequestPages(TO_PAGES(FontDataLength + 1));
+            memcpy((void *)font2, Start, FontDataLength);
+
+            Memory::Virtual().Map((void *)font2, (void *)font2, FontDataLength, Memory::PTFlag::RW);
+
+            if (font2->magic[0] != PSF2_MAGIC0 || font2->magic[1] != PSF2_MAGIC1 || font2->magic[2] != PSF2_MAGIC2 || font2->magic[3] != PSF2_MAGIC3)
+            {
+                error("Font2 magic mismatch.");
+                KernelAllocator.FreePages((void *)font2, TO_PAGES(FontDataLength + 1));
+                return;
+            }
+
+            this->Info.PSF2Font->Header = font2;
+            this->Info.PSF2Font->GlyphBuffer = reinterpret_cast<void *>(reinterpret_cast<uintptr_t>(Start) + sizeof(PSF2_HEADER));
+            this->Info.Width = font2->width;
+            this->Info.Height = font2->height;
+        }
+        else if (Type == FontType::PCScreenFont1)
+        {
+            this->Info.PSF1Font = new PSF1_FONT;
+            PSF1_HEADER *font1 = (PSF1_HEADER *)Start;
+            if (font1->magic[0] != PSF1_MAGIC0 || font1->magic[1] != PSF1_MAGIC1)
+                error("Font1 magic mismatch.");
+            uint32_t glyphBufferSize = font1->charsize * 256;
+            if (font1->mode == 1) // 512 glyph mode
+                glyphBufferSize = font1->charsize * 512;
+            void *glyphBuffer = reinterpret_cast<void *>(reinterpret_cast<uintptr_t>(Start) + sizeof(PSF1_HEADER));
+            this->Info.PSF1Font->Header = font1;
+            this->Info.PSF1Font->GlyphBuffer = glyphBuffer;
+            UNUSED(glyphBufferSize); // TODO: Use this in the future?
+
+            // TODO: Get font size.
+            this->Info.Width = 16;
+            this->Info.Height = 8;
+        }
+    }
+
+    Font::~Font()
+    {
+    }
+}
diff --git a/Kernel/Core/crashhandler.hpp b/Kernel/Core/crashhandler.hpp
new file mode 100644
index 00000000..0a9fc11b
--- /dev/null
+++ b/Kernel/Core/crashhandler.hpp
@@ -0,0 +1,35 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CRASH_HANDLER_H__
+#define __FENNIX_KERNEL_CRASH_HANDLER_H__
+
+#include <types.h>
+
+#include <ints.hpp>
+#include <cpu.hpp>
+
+namespace CrashHandler
+{
+    extern uintptr_t PageFaultAddress;
+    extern void *EHIntFrames[INT_FRAMES_MAX];
+
+    void EHPrint(const char *Format, ...);
+    void Handle(void *Data);
+}
+
+#endif // !__FENNIX_KERNEL_CRASH_HANDLER_H__
diff --git a/Kernel/Core/smbios.hpp b/Kernel/Core/smbios.hpp
new file mode 100644
index 00000000..c2f31cb7
--- /dev/null
+++ b/Kernel/Core/smbios.hpp
@@ -0,0 +1,357 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_SMBIOS_H__
+#define __FENNIX_KERNEL_SMBIOS_H__
+
+#include <types.h>
+
+namespace SMBIOS
+{
+    enum SMBIOSType
+    {
+        SMBIOSTypeBIOSInformation = 0,
+        SMBIOSTypeSystemInformation = 1,
+        SMBIOSTypeBaseBoardInformation = 2,
+        SMBIOSTypeSystemEnclosure = 3,
+        SMBIOSTypeProcessorInformation = 4,
+        SMBIOSTypeMemoryControllerInformation = 5,
+        SMBIOSTypeMemoryModuleInformation = 6,
+        SMBIOSTypeCacheInformation = 7,
+        SMBIOSTypePortConnectorInformation = 8,
+        SMBIOSTypeSystemSlots = 9,
+        SMBIOSTypeOnBoardDevicesInformation = 10,
+        SMBIOSTypeOEMStrings = 11,
+        SMBIOSTypeSystemConfigurationOptions = 12,
+        SMBIOSTypeBIOSLanguageInformation = 13,
+        SMBIOSTypeGroupAssociations = 14,
+        SMBIOSTypeSystemEventLog = 15,
+        SMBIOSTypePhysicalMemoryArray = 16,
+        SMBIOSTypeMemoryDevice = 17,
+        SMBIOSType32BitMemoryErrorInformation = 18,
+        SMBIOSTypeMemoryArrayMappedAddress = 19,
+        SMBIOSTypeMemoryDeviceMappedAddress = 20,
+        SMBIOSTypeBuiltInPointingDevice = 21,
+        SMBIOSTypePortableBattery = 22,
+        SMBIOSTypeSystemReset = 23,
+        SMBIOSTypeHardwareSecurity = 24,
+        SMBIOSTypeSystemPowerControls = 25,
+        SMBIOSTypeVoltageProbe = 26,
+        SMBIOSTypeCoolingDevice = 27,
+        SMBIOSTypeTemperatureProbe = 28,
+        SMBIOSTypeElectricalCurrentProbe = 29,
+        SMBIOSTypeOutofBandRemoteAccess = 30,
+        SMBIOSTypeBootIntegrityServices = 31,
+        SMBIOSTypeSystemBoot = 32,
+        SMBIOSType64BitMemoryErrorInformation = 33,
+        SMBIOSTypeManagementDevice = 34,
+        SMBIOSTypeManagementDeviceComponent = 35,
+        SMBIOSTypeManagementDeviceThresholdData = 36,
+        SMBIOSTypeMemoryChannel = 37,
+        SMBIOSTypeIPMIDevice = 38,
+        SMBIOSTypePowerSupply = 39,
+        SMBIOSTypeAdditionalInformation = 40,
+        SMBIOSTypeOnboardDevicesExtendedInformation = 41,
+        SMBIOSTypeManagementControllerHostInterface = 42,
+        SMBIOSTypeTPMDevice = 43,
+        SMBIOSTypeProcessorAdditionalInformation = 44,
+        SMBIOSTypeInactive = 126,
+        SMBIOSTypeEndOfTable = 127
+    };
+
+    struct SMBIOSHeader
+    {
+        unsigned char Type;
+        unsigned char Length;
+        unsigned short Handle;
+    };
+
+    struct SMBIOSEntryPoint
+    {
+        char EntryPointString[4];
+        unsigned char Checksum;
+        unsigned char Length;
+        unsigned char MajorVersion;
+        unsigned char MinorVersion;
+        unsigned short MaxStructureSize;
+        unsigned char EntryPointRevision;
+        char FormattedArea[5];
+        char EntryPointString2[5];
+        unsigned char Checksum2;
+        unsigned short TableLength;
+        unsigned int TableAddress;
+        unsigned short NumberOfStructures;
+        unsigned char BCDRevision;
+    };
+
+    static inline char *SMBIOSNextString(char *Str)
+    {
+        while (*Str != '\0')
+            Str++;
+        return Str + 1;
+    }
+
+    struct SMBIOSBIOSInformation
+    {
+        SMBIOSHeader Header;
+        unsigned char Vendor;
+        unsigned char Version;
+        unsigned short StartingAddressSegment;
+        unsigned char ReleaseDate;
+        unsigned char ROMSize;
+        unsigned long Characteristics;
+        unsigned char CharacteristicsExtensionBytes[2];
+        unsigned char SystemBIOSMajorRelease;
+        unsigned char SystemBIOSMinorRelease;
+        unsigned char EmbeddedControllerFirmwareMajorRelease;
+        unsigned char EmbeddedControllerFirmwareMinorRelease;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSSystemInformation
+    {
+        SMBIOSHeader Header;
+        unsigned char Manufacturer;
+        unsigned char ProductName;
+        unsigned char Version;
+        unsigned char SerialNumber;
+        unsigned char UUID[16];
+        unsigned char WakeUpType;
+        unsigned char SKU;
+        unsigned char Family;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSBaseBoardInformation
+    {
+        SMBIOSHeader Header;
+        unsigned char Manufacturer;
+        unsigned char Product;
+        unsigned char Version;
+        unsigned char SerialNumber;
+        unsigned char AssetTag;
+        unsigned char FeatureFlags;
+        unsigned char LocationInChassis;
+        unsigned short ChassisHandle;
+        unsigned char BoardType;
+        unsigned char NumberOfContainedObjectHandles;
+        unsigned short ContainedObjectHandles[0];
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSProcessorInformation
+    {
+        SMBIOSHeader Header;
+        unsigned char SocketDesignation;
+        unsigned char ProcessorType;
+        unsigned char ProcessorFamily;
+        unsigned char ProcessorManufacturer;
+        unsigned long ProcessorID;
+        unsigned char ProcessorVersion;
+        unsigned char Voltage;
+        unsigned short ExternalClock;
+        unsigned short MaxSpeed;
+        unsigned short CurrentSpeed;
+        unsigned char Status;
+        unsigned char ProcessorUpgrade;
+        unsigned short L1CacheHandle;
+        unsigned short L2CacheHandle;
+        unsigned short L3CacheHandle;
+        unsigned char SerialNumber;
+        unsigned char AssetTag;
+        unsigned char PartNumber;
+        unsigned char CoreCount;
+        unsigned char CoreEnabled;
+        unsigned char ThreadCount;
+        unsigned short ProcessorCharacteristics;
+        unsigned short ProcessorFamily2;
+        unsigned short CoreCount2;
+        unsigned short CoreEnabled2;
+        unsigned short ThreadCount2;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSMemoryDevice
+    {
+        SMBIOSHeader Header;
+        unsigned char PhysicalMemoryArrayHandle;
+        unsigned char MemoryErrorInformationHandle;
+        unsigned short TotalWidth;
+        unsigned short DataWidth;
+        unsigned short Size;
+        unsigned char FormFactor;
+        unsigned char DeviceSet;
+        unsigned char DeviceLocator;
+        unsigned char BankLocator;
+        unsigned char MemoryType;
+        unsigned short TypeDetail;
+        unsigned short Speed;
+        unsigned char Manufacturer;
+        unsigned char SerialNumber;
+        unsigned char AssetTag;
+        unsigned char PartNumber;
+        unsigned char Attributes;
+        unsigned short ExtendedSize;
+        unsigned short ConfiguredMemoryClockSpeed;
+        unsigned short MinimumVoltage;
+        unsigned short MaximumVoltage;
+        unsigned short ConfiguredVoltage;
+        unsigned char MemoryTechnology;
+        unsigned char OperatingModeCapability;
+        unsigned char FirmwareVersion;
+        unsigned char ModuleManufacturerID;
+        unsigned char ModuleProductID;
+        unsigned char MemorySubsystemControllerManufacturerID;
+        unsigned char MemorySubsystemControllerProductID;
+        unsigned short NonVolatileSize;
+        unsigned short VolatileSize;
+        unsigned short CacheSize;
+        unsigned short LogicalSize;
+        unsigned char ExtendedSpeed;
+        unsigned char ExtendedConfiguredMemorySpeed;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSMemoryArrayMappedAddress
+    {
+        SMBIOSHeader Header;
+        unsigned int StartingAddress;
+        unsigned int EndingAddress;
+        unsigned short MemoryArrayHandle;
+        unsigned char PartitionWidth;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSMemoryDeviceMappedAddress
+    {
+        SMBIOSHeader Header;
+        unsigned int StartingAddress;
+        unsigned int EndingAddress;
+        unsigned short MemoryDeviceHandle;
+        unsigned short MemoryArrayMappedAddressHandle;
+        unsigned char PartitionRowPosition;
+        unsigned char InterleavePosition;
+        unsigned char InterleavedDataDepth;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    struct SMBIOSMemoryArray
+    {
+        SMBIOSHeader Header;
+        unsigned char Location;
+        unsigned char Use;
+        unsigned char MemoryErrorCorrection;
+        unsigned int MaximumCapacity;
+        unsigned short MemoryErrorInformationHandle;
+        unsigned short NumberOfMemoryDevices;
+
+        const char *GetString(unsigned char Index)
+        {
+            char *Str = (char *)((unsigned long)this + this->Header.Length);
+            Index--;
+            if (Index == 0 || Index > 10)
+                return Str;
+            for (unsigned char i = 0; i < Index; i++)
+                Str = SMBIOSNextString(Str);
+            return Str;
+        }
+    };
+
+    bool CheckSMBIOS();
+    SMBIOSEntryPoint *GetSMBIOSEntryPoint();
+    void *GetSMBIOSHeader(SMBIOSType Type);
+    SMBIOSBIOSInformation *GetBIOSInformation();
+    SMBIOSSystemInformation *GetSystemInformation();
+    SMBIOSBaseBoardInformation *GetBaseBoardInformation();
+    SMBIOSProcessorInformation *GetProcessorInformation();
+    SMBIOSMemoryArray *GetMemoryArray();
+    SMBIOSMemoryDevice *GetMemoryDevice();
+    SMBIOSMemoryArrayMappedAddress *GetMemoryArrayMappedAddress();
+    SMBIOSMemoryDeviceMappedAddress *GetMemoryDeviceMappedAddress();
+}
+
+#endif // !__FENNIX_KERNEL_SMBIOS_H__
diff --git a/Kernel/Core/ubsan.h b/Kernel/Core/ubsan.h
new file mode 100644
index 00000000..cb3e622a
--- /dev/null
+++ b/Kernel/Core/ubsan.h
@@ -0,0 +1,111 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_UBSAN_H__
+#define __FENNIX_KERNEL_UBSAN_H__
+
+#include <types.h>
+
+struct source_location
+{
+    const char *file;
+    uint32_t line;
+    uint32_t column;
+};
+
+struct type_descriptor
+{
+    uint16_t kind;
+    uint16_t info;
+    char name[];
+};
+
+struct type_mismatch_v1_data
+{
+    struct source_location location;
+    struct type_descriptor *type;
+    uint8_t alignment;
+    uint8_t type_check_kind;
+};
+
+struct out_of_bounds_info
+{
+    struct source_location location;
+    struct type_descriptor left_type;
+    struct type_descriptor right_type;
+};
+
+struct overflow_data
+{
+    struct source_location location;
+    struct type_descriptor *type;
+};
+
+struct negative_vla_data
+{
+    struct source_location location;
+    struct type_descriptor *type;
+};
+
+struct invalid_value_data
+{
+    struct source_location location;
+    struct type_descriptor *type;
+};
+
+struct nonnull_return_data
+{
+    struct source_location location;
+};
+
+struct nonnull_arg_data
+{
+    struct source_location location;
+};
+
+struct unreachable_data
+{
+    struct source_location location;
+};
+
+struct invalid_builtin_data
+{
+    struct source_location location;
+    uint8_t kind;
+};
+
+struct array_out_of_bounds_data
+{
+    struct source_location location;
+    struct type_descriptor *array_type;
+    struct type_descriptor *index_type;
+};
+
+struct shift_out_of_bounds_data
+{
+    struct source_location location;
+    struct type_descriptor *left_type;
+    struct type_descriptor *right_type;
+};
+
+struct dynamic_type_cache_miss_data
+{
+    struct source_location location;
+    struct type_descriptor *type;
+};
+
+#endif // !__FENNIX_KERNEL_UBSAN_H__
diff --git a/Kernel/DAPI.hpp b/Kernel/DAPI.hpp
new file mode 100644
index 00000000..b218fc7c
--- /dev/null
+++ b/Kernel/DAPI.hpp
@@ -0,0 +1,431 @@
+/*
+   BSD 3-Clause License
+
+   Copyright (c) 2023, EnderIce2
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are met:
+
+   1. Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+   3. Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+   FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+   SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+   CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+   OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef __FENNIX_DRIVER_API_H__
+#define __FENNIX_DRIVER_API_H__
+
+/**
+ * @brief The driver API is a set of functions that the kernel provides to the drivers.
+ *
+ * - The driver is responsible for the memory management.
+ * - The kernel will NOT free any memory allocated by the driver. On @see StopReason the driver must free all the memory it allocated and disable the hardware it uses.
+ * - The driver image will be freed after the driver is unloaded.
+ * - The kernel will unbind the interrupt handlers and the process handlers.
+ * - Kernel API will be freed after the driver is unloaded.
+ *
+ */
+
+enum DriverReturnCode
+{
+    ERROR,
+    OK,
+    NOT_IMPLEMENTED,
+    NOT_FOUND,
+    NOT_READY,
+    NOT_AVAILABLE,
+    NOT_AUTHORIZED,
+    NOT_VALID,
+    NOT_ACCEPTED,
+    INVALID_PCI_BAR,
+    INVALID_KERNEL_API,
+    INVALID_MEMORY_ALLOCATION,
+    INVALID_DATA,
+    DEVICE_NOT_SUPPORTED,
+    SYSTEM_NOT_SUPPORTED,
+    KERNEL_API_VERSION_NOT_SUPPORTED,
+};
+
+enum DriverBindType
+{
+    BIND_NULL,
+    BIND_INTERRUPT,
+    BIND_PROCESS,
+    BIND_PCI,
+    BIND_INPUT
+};
+
+struct KernelAPI
+{
+    struct KAPIVersion
+    {
+        int Major;
+        int Minor;
+        int Patch;
+    } Version;
+
+    struct KAPIInfo
+    {
+        unsigned long Offset;
+        unsigned long DriverUID;
+        char KernelDebug;
+    } Info;
+
+    struct KAPIMemory
+    {
+        unsigned long PageSize;
+        void *(*RequestPage)(unsigned long Size);
+        void (*FreePage)(void *Page, unsigned long Size);
+        void (*Map)(void *VirtualAddress, void *PhysicalAddress, unsigned long Flags);
+        void (*Unmap)(void *VirtualAddress);
+    } Memory;
+
+    struct KAPIPCI
+    {
+        char *(*GetDeviceName)(unsigned int VendorID, unsigned int DeviceID);
+    } PCI;
+
+    struct KAPIUtilities
+    {
+        void (*DebugPrint)(char *String, unsigned long DriverUID);
+        void (*DisplayPrint)(char *Value);
+        void *(*memcpy)(void *Destination, void *Source, unsigned long Size);
+        void *(*memset)(void *Destination, int Value, unsigned long Size);
+        void (*Sleep)(unsigned long Milliseconds);
+        int (*sprintf)(char *Buffer, const char *Format, ...);
+    } Util;
+
+    struct KAPIDriverTalk
+    {
+        /** @brief Connects to the network manager */
+        struct
+        {
+            void (*SendPacket)(unsigned int DriverID, unsigned char *Data, unsigned short Size);
+            void (*ReceivePacket)(unsigned int DriverID, unsigned char *Data, unsigned short Size);
+        } Network;
+
+        /** @brief Connects to the disk manager */
+        struct
+        {
+            struct
+            {
+                void (*ReadSector)(unsigned int DriverID, unsigned long Sector, unsigned char *Data, unsigned int SectorCount, unsigned char Port);
+                void (*WriteSector)(unsigned int DriverID, unsigned long Sector, unsigned char *Data, unsigned int SectorCount, unsigned char Port);
+            } AHCI;
+        } Disk;
+    } Command;
+
+    struct KAPIDisplay
+    {
+        unsigned int (*GetWidth)(void);
+        unsigned int (*GetHeight)(void);
+        /* TODO: Add more */
+    } Display;
+} __attribute__((packed));
+
+enum CallbackReason
+{
+    /**
+     * @brief This is used to detect memory corruption, not used.
+     */
+    UnknownReason,
+
+    /**
+     * @brief This is called once the kernel is ready to use the driver and call @see ConfigurationReason .
+     */
+    AcknowledgeReason,
+
+    /**
+     * @brief This is used after the driver is loaded and the kernel is ready to use the driver.
+     *
+     * For PCI drivers, @see RawPtr will be the PCI device address.
+     */
+    ConfigurationReason,
+
+    /**
+     * @brief This is used when the kernel wants to stop the driver.
+     *
+     * The memory allocated by the driver will be freed automatically.
+     */
+    StopReason,
+
+    ProcessReason,
+    InputReason,
+
+    /* Kernel reserved callbacks. */
+    /* ------------------------------------------------------- */
+    /* Driver callbacks for basic usage. */
+
+    /**
+     * @brief This is used when the kernel sends data.
+     *
+     * - Network
+     *   - Packet
+     * - Audio
+     *   - PCM Data
+     */
+    SendReason,
+
+    /**
+     * @brief This is used when the kernel wants to receive data.
+     * Currently not used.
+     */
+    ReceiveReason,
+
+    /**
+     * @brief This is used to adjust driver settings.
+     *
+     * - Audio
+     *   - Volume
+     *   - PCM Encoding
+     */
+    AdjustReason,
+
+    /**
+     * @brief This is used when the kernel wants to fetch information about the driver.
+     *
+     * - Input
+     *   - Mouse
+     *     - Position
+     *     - Buttons
+     *   - Keyboard
+     *     - Key
+     */
+    FetchReason,
+};
+
+union KernelCallback
+{
+    struct
+    {
+        CallbackReason Reason;
+        void *RawPtr;
+        unsigned long RawData;
+
+        /** @brief When the kernel wants to send a packet. */
+        struct
+        {
+            struct
+            {
+                unsigned char *Data;
+                unsigned long Length;
+            } Send;
+
+            struct
+            {
+                char Name[128];
+                unsigned long MAC;
+            } Fetch;
+        } NetworkCallback;
+
+        /** @brief When the kernel wants to write to disk. */
+        struct
+        {
+            struct
+            {
+                unsigned long Sector;
+                unsigned long SectorCount;
+                unsigned char Port;
+                unsigned char *Buffer;
+                bool Write;
+            } RW;
+
+            struct
+            {
+                unsigned char Ports;
+                int BytesPerSector;
+            } Fetch;
+        } DiskCallback;
+
+        /** @brief When the kernel wants to get mouse position / keyboard key */
+        struct
+        {
+            struct
+            {
+                unsigned long X;
+                unsigned long Y;
+                unsigned long Z;
+                struct
+                {
+                    bool Left;
+                    bool Right;
+                    bool Middle;
+                } Buttons;
+            } Mouse;
+        } InputCallback;
+
+        struct
+        {
+            struct
+            {
+                bool _Volume;
+                bool _Encoding;
+                bool _SampleRate;
+                bool _Channels;
+
+                /**
+                 * @brief Adjust the volume.
+                 *
+                 * 0 - 100
+                 */
+                unsigned char Volume;
+
+                /**
+                 * @brief Adjust the encoding.
+                 *
+                 * 0 - None, use default
+                 *
+                 * 1 - Signed PCM 8-bit
+                 * 2 - Unsigned PCM 8-bit
+                 *
+                 * 3 - Signed PCM 16-bit Little Endian
+                 * 4 - Signed PCM 20-bit Little Endian
+                 * 5 - Signed PCM 24-bit Little Endian
+                 * 6 - Signed PCM 32-bit Little Endian
+                 *
+                 * 7 - Unsigned PCM 16-bit Little Endian
+                 * 8 - Unsigned PCM 20-bit Little Endian
+                 * 9 - Unsigned PCM 24-bit Little Endian
+                 * 10 - Unsigned PCM 32-bit Little Endian
+                 *
+                 * 11 - Signed PCM 16-bit Big Endian
+                 * 12 - Signed PCM 20-bit Big Endian
+                 * 13 - Signed PCM 24-bit Big Endian
+                 * 14 - Signed PCM 32-bit Big Endian
+                 *
+                 * 15 - Unsigned PCM 16-bit Big Endian
+                 * 16 - Unsigned PCM 20-bit Big Endian
+                 * 17 - Unsigned PCM 24-bit Big Endian
+                 * 18 - Unsigned PCM 32-bit Big Endian
+                 *
+                 * 19 - Float PCM 32-bit Little Endian
+                 * 20 - Float PCM 64-bit Little Endian
+                 *
+                 * 21 - Float PCM 32-bit Big Endian
+                 * 22 - Float PCM 64-bit Big Endian
+                 *
+                 * 23 - PCM A-law
+                 * 24 - PCM Mu-law
+                 *
+                 * ... - More
+                 */
+                unsigned short Encoding;
+
+                /**
+                 * @brief Adjust the sample rate.
+                 *
+                 * 0 - 8000 Hz
+                 * 1 - 11025 Hz
+                 * 2 - 16000 Hz
+                 * 3 - 22050 Hz
+                 * 4 - 32000 Hz
+                 * 5 - 44100 Hz
+                 * 6 - 48000 Hz
+                 * 7 - 88200 Hz
+                 * 8 - 96000 Hz
+                 */
+                unsigned char SampleRate;
+
+                /**
+                 * @brief Adjust the channels.
+                 *
+                 * 0 - Mono
+                 * 1 - Stereo
+                 */
+                unsigned char Channels;
+            } Adjust;
+
+            struct
+            {
+                unsigned char *Data;
+                unsigned long Length;
+            } Send;
+
+            struct
+            {
+                unsigned char Volume;
+                unsigned short Encoding;
+                unsigned char SampleRate;
+                unsigned char Channels;
+            } Fetch;
+        } AudioCallback;
+
+        struct
+        {
+            unsigned char Vector;
+        } InterruptInfo;
+    };
+    unsigned long raw;
+} __attribute__((packed));
+
+union CPURegisters
+{
+    struct
+    {
+#if defined(__x86_64__) || defined(__amd64__)
+        unsigned long r15;
+        unsigned long r14;
+        unsigned long r13;
+        unsigned long r12;
+        unsigned long r11;
+        unsigned long r10;
+        unsigned long r9;
+        unsigned long r8;
+
+        unsigned long rbp;
+        unsigned long rdi;
+        unsigned long rsi;
+        unsigned long rdx;
+        unsigned long rcx;
+        unsigned long rbx;
+        unsigned long rax;
+
+        unsigned long InterruptNumber;
+        unsigned long ErrorCode;
+        unsigned long rip;
+        unsigned long cs;
+        unsigned long rflags;
+        unsigned long rsp;
+        unsigned long ss;
+#elif defined(__i386__)
+        unsigned int ebp;
+        unsigned int edi;
+        unsigned int esi;
+        unsigned int edx;
+        unsigned int ecx;
+        unsigned int ebx;
+        unsigned int eax;
+
+        unsigned int InterruptNumber;
+        unsigned int ErrorCode;
+        unsigned int eip;
+        unsigned int cs;
+        unsigned int eflags;
+        unsigned int esp;
+        unsigned int ss;
+#else
+#warning "Unsupported architecture"
+#endif
+    };
+    unsigned long raw;
+} __attribute__((packed));
+
+#endif // !__FENNIX_DRIVER_API_H__
diff --git a/Kernel/Doxyfile b/Kernel/Doxyfile
new file mode 100644
index 00000000..a514614a
--- /dev/null
+++ b/Kernel/Doxyfile
@@ -0,0 +1,2659 @@
+# Doxyfile 1.9.1
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the configuration
+# file that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "Fennix Kernel"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 1.0.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          = "Opeating System from scratch made in C and C++"
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       =
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = YES
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# The OUTPUT_TEXT_DIRECTION tag is used to specify the direction in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all generated output in the proper direction.
+# Possible values are: None, LTR, RTL and Context.
+# The default value is: None.
+
+OUTPUT_TEXT_DIRECTION  = None
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       = "The $name class" \
+                         "The $name widget" \
+                         "The $name file" \
+                         is \
+                         provides \
+                         specifies \
+                         contains \
+                         represents \
+                         a \
+                         an \
+                         the
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line
+# such as
+# /***************
+# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
+# Javadoc-style will behave just like regular comments and it will not be
+# interpreted by doxygen.
+# The default value is: NO.
+
+JAVADOC_BANNER         = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# By default Python docstrings are displayed as preformatted text and doxygen's
+# special commands cannot be used. By setting PYTHON_DOCSTRING to NO the
+# doxygen's special commands can be used and the contents of the docstring
+# documentation blocks is shown as doxygen documentation.
+# The default value is: YES.
+
+PYTHON_DOCSTRING       = YES
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = YES
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines (in the resulting output). You can put ^^ in the value part of an
+# alias to insert a newline as if a physical newline was in the original file.
+# When you need a literal { or } or , in the value part of an alias you have to
+# escape them by means of a backslash (\), this can lead to conflicts with the
+# commands \{ and \} for these it is advised to use the version @{ and @} or use
+# a double escape (\\{ and \\})
+
+ALIASES                =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = YES
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
+# sources only. Doxygen will then generate output that is more tailored for that
+# language. For instance, namespaces will be presented as modules, types will be
+# separated into more groups, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_SLICE  = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
+# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice, VHDL,
+# Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files). For instance to make doxygen treat .inc files
+# as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen. When specifying no_extension you should add
+# * to the FILE_PATTERNS.
+#
+# Note see also the list of default file extension mappings.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See https://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 5.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 5
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = YES
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = YES
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+# The NUM_PROC_THREADS specifies the number threads doxygen is allowed to use
+# during processing. When set to 0 doxygen will based this on the number of
+# cores available in the system. You can set it explicitly to a value larger
+# than 0 to get more control over the balance between CPU load and processing
+# speed. At this moment only the input processing can be done using multiple
+# threads. Since this is still an experimental feature the default is set to 1,
+# which efficively disables parallel processing. Please report any issues you
+# encounter. Generating dot graphs in parallel is controlled by the
+# DOT_NUM_THREADS setting.
+# Minimum value: 0, maximum value: 32, default value: 1.
+
+NUM_PROC_THREADS       = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = YES
+
+# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
+# methods of a class will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIV_VIRTUAL   = YES
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = YES
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = YES
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = YES
+
+# If this flag is set to YES, the name of an unnamed parameter in a declaration
+# will be determined by the corresponding definition. By default unnamed
+# parameters remain unnamed in the output.
+# The default value is: YES.
+
+RESOLVE_UNNAMED_PARAMS = YES
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# declarations. If set to NO, these declarations will be included in the
+# documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# With the correct setting of option CASE_SENSE_NAMES doxygen will better be
+# able to match the capabilities of the underlying filesystem. In case the
+# filesystem is case sensitive (i.e. it supports files in the same directory
+# whose names only differ in casing), the option must be set to YES to properly
+# deal with such files in case they appear in the input. For filesystems that
+# are not case sensitive the option should be be set to NO to properly deal with
+# output files written for symbols that only differ in casing, such as for two
+# classes, one named CLASS and the other named Class, and to also support
+# references to files without having to specify the exact matching casing. On
+# Windows (including Cygwin) and MacOS, users should typically set this option
+# to NO, whereas on Linux or other Unix flavors it should typically be set to
+# YES.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = YES
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation. If
+# EXTRACT_ALL is set to YES then this flag will automatically be disabled.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered. If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS
+# then doxygen will continue running as if WARN_AS_ERROR tag is set to NO, but
+# at the end of the doxygen process doxygen will return with a non-zero status.
+# Possible values are: NO, YES and FAIL_ON_WARNINGS.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = Kernel tools/Doxygen_README.md
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see:
+# https://www.gnu.org/software/libiconv/) for the list of possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# Note the list of default checked file patterns might differ from the list of
+# default file extension mappings.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C comment),
+# *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd, *.vhdl,
+# *.ucf, *.qsf and *.ice.
+
+FILE_PATTERNS          = *.c \
+                         *.cc \
+                         *.cxx \
+                         *.cpp \
+                         *.c++ \
+                         *.java \
+                         *.ii \
+                         *.ixx \
+                         *.ipp \
+                         *.i++ \
+                         *.inl \
+                         *.idl \
+                         *.ddl \
+                         *.odl \
+                         *.h \
+                         *.hh \
+                         *.hxx \
+                         *.hpp \
+                         *.h++ \
+                         *.cs \
+                         *.d \
+                         *.php \
+                         *.php4 \
+                         *.php5 \
+                         *.phtml \
+                         *.inc \
+                         *.m \
+                         *.markdown \
+                         *.md \
+                         *.mm \
+                         *.dox \
+                         *.py \
+                         *.pyw \
+                         *.f90 \
+                         *.f95 \
+                         *.f03 \
+                         *.f08 \
+                         *.f18 \
+                         *.f \
+                         *.for \
+                         *.vhd \
+                         *.vhdl \
+                         *.ucf \
+                         *.qsf \
+                         *.ice \
+                         Makefile \
+                         *.asm \
+                         *.s
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                = .vscode .github
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       = *
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE = tools/Doxygen_README.md
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = YES
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = YES
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# entity all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = YES
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = YES
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see https://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see:
+# http://clang.llvm.org/) for more accurate parsing at the cost of reduced
+# performance. This can be particularly helpful with template rich C++ code for
+# which doxygen's built-in parser lacks the necessary type information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled and the CLANG_ADD_INC_PATHS tag is set to
+# YES then doxygen will add the directory of each input to the include path.
+# The default value is: YES.
+
+CLANG_ADD_INC_PATHS    = YES
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+# If clang assisted parsing is enabled you can provide the clang parser with the
+# path to the directory containing a file called compile_commands.json. This
+# file is the compilation database (see:
+# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) containing the
+# options used when the source files were built. This is equivalent to
+# specifying the -p option to a clang tool, such as clang-check. These options
+# will then be passed to the parser. Any options specified with CLANG_OPTIONS
+# will be added as well.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+
+CLANG_DATABASE_PATH    =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = doxygen-doc/kernel
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  = tools/doxygen-awesome.css tools/custom.css
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
+# documentation will contain a main index with vertical navigation menus that
+# are dynamically created via JavaScript. If disabled, the navigation index will
+# consists of multiple levels of tabs that are statically embedded in every HTML
+# page. Disable this option to support browsers that do not have JavaScript,
+# like the Qt help browser.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_MENUS     = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = YES
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see:
+# https://developer.apple.com/xcode/), introduced with OSX 10.5 (Leopard). To
+# create a documentation set, doxygen will generate a Makefile in the HTML
+# output directory. Running make will produce the docset in that directory and
+# running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
+# genXcode/_index.html for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = YES
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see:
+# https://www.microsoft.com/en-us/download/details.aspx?id=21138) on Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the main .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location (absolute path
+# including file name) of Qt's qhelpgenerator. If non-empty doxygen will try to
+# run qhelpgenerator on the generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = YES
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg
+# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
+# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
+# the HTML output. These images will generally look nicer at scaled resolutions.
+# Possible values are: png (the default) and svg (looks nicer but requires the
+# pdf2svg or inkscape tool).
+# The default value is: png.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FORMULA_FORMAT    = png
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANSPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands
+# to create new LaTeX commands to be used in formulas as building blocks. See
+# the section "Including formulas" for details.
+
+FORMULA_MACROFILE      =
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# https://www.mathjax.org) which uses client side JavaScript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from https://www.mathjax.org before deployment.
+# The default value is: https://cdn.jsdelivr.net/npm/mathjax@2.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = https://cdn.jsdelivr.net/npm/mathjax@2
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using JavaScript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/). See the section "External Indexing and Searching" for
+# details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when not enabling USE_PDFLATEX the default is latex when enabling
+# USE_PDFLATEX the default is pdflatex and when in the later case latex is
+# chosen this is overwritten by pdflatex. For specific output languages the
+# default can have been set differently, this depends on the implementation of
+# the output language.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         =
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# Note: This tag is used in the Makefile / make.bat.
+# See also: LATEX_MAKEINDEX_CMD for the part in the generated output file
+# (.tex).
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to
+# generate index for LaTeX. In case there is no backslash (\) as first character
+# it will be automatically added in the LaTeX code.
+# Note: This tag is used in the generated output file (.tex).
+# See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat.
+# The default value is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_MAKEINDEX_CMD    = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use the engine as
+# specified with LATEX_CMD_NAME to generate the PDF file directly from the LaTeX
+# files. Set this option to YES, to get a higher quality PDF documentation.
+#
+# See also section LATEX_CMD_NAME for selecting the engine.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+# The LATEX_EMOJI_DIRECTORY tag is used to specify the (relative or absolute)
+# path from which the emoji images will be read. If a relative path is entered,
+# it will be relative to the LATEX_OUTPUT directory. If left blank the
+# LATEX_OUTPUT directory will be used.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EMOJI_DIRECTORY  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# configuration file, i.e. a series of assignments. You only have to provide
+# replacements, missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's configuration file. A template extensions file can be
+# generated using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+# If the XML_NS_MEMB_FILE_SCOPE tag is set to YES, doxygen will include
+# namespace members in file scope as well, matching the HTML output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_NS_MEMB_FILE_SCOPE = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
+# the structure of the code including all documentation. Note that this feature
+# is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: NO.
+
+HAVE_DOT               = NO
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the DOT_UML_DETAILS tag is set to NO, doxygen will show attributes and
+# methods without types and arguments in the UML graphs. If the DOT_UML_DETAILS
+# tag is set to YES, doxygen will add type and arguments for attributes and
+# methods in the UML graphs. If the DOT_UML_DETAILS tag is set to NONE, doxygen
+# will not generate fields with class member information in the UML graphs. The
+# class diagrams will look similar to the default class diagrams but using UML
+# notation for the relationships.
+# Possible values are: NO, YES and NONE.
+# The default value is: NO.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+DOT_UML_DETAILS        = NO
+
+# The DOT_WRAP_THRESHOLD tag can be used to set the maximum number of characters
+# to display on a single line. If the actual line length exceeds this threshold
+# significantly it will wrapped across multiple lines. Some heuristics are apply
+# to avoid ugly line breaks.
+# Minimum value: 0, maximum value: 1000, default value: 17.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_WRAP_THRESHOLD     = 17
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, jpg, gif, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
+# configuration file for plantuml.
+
+PLANTUML_CFG_FILE      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate
+# files that are used to generate the various graphs.
+#
+# Note: This setting is not only used for dot files but also for msc and
+# plantuml temporary files.
+# The default value is: YES.
+
+DOT_CLEANUP            = YES
diff --git a/Kernel/Execute/Elf/BaseLoad.cpp b/Kernel/Execute/Elf/BaseLoad.cpp
new file mode 100644
index 00000000..ccdf640f
--- /dev/null
+++ b/Kernel/Execute/Elf/BaseLoad.cpp
@@ -0,0 +1,287 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <msexec.h>
+#include <cwalk.h>
+#include <elf.h>
+#include <abi.h>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+using namespace Tasking;
+using VirtualFileSystem::File;
+using VirtualFileSystem::FileStatus;
+using VirtualFileSystem::NodeFlags;
+
+namespace Execute
+{
+    struct InterpreterIPCDataLibrary
+    {
+        char Name[128];
+    };
+
+    typedef struct
+    {
+        char Path[256];
+        void *ElfFile;
+        void *MemoryImage;
+        struct InterpreterIPCDataLibrary Libraries[64];
+    } InterpreterIPCData;
+
+    /* Passing arguments as a sanity check and debugging. */
+    void ELFInterpreterIPCThread(PCB *Process, char *Path, void *MemoryImage, void *ElfFile, std::vector<const char *> NeededLibraries)
+    {
+        debug("Interpreter thread started for %s", Path);
+        // Interpreter will create an IPC with token "LOAD".
+        char UniqueToken[16] = {'L', 'O', 'A', 'D', '\0'};
+        InterProcessCommunication::IPCHandle *Handle = nullptr;
+        while (Handle == nullptr)
+        {
+            debug("Searching for IPC with token %s", UniqueToken);
+            Handle = Process->IPC->SearchByToken(UniqueToken);
+            if (Handle == nullptr)
+            {
+                debug("Failed");
+            }
+
+            TaskManager->Sleep(200);
+            if (Handle == nullptr)
+            {
+                debug("Retrying...");
+            }
+        }
+        debug("IPC found, sending data...");
+        InterpreterIPCData *TmpBuffer = new InterpreterIPCData;
+        strcpy(TmpBuffer->Path, Path);
+        TmpBuffer->ElfFile = ElfFile;
+        TmpBuffer->MemoryImage = MemoryImage;
+        if (NeededLibraries.size() > 256)
+            warn("Too many libraries! (max 256)");
+        for (size_t i = 0; i < NeededLibraries.size(); i++)
+        {
+            strcpy(TmpBuffer->Libraries[i].Name, NeededLibraries[i]);
+        }
+
+#ifdef DEBUG
+        debug("OUTSIDE DATA");
+        debug("Path: %s", Path);
+        debug("ElfFile: %p", ElfFile);
+        debug("MemoryImage: %p", MemoryImage);
+        for (size_t i = 0; i < NeededLibraries.size(); i++)
+        {
+            debug("Library: %s", NeededLibraries[i]);
+        }
+        debug("INSIDE DATA");
+        debug("Path: %s", TmpBuffer->Path);
+        debug("ElfFile: %p", TmpBuffer->ElfFile);
+        debug("MemoryImage: %p", TmpBuffer->MemoryImage);
+        for (size_t i = 0; i < NeededLibraries.size(); i++)
+        {
+            debug("Library: %s", TmpBuffer->Libraries[i].Name);
+        }
+#endif
+
+    RetryIPCWrite:
+        InterProcessCommunication::IPCErrorCode ret = Process->IPC->Write(Handle->ID, TmpBuffer, sizeof(InterpreterIPCData));
+        debug("Write returned %d", ret);
+        if (ret == InterProcessCommunication::IPCErrorCode::IPCNotListening)
+        {
+            debug("IPC not listening, retrying...");
+            TaskManager->Sleep(100);
+            goto RetryIPCWrite;
+        }
+        delete TmpBuffer;
+        /* Prevent race condition, maybe a
+           better idea is to watch when the
+           IPC is destroyed. */
+        TaskManager->Sleep(5000);
+        TEXIT(0);
+    }
+
+    PCB *InterpreterTargetProcess;
+    std::string *InterpreterTargetPath; /* We can't have String as a constructor :( */
+    void *InterpreterMemoryImage;
+    void *InterpreterElfFile;
+    std::vector<const char *> InterpreterNeededLibraries;
+    void ELFInterpreterThreadWrapper()
+    {
+        ELFInterpreterIPCThread(InterpreterTargetProcess, (char *)InterpreterTargetPath->c_str(), InterpreterMemoryImage, InterpreterElfFile, InterpreterNeededLibraries);
+        delete InterpreterTargetPath, InterpreterTargetPath = nullptr;
+    }
+
+    ELFBaseLoad ELFLoad(char *Path, const char **argv, const char **envp, Tasking::TaskCompatibility Compatibility)
+    {
+        /* We get the base name ("app.elf") */
+        const char *BaseName;
+        cwk_path_get_basename(Path, &BaseName, nullptr);
+        TaskArchitecture Arch = TaskArchitecture::UnknownArchitecture;
+
+        File ExFile = vfs->Open(Path);
+
+        if (ExFile.Status != FileStatus::OK)
+        {
+            vfs->Close(ExFile);
+            error("Failed to open file: %s", Path);
+            return {};
+        }
+        else
+        {
+            if (ExFile.node->Flags != NodeFlags::FILE)
+            {
+                vfs->Close(ExFile);
+                error("Invalid file path: %s", Path);
+                return {};
+            }
+            else if (GetBinaryType(Path) != BinaryType::BinTypeELF)
+            {
+                vfs->Close(ExFile);
+                error("Invalid file type: %s", Path);
+                return {};
+            }
+        }
+
+        size_t ExFileSize = ExFile.node->Length;
+
+        /* Allocate elf in memory */
+        void *ElfFile = KernelAllocator.RequestPages(TO_PAGES(ExFileSize + 1));
+        /* Copy the file to the allocated memory */
+        memcpy(ElfFile, (void *)ExFile.node->Address, ExFileSize);
+        debug("Image Size: %#lx - %#lx (length: %ld)", ElfFile, (uintptr_t)ElfFile + ExFileSize, ExFileSize);
+
+        Elf64_Ehdr *ELFHeader = (Elf64_Ehdr *)ElfFile;
+
+        switch (ELFHeader->e_machine)
+        {
+        case EM_386:
+            Arch = TaskArchitecture::x32;
+            break;
+        case EM_X86_64:
+            Arch = TaskArchitecture::x64;
+            break;
+        case EM_ARM:
+            Arch = TaskArchitecture::ARM32;
+            break;
+        case EM_AARCH64:
+            Arch = TaskArchitecture::ARM64;
+            break;
+        default:
+            break;
+        }
+
+        // TODO: This shouldn't be ignored
+        if (ELFHeader->e_ident[EI_CLASS] == ELFCLASS32)
+        {
+            if (ELFHeader->e_ident[EI_DATA] == ELFDATA2LSB)
+                fixme("ELF32 LSB");
+            else if (ELFHeader->e_ident[EI_DATA] == ELFDATA2MSB)
+                fixme("ELF32 MSB");
+            else
+                fixme("ELF32 Unknown");
+        }
+        else if (ELFHeader->e_ident[EI_CLASS] == ELFCLASS64)
+        {
+            if (ELFHeader->e_ident[EI_DATA] == ELFDATA2LSB)
+                fixme("ELF64 LSB");
+            else if (ELFHeader->e_ident[EI_DATA] == ELFDATA2MSB)
+                fixme("ELF64 MSB");
+            else
+                fixme("ELF64 Unknown");
+        }
+        else
+            fixme("Unknown ELF");
+
+        /* ------------------------------------------------------------------------------------------------------------------------------ */
+
+        PCB *Process = TaskManager->CreateProcess(TaskManager->GetCurrentProcess(), BaseName, TaskTrustLevel::User, ElfFile);
+        Memory::Virtual pV = Memory::Virtual(Process->PageTable);
+        for (size_t i = 0; i < TO_PAGES(ExFileSize); i++)
+            pV.Remap((void *)((uintptr_t)ElfFile + (i * PAGE_SIZE)), (void *)((uintptr_t)ElfFile + (i * PAGE_SIZE)), Memory::PTFlag::RW | Memory::PTFlag::US);
+
+        // for (size_t i = 0; i < TO_PAGES(ElfLazyResolverSize); i++)
+        // pV.Remap((void *)((uintptr_t)ElfLazyResolver + (i * PAGE_SIZE)), (void *)((uintptr_t)ElfLazyResolver + (i * PAGE_SIZE)), Memory::PTFlag::RW | Memory::PTFlag::US);
+
+        ELFBaseLoad bl;
+
+        switch (ELFHeader->e_type)
+        {
+        case ET_REL:
+            bl = ELFLoadRel(ElfFile, ExFile, Process);
+            break;
+        case ET_EXEC:
+            bl = ELFLoadExec(ElfFile, ExFile, Process);
+            break;
+        case ET_DYN:
+            bl = ELFLoadDyn(ElfFile, ExFile, Process);
+            break;
+        case ET_CORE:
+        {
+            fixme("ET_CORE not implemented");
+            TaskManager->RevertProcessCreation(Process);
+            vfs->Close(ExFile);
+            return {};
+        }
+        case ET_NONE:
+        default:
+        {
+            error("Unknown ELF Type: %d", ELFHeader->e_type);
+            vfs->Close(ExFile);
+            TaskManager->RevertProcessCreation(Process);
+            return {};
+        }
+        }
+
+        if (bl.Interpreter)
+        {
+            debug("ElfFile: %p ELFHeader: %p", ElfFile, ELFHeader);
+
+            InterpreterTargetProcess = Process;
+            InterpreterTargetPath = new std::string(Path); /* We store in a String because Path may get changed while outside ELFLoad(). */
+            InterpreterMemoryImage = bl.VirtualMemoryImage;
+            InterpreterElfFile = ElfFile;
+            InterpreterNeededLibraries = bl.NeededLibraries;
+            __sync;
+            TCB *InterpreterIPCThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (IP)ELFInterpreterThreadWrapper);
+            InterpreterIPCThread->Rename("ELF Interpreter IPC Thread");
+            InterpreterIPCThread->SetPriority(TaskPriority::Low);
+        }
+
+        TCB *Thread = TaskManager->CreateThread(Process,
+                                                bl.InstructionPointer,
+                                                argv, envp, bl.auxv,
+                                                (IPOffset)0 /* ProgramHeader->p_offset */, // I guess I don't need this
+                                                Arch,
+                                                Compatibility);
+
+        foreach (Memory::MemMgr::AllocatedPages p in bl.TmpMem->GetAllocatedPagesList())
+        {
+            Thread->Memory->Add(p.Address, p.PageCount);
+            bl.TmpMem->DetachAddress(p.Address);
+        }
+        delete bl.TmpMem, bl.TmpMem = nullptr;
+
+        bl.sd.Process = Process;
+        bl.sd.Thread = Thread;
+        bl.sd.Status = ExStatus::OK;
+        vfs->Close(ExFile);
+        return bl;
+    }
+}
diff --git a/Kernel/Execute/Elf/Dyn.cpp b/Kernel/Execute/Elf/Dyn.cpp
new file mode 100644
index 00000000..a7c35a1a
--- /dev/null
+++ b/Kernel/Execute/Elf/Dyn.cpp
@@ -0,0 +1,44 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <msexec.h>
+#include <cwalk.h>
+#include <elf.h>
+#include <abi.h>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+using namespace Tasking;
+
+namespace Execute
+{
+    ELFBaseLoad ELFLoadDyn(void *BaseImage,
+                           VirtualFileSystem::File &ExFile,
+                           Tasking::PCB *Process)
+    {
+        UNUSED(BaseImage);
+        UNUSED(ExFile);
+        UNUSED(Process);
+        fixme("Not implemented");
+        return {};
+    }
+}
diff --git a/Kernel/Execute/Elf/Exec.cpp b/Kernel/Execute/Elf/Exec.cpp
new file mode 100644
index 00000000..d9d8a9f0
--- /dev/null
+++ b/Kernel/Execute/Elf/Exec.cpp
@@ -0,0 +1,225 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <msexec.h>
+#include <cwalk.h>
+#include <elf.h>
+#include <abi.h>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+using namespace Tasking;
+
+namespace Execute
+{
+    ELFBaseLoad ELFLoadExec(void *ElfFile,
+                            VirtualFileSystem::File &ExFile,
+                            Tasking::PCB *Process)
+    {
+        debug("Executable");
+        ELFBaseLoad ELFBase = {};
+        /* This should be deleted inside BaseLoad.cpp */
+        ELFBase.TmpMem = new Memory::MemMgr(Process->PageTable);
+
+        Elf64_Ehdr *ELFHeader = (Elf64_Ehdr *)ElfFile;
+        Memory::Virtual pV(Process->PageTable);
+
+        uintptr_t BaseAddress = UINTPTR_MAX;
+        uint64_t ElfAppSize = 0;
+        uintptr_t EntryPoint = ELFHeader->e_entry;
+        debug("%s's entry point is %#lx", ExFile.Name, EntryPoint);
+
+        Elf64_Phdr ItrPhdr;
+
+        /* Get base address */
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)ElfFile + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            BaseAddress = MIN(BaseAddress, ItrPhdr.p_vaddr);
+        }
+
+        /* Get size */
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)ElfFile + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            uintptr_t SegmentEnd;
+            SegmentEnd = ItrPhdr.p_vaddr - BaseAddress + ItrPhdr.p_memsz;
+            ElfAppSize = MAX(ElfAppSize, SegmentEnd);
+        }
+        debug("BaseAddress: %#lx | ElfAppSize: %#lx (%ld, %ld KB)", BaseAddress, ElfAppSize, ElfAppSize, TO_KB(ElfAppSize));
+
+        /* If required, MemoryImage will be at virtual address. (unless has PIE)
+         *
+         * tl;dr this is where the code is stored. */
+        MmImage MemoryImage = ELFCreateMemoryImage(ELFBase.TmpMem, pV, ElfFile, ElfAppSize);
+
+        debug("Solving symbols for address: %#llx", (uintptr_t)ElfFile);
+        Elf64_Shdr *ElfSections = (Elf64_Shdr *)((uintptr_t)ElfFile + ELFHeader->e_shoff);
+        Elf64_Shdr *DynamicString = nullptr;
+        Elf64_Shdr *StringTable = nullptr;
+
+        for (Elf64_Half i = 0; i < ELFHeader->e_shnum; i++)
+        {
+            char *DynamicStringTable = (char *)((uintptr_t)ElfFile + ElfSections[ELFHeader->e_shstrndx].sh_offset + ElfSections[i].sh_name);
+
+            if (strcmp(DynamicStringTable, ".dynstr") == 0)
+            {
+                DynamicString = &ElfSections[i];
+                debug("Found .dynstr");
+            }
+            else if (strcmp(DynamicStringTable, ".strtab") == 0)
+            {
+                StringTable = &ElfSections[i];
+                debug("Found .strtab");
+            }
+        }
+
+        if (!DynamicString)
+            DynamicString = StringTable;
+
+        /* Calculate entry point */
+        memcpy(&ItrPhdr, (uint8_t *)ElfFile + ELFHeader->e_phoff, sizeof(Elf64_Phdr));
+        if (ItrPhdr.p_vaddr == 0)
+            EntryPoint += (uintptr_t)MemoryImage.Virtual;
+
+        char InterpreterPath[256];
+
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)ElfFile + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            switch (ItrPhdr.p_type)
+            {
+            case PT_NULL:
+                fixme("PT_NULL");
+                break;
+            case PT_LOAD:
+            {
+                debug("PT_LOAD - Offset: %#lx, VirtAddr: %#lx, FileSiz: %ld, MemSiz: %ld, Align: %#lx",
+                      ItrPhdr.p_offset, ItrPhdr.p_vaddr,
+                      ItrPhdr.p_filesz, ItrPhdr.p_memsz, ItrPhdr.p_align);
+                uintptr_t MAddr = (ItrPhdr.p_vaddr - BaseAddress) + (uintptr_t)MemoryImage.Phyiscal;
+                fixme("Address: %#lx %s%s%s", MAddr,
+                      (ItrPhdr.p_flags & PF_R) ? "R" : "",
+                      (ItrPhdr.p_flags & PF_W) ? "W" : "",
+                      (ItrPhdr.p_flags & PF_X) ? "X" : "");
+
+                memcpy((void *)MAddr, (uint8_t *)ElfFile + ItrPhdr.p_offset, ItrPhdr.p_filesz);
+                debug("memcpy: %#lx => %#lx (%ld bytes)", (uint8_t *)ElfFile + ItrPhdr.p_offset, MAddr, ItrPhdr.p_filesz);
+                break;
+            }
+            case PT_DYNAMIC:
+            {
+                debug("PT_DYNAMIC - Offset: %#lx VirtAddr: %#lx FileSiz: %ld MemSiz: %ld Align: %#lx",
+                      ItrPhdr.p_offset, ItrPhdr.p_vaddr,
+                      ItrPhdr.p_filesz, ItrPhdr.p_memsz, ItrPhdr.p_align);
+
+                Elf64_Dyn *Dynamic = (Elf64_Dyn *)((uint8_t *)ElfFile + ItrPhdr.p_offset);
+
+                for (size_t i = 0; i < ItrPhdr.p_filesz / sizeof(Elf64_Dyn); i++)
+                {
+                    if (Dynamic[i].d_tag == DT_NEEDED)
+                    {
+                        if (!DynamicString)
+                        {
+                            error("DynamicString is null");
+                            break;
+                        }
+
+                        const char *ReqLib = (const char *)((uintptr_t)ElfFile + DynamicString->sh_offset + Dynamic[i].d_un.d_val);
+                        debug("DT_NEEDED - Name[%ld]: %s", i, ReqLib);
+                        ELFBase.NeededLibraries.push_back(ReqLib);
+                    }
+                    else if (Dynamic[i].d_tag == DT_NULL)
+                        break;
+                }
+                break;
+            }
+            case PT_INTERP:
+            {
+                debug("PT_INTERP - Offset: %#lx VirtAddr: %#lx FileSiz: %ld MemSiz: %ld Align: %#lx",
+                      ItrPhdr.p_offset, ItrPhdr.p_vaddr,
+                      ItrPhdr.p_filesz, ItrPhdr.p_memsz, ItrPhdr.p_align);
+
+                memcpy((void *)InterpreterPath, (uint8_t *)ElfFile + ItrPhdr.p_offset, 256);
+                debug("Interpreter: %s", InterpreterPath);
+
+                VirtualFileSystem::File InterpreterFile = vfs->Open(InterpreterPath);
+                if (!InterpreterFile.IsOK())
+                    warn("Failed to open interpreter file: %s", InterpreterPath);
+
+                vfs->Close(InterpreterFile);
+                break;
+            }
+            /* ... */
+            case PT_PHDR:
+            {
+                debug("PT_PHDR - Offset: %#lx VirtAddr: %#lx FileSiz: %ld MemSiz: %ld Align: %#lx",
+                      ItrPhdr.p_offset, ItrPhdr.p_vaddr,
+                      ItrPhdr.p_filesz, ItrPhdr.p_memsz, ItrPhdr.p_align);
+                break;
+            }
+            default:
+            {
+                warn("Unknown or unsupported program header type: %d", ItrPhdr.p_type);
+                break;
+            }
+            }
+        }
+
+        if (strlen(InterpreterPath) > 1)
+        {
+            EntryPoint = LoadELFInterpreter(ELFBase.TmpMem, pV, InterpreterPath);
+            ELFBase.Interpreter = true;
+        }
+
+        debug("Entry Point: %#lx", EntryPoint);
+
+        char *aux_platform = (char *)ELFBase.TmpMem->RequestPages(1, true);
+        strcpy(aux_platform, "x86_64");
+
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_NULL, .a_un = {.a_val = 0}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_EXECFN, .a_un = {.a_val = (uint64_t)vfs->GetPathFromNode(ExFile.node).get()}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_PLATFORM, .a_un = {.a_val = (uint64_t)aux_platform}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_ENTRY, .a_un = {.a_val = (uint64_t)EntryPoint}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_BASE, .a_un = {.a_val = (uint64_t)MemoryImage.Virtual}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_PAGESZ, .a_un = {.a_val = (uint64_t)PAGE_SIZE}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_PHNUM, .a_un = {.a_val = (uint64_t)ELFHeader->e_phnum}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_PHENT, .a_un = {.a_val = (uint64_t)ELFHeader->e_phentsize}}});
+        ELFBase.auxv.push_back({.archaux = {.a_type = AT_PHDR, .a_un = {.a_val = (uint64_t)ELFHeader->e_phoff}}});
+
+        ELFBase.InstructionPointer = EntryPoint;
+        ELFBase.MemoryImage = MemoryImage.Phyiscal;
+        ELFBase.VirtualMemoryImage = MemoryImage.Virtual;
+
+        ELFBase.Success = true;
+        return ELFBase;
+    }
+}
diff --git a/Kernel/Execute/Elf/Parse.cpp b/Kernel/Execute/Elf/Parse.cpp
new file mode 100644
index 00000000..8973299e
--- /dev/null
+++ b/Kernel/Execute/Elf/Parse.cpp
@@ -0,0 +1,310 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <msexec.h>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+namespace Execute
+{
+    /* Originally from https://wiki.osdev.org/ELF_Tutorial */
+
+    Elf64_Shdr *GetELFSheader(Elf64_Ehdr *Header)
+    {
+        return (Elf64_Shdr *)((uintptr_t)Header + Header->e_shoff);
+    }
+
+    Elf64_Shdr *GetELFSection(Elf64_Ehdr *Header, uint64_t Index)
+    {
+        return &GetELFSheader(Header)[Index];
+    }
+
+    char *GetELFStringTable(Elf64_Ehdr *Header)
+    {
+        if (Header->e_shstrndx == SHN_UNDEF)
+            return nullptr;
+        return (char *)Header + GetELFSection(Header, Header->e_shstrndx)->sh_offset;
+    }
+
+    char *ELFLookupString(Elf64_Ehdr *Header, uintptr_t Offset)
+    {
+        char *StringTable = GetELFStringTable(Header);
+        if (StringTable == nullptr)
+            return nullptr;
+        return StringTable + Offset;
+    }
+
+    Elf64_Sym *ELFLookupSymbol(Elf64_Ehdr *Header, const char *Name)
+    {
+        Elf64_Shdr *SymbolTable = nullptr;
+        Elf64_Shdr *StringTable = nullptr;
+        Elf64_Sym *Symbol = nullptr;
+        char *String = nullptr;
+
+        for (Elf64_Half i = 0; i < Header->e_shnum; i++)
+        {
+            Elf64_Shdr *shdr = GetELFSection(Header, i);
+            switch (shdr->sh_type)
+            {
+            case SHT_SYMTAB:
+                SymbolTable = shdr;
+                StringTable = GetELFSection(Header, shdr->sh_link);
+                break;
+            default:
+            {
+                break;
+            }
+            }
+        }
+
+        if (SymbolTable == nullptr || StringTable == nullptr)
+            return nullptr;
+
+        for (size_t i = 0; i < (SymbolTable->sh_size / sizeof(Elf64_Sym)); i++)
+        {
+            Symbol = (Elf64_Sym *)((uintptr_t)Header + SymbolTable->sh_offset + (i * sizeof(Elf64_Sym)));
+            String = (char *)((uintptr_t)Header + StringTable->sh_offset + Symbol->st_name);
+            if (strcmp(String, Name) == 0)
+                return Symbol;
+        }
+        return nullptr;
+    }
+
+    uintptr_t ELFGetSymbolValue(Elf64_Ehdr *Header, uint64_t Table, uint64_t Index)
+    {
+        if (Table == SHN_UNDEF || Index == SHN_UNDEF)
+            return 0;
+        Elf64_Shdr *SymbolTable = GetELFSection(Header, Table);
+
+        uint64_t STEntries = SymbolTable->sh_size / SymbolTable->sh_entsize;
+        if (Index >= STEntries)
+        {
+            error("Symbol index out of range %d-%u.", Table, Index);
+            return 0xdead;
+        }
+
+        uint64_t SymbolAddress = (uint64_t)Header + SymbolTable->sh_offset;
+        Elf64_Sym *Symbol = &((Elf64_Sym *)SymbolAddress)[Index];
+
+        if (Symbol->st_shndx == SHN_UNDEF)
+        {
+            Elf64_Shdr *StringTable = GetELFSection(Header, SymbolTable->sh_link);
+            const char *Name = (const char *)Header + StringTable->sh_offset + Symbol->st_name;
+
+            void *Target = (void *)ELFLookupSymbol(Header, Name)->st_value;
+            if (Target == nullptr)
+            {
+                if (ELF64_ST_BIND(Symbol->st_info) & STB_WEAK)
+                    return 0;
+                else
+                {
+                    error("Undefined external symbol \"%s\".", Name);
+                    return 0xdead;
+                }
+            }
+            else
+                return (uintptr_t)Target;
+        }
+        else if (Symbol->st_shndx == SHN_ABS)
+            return Symbol->st_value;
+        else
+        {
+            Elf64_Shdr *Target = GetELFSection(Header, Symbol->st_shndx);
+            return (uintptr_t)Header + Symbol->st_value + Target->sh_offset;
+        }
+    }
+
+    Elf64_Dyn *ELFGetDynamicTag(void *ElfFile, enum DynamicArrayTags Tag)
+    {
+        Elf64_Ehdr *ELFHeader = (Elf64_Ehdr *)ElfFile;
+
+        Elf64_Phdr ItrPhdr;
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr, (uint8_t *)ElfFile + ELFHeader->e_phoff + ELFHeader->e_phentsize * i, sizeof(Elf64_Phdr));
+            if (ItrPhdr.p_type == PT_DYNAMIC)
+            {
+                Elf64_Dyn *Dynamic = (Elf64_Dyn *)((uint8_t *)ElfFile + ItrPhdr.p_offset);
+                for (size_t i = 0; i < ItrPhdr.p_filesz / sizeof(Elf64_Dyn); i++)
+                {
+                    if (Dynamic[i].d_tag == Tag)
+                    {
+                        debug("Found dynamic tag %d at %#lx [d_val: %#lx].", Tag, &Dynamic[i], Dynamic[i].d_un.d_val);
+                        return &Dynamic[i];
+                    }
+                    if (Dynamic[i].d_tag == DT_NULL)
+                    {
+                        debug("Reached end of dynamic tag list for tag %d.", Tag);
+                        return nullptr;
+                    }
+                }
+            }
+        }
+        debug("Dynamic tag %d not found.", Tag);
+        return nullptr;
+    }
+
+    MmImage ELFCreateMemoryImage(Memory::MemMgr *mem, Memory::Virtual &pV, void *ElfFile, size_t Length)
+    {
+        void *MemoryImage = nullptr;
+        Elf64_Ehdr *ELFHeader = (Elf64_Ehdr *)ElfFile;
+        bool IsPIC = ELFHeader->e_type == ET_DYN;
+        UNUSED(IsPIC);
+        debug("Elf %s PIC", IsPIC ? "is" : "is not");
+
+        /* TODO: Not sure what I am supposed to do with this.
+         * It is supposed to detect if it's PIC or not but I
+         * don't know if it's right. */
+        if (ELFGetDynamicTag(ElfFile, DT_TEXTREL))
+        {
+            fixme("Text relocation is not(?) tested yet!");
+            MemoryImage = (uint8_t *)mem->RequestPages(TO_PAGES(Length + 1), true);
+            memset(MemoryImage, 0, Length);
+            return {MemoryImage, 0x0};
+        }
+
+        Elf64_Phdr ItrPhdr;
+        uintptr_t FirstProgramHeaderVirtualAddress = 0x0;
+
+        bool FirstProgramHeader = false;
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)ElfFile + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            if (ItrPhdr.p_type == PT_LOAD && !FirstProgramHeader)
+            {
+                FirstProgramHeaderVirtualAddress = ItrPhdr.p_vaddr;
+                FirstProgramHeader = true;
+            }
+
+            if (ItrPhdr.p_type == PT_LOAD && ItrPhdr.p_vaddr == 0)
+            {
+                debug("p_vaddr is 0, allocating %ld pages for image (size: %#lx)", TO_PAGES(Length), Length);
+                MemoryImage = mem->RequestPages(TO_PAGES(Length), true);
+                debug("MemoryImage: %#lx-%#lx", MemoryImage, (uintptr_t)MemoryImage + Length);
+                memset(MemoryImage, 0, Length);
+                return {MemoryImage, (void *)FirstProgramHeaderVirtualAddress};
+            }
+        }
+
+        debug("Allocating %ld pages for image (size: %#lx)", TO_PAGES(Length), Length);
+        MemoryImage = mem->RequestPages(TO_PAGES(Length));
+        debug("MemoryImage: %#lx-%#lx", MemoryImage, (uintptr_t)MemoryImage + Length);
+        memset(MemoryImage, 0, Length);
+
+        if (FirstProgramHeaderVirtualAddress != 0)
+            FirstProgramHeaderVirtualAddress &= 0xFFFFFFFFFFFFF000;
+        else
+            FirstProgramHeaderVirtualAddress = (uintptr_t)MemoryImage;
+
+        for (size_t i = 0; i < TO_PAGES(Length); i++)
+        {
+            pV.Remap((void *)((uintptr_t)FirstProgramHeaderVirtualAddress + (i * PAGE_SIZE)), (void *)((uintptr_t)MemoryImage + (i * PAGE_SIZE)), Memory::PTFlag::RW | Memory::PTFlag::US);
+            debug("Remapped: %#lx -> %#lx", (uintptr_t)FirstProgramHeaderVirtualAddress + (i * PAGE_SIZE), (uintptr_t)MemoryImage + (i * PAGE_SIZE));
+        }
+        return {MemoryImage, (void *)FirstProgramHeaderVirtualAddress};
+    }
+
+    uintptr_t LoadELFInterpreter(Memory::MemMgr *mem, Memory::Virtual &pV, const char *Interpreter)
+    {
+        if (GetBinaryType((char *)Interpreter) != BinaryType::BinTypeELF)
+        {
+            error("Interpreter \"%s\" is not an ELF file.", Interpreter);
+            return 0;
+        }
+
+        /* No need to check if it's valid, the GetBinaryType() call above does that. */
+        VirtualFileSystem::File File = vfs->Open(Interpreter);
+
+        Elf64_Ehdr *ELFHeader = (Elf64_Ehdr *)File.node->Address;
+
+#ifdef DEBUG
+        const char *InterpreterType[6] = {
+            "ET_NONE",
+            "ET_REL",
+            "ET_EXEC",
+            "ET_DYN",
+            "ET_CORE",
+            "ET_LOPROC - ET_HIPROC"};
+        Elf64_Half IntType = ELFHeader->e_type;
+        if (IntType > 5)
+            IntType = 5;
+        debug("Interpreter type: %s - %#x", InterpreterType[IntType], ELFHeader->e_type);
+#endif
+
+        uintptr_t BaseAddress = UINTPTR_MAX;
+        uint64_t ElfAppSize = 0;
+
+        Elf64_Phdr ItrPhdr;
+
+        /* Get base address */
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)File.node->Address + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            BaseAddress = MIN(BaseAddress, ItrPhdr.p_vaddr);
+        }
+
+        /* Get size */
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)File.node->Address + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            uintptr_t SegmentEnd;
+            SegmentEnd = ItrPhdr.p_vaddr - BaseAddress + ItrPhdr.p_memsz;
+            ElfAppSize = MAX(ElfAppSize, SegmentEnd);
+        }
+
+        MmImage MemoryImage = ELFCreateMemoryImage(mem, pV, (void *)File.node->Address, ElfAppSize);
+
+        for (Elf64_Half i = 0; i < ELFHeader->e_phnum; i++)
+        {
+            memcpy(&ItrPhdr,
+                   (uint8_t *)File.node->Address + ELFHeader->e_phoff + ELFHeader->e_phentsize * i,
+                   sizeof(Elf64_Phdr));
+
+            if (ItrPhdr.p_type == PT_LOAD)
+            {
+                debug("PT_LOAD - Offset: %#lx, VirtAddr: %#lx, FileSiz: %ld, MemSiz: %ld, Align: %#lx",
+                      ItrPhdr.p_offset, ItrPhdr.p_vaddr,
+                      ItrPhdr.p_filesz, ItrPhdr.p_memsz, ItrPhdr.p_align);
+                uintptr_t MAddr = (ItrPhdr.p_vaddr - BaseAddress) + (uintptr_t)MemoryImage.Phyiscal;
+                fixme("Address: %#lx %s%s%s", MAddr,
+                      (ItrPhdr.p_flags & PF_R) ? "R" : "",
+                      (ItrPhdr.p_flags & PF_W) ? "W" : "",
+                      (ItrPhdr.p_flags & PF_X) ? "X" : "");
+
+                memcpy((void *)MAddr, (uint8_t *)File.node->Address + ItrPhdr.p_offset, ItrPhdr.p_filesz);
+                debug("memcpy: %#lx => %#lx (%ld bytes)", (uint8_t *)File.node->Address + ItrPhdr.p_offset, MAddr, ItrPhdr.p_filesz);
+            }
+        }
+
+        vfs->Close(File);
+        debug("Interpreter entry point: %#lx (%#lx + %#lx)", (uintptr_t)MemoryImage.Phyiscal + ELFHeader->e_entry,
+              (uintptr_t)MemoryImage.Phyiscal, ELFHeader->e_entry);
+        return (uintptr_t)MemoryImage.Phyiscal + ELFHeader->e_entry;
+    }
+}
diff --git a/Kernel/Execute/Elf/Rel.cpp b/Kernel/Execute/Elf/Rel.cpp
new file mode 100644
index 00000000..c341f7ae
--- /dev/null
+++ b/Kernel/Execute/Elf/Rel.cpp
@@ -0,0 +1,109 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <msexec.h>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+namespace Execute
+{
+    /* Originally from https://wiki.osdev.org/ELF_Tutorial */
+
+    ELFBaseLoad ELFLoadRel(void *BaseImage,
+                           VirtualFileSystem::File &ExFile,
+                           Tasking::PCB *Process)
+    {
+        UNUSED(ExFile);
+        debug("Relocatable");
+        /* TODO: I have to fully implement this, but for now I will leave it as it is now. */
+        warn("Relocatable ELF is not fully supported yet");
+        /* This should be deleted after with kfree */
+        ELFBaseLoad ELFBase = {};
+        /* This should be deleted inside BaseLoad.cpp */
+        ELFBase.TmpMem = new Memory::MemMgr(Process->PageTable);
+
+        Elf64_Shdr *shdr = GetELFSheader(((Elf64_Ehdr *)BaseImage));
+        for (Elf64_Half i = 0; i < ((Elf64_Ehdr *)BaseImage)->e_shnum; i++)
+        {
+            Elf64_Shdr *Section = &shdr[i];
+            if (Section->sh_type == SHT_NOBITS)
+            {
+                if (!Section->sh_size)
+                    continue;
+                if (Section->sh_flags & SHF_ALLOC)
+                {
+                    void *Buffer = KernelAllocator.RequestPages(TO_PAGES(Section->sh_size + 1));
+                    memset(Buffer, 0, Section->sh_size);
+
+                    Memory::Virtual(Process->PageTable).Map((void *)Buffer, (void *)Buffer, Section->sh_size, Memory::PTFlag::RW | Memory::PTFlag::US);
+
+                    Section->sh_offset = (uintptr_t)Buffer - (uintptr_t)BaseImage;
+                    debug("Section %ld", Section->sh_size);
+                }
+            }
+        }
+
+        for (Elf64_Half i = 0; i < ((Elf64_Ehdr *)BaseImage)->e_shnum; i++)
+        {
+            Elf64_Shdr *Section = &shdr[i];
+            if (Section->sh_type == SHT_REL)
+            {
+                for (size_t Index = 0; Index < Section->sh_size / Section->sh_entsize; Index++)
+                {
+                    Elf64_Rel *RelTable = &((Elf64_Rel *)((uintptr_t)BaseImage + Section->sh_offset))[Index];
+                    Elf64_Shdr *Target = GetELFSection(((Elf64_Ehdr *)BaseImage), Section->sh_info);
+
+                    uintptr_t *RelAddress = (uintptr_t *)(((uintptr_t)BaseImage + Target->sh_offset) + RelTable->r_offset);
+                    uint64_t SymbolValue = 0;
+
+                    if (ELF64_R_SYM(RelTable->r_info) != SHN_UNDEF)
+                    {
+                        SymbolValue = ELFGetSymbolValue(((Elf64_Ehdr *)BaseImage), Section->sh_link, ELF64_R_SYM(RelTable->r_info));
+                        if (SymbolValue == 0xdead)
+                        {
+                            delete ELFBase.TmpMem, ELFBase.TmpMem = nullptr;
+                            return {};
+                        }
+                    }
+
+                    switch (ELF64_R_TYPE(RelTable->r_info))
+                    {
+                    case R_386_NONE:
+                        break;
+                    case R_386_32:
+                        *RelAddress = DO_64_64(SymbolValue, *RelAddress);
+                        break;
+                    case R_386_PC32:
+                        *RelAddress = DO_64_PC32(SymbolValue, *RelAddress, (uintptr_t)RelAddress);
+                        break;
+                    default:
+                    {
+                        error("Unsupported relocation type: %d", ELF64_R_TYPE(RelTable->r_info));
+                        delete ELFBase.TmpMem, ELFBase.TmpMem = nullptr;
+                        return {};
+                    }
+                    }
+                    debug("Symbol value: %#lx", SymbolValue);
+                }
+            }
+        }
+        return ELFBase;
+    }
+}
diff --git a/Kernel/Execute/Elf/SharedObjects.cpp b/Kernel/Execute/Elf/SharedObjects.cpp
new file mode 100644
index 00000000..f6c096b5
--- /dev/null
+++ b/Kernel/Execute/Elf/SharedObjects.cpp
@@ -0,0 +1,256 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <msexec.h>
+#include <cwalk.h>
+#include <elf.h>
+#include <abi.h>
+
+#ifdef DEBUG
+#include <dumper.hpp>
+#endif
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+using namespace Tasking;
+
+NewLock(ExecuteServiceLock);
+
+namespace Execute
+{
+    Memory::MemMgr *mem = nullptr;
+    std::vector<SharedLibraries> Libs;
+
+    void StartExecuteService()
+    {
+        mem = new Memory::MemMgr;
+
+        while (true)
+        {
+            {
+                SmartLock(ExecuteServiceLock);
+                foreach (auto &Lib in Libs)
+                {
+                    if (Lib.RefCount > 0)
+                    {
+                        Lib.Timeout = TimeManager->CalculateTarget(10, Time::Units::Minutes);
+                        debug("Reset timeout for %s", Lib.Identifier);
+                        continue;
+                    }
+                    if (Lib.Timeout < TimeManager->GetCounter())
+                    {
+                        // TODO: Remove
+                        fixme("Removed library %s because of timeout", Lib.Identifier);
+                    }
+                    else
+                    {
+                        debug("Timeout for %s is %ld", Lib.Identifier, Lib.Timeout);
+                    }
+                }
+                debug("Waiting 10 seconds...");
+            }
+            TaskManager->Sleep(10000);
+        }
+    }
+
+    bool AddLibrary(char *Identifier, void *ElfImage, size_t Length, const Memory::Virtual &pV)
+    {
+        SmartLock(ExecuteServiceLock);
+        SharedLibraries sl;
+
+        foreach (auto lib in Libs)
+        {
+            if (strcmp(lib.Identifier, Identifier) == 0)
+            {
+                debug("Library %s already loaded", Identifier);
+                lib.RefCount++;
+                return true;
+            }
+        }
+
+        strcpy(sl.Identifier, Identifier);
+        sl.Timeout = TimeManager->CalculateTarget(10, Time::Units::Minutes);
+        sl.RefCount = 0;
+
+        void *LibFile = mem->RequestPages(TO_PAGES(Length + 1), true);
+        debug("LibFile: %#lx", LibFile);
+        memcpy(LibFile, (void *)ElfImage, Length);
+        Memory::Virtual().Map(LibFile, LibFile, Length, Memory::RW | Memory::US | Memory::G);
+
+        Memory::Virtual ncpV = pV;
+        sl.MemoryImage = r_cst(uint64_t, ELFCreateMemoryImage(mem, ncpV, LibFile, Length).Phyiscal);
+        debug("MemoryImage: %#lx", sl.MemoryImage);
+
+        {
+            uintptr_t BaseAddress = UINTPTR_MAX;
+            Elf64_Phdr ItrProgramHeader;
+
+            for (Elf64_Half i = 0; i < ((Elf64_Ehdr *)LibFile)->e_phnum; i++)
+            {
+                memcpy(&ItrProgramHeader, (uint8_t *)LibFile + ((Elf64_Ehdr *)LibFile)->e_phoff + ((Elf64_Ehdr *)LibFile)->e_phentsize * i, sizeof(Elf64_Phdr));
+                BaseAddress = MIN(BaseAddress, ItrProgramHeader.p_vaddr);
+            }
+
+            for (Elf64_Half i = 0; i < ((Elf64_Ehdr *)LibFile)->e_phnum; i++)
+            {
+                memcpy(&ItrProgramHeader, (uint8_t *)LibFile + ((Elf64_Ehdr *)LibFile)->e_phoff + ((Elf64_Ehdr *)LibFile)->e_phentsize * i, sizeof(Elf64_Phdr));
+                if (ItrProgramHeader.p_type != PT_LOAD)
+                    continue;
+
+                debug("PT_LOAD - Offset: %#lx, VirtAddr: %#lx, FileSiz: %ld, MemSiz: %ld, Align: %#lx",
+                      ItrProgramHeader.p_offset, ItrProgramHeader.p_vaddr,
+                      ItrProgramHeader.p_filesz, ItrProgramHeader.p_memsz, ItrProgramHeader.p_align);
+                uintptr_t MAddr = (ItrProgramHeader.p_vaddr - BaseAddress) + (uintptr_t)sl.MemoryImage;
+                fixme("Address: %#lx %s%s%s", MAddr,
+                      (ItrProgramHeader.p_flags & PF_R) ? "R" : "",
+                      (ItrProgramHeader.p_flags & PF_W) ? "W" : "",
+                      (ItrProgramHeader.p_flags & PF_X) ? "X" : "");
+
+                memcpy((void *)MAddr, (uint8_t *)LibFile + ItrProgramHeader.p_offset, ItrProgramHeader.p_filesz);
+                debug("memcpy: %#lx => %#lx (%ld bytes)", (uint8_t *)LibFile + ItrProgramHeader.p_offset, (uintptr_t)MAddr, ItrProgramHeader.p_filesz);
+                break;
+            }
+
+            struct Elf64_Dyn *JmpRel = ELFGetDynamicTag((void *)LibFile, DT_JMPREL);
+            struct Elf64_Dyn *SymTab = ELFGetDynamicTag((void *)LibFile, DT_SYMTAB);
+            struct Elf64_Dyn *StrTab = ELFGetDynamicTag((void *)LibFile, DT_STRTAB);
+
+            if (!JmpRel)
+            {
+                debug("No DT_JMPREL");
+            }
+
+            if (!SymTab)
+            {
+                debug("No DT_SYMTAB");
+            }
+
+            if (!StrTab)
+            {
+                debug("No DT_STRTAB");
+            }
+
+            if (JmpRel && SymTab && StrTab)
+            {
+                debug("JmpRel: %#lx, SymTab: %#lx, StrTab: %#lx", JmpRel->d_un.d_ptr, SymTab->d_un.d_ptr, StrTab->d_un.d_ptr);
+                Elf64_Rela *_JmpRel = (Elf64_Rela *)(sl.MemoryImage + (JmpRel->d_un.d_ptr - BaseAddress));
+                Elf64_Sym *_SymTab = (Elf64_Sym *)(sl.MemoryImage + (SymTab->d_un.d_ptr - BaseAddress));
+
+                char *_DynStr = (char *)(sl.MemoryImage + (StrTab->d_un.d_ptr - BaseAddress));
+
+                Elf64_Shdr *gotSection = nullptr;
+                for (Elf64_Half i = 0; i < ((Elf64_Ehdr *)LibFile)->e_shnum; i++)
+                {
+                    Elf64_Shdr *shdr = (Elf64_Shdr *)((uint8_t *)LibFile + ((Elf64_Ehdr *)LibFile)->e_shoff + i * sizeof(Elf64_Shdr));
+                    if (shdr->sh_type == SHT_PROGBITS && (shdr->sh_flags & SHF_WRITE) && (shdr->sh_flags & SHF_ALLOC))
+                    {
+                        gotSection = shdr;
+                        break;
+                    }
+                }
+
+                debug("LIB_DBG");
+
+                if (gotSection)
+                {
+                    Elf64_Xword numEntries = gotSection->sh_size / sizeof(Elf64_Addr);
+                    for (Elf64_Xword i = 0; i < numEntries - 3; i++)
+                    {
+                        Elf64_Rela *Rel = _JmpRel + i;
+                        Elf64_Addr *GOTEntry = (Elf64_Addr *)(Rel->r_offset + sl.MemoryImage);
+
+                        Elf64_Xword RelType = ELF64_R_TYPE(Rel->r_info);
+                        debug("r_offset: %#lx RelType: %d", Rel->r_offset, RelType);
+
+                        switch (RelType)
+                        {
+                        case R_X86_64_NONE:
+                            break;
+                        case R_X86_64_JUMP_SLOT:
+                        {
+                            Elf64_Xword SymIndex = ELF64_R_SYM(Rel->r_info);
+                            Elf64_Sym *Sym = _SymTab + SymIndex;
+
+                            if (Sym->st_name)
+                            {
+                                char *SymName = _DynStr + Sym->st_name;
+                                debug("SymName: %s", SymName);
+
+                                Elf64_Sym *LibSym = ELFLookupSymbol((Elf64_Ehdr *)LibFile, SymName);
+
+                                if (LibSym)
+                                {
+                                    *GOTEntry = (Elf64_Addr)(sl.MemoryImage + LibSym->st_value);
+                                    debug("GOT[%ld]: %#lx + %#lx = %#lx", i, sl.MemoryImage, LibSym->st_value, *GOTEntry);
+                                }
+                            }
+                            break;
+                        }
+                        default:
+                        {
+                            fixme("RelType %d not supported", RelType);
+                            break;
+                        }
+                        }
+
+                        debug("GOT[%ld](%#lx): %#lx", i, GOTEntry, *GOTEntry);
+                    }
+                }
+                else
+                {
+                    debug("GOT section not found");
+                }
+            }
+        }
+
+        sl.Address = r_cst(uint64_t, LibFile);
+        debug("Casted LibFile %#lx -> %#lx", LibFile, sl.Address);
+        sl.Length = Length;
+
+        debug("Library %s loaded at %#lx (full file: %#lx)", Identifier, sl.MemoryImage, LibFile);
+
+        Libs.push_back(sl);
+        return true;
+    }
+
+    void SearchLibrary(char *Identifier)
+    {
+        UNUSED(Identifier);
+        SmartLock(ExecuteServiceLock);
+    }
+
+    SharedLibraries GetLibrary(char *Identifier)
+    {
+        SmartLock(ExecuteServiceLock);
+        foreach (auto Lib in Libs)
+        {
+            if (strcmp(Lib.Identifier, Identifier) == 0)
+            {
+                Lib.RefCount++;
+                debug("Library %s found (%#lx %#lx)", Identifier, Lib.Address, Lib.MemoryImage);
+                return Lib;
+            }
+        }
+        // throw std::runtime_error("Library not found");
+        return SharedLibraries();
+    }
+}
diff --git a/Kernel/Execute/Fex/BaseLoad.cpp b/Kernel/Execute/Fex/BaseLoad.cpp
new file mode 100644
index 00000000..8c98fb2c
--- /dev/null
+++ b/Kernel/Execute/Fex/BaseLoad.cpp
@@ -0,0 +1,38 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <msexec.h>
+#include <cwalk.h>
+#include <elf.h>
+#include <abi.h>
+
+#include "../../kernel.h"
+#include "../../Fex.hpp"
+
+using namespace Tasking;
+
+namespace Execute
+{
+    void FEXLoad()
+    {
+        
+    }
+}
diff --git a/Kernel/Execute/Parse.cpp b/Kernel/Execute/Parse.cpp
new file mode 100644
index 00000000..00a126d7
--- /dev/null
+++ b/Kernel/Execute/Parse.cpp
@@ -0,0 +1,102 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <msexec.h>
+
+#include "../kernel.h"
+#include "../Fex.hpp"
+
+namespace Execute
+{
+    BinaryType GetBinaryType(void *Image)
+    {
+        Fex *FexHdr = (Fex *)Image;
+
+        /* Elf64_Ehdr and Elf32_Ehdr are very similar (Elf64_Half and
+           Elf32_Half are the same size type) so we can use directly Elf64_Ehdr. */
+        Elf64_Ehdr *ELFHeader = (Elf64_Ehdr *)Image;
+
+        IMAGE_DOS_HEADER *MZHeader = (IMAGE_DOS_HEADER *)Image;
+
+        /* Check Fex magic */
+        if (FexHdr->Magic[0] == 'F' && FexHdr->Magic[1] == 'E' && FexHdr->Magic[2] == 'X' && FexHdr->Magic[3] == '\0')
+        {
+            /* If the fex type is driver, we shouldn't return as Fex. */
+            if (FexHdr->Type == FexFormatType::FexFormatType_Executable)
+            {
+                debug("Image - Fex");
+                return BinaryType::BinTypeFex;
+            }
+            else if (FexHdr->Type == FexFormatType::FexFormatType_Driver)
+            {
+                debug("Fex Driver is not supposed to be executed.");
+            }
+        }
+        /* Check ELF magic. */
+        else if (ELFHeader->e_ident[EI_MAG0] == ELFMAG0 &&
+                 ELFHeader->e_ident[EI_MAG1] == ELFMAG1 &&
+                 ELFHeader->e_ident[EI_MAG2] == ELFMAG2 &&
+                 ELFHeader->e_ident[EI_MAG3] == ELFMAG3)
+        {
+            debug("Image - ELF");
+            return BinaryType::BinTypeELF;
+        }
+        /* Every Windows executable starts with MZ header. */
+        else if (MZHeader->e_magic == IMAGE_DOS_SIGNATURE)
+        {
+            IMAGE_NT_HEADERS *PEHeader = (IMAGE_NT_HEADERS *)(((char *)Image) + MZHeader->e_lfanew);
+            IMAGE_OS2_HEADER *NEHeader = (IMAGE_OS2_HEADER *)(((char *)Image) + MZHeader->e_lfanew);
+
+            /* TODO: LE, EDOS */
+            if (PEHeader->Signature == IMAGE_NT_SIGNATURE)
+            {
+                debug("Image - PE");
+                return BinaryType::BinTypePE;
+            }
+            else if (NEHeader->ne_magic == IMAGE_OS2_SIGNATURE)
+            {
+                debug("Image - NE");
+                return BinaryType::BinTypeNE;
+            }
+            else
+            {
+                debug("Image - MZ");
+                return BinaryType::BinTypeMZ;
+            }
+        }
+
+        /* ... */
+        return BinaryType::BinTypeUnknown;
+    }
+
+    BinaryType GetBinaryType(char *Path)
+    {
+        BinaryType Type = BinaryType::BinTypeInvalid;
+        VirtualFileSystem::File ExFile = vfs->Open(Path);
+
+        if (ExFile.IsOK())
+        {
+            debug("File opened: %s", Path);
+            Type = GetBinaryType((void *)ExFile.node->Address);
+        }
+
+        vfs->Close(ExFile);
+        return Type;
+    }
+}
diff --git a/Kernel/Execute/Spawn.cpp b/Kernel/Execute/Spawn.cpp
new file mode 100644
index 00000000..fcd56177
--- /dev/null
+++ b/Kernel/Execute/Spawn.cpp
@@ -0,0 +1,109 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <exec.hpp>
+
+#include <memory.hpp>
+#include <lock.hpp>
+#include <msexec.h>
+#include <cwalk.h>
+#include <elf.h>
+#include <abi.h>
+
+#include "../kernel.h"
+#include "../Fex.hpp"
+
+using namespace Tasking;
+
+namespace Execute
+{
+    SpawnData Spawn(char *Path, const char **argv, const char **envp)
+    {
+        SpawnData ret = {.Status = ExStatus::Unknown,
+                         .Process = nullptr,
+                         .Thread = nullptr};
+
+        VirtualFileSystem::File ExFile = vfs->Open(Path);
+
+        if (ExFile.IsOK())
+        {
+            if (ExFile.node->Flags != VirtualFileSystem::NodeFlags::FILE)
+            {
+                ret.Status = ExStatus::InvalidFilePath;
+                goto Exit;
+            }
+
+            switch (GetBinaryType(Path))
+            {
+            case BinaryType::BinTypeFex:
+            {
+                Fex *FexHdr = (Fex *)ExFile.node->Address;
+                if (FexHdr->Type == FexFormatType::FexFormatType_Executable)
+                {
+                    const char *BaseName;
+                    cwk_path_get_basename(Path, &BaseName, nullptr);
+                    PCB *Process = TaskManager->CreateProcess(TaskManager->GetCurrentProcess(), BaseName, TaskTrustLevel::User);
+
+                    void *BaseImage = KernelAllocator.RequestPages(TO_PAGES(ExFile.node->Length + 1));
+                    memcpy(BaseImage, (void *)ExFile.node->Address, ExFile.node->Length);
+
+                    Memory::Virtual(Process->PageTable).Map((void *)BaseImage, (void *)BaseImage, ExFile.node->Length, Memory::PTFlag::RW | Memory::PTFlag::US);
+
+                    std::vector<AuxiliaryVector> auxv; // TODO!
+
+                    TCB *Thread = TaskManager->CreateThread(Process,
+                                                            (IP)FexHdr->EntryPoint,
+                                                            argv, envp, auxv,
+                                                            (IPOffset)BaseImage,
+                                                            TaskArchitecture::x64,
+                                                            TaskCompatibility::Native);
+                    ret.Process = Process;
+                    ret.Thread = Thread;
+                    ret.Status = ExStatus::OK;
+                }
+
+                ret.Status = ExStatus::InvalidFileHeader;
+                goto Exit;
+            }
+            case BinaryType::BinTypeELF:
+            {
+                ELFBaseLoad bl = ELFLoad(Path, argv, envp);
+                if (!bl.Success)
+                {
+                    ret.Status = ExStatus::GenericError;
+                    goto Exit;
+                }
+                ret = bl.sd;
+                goto Exit;
+            }
+            default:
+            {
+                ret.Status = ExStatus::Unsupported;
+                goto Exit;
+            }
+            }
+        }
+        else if (ExFile.Status == VirtualFileSystem::FileStatus::NotFound)
+            ret.Status = ExStatus::InvalidFilePath;
+        else
+            ret.Status = ExStatus::InvalidFile;
+
+    Exit:
+        vfs->Close(ExFile);
+        return ret;
+    }
+}
diff --git a/Kernel/Fex.hpp b/Kernel/Fex.hpp
new file mode 100644
index 00000000..cf0c58e3
--- /dev/null
+++ b/Kernel/Fex.hpp
@@ -0,0 +1,161 @@
+/*
+   BSD 3-Clause License
+
+   Copyright (c) 2023, EnderIce2
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are met:
+
+   1. Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+   3. Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+   FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+   SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+   CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+   OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef __FENNIX_FILE_FEX_H__
+#define __FENNIX_FILE_FEX_H__
+
+// TODO: EXPERIMENTAL
+
+/**
+ * @brief Fex file format (not finalized)
+ *
+ * @note Instead of HEAD, we can include everything in linker script like this:
+ * @example .header : { BYTE(0x46) BYTE(0x45) BYTE(0x58) BYTE(0x0) } for 'F' 'E' 'X' '\0'
+ *
+ */
+
+/** @brief This may change */
+#define EXTENDED_SECTION_ADDRESS 0x20
+
+enum FexFormatType
+{
+    FexFormatType_Unknown,
+    FexFormatType_Executable,
+    FexFormatType_Driver
+    /* ... */
+};
+
+enum FexOSType
+{
+    FexOSType_Unknown,
+    FexOSType_Fennix,
+    FexOSType_Linux
+    /* ... */
+};
+
+enum FexDriverType
+{
+    FexDriverType_Unknown,
+    FexDriverType_Generic,
+    FexDriverType_Display,
+    FexDriverType_Network,
+    FexDriverType_Storage,
+    FexDriverType_FileSystem,
+    FexDriverType_Input,
+    FexDriverType_Audio,
+    FexDriverType_ACPI,
+    /* ... */
+};
+
+enum FexDriverInputTypes
+{
+    FexDriverInputTypes_None = 0b00000000,
+    FexDriverInputTypes_Mouse = 0b00000001,
+    FexDriverInputTypes_Keyboard = 0b00000010,
+    /* ... */
+};
+
+struct Fex
+{
+    char Magic[4];
+    enum FexFormatType Type : 4;
+    enum FexOSType OS : 4;
+    int (*EntryPoint)(void *);
+} __attribute__((packed));
+
+union KernelCallback;
+union CPURegisters;
+
+struct FexExtended
+{
+    struct
+    {
+
+    } Executable;
+
+    struct
+    {
+        char Name[64];
+        enum FexDriverType Type : 4;
+        enum FexDriverInputTypes TypeFlags : 4;
+        char OverrideOnConflict : 1;
+        int (*Callback)(union KernelCallback *);
+        int (*InterruptCallback)(union CPURegisters *);
+
+        struct DriverBind
+        {
+            int Type;
+            struct
+            {
+                unsigned char Vector[16];
+            } Interrupt;
+
+            struct
+            {
+                unsigned int ProcessId[16];
+            } Process;
+
+            struct
+            {
+                unsigned short VendorID[16];
+                unsigned short DeviceID[16];
+                unsigned short Class;
+                unsigned short SubClass;
+                unsigned short ProgIF;
+            } PCI;
+
+            struct
+            {
+                char AttachToMouse;
+                char AttachToKeyboard;
+            } Input;
+        } Bind;
+    } Driver;
+} __attribute__((packed));
+
+/**
+ * @brief Add file header
+ *
+ * @param FormatType FexFormatType
+ * @param OperatingSystem FexOSType
+ * @param Address EntryPoint to the start function
+ *
+ * @note Must include ".header : { *(.header .header.*) }" in linker script
+ */
+#define HEAD(FormatType, OperatingSystem, Address)               \
+    __attribute__((section(".header"))) struct Fex FexHeader = { \
+        .Magic = {'F', 'E', 'X', '\0'},                          \
+        .Type = FormatType,                                      \
+        .OS = OperatingSystem,                                   \
+        .EntryPoint = Address}
+
+#endif // !__FENNIX_FILE_FEX_H__
diff --git a/Kernel/FileSystem/FS/ustar.cpp b/Kernel/FileSystem/FS/ustar.cpp
new file mode 100644
index 00000000..6b89fb6e
--- /dev/null
+++ b/Kernel/FileSystem/FS/ustar.cpp
@@ -0,0 +1,137 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <filesystem/ustar.hpp>
+
+#include <memory.hpp>
+#include <debug.h>
+
+#include "../../kernel.h"
+
+namespace VirtualFileSystem
+{
+    ReadFSFunction(USTAR_Read)
+    {
+        if (!Size)
+            Size = node->Length;
+        if (Offset > node->Length)
+            return 0;
+        if (Offset + Size > node->Length)
+            Size = node->Length - Offset;
+        memcpy(Buffer, (uint8_t *)(node->Address + Offset), Size);
+        return Size;
+    }
+
+    FileSystemOperations ustar_op = {
+        .Name = "ustar",
+        .Read = USTAR_Read,
+    };
+
+    USTAR::USTAR(uintptr_t Address, Virtual *vfs_ctx)
+    {
+        trace("Initializing USTAR with address %#llx", Address);
+
+        if (memcmp(((FileHeader *)(uintptr_t)Address)->signature, "ustar", 5) != 0)
+        {
+            error("ustar signature invalid!");
+            return;
+        }
+        debug("USTAR signature valid! Name:%s Signature:%s Mode:%c Size:%lu",
+              ((FileHeader *)Address)->name,
+              ((FileHeader *)Address)->signature,
+              string2int(((FileHeader *)Address)->mode),
+              ((FileHeader *)Address)->size);
+
+        vfs_ctx->CreateRoot("/", &ustar_op);
+
+        for (size_t i = 0;; i++)
+        {
+            FileHeader *header = (FileHeader *)Address;
+            if (memcmp(((FileHeader *)Address)->signature, "ustar", 5) != 0)
+                break;
+            memmove(header->name, header->name + 1, strlen(header->name));
+            if (header->name[strlen(header->name) - 1] == '/')
+                header->name[strlen(header->name) - 1] = 0;
+            size_t size = getsize(header->size);
+            Node *node = nullptr;
+
+            // if (!isempty((char *)header->name))
+            //     KPrint("Adding file \e88AACC%s\eCCCCCC (\e88AACC%lu \eCCCCCCbytes)", header->name, size);
+            // else
+            //     goto NextFileAddress;
+
+            if (isempty((char *)header->name))
+                goto NextFileAddress;
+
+            node = vfs_ctx->Create(header->name, NodeFlags::NODE_FLAG_ERROR);
+            debug("Added node: %s", node->Name);
+            if (node == nullptr)
+            {
+                static int ErrorsAllowed = 20;
+
+                if (ErrorsAllowed > 0)
+                {
+                    ErrorsAllowed--;
+                    goto NextFileAddress;
+                }
+                else
+                {
+                    error("Adding USTAR files failed because too many files were corrupted or invalid.");
+                    break;
+                }
+            }
+            else
+            {
+                trace("%s %dKB Type:%c", header->name, TO_KB(size), header->typeflag[0]);
+                node->Mode = string2int(header->mode);
+                node->Address = (Address + 512);
+                node->Length = size;
+                node->GroupIdentifier = getsize(header->gid);
+                node->UserIdentifier = getsize(header->uid);
+                node->IndexNode = i;
+
+                switch (header->typeflag[0])
+                {
+                case REGULAR_FILE:
+                    node->Flags = NodeFlags::FILE;
+                    break;
+                case SYMLINK:
+                    node->Flags = NodeFlags::SYMLINK;
+                    break;
+                case DIRECTORY:
+                    node->Flags = NodeFlags::DIRECTORY;
+                    break;
+                case CHARDEV:
+                    node->Flags = NodeFlags::CHARDEVICE;
+                    break;
+                case BLOCKDEV:
+                    node->Flags = NodeFlags::BLOCKDEVICE;
+                    break;
+                default:
+                    warn("Unknown type: %d", header->typeflag[0]);
+                    break;
+                }
+            NextFileAddress:
+                Address += ((size / 512) + 1) * 512;
+                if (size % 512)
+                    Address += 512;
+            }
+        }
+    }
+
+    USTAR::~USTAR() { warn("Destroyed"); }
+}
diff --git a/Kernel/FileSystem/Filesystem.cpp b/Kernel/FileSystem/Filesystem.cpp
new file mode 100644
index 00000000..335112e2
--- /dev/null
+++ b/Kernel/FileSystem/Filesystem.cpp
@@ -0,0 +1,644 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <filesystem.hpp>
+
+#include <smart_ptr.hpp>
+#include <convert.h>
+#include <printf.h>
+#include <lock.hpp>
+#include <cwalk.h>
+
+#include "../kernel.h"
+
+// show debug messages
+// #define DEBUG_FILESYSTEM 1
+
+#ifdef DEBUG_FILESYSTEM
+#define vfsdbg(m, ...) debug(m, ##__VA_ARGS__)
+#else
+#define vfsdbg(m, ...)
+#endif
+
+NewLock(VFSLock);
+
+namespace VirtualFileSystem
+{
+    std::shared_ptr<char> Virtual::GetPathFromNode(Node *node)
+    {
+        vfsdbg("GetPathFromNode( Node: \"%s\" )", node->Name);
+        Node *Parent = node;
+        char **Path = nullptr;
+        size_t Size = 1;
+        size_t PathSize = 0;
+
+        // Traverse the filesystem tree and build the path by adding each parent's Name field to the Path array
+        while (Parent != FileSystemRoot && Parent != nullptr)
+        {
+            bool Found = false;
+            foreach (const auto &Children in FileSystemRoot->Children)
+                if (Children == Parent)
+                {
+                    Found = true;
+                    break;
+                }
+
+            if (Found)
+                break;
+
+            if (strlen(Parent->Name) == 0)
+                break;
+
+            char **new_path = new char *[PathSize + 1];
+            if (Path != nullptr)
+            {
+                memcpy(new_path, Path, sizeof(char *) * PathSize);
+                delete[] Path;
+            }
+
+            Path = new_path;
+            Path[PathSize] = Parent->Name;
+            PathSize++;
+            new_path = new char *[PathSize + 1];
+            memcpy(new_path, Path, sizeof(char *) * PathSize);
+            delete[] Path;
+            Path = new_path;
+            Path[PathSize] = (char *)"/";
+            PathSize++;
+            Parent = Parent->Parent;
+        }
+
+        // Calculate the total size of the final path string
+        for (size_t i = 0; i < PathSize; i++)
+        {
+            Size += strlen(Path[i]);
+        }
+
+        // Allocate a new string for the final path
+        std::shared_ptr<char> FinalPath;
+        FinalPath.reset(new char[Size]);
+
+        size_t Offset = 0;
+
+        // Concatenate the elements of the Path array into the FinalPath string
+        for (size_t i = PathSize - 1; i < PathSize; i--)
+        {
+            if (Path[i] == nullptr)
+            {
+                continue;
+            }
+            size_t ElementSize = strlen(Path[i]);
+            memcpy(FinalPath.get() + Offset, Path[i], ElementSize);
+            Offset += ElementSize;
+        }
+
+        // Add a null terminator to the final path string
+        FinalPath.get()[Size - 1] = '\0';
+
+        // Deallocate the Path array
+        delete[] Path, Path = nullptr;
+
+        vfsdbg("GetPathFromNode()->\"%s\"", FinalPath.get());
+        return FinalPath;
+    }
+
+    Node *Virtual::GetNodeFromPath(const char *Path, Node *Parent)
+    {
+        vfsdbg("GetNodeFromPath( Path: \"%s\" Parent: \"%s\" )", Path, Parent ? Parent->Name : "(null)");
+
+        Node *ReturnNode = Parent;
+        bool IsAbsolutePath = cwk_path_is_absolute(Path);
+
+        if (!ReturnNode)
+            ReturnNode = FileSystemRoot->Children[0]; // 0 - filesystem root
+
+        if (IsAbsolutePath)
+            ReturnNode = FileSystemRoot->Children[0]; // 0 - filesystem root
+
+        cwk_segment segment;
+        if (unlikely(!cwk_path_get_first_segment(Path, &segment)))
+        {
+            error("Path doesn't have any segments.");
+            return nullptr;
+        }
+
+        do
+        {
+            char *SegmentName = new char[segment.end - segment.begin + 1];
+            memcpy(SegmentName, segment.begin, segment.end - segment.begin);
+            vfsdbg("GetNodeFromPath()->SegmentName: \"%s\"", SegmentName);
+        GetNodeFromPathNextParent:
+            foreach (auto Child in ReturnNode->Children)
+            {
+                vfsdbg("comparing \"%s\" with \"%s\"", Child->Name, SegmentName);
+                if (strcmp(Child->Name, SegmentName) == 0)
+                {
+                    ReturnNode = Child;
+                    goto GetNodeFromPathNextParent;
+                }
+            }
+            delete[] SegmentName;
+        } while (cwk_path_get_next_segment(&segment));
+
+        const char *basename;
+        cwk_path_get_basename(Path, &basename, nullptr);
+        vfsdbg("BaseName: \"%s\" NodeName: \"%s\"", basename, ReturnNode->Name);
+
+        if (strcmp(basename, ReturnNode->Name) == 0)
+        {
+            vfsdbg("GetNodeFromPath()->\"%s\"", ReturnNode->Name);
+            return ReturnNode;
+        }
+
+        vfsdbg("GetNodeFromPath()->\"(null)\"");
+        return nullptr;
+    }
+
+    File Virtual::ConvertNodeToFILE(Node *node)
+    {
+        File file{};
+        file.Status = FileStatus::OK;
+        file.node = node;
+        return file;
+    }
+
+    Node *Virtual::GetParent(const char *Path, Node *Parent)
+    {
+        vfsdbg("GetParent( Path: \"%s\" Parent: \"%s\" )", Path, Parent->Name);
+        if (Parent)
+        {
+            vfsdbg("GetParent()->\"%s\"", Parent->Name);
+            return Parent;
+        }
+
+        Node *ParentNode = nullptr;
+        if (FileSystemRoot->Children.size() >= 1)
+        {
+            assert(FileSystemRoot->Children[0] != nullptr);
+            ParentNode = FileSystemRoot->Children[0]; // 0 - filesystem root
+        }
+        else
+        {
+            // TODO: Check if here is a bug or something...
+            const char *PathCopy;
+            PathCopy = (char *)Path;
+            size_t length;
+            cwk_path_get_root(PathCopy, &length); // not working?
+            if (length > 0)
+            {
+                foreach (auto Child in FileSystemRoot->Children)
+                {
+                    if (strcmp(Child->Name, PathCopy) == 0)
+                    {
+                        ParentNode = Child;
+                        break;
+                    }
+                }
+            }
+        }
+        vfsdbg("GetParent()->\"%s\"", ParentNode->Name);
+        return ParentNode;
+    }
+
+    Node *Virtual::AddNewChild(const char *Name, Node *Parent)
+    {
+        if (!Parent)
+        {
+            error("Parent is null!");
+            return nullptr;
+        }
+        vfsdbg("AddNewChild( Name: \"%s\" Parent: \"%s\" )", Name, Parent->Name);
+
+        Node *newNode = new Node;
+        newNode->Parent = Parent;
+        strcpy(newNode->Name, Name);
+
+        newNode->Operator = Parent->Operator;
+        Parent->Children.push_back(newNode);
+
+        vfsdbg("AddNewChild()->\"%s\"", newNode->Name);
+        return newNode;
+    }
+
+    Node *Virtual::GetChild(const char *Name, Node *Parent)
+    {
+        vfsdbg("GetChild( Name: \"%s\" Parent: \"%s\" )", Name, Parent->Name);
+        if (!Parent)
+        {
+            vfsdbg("GetChild()->nullptr");
+            return nullptr;
+        }
+
+        foreach (auto Child in Parent->Children)
+            if (strcmp(Child->Name, Name) == 0)
+            {
+                vfsdbg("GetChild()->\"%s\"", Child->Name);
+                return Child;
+            }
+        vfsdbg("GetChild()->nullptr (not found)");
+        return nullptr;
+    }
+
+    FileStatus Virtual::RemoveChild(const char *Name, Node *Parent)
+    {
+        vfsdbg("RemoveChild( Name: \"%s\" Parent: \"%s\" )", Name, Parent->Name);
+        for (size_t i = 0; i < Parent->Children.size(); i++)
+        {
+            if (strcmp(Parent->Children[i]->Name, Name) == 0)
+            {
+                delete Parent->Children[i], Parent->Children[i] = nullptr;
+                Parent->Children.remove(i);
+                vfsdbg("RemoveChild()->OK");
+                return FileStatus::OK;
+            }
+        }
+        vfsdbg("RemoveChild()->NotFound");
+        return FileStatus::NotFound;
+    }
+
+    std::shared_ptr<char> Virtual::NormalizePath(const char *Path, Node *Parent)
+    {
+        vfsdbg("NormalizePath( Path: \"%s\" Parent: \"%s\" )", Path, Parent->Name);
+        char *NormalizedPath = new char[strlen((char *)Path) + 1];
+        std::shared_ptr<char> RelativePath;
+
+        cwk_path_normalize(Path, NormalizedPath, strlen((char *)Path) + 1);
+
+        if (cwk_path_is_relative(NormalizedPath))
+        {
+            std::shared_ptr<char> ParentPath = GetPathFromNode(Parent);
+            size_t PathSize = cwk_path_get_absolute(ParentPath.get(), NormalizedPath, nullptr, 0);
+            RelativePath.reset(new char[PathSize + 1]);
+            cwk_path_get_absolute(ParentPath.get(), NormalizedPath, RelativePath.get(), PathSize + 1);
+        }
+        else
+        {
+            RelativePath.reset(new char[strlen(NormalizedPath) + 1]);
+            strcpy(RelativePath.get(), NormalizedPath);
+        }
+        delete[] NormalizedPath;
+        vfsdbg("NormalizePath()->\"%s\"", RelativePath.get());
+        return RelativePath;
+    }
+
+    bool Virtual::PathExists(const char *Path, Node *Parent)
+    {
+        if (isempty((char *)Path))
+        {
+            vfsdbg("PathExists()->PathIsEmpty");
+            return false;
+        }
+
+        if (Parent == nullptr)
+            Parent = FileSystemRoot;
+
+        vfsdbg("PathExists( Path: \"%s\" Parent: \"%s\" )", Path, Parent->Name);
+
+        if (GetNodeFromPath(NormalizePath(Path, Parent).get(), Parent))
+        {
+            vfsdbg("PathExists()->OK");
+            return true;
+        }
+
+        vfsdbg("PathExists()->NotFound");
+        return false;
+    }
+
+    Node *Virtual::CreateRoot(const char *RootName, FileSystemOperations *Operator)
+    {
+        if (Operator == nullptr)
+            return nullptr;
+        vfsdbg("Creating root %s", RootName);
+        Node *newNode = new Node;
+        strncpy(newNode->Name, RootName, FILENAME_LENGTH);
+        newNode->Flags = NodeFlags::DIRECTORY;
+        newNode->Operator = Operator;
+        FileSystemRoot->Children.push_back(newNode);
+        return newNode;
+    }
+
+    /* TODO: Further testing needed */
+    Node *Virtual::Create(const char *Path, NodeFlags Flag, Node *Parent)
+    {
+        SmartLock(VFSLock);
+
+        if (isempty((char *)Path))
+            return nullptr;
+
+        Node *RootNode = FileSystemRoot->Children[0];
+        Node *CurrentParent = this->GetParent(Path, Parent);
+        vfsdbg("Virtual::Create( Path: \"%s\" Parent: \"%s\" )", Path, Parent ? Parent->Name : CurrentParent->Name);
+
+        std::shared_ptr<char> CleanPath = this->NormalizePath(Path, CurrentParent);
+        vfsdbg("CleanPath: \"%s\"", CleanPath.get());
+
+        if (PathExists(CleanPath.get(), CurrentParent))
+        {
+            error("Path %s already exists.", CleanPath.get());
+            goto CreatePathError;
+        }
+
+        cwk_segment segment;
+        if (!cwk_path_get_first_segment(CleanPath.get(), &segment))
+        {
+            error("Path doesn't have any segments.");
+            goto CreatePathError;
+        }
+
+        do
+        {
+            char *SegmentName = new char[segment.end - segment.begin + 1];
+            memcpy(SegmentName, segment.begin, segment.end - segment.begin);
+            vfsdbg("SegmentName: \"%s\"", SegmentName);
+
+            if (Parent)
+                if (GetChild(SegmentName, RootNode) != nullptr)
+                {
+                    RootNode = GetChild(SegmentName, RootNode);
+                    delete[] SegmentName;
+                    continue;
+                }
+
+            if (GetChild(SegmentName, CurrentParent) == nullptr)
+            {
+                CurrentParent = AddNewChild(SegmentName, CurrentParent);
+                CurrentParent->Flags = Flag;
+            }
+            else
+            {
+                CurrentParent = GetChild(SegmentName, CurrentParent);
+            }
+
+            delete[] SegmentName;
+        } while (cwk_path_get_next_segment(&segment));
+
+        vfsdbg("Virtual::Create()->\"%s\"", CurrentParent->Name);
+        vfsdbg("Path created: \"%s\"", GetPathFromNode(CurrentParent).get());
+        return CurrentParent;
+
+    CreatePathError:
+        vfsdbg("Virtual::Create()->nullptr");
+        return nullptr;
+    }
+
+    FileStatus Virtual::Delete(const char *Path, bool Recursive, Node *Parent)
+    {
+        SmartLock(VFSLock);
+        vfsdbg("Virtual::Delete( Path: \"%s\" Parent: \"%s\" )", Path, Parent ? Parent->Name : "(null)");
+
+        if (isempty((char *)Path))
+            return InvalidParameter;
+
+        if (Parent == nullptr)
+            Parent = FileSystemRoot;
+
+        std::shared_ptr<char> CleanPath = this->NormalizePath(Path, Parent);
+        vfsdbg("CleanPath: \"%s\"", CleanPath.get());
+
+        if (!PathExists(CleanPath.get(), Parent))
+        {
+            vfsdbg("Path %s doesn't exist.", CleanPath.get());
+            return InvalidPath;
+        }
+
+        Node *NodeToDelete = GetNodeFromPath(CleanPath.get(), Parent);
+        Node *ParentNode = GetParent(CleanPath.get(), Parent);
+
+        if (NodeToDelete->Flags == NodeFlags::DIRECTORY)
+        {
+            if (Recursive)
+            {
+                foreach (auto Child in NodeToDelete->Children)
+                {
+                    VFSLock.Unlock();
+                    FileStatus Status = Delete(GetPathFromNode(Child).get(), true);
+                    VFSLock.Lock(__FUNCTION__);
+                    if (Status != FileStatus::OK)
+                    {
+                        vfsdbg("Failed to delete child %s with status %d. (%s)", Child->Name, Status, Path);
+                        return PartiallyCompleted;
+                    }
+                }
+            }
+            else if (NodeToDelete->Children.size() > 0)
+            {
+                vfsdbg("Directory %s is not empty.", CleanPath.get());
+                return DirectoryNotEmpty;
+            }
+        }
+
+        if (RemoveChild(NodeToDelete->Name, ParentNode) != FileStatus::OK)
+        {
+            vfsdbg("Failed to remove child %s from parent %s. (%s)", NodeToDelete->Name, ParentNode->Name, Path);
+            return NotFound;
+        }
+
+        vfsdbg("Virtual::Delete()->OK");
+        return OK;
+    }
+
+    FileStatus Virtual::Delete(Node *Path, bool Recursive, Node *Parent) { return Delete(GetPathFromNode(Path).get(), Recursive, Parent); }
+
+    /* TODO: REWORK */
+    File Virtual::Mount(const char *Path, FileSystemOperations *Operator)
+    {
+        SmartLock(VFSLock);
+        File file{};
+
+        if (unlikely(!Operator))
+        {
+            file.Status = FileStatus::InvalidOperator;
+            return file;
+        }
+
+        if (unlikely(isempty((char *)Path)))
+        {
+            file.Status = FileStatus::InvalidParameter;
+            return file;
+        }
+
+        vfsdbg("Mounting %s", Path);
+        const char *PathCopy;
+        cwk_path_get_basename(Path, &PathCopy, 0);
+        strcpy(file.Name, PathCopy);
+        file.Status = FileStatus::OK;
+        file.node = Create(Path, NodeFlags::MOUNTPOINT);
+        file.node->Operator = Operator;
+        return file;
+    }
+
+    FileStatus Virtual::Unmount(File &File)
+    {
+        SmartLock(VFSLock);
+        if (unlikely(!File.node))
+            return FileStatus::InvalidParameter;
+        fixme("Unmounting %s", File.Name);
+        return FileStatus::OK;
+    }
+
+    size_t Virtual::Read(File &File, size_t Offset, uint8_t *Buffer, size_t Size)
+    {
+        SmartLock(VFSLock);
+        if (unlikely(!File.node))
+        {
+            File.Status = FileStatus::InvalidNode;
+            return 0;
+        }
+
+        if (unlikely(!File.node->Operator))
+        {
+            File.Status = FileStatus::InvalidOperator;
+            return 0;
+        }
+
+        File.Status = FileStatus::OK;
+
+        vfsdbg("Reading %s out->%016x", File.Name, Buffer);
+        return File.node->Operator->Read(File.node, Offset, Size, Buffer);
+    }
+
+    size_t Virtual::Write(File &File, size_t Offset, uint8_t *Buffer, size_t Size)
+    {
+        SmartLock(VFSLock);
+        if (unlikely(!File.node))
+        {
+            File.Status = FileStatus::InvalidNode;
+            return 0;
+        }
+
+        if (unlikely(!File.node->Operator))
+        {
+            File.Status = FileStatus::InvalidOperator;
+            return 0;
+        }
+
+        File.Status = FileStatus::OK;
+
+        vfsdbg("Writing %s out->%016x", File.Name, Buffer);
+        return File.node->Operator->Write(File.node, Offset, Size, Buffer);
+    }
+
+    /* TODO: CHECK Open */
+    File Virtual::Open(const char *Path, Node *Parent)
+    {
+        SmartLock(VFSLock);
+        vfsdbg("Opening %s with parent %s", Path, Parent ? Parent->Name : "(null)");
+        const char *basename;
+
+        if (strcmp(Path, "/") == 0)
+        {
+            File file{};
+            file.node = FileSystemRoot;
+            strcpy(file.Name, "/");
+            return file;
+        }
+
+        if (strcmp(Path, ".") == 0)
+        {
+            File file{};
+            file.node = Parent;
+            if (unlikely(!file.node))
+                file.Status = FileStatus::NotFound;
+            cwk_path_get_basename(GetPathFromNode(Parent).get(), &basename, nullptr);
+            strcpy(file.Name, basename);
+            return file;
+        }
+
+        if (strcmp(Path, "..") == 0)
+        {
+            File file{};
+
+            if (Parent->Parent != nullptr)
+                file.node = Parent->Parent;
+
+            if (!file.node)
+                file.Status = FileStatus::NotFound;
+            cwk_path_get_basename(GetPathFromNode(Parent).get(), &basename, nullptr);
+            strcpy(file.Name, basename);
+            return file;
+        }
+
+        Node *CurrentParent = this->GetParent(Path, Parent);
+        std::shared_ptr<char> CleanPath = NormalizePath(Path, CurrentParent);
+
+        File file{};
+        /* TODO: Check for other errors */
+
+        if (!PathExists(CleanPath.get(), CurrentParent))
+        {
+            foreach (auto Child in FileSystemRoot->Children)
+            {
+                if (strcmp(Child->Name, CleanPath.get()) == 0)
+                {
+                    file.node = Child;
+                    if (file.node == nullptr)
+                    {
+                        file.Status = FileStatus::UnknownFileStatusError;
+                        file.node = nullptr;
+                        return file;
+                    }
+                    cwk_path_get_basename(GetPathFromNode(Child).get(), &basename, nullptr);
+                    strcpy(file.Name, basename);
+                    return file;
+                }
+            }
+
+            file.node = GetNodeFromPath(CleanPath.get(), FileSystemRoot->Children[0]);
+            if (file.node)
+            {
+                cwk_path_get_basename(GetPathFromNode(file.node).get(), &basename, nullptr);
+                strcpy(file.Name, basename);
+                return file;
+            }
+        }
+        else
+        {
+            file.node = GetNodeFromPath(CleanPath.get(), CurrentParent);
+            cwk_path_get_basename(CleanPath.get(), &basename, nullptr);
+            strcpy(file.Name, basename);
+            return file;
+        }
+
+        file.Status = FileStatus::NotFound;
+        return file;
+    }
+
+    FileStatus Virtual::Close(File &File)
+    {
+        SmartLock(VFSLock);
+        if (unlikely(!File.node))
+            return FileStatus::InvalidHandle;
+        vfsdbg("Closing %s", File.Name);
+        return FileStatus::OK;
+    }
+
+    Virtual::Virtual()
+    {
+        trace("Initializing virtual file system...");
+        FileSystemRoot = new Node;
+        FileSystemRoot->Flags = NodeFlags::MOUNTPOINT;
+        FileSystemRoot->Operator = nullptr;
+        FileSystemRoot->Parent = nullptr;
+        strncpy(FileSystemRoot->Name, "root", 4);
+        cwk_path_set_style(CWK_STYLE_UNIX);
+    }
+
+    Virtual::~Virtual()
+    {
+        debug("Destructor called");
+    }
+}
diff --git a/Kernel/Files/tamsyn-font-1.11/LICENSE b/Kernel/Files/tamsyn-font-1.11/LICENSE
new file mode 100644
index 00000000..8fc49609
--- /dev/null
+++ b/Kernel/Files/tamsyn-font-1.11/LICENSE
@@ -0,0 +1,10 @@
+Tamsyn font is free.  You are hereby granted permission to use, copy, modify,
+and distribute it as you see fit.
+
+Tamsyn font is provided "as is" without any express or implied warranty.
+
+The author makes no representations about the suitability of this font for
+a particular purpose.
+
+In no event will the author be held liable for damages arising from the use
+of this font.
diff --git a/Kernel/Files/tamsyn-font-1.11/README b/Kernel/Files/tamsyn-font-1.11/README
new file mode 100644
index 00000000..a9a2855b
--- /dev/null
+++ b/Kernel/Files/tamsyn-font-1.11/README
@@ -0,0 +1,82 @@
+ _____                               
+|_   _|_ _ _ __ ___  ___ _   _ _ __  
+  | |/ _` | '_ ` _ \/ __| | | | '_ \ 
+  | | (_| | | | | | \__ \ |_| | | | |
+  |_|\__,_|_| |_| |_|___/\__, |_| |_|
+                         |___/       
+
+Monospaced Programming Font for Linux and Windows
+--------------------------------------------------------------------------------
+
+VERSION 1.11 2015-01-21
+
+CHANGES IN 1.11
+
+  Changed capital "A" to be less pointy, more consistent between sizes.
+  Expecting hate mail.
+
+  Previously, unimplemented chars defaulted to print a blank space under X.
+  Now those chars are not placed in the font at all in order to allow
+  fontconfig to fall back to use a char from another font.  (Thanks, Allen,
+  for pointing this out and testing the fix.)
+
+CHANGES IN 1.10
+
+  New size: 7x13.
+
+  New size: 8x16 (replaces 8x17)
+
+  Many changes in favor of a cleaner look.  In particular, replaced the
+  double-story lowercase "g" with the single-story variety.
+
+  Added the degree symbol.  (Enjoy, Sven!)
+
+  Added the copyright symbol.
+
+CHANGES IN 1.9
+
+  Fixed the problem with inverted question mark facing the wrong way.  (Thanks
+  to Swyter for reporting it.)
+
+  Modified the small "w" and "g".
+
+  Restored the original look for size 6x12 bold.
+
+CHANGES IN 1.8
+
+  Fixed a problem where chars showed up as boxes in xfontsel and some apps.
+
+  Tweaks, esp. to 8x17 size
+
+CHANGES IN 1.7
+
+  Added two new sizes: tiny 5x9 and large 10x20.
+
+  Retired size 7x12.  (If this presents major problem for you, get in touch.)
+
+  Added a pixel to the height of the 6x11 size, making it 6x12.
+
+  Added new chars for partial ISO8859-1 support, mainly covering the accented
+  characters and currency symbols.  I consider these new characters to be BETA,
+  since I don't use them so I'm not sure how they should look.  If you have
+  feedback about them, please get in touch.
+
+  Made many minor tweaks to character shapes.  In particular, the f, l, and t
+  have a more "traditional" look.  Also, I've changed the w and y again.
+
+FUTURE PLANS:
+
+  Full CP437, ISO8859-1, Windows-1252 coverage
+
+  Mac/ttf version
+
+  Cyrillic
+
+  Unified FON file containing all sizes in regular and bold
+
+  Separate OEM and 1252 Windows versions
+
+
+User feedback is welcomed and encouraged.
+
+Enjoy!
diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn10x20b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn10x20b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..4a582d9edd10dd598469dd6bb3ffb479fadb5145
GIT binary patch
literal 10823
zcmeHN+ml>H8Sm6qC6=|tzVNUqQVCIRqQb_N5MkK~ihu~=uBd=Bj&1~US%^Yn;!Xn!
z%0;<^n{p>0_lt&$f-sq{%BN6yg~}T*`~keC>c{t;Z@%e1=k&~(G8^DwyQ@$4>HhWC
z{ayMy-92;N>*w6!I2_4okreoG9A}4f`m(%7q2-!UY(*`@7oYc+t{o-~Px13bPPv&Z
zPJO=9D2+bqit#`Rldd>W>M4}UVXR#oA^kqqF86hbF_5H}>N~%6NX~D5$4K!zto+jY
zD9d_SKGJe7(@WRPw_FYtz2$DwO>o?iJty3$ZquO}Dxy2?rm{Hh#=Etl6kzHxW<o`u
z(o!$6)t+QtB*JUYJY4lO&7Qf=aoUY=Y;rCm+blwlS@)se@2=<dH||b$8~yu!Noeeq
zX59x_oOQEqzuV{j$7!4IHFpa-LV1iL&bh_ec;j7Nh+ZbL*^P2b9HdtGSsX=qm!8Ei
z%CoPz<*vqg%0C%i<<nw}#9_lSw=Bc2>C>U*`!w{a7J9|7$S?AuE#X$VR0-8tkHsMR
zZMyYtv)k^rWaa51Bzqs_ai-jcjGl6wo~h8&u~oWtm;Ro&viXg&oCU3xl^S@&EpcP+
z2)5FuYk9?{aIMTr>u#=s-ZIvBo#R}_tMH!YSLc_PUus;HpHLB6{pp4FS~kPQ3B4Kp
zSf_E>+AWXUq%3+V+Lc&=YC=}PVjjDHFilyWLe{etCX`ISDOAlhG8+_>2ANwih)nkQ
zJ$|46up9UJwrjI?YDFk>XA%s%#S(}s=DJ$2yva4Gu%c@RVha){+=>*8{rpUqqH1@B
zYf>TDpHWOpv5c#y$nk8{PV2ljW#q{|^V3=J+K6VEB4~a}*RDL%>sMEpt;zoO-0)47
z%m%lW<AzK|4WAm<q!IG8TpE6hZ~2YB5ycd}hQHQtW88Y*>>*P)vlf$2zjYqliOq3X
zda3mk(^I)LQ{>pfb+k3^FsIT^+i6*E<#i+j1U{{l_G{KE`D%`_4~Zul^steo-D2&e
z^{e!h&g$+gVmek<dXwz$g9Tb!oQvNLK1*bjvX>gKj&!U=#H4rF5$M-nsLS^;f^l(<
z{aHHZwelsFmvH(2hj=%wyOR7)We{cEgVnlHjycs{!mq?&gQA^02QhtFBi1LiKGZHp
z*j8h!DUWM3g`RjKrCG*}WqY%6M%WH7y_Yn4#c_2$!LDuYd48MLy_eg!XGdgvDgP%H
zAYnRb3&HQ(xaI-%8&O^#`SHx|(|%XRZMkc5QR-5mieKxa`Y_!ExmmmAd3tj_o3M7v
z)A|^(=3c&;clRbE$@>NMf#w0zb}AN<x0kVg<Z@QpOza`7qe*0t{}U{A<9<G?z<q4p
zOS#aCJzxpYt*~)5*L~nfV*jaoPupL$O5~P!vn9dIatiNDd<@U8v-mAWZH@Z#4$<qb
zS7~mIfz0P8*{Lm8x$v?efdvUHNMJz%hgbsQzcon7ZUo~&#b?V6rG0&Eza3+=Jp4W8
z9^cCLyz-4}@p-*WOKKWk$Es!D5`C7D;R~c~#rJZLK{axBIc!+&R=Tx*oxd!L>-<{3
zk|lL;VJY)G<MwizbW8og(X!tCcZY_U-~5aEJCk#I3Y=eVKO1Vgb1L4%&HvbDd1{68
zPyb*kiX1f9Ubf-wRH*leuJT^btf1=tPfzC6^d|X)HN%stqURVj98PWo;@y9^i%ZFG
zg_m3Oy}XOw>ke?@l277#_kZfk<$f}@E0dp{w!^6{e_k;8RpCs2RXCGN6;AIq_)P0{
z*5R4=aJ~6e;Cl0`!1d-=iBqXhv+rKzSMi;qJXf(t&!3acUaIaLjo<v4TTXg;dd6=R
z&iJju+5D<-CYNelY>n}`Hm<j_oL+^;{O?C~Yv$bSG=KK(FPAEu$)yTs{8r&iAH&{H
z%4(d;coxdK>LPY~MU~48|2k|l5N{F(lZ@Oq$<3DCu9$~3tj(|rXOgMHnZ;D$9Ip)B
zUk#q0`M+v<#?f{^+8%AU+T#88x*OV7U(7{@B5#SZj$;4kxK7rb1eLXUq(Sl%UG&4n
z@*9MU<uV9o9>MW1M#1})?;V4F2jjy02II`~tHyP1+>d3pw}Sni-S^8bJ|BX;1iM$8
z&f@~Vst?5!{a?JV8;lG54#tJ~4aNnzRN;g#(U=7NTG?AxRd}cm3?6WrEi(?mPE8`3
z_qWr*xFDCoxWMmVT(G|)PP|h7>!oXP6aQ1d>}3mkIIRsl>&~h8o0Q&n8a?2n`|p8-
z&a3kLXy=2R?&5R@r=6VM$!dM}e3;*NaoWx4MNT(K7j&Kij>JlQ1z*KcI2y;`SR9A1
z;dp!<-@rF<0#3vPR^eNi#J6!0R^w!>!FO;9PQ?^X!!&AGi_`I4d=F>f`#2M4;cWZ>
z=irAp7w2Ie&c_9~5EtQMT!KsSBm5Yb;V1Yheum3&1+K);QAY#6Koh^juP}r4_%*J=
z)wl*5uo0WE8MC++*I^5OgWuwM+<>jvhTma3cHsAz%eWZ$=sb?j6X-lCymoe>^E5io
zFyqgn^BiX{aC%7uk%_RgTS#@@lE>Rw@jZ|S-3Yn~bTjA=pg)3c0o@Av6X?&N+d#L2
z?f~5h`U~i<pu0eKgYE&{3)%^~4|G510nme>hd_S={T=i$=n>GPpvORugPs6A33>{&
z3-mPT8PGpK&w`!<Jr8;T^djgb(957#K(B&c1N{^9FVJq#>!3G4Z-U+e{TuWj(A%JQ
MK>r233wjTq0xbmld;kCd

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn10x20r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn10x20r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..e9222b77d336baf4eeeedde32764cf5352cc7b62
GIT binary patch
literal 10823
zcmeHM>2nlC6z>GeS}n^Y$_L9r*es}k3h_q8WH$sz6pyHQ;sJQzeVeG59q$Vj5fSf$
z!vnlgQBkPv|AfDSZ$IDb-k0v_>D^h2Q1~I;HPhFxU%#u5>3Q_mOJ7zLiuAN`hF)_h
znMThsT=v44>i6Q9*V20S+hj$#m8W%zM;19<l}wy|WZB4!UQl5?n8Cy=4rY2XrEKWf
zAC3?&ckIvhRgp0er5Ecvv2}>@H?d>H<ZV@daeHKS-KrdMJ!k2~YbIJRhl}2Es!MfJ
z95e4ub)i~%xQ6oR`Z}}KToVSnVwA$_Ou36>=u*{0@K6ILrh#_MUR6<LioLXew^6>g
zKEu*jrFzt0GNjH{Q>py~H9Hwdri2hG6UxLM$_=R{wCXQW3zHBi(uVcfa=RI?P`3r!
zrPJ^?Rkf$UTsxIwyBE34J;P8S&gQA<^bApZ<6yb0n(><9(iBcqCz>8T>FV)Pbv)Nv
zhUtZYEya>r39WXDv=f&phJo$7n5;0QhSe&{vxQ@!K;z6I+lg%oD$Xg>v*TOs78~HI
zhQETEVbIpIV&k@}qv*VFJne=3M9JDOhN~Ls$}}%|^v3k2*Yz-FWNj>Om1u-IjE&3k
zS}Hbeq(8w`RG;Cmojj~j@NMenL%iR{dA3dHS9XSUlGJt%q~}GNqF7YYbgL~nI%3}#
z%6fqv+qN@rVVI%1RXItLw~~$Z_@+w8jzu*ygp#&Obxl{tEtdgNh1gZn3f08I%(@?x
z>wXg(ll!eBzZ1)H+D|pH;QUW0#<iHmm1E>c1I0RL%gp%Q5uI>H;mv8K5~U~WRNnlx
zvq#=cJ-!~WCI)Cdc$nfK<ycFxAlh(gTrU;1My;S#XlPubIK2w3Qp1E=LaUa@9vj!q
zH$lba@cl%1Y?U7GCv5@Pr`Jp`ea5;)nzfcnTLV8u;w&b)U`SIGDP0<uSK4{+pGGk@
zFPWg=D#j*5WScdyVGWKcF`a4kIT{02sLhRNC5hqezQAjX>{~H^=~cxB(U+R-$vAf^
zuqOca?sVuSOU9#5k5AiH#&qxhQu0sJvX-{m-=4wx>bB|2bYporIv->!j%9FC!E;3V
z#OArI0y3iYiR`#Oy$bEpmSz^$VJy)}2zyeKxAYIwa9qoevxxAXmbVg;F}}o=qb6s4
zFLr+6^Ad+e=H$dBKaQF<e#y9Y1-weFZLt2O$7?*U5FV+|HC_cdHVS$2N<X%*i%xIS
zE@_(H*tmSsE@|8z;apN`0i8np`6>Owl-EGF0>=H6eI)HK9U+<VvXhl_S^pCtxB9D*
z)Q73iV_P&@|F};%>82Cvu@sLtCz_Csl!cy6?K!Y5vcJmNm``nGl0FPm66co%+JEi0
zjjfxK_-OIDZ0e(!g2btcsY{8e`=KWpOa_w0e$`}tQUjA3nAE_e1`fLhcvZH+t<O^9
z>Sw6A=8lbT+UC;zitFVw*y=rIxjaAVQpJR0mztlH%RUvC=N*;50_^>ueY;l4IlgU8
zSQcDsDevK}2R;q0Pd1piK8c-oTc;(+0_mhgr@s>2rxp^aJ(M)N+aC(G{J#I!|4htz
zvm2&-$&MVtp2V{EvJ=mdc%JpbiKl;P6y3_h-|~Exb+gWX``Z6kd=J5MS-w~NQRNPi
zX*I*yFY|nQXVF=n|JdZwQ--5faF(xpdRD5A<X9ueX~}H*&gB0t%MxE+$-DbM`?bmU
zlfGYx{^V=heYK@m5Yb;APV|?D6TRf&9Dl4CKQ`je$8bK4bNn^OIsWo+R@1%o#m0Nv
zC_NmzgYPl%m%MvNk=NZ*+poM*aL+IH$is=ec{t%O4<~zN9!~tvrv7(ry2X~->3mV5
zyIB5z#D9>6skDe@x(lM0^tUgc7SjJeL@#+b(Mujq{2&kK#`SLmtnWA}T#jd>yDzb`
z&b7K6|J&d@@}>0V*sqqmMw1iGDDpVI*^=9pz5pj2=HWy$c{uTyJe+7S568D2eEX4y
zb7GCqS*egzlUEhTk;Jv6bG#qe)z9u6{`#lL%lMBL2fJ^`iWKUP|Kr(vz2-Pye{8Wv
z^nATE!#V!a_kihjO&RX29L;f#zvei{Umosg`nP%#dEUutmhn-RCY+Z_Ie&3}&&W#J
zSQ&d*jN9=A?)$S~I1TS7oxIj=f(>zwzveinmpmME$}0c|Yb`06s^Ha5ock*v|C{iG
z^8=B<rlFrYy)?%;y)?%;d7I-Jj~m{%tNLtQsa6~NGu_o{WxdwPEPG8ju1^m*uz4dm
z)PCgmflXWJ*+9>FdN$Fs*VHEF{V|od(X*SLUGzN9T~ON!6w!?mW??o?!KpY6b1)b4
za5~PwnV63S=)qYy8|UC$oQLyq0T$vyT!f3U2$!H2eJG=Xek{fSmS8ECVGu*O6qjK+
zF2@zP5?5guSK}I7ixs#I*W(7<h?{UTR^k@iira8IR$(>P;11l0yKpzw;vU?K`*1%V
zz=L=Q591L$ipTIcp1_kB!6=@>(|88!@GQoR6ir{X&r$mVwJ%xL+BVd-qqc(t{~EP#
zDA`HRcdQ7b!rE>oRola_zf5)?bOQYx^z+a!K)(q667<W^uRy;F{TlS^&~HGmhkg_K
zE$FwQH$cAwy%G9d=uOb?L2rhBA9@S)2hblve+2z8^e51tLVpJRIrJCMUqWw%-UhuL
zdI$7Z&|gD;1N|-ZPUv0G-$8#5{R8xm&_6-{4E+oAZs=d3e}n!VdJps;(0@Yz1-%#g
KZ|HxZ_u*f}B_Qzt

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn5x9b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn5x9b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..cc3ade7b839ef2874eddaa3c734c9ea00a716db3
GIT binary patch
literal 2887
zcmeHH$(GzS6cq~=?CKNDJcF5=+00Ftig^Yx&tSq7##00cQveg15J&(g>4XkRz(5BA
z3B;$~4|v&2pR8DF*}Kbql3dN{t^<cXs*-(m-yrEqe#>_)TV>c1_5&2~aS&hH57hCJ
z)}M*LC6=*-ZR}WnflS!iZrJKb2NMdkP3TC$ygqcWw9PN2l+l1uo>oWNM$SHA;P@P$
zViB8KXRTXAhM{FMme{#6Fn!l|u1}mKxlLV`nL&}-y6720Rpy#MY0@CyXsBzO8pB7*
z0i&F4OK-DwzH?&$O>7H`2qwlb0}Zxmg5<W1OKq9XyAz}>T}+x+j#Dv9-3G?iZHRKZ
z5H)d$F;A1H)-#r~k3daCUtKbriwok|FVI$uu{7v%>N+P%IBCVVX&e3&<lM4a$TWfB
zdcsl_)N0D>rtv;a<C;bpo`7`<s8eMXFgTc)FN7D)6-6+)s#0J(SvYsMK?;@9M5b-j
zC+F&01v-UQz@Q)k-)*K$p{W%#bn#L22+k^<qb1j9n-lRwd77L-3ELWz#S^7X8?WM^
zwu#4#tEv#h-L#&gK+2>%FK<$x)-!q!ZSbK!)Vi)2)sV3|o6{(hQz34suA@FQbhoz?
z(@XF3P$27p&h8b`Np<zSB|$OnEY-|LXV1NJr;q9MA#hDFMSaM`8{~pM6KU$wl;5>3
zht2D=!t2xTz8#<8|Hpq)z#6Y+qPHet<fvHjOXgp5HF|P<tLoYpS~-HYs0uq81u!``
zxrp)iU=insv1*JnbzCp$(7(MCJKm$1E5;iZSZ=W9jn2BV(~BVK^CQwi)Kn1^qtaw6
z8*5Zvx{^Lx6I4w*$YN>gB@tw01SP)@U$y8%O(_h00-#R-^a+4>z2Ed(KYQa#(;(yN
z=%?39BFM@JxI#TSV@iE1V2dZ&^US~uGFsG>bRa7uQ<}e-IK4)*O0>0tJQm?W7Hf;@
zqeUhwDT@NHk1snNV^p75h#VEtJSq_N;W}bz(mYzDd>&t{G~9zh)`t4iO9G%zWIB+!
zgi}~Qd&}i>0xuAmAP@ngtl#oTAJZ|$SmW5$TYUx^9`p$U(Zuk`jDXi}R7JJ=c@r66
z|JpUsHmvlye`+0j!M>V(ihZwV2mZN%<7xI;_8sgiH3Y-WK!SsD2oA+zI2=ddNF0Tu
zaSV>daX20);6$W22`A$eoQl(MI?liZ&cs<b8|UC$oQLy~;R0NUi*PY6!KJtileiqq
za0RZ!Rk#}0ppR>D9j?a>xDhwuX54~XaT{*O9k>&B;ci&mgL`ow?#Bao5D(#DJc38@
z7#_zHcoI(`$J1DjXYeeZ!}E9nEAS#-!pnFCui`boi+_9!OAI$+xJmaqoW^hqhFiJu
z84S1awVi#Z3gIOj&T6XRZhh?Wa35p<c^$G6@&@Eh$Xk$AkhdZ4K;DJC2YDZ|8u9_;
zL&!&v0`f6r4dfHZ6y#ILTF7URb&$^?UqIGFHbB0Fd<FR$QbIODHbFK+rXgD(TOr>-
zW+2-j-$J%Sc0hJQzJq)ZsUSZ<euVr4nT70v{0#X8vK#U%<TuD3$X>|rkUt>%@E7HW
B)?5Gp

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn5x9r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn5x9r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..185806c5575d067809dc630076f27bc65c75dde7
GIT binary patch
literal 2887
zcmeHI*_IVG6fGZo@U1=}&a+<Uc8+t4Q#sEX=UGdf$5o;tDr&?QQBVtLuo2Kw8%066
z>z*IDpHPc0s7Kzm`y^G>Ecz}UeD-uFwX;uhlI$esF5R(Yc|tQRhbUlm7(ZGL)%GIG
z=GwnSo{5C>ZX&-x8d}{oYi(&`N`cyxwiN8sN*jx9-(pG`9ni<AwWZc~4gn*_dUA*Z
z*nzFBZ4Mw~)6x=4oMl;LvL-8=lGx;hOKY1X!?Cf|fQ&0`RgTrwO`IAHVA7<p<cuxo
zYn*2n?Zl-9#L5|~u+b`-(+`K(q9AbIN6C#dCRbO@*r9u4xC~{CD;uMrDeB0$qK=~)
z4Wup}Tx6WjQ>RSAn*TJ`VHpg}6{|Jvg4ho0(>W7Mhx1ic6uJ)Q8}Io|YR^9fc@aHi
zd}O$uA}*Dnh<z%rqZ8i^&nZt}(lm`L^yRP&kr^)z*S>-A<0^t)7S0_b2WG&?Wa98}
zOgdM8)flCl-8-i)5>1RueF9jKaY5>8cxny5xt^r8d6E<bkCeWeJ!mzR&)A_iUd2v8
za(SGq;88?15?2(Cjx=pu>{AXIHyPN5GZ4g4JfASivu$`ZL7xDO8Pe72Lq{uJQZ;e$
zLHZDfyKw>N>_H)&G)>7>!>AZ{W*Y6IvkyXN-|CZav}>6r^hrqgzE8M86i8hIDq#%A
z>vCv(7gWpIA${YD)&KUN6ySr?OJVY|%nc*-$x3f(I166Ym`POipnN}3)+4^y_9paH
zGVP}q8Ug7+PP8^_O!T#6Y7XYz-)G$Ztp)6-{X%0h;s$Mz^L-7n@L-K?fh}7wu1s`g
zNy`kfmf<^V%5W7!jxvrHKc=R%1MC@@OtYvyd~4d&ly-oxom9@>1pS6rnbg@htHVXt
z+{7GVc{(b1YFc1R=1OJw7$WfcZ4ZS@)D5SBDL9;-IJ^ZM9+~h}mo<HkVs5Dm9iRKs
zm;4qsk58D34nWr&0B3Jq9Yc9qhRKc!X`GOw_;eX3rY6P-K;uNF2e$i3;#Pwi>=QxK
z0n6X0Ztt}ZIVuR`I8zXaV6i?)5J>wl{pBn)704C3L56Wkm<W1(l1`}T(qFlldztNm
ziwv-L^(v^1Dy{d<tYPsiD_Le(b_ccy^*Xj^S>{=`u`JUe7;OX$4#yEV5=Y@^9D`$V
z9FE5cI1wk|WSoLiF~Dg!9cSQ7oQ1P-4yJG}&cpe*02ksSTnvj#a49as<+uV@;wntz
zYAnGuxE9ypdfb2vH{vGTj9YLkZo}=k19##s+>Lv1FYd$raCiU@;vqbYNAM^f!{c}Y
zPvR*&jc4#Io<ol3u@o=hMZAQU@d{qWYj_=R;7z=Rx5F+DT8&DK)?>6m_d1%zXcI=8
zx$!xSw(zr+WxEOyBpl6asL@WXb_KWxQb68;EQ7oYc@OeFWI5ym$O_1ZkdGiALsmjQ
zfqV-24B{c5Lsmh)fXqO?gsg^q1z7|68uATfEo2?!TgZ2i?;#~*J!Au9BV-n`39=dT
z17r@e1@a?gD`XpFJLD(G&yWi83*=YGZ;*M&4#@A2KOj3He?tC(?1Jou{0;dBvIqYH
D?YdE9

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn6x12b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn6x12b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..4ae9d6a4480198d161fc665bc51ba903c5675c51
GIT binary patch
literal 3655
zcmeHJOSBzB6m1jBz#zjOWN;D0zx^MA_!GZ}ApY%t@lfJ-5mp585Ihla5#;Yi5*`vl
zLVDdZxx+i`;aeGH*ux&YwYGguRrkFSFDpX>=iRE_b^7!^r%s)!dW&~1SRPRtY)2?y
zcQhZ`j?{4!Eg7RM@wo0g3kQF-^00yH_1s|_M~O-?WM7yjG0i-Wt)J&@3{MZ)41Ib4
zoIYT5(7<zg9_x!CJp66&HT2fUb`ayC6eDR`@^>hcv?$UviujA7JkRxEGFpy~mTVj(
zNh?c}*zBToZKvN@)S0W%r2T$6o#(cWsj>u#lZ3-GN#ZEV^r_=aUp7itHWW~jgmd)J
zdgqeV4-X93In&0*nq@k0y?lSK^!mgV<oBs_?Knv@|9KfFE{+TT?Z~3`bj)ZdWmd#-
z+kfk_qF0p-?KNt%(ORnX1ie=5?IVpP#1pW^tX`QR`<5Q~=S7u#r2`8s<e8LAb(XdC
zMT4WV*Hai3y`KIIw=xwoQ9adDrZ2Os$f`LS&MNzyks78oDLrRP)1P>KOlgO?_wr(@
z$i0oZ3Y_D4S$4+91JC}Fq=p$L#pgkT<Tu0mSx0fC`ihhB*ZCjbI7SnAjL|iWXS~xX
z%TR#y<LJ-y>XZ{OTv{QOid$M?Dmt?)vucY83)-4!78@@26CtjIl`>c=Q@Xg-_W5Bt
z>CWe$F6#Wpv}gw#t-dm>%ZP5Ty70}$D#i2o_>;&n9?$P_l1$NWmgRM>)S|Ls{gj<f
zCxol<cpmjz<=--`OJG*suTGv@c#1(A()eAd|H$GT33{dU>lj6v=|<4o3RE__02QWv
zwFAnqzh-N|Q`*heog5^Jyh?{t{JL3A29Ez9|Je+r+z@&T_=BEDj^Av<cZZ#Zp&VE-
zWl|<O9bIPM>1ZHB*9faN@9gU2RlN<2qG--oJ~n4qQQ@)zGd;Nz{*7=Z^Vp)D>FvyV
ztKpenPvm3y#LTb%`G!Go^Dyu%)kEK(`3$YbE+63L<N!0BLpH9)Q8eQEdC||!Q@Ae}
zGx>SR`8$IAH70+J$ywtxiR_YSk%#s*rhScRUt^v=&F225o1#7A>{WLJ{pt~AOGBO-
zlc&bCuQ54mtW)4o<ZEn}-S0g&U;lmJ5jEhfF*$2Yo*L6H1JJru@yB_lke>Rq>gzxQ
zt<HQ6w89!_g*DI$YoGx;R&s@vHgC2jt8#TbdY#_(mWXgiSRw+pL<DS;510#}A#471
z0cx!Fm0s-wZj87@&wQu$jI+?$D-H`_dh;8$iTMpUEP&Zq3_;I*98GIyGRyHFEX{wl
z02QaYGEB}Ilc&b?tJvQc;Xc(HDcGnU*tdEmRJxPe?_1Son_yePwu)_!X_s2RhU1NF
zJJ`0dEz?iX-2gOj435Qdn1kbS0#3wSoP?8c3QomoI2~so!I?M<XX6~4i}P?kMsNWx
z#6_5gi*X4q#e7_b%W(y+#8tQ&*Wg-QhXuGEH{eFxgqtynTW~9G!$RDSJ8&l!;V#^b
zdvGuA!~J*wDIUZ_co>i1Q9Opn(ZmyY5>H_aPvaRp3y0^h7|-Jcyoi_ZGFo^Aui`Z<
z!RvU#W^u@_yB6Jb=&skfb~mEC3Ej<{cn94rd~9Xgu8FV|c6TUMcb9g%4eo_3g}ez_
z26+qeHsl@1a>%=oamag+_aPrZRzN<4d<6LzG6DGnvJ&zsWEJEy$ZE*vkT&EC$d{0>
zAZs9BL%xB03t0<U2U!o<0NDuH1lbJv4$^^afqW0y3fTtP4*3D{BV-ct6Xa*eFOVIO
boseH4zd?3Eeuw-4*$vqP`4jRNWH0^(-$q~#

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn6x12r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn6x12r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..1373ec2526922b787c70357e4c644bf2bd33080a
GIT binary patch
literal 3655
zcmeHINs|;s7)>um9X#}rW4e!fySIv3?k#SmqT=4}xR<!KYm|ssDr$=(wu;)ofQ5jL
z3OWkPM1L24!W<_&dF*2!h<Ls)GpnX22u8elFuODB)vH%8zx*;QbH%PDs||}~Jxl?c
zBY4qzxZWGnZnCsJuG(Vh+^-@J8MHc`)**|H)iOJxpLL9N%wmsSyVz?S-an!ld37G#
zKkx2<8}I3TTsu30N8b&7jXbpnnEfMBkK;ic4;Rw84*Xo1BuOf1k__FSM6K3{Z7oWz
z<xSix5}OobHHUj~(djHFH1yGnD>Z9l7HcWemW7NyvPD{01uWJMN8T}})$$r+<_Fwr
zIl1$QvrKQ&yj$$cQ^(s@&(g}_G>>XFjCUB->QT_t>Pcr<(~xPN4Wg2-$Jrnc8tNIP
zb()l9$rH4rTFdc_QR5uNE@thO8S*^CF9(p3wQ;7r3oYcCmfd11%i8+DCV4*0bA@J*
z=lXZJ!Lep>qvZ3vGwbj$%LZBId+<1OJoVkY>Gip@^q!nH7N4t#r5sn@=}q@KUc;VP
zyk|aB6nx)#=KG3ni5WDD_t7Bvg3|=vjb8cEvz=vW6#21mqP2L>5g)=Nnd6J1m<bxL
zu`-67il7;ChQfMIb%klsh?uBY*BN1|t4)jYG;w~T4L>r@$|#dY?Y!*>rj{WM!b6V0
zPmzhJ;4%n&nhyith=&?NsaH*;{dynYw>2$>uPnbLQ+Khoh_kHIn+^F_MX51{6HpW?
zXVG}dF{Fgv$Mc*5r*W}Gk;7Bd4B8=XvYdc078hqD@M>9(g)p%dU*_K!vQ_S!-i?c2
zPx!tTX~5IkEYdGI6l10p`G<6E7M<Yz|K&fM0UIVzFDX|KHw=w+-r13-Ng9?RSH_S(
zmFQgiM(;*SGJ@Ny#wW&CmFsQfff-AB$=E1S;$aC6cKvr}y{XxQ87<7)=>?xN`lPp@
zV%|f`gvA-Z;8>H!d}=}&T7_*ghnG*zVMhnO)%`MHV;c2jS=#BkZo+xNlZyU4<ote4
z{|eK;!U{_b^_+9R|4?6H>MI;z*vAIV=3mWZmi;nLe@GCkkM0$^N2yPV)u+VNS2)ns
zp4P0_n|#%nDDCom-<M|Usc)8^bC{kLA7I(9?r7GkkMY}i=5U&KCi8q!u?AZ1`5I`z
z^sF%BtgtbRG-&G0dWF?$W~|+tQNZFqp6QT?a7MU9c<lVEvqMK8G>oSe@~??2vFb~#
zF_hRg(wgr1Df`qo2bu{DAWVSr<pe19{m$ui0-T1PbJ%dDu=>IoC|v&4Q|;aN%h*b+
zo+Z}UDqLzJ?IE0}?nDY2^1z?#)<R2vQrkbryR047HLT;TdmNj&c0KPWSa-5+XI-hU
zpuY*QI1)$UXdHuMaU71v7*4>6I0+}?6r76FP{-*w183qaoQ-pEE*dxw=i>q_#)Y^D
z7bC_cxD=P+a$JEcaTS`l8cT2uuElk@9ycJtjkpOnV<~RIt+)-#a69h6owy5k;~w0L
z7Vg9ScmNOLAv}ynupE!#F+7eZ@FbqX(@60QR^VAYhv)GEUPK!&;bpvnSMeHNccWOa
z>G#mzfc{1uYkva$&FF98zzg)Z^0JL}hbF?Mu)kBS`cvBMc5p8wgS-J*33(H;3i1|Y
zHRNqb4tWRiF62GP8p!*Q4<H{xI*^YbYat&)#vz|T)<HgnbRnNXK8Jh(Sr7RV@)hK3
zNDs0BvJtWgG6C5P*#h|nQb4vszJ+XqY=`WCd<Xd+G70$s@+0IY$WF*E$j^{pAXAWE
SA-_R(L-s&^hx`HAi@yPxGMTRc

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn7x13b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn7x13b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..4ec3ee59ef224565a1abab41ad9b3a1ae379cca5
GIT binary patch
literal 3911
zcmeHJNstsp6m3sl%6lI;;J$0Aqqf@OuDEZwZ>{3qYKvQ{ErE!*p&}xpqOuIgs;Gma
zpj7ndSO*Vts6&S_L2#TyA3XG-g6I30m08`gC`TjAnas+U|NobN$*SyGTdta4VVlZ+
zh)y^h#)tMp6|=RQY;89$$MrJ?{>tTpnzgd5bx;PeZM{L8o?CNE(;RT)G`Hr!o<X%i
z`{DVXVYoLcsNKVjy+JTUP;5FVkN2khS1Ywfqu*%c|DYQi6LSZ*NtR_nefsn~cb!Ys
zYP}IxBdc1eG=A@z*!($CRb{QnA89(<8q#n3v_mzH8*Fi`dir4Fl9e@UdumNP;}FOB
zpdC3|g<7TZH~(8LXJnZgNn(*nyOWctagw;D*)7aW8dYPTgFLF%BCl4hnJll`2)Ieo
zkAkGuNcyQ)qYZs7f-+nV63*IDwQz?XtJlth0=N)#e`c<bFq{xj!u7b3Sc&!1SAopk
zZZ}EVRumKFY3d02X{!GY)ER%$s5{Wh(lpI_4&+JFPm*FM2a;gZO`C-cEy!F@vjk<{
zBDN4IX(veU2)HF%L7nDmUr5r)yc+<WW-CgfF4M>n6cU#bm1Lfvog^lTir}0(v9qyc
zp3N~2Na%!D<FWK?++725lH8s}=e5y8sm*%F4BDfqdPYyEHY*{OGaelEWo6w4mntS|
zr){^wywklR1bzn@bs>qU#1rEUO`3a2y^*UoUSidv!Z&3ryof8kvOd+qS6lBS$$Fta
zsuYetPxd&QrygKquw=HosMLDxE95+goK<%sR8HeDzCIP}b=^~|pCLG9E)rj<>>MA@
zCxe<6C;+u_k<wBBo=#E!Cv=!XMSa@Fxm#2;p%gRorTX~4{l_!Flj18J$A+hk@2w4K
z_yS9f2}g&=E9alpQd>)~cN)U+R*{)EHaa$MXen6KP0xg*99HclABOux2mPaj7ixGv
z_Q`m_#c=8DSBue@-hQR~6wn`DMmr6^Zk6)Np_?UO`b)sKuLS%?mB6q%{J7-)!&Ns~
zx1V+0uEm|j5V%iyO>v(RaGw&8r3AFGAN5$vNShMSrUbMp0X6&0X5O?3(Qk&kr?{+a
z`rWdhL1ha-*#b}-i*!?^4ie%@rCIYoWFnJ}kMG`X5=(8hJaq|3T>`R|fF2CpS?($!
znKqMV)XeN${SH@-`W=A!?SXaM1M9a3wPvkUQ^w{<dvj5r;?A;1%;v{mQ#L;y*!*~4
zQ{n+_T6`hhYet(A(53{m31FnEJ{OmfdfnHYgh;)_);j>}!GMhx#cgWc@u0$E%{SP;
zY+4~(pHQK;-N&ZhUtpvrS#g_@tpr}p-C4z5Z*NVnMhUQM$s%a$Y}Rqt;-%~h*%z=c
zX5VgC=h$%>@hJNk`$qP;YJ$!xU@8vB5jYY@;b<I#V{sgg#|bzQC*fqAf>ROWG@Onz
zFoH927S2Wu=ipqNhdR#3G+clSaS<-YCAbuq;c{Go>9`VC;c8riYjGW}#|^j<H{oW?
zz%95Hx8Zi&fje;*?#4a17x$ro`|$uC#7sPdhw%s=#bbCJPoRk>@f4m$3(sH{p2c%`
z9xvcU7`%j+@e0~_6|-#=2OK)f(OH4cN{zKMiq2|u)-dq3=&a*o1N$aTgiT>*OsP6s
zb=YR7J0No)uR-QQUWd$syaAaHc@y#$<ZZ}1kar;qAn!rmhkO882>B4Q2=WnRG2~;&
z638czrI1e{pFuu{EQ5Rj`4aLKWI1F7WF=%3WE8R*vIg=sWG!SJWIbd9WFuq~<QvGh
mkj;?qAm2lNfQ&)5Kz@Y$1lbDt8S)Ec8)Q4=SIBRW9rz12xo7nN

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn7x13r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn7x13r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..380702de2d428cd86210ecaefefe6c6dc04fbb37
GIT binary patch
literal 3911
zcmeHJTaz7A6mC^rr5~cIALijaOr;tJjo@I=IA}Cl92_(TgTc5DMg#{<MU1!w5hH>i
zmr3MGFd-zQ>a2f~UogKQpSAX_drVE3M^*OB-o3wd`Sx0S?e2Y699X`_;}&s0K_)z$
z#1H8w3g*^sa%<~(HSR8If0cMqvsRwB7UdACHe2_Z)iNzws(~JtYMBPd>SlHSx$|Rl
z;e2GM^+S)dbufp(ELzux^C|z8q!C5EC@TNKR;}cDdXYGeEAu!m)xSuBpq;h?zZWXI
zs9VHgTnq%Fin`sX$nznYd(5VuY6!wG;ueNtCl78cQo6863TGOIW!=y7S}kMdd4G$)
z)l%*pkdUXTLP^#s#<E0f!d91~Fm6fa2cg}A(hnNGH47SXUIr=yUL@`LPSc3eUS`eM
zhgUL@CM<Rup0)kJgu@X_)H(tKbPBS582CoR>9~YamWNTQG%8M81!nFPBWc=JsxZ#7
zGRrhUFU#a#gF((ejRu`2%kl{g$~5hzsaZ*b)cJI>rt!%Xv!Uh^RQu+0bD3s&ceI-u
zGhULLq0YvOf=M)WHdb^T;2gM_l1Rwxq|J;*Z;5CebvsQH-#5wWa6&^}XXAMs+mbLS
zielWF@v(H_WNc*3N_AXx)QKEQX(~G2L3K2RA(0a*O=*}))7D3MS-Ea?k(c=GtgR)y
z?;Mdyfxm;CwbA%&#3#l&CRu4UgHb8bSdB9CO>Dwuq6oc-sy=~<Rn<F9^X`PLj~Kb*
z?|EFHqOjC8HcpnA)heP@QQHdX2z>1|GU_TP`6RYJo{D<VQcIjJIiAO+a-JszGWB5~
z1)AfdGv!y%zNbqh{!tm0u%SFv<GB_J8WoCWk;~)%_8;E?J}I`sVVLk~OUzq4_X5k3
zII%~Ek5S2gDsk~u1oO8cu8Vq;Gt)DZ?$xZTyn(nI56qD`P`cT|lSTh1;S1Hh9}Cki
zq|wKJA+5+co49*CgZVnCLX^rEA(HLny;hseaaJIVYhY-&29(13gz|Z|!1D$h@v<cE
z=q1gaCHE$;!}qSaOL(0M@H!Qcxie!QJ{^2agpGYFz&;f)b8W_7w`Ox?GoBD1j#}SS
z0)$OIT#n5FVRL|eDqs}Vr?c5;G=<Fb{G`LbL&lPn=TRu`j=Bbzy3&}ri$Fe{_Ri8*
ziI8zivV1tphSglcc2|yUf(1-n0gk!?p2u-pvqrN~0bv{;Xm{NwTEBs#ELPiNuPIr_
z-dSoL3ly~j?9;OKkpej&J`RYF1L0s2$d#k2AW`>Ze<UtjAf-{|wq`nlnvWDnn@Oe>
z@c3MDH;pS)==umXTbVnH19d>C9gsjPV9k8BlDX^kt!d0y103D39@6^zWjs2yk^4IC
zYq?KxKdhvy)VPW9H1`?qd%3R`7xcFQ5l+S_I2BEthSPBdVw{Pya5k3V9Gr{u(8Bq+
z02g8i7vW-Df&`c1GF*-}uE3SJ3MsC}HMkZTuEX`X0Xc5Oa@>RtZpJOR6<yqh+i?d9
z+=;tzH->Q!?!|o=!Topu4`LJ#;bA<2F+7UL@Hn2plXwbGV;s-mSv-dcJdYK40W0w$
zUc$@h;T61!*HGehyrHr<?$F<i{ucDNO0NBB^tYqGgA?D0{w{v(;l58cLTzDxMyUD+
zWjLg!M?kAUZ-Q2X-U3a6-Uh7!y#sm|^d9Ja&<CKkpbtSGfj$PU1APKo5Bd}|1^NuM
z0rWX&Bj^jzm!Pjen?PTKz5#s;+6>wP+6vkRng(qL?ErlT+6meP+6~$R+6&qT`X2NH
mXg}yj&`+SBK{KEOpkF}0f)0Xy1N{y<1Ud}*1N0~82>t@jmacgK

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn7x14b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn7x14b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..a473750d7816a1fbf8dd3b58a859e506d5aa2b63
GIT binary patch
literal 4167
zcmeHJOOzZ_7%nRob*y`lMKIp4LeLly?-B2J5ELSUMvI`(av~yL!HB^i$YT<TBm@&e
zLhAINWi7L)MIUEQ*0bnkFY4s;{rBE_bTUHNIqvCO)!+T!k9%(|+&+7`$1$Dr2>rvy
z(R}GVQnBYPo^Qrtiz?5R14ETxg>blkn`zoSTp2I0quVFgwTo_TrsJ`%nReB!?eF94
zQ*r><e*m5WI-ULYx^C6J`n5RgeH_6QivR9Xy%C1JFwFjvKZv4$hIDeI9Hq$6P?p)L
zYeCS8!<yf7tl{3YSzk0>v+P>2-;>1lgho+nsRco(BM6jNUplyGSsL~I^+v%R1X)#<
z>&<4t>KzzPvuOl<-{=eD*uW_1bS5X0$N(>BcGVvz8YO-$2xEsbzgGACoU>M+Gn&yg
zE0@J_ucXz(xR)e3C*@33mNVjdNz=bAzh*sC_sQh^ERc&xT?uNw)#7P%Wq>g$bkxwI
z733^x<k3Q>(~0AjAqIpQZCWk8B;haVSv1I$#Bn%iQ8y(eNxK$ld?Y%H4#kBWIU7!n
zf7O7q!1`43>FX%+Lgf<^G-I`>Z4PH4$+C);WHRfNIvIivS1}U+1+A8xX7gldg@sle
zH*3D{qII4zQ#!25T&G1*g{JQ0oKc`z%uzy^HzE5$+t<brnLgHsddkF_X7+s*jI^oE
zFi}vSRoDO2P0zyiFGhZgEo0YM6m``_<avxRFSO??U%^R}39IJh2E)uamut41zVXHB
zv<@+_ZdpGzdt|*fT@lADV3A$JSL_@%=UyGT1><KCB-2;a&+}{yc?F#>CQY8#nb44O
zEv>j&&+ErDYYc-qO;zT3vGvUB=Xrbf?9H;tg3}bRKt|5SPOr=TK1~Ck(8o0L>e~(#
zw9ASo6wb>=_4WVw?`J@_I`_Znty;})IJf=#Z&7>7=Pl1uA}cQ|Z5-242j{DLqmmje
z8yOoLS!Q<T!OY%3BW(;!v2K>KKO^+5|D&%b&(kaBUyb6<JCv5;w2=-UieXBcsZkj3
zVb((CnWs%=&ucneLCv&^7VW4a@>e(`mao*}d4o}!W@*~7*7JK)BceSXv%D%z@@cPv
zXs?23p@LLSyTX2Xs9cFuu0$$VBA%X&#$=<hpsT(x26t5|qE2(r+FOk}D~LKPh;kJ~
z3l*fAO!)f8^Nz~Dmu3;rf;n~z3l&5Q6-1pCL|=&X;#8Hq9D7Ra#RjPHlrS|&gD7u2
z4WdN+609H%qNFvdw0fgnrBU&M8Le&G=30CCy=gkqB#nh>8JbC2flSg0#GP8XQz_Tg
zvY5K-?x-NjRS@M$G^1vG&Tm7;U{Ya^4daU@s`RBmc>yggFQ7#lI~kpv`4r4}+_-49
zf|E%!OCc>Nqq{e4S#p#Y&}M=<r{eUDMfc6Xwx`a5lQdx8M=PPDy-lC{Mn*Y@IahFw
zaPBgzOU!c>@fhbg=N8VTDuVVpU^<S$u{aI`I36e9M4W_^aSBewX*eBc;7kNK3uogT
z%)q%g59gzf3veMW!XPfjOk9FlxD=P+a$JEcaTTt{5U#;&T#M^)J#N5_xCuAo7Tk*4
za69h6otT5Wa5wJ3T-=NMa6dvkfCupq=HX$?$0JyPNAVaQM*~mbNj!xnp2k8vgGG22
z&*6DQcmXfsCA9D|7Mmyz`Dm|3dkxxaHP-eR+UwEYz`!@6y@{{QoLe;!CWY;BRn^|1
zkDcc4ZpaeIE0Cp-S0T$FuR)eWUWdE^c@y#$<ZZ|b$UBgCA@4zkA@4(0LOy_uKt6<g
z1o;>;3i$-`DdaQAD#+)MFCbq+Rzuc6)<V`n#vtn<8z5gnHbOQ*zJ_duY=LZrd;|Fw
mvJLVb<a@{uka5U%$d8bpAUhyGLw<qmgzSR+3i%DP8-D=1AGVJG

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn7x14r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn7x14r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..1ce5d8e9c2cdb93ba13b2eb0178601f2b308d9da
GIT binary patch
literal 4165
zcmeHJTeBQf6mC^rWgb$hD^K%qD%BXYTZ{-AgGQsph(Y5ZI5_S{9B~_rR7AurIO2#P
z$mJvwNeB``LaJu{lawEjUy#pQYwz9NGZGPx%C6bF=iBRk*}Z$oo&_sC9wE;Y<PR?=
z@k8c`f<3R7>gX9%Sywl*%CAB=-oMQ(YaXwR7npHqK=6>+w0m<bk9o{7yLRvJ0Ox>`
zA#ivI9|2mOgZ2*DUGo^!VyzEw1V>Q(Pq*q}*bT$*uQeK0pcXw&o)RJ+6^<zC=})(U
zpp_)C?{^JvGPAW4<<m8#g`G~Pk!S6BmeZ<JR0{(3Bn*Q<c;z93H<juId7PJ#20^bX
z%Ph@i!Rif%(`>2^-&cKMk|>PRc0Qh_u>vn>b|gkC8mE3O2osBXey#5Nj<Z&evL3r;
z<a$ZcEot>I>2lXwoh+wO8P1sZOPc&``8DI2xX(=1&jQ(q#Fe1t8!ddU^k-4R6n0dR
zI$hMrV+-wkQIfQj7({6*C(_7u)0BT{*PszjNs@#k1&vABq(KrN6I~_@N=mtQ+OTpg
zq(|P$Nj8go`Z9{Vq*-Tdtdm(^#5NCWA)Ux`)?{hvc-}6N<cx>St_Hw@#-5{@JSnZP
zzzx}~aYqh#78qnyI-P=|$hDTBJkKW_Clfe}1!CwpxgVr`O$@R2u`J>#Csv!;_eC()
zu9iikV0}j2;3|in3p=<O`z>x6v&Ur+=WIlt#}T?hd%o}$oNO}X8d|xLu&2&B&4$xg
zU#w2!5C=9X;hBiI*{$Q+6-mMcEV8S7j*}I00eLtJ>Sqz8R!OZ1-NfK3XnoN%dETNi
z3CU?`NdaxNoMwq(#L*;Jmlw~g)=yAbKSo->K{*pUA1NuIiFTF*J|@d7=9Q-zB51Y+
zj|t?LnLPd<|NRWeQP)1;P=g>&lO&Dp@gKTH(>RKYj_021m6w$$P%X#IS9itq%*^zP
z;)D+g%x+|j*+Y8;G;LhKqx|_-Ur(M_voFr0Xg&5ezbcQ-#L+d5|7dBALN1KFJ~_|)
zRbt-PY_fuasEX!~R*@k&Io42-^Sn9rXl~Ta7McLuy(tl~J#$rR@_D0z*j@!WU~W8-
z)3z$)N+fb6a=?9~OlIjH?w;lt>{ThAu}*!_np=&1sUX%_K`d86j%4IS6L+t>q5Qbr
z&hzo{I58IVwOd%IAhu9J4meKpezph4v)7oY<PoRYD2t9NkRZw%Pl6~ATc{vUf+%R7
z$59lh-l$iQ=$)9obZTm`THvK6mrP4LQj^AIYAH>V=8)Q}+@g{vN0VevN|DT=W4RKE
zT#3Z95;f{w@zQ<Ga133|np$@S<UZ!%3aH5VQkByJ8cvD5)Ty6>J#KE*;(1&_E}+&=
zyjF8Xv?US?B@(YIh<!20SBvgD#N5=5lWD-gHLD?`zf0DG(`$K7@m$4on&*DqU8d_g
z#xp#3^W4F6xrm^@2?%jAPQj^Y;53|$GZ5iSoQ1P-4$j3~oQEdP$2?qs`M3}l;bO$N
z1efA6v~W4Dz?DdF6|TlLNO3K$!}Z8;0~X*$v~d#_;%0Pk3vR`2$Z<RFz?~SyUAP<f
zU=i-ceYhWEcmNOLA&lc;Jc38@7#_zHcoGwM3XAbHCh-iG;8{F}=kWqwL>DjNWxRqO
zUd2+4;%}G!dh|D-zfofC&!E2<{VfvtHlEvg?i8R2?C%yu{k^j6)4vBm%RsMzmV;gg
ztpL3NS_yg+^cLuC&^w@aL90OTf!+sw0Ga}Q2wDyL2s91)7_<iT31}_oQ_yFi&q3=z
zUx2;@eFa(%+5p-J+60;bZ3b-teGS?Q+6MXtv>mhqv=j6#=sVCZ(D$GpKtF<ZgZ6-a
Y0{sly3;G50D`+2RKj=5m@1O(t69}Nv*#H0l

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn8x15b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn8x15b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..6219e99587aa27180e6191a3ab2f71fdbaf2221a
GIT binary patch
literal 4423
zcmeHJNs|;s6mB_GaHzm*g>*C{?t9B<*+^L^Dk=hsiW@E^t%cgn%m_NPPFszrxS=AB
zh>FTCtD=IUphWch6W)yAS8)4$FPEw;m>|MAlQWr>U%vglTzb{f1?wx^2Do1!6CN()
zkMya6xn=WI%QSMwrTa^NE@?9JC{5F75`uwgr^~XZ^|D=@VcGO|hF-UeC^K83iNBb5
zxx8vMpJDg3UDw|;R2etQJV9CU|3}rZUhmfH6IAeQT|pEDY*4ziHa9)fV;J_-zd}I}
zCrRXaUBlg2ITTH;%~>{0^ETS;#_W}8I!8kZO3&2j2SHt05cq=SD~(qTQ&{a)Lo*kL
z0!dDeWzuLA+?BJUYcveA=P9-IBvA`dIy5von(wrr(P6!T6^~NS59*19ndetMFK70q
z)xxyrc}8=VBwdHfa$RQ+v#bizF!T0yceu=Bwq>Xs49{|(EwllOQ-N>o@}X4!RyJW8
z8`m(Jue91+#m(k$t2LY?b2T|&!x`H)vfVW0|FmmhjkA;_^_qd5Hq+8}$3Tgf$$4@#
zOdQ!X4XrE-iXCexlPni`_M{c(y~#${SktHyC%9Qd%{9GNlbfM7SC0*^D4=ALo4q<z
zI4o?KE!8AXQ8_9@<qh2Mc?TP4&!2%>ajsdz$d*hzYW3Dwufzp0R><;6vQ?;LdM}uW
zVzu>Uh!s1hTpa+tv%2ae$e{h=k{PAtkGed#^ySq`<i)(T^djd$BF^husc^(eVyIjK
zX3d#dBucr)hFaq*L;0EO*UX+LskWMpYaD1t!p$_Z?^hxdg=`*XZg)nwz?!N!3ua#I
zwWMh(kILsFXh~~c1w)mMsQIl|o`ypsOfe*0iIYY(udj)yra5^O#Wq(4=Jl;qxV~KA
zoVgiRtD!BomDSl`p3J#7rb#MBWRSa1zP5=nO^}rlftA_4#p-*0IG+K|fZQ2@yu&>A
zeSKc}JgIiZQ{IfjW;2ZKp5#N41$@zJUbXM^?lTMSC%>r7Vs+-CB}*2~thzj<`Sh?I
zPA{#LfI0Z3wF!Y7X1PEn(Tdk{62ex*_ZxP4&M!wBmVW!3le<Jz6|5)ABmP-aaUWa`
zz=d+L8!Ym(vV|_>3c1XjH+f$&PM<M0BWe$K+wEZk?b|H@vR%H&^T(R)x=`$Dtg6Ne
zU8>0H>q=2Y)`3b^;at|CvMW(II5s#KsuD{?=Cu|lS+lyz%?9xJk&ye>K+&vmF6%&c
z(q&dLr;*6$Hl-G>Xth>{(EwvMq!sI(#v!;+gfv!$ShGvj%<kK5p3p=a5;x>$k=Yv(
zlk?!Rv;$R01y$1FP}!^lt6^AmpfWZ(eeB<VY<=z9tv9gBC6_JMUWwh}?bfL*s495{
zWZ8}sO;wODnGzIPm&&pZyvSDp*dr_vbyfDX8_Fxj=71}&a;Uw^p~{BH8fN8W0o6sA
zsoPNNo)Sxe;{k=(kcis1n+-Wo3^`Ep?802O{7c6CqR5$<3Y^-!3DWw9Wjr;$h5JVC
z8@P{iKcQCFs&OmhUEGgwKgfNZh@ig{7{JAtiA!)PF2m)x0$1WHT#ajREw01$xB+$C
zh*=oKO}H5$Zb1XHaVzE^!fl8#7q{aM%)_0y3wL8a?!mpd4-0TV7Ge<=;{iN~C3pxA
z;}I;yqj(ID;|V;8Wq1lt;~6}Q1kYhPns^>BAjJy2h?np(T4-Y>hA@l~yn<C&jaTs+
zMzIDRypA_8hA!SjrlL6K(BFpscJy~hto>c+??!(Q2fi2mef&AV{g5O=rLccQRP~R^
za9mAKg4TlG0<8nR4SEOkE@(aIJ<$804?rJ+J_2n3eGK{p^eJc~=rhnJ(C46W&=;W1
zpf5pNKwp8r27LqC3i=lG9q4<|Hqds^4$w}}F3@h!9?%b<y`X)d{h$M&gP=p8A3;BX
l4ugIM{Q~+GbOdx1^c(1R&@s>-pg%#!K_@_ef&K=a#D781OWyzh

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn8x15r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn8x15r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..0054a2b4f3ed691ef2bcd72e08ad90c94e0ecdb5
GIT binary patch
literal 4421
zcmeHJ>2nlC6d$&>sG%waBbBn&s#MslD+Ui-5FzNe%#O>t8xtX5yblBqyb%wA#syLF
zLPbPGMdg-LQ9)5qs`mXS{1trr`CcEhJ;7L1KJ$|9nP0#Ab#K2}d#Zo4$CT$WNnUuG
z#t#|3V5VlQsHu@V4<AYWxvYu2_f@Oaz6mJ$hAyOaFX&~vIL(Ubr)0=v7m*g$%<*Q7
z$8guJ<uQIuRF*r&lnKLf&C@kIk@u-r1fxN)uy!fBfsp6P5Gpe1H$4}NP4%yk?|0|(
zU71Yi>$6g7^w0CJoYk1DWlQyXX-=b7Td1KntlxRg`o8kz`&n7b2Z72q2=W4%in(U4
z?VFh!cxaZHb2+wQS1vlAxtw8Tm8*O{iqt|F*ZP;Oj6=iqbG_oYY+x8?vVM@a)|y$L
z6HJ7&9i7E$GpizIg=Q3uI^0}78s*=LwcN~T&xz$Ybhz?f&SY(no(eaK*+QG3#1!aC
zDRUg34Uw_1SU@`pV}5V%U{|5CWN2vlV3ePs__<;n%THPhdmOODJZfM!S1F3}-3E?S
znHN__43vDCZ9N+pIl8sDV0BqhT^)v7mMXXFoDpi*Dz4Votf^ORR1yS}byQh3+-OuP
z6=N!1xvam&<_(leGTE}LbXa)|H=9uliraQnj-paWCS%i=BPL{Ywc*6Fz+y4kBMzw2
zXbi7Pgqg*~HLy}CbULOssACmv(A;iy^kvf3;*zT$fIe9xDh8Q!;e+0)F`9m;%fmet
znjL1!e6;jC*FiE)_Sf^mIErjWyag<p2(wBU^QIczsX@?GaVB21a3&+Aww6u4T(drj
z*ywU1U0F?iTDV$Yy4voql57jJz`BM|;z-48D=ASi+5Pq8%yLG_7Tc)w279whd8Wiv
zSvJ`2ugPd?!WB!lR=k+nU(ZYJFLTufkI~iD;6=VFl6zyal%gb)+=cSAB-$&asvR<|
z5a{tGsh*do%N5`X=>E&6gWvfF)u`7Se0l29jBVv{SS*Ig4~4IsvY*JRbEi+=MRiSg
zbzyfE28V_Q3tbn9>V+xOi}m94DdTW?xj8;7&6((DUfRmU5&tkRL0OXJlrKT@KSX4=
z_%h&P<^%5J{0-IAeIe_oAb;Pu+_?iO$a~~+*^CR>?TlRS?B0?35)*;#-I5^tb(=N&
zbs_t8Av<zm;CpVfW?dKhohjIvh8#**=vm*>Q&876XXG|(w#=U+O!}CyWf!t#7hW|p
z1q+1~R5^2p?JSt=Cv_JVHyT5QFyaMHU)}7cYp^31a{4ah^j*k~#`JE}LdCF97*_{a
zVL&5x<u+V)<wADlLav7k*>fAp{yI=upFd?$y}m#@Ql6!E>jNx)on|e59VmVsD2^P+
zx~XQJ?%k~Ga#`1b(>waIZae0T+-9w!;^LTQt)gl}6;&HbH5gf86=WNFeERuTNj|r{
zOei1jYJb~1Y`-_m4jagh#BgjNTXvy64(0ThjQOHSgqaJR-?0rstrIez-@cQ_Rvue;
zZ0B)St!`BFF2?(LoaAwg$0kuhYaftD4+^*%MO=fKxE8&bh3jxVZorM0jhj%y9L&Yd
zn1@?19}Ccjg}4>BA;j${V-X@$5aSM1u^2Vni8>nS$6Xk}AnwKzEX5F(VL9%>Fz&^D
zxE~MTK|F+q@dzHpV_1R5u@bBB1fIlGcp9tm44%bvcpfj{MZAPHco}Q)3SPx)cpd97
zg7tU<Z(<a0p{cU?->J15tvzV%m0Vl<(K>+EK~DS-T8H^@l*e%?gesvJYMqwpjCwr>
z+6a0Zv<dVM=v~lzpv|E7K_7rV1bqbh7_<fS3FuSMXP~X1&q3QjUx2oQz69+6eFfSH
z`Wo~N=v&Y((08EkK|g?YgZ6;-g7$&-gARZWf_?-Y0v!e&0UZS$104tb1o|0t0`v>$
hSI}>ulb}<e-$8$XPJ{jg{RKJ$It%(6^bhD9{sop&ydVGo

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn8x16b.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn8x16b.psf
new file mode 100644
index 0000000000000000000000000000000000000000..4eb9107d3c38b3d5f62599a1be264719a00103d7
GIT binary patch
literal 4679
zcmeHJSCbS~6mDy)x_p>gee5cx7R8(gR@+6|Q4E+sMa3LON87N&&MLaB?l_B>6%!(&
zqLM@<7(r1`tLFR(-mKym_{iJmcW&sg%PPe)ck15h@8omt>D%|2y*IuVaGb(<f<ACL
znSVM@RLs%6%8af><#pMP@~_N2CX}RUnjDiRl_EP1PtiZ@=#it(_SpT;_VNzH^F954
z{_#KjjP3n-`|khn6g<^l7S9wppHF807#^x|t=6g4YDe7P>Gq-|Nh12y$<g8{3&rtd
zY^EhgQN7Vf!m#5Mf}!Oj$%z9C?(4VwAsQH(zdTJB7_14F>{X(O!Er=UMH%{U2I)>P
zu1;3tT!|L6UOB-$RjZXsMms{T)v8tK>kC6l(rKe%C`mdpl8%jKJsAy+(|Qzn8%auq
zsMhef8&;}e7-sTe|3I8hl49)#-A1ER<Wsf7me1s=Z*z9?=6xve6{mH&bo?MNq5Jqr
zb=c)=f~!Rp@1Ft;)khly4drP9)?Ttm)5-QXs5hJK;o;$SyV1D9NJJVym($7z8oZef
z53q0?wE>66TNFss*0{sWztQ3J5qR7v>ZfV!^;KEjd4F9~{k;CHB}ZPrCS8rvY17%$
zV03tY&6ShGO&yNkTrtspyns!8>CT@)CO0+U<TJjjsNrjlj?Z=<P5RmJ4rlMK!<00`
z+xO7#r-^NNa;1-t{KV8e*XIk!;c(Y=tIMx$-xgi#D#4vFuS^*B^(pSyw?|hKAx$g!
zNJCGda^qO3B&;(iV_ogr_Dy}hLBI-dI6n7Ar89Y&U<JA9jz7SY$A+AR;N-(lOGHar
zVGhe@-s2|yuEmu~koc6e#VF4P$oJn0Q^UzqWRm^NVfDF|>=QFS4!=L1uRUv3viL%a
zM@Gr=Op@xR0en4tegjsRt1<8E=W*iqGYHrL!)$<pylH>}Rtt4oA5wW@Wam%6sm(uT
z)f3h{_=R}XJfCFNQMEWY(VnpZlz)62ufUWF=+P6IdjJ`HNZI^6qg(?|yH7OhakClM
z^Ybi;y8QWm*H$!kGD^vvfA2G5b<V;iOP4NLIH#JCrajDxTk))E)SQr?1vzb|Cp``F
zvtTBv8R>=Z^o%k`$EZ|>j!uxbvX~V(TH$GOx)D538jmDA{)5u@p4pVJem#`XWs%g*
zyzb%>Cbc9_QFE4gd8*7#TCH}c)f#beWcLTnm;U*w$nOjEU&892gzP>+e<i-^o3qZH
z|EgcaM&A-lPpE#8&zO>UaByO9Fg86fcXCnSFAN$l?c1+~>yeOOBR!lsjJ(=+1cS9c
zMNEGsd0PWhBl{SH<d2N0y@vH?jC=dcr-ap?BN%_QU*cQ&(*41HUs*xtkp9e#&GnCF
zSp448LJ^w;3w)Dc0n>d^z8c5XA~rt9W=;Hk@L=2d&+ZSl-))7tsddX&|AqU5D{#)Y
z70ogA$IXtqcb@u1tolW)@fPvC>UhO|?@c{TgLiC6i}8?R`GJiu!!EuI=MCWGZM+$u
zM)~@6b@788pbcR5-*g;>Ir4fGvHB}w&8LJJpTkq`SMGk3%PSu^w0<pg^nTFw(7Fwr
z?{lu<T*rC9P*<6CBk?xQJ)FBZSE~woTY*z>D(2ucoQ^YaCeFgyI0xtAJe-dUa3L;2
z4RbLMgSZ%%AjYK_!hBqY1xRo?>bL?|Vj-@=)wl-NViB&x^|%2y;wCJ{65Nbia4VML
zHr$Rounc$NF5HcKa4+t|{dfQm;vqEfFdjh@kK!?;cpOjQNj!yNw6Gi_Xk!#l;~A{L
zvv>|;Sc!2wj~6h34qimpWbvO%Zxec((c7ZA_O_w-6?)s5_&4Z%%fFqRyR{IeguOj#
zs<%&<{pRs6$STN7kkycvA+JDQg}erN9r6a`O~_l2w;^jF??B##ya#z7@&RNm<U`0h
z$VZU%kdGl7AfG@!g?t9t2>BfH1>{S}Cdg*U7RXk}Hpo|y?U1h_-$1^F?11cq?1Jou
qd<Xd+@&n{Y$WM@;A$uTuA-_O=h3td;2KgPbA94Wl2jox4U-%c{Lwsfc

literal 0
HcmV?d00001

diff --git a/Kernel/Files/tamsyn-font-1.11/Tamsyn8x16r.psf b/Kernel/Files/tamsyn-font-1.11/Tamsyn8x16r.psf
new file mode 100644
index 0000000000000000000000000000000000000000..6fd82c17f4790afe97c764d6a70be95cd30b33a1
GIT binary patch
literal 4677
zcmeHKYjaaY7!H{Xp3XRsVLDF6iS;x@0WVk(p=gZhF_xrKp<opi6^r+4#S2AiL{wBn
zMMOkJ<t|r61w}!b$@@nfeg)qipS_))EeIX>%4T-YdG@`(`|h62ilaSiQ*0soIQ7CI
z%ZKWL!fcI5w}wIf*uUTZ`P2(Soz-f!^MWKP6qt5;l>BKs??RgBuzgN+{1(H}-TZl;
zI1fE0J9|#Qea8M-JX&Au&nP(;Pptm}Uh;)7JROEB){jj#s~amsl}IX8Wb*}!#Rlit
z&2$j7g<(FOE(O-vj(X3m;EHMW@rK?}tJOMY)VsUqYOJ(-`Z7UaOa?(l5yEWNBq5s(
zEn_j)$R(U0`E7PfbdOw)iX1pgE$4EEm`-Q3$uO)`^h_!0?pZVtMI|d7<fdu|$`+R*
ziUirv>1<>IhMSK0Gncm(tBp)Xdrz50r81nP=V@q|JIv{CSO=W5B}Gfn)q9yHNA`$z
z-T6-o7Tb80Z<R1>vS)mztIk`M&>*7&Ff@ikiFkce`9jx%zP`T2y_N84&5<k80d*!A
z{*>}vcZ=H?4_nw~@lcfvQB)nWnDJMJ*_{UtR}%8wQB-j9N?0F3mR{D`4}!AA%%w_a
zoWH1ATexgtt?K+!&Zy?>buI6&*SpxPd^E7AhxX!lRDM-+>!D*)3M_w2&!qK?rqi6W
zS7z+FOgcSm`Bg3IX0g#eqF>`;F<w9ATD@NHUvBxkx(cm9Ya#YmW2Mm2S#R7SVQAxP
zGrL8NI)n5^Z<!2TQW8VP88zw^$xf|WMQ1$JDdZQ9VJW54W!9hpOpM9^Yao^{MVxf`
z<Jyp!&GM6r8RVi{JRzHH7?)#t%b!lGC5ZLg{4(xN9fFnTzRGiR>87>>`B?yi@%kHP
zN{rZF$@H?t_Kg2-{j`7d*R6j_S2*LNW+M{&rxTh=P45U*i}jUt0l0j)_$I`3osL94
zh!g9dO6dZK*PqxFz-W1sAI`D@xWyZq&UCW<t4C!~r^*e)gZlk4Jq{`f9=+;usa?vz
zSTmr$(7M3XCn^Z?1@4SO-W^D1+$W+E?*pZHd#P$J^XJYlRf<|qJd^OFP)Gpt$`4X+
zUte!mA%6zRPP9xa){2u_{*TOgvscc+kRV;ueKeuxqF;lcV{AH9@Jzwjn9stc7DAmU
zJOaZkZxiY|$1_TCW&$7c-sRC}&i65IfgYW@JWQ1nTU(1$O4aH->q&fnQ1Q~fyC3K^
zqkRw4zK3bg!`UF^-4`hDVaj`$_2yyvR4TN$uWD~E=<fmJ^X?1O&w5nNlq2<fnEE|T
zc@NWH51Sn5^WLT-9p67IoMAr9*Ta6FXwSp6=V9viF!@K{A1eC$&99p^Sc<CiDN|iy
zFfDrDdum8x8uTy&^f3P*B(YlmB-S=&x6EBotIe_YDIf7biTH;>)w{Bvye}yG39RiW
zu(p@PTp|Cy;A184(dlmzw~W7X+*Om~^-Zbxy!!(6(;qf_Uoif~*!mY^ogc;S_*H(A
znEOSaPw{;)l`iQ&Af<{<P+S3JlP}uS;`TnF>?N_vhlfY_&HaI?UOK?|29}!p%?Q7u
z1E)4`glf&hYCN@R3;PE4_3WG2Pw3gzdfZC9i~R`uLH0FD1kIg5h;|e(8AV)!YcT~=
zF%8$@dfb2;F&#Id12ZraH)9rV!EDSyC+6Z-+=dcvM;UjZf-Xe36II-WZp=dsb@bqF
z%ttTo!2&Eq9~NOT?nOWD!~Ix-2k;;s!cshpNAM_?;V}$gIUdIocoI+HX*`2x@f@DV
z3wRMPVGu841zy3ccnz;(C5EsHZ{SS~<1I9F6z3e8+tA#O<_;BWa~GPs(cHtp_oBIv
zj|1$7R3dZ=m7?Y`H5}KkCn2jL??Bc--i5pec^|SC@&V*S$VZTMkdGnjA)i1#g?t9t
z0QnrU5%L9O6XZ+CX2@5NEs(Dv-$1^FY=wLW`5y8EWE*5VWCvs?WEW&NWDn#=$X>`k
y$bQHH$U(><$WM@;A%`KqKz@b%1~~#b3i%!K2jm#!Psm@8<B$`OzajrXPU1iHW7)a@

literal 0
HcmV?d00001

diff --git a/Kernel/GUI/GUITools.cpp b/Kernel/GUI/GUITools.cpp
new file mode 100644
index 00000000..d62d632a
--- /dev/null
+++ b/Kernel/GUI/GUITools.cpp
@@ -0,0 +1,218 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <gui.hpp>
+
+#include "../kernel.h"
+
+namespace GraphicalUserInterface
+{
+    Ofast inline void InlineSetPixel(ScreenBitmap *Bitmap, long X, long Y, uint32_t Color)
+    {
+        if (unlikely(X < 0 || Y < 0 || X >= Bitmap->Width || Y >= Bitmap->Height))
+            return;
+
+        uint32_t *Pixel = (uint32_t *)((uintptr_t)Bitmap->Data + (Y * Bitmap->Width + X) * (Bitmap->BitsPerPixel / 8));
+        *Pixel = Color;
+        // Bitmap->Data[Y * Bitmap->Width + X] = Color;
+    }
+
+    void SetPixel(ScreenBitmap *Bitmap, long X, long Y, uint32_t Color)
+    {
+        if (unlikely(!Bitmap))
+            return;
+
+        if (unlikely(!Bitmap->Data))
+            return;
+
+        InlineSetPixel(Bitmap, X, Y, Color);
+    }
+
+    uint32_t GetPixel(ScreenBitmap *Bitmap, long X, long Y)
+    {
+        if (unlikely(!Bitmap))
+            return 0;
+
+        if (unlikely(!Bitmap->Data))
+            return 0;
+
+        if (unlikely(X < 0 || Y < 0 || X >= Bitmap->Width || Y >= Bitmap->Height))
+            return 0;
+
+        uint32_t *Pixel = (uint32_t *)((uintptr_t)Bitmap->Data + (Y * Bitmap->Width + X) * (Bitmap->BitsPerPixel / 8));
+        return *Pixel;
+    }
+
+    Ofast void DrawOverBitmap(ScreenBitmap *DestinationBitmap,
+                              ScreenBitmap *SourceBitmap,
+                              long Top,
+                              long Left, bool IgnoreZero)
+    {
+        if (unlikely(!SourceBitmap) || unlikely(!SourceBitmap->Data) ||
+            unlikely(!DestinationBitmap) || unlikely(!DestinationBitmap->Data))
+            return;
+
+        // for (uint32_t i = 0; i < SourceBitmap->Width; i++)
+        //     for (uint32_t j = 0; j < SourceBitmap->Height; j++)
+        //     {
+        //         uint32_t *Pixel = (uint32_t *)((uintptr_t)SourceBitmap->Data + (j * SourceBitmap->Width + i) * (SourceBitmap->BitsPerPixel / 8));
+        //         if (IgnoreZero && (*Pixel != 0x000000))
+        //             InlineSetPixel(DestinationBitmap, Left + i, Top + j, *Pixel);
+        //     }
+
+        for (uint32_t j = 0; j < SourceBitmap->Height; j++)
+        {
+            uint32_t *Pixel = (uint32_t *)((uintptr_t)SourceBitmap->Data + j * SourceBitmap->Width * (SourceBitmap->BitsPerPixel / 8));
+            if (IgnoreZero)
+            {
+                for (uint32_t i = 0; i < SourceBitmap->Width; i++)
+                {
+                    if (Pixel[i] != 0x000000)
+                        InlineSetPixel(DestinationBitmap, Left + i, Top + j, Pixel[i]);
+                }
+            }
+            else
+            {
+                memcpy((void *)((uintptr_t)DestinationBitmap->Data + (Top + j) * DestinationBitmap->Width * (DestinationBitmap->BitsPerPixel / 8) + Left * (DestinationBitmap->BitsPerPixel / 8)),
+                       (void *)((uintptr_t)SourceBitmap->Data + j * SourceBitmap->Width * (SourceBitmap->BitsPerPixel / 8)),
+                       SourceBitmap->Width * (SourceBitmap->BitsPerPixel / 8));
+            }
+        }
+    }
+
+    Ofast void PutRect(ScreenBitmap *Bitmap, Rect rect, uint32_t Color)
+    {
+        if (unlikely(!Bitmap))
+            return;
+
+        if (unlikely(!Bitmap->Data))
+            return;
+
+        for (uint32_t i = 0; i < rect.Width; i++)
+            for (uint32_t j = 0; j < rect.Height; j++)
+                InlineSetPixel(Bitmap, rect.Left + i, rect.Top + j, Color);
+    }
+
+    void PutBorder(ScreenBitmap *Bitmap, Rect rect, uint32_t Color)
+    {
+        if (unlikely(!Bitmap))
+            return;
+
+        if (unlikely(!Bitmap->Data))
+            return;
+
+        for (uint32_t i = 0; i < rect.Width; i++)
+        {
+            InlineSetPixel(Bitmap, rect.Left + i, rect.Top, Color);
+            InlineSetPixel(Bitmap, rect.Left + i, rect.Top + rect.Height - 1, Color);
+        }
+        for (uint32_t i = 0; i < rect.Height; i++)
+        {
+            InlineSetPixel(Bitmap, rect.Left, rect.Top + i, Color);
+            InlineSetPixel(Bitmap, rect.Left + rect.Width - 1, rect.Top + i, Color);
+        }
+    }
+
+    uint32_t BlendColors(uint32_t c1, uint32_t c2, float t)
+    {
+        uint8_t r1 = (c1 >> 16) & 0xFF;
+        uint8_t g1 = (c1 >> 8) & 0xFF;
+        uint8_t b1 = c1 & 0xFF;
+        uint8_t r2 = (c2 >> 16) & 0xFF;
+        uint8_t g2 = (c2 >> 8) & 0xFF;
+        uint8_t b2 = c2 & 0xFF;
+
+        uint8_t r = (uint8_t)(r1 + t * (r2 - r1));
+        uint8_t g = (uint8_t)(g1 + t * (g2 - g1));
+        uint8_t b = (uint8_t)(b1 + t * (b2 - b1));
+
+        return (r << 16) | (g << 8) | b;
+    }
+
+    void PutBorderWithShadow(ScreenBitmap *Bitmap, Rect rect, uint32_t Color)
+    {
+        UNUSED(Bitmap);
+        UNUSED(rect);
+        UNUSED(Color);
+    }
+
+#define SHADOW_SIZE 12
+
+    void DrawShadow(ScreenBitmap *Bitmap, Rect rect)
+    {
+        UNUSED(Bitmap);
+        UNUSED(rect);
+    }
+
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wstrict-overflow"
+    void PaintChar(Video::Font *font, ScreenBitmap *Bitmap, char c, uint32_t Color, long *CharCursorX, long *CharCursorY)
+    {
+        switch (font->GetInfo().Type)
+        {
+        case Video::FontType::PCScreenFont1:
+        {
+            // uint32_t *PixelPtr = (uint32_t *)Bitmap->Data;
+            char *FontPtr = (char *)font->GetInfo().PSF1Font->GlyphBuffer + (c * font->GetInfo().PSF1Font->Header->charsize);
+            for (int64_t Y = *CharCursorY; Y < *CharCursorY + 16; Y++)
+            {
+                for (int64_t X = *CharCursorX; X < *CharCursorX + 8; X++)
+                    if ((*FontPtr & (0b10000000 >> (X - *CharCursorX))) > 0)
+                        InlineSetPixel(Bitmap, X, Y, Color);
+                FontPtr++;
+            }
+            *CharCursorX += 8;
+            break;
+        }
+        case Video::FontType::PCScreenFont2:
+        {
+            // if (font->PSF2Font->GlyphBuffer == (uint16_t *)0x01) // HAS UNICODE TABLE
+            //     Char = font->PSF2Font->GlyphBuffer[Char];
+            int BytesPerLine = (font->GetInfo().PSF2Font->Header->width + 7) / 8;
+            char *FontPtr = (char *)font->GetInfo().StartAddress +
+                            font->GetInfo().PSF2Font->Header->headersize +
+                            (c > 0 && (unsigned char)c < font->GetInfo().PSF2Font->Header->length ? c : 0) *
+                                font->GetInfo().PSF2Font->Header->charsize;
+
+            uint32_t fonthdrWidth = font->GetInfo().PSF2Font->Header->width;
+            uint32_t fonthdrHeight = font->GetInfo().PSF2Font->Header->height;
+
+            for (int64_t Y = *CharCursorY; Y < *CharCursorY + fonthdrHeight; Y++)
+            {
+                for (int64_t X = *CharCursorX; X < *CharCursorX + fonthdrWidth; X++)
+                    if ((*FontPtr & (0b10000000 >> (X - *CharCursorX))) > 0)
+                        InlineSetPixel(Bitmap, X, Y, Color);
+                FontPtr += BytesPerLine;
+            }
+            *CharCursorX += fonthdrWidth;
+            break;
+        }
+        default:
+            warn("Unsupported font type");
+            break;
+        }
+    }
+#pragma GCC diagnostic pop
+
+    void DrawString(ScreenBitmap *Bitmap, Rect rect, const char *Text, uint32_t Color)
+    {
+        UNUSED(Bitmap);
+        UNUSED(rect);
+        UNUSED(Text);
+        UNUSED(Color);
+    }
+}
diff --git a/Kernel/GUI/GraphicalUserInterface.cpp b/Kernel/GUI/GraphicalUserInterface.cpp
new file mode 100644
index 00000000..b93dfec6
--- /dev/null
+++ b/Kernel/GUI/GraphicalUserInterface.cpp
@@ -0,0 +1,665 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <gui.hpp>
+#include <driver.hpp>
+#include <task.hpp>
+#include <debug.h>
+
+#include "icons.hpp"
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_start;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_end;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_size;
+
+#ifdef DEBUG
+uint64_t FIi = 0, PDi = 0, PWi = 0, PWWi = 0, PCi = 0, mmi = 0;
+#endif
+
+namespace GraphicalUserInterface
+{
+    void GUI::FetchInputs()
+    {
+        MouseData Mouse;
+        bool FoundMouseDriver = false;
+        if (likely(DriverManager->GetDrivers().size() > 0))
+        {
+            foreach (auto Driver in DriverManager->GetDrivers())
+            {
+                if (((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.Type == FexDriverType::FexDriverType_Input &&
+                    ((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.TypeFlags & FexDriverInputTypes::FexDriverInputTypes_Mouse)
+                {
+#ifdef DEBUG
+                    static int once = 0;
+                    if (!once++)
+                        debug("Found mouse driver %ld", Driver.DriverUID);
+#endif
+                    KernelCallback callback{};
+                    callback.Reason = FetchReason;
+                    DriverManager->IOCB(Driver.DriverUID, &callback);
+                    Mouse.X = callback.InputCallback.Mouse.X;
+                    Mouse.Y = callback.InputCallback.Mouse.Y;
+                    Mouse.Z = callback.InputCallback.Mouse.Z;
+                    Mouse.Left = callback.InputCallback.Mouse.Buttons.Left;
+                    Mouse.Right = callback.InputCallback.Mouse.Buttons.Right;
+                    Mouse.Middle = callback.InputCallback.Mouse.Buttons.Middle;
+                    FoundMouseDriver = true;
+                    break;
+                }
+            }
+        }
+
+        if (unlikely(!FoundMouseDriver))
+        {
+            debug("No mouse driver found.");
+            Mouse.X = Display->GetBuffer(200)->Width / 2;
+            Mouse.Y = Display->GetBuffer(200)->Height / 2;
+            Mouse.Z = 0;
+            Mouse.Left = false;
+            Mouse.Right = false;
+            Mouse.Middle = false;
+        }
+
+        Event eTemplate;
+        memset(&eTemplate, 0, sizeof(Event));
+        foreach (auto wnd in this->Windows)
+        {
+            /* On mouse down event */
+            if (unlikely((!MouseArray[1].Left || !MouseArray[1].Right || !MouseArray[1].Middle) &&
+                         (Mouse.Left || Mouse.Right || Mouse.Middle)))
+            {
+                eTemplate.MouseDown.X = Mouse.X;
+                eTemplate.MouseDown.Y = Mouse.Y;
+                eTemplate.MouseDown.Left = Mouse.Left;
+                eTemplate.MouseDown.Right = Mouse.Right;
+                eTemplate.MouseDown.Middle = Mouse.Middle;
+                wnd->OnMouseDown(&eTemplate);
+            }
+
+            /* On mouse up event */
+            if (unlikely((MouseArray[1].Left || MouseArray[1].Right || MouseArray[1].Middle) &&
+                         (!Mouse.Left || !Mouse.Right || !Mouse.Middle)))
+            {
+                eTemplate.MouseUp.X = Mouse.X;
+                eTemplate.MouseUp.Y = Mouse.Y;
+                eTemplate.MouseUp.Left = Mouse.Left;
+                eTemplate.MouseUp.Right = Mouse.Right;
+                eTemplate.MouseUp.Middle = Mouse.Middle;
+                wnd->OnMouseUp(&eTemplate);
+            }
+
+            static int Idle = 0;
+
+            if (likely(Mouse.X != MouseArray[1].X || Mouse.Y != MouseArray[1].Y))
+            {
+                Idle = 0;
+                Rect TopBarPos = wnd->GetPosition();
+                TopBarPos.Top -= 20;
+                TopBarPos.Height = 20;
+                TopBarPos.Width -= 60; /* buttons */
+                if (unlikely(TopBarPos.Top < 0))
+                {
+                    TopBarPos.Top = 0;
+                    wnd->GetPositionPtr()->Top = 20;
+                }
+
+                Rect ResizeHintPos = wnd->GetPosition();
+                ResizeHintPos.Left += ResizeHintPos.Width - 20;
+                ResizeHintPos.Top += ResizeHintPos.Height - 20;
+                ResizeHintPos.Width = 20;
+                ResizeHintPos.Height = 20;
+
+                if (unlikely(TopBarPos.Contains(Mouse.X, Mouse.Y) ||
+                             TopBarPos.Contains(MouseArray[0].X, MouseArray[0].Y) ||
+                             TopBarPos.Contains(MouseArray[1].X, MouseArray[1].Y)))
+                {
+                    if (likely(Mouse.Left))
+                    {
+                        if (likely(MouseArray[1].Left))
+                        {
+                            wnd->GetPositionPtr()->Left += Mouse.X - MouseArray[0].X;
+                            wnd->GetPositionPtr()->Top += Mouse.Y - MouseArray[0].Y;
+                            OverlayBufferRepaint = true;
+                            OverlayFullRepaint = true;
+                        }
+                    }
+                }
+
+                if (ResizeHintPos.Contains(Mouse.X, Mouse.Y) ||
+                    ResizeHintPos.Contains(MouseArray[0].X, MouseArray[0].Y) ||
+                    ResizeHintPos.Contains(MouseArray[1].X, MouseArray[1].Y))
+                {
+                    if (Mouse.Left)
+                    {
+                        if (MouseArray[1].Left)
+                        {
+                            wnd->GetPositionPtr()->Width += Mouse.X - MouseArray[0].X;
+                            wnd->GetPositionPtr()->Height += Mouse.Y - MouseArray[0].Y;
+
+                            if (wnd->GetPositionPtr()->Width < 200)
+                            {
+                                wnd->GetPositionPtr()->Width = 200;
+                                Mouse.X = MouseArray[0].X;
+                            }
+
+                            if (wnd->GetPositionPtr()->Height < 100)
+                            {
+                                wnd->GetPositionPtr()->Height = 100;
+                                Mouse.Y = MouseArray[0].Y;
+                            }
+
+                            OverlayBufferRepaint = true;
+                            OverlayFullRepaint = true;
+                            eTemplate.Resize.Width = wnd->GetPosition().Width;
+                            eTemplate.Resize.Height = wnd->GetPosition().Height;
+
+                            wnd->OnResize(&eTemplate);
+                        }
+                    }
+
+                    if (unlikely(Cursor != CursorType::ResizeAll))
+                    {
+                        Cursor = CursorType::ResizeAll;
+                        CursorBufferRepaint = true;
+                    }
+                }
+                else
+                {
+                    if (unlikely(Cursor != CursorType::Arrow))
+                    {
+                        Cursor = CursorType::Arrow;
+                        CursorBufferRepaint = true;
+                    }
+                }
+
+                eTemplate.MouseMove.X = Mouse.X;
+                eTemplate.MouseMove.Y = Mouse.Y;
+                eTemplate.MouseMove.Left = Mouse.Left;
+                eTemplate.MouseMove.Right = Mouse.Right;
+                eTemplate.MouseMove.Middle = Mouse.Middle;
+                wnd->OnMouseMove(&eTemplate);
+            }
+            else
+            {
+                if (unlikely(Idle > 1000))
+                    CPU::Pause();
+                else
+                    Idle++;
+            }
+        }
+
+        foreach (auto wdg in this->Widgets)
+        {
+            // TODO: Implement mouse events for widgets
+            UNUSED(wdg);
+        }
+
+        memmove(MouseArray + 1, MouseArray, sizeof(MouseArray) - sizeof(MouseArray[1]));
+        MouseArray[0] = Mouse;
+
+        LastCursor = Cursor;
+    }
+
+    void GUI::PaintDesktop()
+    {
+        if (DesktopBufferRepaint)
+        {
+            // PutRect(this->DesktopBuffer, this->Desktop, 0x404040);
+            memset(this->DesktopBuffer->Data, 0x404040, this->DesktopBuffer->Size);
+            DesktopBufferRepaint = false;
+        }
+        // Well... I have to do some code optimization on DrawOverBitmap. It's too slow and it's not even using SIMD
+        memcpy(this->BackBuffer->Data, this->DesktopBuffer->Data, this->DesktopBuffer->Size);
+    }
+
+    void GUI::PaintWidgets()
+    {
+        Event eTemplate;
+        memset(&eTemplate, 0, sizeof(Event));
+        foreach (auto wdg in this->Widgets)
+            wdg->OnPaint(nullptr);
+    }
+
+    void GUI::PaintWindows()
+    {
+        foreach (auto wnd in this->Windows)
+        {
+            ScreenBitmap *wndBuffer = wnd->GetBuffer();
+            if (unlikely(wndBuffer == nullptr)) // I think "unlikely" is not needed here
+                continue;
+
+            Rect WndPos = wnd->GetPosition();
+
+            // Draw window content
+            DrawOverBitmap(this->BackBuffer,
+                           wndBuffer,
+                           WndPos.Top,
+                           WndPos.Left);
+
+            /* We can't use memcpy because the window buffer
+               is not the same size as the screen buffer
+               https://i.imgur.com/OHfaYnS.png */
+            // memcpy(this->BackBuffer->Data + wnd->GetPositionPtr()->Top * this->BackBuffer->Width + wnd->GetPositionPtr()->Left, wndBuffer->Data, wndBuffer->Size);
+
+            Rect TopBarPos = WndPos;
+            TopBarPos.Top -= 20;
+            TopBarPos.Height = 20;
+            if (TopBarPos.Top < 0)
+            {
+                TopBarPos.Top = 0;
+                wnd->GetPositionPtr()->Top = 20;
+            }
+
+            Rect CloseButtonPos;
+            Rect MinimizeButtonPos;
+
+            CloseButtonPos.Left = TopBarPos.Left + TopBarPos.Width - 20;
+            CloseButtonPos.Top = TopBarPos.Top;
+            CloseButtonPos.Width = 20;
+            CloseButtonPos.Height = 20;
+
+            MinimizeButtonPos.Left = TopBarPos.Left + TopBarPos.Width - 60;
+
+            if (unlikely(MouseArray[0].X >= MinimizeButtonPos.Left &&
+                         MouseArray[0].X <= CloseButtonPos.Left + CloseButtonPos.Width &&
+                         MouseArray[0].Y >= CloseButtonPos.Top &&
+                         MouseArray[0].Y <= CloseButtonPos.Top + CloseButtonPos.Height))
+            {
+                OverlayBufferRepaint = true;
+            }
+
+            // Title bar
+            if (unlikely(OverlayBufferRepaint))
+            {
+                if (OverlayFullRepaint)
+                {
+                    memset(this->OverlayBuffer->Data, 0, this->OverlayBuffer->Size);
+                    OverlayFullRepaint = false;
+                }
+
+                static bool RepaintNeeded = false;
+                DrawShadow(this->OverlayBuffer, wnd->GetPosition());
+
+                Rect MaximizeButtonPos;
+                MaximizeButtonPos.Left = TopBarPos.Left + TopBarPos.Width - 40;
+                MaximizeButtonPos.Top = TopBarPos.Top;
+                MaximizeButtonPos.Width = 20;
+                MaximizeButtonPos.Height = 20;
+
+                MinimizeButtonPos.Top = TopBarPos.Top;
+                MinimizeButtonPos.Width = 20;
+                MinimizeButtonPos.Height = 20;
+
+                PutRect(this->OverlayBuffer, TopBarPos, 0x282828);
+                // Title bar buttons (close, minimize, maximize) on the right
+                if (MouseArray[0].X >= CloseButtonPos.Left &&
+                    MouseArray[0].X <= CloseButtonPos.Left + CloseButtonPos.Width &&
+                    MouseArray[0].Y >= CloseButtonPos.Top &&
+                    MouseArray[0].Y <= CloseButtonPos.Top + CloseButtonPos.Height)
+                {
+                    PutRect(this->OverlayBuffer, CloseButtonPos, MouseArray[0].Left ? 0xFF5500 : 0xFF0000);
+                    RepaintNeeded = true;
+                }
+                else
+                {
+                    PutRect(this->OverlayBuffer, MaximizeButtonPos, 0x282828);
+                }
+
+                if (MouseArray[0].X >= MaximizeButtonPos.Left &&
+                    MouseArray[0].X <= MaximizeButtonPos.Left + MaximizeButtonPos.Width &&
+                    MouseArray[0].Y >= MaximizeButtonPos.Top &&
+                    MouseArray[0].Y <= MaximizeButtonPos.Top + MaximizeButtonPos.Height)
+                {
+                    PutRect(this->OverlayBuffer, MaximizeButtonPos, MouseArray[0].Left ? 0x454545 : 0x404040);
+                    RepaintNeeded = true;
+                }
+                else
+                {
+                    PutRect(this->OverlayBuffer, MaximizeButtonPos, 0x282828);
+                }
+
+                if (MouseArray[0].X >= MinimizeButtonPos.Left &&
+                    MouseArray[0].X <= MinimizeButtonPos.Left + MinimizeButtonPos.Width &&
+                    MouseArray[0].Y >= MinimizeButtonPos.Top &&
+                    MouseArray[0].Y <= MinimizeButtonPos.Top + MinimizeButtonPos.Height)
+                {
+                    PutRect(this->OverlayBuffer, MinimizeButtonPos, MouseArray[0].Left ? 0x454545 : 0x404040);
+                    RepaintNeeded = true;
+                }
+                else
+                {
+                    PutRect(this->OverlayBuffer, MinimizeButtonPos, 0x282828);
+                }
+
+                // Title bar icons (close, minimize, maximize) on the right
+                for (short i = 0; i < 20; i++)
+                {
+                    for (short j = 0; j < 20; j++)
+                    {
+                        if (CloseButton[i * 20 + j] == 1)
+                            SetPixel(this->OverlayBuffer,
+                                     CloseButtonPos.Left + j,
+                                     CloseButtonPos.Top + i,
+                                     0xFFFFFF);
+
+                        if ((MaximizeButtonMaximized[i * 20 + j] == 1) && !wnd->IsMaximized())
+                            SetPixel(this->OverlayBuffer,
+                                     MaximizeButtonPos.Left + j,
+                                     MaximizeButtonPos.Top + i,
+                                     0xFFFFFF);
+                        else if ((MaximizeButtonNormal[i * 20 + j] == 1) && wnd->IsMaximized())
+                            SetPixel(this->OverlayBuffer,
+                                     MaximizeButtonPos.Left + j,
+                                     MaximizeButtonPos.Top + i,
+                                     0xFFFFFF);
+
+                        if (MinimizeButton[i * 20 + j] == 1)
+                            SetPixel(this->OverlayBuffer,
+                                     MinimizeButtonPos.Left + j,
+                                     MinimizeButtonPos.Top + i,
+                                     0xFFFFFF);
+                    }
+                }
+
+                Rect wndPos = wnd->GetPosition();
+
+                // Resize hint
+                for (short i = 0; i < 20; i++)
+                    for (short j = 0; j < 20; j++)
+                        if (ResizeHint[i * 20 + j] == 1)
+                            SetPixel(this->OverlayBuffer, wndPos.Left + wndPos.Width - 20 + j, wndPos.Top + wndPos.Height - 20 + i, 0xFFFFFF);
+
+                // Title bar border
+                PutBorder(this->OverlayBuffer, TopBarPos, 0xFF000000);
+                // Window border
+                PutBorder(this->OverlayBuffer, wndPos, 0xFF000000);
+
+                Rect TopBarTextPos = TopBarPos;
+                TopBarTextPos.Left += 4;
+                TopBarTextPos.Top += 4;
+
+                // Title bar text
+                long CharCursorX = TopBarTextPos.Left;
+                long CharCursorY = TopBarTextPos.Top;
+                for (uint64_t i = 0; i < strlen(wnd->GetTitle()); i++)
+                    PaintChar(this->CurrentFont, this->OverlayBuffer, wnd->GetTitle()[i], 0xFFFFFF, &CharCursorX, &CharCursorY);
+
+                if (!RepaintNeeded)
+                {
+                    OverlayBufferRepaint = false;
+                    RepaintNeeded = false;
+                }
+            }
+            wnd->OnPaint(nullptr);
+        }
+        DrawOverBitmap(this->BackBuffer, this->OverlayBuffer, 0, 0);
+    }
+
+/*
+    "* 2" to increase the size of the cursor
+    "/ 2" to decrease the size of the cursor
+*/
+#define ICON_SIZE
+
+    void GUI::PaintCursor()
+    {
+        uint32_t CursorColorInner = 0xFFFFFFFF;
+        uint32_t CursorColorOuter = 0xFF000000;
+
+        if (MouseArray[0].X != MouseArray[1].X ||
+            MouseArray[0].Y != MouseArray[1].Y ||
+            MouseArray[0].Z != MouseArray[1].Z ||
+            Cursor != LastCursor)
+            CursorBufferRepaint = true;
+
+        if (CursorBufferRepaint)
+        {
+            memset(this->CursorBuffer->Data, 0, this->CursorBuffer->Size);
+            switch (this->Cursor)
+            {
+            case CursorType::Visible:
+            {
+                CursorVisible = true;
+                break;
+            }
+            case CursorType::Hidden:
+            {
+                CursorVisible = false;
+                break;
+            }
+            default:
+                fixme("Unknown cursor type %d", this->Cursor);
+                [[fallthrough]];
+            case CursorType::Arrow:
+            {
+                if (CursorVisible)
+                    for (int i = 0; i < 19; i++)
+                    {
+                        for (int j = 0; j < 12; j++)
+                        {
+                            if (CursorArrow[i * 12 + j] == 1)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorOuter);
+                            }
+                            else if (CursorArrow[i * 12 + j] == 2)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorInner);
+                            }
+                        }
+                    }
+                break;
+            }
+            case CursorType::Hand:
+            {
+                if (CursorVisible)
+                    for (int i = 0; i < 24; i++)
+                    {
+                        for (int j = 0; j < 17; j++)
+                        {
+                            if (CursorHand[i * 17 + j] == 1)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorOuter);
+                            }
+                            else if (CursorHand[i * 17 + j] == 2)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorInner);
+                            }
+                        }
+                    }
+                break;
+            }
+            case CursorType::Wait:
+            {
+                if (CursorVisible)
+                    for (int i = 0; i < 22; i++)
+                    {
+                        for (int j = 0; j < 13; j++)
+                        {
+                            if (CursorWait[i * 13 + j] == 1)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorOuter);
+                            }
+                            else if (CursorWait[i * 13 + j] == 2)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorInner);
+                            }
+                        }
+                    }
+                break;
+            }
+            case CursorType::IBeam:
+            {
+                if (CursorVisible)
+                    for (int i = 0; i < 22; i++)
+                    {
+                        for (int j = 0; j < 13; j++)
+                        {
+                            if (CursorIBeam[i * 13 + j] == 1)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorOuter);
+                            }
+                            else if (CursorIBeam[i * 13 + j] == 2)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorInner);
+                            }
+                        }
+                    }
+                break;
+            }
+            case CursorType::ResizeAll:
+            {
+                if (CursorVisible)
+                    for (int i = 0; i < 23; i++)
+                    {
+                        for (int j = 0; j < 23; j++)
+                        {
+                            if (CursorResizeAll[i * 23 + j] == 1)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorOuter);
+                            }
+                            else if (CursorResizeAll[i * 23 + j] == 2)
+                            {
+                                SetPixel(this->CursorBuffer, j ICON_SIZE, i ICON_SIZE, CursorColorInner);
+                            }
+                        }
+                    }
+                break;
+            }
+            }
+            CursorBufferRepaint = false;
+        }
+        DrawOverBitmap(this->BackBuffer, this->CursorBuffer, MouseArray[0].Y, MouseArray[0].X);
+    }
+
+    void GUI::Loop()
+    {
+        /*
+        Because we do not use a gpu to do the rendering, we need to do it manually.
+        This is why the mouse is slow when we have to draw a bunch of things.
+        */
+        while (IsRunning)
+        {
+#ifdef DEBUG
+            FIi = CPU::Counter();
+#endif
+            FetchInputs();
+#ifdef DEBUG
+            FIi = CPU::Counter() - FIi;
+            PDi = CPU::Counter();
+#endif
+            PaintDesktop();
+#ifdef DEBUG
+            PDi = CPU::Counter() - PDi;
+            PWi = CPU::Counter();
+#endif
+            PaintWidgets();
+#ifdef DEBUG
+            PWi = CPU::Counter() - PWi;
+            PWWi = CPU::Counter();
+#endif
+            PaintWindows();
+#ifdef DEBUG
+            PWWi = CPU::Counter() - PWWi;
+            PCi = CPU::Counter();
+#endif
+            PaintCursor();
+#ifdef DEBUG
+            PCi = CPU::Counter() - PCi;
+            mmi = CPU::Counter();
+#endif
+            memcpy(Display->GetBuffer(200)->Buffer, this->BackBuffer->Data, this->BackBuffer->Size);
+            Display->SetBuffer(200);
+#ifdef DEBUG
+            mmi = CPU::Counter() - mmi;
+#endif
+        }
+    }
+
+    void GUI::AddWindow(Window *window)
+    {
+        this->Windows.push_back(window);
+    }
+
+    void GUI::AddWidget(WidgetCollection *widget)
+    {
+        this->Widgets.push_back(widget);
+    }
+
+    GUI::GUI()
+    {
+        Display->CreateBuffer(0, 0, 200);
+        this->CurrentFont = new Video::Font(&_binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_start, &_binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_end, Video::FontType::PCScreenFont2);
+        this->mem = new Memory::MemMgr;
+        this->Desktop.Top = 0;
+        this->Desktop.Left = 0;
+        this->Desktop.Width = Display->GetBuffer(200)->Width;
+        this->Desktop.Height = Display->GetBuffer(200)->Height;
+
+        this->BackBuffer = new ScreenBitmap;
+        this->BackBuffer->Width = this->Desktop.Width;
+        this->BackBuffer->Height = this->Desktop.Height;
+        this->BackBuffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->BackBuffer->Pitch = Display->GetPitch();
+        this->BackBuffer->Size = Display->GetBuffer(200)->Size;
+        this->BackBuffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->BackBuffer->Size + 1));
+        memset(this->BackBuffer->Data, 0, this->BackBuffer->Size);
+
+        this->DesktopBuffer = new ScreenBitmap;
+        this->DesktopBuffer->Width = this->Desktop.Width;
+        this->DesktopBuffer->Height = this->Desktop.Height;
+        this->DesktopBuffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->DesktopBuffer->Pitch = Display->GetPitch();
+        this->DesktopBuffer->Size = Display->GetBuffer(200)->Size;
+        this->DesktopBuffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->DesktopBuffer->Size + 1));
+        memset(this->DesktopBuffer->Data, 0, this->DesktopBuffer->Size);
+
+        this->OverlayBuffer = new ScreenBitmap;
+        this->OverlayBuffer->Width = this->Desktop.Width;
+        this->OverlayBuffer->Height = this->Desktop.Height;
+        this->OverlayBuffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->OverlayBuffer->Pitch = Display->GetPitch();
+        this->OverlayBuffer->Size = Display->GetBuffer(200)->Size;
+        this->OverlayBuffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->OverlayBuffer->Size + 1));
+        memset(this->OverlayBuffer->Data, 0, this->OverlayBuffer->Size);
+
+        this->CursorBuffer = new ScreenBitmap;
+        this->CursorBuffer->Width = 25;
+        this->CursorBuffer->Height = 25;
+        this->CursorBuffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->CursorBuffer->Pitch = Display->GetPitch();
+        this->CursorBuffer->Size = this->CursorBuffer->Width * this->CursorBuffer->Height * (this->CursorBuffer->BitsPerPixel / 8);
+        this->CursorBuffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->CursorBuffer->Size + 1));
+        memset(this->CursorBuffer->Data, 0, this->CursorBuffer->Size);
+
+        this->IsRunning = true;
+    }
+
+    GUI::~GUI()
+    {
+        debug("Destructor called");
+        delete this->mem, this->mem = nullptr;
+        delete this->BackBuffer, this->BackBuffer = nullptr;
+        delete this->DesktopBuffer, this->DesktopBuffer = nullptr;
+        delete this->OverlayBuffer, this->OverlayBuffer = nullptr;
+        delete this->CursorBuffer, this->CursorBuffer = nullptr;
+        Display->DeleteBuffer(200);
+        this->Windows.clear();
+    }
+}
diff --git a/Kernel/GUI/Icons.cpp b/Kernel/GUI/Icons.cpp
new file mode 100644
index 00000000..8974baec
--- /dev/null
+++ b/Kernel/GUI/Icons.cpp
@@ -0,0 +1,253 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "icons.hpp"
+
+char CursorArrow[] = {
+    1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 12x19
+    1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    1, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, //
+    1, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, //
+    1, 2, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, //
+    1, 2, 2, 2, 2, 2, 1, 0, 0, 0, 0, 0, //
+    1, 2, 2, 2, 2, 2, 2, 1, 0, 0, 0, 0, //
+    1, 2, 2, 2, 2, 2, 2, 2, 1, 0, 0, 0, //
+    1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 0, //
+    1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, //
+    1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, //
+    1, 2, 2, 2, 1, 2, 2, 1, 0, 0, 0, 0, //
+    1, 2, 2, 1, 0, 1, 2, 2, 1, 0, 0, 0, //
+    1, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 0, //
+    1, 1, 0, 0, 0, 0, 1, 2, 2, 1, 0, 0, //
+    1, 0, 0, 0, 0, 0, 1, 2, 2, 1, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, //
+};
+
+char CursorHand[] = {
+    0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 17x24
+    0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 2, 2, 1, 1, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 1, 0, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 0, //
+    0, 0, 0, 0, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, //
+    1, 1, 1, 0, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, //
+    1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, //
+    1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, //
+    0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, //
+    0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, //
+    0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 0, //
+    0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 0, //
+    0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
+
+char CursorWait[] = {
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 13x22
+    1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, //
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, //
+    0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, //
+    0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, //
+    0, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 0, //
+    0, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 0, //
+    0, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 1, 0, //
+    0, 0, 1, 1, 2, 2, 2, 2, 2, 1, 1, 0, 0, //
+    0, 0, 0, 1, 1, 2, 1, 2, 1, 1, 0, 0, 0, //
+    0, 0, 0, 0, 1, 1, 2, 1, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 1, 2, 1, 1, 0, 0, 0, 0, //
+    0, 0, 0, 1, 1, 2, 2, 2, 1, 1, 0, 0, 0, //
+    0, 0, 1, 1, 2, 2, 1, 2, 2, 1, 1, 0, 0, //
+    0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 0, //
+    0, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 0, //
+    0, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 0, //
+    0, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 0, //
+    0, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 0, //
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, //
+    1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, //
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, //
+};
+
+char CursorIBeam[] = {
+    1, 1, 1, 0, 1, 1, 1, // 7x17
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 1, 0, 0, 0, //
+    1, 1, 1, 0, 1, 1, 1, //
+};
+
+char CursorResizeAll[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 23x23
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, //
+    0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, //
+    0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, //
+    0, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 0, //
+    1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, //
+    0, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 0, //
+    0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, //
+    0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, //
+    0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
+
+char CloseButton[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
+
+char MinimizeButton[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
+
+char MaximizeButtonNormal[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
+
+char MaximizeButtonMaximized[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
+
+char ResizeHint[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, //
+};
diff --git a/Kernel/GUI/WidgetEvents.cpp b/Kernel/GUI/WidgetEvents.cpp
new file mode 100644
index 00000000..27a79614
--- /dev/null
+++ b/Kernel/GUI/WidgetEvents.cpp
@@ -0,0 +1,159 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <gui.hpp>
+
+#include <driver.hpp>
+#include <task.hpp>
+#include <printf.h>
+#include <debug.h>
+
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+namespace GraphicalUserInterface
+{
+    void WidgetCollection::OnPaintBackground(Event *e)
+    {
+        UNUSED(e);
+    }
+
+    void WidgetCollection::OnPaintForeground(Event *e)
+    {
+        UNUSED(e);
+        foreach (auto Panel in this->Panels)
+        {
+            PutRect(this->Buffer, Panel->rect, Panel->Color);
+        }
+
+        foreach (auto Label in this->Labels)
+        {
+            Label->CharCursorX = Label->rect.Left;
+            Label->CharCursorY = Label->rect.Top;
+            for (uint64_t i = 0; i < strlen(Label->Text); i++)
+                PaintChar(this->CurrentFont, this->Buffer, Label->Text[i], 0xFFFFFF, &Label->CharCursorX, &Label->CharCursorY);
+        }
+
+        foreach (auto Button in this->Buttons)
+        {
+            if (Button->Pressed)
+                PutRect(this->Buffer, Button->rect, Button->PressedColor);
+            else if (Button->Hover)
+                PutRect(this->Buffer, Button->rect, Button->HoverColor);
+            else
+                PutRect(this->Buffer, Button->rect, Button->Color);
+            Button->CharCursorX = Button->rect.Left + (((Button->rect.Width / 2) - (this->CurrentFont->GetInfo().Width * strlen(Button->Text) / 2)));
+            Button->CharCursorY = Button->rect.Top + (((Button->rect.Height / 2) - (this->CurrentFont->GetInfo().Height / 2)));
+            for (uint64_t i = 0; i < strlen(Button->Text); i++)
+                PaintChar(this->CurrentFont, this->Buffer, Button->Text[i], 0xFFFFFF, &Button->CharCursorX, &Button->CharCursorY);
+        }
+    }
+
+    void WidgetCollection::OnPaint(Event *e)
+    {
+        static long LastWidth = 0;
+        static long LastHeight = 0;
+
+        if (LastWidth != ((Window *)this->ParentWindow)->GetPosition().Width ||
+            LastHeight != ((Window *)this->ParentWindow)->GetPosition().Height)
+        {
+            LastWidth = ((Window *)this->ParentWindow)->GetPosition().Width;
+            LastHeight = ((Window *)this->ParentWindow)->GetPosition().Height;
+
+            this->mem->FreePages(this->Buffer->Data, TO_PAGES(this->Buffer->Size + 1));
+            this->Buffer->Data = nullptr;
+            delete this->Buffer, this->Buffer = nullptr;
+
+            this->Buffer = new ScreenBitmap;
+            this->Buffer->Width = LastWidth;
+            this->Buffer->Height = LastHeight;
+            this->Buffer->BitsPerPixel = Display->GetBitsPerPixel();
+            this->Buffer->Pitch = Display->GetPitch();
+            this->Buffer->Size = this->Buffer->Pitch * LastHeight;
+            this->Buffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->Buffer->Size + 1));
+            memset(this->Buffer->Data, 0, this->Buffer->Size);
+
+            this->NeedRedraw = true;
+        }
+
+        if (this->NeedRedraw)
+        {
+            memset(this->Buffer->Data, 0, this->Buffer->Size);
+            this->OnPaintBackground(e);
+            this->OnPaintForeground(e);
+            this->NeedRedraw = false;
+        }
+        DrawOverBitmap(((Window *)this->ParentWindow)->GetBuffer(), this->Buffer, 0, 0);
+    }
+
+    void WidgetCollection::OnMouseDown(Event *e)
+    {
+        foreach (auto Button in this->Buttons)
+        {
+            if (Button->rect.Contains(e->MouseDown.X, e->MouseDown.Y))
+            {
+                if (e->MouseDown.Left)
+                {
+                    debug("Button Hold");
+                    Button->Pressed = true;
+                    this->NeedRedraw = true;
+                }
+            }
+        }
+    }
+
+    void WidgetCollection::OnMouseUp(Event *e)
+    {
+        foreach (auto Button in this->Buttons)
+        {
+            if (Button->rect.Contains(e->MouseUp.X, e->MouseUp.Y))
+            {
+                if (e->MouseUp.Left)
+                {
+                    debug("Button Release");
+                    if (Button->Pressed)
+                    {
+                        debug("Button Clicked");
+                        if (Button->OnClick != (uintptr_t) nullptr)
+                            ((void (*)(void))Button->OnClick)();
+
+                        Button->Pressed = false;
+                        this->NeedRedraw = true;
+                    }
+                }
+            }
+        }
+    }
+
+    void WidgetCollection::OnMouseMove(Event *e)
+    {
+        foreach (auto Button in this->Buttons)
+        {
+            if (Button->rect.Contains(e->MouseMove.X, e->MouseMove.Y))
+            {
+                Button->Hover = true;
+                this->NeedRedraw = true;
+            }
+            else
+            {
+                Button->Hover = false;
+                this->NeedRedraw = true;
+            }
+        }
+    }
+}
diff --git a/Kernel/GUI/Widgets.cpp b/Kernel/GUI/Widgets.cpp
new file mode 100644
index 00000000..03ea85d9
--- /dev/null
+++ b/Kernel/GUI/Widgets.cpp
@@ -0,0 +1,141 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <gui.hpp>
+
+#include <driver.hpp>
+#include <task.hpp>
+#include <printf.h>
+#include <debug.h>
+
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn10x20r_psf_start;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn10x20r_psf_end;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn10x20r_psf_size;
+
+namespace GraphicalUserInterface
+{
+    Handle WidgetCollection::CreatePanel(Rect rect, uint32_t Color)
+    {
+        PanelObject *panel = (PanelObject *)this->mem->RequestPages(TO_PAGES(sizeof(PanelObject) + 1));
+
+        panel->Handle.Type[0] = 'P';
+        panel->Handle.Type[1] = 'N';
+        panel->Handle.Type[2] = 'L';
+        panel->Handle.Type[3] = '\0';
+
+        panel->rect = rect;
+        panel->Color = Color;
+        panel->BorderColor = 0xFF000000;
+        panel->ShadowColor = 0xFF000000;
+        panel->Shadow = false;
+
+        Panels.push_back(panel);
+        this->NeedRedraw = true;
+        return (Handle)panel;
+    }
+
+    Handle WidgetCollection::CreateLabel(Rect rect, const char *Text)
+    {
+        LabelObject *label = (LabelObject *)this->mem->RequestPages(TO_PAGES(sizeof(LabelObject) + 1));
+
+        label->Handle.Type[0] = 'L';
+        label->Handle.Type[1] = 'B';
+        label->Handle.Type[2] = 'L';
+        label->Handle.Type[3] = '\0';
+
+        label->rect = rect;
+        strcpy(label->Text, Text);
+        label->Color = 0xFFFFFF;
+        label->CharCursorX = rect.Left;
+        label->CharCursorY = rect.Top;
+
+        Labels.push_back(label);
+        NeedRedraw = true;
+        return (Handle)label;
+    }
+
+    Handle WidgetCollection::CreateButton(Rect rect, const char *Text, uintptr_t OnClick)
+    {
+        ButtonObject *button = (ButtonObject *)this->mem->RequestPages(TO_PAGES(sizeof(ButtonObject) + 1));
+
+        button->Handle.Type[0] = 'B';
+        button->Handle.Type[1] = 'T';
+        button->Handle.Type[2] = 'N';
+        button->Handle.Type[3] = '\0';
+
+        button->rect = rect;
+        strcpy(button->Text, Text);
+        button->Color = 0x252525;
+        button->HoverColor = 0x353535;
+        button->PressedColor = 0x555555;
+        button->BorderColor = 0xFF000000;
+        button->ShadowColor = 0xFF000000;
+        button->Shadow = false;
+        button->Hover = false;
+        button->Pressed = false;
+        button->OnClick = OnClick;
+
+        Buttons.push_back(button);
+        this->NeedRedraw = true;
+        return (Handle)button;
+    }
+
+    void WidgetCollection::SetText(Handle handle, const char *Text)
+    {
+        HandleMeta *meta = (HandleMeta *)handle;
+        if (meta->Type[0] == 'L' && meta->Type[1] == 'B' && meta->Type[2] == 'L')
+        {
+            LabelObject *label = (LabelObject *)handle;
+            strcpy(label->Text, Text);
+            this->NeedRedraw = true;
+        }
+    }
+
+    WidgetCollection::WidgetCollection(void *ParentWindow)
+    {
+        if (!ParentWindow)
+        {
+            error("ParentWindow is null");
+            return;
+        }
+        this->ParentWindow = ParentWindow;
+
+        this->mem = new Memory::MemMgr;
+
+        this->Buffer = new ScreenBitmap;
+        this->Buffer->Width = ((Window *)this->ParentWindow)->GetPosition().Width;
+        this->Buffer->Height = ((Window *)this->ParentWindow)->GetPosition().Height;
+        this->Buffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->Buffer->Pitch = Display->GetPitch();
+        this->Buffer->Size = this->Buffer->Pitch * ((Window *)this->ParentWindow)->GetPosition().Height;
+        this->Buffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->Buffer->Size + 1));
+        memset(this->Buffer->Data, 0, this->Buffer->Size);
+
+        this->CurrentFont = new Video::Font(&_binary_Files_tamsyn_font_1_11_Tamsyn10x20r_psf_start, &_binary_Files_tamsyn_font_1_11_Tamsyn10x20r_psf_end, Video::FontType::PCScreenFont2);
+    }
+
+    WidgetCollection::~WidgetCollection()
+    {
+        delete this->mem, this->mem = nullptr;
+        delete this->Buffer, this->Buffer = nullptr;
+        delete this->CurrentFont, this->CurrentFont = nullptr;
+    }
+}
diff --git a/Kernel/GUI/Window.cpp b/Kernel/GUI/Window.cpp
new file mode 100644
index 00000000..226007b5
--- /dev/null
+++ b/Kernel/GUI/Window.cpp
@@ -0,0 +1,82 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <gui.hpp>
+
+#include <driver.hpp>
+#include <task.hpp>
+#include <printf.h>
+#include <debug.h>
+
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+namespace GraphicalUserInterface
+{
+
+#define TASKBAR_HEIGHT 25
+
+    // if (!Maximized)
+    // {
+    //     this->LastPosition.Left = this->Position.Left;
+    //     this->LastPosition.Top = this->Position.Top;
+    //     this->LastPosition.Width = this->Position.Width;
+    //     this->LastPosition.Height = this->Position.Height;
+    //     this->Position.Left = 0;
+    //     this->Position.Top = 0;
+    //     this->Position.Width = Display->GetBuffer(200)->Width;
+    //     this->Position.Height = Display->GetBuffer(200)->Height - 20 - TASKBAR_HEIGHT;
+    //     Maximized = true;
+    // }
+    // else
+    // {
+    //     this->Position.Left = this->LastPosition.Left;
+    //     this->Position.Top = this->LastPosition.Top;
+    //     this->Position.Width = this->LastPosition.Width;
+    //     this->Position.Height = this->LastPosition.Height;
+    //     Maximized = false;
+    // }
+
+    void Window::AddWidget(WidgetCollection *widget)
+    {
+        this->Widgets.push_back(widget);
+    }
+
+    Window::Window(void *ParentGUI, Rect rect, const char *Title)
+    {
+        this->mem = new Memory::MemMgr;
+        this->Buffer = new ScreenBitmap;
+        this->Buffer->Width = rect.Width;
+        this->Buffer->Height = rect.Height;
+        this->Buffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->Buffer->Pitch = Display->GetPitch();
+        this->Buffer->Size = this->Buffer->Pitch * rect.Height;
+        this->Buffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->Buffer->Size + 1));
+        memset(this->Buffer->Data, 0, this->Buffer->Size);
+        this->ParentGUI = ParentGUI;
+        this->Position = rect;
+        strcpy(this->Title, Title);
+        this->Maximized = false;
+        this->Minimized = false;
+    }
+
+    Window::~Window()
+    {
+        delete this->mem, this->mem = nullptr;
+    }
+}
diff --git a/Kernel/GUI/WindowEvents.cpp b/Kernel/GUI/WindowEvents.cpp
new file mode 100644
index 00000000..764b24d9
--- /dev/null
+++ b/Kernel/GUI/WindowEvents.cpp
@@ -0,0 +1,137 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <gui.hpp>
+
+#include <driver.hpp>
+#include <task.hpp>
+#include <printf.h>
+#include <debug.h>
+
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+namespace GraphicalUserInterface
+{
+    void Window::OnResize(Event *e)
+    {
+        // TODO: Optimize this
+        this->mem->FreePages(this->Buffer->Data, TO_PAGES(this->Buffer->Size + 1));
+        this->Buffer->Data = nullptr;
+        delete this->Buffer, this->Buffer = nullptr;
+
+        this->Buffer = new ScreenBitmap;
+        this->Buffer->Width = e->Resize.Width;
+        this->Buffer->Height = e->Resize.Height;
+        this->Buffer->BitsPerPixel = Display->GetBitsPerPixel();
+        this->Buffer->Pitch = Display->GetPitch();
+        this->Buffer->Size = this->Buffer->Pitch * e->Resize.Height;
+        this->Buffer->Data = (uint8_t *)this->mem->RequestPages(TO_PAGES(this->Buffer->Size + 1));
+        memset(this->Buffer->Data, 0, this->Buffer->Size);
+        this->OnPaint(e);
+    }
+
+    void Window::OnMinimize(Event *e)
+    {
+        UNUSED(e);
+        fixme("Window::OnMinimize() not implemented");
+    }
+
+    void Window::OnMaximize(Event *e)
+    {
+        UNUSED(e);
+        fixme("Window::OnMaximize() not implemented");
+    }
+
+    void Window::OnClose(Event *e)
+    {
+        UNUSED(e);
+        fixme("Window::OnClose() not implemented");
+    }
+
+    void Window::OnPaintBackground(Event *e)
+    {
+        UNUSED(e);
+        Rect PaintPosition = this->Position;
+        PaintPosition.Left = 0;
+        PaintPosition.Top = 0;
+        PutRect(this->Buffer, PaintPosition, 0x121212);
+    }
+
+    void Window::OnPaintForeground(Event *e)
+    {
+        // Window content
+        if (!this->Maximized)
+        {
+            char buf[256];
+            sprintf(buf, "Left:\eAA11FF%ld\eFFFFFF Top:\eAA11FF%ld\eFFFFFF W:\eAA11FF%ld\eFFFFFF H:\eAA11FF%ld\eFFFFFF", this->Position.Left, this->Position.Top, this->Position.Width, this->Position.Height);
+            // Display->DrawString(buf, this->Position.Left + 20, this->Position.Top + 25, 200);
+        }
+
+        foreach (auto var in this->Widgets)
+        {
+            var->OnPaint(e);
+        }
+    }
+
+    void Window::OnPaint(Event *e)
+    {
+        memset(this->Buffer->Data, 0, this->Buffer->Size);
+        this->OnPaintBackground(e);
+        this->OnPaintForeground(e);
+    }
+
+    void Window::OnMouseDown(Event *e)
+    {
+        Event WindowPos = *e;
+
+        WindowPos.MouseDown.X -= this->Position.Left;
+        WindowPos.MouseDown.Y -= this->Position.Top;
+
+        foreach (auto var in this->Widgets)
+        {
+            var->OnMouseDown(&WindowPos);
+        }
+    }
+
+    void Window::OnMouseUp(Event *e)
+    {
+        Event WindowPos = *e;
+
+        WindowPos.MouseUp.X -= this->Position.Left;
+        WindowPos.MouseUp.Y -= this->Position.Top;
+
+        foreach (auto var in this->Widgets)
+        {
+            var->OnMouseUp(&WindowPos);
+        }
+    }
+
+    void Window::OnMouseMove(Event *e)
+    {
+        Event WindowPos = *e;
+
+        WindowPos.MouseMove.X -= this->Position.Left;
+        WindowPos.MouseMove.Y -= this->Position.Top;
+
+        foreach (auto var in this->Widgets)
+        {
+            var->OnMouseMove(&WindowPos);
+        }
+    }
+}
diff --git a/Kernel/GUI/icons.hpp b/Kernel/GUI/icons.hpp
new file mode 100644
index 00000000..3efe7082
--- /dev/null
+++ b/Kernel/GUI/icons.hpp
@@ -0,0 +1,34 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ICONS_AND_FONTS_H__
+#define __FENNIX_KERNEL_ICONS_AND_FONTS_H__
+
+#include <types.h>
+
+extern char CursorArrow[];
+extern char CursorHand[];
+extern char CursorWait[];
+extern char CursorIBeam[];
+extern char CursorResizeAll[];
+extern char CloseButton[];
+extern char MinimizeButton[];
+extern char MaximizeButtonNormal[];
+extern char MaximizeButtonMaximized[];
+extern char ResizeHint[];
+
+#endif // !__FENNIX_KERNEL_ICONS_AND_FONTS_H__
diff --git a/Kernel/Kernel.cpp b/Kernel/Kernel.cpp
new file mode 100644
index 00000000..b367f0bd
--- /dev/null
+++ b/Kernel/Kernel.cpp
@@ -0,0 +1,566 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "kernel.h"
+
+#include <boot/protocols/multiboot2.h>
+#include <filesystem/ustar.hpp>
+#include <ints.hpp>
+#include <memory.hpp>
+#include <convert.h>
+#include <printf.h>
+#include <lock.hpp>
+#include <uart.hpp>
+#include <debug.h>
+#include <smp.hpp>
+#include <cargs.h>
+#include <io.h>
+
+#include "Core/smbios.hpp"
+#include "Tests/t.h"
+
+bool DebuggerIsAttached = false;
+
+#ifdef DEBUG
+bool EnableExternalMemoryTracer = false; /* This can be modified while we are debugging with GDB. */
+char mExtTrkLog[MEM_TRK_MAX_SIZE];
+LockClass mExtTrkLock;
+#endif
+
+/**
+ * Fennix Kernel
+ * -------------
+ * This is the main kernel file. It contains the main function and the kernel entry point.
+ *
+ * LOADING PROCEDURE:
+ * [BOOT] -> [Bootloader] -> [Boot Info Parser] -> Entry() -> Main() -> KernelMainThread()
+ * - Bootloader
+ * - Entry() is the first function to be called by the boot info parser function after getting the boot info from the bootloader.
+ * - Main() is the first function to be called by Entry().
+ * - KernelMainThread() is the first function to be called by the task manager.
+ *
+ * TODO:
+ * - [x] Optimize SMP.
+ * - [ ] Support IPv6.
+ * - [ ] Endianess of the network stack (currently: [HOST](LSB)<=>[NETWORK](MSB)). Not sure if this is a standard or not.
+ * - [ ] Support 32-bit applications (ELF, PE, etc).
+ * - [ ] Do not map the entire memory. Map only the needed memory address at allocation time.
+ * - [ ] Implementation of logging (beside serial) with log rotation.
+ * - [ ] Implement a better task manager. (replace struct P/TCB with classes)
+ * - [?] Rewrite virtual file system. (it's very bad, I don't know how I wrote it this bad)
+ * - [ ] Colors in crash screen are not following the kernel color scheme.
+ * - [x] Find a way to add intrinsics.
+ * - [ ] Rework PSF1 font loader.
+ * - [x] The cleanup should be done by a thread (tasking). This is done to avoid a deadlock.
+ * - [ ] Implement a better Display::SetBrightness() function.
+ * - [ ] Fix memcpy, memset and memcmp functions (they are not working properly with SIMD).
+ * - [ ] Support Aarch64.
+ * - [ ] Fully support i386.
+ * - [ ] SMP trampoline shouldn't be hardcoded at 0x2000.
+ * - [ ] Rework the stack guard.
+ * - [ ] Mutex implementation.
+ * - [ ] Vector should have a mutex.
+ * - [ ] Update SMBIOS functions to support newer versions and actually use it.
+ *
+ * ISSUES:
+ * - [x] Kernel stack is smashed when an interrupt occurs. (this bug it occurs when an interrupt like IRQ1 or IRQ12 occurs)
+ * - [x] After setting the new stack pointer, the kernel crashes with an invalid opcode.
+ * - [?] Somewhere in the kernel, the memory is wrongly freed or memcpy/memset.
+ * - [ ] GlobalDescriptorTable::SetKernelStack() is not working properly.
+ * - [ ] Sometimes while the kernel is inside BeforeShutdown(), we end up in a deadlock.
+ * - [ ] CPU usage is not working properly.
+ *
+ * CREDITS AND REFERENCES:
+ * - General:
+ *    https://wiki.osdev.org/Main_Page
+ *    https://gcc.gnu.org/onlinedocs/gcc/x86-Built-in-Functions.html#x86-Built-in-Functions
+ *    https://gcc.gnu.org/onlinedocs/gcc/Common-Function-Attributes.html#Common-Function-Attributes
+ *
+ * - Font:
+ *    http://www.fial.com/~scott/tamsyn-font/
+ *
+ * - CPU XCR0 structure:
+ *    https://wiki.osdev.org/CPU_Registers_x86#XCR0
+ *
+ * - CPUID 0x7:
+ *    https://en.wikipedia.org/wiki/CPUID
+ *
+ * - Network:
+ *    https://web.archive.org/web/20051210132103/http://users.pcnet.ro/dmoroian/beej/Beej.html
+ *    https://web.archive.org/web/20060229214053/http://www.cs.rutgers.edu/~pxk/417/notes/sockets/udp.html
+ *    https://en.wikipedia.org/wiki/EtherType
+ *    https://access.redhat.com/documentation/en-us/red_hat_enterprise_linux/6/html/performance_tuning_guide/s-network-packet-reception
+ *    https://linux-kernel-labs.github.io/refs/heads/master/labs/networking.html
+ *    https://github.com/smoltcp-rs/smoltcp
+ *    https://www.ciscopress.com/articles/article.asp?p=3089352&seqNum=5
+ *    https://www.cs.unh.edu/cnrg/people/gherrin/linux-net.html
+ *    https://en.wikipedia.org/wiki/List_of_IP_protocol_numbers
+ *    https://github.com/TheUltimateFoxOS/horizon
+ *    https://en.wikipedia.org/wiki/Address_Resolution_Protocol
+ *    https://en.cppreference.com/w/cpp/language/operators
+ *    https://en.wikipedia.org/wiki/Dynamic_Host_Configuration_Protocol
+ *    https://www.cs.usfca.edu/~cruse/cs326f04/RTL8139D_DataSheet.pdf
+ *    https://www.javatpoint.com/arp-packet-format
+ *    https://www.cs.usfca.edu/~cruse/cs326f04/RTL8139_ProgrammersGuide.pdf
+ *    http://realtek.info/pdf/rtl8139cp.pdf
+ *    https://en.wikipedia.org/wiki/IPv4
+ *    https://www.iana.org/assignments/icmp-parameters/icmp-parameters.xhtml
+ *
+ * - Loading ELF shared libraries and dynamic linking:
+ *    https://www.akkadia.org/drepper/dsohowto.pdf
+ *    https://wiki.osdev.org/Dynamic_Linker
+ *    https://github.com/tyler569/nightingale
+ *    https://www.technovelty.org/linux/plt-and-got-the-key-to-code-sharing-and-dynamic-libraries.html
+ *    https://www.youtube.com/watch?v=kUk5pw4w0h4
+ *    https://docs.oracle.com/cd/E19683-01/817-3677/chapter6-42444/index.html
+ *    https://ir0nstone.gitbook.io/notes/types/stack/aslr/plt_and_got
+ *
+ * - IPC:
+ *    https://docs.oracle.com/cd/E19048-01/chorus5/806-6897/architecture-103/index.html
+ *    https://www.scaler.com/topics/operating-system/inter-process-communication-in-os/
+ *    https://en.wikipedia.org/wiki/Inter-process_communication
+ *    https://www.geeksforgeeks.org/inter-process-communication-ipc/
+ *
+ * - PCI:
+ *    https://wiki.osdev.org/PCI
+ *    https://en.wikipedia.org/wiki/PCI_configuration_space
+ *
+ * - Audio:
+ *    https://trac.ffmpeg.org/wiki/audio%20types
+ *    https://wiki.osdev.org/AC97
+ *    https://github.com/LemonOSProject/LemonOS
+ *    https://inst.eecs.berkeley.edu//~cs150/Documents/ac97_r23.pdf
+ *
+ * - Intrinsics:
+ *    https://learn.microsoft.com/en-us/cpp/intrinsics/x86-intrinsics-list
+ *    https://www.intel.com/content/www/us/en/docs/intrinsics-guide/index.html
+ *
+ * - CPUID lists:
+ *    https://www.amd.com/system/files/TechDocs/40332.pdf
+ *
+ * - SMBIOS:
+ *    https://www.dmtf.org/dsp/DSP0134
+ *    https://www.dmtf.org/sites/default/files/standards/documents/DSP0134_3.6.0.pdf
+ *
+ * - UMIP, SMAP and SMEP:
+ *    https://en.wikipedia.org/wiki/Control_register
+ *    https://web.archive.org/web/20160312223150/http://ncsi.com/nsatc11/presentations/wednesday/emerging_technologies/fischer.pdf
+ *    https://en.wikipedia.org/wiki/Supervisor_Mode_Access_Prevention
+ *
+ * - Atomic operations:
+ *    https://en.cppreference.com/w/cpp/atomic/atomic
+ *
+ */
+
+#ifdef a64
+#if UINTPTR_MAX != UINT64_MAX
+#error "uintptr_t is not 64-bit!"
+#endif // UINTPTR_MAX != UINT64_MAX
+#endif // a64
+
+#ifdef a32
+#if UINTPTR_MAX != UINT32_MAX
+#error "uintptr_t is not 32-bit!"
+#endif // UINTPTR_MAX != UINT32_MAX
+#endif // a32
+
+#ifdef aa64
+#if UINTPTR_MAX != UINT64_MAX
+#error "uintptr_t is not 64-bit!"
+#endif // UINTPTR_MAX != UINT64_MAX
+#endif // aa64
+
+NewLock(KernelLock);
+
+#include <intrin.hpp>
+
+using VirtualFileSystem::File;
+using VirtualFileSystem::FileStatus;
+using VirtualFileSystem::Node;
+using VirtualFileSystem::NodeFlags;
+
+__aligned(16) BootInfo bInfo{};
+Video::Display *Display = nullptr;
+SymbolResolver::Symbols *KernelSymbolTable = nullptr;
+Power::Power *PowerManager = nullptr;
+PCI::PCI *PCIManager = nullptr;
+Tasking::Task *TaskManager = nullptr;
+Time::time *TimeManager = nullptr;
+VirtualFileSystem::Virtual *vfs = nullptr;
+VirtualFileSystem::Virtual *bootanim_vfs = nullptr;
+
+KernelConfig Config = {
+    .AllocatorType = Memory::MemoryAllocatorType::XallocV1,
+    .SchedulerType = 1,
+    .DriverDirectory = {'/', 's', 'y', 's', 't', 'e', 'm', '/', 'd', 'r', 'i', 'v', 'e', 'r', 's', '\0'},
+    .InitPath = {'/', 's', 'y', 's', 't', 'e', 'm', '/', 'i', 'n', 'i', 't', '\0'},
+    .InterruptsOnCrash = true,
+    .Cores = 0,
+    .IOAPICInterruptCore = 0,
+    .UnlockDeadLock = false,
+    .SIMD = false,
+    .BootAnimation = false,
+};
+
+extern bool EnableProfiler;
+
+// For the Display class. Printing on first buffer as default.
+int PutCharBufferIndex = 0;
+EXTERNC void putchar(char c)
+{
+    if (Display)
+        Display->Print(c, PutCharBufferIndex);
+    else
+        UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM1).Write(c);
+}
+
+EXTERNC void KPrint(const char *Format, ...)
+{
+    SmartLock(KernelLock);
+
+    if (TimeManager)
+    {
+        uint64_t Nanoseconds = TimeManager->GetNanosecondsSinceClassCreation();
+        if (Nanoseconds != 0)
+        {
+            printf("\eCCCCCC[\e00AEFF%lu.%07lu\eCCCCCC] ",
+                   Nanoseconds / 10000000,
+                   Nanoseconds % 10000000);
+        }
+    }
+
+    va_list args;
+    va_start(args, Format);
+    vprintf(Format, args);
+    va_end(args);
+
+    printf("\eCCCCCC\n");
+    if (!Config.BootAnimation && Display)
+        Display->SetBuffer(0);
+}
+
+EXTERNC NIF void Main(BootInfo *Info)
+{
+    Display = new Video::Display(bInfo.Framebuffer[0]);
+    KPrint("%s - %s [\e058C19%s\eFFFFFF]", KERNEL_NAME, KERNEL_VERSION, GIT_COMMIT_SHORT);
+    KPrint("CPU: \e058C19%s \e8822AA%s \e8888FF%s", CPU::Hypervisor(), CPU::Vendor(), CPU::Name());
+    if (DebuggerIsAttached)
+        KPrint("\eFFA500Kernel debugger detected.");
+
+    /**************************************************************************************/
+
+    KPrint("Initializing GDT and IDT");
+    Interrupts::Initialize(0);
+
+    KPrint("Loading Kernel Symbols");
+    KernelSymbolTable = new SymbolResolver::Symbols((uintptr_t)bInfo.Kernel.FileBase);
+
+    KPrint("Reading Kernel Parameters");
+    ParseConfig((char *)bInfo.Kernel.CommandLine, &Config);
+
+    if (Config.BootAnimation)
+    {
+        Display->CreateBuffer(0, 0, 1);
+
+        Display->SetDoNotScroll(true, 1);
+        Video::ScreenBuffer *buf = Display->GetBuffer(1);
+        Video::FontInfo fi = Display->GetCurrentFont()->GetInfo();
+        Display->SetBufferCursor(1, 0, buf->Height - fi.Height);
+        PutCharBufferIndex = 1;
+        printf("Fennix Operating System - %s [\e058C19%s\eFFFFFF]\n", KERNEL_VERSION, GIT_COMMIT_SHORT);
+        Display->SetBuffer(1);
+        PutCharBufferIndex = 0;
+    }
+
+    KPrint("Initializing CPU Features");
+    CPU::InitializeFeatures(0);
+
+    KPrint("Initializing Power Manager");
+    PowerManager = new Power::Power;
+
+#if defined(a64)
+    PowerManager->InitDSDT();
+#elif defined(a32)
+    // FIXME: Add ACPI support for i386
+#elif defined(aa64)
+#endif
+
+    KPrint("Enabling Interrupts on Bootstrap Processor");
+    Interrupts::Enable(0);
+
+    KPrint("Initializing Timers");
+    TimeManager = new Time::time;
+    TimeManager->FindTimers(PowerManager->GetACPI());
+
+    KPrint("Initializing PCI Manager");
+    PCIManager = new PCI::PCI;
+
+    foreach (auto Device in PCIManager->GetDevices())
+    {
+        KPrint("PCI: \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s",
+               PCI::Descriptors::GetVendorName(Device->VendorID),
+               PCI::Descriptors::GetDeviceName(Device->VendorID, Device->DeviceID),
+               PCI::Descriptors::DeviceClasses[Device->Class],
+               PCI::Descriptors::GetSubclassName(Device->Class, Device->Subclass),
+               PCI::Descriptors::GetProgIFName(Device->Class, Device->Subclass, Device->ProgIF));
+    }
+
+    KPrint("Initializing Bootstrap Processor Timer");
+    Interrupts::InitializeTimer(0);
+
+    KPrint("Initializing SMP");
+    SMP::Initialize(PowerManager->GetMADT());
+
+    if (SMBIOS::CheckSMBIOS())
+    {
+        SMBIOS::SMBIOSEntryPoint *smbios = SMBIOS::GetSMBIOSEntryPoint();
+        SMBIOS::SMBIOSBIOSInformation *bios = SMBIOS::GetBIOSInformation();
+        SMBIOS::SMBIOSSystemInformation *system = SMBIOS::GetSystemInformation();
+        SMBIOS::SMBIOSBaseBoardInformation *baseboard = SMBIOS::GetBaseBoardInformation();
+
+        debug("SMBIOS: %p", smbios);
+        debug("BIOS: %p", bios);
+        debug("System: %p", system);
+        debug("Baseboard: %p", baseboard);
+
+        if (smbios)
+            KPrint("SMBIOS: \eCCCCCCString:\e8888FF%.4s \eCCCCCCVersion (Major Minor):\e8888FF%d %d \eCCCCCCTable:\e8888FF%#x \eCCCCCCLength:\e8888FF%d",
+                   smbios->EntryPointString, smbios->MajorVersion, smbios->MinorVersion,
+                   smbios->TableAddress, smbios->TableLength);
+        else
+            KPrint("SMBIOS: \e8888FFSMBIOS found but not supported?");
+
+        if (bios)
+        {
+            const char *BIOSVendor = bios->GetString(bios->Vendor);
+            const char *BIOSVersion = bios->GetString(bios->Version);
+            const char *BIOSReleaseDate = bios->GetString(bios->ReleaseDate);
+            debug("%d %d %d", bios->Vendor, bios->Version, bios->ReleaseDate);
+            KPrint("BIOS: \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s",
+                   BIOSVendor, BIOSVersion, BIOSReleaseDate);
+        }
+
+        if (system)
+        {
+            const char *SystemManufacturer = system->GetString(system->Manufacturer);
+            const char *SystemProductName = system->GetString(system->ProductName);
+            const char *SystemVersion = system->GetString(system->Version);
+            const char *SystemSerialNumber = system->GetString(system->SerialNumber);
+            const char *SystemSKU = system->GetString(system->SKU);
+            const char *SystemFamily = system->GetString(system->Family);
+            debug("%d %d %d %d %c%c%c%c%c%c%c%c%c%c%c%c%c%c%c %d %d", system->Manufacturer, system->ProductName, system->Version,
+                  system->SerialNumber,
+                  system->UUID[0], system->UUID[1], system->UUID[2], system->UUID[3],
+                  system->UUID[4], system->UUID[5], system->UUID[6], system->UUID[7],
+                  system->UUID[8], system->UUID[9], system->UUID[10], system->UUID[11],
+                  system->UUID[12], system->UUID[13], system->UUID[14], system->UUID[15],
+                  system->SKU, system->Family);
+            KPrint("System: \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s",
+                   SystemManufacturer, SystemProductName, SystemVersion, SystemSerialNumber, SystemSKU, SystemFamily);
+        }
+
+        if (baseboard)
+        {
+            const char *Manufacturer = baseboard->GetString(baseboard->Manufacturer);
+            const char *Product = baseboard->GetString(baseboard->Product);
+            const char *Version = baseboard->GetString(baseboard->Version);
+            const char *SerialNumber = baseboard->GetString(baseboard->SerialNumber);
+            debug("%d %d %d %d", baseboard->Manufacturer, baseboard->Product, baseboard->Version, baseboard->SerialNumber);
+            KPrint("Baseboard: \eCCCCCC\e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s \eCCCCCC/ \e8888FF%s",
+                   Manufacturer, Product, Version, SerialNumber);
+        }
+    }
+    else
+        KPrint("SMBIOS: \eFF0000Not Found");
+
+    KPrint("Initializing Filesystem...");
+    vfs = new VirtualFileSystem::Virtual;
+
+    if (Config.BootAnimation)
+        bootanim_vfs = new VirtualFileSystem::Virtual;
+
+    for (size_t i = 0; i < MAX_MODULES; i++)
+    {
+        if (!bInfo.Modules[i].Address)
+            continue;
+
+        if (strcmp(bInfo.Modules[i].CommandLine, "initrd") == 0)
+        {
+            debug("Found initrd at %p", bInfo.Modules[i].Address);
+            static char initrd = 0;
+            if (!initrd++)
+                new VirtualFileSystem::USTAR((uintptr_t)bInfo.Modules[i].Address, vfs);
+        }
+        if (strcmp(bInfo.Modules[i].CommandLine, "bootanim") == 0 && Config.BootAnimation)
+        {
+            debug("Found bootanim at %p", bInfo.Modules[i].Address);
+            static char bootanim = 0;
+            if (!bootanim++)
+                new VirtualFileSystem::USTAR((uintptr_t)bInfo.Modules[i].Address, bootanim_vfs);
+        }
+    }
+
+    if (!vfs->PathExists("/system"))
+        vfs->Create("/system", NodeFlags::DIRECTORY);
+
+    if (!vfs->PathExists("/system/dev"))
+        DevFS = vfs->Create("/system/dev", NodeFlags::DIRECTORY);
+    else
+    {
+        File dev = vfs->Open("/system/dev");
+        if (dev.node->Flags != NodeFlags::DIRECTORY)
+        {
+            KPrint("\eE85230/system/dev is not a directory! Halting...");
+            CPU::Stop();
+        }
+        vfs->Close(dev);
+        DevFS = dev.node;
+    }
+
+    if (!vfs->PathExists("/system/mnt"))
+        MntFS = vfs->Create("/system/mnt", NodeFlags::DIRECTORY);
+    else
+    {
+        File mnt = vfs->Open("/system/mnt");
+        if (mnt.node->Flags != NodeFlags::DIRECTORY)
+        {
+            KPrint("\eE85230/system/mnt is not a directory! Halting...");
+            CPU::Stop();
+        }
+        vfs->Close(mnt);
+        MntFS = mnt.node;
+    }
+
+    if (!vfs->PathExists("/system/proc"))
+        ProcFS = vfs->Create("/system/proc", NodeFlags::DIRECTORY);
+    else
+    {
+        File proc = vfs->Open("/system/proc", nullptr);
+        if (proc.node->Flags != NodeFlags::DIRECTORY)
+        {
+            KPrint("\eE85230/system/proc is not a directory! Halting...");
+            CPU::Stop();
+        }
+        vfs->Close(proc);
+        ProcFS = proc.node;
+    }
+
+    KPrint("\e058C19################################");
+    TaskManager = new Tasking::Task((Tasking::IP)KernelMainThread);
+    CPU::Halt(true);
+}
+
+typedef void (*CallPtr)(void);
+extern CallPtr __init_array_start[0], __init_array_end[0];
+extern CallPtr __fini_array_start[0], __fini_array_end[0];
+
+EXTERNC __no_stack_protector NIF void Entry(BootInfo *Info)
+{
+    trace("Hello, World!");
+
+    if (strcmp(CPU::Hypervisor(), x86_CPUID_VENDOR_TCG) == 0)
+    {
+        debug("\n\n----------------------------------------\nDEBUGGER DETECTED\n----------------------------------------\n\n");
+        DebuggerIsAttached = true;
+    }
+
+    // https://wiki.osdev.org/Calling_Global_Constructors
+    for (CallPtr *func = __init_array_start; func != __init_array_end; func++)
+        (*func)();
+
+    InitializeMemoryManagement(Info);
+
+#ifdef DEBUG
+    /* I had to do this because KernelAllocator
+     * is a global constructor but we need
+     * memory management to be initialized first.
+     */
+    TestString();
+    TestMemoryAllocation();
+#endif
+
+    /* This is allocated in RAM. */
+    static BootInfo *bootInfo_temp = nullptr;
+    bootInfo_temp = Info; /* Info will be lost after changing the rsp and bsp. */
+
+    /* NO RETURN BEYOND THIS POINT */
+    void *KernelStack = KernelAllocator.RequestPages(TO_PAGES(STACK_SIZE));
+    asmv("mov %0, %%rsp"
+         :
+         : "r"(KernelStack)
+         : "memory");
+    asmv("mov $0, %rbp");
+
+    memcpy(&bInfo, bootInfo_temp, sizeof(BootInfo));
+    debug("BootInfo structure is at %p", &bInfo);
+
+    EnableProfiler = true;
+    Main(bootInfo_temp);
+}
+
+#pragma GCC diagnostic ignored "-Wdelete-non-virtual-dtor"
+
+EXTERNC __no_stack_protector void BeforeShutdown(bool Reboot)
+{
+    UNUSED(Reboot);
+    /* TODO: Announce shutdown */
+
+    trace("\n\n\n#################### SYSTEM SHUTTING DOWN ####################\n\n");
+
+    if (RecoveryScreen)
+        delete RecoveryScreen, RecoveryScreen = nullptr;
+
+    if (NIManager)
+        delete NIManager, NIManager = nullptr;
+
+    if (DiskManager)
+        delete DiskManager, DiskManager = nullptr;
+
+    if (DriverManager)
+        delete DriverManager, DriverManager = nullptr;
+
+    if (TaskManager)
+    {
+        TaskManager->SignalShutdown();
+        delete TaskManager, TaskManager = nullptr;
+    }
+
+    if (vfs)
+        delete vfs, vfs = nullptr;
+
+    if (bootanim_vfs)
+        delete bootanim_vfs, bootanim_vfs = nullptr;
+
+    if (TimeManager)
+        delete TimeManager, TimeManager = nullptr;
+
+    if (Display)
+        delete Display, Display = nullptr;
+    // PowerManager should not be called
+
+    // https://wiki.osdev.org/Calling_Global_Constructors
+    debug("Calling destructors...");
+    for (CallPtr *func = __fini_array_start; func != __fini_array_end; func++)
+        (*func)();
+    debug("Done.");
+}
+
+EXTERNC void TaskingPanic()
+{
+    if (TaskManager)
+        TaskManager->Panic();
+}
diff --git a/Kernel/KernelConfig.cpp b/Kernel/KernelConfig.cpp
new file mode 100644
index 00000000..2af0ec44
--- /dev/null
+++ b/Kernel/KernelConfig.cpp
@@ -0,0 +1,271 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <kconfig.hpp>
+
+#include <convert.h>
+#include <cargs.h>
+#include <printf.h>
+#include <targp.h>
+
+#include "kernel.h"
+
+// TODO: Implement proper fprintf
+EXTERNC void fprintf(FILE *stream, const char *Format, ...)
+{
+    va_list args;
+    va_start(args, Format);
+    vprintf(Format, args);
+    va_end(args);
+    UNUSED(stream);
+}
+
+// TODO: Implement proper fputs
+EXTERNC void fputs(const char *s, FILE *stream)
+{
+    printf("%s", s);
+    UNUSED(stream);
+}
+
+static struct cag_option ConfigOptions[] = {
+    {.identifier = 'a',
+     .access_letters = "aA",
+     .access_name = "alloc",
+     .value_name = "TYPE",
+     .description = "Memory allocator to use"},
+
+    {.identifier = 'c',
+     .access_letters = "cC",
+     .access_name = "cores",
+     .value_name = "VALUE",
+     .description = "Number of cores to use (0 = all; 1 is the first code, not 0)"},
+
+    {.identifier = 'p',
+     .access_letters = "pP",
+     .access_name = "ioapicirq",
+     .value_name = "VALUE",
+     .description = "Which core will be used for I/O APIC interrupts"},
+
+    {.identifier = 't',
+     .access_letters = "tT",
+     .access_name = "tasking",
+     .value_name = "MODE",
+     .description = "Tasking mode (multi, single)"},
+
+    {.identifier = 'd',
+     .access_letters = "dD",
+     .access_name = "drvdir",
+     .value_name = "PATH",
+     .description = "Directory to load drivers from"},
+
+    {.identifier = 'i',
+     .access_letters = "iI",
+     .access_name = "init",
+     .value_name = "PATH",
+     .description = "Path to init program"},
+
+    {.identifier = 'l',
+     .access_letters = NULL,
+     .access_name = "udl",
+     .value_name = "BOOL",
+     .description = "Unlock the deadlock after 10 retries"},
+
+    {.identifier = 'o',
+     .access_letters = NULL,
+     .access_name = "ioc",
+     .value_name = "BOOL",
+     .description = "Enable Interrupts On Crash. If enabled, the navigation keys will be enabled on crash"},
+
+    {.identifier = 's',
+     .access_letters = NULL,
+     .access_name = "simd",
+     .value_name = "BOOL",
+     .description = "Enable SIMD instructions"},
+
+    {.identifier = 'b',
+     .access_letters = NULL,
+     .access_name = "bootanim",
+     .value_name = "BOOL",
+     .description = "Enable boot animation"},
+
+    {.identifier = 'h',
+     .access_letters = "h",
+     .access_name = "help",
+     .value_name = NULL,
+     .description = "Show help on screen and halt"}};
+
+void ParseConfig(char *ConfigString, KernelConfig *ModConfig)
+{
+    if (ConfigString == NULL)
+    {
+        KPrint("Empty kernel parameters!");
+        return;
+    }
+    else if (strlen(ConfigString) == 0)
+    {
+        KPrint("Empty kernel parameters!");
+        return;
+    }
+
+    if (ModConfig == NULL)
+    {
+        KPrint("ModConfig is NULL!");
+        return;
+    }
+
+    KPrint("Kernel parameters: %s", ConfigString);
+    debug("Kernel parameters: %s", ConfigString);
+
+    char *argv[32];
+    int argc = 0;
+    /* Not sure if the quotes are being parsed correctly. */
+    targp_parse(ConfigString, argv, &argc);
+
+#ifdef DEBUG
+    for (int i = 0; i < argc; i++)
+        debug("argv[%d] = %s", i, argv[i]);
+    debug("argc = %d", argc);
+#endif
+
+    char identifier;
+    const char *value;
+    cag_option_context context;
+
+    cag_option_prepare(&context, ConfigOptions, CAG_ARRAY_SIZE(ConfigOptions), argc, argv);
+
+    while (cag_option_fetch(&context))
+    {
+        identifier = cag_option_get(&context);
+        switch (identifier)
+        {
+        case 'a':
+        {
+            value = cag_option_get_value(&context);
+            if (strcmp(value, "xallocv1") == 0)
+            {
+                KPrint("\eAAFFAAUsing XallocV1 as memory allocator");
+                ModConfig->AllocatorType = Memory::MemoryAllocatorType::XallocV1;
+            }
+            else if (strcmp(value, "liballoc11") == 0)
+            {
+                KPrint("\eAAFFAAUsing Liballoc11 as memory allocator");
+                ModConfig->AllocatorType = Memory::MemoryAllocatorType::liballoc11;
+            }
+            else if (strcmp(value, "pages") == 0)
+            {
+                KPrint("\eAAFFAAUsing Pages as memory allocator");
+                ModConfig->AllocatorType = Memory::MemoryAllocatorType::Pages;
+            }
+            else
+            {
+                KPrint("\eAAFFAAUnknown memory allocator: %s", value);
+                ModConfig->AllocatorType = Memory::MemoryAllocatorType::None;
+            }
+            break;
+        }
+        case 'c':
+        {
+            value = cag_option_get_value(&context);
+            KPrint("\eAAFFAAUsing %s cores", atoi(value) ? value : "all");
+            ModConfig->Cores = atoi(value);
+            break;
+        }
+        case 'p':
+        {
+            value = cag_option_get_value(&context);
+            KPrint("\eAAFFAARedirecting I/O APIC interrupts to %s%s", atoi(value) ? "core " : "", atoi(value) ? value : "BSP");
+            ModConfig->IOAPICInterruptCore = atoi(value);
+            break;
+        }
+        case 't':
+        {
+            value = cag_option_get_value(&context);
+            if (strcmp(value, "multi") == 0)
+            {
+                KPrint("\eAAFFAAUsing Multi-Tasking Scheduler");
+                ModConfig->SchedulerType = 1;
+            }
+            else if (strcmp(value, "single") == 0)
+            {
+                KPrint("\eAAFFAAUsing Single-Tasking Scheduler");
+                ModConfig->SchedulerType = 0;
+            }
+            else
+            {
+                KPrint("\eAAFFAAUnknown scheduler: %s", value);
+                ModConfig->SchedulerType = 1;
+            }
+            break;
+        }
+        case 'd':
+        {
+            value = cag_option_get_value(&context);
+            strncpy(ModConfig->DriverDirectory, value, strlen(value));
+            KPrint("\eAAFFAAUsing %s as driver directory", value);
+            break;
+        }
+        case 'i':
+        {
+            value = cag_option_get_value(&context);
+            strncpy(ModConfig->InitPath, value, strlen(value));
+            KPrint("\eAAFFAAUsing %s as init program", value);
+            break;
+        }
+        case 'o':
+        {
+            value = cag_option_get_value(&context);
+            strcmp(value, "true") == 0 ? ModConfig->InterruptsOnCrash = true : ModConfig->InterruptsOnCrash = false;
+            KPrint("\eAAFFAAInterrupts on crash: %s", value);
+            break;
+        }
+        case 'l':
+        {
+            value = cag_option_get_value(&context);
+            strcmp(value, "true") == 0 ? ModConfig->UnlockDeadLock = true : ModConfig->UnlockDeadLock = false;
+            KPrint("\eAAFFAAUnlocking the deadlock after 10 retries");
+            break;
+        }
+        case 's':
+        {
+            value = cag_option_get_value(&context);
+            strcmp(value, "true") == 0 ? ModConfig->SIMD = true : ModConfig->SIMD = false;
+            KPrint("\eAAFFAASingle Instruction, Multiple Data (SIMD): %s", value);
+            break;
+        }
+        case 'b':
+        {
+            value = cag_option_get_value(&context);
+            strcmp(value, "true") == 0 ? ModConfig->BootAnimation = true : ModConfig->BootAnimation = false;
+            KPrint("\eAAFFAABoot animation: %s", value);
+            break;
+        }
+        case 'h':
+        {
+            KPrint("\n---------------------------------------------------------------------------\nUsage: kernel.fsys [OPTION]...\nKernel configuration.");
+            cag_option_print(ConfigOptions, CAG_ARRAY_SIZE(ConfigOptions), nullptr);
+            KPrint("\eFF2200System Halted.");
+            CPU::Stop();
+        }
+        default:
+        {
+            KPrint("\eFF2200Unknown option: %c", identifier);
+            break;
+        }
+        }
+    }
+    debug("Config loaded");
+}
diff --git a/Kernel/KernelThread.cpp b/Kernel/KernelThread.cpp
new file mode 100644
index 00000000..360c84a3
--- /dev/null
+++ b/Kernel/KernelThread.cpp
@@ -0,0 +1,473 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "kernel.h"
+
+#include <filesystem/ustar.hpp>
+#include <power.hpp>
+#include <lock.hpp>
+#include <printf.h>
+#include <exec.hpp>
+#include <cwalk.h>
+#include <vector>
+
+#define STB_IMAGE_IMPLEMENTATION
+#define STBI_NO_STDIO
+#define STBI_NO_LINEAR
+#define STBI_NO_THREAD_LOCALS
+#define STBI_NO_HDR
+#define STBI_ONLY_TGA
+#include <stb/image.h>
+
+#include "DAPI.hpp"
+#include "Fex.hpp"
+
+using VirtualFileSystem::File;
+using VirtualFileSystem::FileStatus;
+using VirtualFileSystem::Node;
+using VirtualFileSystem::NodeFlags;
+
+Driver::Driver *DriverManager = nullptr;
+Disk::Manager *DiskManager = nullptr;
+NetworkInterfaceManager::NetworkInterface *NIManager = nullptr;
+Recovery::KernelRecovery *RecoveryScreen = nullptr;
+VirtualFileSystem::Node *DevFS = nullptr;
+VirtualFileSystem::Node *MntFS = nullptr;
+VirtualFileSystem::Node *ProcFS = nullptr;
+
+NewLock(ShutdownLock);
+
+#ifdef DEBUG
+void TreeFS(Node *node, int Depth)
+{
+    return;
+    foreach (auto Chld in node->Children)
+    {
+        printf("%*c %s\eFFFFFF\n", Depth, ' ', Chld->Name);
+        if (!Config.BootAnimation)
+            Display->SetBuffer(0);
+        TaskManager->Sleep(100);
+        TreeFS(Chld, Depth + 1);
+    }
+}
+
+const char *Statuses[] = {
+    "FF0000", /* Unknown */
+    "AAFF00", /* Ready */
+    "00AA00", /* Running */
+    "FFAA00", /* Sleeping */
+    "FFAA00", /* Waiting */
+    "FF0088", /* Stopped */
+    "FF0000", /* Terminated */
+};
+
+const char *StatusesSign[] = {
+    "Unknown",
+    "Ready",
+    "Run",
+    "Sleep",
+    "Wait",
+    "Stop",
+    "Terminated",
+};
+
+const char *SuccessSourceStrings[] = {
+    "Unknown",
+    "GetNextAvailableThread",
+    "GetNextAvailableProcess",
+    "SchedulerSearchProcessThread",
+};
+
+void TaskMgr_Dummy100Usage()
+{
+    while (1)
+        ;
+}
+
+void TaskMgr_Dummy0Usage()
+{
+    while (1)
+        TaskManager->Sleep(1000000);
+}
+
+uint64_t GetUsage(uint64_t OldSystemTime, Tasking::TaskInfo *Info)
+{
+    /* https://github.com/reactos/reactos/blob/560671a784c1e0e0aa7590df5e0598c1e2f41f5a/base/applications/taskmgr/perfdata.c#L347 */
+    if (Info->OldKernelTime || Info->OldUserTime)
+    {
+        uint64_t SystemTime = TimeManager->GetCounter() - OldSystemTime;
+        uint64_t CurrentTime = Info->KernelTime + Info->UserTime;
+        uint64_t OldTime = Info->OldKernelTime + Info->OldUserTime;
+        uint64_t CpuUsage = (CurrentTime - OldTime) / SystemTime;
+        CpuUsage = CpuUsage * 100;
+
+        // debug("CurrentTime: %ld OldTime: %ld Time Diff: %ld Usage: %ld%%",
+        //       CurrentTime, OldTime, SystemTime, CpuUsage);
+
+        Info->OldKernelTime = Info->KernelTime;
+        Info->OldUserTime = Info->UserTime;
+        return CpuUsage;
+    }
+    Info->OldKernelTime = Info->KernelTime;
+    Info->OldUserTime = Info->UserTime;
+    return 0;
+}
+
+void TaskMgr()
+{
+    TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)TaskMgr_Dummy100Usage)->Rename("Dummy 100% Usage");
+    TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)TaskMgr_Dummy0Usage)->Rename("Dummy 0% Usage");
+
+    while (1)
+    {
+        static int sanity = 0;
+        Video::ScreenBuffer *sb = Display->GetBuffer(0);
+        for (short i = 0; i < 500; i++)
+        {
+            for (short j = 0; j < 500; j++)
+            {
+                uint32_t *Pixel = (uint32_t *)((uintptr_t)sb->Buffer + (j * sb->Width + i) * (bInfo.Framebuffer[0].BitsPerPixel / 8));
+                *Pixel = 0x222222;
+            }
+        }
+
+        uint32_t tmpX, tmpY;
+        Display->GetBufferCursor(0, &tmpX, &tmpY);
+        Display->SetBufferCursor(0, 0, 0);
+        printf("\eF02C21Task Manager\n");
+        static uint64_t OldSystemTime = 0;
+        foreach (auto Proc in TaskManager->GetProcessList())
+        {
+            int Status = Proc->Status;
+            uint64_t ProcessCpuUsage = GetUsage(OldSystemTime, &Proc->Info);
+            printf("\e%s-> \eAABBCC%s \e00AAAA%s %ld%% (KT: %ld UT: %ld)\n",
+                   Statuses[Status], Proc->Name, StatusesSign[Status], ProcessCpuUsage, Proc->Info.KernelTime, Proc->Info.UserTime);
+
+            foreach (auto Thd in Proc->Threads)
+            {
+                Status = Thd->Status;
+                uint64_t ThreadCpuUsage = GetUsage(OldSystemTime, &Thd->Info);
+                printf("  \e%s-> \eAABBCC%s \e00AAAA%s %ld%% (KT: %ld UT: %ld)\n\eAABBCC",
+                       Statuses[Status], Thd->Name, StatusesSign[Status], ThreadCpuUsage, Thd->Info.KernelTime, Thd->Info.UserTime);
+            }
+        }
+        OldSystemTime = TimeManager->GetCounter();
+#if defined(a64)
+        register uintptr_t CurrentStackAddress asm("rsp");
+#elif defined(a32)
+        register uintptr_t CurrentStackAddress asm("esp");
+#elif defined(aa64)
+        register uintptr_t CurrentStackAddress asm("sp");
+#endif
+        printf("Sanity: %d, Stack: %#lx", sanity++, CurrentStackAddress);
+        if (sanity > 1000)
+            sanity = 0;
+        Display->SetBufferCursor(0, tmpX, tmpY);
+        if (!Config.BootAnimation)
+            Display->SetBuffer(0);
+
+        TaskManager->Sleep(100);
+    }
+}
+#endif
+
+Execute::SpawnData SpawnInit()
+{
+    const char *envp[5] = {
+        "PATH=/system:/system/bin",
+        "TERM=tty",
+        "HOME=/",
+        "USER=root",
+        nullptr};
+
+    const char *argv[4] = {
+        Config.InitPath,
+        "--init",
+        "--critical",
+        nullptr};
+
+    return Execute::Spawn(Config.InitPath, argv, envp);
+}
+
+/* Files: 0.tga 1.tga ... 26.tga */
+void *Frames[27];
+uint32_t FrameSizes[27];
+uint32_t FrameCount = 1;
+
+void BootLogoAnimationThread()
+{
+    char BootAnimPath[16];
+    while (FrameCount < 27)
+    {
+        sprintf(BootAnimPath, "%d.tga", FrameCount);
+        File ba = bootanim_vfs->Open(BootAnimPath);
+        if (!ba.IsOK())
+        {
+            bootanim_vfs->Close(ba);
+            debug("Failed to load boot animation frame %s", BootAnimPath);
+            break;
+        }
+
+        FrameSizes[FrameCount] = s_cst(uint32_t, ba.node->Length);
+        Frames[FrameCount] = new uint8_t[ba.node->Length];
+        memcpy((void *)Frames[FrameCount], (void *)ba.node->Address, ba.node->Length);
+        bootanim_vfs->Close(ba);
+        FrameCount++;
+    }
+
+    uint32_t DispX = Display->GetBuffer(1)->Width;
+    uint32_t DispY = Display->GetBuffer(1)->Height;
+
+    for (size_t i = 1; i < FrameCount; i++)
+    {
+        int x, y, channels;
+
+        if (!stbi_info_from_memory((uint8_t *)Frames[i], FrameSizes[i], &x, &y, &channels))
+            continue;
+
+        uint8_t *img = stbi_load_from_memory((uint8_t *)Frames[i], FrameSizes[i], &x, &y, &channels, STBI_rgb_alpha);
+
+        if (img == NULL)
+            continue;
+
+        int offsetX = DispX / 2 - x / 2;
+        int offsetY = DispY / 2 - y / 2;
+
+        for (int i = 0; i < x * y; i++)
+        {
+            uint32_t pixel = ((uint32_t *)img)[i];
+            int r = (pixel >> 16) & 0xFF;
+            int g = (pixel >> 8) & 0xFF;
+            int b = (pixel >> 0) & 0xFF;
+            int a = (pixel >> 24) & 0xFF;
+
+            if (a != 0xFF)
+            {
+                r = (r * a) / 0xFF;
+                g = (g * a) / 0xFF;
+                b = (b * a) / 0xFF;
+            }
+
+            Display->SetPixel((i % x) + offsetX, (i / x) + offsetY, (r << 16) | (g << 8) | (b << 0), 1);
+        }
+
+        free(img);
+        Display->SetBuffer(1);
+        TaskManager->Sleep(50);
+    }
+
+    int brightness = 100;
+    while (brightness >= 0)
+    {
+        brightness -= 10;
+        Display->SetBrightness(brightness, 1);
+        Display->SetBuffer(1);
+        TaskManager->Sleep(5);
+    }
+}
+
+void ExitLogoAnimationThread()
+{
+    Display->SetBrightness(100, 1);
+    Display->SetBuffer(1);
+
+    /* Files: 26.tga 25.tga ... 1.tga */
+    uint32_t DispX = Display->GetBuffer(1)->Width;
+    uint32_t DispY = Display->GetBuffer(1)->Height;
+
+    for (size_t i = 40; i > 25; i--)
+    {
+        int x, y, channels;
+
+        if (!stbi_info_from_memory((uint8_t *)Frames[i], FrameSizes[i], &x, &y, &channels))
+            continue;
+
+        uint8_t *img = stbi_load_from_memory((uint8_t *)Frames[i], FrameSizes[i], &x, &y, &channels, STBI_rgb_alpha);
+
+        if (img == NULL)
+            continue;
+
+        int offsetX = DispX / 2 - x / 2;
+        int offsetY = DispY / 2 - y / 2;
+
+        for (int i = 0; i < x * y; i++)
+        {
+            uint32_t pixel = ((uint32_t *)img)[i];
+            int r = (pixel >> 16) & 0xFF;
+            int g = (pixel >> 8) & 0xFF;
+            int b = (pixel >> 0) & 0xFF;
+            int a = (pixel >> 24) & 0xFF;
+
+            if (a != 0xFF)
+            {
+                r = (r * a) / 0xFF;
+                g = (g * a) / 0xFF;
+                b = (b * a) / 0xFF;
+            }
+
+            Display->SetPixel((i % x) + offsetX, (i / x) + offsetY, (r << 16) | (g << 8) | (b << 0), 1);
+        }
+
+        free(img);
+        Display->SetBuffer(1);
+        TaskManager->Sleep(50);
+    }
+
+    int brightness = 100;
+    while (brightness >= 0)
+    {
+        brightness -= 10;
+        Display->SetBrightness(brightness, 1);
+        Display->SetBuffer(1);
+        TaskManager->Sleep(5);
+    }
+}
+
+void CleanupProcessesThreadWrapper() { TaskManager->CleanupProcessesThread(); }
+
+void KernelMainThread()
+{
+    Tasking::TCB *clnThd = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)CleanupProcessesThreadWrapper);
+    clnThd->SetPriority(Tasking::Idle);
+    TaskManager->SetCleanupThread(clnThd);
+    TaskManager->GetCurrentThread()->SetPriority(Tasking::Critical);
+
+    Tasking::TCB *blaThread = nullptr;
+
+    if (Config.BootAnimation)
+    {
+        blaThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)BootLogoAnimationThread);
+        blaThread->Rename("Logo Animation");
+    }
+
+#ifdef DEBUG
+    /* TODO: This should not be enabled because it may cause a deadlock. Not sure where or how. */
+    // Tasking::PCB *tskMgr = TaskManager->CreateProcess(TaskManager->GetCurrentProcess(), "Debug Task Manager", Tasking::TaskTrustLevel::Kernel);
+    // TaskManager->CreateThread(tskMgr, (Tasking::IP)TaskMgr)->SetPriority(Tasking::Low);
+
+    TreeFS(vfs->GetRootNode(), 0);
+#endif
+
+    KPrint("Kernel Compiled at: %s %s with C++ Standard: %d", __DATE__, __TIME__, CPP_LANGUAGE_STANDARD);
+    KPrint("C++ Language Version (__cplusplus): %ld", __cplusplus);
+
+    KPrint("Initializing Disk Manager...");
+    DiskManager = new Disk::Manager;
+
+    KPrint("Loading Drivers...");
+    DriverManager = new Driver::Driver;
+
+    KPrint("Fetching Disks...");
+    if (DriverManager->GetDrivers().size() > 0)
+    {
+        foreach (auto Driver in DriverManager->GetDrivers())
+            if (((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.Type == FexDriverType::FexDriverType_Storage)
+                DiskManager->FetchDisks(Driver.DriverUID);
+    }
+    else
+        KPrint("\eE85230No disk drivers found! Cannot fetch disks!");
+
+    KPrint("Initializing Network Interface Manager...");
+    NIManager = new NetworkInterfaceManager::NetworkInterface;
+    KPrint("Starting Network Interface Manager...");
+    NIManager->StartService();
+
+    printf("\eCCCCCC[\e00AEFFKernel Thread\eCCCCCC] Setting up userspace");
+    if (!Config.BootAnimation)
+        Display->SetBuffer(0);
+
+    Execute::SpawnData ret = {Execute::ExStatus::Unknown, nullptr, nullptr};
+    Tasking::TCB *ExecuteThread = nullptr;
+    int ExitCode = -1;
+    ExecuteThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)Execute::StartExecuteService);
+    ExecuteThread->Rename("Library Manager");
+    ExecuteThread->SetCritical(true);
+    ExecuteThread->SetPriority(Tasking::Idle);
+
+    Display->Print('.', 0);
+    if (!Config.BootAnimation)
+        Display->SetBuffer(0);
+
+    ret = SpawnInit();
+
+    Display->Print('.', 0);
+    if (!Config.BootAnimation)
+        Display->SetBuffer(0);
+
+    if (ret.Status != Execute::ExStatus::OK)
+    {
+        KPrint("\eE85230Failed to start %s! Code: %d", Config.InitPath, ret.Status);
+        goto Exit;
+    }
+    ret.Thread->SetCritical(true);
+    TaskManager->GetSecurityManager()->TrustToken(ret.Process->Security.UniqueToken, Tasking::TTL::FullTrust);
+    TaskManager->GetSecurityManager()->TrustToken(ret.Thread->Security.UniqueToken, Tasking::TTL::FullTrust);
+
+    Display->Print('.', 0);
+    Display->Print('\n', 0);
+    if (!Config.BootAnimation)
+        Display->SetBuffer(0);
+
+    KPrint("Waiting for \e22AAFF%s\eCCCCCC to start...", Config.InitPath);
+    TaskManager->GetCurrentThread()->SetPriority(Tasking::Idle);
+
+    TaskManager->WaitForThread(ret.Thread);
+    ExitCode = ret.Thread->GetExitCode();
+Exit:
+    if (ExitCode != 0)
+    {
+        KPrint("\eE85230Userspace process exited with code %d", ExitCode);
+        KPrint("Dropping to recovery screen...");
+        TaskManager->Sleep(2500);
+        TaskManager->WaitForThread(blaThread);
+        RecoveryScreen = new Recovery::KernelRecovery;
+    }
+    else
+    {
+        KPrint("\eFF7900%s process exited with code %d and it didn't invoked the shutdown function.",
+               Config.InitPath, ExitCode);
+        KPrint("System Halted");
+    }
+    CPU::Halt(true);
+}
+
+void __no_stack_protector KernelShutdownThread(bool Reboot)
+{
+    SmartLock(ShutdownLock);
+    debug("KernelShutdownThread(%s)", Reboot ? "true" : "false");
+    if (Config.BootAnimation && TaskManager)
+    {
+        if (RecoveryScreen)
+            delete RecoveryScreen, RecoveryScreen = nullptr;
+
+        Tasking::TCB *elaThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)ExitLogoAnimationThread);
+        elaThread->Rename("Logo Animation");
+        TaskManager->WaitForThread(elaThread);
+    }
+
+    BeforeShutdown(Reboot);
+
+    trace("%s...", Reboot ? "Rebooting" : "Shutting down");
+    if (Reboot)
+        PowerManager->Reboot();
+    else
+        PowerManager->Shutdown();
+    CPU::Stop();
+}
+
+void KST_Reboot() { KernelShutdownThread(true); }
+void KST_Shutdown() { KernelShutdownThread(false); }
diff --git a/Kernel/LICENSE b/Kernel/LICENSE
new file mode 100644
index 00000000..314c5968
--- /dev/null
+++ b/Kernel/LICENSE
@@ -0,0 +1,676 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    A kernel that serves as the core of an operating system, managing
+    hardware resources and providing essential services to user-level
+    applications.
+    Copyright (C) 2023  EnderIce2
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    Fennix Kernel  Copyright (C) 2023  EnderIce2
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.
diff --git a/Kernel/Library/Bitmap.cpp b/Kernel/Library/Bitmap.cpp
new file mode 100644
index 00000000..391d77b4
--- /dev/null
+++ b/Kernel/Library/Bitmap.cpp
@@ -0,0 +1,45 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <bitmap.hpp>
+
+bool Bitmap::operator[](uint64_t index) { return Get(index); }
+
+bool Bitmap::Get(uint64_t index)
+{
+    if (index > Size * 8)
+        return false;
+    uint64_t byteIndex = index / 8;
+    uint8_t bitIndex = index % 8;
+    uint8_t bitIndexer = 0b10000000 >> bitIndex;
+    if ((Buffer[byteIndex] & bitIndexer) > 0)
+        return true;
+    return false;
+}
+
+bool Bitmap::Set(uint64_t index, bool value)
+{
+    if (index > Size * 8)
+        return false;
+    uint64_t byteIndex = index / 8;
+    uint8_t bitIndex = index % 8;
+    uint8_t bitIndexer = 0b10000000 >> bitIndex;
+    Buffer[byteIndex] &= ~bitIndexer;
+    if (value)
+        Buffer[byteIndex] |= bitIndexer;
+    return true;
+}
diff --git a/Kernel/Library/Convert.cpp b/Kernel/Library/Convert.cpp
new file mode 100644
index 00000000..9e9ed742
--- /dev/null
+++ b/Kernel/Library/Convert.cpp
@@ -0,0 +1,1081 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <convert.h>
+
+#include <memory.hpp>
+#include <limits.h>
+#include <debug.h>
+#include <cpu.hpp>
+#ifdef DEBUG
+#include <uart.hpp>
+#endif
+
+#include "../kernel.h"
+
+EXTERNC int memcmp(const void *vl, const void *vr, size_t n)
+{
+    const unsigned char *l = (unsigned char *)vl, *r = (unsigned char *)vr;
+    for (; n && *l == *r; n--, l++, r++)
+        ;
+    return n ? *l - *r : 0;
+}
+
+EXTERNC void backspace(char s[])
+{
+    int len = s_cst(int, strlen(s));
+    s[len - 1] = '\0';
+}
+
+EXTERNC void append(char s[], char n)
+{
+    int len = s_cst(int, strlen(s));
+    s[len] = n;
+    s[len + 1] = '\0';
+}
+
+EXTERNC int strncmp(const char *s1, const char *s2, size_t n)
+{
+    for (size_t i = 0; i < n; i++)
+    {
+        char c1 = s1[i], c2 = s2[i];
+        if (c1 != c2)
+            return c1 - c2;
+        if (!c1)
+            return 0;
+    }
+    return 0;
+}
+
+EXTERNC long unsigned strlen(const char s[])
+{
+    long unsigned i = 0;
+    if (s)
+        while (s[i] != '\0')
+            ++i;
+    return i;
+}
+
+EXTERNC char *strcat_unsafe(char *destination, const char *source)
+{
+    if ((destination == NULL) || (source == NULL))
+        return NULL;
+    char *start = destination;
+    while (*start != '\0')
+    {
+        start++;
+    }
+    while (*source != '\0')
+    {
+        *start++ = *source++;
+    }
+    *start = '\0';
+    return destination;
+}
+
+EXTERNC char *strcpy_unsafe(char *destination, const char *source)
+{
+    if (destination == NULL)
+        return NULL;
+    char *ptr = destination;
+    while (*source != '\0')
+    {
+        *destination = *source;
+        destination++;
+        source++;
+    }
+    *destination = '\0';
+    return ptr;
+}
+
+EXTERNC char *strncpy(char *destination, const char *source, unsigned long num)
+{
+    if (destination == NULL)
+        return NULL;
+    char *ptr = destination;
+    while (*source && num--)
+    {
+        *destination = *source;
+        destination++;
+        source++;
+    }
+    *destination = '\0';
+    return ptr;
+}
+
+EXTERNC int strcmp(const char *l, const char *r)
+{
+    for (; *l == *r && *l; l++, r++)
+        ;
+    return *(unsigned char *)l - *(unsigned char *)r;
+}
+
+EXTERNC char *strstr(const char *haystack, const char *needle)
+{
+    const char *a = haystack, *b = needle;
+    while (1)
+    {
+        if (!*b)
+            return (char *)haystack;
+        if (!*a)
+            return NULL;
+        if (*a++ != *b++)
+        {
+            a = ++haystack;
+            b = needle;
+        }
+    }
+}
+
+EXTERNC char *strchr(const char *String, int Char)
+{
+    while (*String != (char)Char)
+    {
+        if (!*String++)
+            return 0;
+    }
+    return (char *)String;
+}
+
+EXTERNC char *strdup(const char *String)
+{
+    char *OutBuffer = (char *)kmalloc(strlen((char *)String) + 1);
+    strncpy(OutBuffer, String, strlen(String) + 1);
+    return OutBuffer;
+}
+
+EXTERNC int isalpha(int c)
+{
+    return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
+}
+
+EXTERNC int isupper(int c)
+{
+    return (c >= 'A' && c <= 'Z');
+}
+
+EXTERNC long int strtol(const char *str, char **endptr, int base)
+{
+    const char *s;
+    long acc, cutoff;
+    int c;
+    int neg, any, cutlim;
+
+    s = str;
+    do
+    {
+        c = *s++;
+    } while (isspace(c));
+    if (c == '-')
+    {
+        neg = 1;
+        c = *s++;
+    }
+    else
+    {
+        neg = 0;
+        if (c == '+')
+            c = *s++;
+    }
+    if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))
+    {
+        c = s[1];
+        s += 2;
+        base = 16;
+    }
+    if (base == 0)
+        base = c == '0' ? 8 : 10;
+
+    cutoff = neg ? LONG_MIN : LONG_MAX;
+    cutlim = s_cst(int, cutoff % base);
+    cutoff /= base;
+    for (acc = 0, any = 0;; c = *s++)
+    {
+        if (isdigit(c))
+            c -= '0';
+        else if (isalpha(c))
+            c -= isupper(c) ? 'A' - 10 : 'a' - 10;
+        else
+            break;
+        if (c >= base)
+            break;
+        if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
+            any = -1;
+        else
+        {
+            any = 1;
+            acc *= base;
+            acc += c;
+        }
+    }
+    if (any < 0)
+    {
+        acc = neg ? LONG_MIN : LONG_MAX;
+    }
+    else if (neg)
+        acc = -acc;
+    if (endptr != 0)
+        *endptr = (char *)(any ? s - 1 : str);
+    return (acc);
+}
+
+EXTERNC unsigned long int strtoul(const char *str, char **endptr, int base)
+{
+    const char *s;
+    unsigned long acc, cutoff;
+    int c;
+    int neg, any, cutlim;
+
+    s = str;
+    do
+    {
+        c = *s++;
+    } while (isspace(c));
+    if (c == '-')
+    {
+        neg = 1;
+        c = *s++;
+    }
+    else
+    {
+        neg = 0;
+        if (c == '+')
+            c = *s++;
+    }
+    if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))
+    {
+        c = s[1];
+        s += 2;
+        base = 16;
+    }
+    if (base == 0)
+        base = c == '0' ? 8 : 10;
+
+    cutoff = neg ? LONG_MIN : LONG_MAX;
+    cutlim = s_cst(int, cutoff % base);
+    cutoff /= base;
+    for (acc = 0, any = 0;; c = *s++)
+    {
+        if (isdigit(c))
+            c -= '0';
+        else if (isalpha(c))
+            c -= isupper(c) ? 'A' - 10 : 'a' - 10;
+        else
+            break;
+        if (c >= base)
+            break;
+        if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
+            any = -1;
+        else
+        {
+            any = 1;
+            acc *= base;
+            acc += c;
+        }
+    }
+    if (any < 0)
+    {
+        acc = neg ? LONG_MIN : LONG_MAX;
+    }
+    else if (neg)
+        acc = -acc;
+    if (endptr != 0)
+        *endptr = (char *)(any ? s - 1 : str);
+    return (acc);
+}
+
+EXTERNC int isdigit(int c)
+{
+    return c >= '0' && c <= '9';
+}
+
+EXTERNC int isspace(int c)
+{
+    return c == ' ' || c == '\t' || c == '\r' || c == '\n' || c == '\f' || c == '\v';
+}
+
+EXTERNC int isempty(char *str)
+{
+    if (strlen(str) == 0)
+        return 1;
+    while (*str != '\0')
+    {
+        if (!isspace(*str))
+            return 0;
+        str++;
+    }
+    return 1;
+}
+
+EXTERNC unsigned int isdelim(char c, const char *delim)
+{
+    while (*delim != '\0')
+    {
+        if (c == *delim)
+            return 1;
+        delim++;
+    }
+    return 0;
+}
+
+EXTERNC long abs(long i) { return i < 0 ? -i : i; }
+
+EXTERNC void swap(char *x, char *y)
+{
+    char t = *x;
+    *x = *y;
+    *y = t;
+}
+
+EXTERNC char *reverse(char *Buffer, int i, int j)
+{
+    while (i < j)
+        swap(&Buffer[i++], &Buffer[j--]);
+    return Buffer;
+}
+
+EXTERNC float sqrtf(float x)
+{
+    if (x < 0.0f)
+        return NAN;
+
+    if (x < 1e-7f)
+        return 0.0f;
+
+    float guess = x / 2.0f;
+    for (short i = 0; i < 10; i++)
+    {
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+        if (guess == 0.0f)
+            return 0.0f;
+#pragma GCC diagnostic pop
+
+        guess = (guess + x / guess) / 2.0f;
+    }
+    return guess;
+}
+
+EXTERNC double clamp(double x, double low, double high)
+{
+    if (x < low)
+        return low;
+    else if (x > high)
+        return high;
+    else
+        return x;
+}
+
+EXTERNC float lerp(float a, float b, float t)
+{
+    return (1 - t) * a + t * b;
+}
+
+EXTERNC float smoothstep(float a, float b, float t)
+{
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-conversion"
+    t = clamp(s_cst(double, t), 0.0, 1.0);
+#pragma GCC diagnostic pop
+    return lerp(a, b, t * t * (3 - 2 * t));
+}
+
+EXTERNC float cubicInterpolate(float a, float b, float t)
+{
+    float t2 = t * t;
+    float t3 = t2 * t;
+    return a + (-2 * t3 + 3 * t2) * b;
+}
+
+EXTERNC char *strtok(char *src, const char *delim)
+{
+    static char *src1;
+    if (!src)
+        src = src1;
+
+    if (!src)
+        return NULL;
+
+    while (1)
+    {
+        if (isdelim(*src, (char *)delim))
+        {
+            src++;
+            continue;
+        }
+        if (*src == '\0')
+            return NULL;
+
+        break;
+    }
+    char *ret = src;
+    while (1)
+    {
+        if (*src == '\0')
+        {
+            src1 = src;
+            return ret;
+        }
+        if (isdelim(*src, (char *)delim))
+        {
+            *src = '\0';
+            src1 = src + 1;
+            return ret;
+        }
+        src++;
+    }
+    return NULL;
+}
+
+int strcasecmp(const char *s1, const char *s2)
+{
+    const unsigned char *p1 = (const unsigned char *)s1;
+    const unsigned char *p2 = (const unsigned char *)s2;
+    int result;
+    if (p1 == p2)
+        return 0;
+    while ((result = std::tolower(*p1) - std::tolower(*p2++)) == 0)
+        if (*p1++ == '\0')
+            break;
+    return result;
+}
+
+size_t wcslen(const wchar_t *s)
+{
+    size_t len = 0;
+
+    while (s[len] != L'\0')
+    {
+        if (s[++len] == L'\0')
+            return len;
+        if (s[++len] == L'\0')
+            return len;
+        if (s[++len] == L'\0')
+            return len;
+        ++len;
+    }
+
+    return len;
+}
+
+size_t wcsrtombs(char *dst, const wchar_t **src, size_t len, mbstate_t *ps)
+{
+    size_t count = 0;
+
+    while (len > 0)
+    {
+        wchar_t wc = **src;
+        if (wc == L'\0')
+            break;
+
+        if (wc < 0x80)
+        {
+            if (dst)
+                *dst++ = (char)wc;
+            count++;
+            len--;
+        }
+        else if (wc < 0x800)
+        {
+            if (dst)
+            {
+                *dst++ = (char)(0xC0 | (wc >> 6));
+                *dst++ = (char)(0x80 | (wc & 0x3F));
+            }
+            count += 2;
+            len -= 2;
+        }
+        else if (wc < 0x10000)
+        {
+            if (dst)
+            {
+                *dst++ = (char)(0xE0 | (wc >> 12));
+                *dst++ = (char)(0x80 | ((wc >> 6) & 0x3F));
+                *dst++ = (char)(0x80 | (wc & 0x3F));
+            }
+            count += 3;
+            len -= 3;
+        }
+        else
+        {
+            if (dst)
+            {
+                *dst++ = (char)(0xF0 | (wc >> 18));
+                *dst++ = (char)(0x80 | ((wc >> 12) & 0x3F));
+                *dst++ = (char)(0x80 | ((wc >> 6) & 0x3F));
+                *dst++ = (char)(0x80 | (wc & 0x3F));
+            }
+            count += 4;
+            len -= 4;
+        }
+
+        (*src)++;
+    }
+
+    if (dst)
+        *dst = '\0';
+
+    return count;
+}
+
+EXTERNC int atoi(const char *String)
+{
+    uint64_t Length = strlen((char *)String);
+    int OutBuffer = 0;
+    int Power = 1;
+    for (uint64_t i = Length; i > 0; --i)
+    {
+        OutBuffer += (String[i - 1] - 48) * Power;
+        Power *= 10;
+    }
+    return OutBuffer;
+}
+
+EXTERNC double atof(const char *String)
+{
+    // Originally from https://github.com/GaloisInc/minlibc/blob/master/atof.c
+    /*
+    Copyright (c) 2014 Galois Inc.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+      * Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+      * Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in
+        the documentation and/or other materials provided with the
+        distribution.
+
+      * Neither the name of Galois, Inc. nor the names of its contributors
+        may be used to endorse or promote products derived from this
+        software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+    IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+    TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+    PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
+    OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+    LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+    NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+    */
+    double a = 0.0;
+    int e = 0;
+    int c;
+    while ((c = *String++) != '\0' && isdigit(c))
+    {
+        a = a * 10.0 + (c - '0');
+    }
+    if (c == '.')
+    {
+        while ((c = *String++) != '\0' && isdigit(c))
+        {
+            a = a * 10.0 + (c - '0');
+            e = e - 1;
+        }
+    }
+    if (c == 'e' || c == 'E')
+    {
+        int sign = 1;
+        int i = 0;
+        c = *String++;
+        if (c == '+')
+            c = *String++;
+        else if (c == '-')
+        {
+            c = *String++;
+            sign = -1;
+        }
+        while (isdigit(c))
+        {
+            i = i * 10 + (c - '0');
+            c = *String++;
+        }
+        e += i * sign;
+    }
+    while (e > 0)
+    {
+        a *= 10.0;
+        e--;
+    }
+    while (e < 0)
+    {
+        a *= 0.1;
+        e++;
+    }
+    return a;
+}
+
+EXTERNC char *itoa(int Value, char *Buffer, int Base)
+{
+    if (Base < 2 || Base > 32)
+        return Buffer;
+
+    int n = s_cst(int, abs(Value));
+    int i = 0;
+
+    while (n)
+    {
+        int r = s_cst(int, n % Base);
+        if (r >= 10)
+            Buffer[i++] = s_cst(char, 65 + (r - 10));
+        else
+            Buffer[i++] = s_cst(char, 48 + r);
+        n = n / Base;
+    }
+
+    if (i == 0)
+        Buffer[i++] = '0';
+
+    if (Value < 0 && Base == 10)
+        Buffer[i++] = '-';
+
+    Buffer[i] = '\0';
+    return reverse(Buffer, 0, i - 1);
+}
+
+EXTERNC char *ltoa(long Value, char *Buffer, int Base)
+{
+    if (Base < 2 || Base > 32)
+        return Buffer;
+
+    long n = abs(Value);
+    int i = 0;
+
+    while (n)
+    {
+        int r = s_cst(int, n % Base);
+        if (r >= 10)
+            Buffer[i++] = s_cst(char, 65 + (r - 10));
+        else
+            Buffer[i++] = s_cst(char, 48 + r);
+        n = n / Base;
+    }
+
+    if (i == 0)
+        Buffer[i++] = '0';
+
+    if (Value < 0 && Base == 10)
+        Buffer[i++] = '-';
+
+    Buffer[i] = '\0';
+    return reverse(Buffer, 0, i - 1);
+}
+
+EXTERNC char *ultoa(unsigned long Value, char *Buffer, int Base)
+{
+    if (Base < 2 || Base > 32)
+        return Buffer;
+
+    unsigned long n = Value;
+    int i = 0;
+
+    while (n)
+    {
+        int r = s_cst(int, n % Base);
+        if (r >= 10)
+            Buffer[i++] = s_cst(char, 65 + (r - 10));
+        else
+            Buffer[i++] = s_cst(char, 48 + r);
+        n = n / Base;
+    }
+
+    if (i == 0)
+        Buffer[i++] = '0';
+
+    Buffer[i] = '\0';
+    return reverse(Buffer, 0, i - 1);
+}
+
+EXTERNC int log2(unsigned int n)
+{
+    if (n == 0)
+    {
+        error("log2(0) is undefined.");
+        return -1;
+    }
+
+    int log = 0;
+
+    if ((n & 0xFFFF0000) != 0)
+    {
+        n >>= 16;
+        log = 16;
+    }
+
+    if (n >= 256)
+    {
+        n >>= 8;
+        log += 8;
+    }
+
+    if (n >= 16)
+    {
+        n >>= 4;
+        log += 4;
+    }
+
+    if (n >= 4)
+    {
+        n >>= 2;
+        log += 2;
+    }
+
+    return log + (n >> 1);
+}
+
+EXTERNC void __chk_fail(void) __noreturn;
+
+__noreturn __always_inline static inline void __convert_chk_fail(void)
+{
+#if defined(a86)
+    asmv("int3");
+#else
+#warning "Not implemented!"
+#endif
+    __builtin_unreachable();
+}
+
+// #define DBG_CHK 1
+
+EXTERNC __no_stack_protector void *__memcpy_chk(void *dest, const void *src, size_t len, size_t slen)
+{
+#ifdef DBG_CHK
+    debug("( dest:%#lx src:%#lx len:%llu slen:%llu )", dest, src, len, slen);
+#endif
+    if (unlikely(dest == NULL))
+    {
+        error("dest is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(src == NULL))
+    {
+        error("src is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(len == 0))
+    {
+        error("len is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(slen == 0))
+    {
+        error("slen is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(len > slen))
+        __chk_fail();
+
+    void *ret = nullptr;
+    uint64_t simd = CPU::CheckSIMD();
+    if (simd & CPU::x86SIMDType::SIMD_SSE42)
+        ret = memcpy_sse4_2(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE41)
+        ret = memcpy_sse4_1(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSSE3)
+        ret = memcpy_ssse3(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE3)
+        ret = memcpy_sse3(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE2)
+        ret = memcpy_sse2(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE)
+        ret = memcpy_sse(dest, src, len);
+    else
+        ret = memcpy_unsafe(dest, src, len);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "memcpy( %p %p %ld %ld )=%p~%p\n\r",
+                dest, src, len, slen,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+EXTERNC __no_stack_protector void *__memset_chk(void *dest, int val, size_t len, size_t slen)
+{
+#ifdef DBG_CHK
+    debug("( dest:%#lx val:%#x len:%llu slen:%llu )", dest, val, len, slen);
+#endif
+    if (unlikely(dest == NULL))
+    {
+        error("dest is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(len == 0))
+    {
+        error("len is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(slen == 0))
+    {
+        error("slen is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(len > slen))
+        __chk_fail();
+
+    void *ret = nullptr;
+    uint64_t simd = CPU::CheckSIMD();
+    if (simd & CPU::x86SIMDType::SIMD_SSE42)
+        ret = memset_sse4_2(dest, val, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE41)
+        ret = memset_sse4_1(dest, val, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSSE3)
+        ret = memset_ssse3(dest, val, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE3)
+        ret = memset_sse3(dest, val, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE2)
+        ret = memset_sse2(dest, val, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE)
+        ret = memset_sse(dest, val, len);
+    else
+        ret = memset_unsafe(dest, val, len);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "memset( %p %d %ld %ld )=%p~%p\n\r",
+                dest, val, len, slen,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+EXTERNC __no_stack_protector void *__memmove_chk(void *dest, const void *src, size_t len, size_t slen)
+{
+#ifdef DBG_CHK
+    debug("( dest:%#lx src:%#lx len:%llu slen:%llu )", dest, src, len, slen);
+#endif
+    if (unlikely(dest == NULL))
+    {
+        error("dest is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(src == NULL))
+    {
+        error("src is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(len == 0))
+    {
+        error("len is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(slen == 0))
+    {
+        error("slen is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(len > slen))
+        __chk_fail();
+
+    void *ret = nullptr;
+    uint64_t simd = CPU::CheckSIMD();
+    if (simd & CPU::x86SIMDType::SIMD_SSE42)
+        ret = memmove_sse4_2(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE41)
+        ret = memmove_sse4_1(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSSE3)
+        ret = memmove_ssse3(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE3)
+        ret = memmove_sse3(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE2)
+        ret = memmove_sse2(dest, src, len);
+    else if (simd & CPU::x86SIMDType::SIMD_SSE)
+        ret = memmove_sse(dest, src, len);
+    else
+        ret = memmove_unsafe(dest, src, len);
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "memmove( %p %p %ld %ld )=%p~%p\n\r",
+                dest, src, len, slen,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+EXTERNC __no_stack_protector char *__strcat_chk(char *dest, const char *src, size_t slen)
+{
+#ifdef DBG_CHK
+    debug("( dest:%#lx src:%#lx slen:%llu )", dest, src, slen);
+#endif
+    if (unlikely(dest == NULL))
+    {
+        error("dest is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(src == NULL))
+    {
+        error("src is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(slen == 0))
+    {
+        error("slen is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    size_t dest_len = strlen(dest);
+    if (unlikely(dest_len + strlen(src) + 1 > slen))
+        __chk_fail();
+    return strcat_unsafe(dest, src);
+}
+
+EXTERNC __no_stack_protector char *__strcpy_chk(char *dest, const char *src, size_t slen)
+{
+#ifdef DBG_CHK
+    debug("( dest:%#lx src:%#lx slen:%llu )", dest, src, slen);
+#endif
+    if (unlikely(dest == NULL))
+    {
+        error("dest is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(src == NULL))
+    {
+        error("src is NULL (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    if (unlikely(slen == 0))
+    {
+        error("slen is 0 (for %#lx %s)", __builtin_return_address(0), KernelSymbolTable ? KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_return_address(0)) : "Unknown");
+        __convert_chk_fail();
+    }
+
+    size_t len = strlen(src);
+
+    if (unlikely(len >= slen))
+        __chk_fail();
+
+    return strcpy_unsafe(dest, src);
+}
+
+#undef memcpy
+EXTERNC __no_stack_protector void *memcpy(void *dest, const void *src, size_t len)
+{
+    void *ret = __memcpy_chk(dest, src, len, __builtin_object_size(dest, 0));
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "!memcpy( %p %p %ld )=%p~%p\n\r",
+                dest, src, len,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
+
+#undef memset
+EXTERNC __no_stack_protector void *memset(void *dest, int val, size_t len)
+{
+    void *ret = __memset_chk(dest, val, len, __builtin_object_size(dest, 0));
+#ifdef DEBUG
+    if (EnableExternalMemoryTracer)
+    {
+        char LockTmpStr[64];
+        strcpy_unsafe(LockTmpStr, __FUNCTION__);
+        strcat_unsafe(LockTmpStr, "_memTrk");
+        mExtTrkLock.TimeoutLock(LockTmpStr, 10000);
+        sprintf(mExtTrkLog, "!memset( %p %d %ld )=%p~%p\n\r",
+                dest, val, len,
+                ret, __builtin_return_address(0));
+        UniversalAsynchronousReceiverTransmitter::UART mTrkUART = UniversalAsynchronousReceiverTransmitter::UART(UniversalAsynchronousReceiverTransmitter::COM3);
+        for (short i = 0; i < MEM_TRK_MAX_SIZE; i++)
+        {
+            if (mExtTrkLog[i] == '\r')
+                break;
+            mTrkUART.Write(mExtTrkLog[i]);
+        }
+        mExtTrkLock.Unlock();
+    }
+#endif
+    return ret;
+}
diff --git a/Kernel/Library/CyclicRedundancyCheck32.c b/Kernel/Library/CyclicRedundancyCheck32.c
new file mode 100644
index 00000000..4deb16a5
--- /dev/null
+++ b/Kernel/Library/CyclicRedundancyCheck32.c
@@ -0,0 +1,96 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <crc32.h>
+
+uint32_t LookupTable[256] =
+    {
+        0x00000000, 0x04c11db7, 0x09823b6e, 0x0d4326d9,
+        0x130476dc, 0x17c56b6b, 0x1a864db2, 0x1e475005,
+        0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, 0x2b4bcb61,
+        0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd,
+        0x4c11db70, 0x48d0c6c7, 0x4593e01e, 0x4152fda9,
+        0x5f15adac, 0x5bd4b01b, 0x569796c2, 0x52568b75,
+        0x6a1936c8, 0x6ed82b7f, 0x639b0da6, 0x675a1011,
+        0x791d4014, 0x7ddc5da3, 0x709f7b7a, 0x745e66cd,
+        0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039,
+        0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5,
+        0xbe2b5b58, 0xbaea46ef, 0xb7a96036, 0xb3687d81,
+        0xad2f2d84, 0xa9ee3033, 0xa4ad16ea, 0xa06c0b5d,
+        0xd4326d90, 0xd0f37027, 0xddb056fe, 0xd9714b49,
+        0xc7361b4c, 0xc3f706fb, 0xceb42022, 0xca753d95,
+        0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1,
+        0xe13ef6f4, 0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d,
+        0x34867077, 0x30476dc0, 0x3d044b19, 0x39c556ae,
+        0x278206ab, 0x23431b1c, 0x2e003dc5, 0x2ac12072,
+        0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16,
+        0x018aeb13, 0x054bf6a4, 0x0808d07d, 0x0cc9cdca,
+        0x7897ab07, 0x7c56b6b0, 0x71159069, 0x75d48dde,
+        0x6b93dddb, 0x6f52c06c, 0x6211e6b5, 0x66d0fb02,
+        0x5e9f46bf, 0x5a5e5b08, 0x571d7dd1, 0x53dc6066,
+        0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
+        0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e,
+        0xbfa1b04b, 0xbb60adfc, 0xb6238b25, 0xb2e29692,
+        0x8aad2b2f, 0x8e6c3698, 0x832f1041, 0x87ee0df6,
+        0x99a95df3, 0x9d684044, 0x902b669d, 0x94ea7b2a,
+        0xe0b41de7, 0xe4750050, 0xe9362689, 0xedf73b3e,
+        0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2,
+        0xc6bcf05f, 0xc27dede8, 0xcf3ecb31, 0xcbffd686,
+        0xd5b88683, 0xd1799b34, 0xdc3abded, 0xd8fba05a,
+        0x690ce0ee, 0x6dcdfd59, 0x608edb80, 0x644fc637,
+        0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb,
+        0x4f040d56, 0x4bc510e1, 0x46863638, 0x42472b8f,
+        0x5c007b8a, 0x58c1663d, 0x558240e4, 0x51435d53,
+        0x251d3b9e, 0x21dc2629, 0x2c9f00f0, 0x285e1d47,
+        0x36194d42, 0x32d850f5, 0x3f9b762c, 0x3b5a6b9b,
+        0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff,
+        0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623,
+        0xf12f560e, 0xf5ee4bb9, 0xf8ad6d60, 0xfc6c70d7,
+        0xe22b20d2, 0xe6ea3d65, 0xeba91bbc, 0xef68060b,
+        0xd727bbb6, 0xd3e6a601, 0xdea580d8, 0xda649d6f,
+        0xc423cd6a, 0xc0e2d0dd, 0xcda1f604, 0xc960ebb3,
+        0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7,
+        0xae3afba2, 0xaafbe615, 0xa7b8c0cc, 0xa379dd7b,
+        0x9b3660c6, 0x9ff77d71, 0x92b45ba8, 0x9675461f,
+        0x8832161a, 0x8cf30bad, 0x81b02d74, 0x857130c3,
+        0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640,
+        0x4e8ee645, 0x4a4ffbf2, 0x470cdd2b, 0x43cdc09c,
+        0x7b827d21, 0x7f436096, 0x7200464f, 0x76c15bf8,
+        0x68860bfd, 0x6c47164a, 0x61043093, 0x65c52d24,
+        0x119b4be9, 0x155a565e, 0x18197087, 0x1cd86d30,
+        0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec,
+        0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088,
+        0x2497d08d, 0x2056cd3a, 0x2d15ebe3, 0x29d4f654,
+        0xc5a92679, 0xc1683bce, 0xcc2b1d17, 0xc8ea00a0,
+        0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb, 0xdbee767c,
+        0xe3a1cbc1, 0xe760d676, 0xea23f0af, 0xeee2ed18,
+        0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4,
+        0x89b8fd09, 0x8d79e0be, 0x803ac667, 0x84fbdbd0,
+        0x9abc8bd5, 0x9e7d9662, 0x933eb0bb, 0x97ffad0c,
+        0xafb010b1, 0xab710d06, 0xa6322bdf, 0xa2f33668,
+        0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4};
+
+uint32_t crc32(const uint8_t *Buffer, int Length)
+{
+    uint32_t ret = 0xffffffff;
+    while (Length--)
+    {
+        ret = (ret << 8) ^ LookupTable[((ret >> 24) ^ *Buffer) & 255];
+        Buffer++;
+    }
+    return ret;
+}
diff --git a/Kernel/Library/MemOp.c b/Kernel/Library/MemOp.c
new file mode 100644
index 00000000..c840c00c
--- /dev/null
+++ b/Kernel/Library/MemOp.c
@@ -0,0 +1,351 @@
+#include <convert.h>
+
+#include <memory.hpp>
+#include <limits.h>
+#include <debug.h>
+
+#pragma GCC diagnostic ignored "-Wconversion"
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+
+/* Some of the functions are from musl library */
+/* https://www.musl-libc.org/ */
+/*
+Copyright © 2005-2020 Rich Felker, et al.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+*/
+
+void *memcpy_unsafe(void *dest, const void *src, size_t n)
+{
+    unsigned char *d = dest;
+    const unsigned char *s = src;
+
+#ifdef __GNUC__
+
+#if __BYTE_ORDER == __LITTLE_ENDIAN
+#define LS >>
+#define RS <<
+#else
+#define LS <<
+#define RS >>
+#endif
+
+    typedef uint32_t __attribute__((__may_alias__)) u32;
+    uint32_t w, x;
+
+    for (; (uintptr_t)s % 4 && n; n--)
+        *d++ = *s++;
+
+    if ((uintptr_t)d % 4 == 0)
+    {
+        for (; n >= 16; s += 16, d += 16, n -= 16)
+        {
+            *(u32 *)(d + 0) = *(u32 *)(s + 0);
+            *(u32 *)(d + 4) = *(u32 *)(s + 4);
+            *(u32 *)(d + 8) = *(u32 *)(s + 8);
+            *(u32 *)(d + 12) = *(u32 *)(s + 12);
+        }
+        if (n & 8)
+        {
+            *(u32 *)(d + 0) = *(u32 *)(s + 0);
+            *(u32 *)(d + 4) = *(u32 *)(s + 4);
+            d += 8;
+            s += 8;
+        }
+        if (n & 4)
+        {
+            *(u32 *)(d + 0) = *(u32 *)(s + 0);
+            d += 4;
+            s += 4;
+        }
+        if (n & 2)
+        {
+            *d++ = *s++;
+            *d++ = *s++;
+        }
+        if (n & 1)
+        {
+            *d = *s;
+        }
+        return dest;
+    }
+
+    if (n >= 32)
+    {
+        switch ((uintptr_t)d % 4)
+        {
+        case 1:
+        {
+            w = *(u32 *)s;
+            *d++ = *s++;
+            *d++ = *s++;
+            *d++ = *s++;
+            n -= 3;
+            for (; n >= 17; s += 16, d += 16, n -= 16)
+            {
+                x = *(u32 *)(s + 1);
+                *(u32 *)(d + 0) = (w LS 24) | (x RS 8);
+                w = *(u32 *)(s + 5);
+                *(u32 *)(d + 4) = (x LS 24) | (w RS 8);
+                x = *(u32 *)(s + 9);
+                *(u32 *)(d + 8) = (w LS 24) | (x RS 8);
+                w = *(u32 *)(s + 13);
+                *(u32 *)(d + 12) = (x LS 24) | (w RS 8);
+            }
+            break;
+        }
+        case 2:
+        {
+            w = *(u32 *)s;
+            *d++ = *s++;
+            *d++ = *s++;
+            n -= 2;
+            for (; n >= 18; s += 16, d += 16, n -= 16)
+            {
+                x = *(u32 *)(s + 2);
+                *(u32 *)(d + 0) = (w LS 16) | (x RS 16);
+                w = *(u32 *)(s + 6);
+                *(u32 *)(d + 4) = (x LS 16) | (w RS 16);
+                x = *(u32 *)(s + 10);
+                *(u32 *)(d + 8) = (w LS 16) | (x RS 16);
+                w = *(u32 *)(s + 14);
+                *(u32 *)(d + 12) = (x LS 16) | (w RS 16);
+            }
+            break;
+        }
+        case 3:
+        {
+            w = *(u32 *)s;
+            *d++ = *s++;
+            n -= 1;
+            for (; n >= 19; s += 16, d += 16, n -= 16)
+            {
+                x = *(u32 *)(s + 3);
+                *(u32 *)(d + 0) = (w LS 8) | (x RS 24);
+                w = *(u32 *)(s + 7);
+                *(u32 *)(d + 4) = (x LS 8) | (w RS 24);
+                x = *(u32 *)(s + 11);
+                *(u32 *)(d + 8) = (w LS 8) | (x RS 24);
+                w = *(u32 *)(s + 15);
+                *(u32 *)(d + 12) = (x LS 8) | (w RS 24);
+            }
+            break;
+        }
+        default:
+            break;
+        }
+    }
+
+    if (n & 16)
+    {
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+    }
+
+    if (n & 8)
+    {
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+    }
+
+    if (n & 4)
+    {
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+        *d++ = *s++;
+    }
+
+    if (n & 2)
+    {
+        *d++ = *s++;
+        *d++ = *s++;
+    }
+
+    if (n & 1)
+    {
+        *d = *s;
+    }
+    return dest;
+#endif
+
+    for (; n; n--)
+        *d++ = *s++;
+    return dest;
+}
+
+void *memset_unsafe(void *dest, int c, size_t n)
+{
+    unsigned char *s = dest;
+    size_t k;
+
+    if (!n)
+        return dest;
+
+    s[0] = c;
+    s[n - 1] = c;
+
+    if (n <= 2)
+        return dest;
+
+    s[1] = c;
+    s[2] = c;
+    s[n - 2] = c;
+    s[n - 3] = c;
+
+    if (n <= 6)
+        return dest;
+
+    s[3] = c;
+    s[n - 4] = c;
+
+    if (n <= 8)
+        return dest;
+
+    k = -(uintptr_t)s & 3;
+    s += k;
+    n -= k;
+    n &= -4;
+
+#ifdef __GNUC__
+    typedef uint32_t __attribute__((__may_alias__)) u32;
+    typedef uint64_t __attribute__((__may_alias__)) u64;
+
+    u32 c32 = ((u32)-1) / 255 * (unsigned char)c;
+    *(u32 *)(s + 0) = c32;
+    *(u32 *)(s + n - 4) = c32;
+
+    if (n <= 8)
+        return dest;
+
+    *(u32 *)(s + 4) = c32;
+    *(u32 *)(s + 8) = c32;
+    *(u32 *)(s + n - 12) = c32;
+    *(u32 *)(s + n - 8) = c32;
+
+    if (n <= 24)
+        return dest;
+
+    *(u32 *)(s + 12) = c32;
+    *(u32 *)(s + 16) = c32;
+    *(u32 *)(s + 20) = c32;
+    *(u32 *)(s + 24) = c32;
+    *(u32 *)(s + n - 28) = c32;
+    *(u32 *)(s + n - 24) = c32;
+    *(u32 *)(s + n - 20) = c32;
+    *(u32 *)(s + n - 16) = c32;
+
+    k = 24 + ((uintptr_t)s & 4);
+    s += k;
+    n -= k;
+
+    u64 c64 = c32 | ((u64)c32 << 32);
+    for (; n >= 32; n -= 32, s += 32)
+    {
+        *(u64 *)(s + 0) = c64;
+        *(u64 *)(s + 8) = c64;
+        *(u64 *)(s + 16) = c64;
+        *(u64 *)(s + 24) = c64;
+    }
+#else
+    for (; n; n--, s++)
+        *s = c;
+#endif
+
+    return dest;
+}
+
+void *memmove_unsafe(void *dest, const void *src, size_t n)
+{
+#ifdef __GNUC__
+    typedef __attribute__((__may_alias__)) size_t WT;
+#define WS (sizeof(WT))
+#endif
+
+    char *d = dest;
+    const char *s = src;
+
+    if (d == s)
+        return d;
+
+    if ((uintptr_t)s - (uintptr_t)d - n <= -2 * n)
+        return memcpy(d, s, n);
+
+    if (d < s)
+    {
+#ifdef __GNUC__
+        if ((uintptr_t)s % WS == (uintptr_t)d % WS)
+        {
+            while ((uintptr_t)d % WS)
+            {
+                if (!n--)
+                    return dest;
+
+                *d++ = *s++;
+            }
+            for (; n >= WS; n -= WS, d += WS, s += WS)
+                *(WT *)d = *(WT *)s;
+        }
+#endif
+        for (; n; n--)
+            *d++ = *s++;
+    }
+    else
+    {
+#ifdef __GNUC__
+        if ((uintptr_t)s % WS == (uintptr_t)d % WS)
+        {
+            while ((uintptr_t)(d + n) % WS)
+            {
+                if (!n--)
+                    return dest;
+
+                d[n] = s[n];
+            }
+            while (n >= WS)
+                n -= WS, *(WT *)(d + n) = *(WT *)(s + n);
+        }
+#endif
+        while (n)
+            n--, d[n] = s[n];
+    }
+
+    return dest;
+}
diff --git a/Kernel/Library/MemoryCopySIMD.cpp b/Kernel/Library/MemoryCopySIMD.cpp
new file mode 100644
index 00000000..3b42b802
--- /dev/null
+++ b/Kernel/Library/MemoryCopySIMD.cpp
@@ -0,0 +1,195 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <convert.h>
+
+#include <memory.hpp>
+#include <limits.h>
+#include <debug.h>
+#include <cpu.hpp>
+
+/*
+TODO: Replace these functions with even more optimized versions.
+      The current versions are fast but not as fast as they could be and also we need implementation for avx, not only sse.
+*/
+
+EXTERNC void *memcpy_sse(void *dest, const void *src, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+    const char *s = (const char *)src;
+
+    if ((((uintptr_t)d | (uintptr_t)s) & 0xF) == 0)
+    {
+        size_t num_vectors = n / 16;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            asmv("movaps (%0), %%xmm0\n"
+                 "movaps %%xmm0, (%1)\n"
+                 :
+                 : "r"(s), "r"(d)
+                 : "xmm0");
+            d += 16;
+            s += 16;
+        }
+        n -= num_vectors * 16;
+    }
+
+    memcpy_unsafe(d, s, n);
+#endif // defined(a64)
+    return dest;
+}
+
+EXTERNC void *memcpy_sse2(void *dest, const void *src, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+    const char *s = (const char *)src;
+
+    if ((((uintptr_t)d | (uintptr_t)s) & 0xF) == 0)
+    {
+        size_t num_vectors = n / 16;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            asmv("movdqa (%0), %%xmm0\n"
+                 "movdqa %%xmm0, (%1)\n"
+                 :
+                 : "r"(s), "r"(d)
+                 : "xmm0");
+            d += 16;
+            s += 16;
+        }
+        n -= num_vectors * 16;
+    }
+
+    memcpy_unsafe(d, s, n);
+#endif // defined(a64)
+    return dest;
+}
+
+EXTERNC void *memcpy_sse3(void *dest, const void *src, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+    const char *s = (const char *)src;
+
+    if ((((uintptr_t)d | (uintptr_t)s) & 0x7) == 0)
+    {
+        size_t num_vectors = n / 8;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            asmv("movq (%0), %%xmm0\n"
+                 "movddup %%xmm0, %%xmm1\n"
+                 "movq %%xmm1, (%1)\n"
+                 :
+                 : "r"(s), "r"(d)
+                 : "xmm0", "xmm1");
+            d += 8;
+            s += 8;
+        }
+        n -= num_vectors * 8;
+    }
+
+    memcpy_unsafe(d, s, n);
+#endif // defined(a64)
+    return dest;
+}
+
+EXTERNC void *memcpy_ssse3(void *dest, const void *src, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+    const char *s = (const char *)src;
+
+    if ((((uintptr_t)d | (uintptr_t)s) & 0xF) == 0)
+    {
+        size_t num_vectors = n / 16;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            asmv("movdqa (%0), %%xmm0\n"
+                 "movdqa 16(%0), %%xmm1\n"
+                 "palignr $8, %%xmm0, %%xmm1\n"
+                 "movdqa %%xmm1, (%1)\n"
+                 :
+                 : "r"(s), "r"(d)
+                 : "xmm0", "xmm1");
+            d += 16;
+            s += 16;
+        }
+        n -= num_vectors * 16;
+    }
+
+    memcpy_unsafe(d, s, n);
+#endif // defined(a64)
+    return dest;
+}
+
+EXTERNC void *memcpy_sse4_1(void *dest, const void *src, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+    const char *s = (const char *)src;
+
+    if ((((uintptr_t)d | (uintptr_t)s) & 0xF) == 0)
+    {
+        size_t num_vectors = n / 16;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            // movntdqa
+            asmv("movdqa (%0), %%xmm0\n"
+                 "movdqa %%xmm0, (%1)\n"
+                 :
+                 : "r"(s), "r"(d)
+                 : "xmm0");
+            d += 16;
+            s += 16;
+        }
+        n -= num_vectors * 16;
+    }
+
+    memcpy_unsafe(d, s, n);
+#endif // defined(a64)
+    return dest;
+}
+
+EXTERNC void *memcpy_sse4_2(void *dest, const void *src, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+    const char *s = (const char *)src;
+
+    if ((((uintptr_t)d | (uintptr_t)s) & 0xF) == 0)
+    {
+        size_t num_vectors = n / 16;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            asmv("movdqa (%0), %%xmm0\n"
+                 "pcmpistri $0, (%0), %%xmm0\n"
+                 "movdqa %%xmm0, (%1)\n"
+                 :
+                 : "r"(s), "r"(d)
+                 : "xmm0");
+            d += 16;
+            s += 16;
+        }
+        n -= num_vectors * 16;
+    }
+
+    memcpy_unsafe(d, s, n);
+#endif // defined(a64)
+    return dest;
+}
diff --git a/Kernel/Library/MemoryMoveSIMD.cpp b/Kernel/Library/MemoryMoveSIMD.cpp
new file mode 100644
index 00000000..5a11b643
--- /dev/null
+++ b/Kernel/Library/MemoryMoveSIMD.cpp
@@ -0,0 +1,60 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <convert.h>
+
+#include <memory.hpp>
+#include <limits.h>
+#include <debug.h>
+#include <cpu.hpp>
+
+/*
+TODO: Replace these functions with even more optimized versions.
+      The current versions are fast but not as fast as they could be and also we need implementation for avx, not only sse.
+*/
+
+// TODO: Implement these functions
+
+EXTERNC void *memmove_sse(void *dest, const void *src, size_t n)
+{
+    return memmove_unsafe(dest, src, n);
+}
+
+EXTERNC void *memmove_sse2(void *dest, const void *src, size_t n)
+{
+    return memmove_unsafe(dest, src, n);
+}
+
+EXTERNC void *memmove_sse3(void *dest, const void *src, size_t n)
+{
+    return memmove_unsafe(dest, src, n);
+}
+
+EXTERNC void *memmove_ssse3(void *dest, const void *src, size_t n)
+{
+    return memmove_unsafe(dest, src, n);
+}
+
+EXTERNC void *memmove_sse4_1(void *dest, const void *src, size_t n)
+{
+    return memmove_unsafe(dest, src, n);
+}
+
+EXTERNC void *memmove_sse4_2(void *dest, const void *src, size_t n)
+{
+    return memmove_unsafe(dest, src, n);
+}
diff --git a/Kernel/Library/MemorySetSIMD.cpp b/Kernel/Library/MemorySetSIMD.cpp
new file mode 100644
index 00000000..d43b394a
--- /dev/null
+++ b/Kernel/Library/MemorySetSIMD.cpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <convert.h>
+
+#include <memory.hpp>
+#include <limits.h>
+#include <debug.h>
+#include <cpu.hpp>
+
+/*
+TODO: Replace these functions with even more optimized versions.
+      The current versions are fast but not as fast as they could be and also we need implementation for avx, not only sse.
+*/
+
+// TODO: Implement these functions
+
+EXTERNC void *memset_sse(void *dest, int c, size_t n)
+{
+    return memset_unsafe(dest, c, n);
+}
+
+EXTERNC void *memset_sse2(void *dest, int c, size_t n)
+{
+    return memset_unsafe(dest, c, n);
+}
+
+EXTERNC void *memset_sse3(void *dest, int c, size_t n)
+{
+    return memset_unsafe(dest, c, n);
+}
+
+EXTERNC void *memset_ssse3(void *dest, int c, size_t n)
+{
+    return memset_unsafe(dest, c, n);
+}
+
+EXTERNC void *memset_sse4_1(void *dest, int c, size_t n)
+{
+    return memset_unsafe(dest, c, n);
+}
+
+EXTERNC void *memset_sse4_2(void *dest, int c, size_t n)
+{
+#if defined(a64)
+    char *d = (char *)dest;
+
+    if (((uintptr_t)d & 0xF) == 0)
+    {
+        size_t num_vectors = n / 16;
+        for (size_t i = 0; i < num_vectors; i++)
+        {
+            asmv("movd %0, %%xmm0\n"
+                 "pshufd $0, %%xmm0, %%xmm0\n"
+                 "movdqa %%xmm0, (%1)\n"
+                 :
+                 : "r"(c), "r"(d)
+                 : "xmm0");
+            d += 16;
+        }
+        n -= num_vectors * 16;
+    }
+
+    memset_unsafe(d, c, n);
+#endif
+    return dest;
+}
diff --git a/Kernel/Library/cargs.c b/Kernel/Library/cargs.c
new file mode 100644
index 00000000..473a7909
--- /dev/null
+++ b/Kernel/Library/cargs.c
@@ -0,0 +1,512 @@
+/*
+MIT License
+
+Copyright (c) 2022 Leonard Iklé
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+
+#pragma GCC diagnostic ignored "-Wimplicit-function-declaration"
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+
+#include <assert.h>
+#include <cargs.h>
+#include <convert.h>
+
+#define CAG_OPTION_PRINT_DISTANCE 4
+#define CAG_OPTION_PRINT_MIN_INDENTION 20
+
+static void cag_option_print_value(const cag_option *option,
+                                   size_t *accessor_length, FILE *destination)
+{
+    if (option->value_name != NULL)
+    {
+        *accessor_length += fprintf(destination, "=%s", option->value_name);
+    }
+}
+
+static void cag_option_print_letters(const cag_option *option, bool *first,
+                                     size_t *accessor_length, FILE *destination)
+{
+    const char *access_letter;
+    access_letter = option->access_letters;
+    if (access_letter != NULL)
+    {
+        while (*access_letter)
+        {
+            if (*first)
+            {
+                *accessor_length += fprintf(destination, "-%c", *access_letter);
+                *first = false;
+            }
+            else
+            {
+                *accessor_length += fprintf(destination, ", -%c", *access_letter);
+            }
+            ++access_letter;
+        }
+    }
+}
+
+static void cag_option_print_name(const cag_option *option, bool *first,
+                                  size_t *accessor_length, FILE *destination)
+{
+    if (option->access_name != NULL)
+    {
+        if (*first)
+        {
+            *accessor_length += fprintf(destination, "--%s", option->access_name);
+        }
+        else
+        {
+            *accessor_length += fprintf(destination, ", --%s", option->access_name);
+        }
+    }
+}
+
+static size_t cag_option_get_print_indention(const cag_option *options,
+                                             size_t option_count)
+{
+    size_t option_index, indention, result;
+    const cag_option *option;
+
+    result = CAG_OPTION_PRINT_MIN_INDENTION;
+
+    for (option_index = 0; option_index < option_count; ++option_index)
+    {
+        indention = CAG_OPTION_PRINT_DISTANCE;
+        option = &options[option_index];
+        if (option->access_letters != NULL && *option->access_letters)
+        {
+            indention += strlen(option->access_letters) * 4 - 2;
+            if (option->access_name != NULL)
+            {
+                indention += strlen(option->access_name) + 4;
+            }
+        }
+        else if (option->access_name != NULL)
+        {
+            indention += strlen(option->access_name) + 2;
+        }
+
+        if (option->value_name != NULL)
+        {
+            indention += strlen(option->value_name) + 1;
+        }
+
+        if (indention > result)
+        {
+            result = indention;
+        }
+    }
+
+    return result;
+}
+
+void cag_option_print(const cag_option *options, size_t option_count,
+                      FILE *destination)
+{
+    size_t option_index, indention, i, accessor_length;
+    const cag_option *option;
+    bool first;
+
+    indention = cag_option_get_print_indention(options, option_count);
+
+    for (option_index = 0; option_index < option_count; ++option_index)
+    {
+        option = &options[option_index];
+        accessor_length = 0;
+        first = true;
+
+        fputs("  ", destination);
+
+        cag_option_print_letters(option, &first, &accessor_length, destination);
+        cag_option_print_name(option, &first, &accessor_length, destination);
+        cag_option_print_value(option, &accessor_length, destination);
+
+        for (i = accessor_length; i < indention; ++i)
+        {
+            fputs(" ", destination);
+        }
+
+        fputs(" ", destination);
+        fputs(option->description, destination);
+
+        fprintf(destination, "\n");
+    }
+}
+
+void cag_option_prepare(cag_option_context *context, const cag_option *options,
+                        size_t option_count, int argc, char **argv)
+{
+    // This just initialized the values to the beginning of all the arguments.
+    context->options = options;
+    context->option_count = option_count;
+    context->argc = argc;
+    context->argv = argv;
+    context->index = 1;
+    context->inner_index = 0;
+    context->forced_end = false;
+}
+
+static const cag_option *cag_option_find_by_name(cag_option_context *context,
+                                                 char *name, size_t name_size)
+{
+    const cag_option *option;
+    size_t i;
+
+    // We loop over all the available options and stop as soon as we have found
+    // one. We don't use any hash map table, since there won't be that many
+    // arguments anyway.
+    for (i = 0; i < context->option_count; ++i)
+    {
+        option = &context->options[i];
+
+        // The option might not have an item name, we can just skip those.
+        if (option->access_name == NULL)
+        {
+            continue;
+        }
+
+        // Try to compare the name of the access name. We can use the name_size or
+        // this comparison, since we are guaranteed to have null-terminated access
+        // names.
+        if (strncmp(option->access_name, name, name_size) == 0)
+        {
+            return option;
+        }
+    }
+
+    return NULL;
+}
+
+static const cag_option *cag_option_find_by_letter(cag_option_context *context,
+                                                   char letter)
+{
+    const cag_option *option;
+    size_t i;
+
+    // We loop over all the available options and stop as soon as we have found
+    // one. We don't use any look up table, since there won't be that many
+    // arguments anyway.
+    for (i = 0; i < context->option_count; ++i)
+    {
+        option = &context->options[i];
+
+        // If this option doesn't have any access letters we will skip them.
+        if (option->access_letters == NULL)
+        {
+            continue;
+        }
+
+        // Verify whether this option has the access letter in it's access letter
+        // string. If it does, then this is our option.
+        if (strchr(option->access_letters, letter) != NULL)
+        {
+            return option;
+        }
+    }
+
+    return NULL;
+}
+
+static void cag_option_parse_value(cag_option_context *context,
+                                   const cag_option *option, char **c)
+{
+    // And now let's check whether this option is supposed to have a value, which
+    // is the case if there is a value name set. The value can be either submitted
+    // with a '=' sign or a space, which means we would have to jump over to the
+    // next argv index. This is somewhat ugly, but we do it to behave the same as
+    // the other option parsers.
+    if (option->value_name != NULL)
+    {
+        if (**c == '=')
+        {
+            context->value = ++(*c);
+        }
+        else
+        {
+            // If the next index is larger or equal to the argument count, then the
+            // parameter for this option is missing. The user will know about this,
+            // since the value pointer of the context will be NULL because we don't
+            // set it here in that case.
+            if (context->argc > context->index + 1)
+            {
+                // We consider this argv to be the value, no matter what the contents
+                // are.
+                ++context->index;
+                *c = context->argv[context->index];
+                context->value = *c;
+            }
+        }
+
+        // Move c to the end of the value, to not confuse the caller about our
+        // position.
+        while (**c)
+        {
+            ++(*c);
+        }
+    }
+}
+
+static void cag_option_parse_access_name(cag_option_context *context, char **c)
+{
+    const cag_option *option;
+    char *n;
+
+    // Now we need to extract the access name, which is any symbol up to a '=' or
+    // a '\0'.
+    n = *c;
+    while (**c && **c != '=')
+    {
+        ++*c;
+    }
+
+    // Now this will obviously always be true, but we are paranoid. Sometimes. It
+    // doesn't hurt to check.
+    assert(*c >= n);
+
+    // Figure out which option this name belongs to. This might return NULL if the
+    // name is not registered, which means the user supplied an unknown option. In
+    // that case we return true to indicate that we finished with this option. We
+    // have to skip the value parsing since we don't know whether the user thinks
+    // this option has one or not. Since we don't set any identifier specifically,
+    // it will remain '?' within the context.
+    option = cag_option_find_by_name(context, n, (size_t)(*c - n));
+    if (option == NULL)
+    {
+        // Since this option is invalid, we will move on to the next index. There is
+        // nothing we can do about this.
+        ++context->index;
+        return;
+    }
+
+    // We found an option and now we can specify the identifier within the
+    // context.
+    context->identifier = option->identifier;
+
+    // And now we try to parse the value. This function will also check whether
+    // this option is actually supposed to have a value.
+    cag_option_parse_value(context, option, c);
+
+    // And finally we move on to the next index.
+    ++context->index;
+}
+
+static void cag_option_parse_access_letter(cag_option_context *context,
+                                           char **c)
+{
+    const cag_option *option;
+    char *n = *c;
+    char *v;
+
+    // Figure out which option this letter belongs to. This might return NULL if
+    // the letter is not registered, which means the user supplied an unknown
+    // option. In that case we return true to indicate that we finished with this
+    // option. We have to skip the value parsing since we don't know whether the
+    // user thinks this option has one or not. Since we don't set any identifier
+    // specifically, it will remain '?' within the context.
+    option = cag_option_find_by_letter(context, n[context->inner_index]);
+    if (option == NULL)
+    {
+        ++context->index;
+        context->inner_index = 0;
+        return;
+    }
+
+    // We found an option and now we can specify the identifier within the
+    // context.
+    context->identifier = option->identifier;
+
+    // And now we try to parse the value. This function will also check whether
+    // this option is actually supposed to have a value.
+    v = &n[++context->inner_index];
+    cag_option_parse_value(context, option, &v);
+
+    // Check whether we reached the end of this option argument.
+    if (*v == '\0')
+    {
+        ++context->index;
+        context->inner_index = 0;
+    }
+}
+
+static void cag_option_shift(cag_option_context *context, int start, int option,
+                             int end)
+{
+    char *tmp;
+    int a_index, shift_index, shift_count, left_index, right_index;
+
+    shift_count = option - start;
+
+    // There is no shift is required if the start and the option have the same
+    // index.
+    if (shift_count == 0)
+    {
+        return;
+    }
+
+    // Lets loop through the option strings first, which we will move towards the
+    // beginning.
+    for (a_index = option; a_index < end; ++a_index)
+    {
+        // First remember the current option value, because we will have to save
+        // that later at the beginning.
+        tmp = context->argv[a_index];
+
+        // Let's loop over all option values and shift them one towards the end.
+        // This will override the option value we just stored temporarily.
+        for (shift_index = 0; shift_index < shift_count; ++shift_index)
+        {
+            left_index = a_index - shift_index;
+            right_index = a_index - shift_index - 1;
+            context->argv[left_index] = context->argv[right_index];
+        }
+
+        // Now restore the saved option value at the beginning.
+        context->argv[a_index - shift_count] = tmp;
+    }
+
+    // The new index will be before all non-option values, in such a way that they
+    // all will be moved again in the next fetch call.
+    context->index = end - shift_count;
+}
+
+static bool cag_option_is_argument_string(const char *c)
+{
+    return *c == '-' && *(c + 1) != '\0';
+}
+
+static int cag_option_find_next(cag_option_context *context)
+{
+    int next_index, next_option_index;
+    char *c;
+
+    // Prepare to search the next option at the next index.
+    next_index = context->index;
+    next_option_index = next_index;
+
+    // Grab a pointer to the string and verify that it is not the end. If it is
+    // the end, we have to return false to indicate that we finished.
+    c = context->argv[next_option_index];
+    if (context->forced_end || c == NULL || (uintptr_t)c == (uintptr_t)0xfffffffffffff000 /* TODO: workaround */)
+    {
+        return -1;
+    }
+
+    // Check whether it is a '-'. We need to find the next option - and an option
+    // always starts with a '-'. If there is a string "-\0", we don't consider it
+    // as an option neither.
+    while (!cag_option_is_argument_string(c))
+    {
+        c = context->argv[++next_option_index];
+        if (c == NULL)
+        {
+            // We reached the end and did not find any argument anymore. Let's tell
+            // our caller that we reached the end.
+            return -1;
+        }
+    }
+
+    // Indicate that we found an option which can be processed. The index of the
+    // next option will be returned.
+    return next_option_index;
+}
+
+bool cag_option_fetch(cag_option_context *context)
+{
+    char *c;
+    int old_index, new_index;
+
+    // Reset our identifier to a question mark, which indicates an "unknown"
+    // option. The value is set to NULL, to make sure we are not carrying the
+    // parameter from the previous option to this one.
+    context->identifier = '?';
+    context->value = NULL;
+
+    // Check whether there are any options left to parse and remember the old
+    // index as well as the new index. In the end we will move the option junk to
+    // the beginning, so that non option arguments can be read.
+    old_index = context->index;
+    new_index = cag_option_find_next(context);
+    if (new_index >= 0)
+    {
+        context->index = new_index;
+    }
+    else
+    {
+        return false;
+    }
+
+    // Grab a pointer to the beginning of the option. At this point, the next
+    // character must be a '-', since if it was not the prepare function would
+    // have returned false. We will skip that symbol and proceed.
+    c = context->argv[context->index];
+    assert(*c == '-');
+    ++c;
+
+    // Check whether this is a long option, starting with a double "--".
+    if (*c == '-')
+    {
+        ++c;
+
+        // This might be a double "--" which indicates the end of options. If this
+        // is the case, we will not move to the next index. That ensures that
+        // another call to the fetch function will not skip the "--".
+        if (*c == '\0')
+        {
+            context->forced_end = true;
+        }
+        else
+        {
+            // We parse now the access name. All information about it will be written
+            // to the context.
+            cag_option_parse_access_name(context, &c);
+        }
+    }
+    else
+    {
+        // This is no long option, so we can just parse an access letter.
+        cag_option_parse_access_letter(context, &c);
+    }
+
+    // Move the items so that the options come first followed by non-option
+    // arguments.
+    cag_option_shift(context, old_index, new_index, context->index);
+
+    return context->forced_end == false;
+}
+
+char cag_option_get(const cag_option_context *context)
+{
+    // We just return the identifier here.
+    return context->identifier;
+}
+
+const char *cag_option_get_value(const cag_option_context *context)
+{
+    // We just return the internal value pointer of the context.
+    return context->value;
+}
+
+int cag_option_get_index(const cag_option_context *context)
+{
+    // Either we point to a value item,
+    return context->index;
+}
\ No newline at end of file
diff --git a/Kernel/Library/cwalk.c b/Kernel/Library/cwalk.c
new file mode 100644
index 00000000..2e1755c0
--- /dev/null
+++ b/Kernel/Library/cwalk.c
@@ -0,0 +1,1469 @@
+/*
+MIT License
+
+Copyright (c) 2020 Leonard Iklé
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+
+#include <assert.h>
+#include <cwalk.h>
+#include <convert.h>
+
+#pragma GCC diagnostic ignored "-Wdiscarded-qualifiers"
+#pragma GCC diagnostic ignored "-Wsequence-point"
+
+/**
+ * We try to default to a different path style depending on the operating
+ * system. So this should detect whether we should use windows or unix paths.
+ */
+#if defined(WIN32) || defined(_WIN32) ||                                       \
+  defined(__WIN32) && !defined(__CYGWIN__)
+static enum cwk_path_style path_style = CWK_STYLE_WINDOWS;
+#else
+static enum cwk_path_style path_style = CWK_STYLE_UNIX;
+#endif
+
+/**
+ * This is a list of separators used in different styles. Windows can read
+ * multiple separators, but it generally outputs just a backslash. The output
+ * will always use the first character for the output.
+ */
+static const char *separators[] = {
+  "\\/", // CWK_STYLE_WINDOWS
+  "/"    // CWK_STYLE_UNIX
+};
+
+/**
+ * A joined path represents multiple path strings which are concatenated, but
+ * not (necessarily) stored in contiguous memory. The joined path allows to
+ * iterate over the segments as if it was one piece of path.
+ */
+struct cwk_segment_joined
+{
+  struct cwk_segment segment;
+  const char **paths;
+  size_t path_index;
+};
+
+static size_t cwk_path_output_sized(char *buffer, size_t buffer_size,
+  size_t position, const char *str, size_t length)
+{
+  size_t amount_written;
+
+  // First we determine the amount which we can write to the buffer. There are
+  // three cases. In the first case we have enough to store the whole string in
+  // it. In the second one we can only store a part of it, and in the third we
+  // have no space left.
+  if (buffer_size > position + length) {
+    amount_written = length;
+  } else if (buffer_size > position) {
+    amount_written = buffer_size - position;
+  } else {
+    amount_written = 0;
+  }
+
+  // If we actually want to write out something we will do that here. We will
+  // always append a '\0', this way we are guaranteed to have a valid string at
+  // all times.
+  if (amount_written > 0) {
+    memmove(&buffer[position], str, amount_written);
+  }
+
+  // Return the theoretical length which would have been written when everything
+  // would have fit in the buffer.
+  return length;
+}
+
+static size_t cwk_path_output_current(char *buffer, size_t buffer_size,
+  size_t position)
+{
+  // We output a "current" directory, which is a single character. This
+  // character is currently not style dependant.
+  return cwk_path_output_sized(buffer, buffer_size, position, ".", 1);
+}
+
+static size_t cwk_path_output_back(char *buffer, size_t buffer_size,
+  size_t position)
+{
+  // We output a "back" directory, which ahs two characters. This
+  // character is currently not style dependant.
+  return cwk_path_output_sized(buffer, buffer_size, position, "..", 2);
+}
+
+static size_t cwk_path_output_separator(char *buffer, size_t buffer_size,
+  size_t position)
+{
+  // We output a separator, which is a single character.
+  return cwk_path_output_sized(buffer, buffer_size, position,
+    separators[path_style], 1);
+}
+
+static size_t cwk_path_output_dot(char *buffer, size_t buffer_size,
+  size_t position)
+{
+  // We output a dot, which is a single character. This is used for extensions.
+  return cwk_path_output_sized(buffer, buffer_size, position, ".", 1);
+}
+
+static size_t cwk_path_output(char *buffer, size_t buffer_size, size_t position,
+  const char *str)
+{
+  size_t length;
+
+  // This just does a sized output internally, but first measuring the
+  // null-terminated string.
+  length = strlen(str);
+  return cwk_path_output_sized(buffer, buffer_size, position, str, length);
+}
+
+static void cwk_path_terminate_output(char *buffer, size_t buffer_size,
+  size_t pos)
+{
+  if (buffer_size > 0) {
+    if (pos >= buffer_size) {
+      buffer[buffer_size - 1] = '\0';
+    } else {
+      buffer[pos] = '\0';
+    }
+  }
+}
+
+static bool cwk_path_is_string_equal(const char *first, const char *second,
+  size_t first_size, size_t second_size)
+{
+  // THe two strings are not equal if the sizes are not equal.
+  if (first_size != second_size) {
+    return false;
+  }
+
+  // If the path style is UNIX, we will compare case sensitively. This can be
+  // done easily using strncmp.
+  if (path_style == CWK_STYLE_UNIX) {
+    return strncmp(first, second, first_size) == 0;
+  }
+
+  // However, if this is windows we will have to compare case insensitively.
+  // Since there is no standard method to do that we will have to do it on our
+  // own.
+  while (*first && *second && first_size > 0) {
+    // We can consider the string to be not equal if the two lowercase
+    // characters are not equal.
+    if (tolower(*first++) != tolower(*second++)) {
+      return false;
+    }
+
+    --first_size;
+  }
+
+  // The string must be equal since they both have the same length and all the
+  // characters are the same.
+  return true;
+}
+
+static const char *cwk_path_find_next_stop(const char *c)
+{
+  // We just move forward until we find a '\0' or a separator, which will be our
+  // next "stop".
+  while (*c != '\0' && !cwk_path_is_separator(c)) {
+    ++c;
+  }
+
+  // Return the pointer of the next stop.
+  return c;
+}
+
+static const char *cwk_path_find_previous_stop(const char *begin, const char *c)
+{
+  // We just move back until we find a separator or reach the beginning of the
+  // path, which will be our previous "stop".
+  while (c > begin && !cwk_path_is_separator(c)) {
+    --c;
+  }
+
+  // Return the pointer to the previous stop. We have to return the first
+  // character after the separator, not on the separator itself.
+  if (cwk_path_is_separator(c)) {
+    return c + 1;
+  } else {
+    return c;
+  }
+}
+
+static bool cwk_path_get_first_segment_without_root(const char *path,
+  const char *segments, struct cwk_segment *segment)
+{
+  // Let's remember the path. We will move the path pointer afterwards, that's
+  // why this has to be done first.
+  segment->path = path;
+  segment->segments = segments;
+  segment->begin = segments;
+  segment->end = segments;
+  segment->size = 0;
+
+  // Now let's check whether this is an empty string. An empty string has no
+  // segment it could use.
+  if (*segments == '\0') {
+    return false;
+  }
+
+  // If the string starts with separators, we will jump over those. If there is
+  // only a slash and a '\0' after it, we can't determine the first segment
+  // since there is none.
+  while (cwk_path_is_separator(segments)) {
+    ++segments;
+    if (*segments == '\0') {
+      return false;
+    }
+  }
+
+  // So this is the beginning of our segment.
+  segment->begin = segments;
+
+  // Now let's determine the end of the segment, which we do by moving the path
+  // pointer further until we find a separator.
+  segments = cwk_path_find_next_stop(segments);
+
+  // And finally, calculate the size of the segment by subtracting the position
+  // from the end.
+  segment->size = (size_t)(segments - segment->begin);
+  segment->end = segments;
+
+  // Tell the caller that we found a segment.
+  return true;
+}
+
+static bool cwk_path_get_last_segment_without_root(const char *path,
+  struct cwk_segment *segment)
+{
+  // Now this is fairly similar to the normal algorithm, however, it will assume
+  // that there is no root in the path. So we grab the first segment at this
+  // position, assuming there is no root.
+  if (!cwk_path_get_first_segment_without_root(path, path, segment)) {
+    return false;
+  }
+
+  // Now we find our last segment. The segment struct of the caller
+  // will contain the last segment, since the function we call here will not
+  // change the segment struct when it reaches the end.
+  while (cwk_path_get_next_segment(segment)) {
+    // We just loop until there is no other segment left.
+  }
+
+  return true;
+}
+
+static bool cwk_path_get_first_segment_joined(const char **paths,
+  struct cwk_segment_joined *sj)
+{
+  bool result;
+
+  // Prepare the first segment. We position the joined segment on the first path
+  // and assign the path array to the struct.
+  sj->path_index = 0;
+  sj->paths = paths;
+
+  // We loop through all paths until we find one which has a segment. The result
+  // is stored in a variable, so we can let the caller know whether we found one
+  // or not.
+  result = false;
+  while (paths[sj->path_index] != NULL &&
+         (result = cwk_path_get_first_segment(paths[sj->path_index],
+            &sj->segment)) == false) {
+    ++sj->path_index;
+  }
+
+  return result;
+}
+
+static bool cwk_path_get_next_segment_joined(struct cwk_segment_joined *sj)
+{
+  bool result;
+
+  if (sj->paths[sj->path_index] == NULL) {
+    // We reached already the end of all paths, so there is no other segment
+    // left.
+    return false;
+  } else if (cwk_path_get_next_segment(&sj->segment)) {
+    // There was another segment on the current path, so we are good to
+    // continue.
+    return true;
+  }
+
+  // We try to move to the next path which has a segment available. We must at
+  // least move one further since the current path reached the end.
+  result = false;
+
+  do {
+    ++sj->path_index;
+
+    // And we obviously have to stop this loop if there are no more paths left.
+    if (sj->paths[sj->path_index] == NULL) {
+      break;
+    }
+
+    // Grab the first segment of the next path and determine whether this path
+    // has anything useful in it. There is one more thing we have to consider
+    // here - for the first time we do this we want to skip the root, but
+    // afterwards we will consider that to be part of the segments.
+    result = cwk_path_get_first_segment_without_root(sj->paths[sj->path_index],
+      sj->paths[sj->path_index], &sj->segment);
+
+  } while (!result);
+
+  // Finally, report the result back to the caller.
+  return result;
+}
+
+static bool cwk_path_get_previous_segment_joined(struct cwk_segment_joined *sj)
+{
+  bool result;
+
+  if (*sj->paths == NULL) {
+    // It's possible that there is no initialized segment available in the
+    // struct since there are no paths. In that case we can return false, since
+    // there is no previous segment.
+    return false;
+  } else if (cwk_path_get_previous_segment(&sj->segment)) {
+    // Now we try to get the previous segment from the current path. If we can
+    // do that successfully, we can let the caller know that we found one.
+    return true;
+  }
+
+  result = false;
+
+  do {
+    // We are done once we reached index 0. In that case there are no more
+    // segments left.
+    if (sj->path_index == 0) {
+      break;
+    }
+
+    // There is another path which we have to inspect. So we decrease the path
+    // index.
+    --sj->path_index;
+
+    // If this is the first path we will have to consider that this path might
+    // include a root, otherwise we just treat is as a segment.
+    if (sj->path_index == 0) {
+      result = cwk_path_get_last_segment(sj->paths[sj->path_index],
+        &sj->segment);
+    } else {
+      result = cwk_path_get_last_segment_without_root(sj->paths[sj->path_index],
+        &sj->segment);
+    }
+
+  } while (!result);
+
+  return result;
+}
+
+static bool cwk_path_segment_back_will_be_removed(struct cwk_segment_joined *sj)
+{
+  enum cwk_segment_type type;
+  int counter;
+
+  // We are handling back segments here. We must verify how many back segments
+  // and how many normal segments come before this one to decide whether we keep
+  // or remove it.
+
+  // The counter determines how many normal segments are our current segment,
+  // which will popped off before us. If the counter goes above zero it means
+  // that our segment will be popped as well.
+  counter = 0;
+
+  // We loop over all previous segments until we either reach the beginning,
+  // which means our segment will not be dropped or the counter goes above zero.
+  while (cwk_path_get_previous_segment_joined(sj)) {
+
+    // Now grab the type. The type determines whether we will increase or
+    // decrease the counter. We don't handle a CWK_CURRENT frame here since it
+    // has no influence.
+    type = cwk_path_get_segment_type(&sj->segment);
+    if (type == CWK_NORMAL) {
+      // This is a normal segment. The normal segment will increase the counter
+      // since it neutralizes one back segment. If we go above zero we can
+      // return immediately.
+      ++counter;
+      if (counter > 0) {
+        return true;
+      }
+    } else if (type == CWK_BACK) {
+      // A CWK_BACK segment will reduce the counter by one. We can not remove a
+      // back segment as long we are not above zero since we don't have the
+      // opposite normal segment which we would remove.
+      --counter;
+    }
+  }
+
+  // We never got a count larger than zero, so we will keep this segment alive.
+  return false;
+}
+
+static bool cwk_path_segment_normal_will_be_removed(
+  struct cwk_segment_joined *sj)
+{
+  enum cwk_segment_type type;
+  int counter;
+
+  // The counter determines how many segments are above our current segment,
+  // which will popped off before us. If the counter goes below zero it means
+  // that our segment will be popped as well.
+  counter = 0;
+
+  // We loop over all following segments until we either reach the end, which
+  // means our segment will not be dropped or the counter goes below zero.
+  while (cwk_path_get_next_segment_joined(sj)) {
+
+    // First, grab the type. The type determines whether we will increase or
+    // decrease the counter. We don't handle a CWK_CURRENT frame here since it
+    // has no influence.
+    type = cwk_path_get_segment_type(&sj->segment);
+    if (type == CWK_NORMAL) {
+      // This is a normal segment. The normal segment will increase the counter
+      // since it will be removed by a "../" before us.
+      ++counter;
+    } else if (type == CWK_BACK) {
+      // A CWK_BACK segment will reduce the counter by one. If we are below zero
+      // we can return immediately.
+      --counter;
+      if (counter < 0) {
+        return true;
+      }
+    }
+  }
+
+  // We never got a negative count, so we will keep this segment alive.
+  return false;
+}
+
+static bool
+cwk_path_segment_will_be_removed(const struct cwk_segment_joined *sj,
+  bool absolute)
+{
+  enum cwk_segment_type type;
+  struct cwk_segment_joined sjc;
+
+  // We copy the joined path so we don't need to modify it.
+  sjc = *sj;
+
+  // First we check whether this is a CWK_CURRENT or CWK_BACK segment, since
+  // those will always be dropped.
+  type = cwk_path_get_segment_type(&sj->segment);
+  if (type == CWK_CURRENT || (type == CWK_BACK && absolute)) {
+    return true;
+  } else if (type == CWK_BACK) {
+    return cwk_path_segment_back_will_be_removed(&sjc);
+  } else {
+    return cwk_path_segment_normal_will_be_removed(&sjc);
+  }
+}
+
+static bool
+cwk_path_segment_joined_skip_invisible(struct cwk_segment_joined *sj,
+  bool absolute)
+{
+  while (cwk_path_segment_will_be_removed(sj, absolute)) {
+    if (!cwk_path_get_next_segment_joined(sj)) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+static void cwk_path_get_root_windows(const char *path, size_t *length)
+{
+  const char *c;
+  bool is_device_path;
+
+  // We can not determine the root if this is an empty string. So we set the
+  // root to NULL and the length to zero and cancel the whole thing.
+  c = path;
+  *length = 0;
+  if (!*c) {
+    return;
+  }
+
+  // Now we have to verify whether this is a windows network path (UNC), which
+  // we will consider our root.
+  if (cwk_path_is_separator(c)) {
+    ++c;
+
+    // Check whether the path starts with a single back slash, which means this
+    // is not a network path - just a normal path starting with a backslash.
+    if (!cwk_path_is_separator(c)) {
+      // Okay, this is not a network path but we still use the backslash as a
+      // root.
+      ++(*length);
+      return;
+    }
+
+    // A device path is a path which starts with "\\." or "\\?". A device path
+    // can be a UNC path as well, in which case it will take up one more
+    // segment. So, this is a network or device path. Skip the previous
+    // separator. Now we need to determine whether this is a device path. We
+    // might advance one character here if the server name starts with a '?' or
+    // a '.', but that's fine since we will search for a separator afterwards
+    // anyway.
+    ++c;
+    is_device_path = (*c == '?' || *c == '.') && cwk_path_is_separator(++c);
+    if (is_device_path) {
+      // That's a device path, and the root must be either "\\.\" or "\\?\"
+      // which is 4 characters long. (at least that's how Windows
+      // GetFullPathName behaves.)
+      *length = 4;
+      return;
+    }
+
+    // We will grab anything up to the next stop. The next stop might be a '\0'
+    // or another separator. That will be the server name.
+    c = cwk_path_find_next_stop(c);
+
+    // If this is a separator and not the end of a string we wil have to include
+    // it. However, if this is a '\0' we must not skip it.
+    while (cwk_path_is_separator(c)) {
+      ++c;
+    }
+
+    // We are now skipping the shared folder name, which will end after the
+    // next stop.
+    c = cwk_path_find_next_stop(c);
+
+    // Then there might be a separator at the end. We will include that as well,
+    // it will mark the path as absolute.
+    if (cwk_path_is_separator(c)) {
+      ++c;
+    }
+
+    // Finally, calculate the size of the root.
+    *length = (size_t)(c - path);
+    return;
+  }
+
+  // Move to the next and check whether this is a colon.
+  if (*++c == ':') {
+    *length = 2;
+
+    // Now check whether this is a backslash (or slash). If it is not, we could
+    // assume that the next character is a '\0' if it is a valid path. However,
+    // we will not assume that - since ':' is not valid in a path it must be a
+    // mistake by the caller than. We will try to understand it anyway.
+    if (cwk_path_is_separator(++c)) {
+      *length = 3;
+    }
+  }
+}
+
+static void cwk_path_get_root_unix(const char *path, size_t *length)
+{
+  // The slash of the unix path represents the root. There is no root if there
+  // is no slash.
+  if (cwk_path_is_separator(path)) {
+    *length = 1;
+  } else {
+    *length = 0;
+  }
+}
+
+static bool cwk_path_is_root_absolute(const char *path, size_t length)
+{
+  // This is definitely not absolute if there is no root.
+  if (length == 0) {
+    return false;
+  }
+
+  // If there is a separator at the end of the root, we can safely consider this
+  // to be an absolute path.
+  return cwk_path_is_separator(&path[length - 1]);
+}
+
+static size_t cwk_path_join_and_normalize_multiple(const char **paths,
+  char *buffer, size_t buffer_size)
+{
+  size_t pos;
+  bool absolute, has_segment_output;
+  struct cwk_segment_joined sj;
+
+  // We initialize the position after the root, which should get us started.
+  cwk_path_get_root(paths[0], &pos);
+
+  // Determine whether the path is absolute or not. We need that to determine
+  // later on whether we can remove superfluous "../" or not.
+  absolute = cwk_path_is_root_absolute(paths[0], pos);
+
+  // First copy the root to the output. We will not modify the root.
+  cwk_path_output_sized(buffer, buffer_size, 0, paths[0], pos);
+
+  // So we just grab the first segment. If there is no segment we will always
+  // output a "/", since we currently only support absolute paths here.
+  if (!cwk_path_get_first_segment_joined(paths, &sj)) {
+    goto done;
+  }
+
+  // Let's assume that we don't have any segment output for now. We will toggle
+  // this flag once there is some output.
+  has_segment_output = false;
+
+  do {
+    // Check whether we have to drop this segment because of resolving a
+    // relative path or because it is a CWK_CURRENT segment.
+    if (cwk_path_segment_will_be_removed(&sj, absolute)) {
+      continue;
+    }
+
+    // We add a separator if we previously wrote a segment. The last segment
+    // must not have a trailing separator. This must happen before the segment
+    // output, since we would override the null terminating character with
+    // reused buffers if this was done afterwards.
+    if (has_segment_output) {
+      pos += cwk_path_output_separator(buffer, buffer_size, pos);
+    }
+
+    // Remember that we have segment output, so we can handle the trailing slash
+    // later on. This is necessary since we might have segments but they are all
+    // removed.
+    has_segment_output = true;
+
+    // Write out the segment but keep in mind that we need to follow the
+    // buffer size limitations. That's why we use the path output functions
+    // here.
+    pos += cwk_path_output_sized(buffer, buffer_size, pos, sj.segment.begin,
+      sj.segment.size);
+  } while (cwk_path_get_next_segment_joined(&sj));
+
+  // Remove the trailing slash, but only if we have segment output. We don't
+  // want to remove anything from the root.
+  if (!has_segment_output && pos == 0) {
+    // This may happen if the path is absolute and all segments have been
+    // removed. We can not have an empty output - and empty output means we stay
+    // in the current directory. So we will output a ".".
+    assert(absolute == false);
+    pos += cwk_path_output_current(buffer, buffer_size, pos);
+  }
+
+  // We must append a '\0' in any case, unless the buffer size is zero. If the
+  // buffer size is zero, which means we can not.
+done:
+  cwk_path_terminate_output(buffer, buffer_size, pos);
+
+  // And finally let our caller know about the total size of the normalized
+  // path.
+  return pos;
+}
+
+size_t cwk_path_get_absolute(const char *base, const char *path, char *buffer,
+  size_t buffer_size)
+{
+  size_t i;
+  const char *paths[4];
+
+  // The basename should be an absolute path if the caller is using the API
+  // correctly. However, he might not and in that case we will append a fake
+  // root at the beginning.
+  if (cwk_path_is_absolute(base)) {
+    i = 0;
+  } else if (path_style == CWK_STYLE_WINDOWS) {
+    paths[0] = "\\";
+    i = 1;
+  } else {
+    paths[0] = "/";
+    i = 1;
+  }
+
+  if (cwk_path_is_absolute(path)) {
+    // If the submitted path is not relative the base path becomes irrelevant.
+    // We will only normalize the submitted path instead.
+    paths[i++] = path;
+    paths[i] = NULL;
+  } else {
+    // Otherwise we append the relative path to the base path and normalize it.
+    // The result will be a new absolute path.
+    paths[i++] = base;
+    paths[i++] = path;
+    paths[i] = NULL;
+  }
+
+  // Finally join everything together and normalize it.
+  return cwk_path_join_and_normalize_multiple(paths, buffer, buffer_size);
+}
+
+static void cwk_path_skip_segments_until_diverge(struct cwk_segment_joined *bsj,
+  struct cwk_segment_joined *osj, bool absolute, bool *base_available,
+  bool *other_available)
+{
+  // Now looping over all segments until they start to diverge. A path may
+  // diverge if two segments are not equal or if one path reaches the end.
+  do {
+
+    // Check whether there is anything available after we skip everything which
+    // is invisible. We do that for both paths, since we want to let the caller
+    // know which path has some trailing segments after they diverge.
+    *base_available = cwk_path_segment_joined_skip_invisible(bsj, absolute);
+    *other_available = cwk_path_segment_joined_skip_invisible(osj, absolute);
+
+    // We are done if one or both of those paths reached the end. They either
+    // diverge or both reached the end - but in both cases we can not continue
+    // here.
+    if (!*base_available || !*other_available) {
+      break;
+    }
+
+    // Compare the content of both segments. We are done if they are not equal,
+    // since they diverge.
+    if (!cwk_path_is_string_equal(bsj->segment.begin, osj->segment.begin,
+          bsj->segment.size, osj->segment.size)) {
+      break;
+    }
+
+    // We keep going until one of those segments reached the end. The next
+    // segment might be invisible, but we will check for that in the beginning
+    // of the loop once again.
+    *base_available = cwk_path_get_next_segment_joined(bsj);
+    *other_available = cwk_path_get_next_segment_joined(osj);
+  } while (*base_available && *other_available);
+}
+
+size_t cwk_path_get_relative(const char *base_directory, const char *path,
+  char *buffer, size_t buffer_size)
+{
+  size_t pos, base_root_length, path_root_length;
+  bool absolute, base_available, other_available, has_output;
+  const char *base_paths[2], *other_paths[2];
+  struct cwk_segment_joined bsj, osj;
+
+  pos = 0;
+
+  // First we compare the roots of those two paths. If the roots are not equal
+  // we can't continue, since there is no way to get a relative path from
+  // different roots.
+  cwk_path_get_root(base_directory, &base_root_length);
+  cwk_path_get_root(path, &path_root_length);
+  if (base_root_length != path_root_length ||
+      !cwk_path_is_string_equal(base_directory, path, base_root_length,
+        path_root_length)) {
+    cwk_path_terminate_output(buffer, buffer_size, pos);
+    return pos;
+  }
+
+  // Verify whether this is an absolute path. We need to know that since we can
+  // remove all back-segments if it is.
+  absolute = cwk_path_is_root_absolute(base_directory, base_root_length);
+
+  // Initialize our joined segments. This will allow us to use the internal
+  // functions to skip until diverge and invisible. We only have one path in
+  // them though.
+  base_paths[0] = base_directory;
+  base_paths[1] = NULL;
+  other_paths[0] = path;
+  other_paths[1] = NULL;
+  cwk_path_get_first_segment_joined(base_paths, &bsj);
+  cwk_path_get_first_segment_joined(other_paths, &osj);
+
+  // Okay, now we skip until the segments diverge. We don't have anything to do
+  // with the segments which are equal.
+  cwk_path_skip_segments_until_diverge(&bsj, &osj, absolute, &base_available,
+    &other_available);
+
+  // Assume there is no output until we have got some. We will need this
+  // information later on to remove trailing slashes or alternatively output a
+  // current-segment.
+  has_output = false;
+
+  // So if we still have some segments left in the base path we will now output
+  // a back segment for all of them.
+  if (base_available) {
+    do {
+      // Skip any invisible segment. We don't care about those and we don't need
+      // to navigate back because of them.
+      if (!cwk_path_segment_joined_skip_invisible(&bsj, absolute)) {
+        break;
+      }
+
+      // Toggle the flag if we have output. We need to remember that, since we
+      // want to remove the trailing slash.
+      has_output = true;
+
+      // Output the back segment and a separator. No need to worry about the
+      // superfluous segment since it will be removed later on.
+      pos += cwk_path_output_back(buffer, buffer_size, pos);
+      pos += cwk_path_output_separator(buffer, buffer_size, pos);
+    } while (cwk_path_get_next_segment_joined(&bsj));
+  }
+
+  // And if we have some segments available of the target path we will output
+  // all of those.
+  if (other_available) {
+    do {
+      // Again, skip any invisible segments since we don't need to navigate into
+      // them.
+      if (!cwk_path_segment_joined_skip_invisible(&osj, absolute)) {
+        break;
+      }
+
+      // Toggle the flag if we have output. We need to remember that, since we
+      // want to remove the trailing slash.
+      has_output = true;
+
+      // Output the current segment and a separator. No need to worry about the
+      // superfluous segment since it will be removed later on.
+      pos += cwk_path_output_sized(buffer, buffer_size, pos, osj.segment.begin,
+        osj.segment.size);
+      pos += cwk_path_output_separator(buffer, buffer_size, pos);
+    } while (cwk_path_get_next_segment_joined(&osj));
+  }
+
+  // If we have some output by now we will have to remove the trailing slash. We
+  // simply do that by moving back one character. The terminate output function
+  // will then place the '\0' on this position. Otherwise, if there is no
+  // output, we will have to output a "current directory", since the target path
+  // points to the base path.
+  if (has_output) {
+    --pos;
+  } else {
+    pos += cwk_path_output_current(buffer, buffer_size, pos);
+  }
+
+  // Finally, we can terminate the output - which means we place a '\0' at the
+  // current position or at the end of the buffer.
+  cwk_path_terminate_output(buffer, buffer_size, pos);
+
+  return pos;
+}
+
+size_t cwk_path_join(const char *path_a, const char *path_b, char *buffer,
+  size_t buffer_size)
+{
+  const char *paths[3];
+
+  // This is simple. We will just create an array with the two paths which we
+  // wish to join.
+  paths[0] = path_a;
+  paths[1] = path_b;
+  paths[2] = NULL;
+
+  // And then call the join and normalize function which will do the hard work
+  // for us.
+  return cwk_path_join_and_normalize_multiple(paths, buffer, buffer_size);
+}
+
+size_t cwk_path_join_multiple(const char **paths, char *buffer,
+  size_t buffer_size)
+{
+  // We can just call the internal join and normalize function for this one,
+  // since it will handle everything.
+  return cwk_path_join_and_normalize_multiple(paths, buffer, buffer_size);
+}
+
+void cwk_path_get_root(const char *path, size_t *length)
+{
+  // We use a different implementation here based on the configuration of the
+  // library.
+  if (path_style == CWK_STYLE_WINDOWS) {
+    cwk_path_get_root_windows(path, length);
+  } else {
+    cwk_path_get_root_unix(path, length);
+  }
+}
+
+size_t cwk_path_change_root(const char *path, const char *new_root,
+  char *buffer, size_t buffer_size)
+{
+  const char *tail;
+  size_t root_length, path_length, tail_length, new_root_length, new_path_size;
+
+  // First we need to determine the actual size of the root which we will
+  // change.
+  cwk_path_get_root(path, &root_length);
+
+  // Now we determine the sizes of the new root and the path. We need that to
+  // determine the size of the part after the root (the tail).
+  new_root_length = strlen(new_root);
+  path_length = strlen(path);
+
+  // Okay, now we calculate the position of the tail and the length of it.
+  tail = path + root_length;
+  tail_length = path_length - root_length;
+
+  // We first output the tail and then the new root, that's because the source
+  // path and the buffer may be overlapping. This way the root will not
+  // overwrite the tail.
+  cwk_path_output_sized(buffer, buffer_size, new_root_length, tail,
+    tail_length);
+  cwk_path_output_sized(buffer, buffer_size, 0, new_root, new_root_length);
+
+  // Finally we calculate the size o the new path and terminate the output with
+  // a '\0'.
+  new_path_size = tail_length + new_root_length;
+  cwk_path_terminate_output(buffer, buffer_size, new_path_size);
+
+  return new_path_size;
+}
+
+bool cwk_path_is_absolute(const char *path)
+{
+  size_t length;
+
+  // We grab the root of the path. This root does not include the first
+  // separator of a path.
+  cwk_path_get_root(path, &length);
+
+  // Now we can determine whether the root is absolute or not.
+  return cwk_path_is_root_absolute(path, length);
+}
+
+bool cwk_path_is_relative(const char *path)
+{
+  // The path is relative if it is not absolute.
+  return !cwk_path_is_absolute(path);
+}
+
+void cwk_path_get_basename(const char *path, const char **basename,
+  size_t *length)
+{
+  struct cwk_segment segment;
+
+  // We get the last segment of the path. The last segment will contain the
+  // basename if there is any. If there are no segments we will set the basename
+  // to NULL and the length to 0.
+  if (!cwk_path_get_last_segment(path, &segment)) {
+    *basename = NULL;
+    if (length) {
+      *length = 0;
+    }
+    return;
+  }
+
+  // Now we can just output the segment contents, since that's our basename.
+  // There might be trailing separators after the basename, but the size does
+  // not include those.
+  *basename = segment.begin;
+  if (length) {
+    *length = segment.size;
+  }
+}
+
+size_t cwk_path_change_basename(const char *path, const char *new_basename,
+  char *buffer, size_t buffer_size)
+{
+  struct cwk_segment segment;
+  size_t pos, root_size, new_basename_size;
+
+  // First we try to get the last segment. We may only have a root without any
+  // segments, in which case we will create one.
+  if (!cwk_path_get_last_segment(path, &segment)) {
+
+    // So there is no segment in this path. First we grab the root and output
+    // that. We are not going to modify the root in any way.
+    cwk_path_get_root(path, &root_size);
+    pos = cwk_path_output_sized(buffer, buffer_size, 0, path, root_size);
+
+    // We have to trim the separators from the beginning of the new basename.
+    // This is quite easy to do.
+    while (cwk_path_is_separator(new_basename)) {
+      ++new_basename;
+    }
+
+    // Now we measure the length of the new basename, this is a two step
+    // process. First we find the '\0' character at the end of the string.
+    new_basename_size = 0;
+    while (new_basename[new_basename_size]) {
+      ++new_basename_size;
+    }
+
+    // And then we trim the separators at the end of the basename until we reach
+    // the first valid character.
+    while (new_basename_size > 0 &&
+           cwk_path_is_separator(&new_basename[new_basename_size - 1])) {
+      --new_basename_size;
+    }
+
+    // Now we will output the new basename after the root.
+    pos += cwk_path_output_sized(buffer, buffer_size, pos, new_basename,
+      new_basename_size);
+
+    // And finally terminate the output and return the total size of the path.
+    cwk_path_terminate_output(buffer, buffer_size, pos);
+    return pos;
+  }
+
+  // If there is a last segment we can just forward this call, which is fairly
+  // easy.
+  return cwk_path_change_segment(&segment, new_basename, buffer, buffer_size);
+}
+
+void cwk_path_get_dirname(const char *path, size_t *length)
+{
+  struct cwk_segment segment;
+
+  // We get the last segment of the path. The last segment will contain the
+  // basename if there is any. If there are no segments we will set the length
+  // to 0.
+  if (!cwk_path_get_last_segment(path, &segment)) {
+    *length = 0;
+    return;
+  }
+
+  // We can now return the length from the beginning of the string up to the
+  // beginning of the last segment.
+  *length = (size_t)(segment.begin - path);
+}
+
+bool cwk_path_get_extension(const char *path, const char **extension,
+  size_t *length)
+{
+  struct cwk_segment segment;
+  const char *c;
+
+  // We get the last segment of the path. The last segment will contain the
+  // extension if there is any.
+  if (!cwk_path_get_last_segment(path, &segment)) {
+    return false;
+  }
+
+  // Now we search for a dot within the segment. If there is a dot, we consider
+  // the rest of the segment the extension. We do this from the end towards the
+  // beginning, since we want to find the last dot.
+  for (c = segment.end; c >= segment.begin; --c) {
+    if (*c == '.') {
+      // Okay, we found an extension. We can stop looking now.
+      *extension = c;
+      *length = (size_t)(segment.end - c);
+      return true;
+    }
+  }
+
+  // We couldn't find any extension.
+  return false;
+}
+
+bool cwk_path_has_extension(const char *path)
+{
+  const char *extension;
+  size_t length;
+
+  // We just wrap the get_extension call which will then do the work for us.
+  return cwk_path_get_extension(path, &extension, &length);
+}
+
+size_t cwk_path_change_extension(const char *path, const char *new_extension,
+  char *buffer, size_t buffer_size)
+{
+  struct cwk_segment segment;
+  const char *c, *old_extension;
+  size_t pos, root_size, trail_size, new_extension_size;
+
+  // First we try to get the last segment. We may only have a root without any
+  // segments, in which case we will create one.
+  if (!cwk_path_get_last_segment(path, &segment)) {
+
+    // So there is no segment in this path. First we grab the root and output
+    // that. We are not going to modify the root in any way. If there is no
+    // root, this will end up with a root size 0, and nothing will be written.
+    cwk_path_get_root(path, &root_size);
+    pos = cwk_path_output_sized(buffer, buffer_size, 0, path, root_size);
+
+    // Add a dot if the submitted value doesn't have any.
+    if (*new_extension != '.') {
+      pos += cwk_path_output_dot(buffer, buffer_size, pos);
+    }
+
+    // And finally terminate the output and return the total size of the path.
+    pos += cwk_path_output(buffer, buffer_size, pos, new_extension);
+    cwk_path_terminate_output(buffer, buffer_size, pos);
+    return pos;
+  }
+
+  // Now we seek the old extension in the last segment, which we will replace
+  // with the new one. If there is no old extension, it will point to the end of
+  // the segment.
+  old_extension = segment.end;
+  for (c = segment.begin; c < segment.end; ++c) {
+    if (*c == '.') {
+      old_extension = c;
+    }
+  }
+
+  pos = cwk_path_output_sized(buffer, buffer_size, 0, segment.path,
+    (size_t)(old_extension - segment.path));
+
+  // If the new extension starts with a dot, we will skip that dot. We always
+  // output exactly one dot before the extension. If the extension contains
+  // multiple dots, we will output those as part of the extension.
+  if (*new_extension == '.') {
+    ++new_extension;
+  }
+
+  // We calculate the size of the new extension, including the dot, in order to
+  // output the trail - which is any part of the path coming after the
+  // extension. We must output this first, since the buffer may overlap with the
+  // submitted path - and it would be overridden by longer extensions.
+  new_extension_size = strlen(new_extension) + 1;
+  trail_size = cwk_path_output(buffer, buffer_size, pos + new_extension_size,
+    segment.end);
+
+  // Finally we output the dot and the new extension. The new extension itself
+  // doesn't contain the dot anymore, so we must output that first.
+  pos += cwk_path_output_dot(buffer, buffer_size, pos);
+  pos += cwk_path_output(buffer, buffer_size, pos, new_extension);
+
+  // Now we terminate the output with a null-terminating character, but before
+  // we do that we must add the size of the trail to the position which we
+  // output before.
+  pos += trail_size;
+  cwk_path_terminate_output(buffer, buffer_size, pos);
+
+  // And the position is our output size now.
+  return pos;
+}
+
+size_t cwk_path_normalize(const char *path, char *buffer, size_t buffer_size)
+{
+  const char *paths[2];
+
+  // Now we initialize the paths which we will normalize. Since this function
+  // only supports submitting a single path, we will only add that one.
+  paths[0] = path;
+  paths[1] = NULL;
+
+  return cwk_path_join_and_normalize_multiple(paths, buffer, buffer_size);
+}
+
+size_t cwk_path_get_intersection(const char *path_base, const char *path_other)
+{
+  bool absolute;
+  size_t base_root_length, other_root_length;
+  const char *end;
+  const char *paths_base[2], *paths_other[2];
+  struct cwk_segment_joined base, other;
+
+  // We first compare the two roots. We just return zero if they are not equal.
+  // This will also happen to return zero if the paths are mixed relative and
+  // absolute.
+  cwk_path_get_root(path_base, &base_root_length);
+  cwk_path_get_root(path_other, &other_root_length);
+  if (!cwk_path_is_string_equal(path_base, path_other, base_root_length,
+        other_root_length)) {
+    return 0;
+  }
+
+  // Configure our paths. We just have a single path in here for now.
+  paths_base[0] = path_base;
+  paths_base[1] = NULL;
+  paths_other[0] = path_other;
+  paths_other[1] = NULL;
+
+  // So we get the first segment of both paths. If one of those paths don't have
+  // any segment, we will return 0.
+  if (!cwk_path_get_first_segment_joined(paths_base, &base) ||
+      !cwk_path_get_first_segment_joined(paths_other, &other)) {
+    return base_root_length;
+  }
+
+  // We now determine whether the path is absolute or not. This is required
+  // because if will ignore removed segments, and this behaves differently if
+  // the path is absolute. However, we only need to check the base path because
+  // we are guaranteed that both paths are either relative or absolute.
+  absolute = cwk_path_is_root_absolute(path_base, base_root_length);
+
+  // We must keep track of the end of the previous segment. Initially, this is
+  // set to the beginning of the path. This means that 0 is returned if the
+  // first segment is not equal.
+  end = path_base + base_root_length;
+
+  // Now we loop over both segments until one of them reaches the end or their
+  // contents are not equal.
+  do {
+    // We skip all segments which will be removed in each path, since we want to
+    // know about the true path.
+    if (!cwk_path_segment_joined_skip_invisible(&base, absolute) ||
+        !cwk_path_segment_joined_skip_invisible(&other, absolute)) {
+      break;
+    }
+
+    if (!cwk_path_is_string_equal(base.segment.begin, other.segment.begin,
+          base.segment.size, other.segment.size)) {
+      // So the content of those two segments are not equal. We will return the
+      // size up to the beginning.
+      return (size_t)(end - path_base);
+    }
+
+    // Remember the end of the previous segment before we go to the next one.
+    end = base.segment.end;
+  } while (cwk_path_get_next_segment_joined(&base) &&
+           cwk_path_get_next_segment_joined(&other));
+
+  // Now we calculate the length up to the last point where our paths pointed to
+  // the same place.
+  return (size_t)(end - path_base);
+}
+
+bool cwk_path_get_first_segment(const char *path, struct cwk_segment *segment)
+{
+  size_t length;
+  const char *segments;
+
+  // We skip the root since that's not part of the first segment. The root is
+  // treated as a separate entity.
+  cwk_path_get_root(path, &length);
+  segments = path + length;
+
+  // Now, after we skipped the root we can continue and find the actual segment
+  // content.
+  return cwk_path_get_first_segment_without_root(path, segments, segment);
+}
+
+bool cwk_path_get_last_segment(const char *path, struct cwk_segment *segment)
+{
+  // We first grab the first segment. This might be our last segment as well,
+  // but we don't know yet. There is no last segment if there is no first
+  // segment, so we return false in that case.
+  if (!cwk_path_get_first_segment(path, segment)) {
+    return false;
+  }
+
+  // Now we find our last segment. The segment struct of the caller
+  // will contain the last segment, since the function we call here will not
+  // change the segment struct when it reaches the end.
+  while (cwk_path_get_next_segment(segment)) {
+    // We just loop until there is no other segment left.
+  }
+
+  return true;
+}
+
+bool cwk_path_get_next_segment(struct cwk_segment *segment)
+{
+  const char *c;
+
+  // First we jump to the end of the previous segment. The first character must
+  // be either a '\0' or a separator.
+  c = segment->begin + segment->size;
+  if (*c == '\0') {
+    return false;
+  }
+
+  // Now we skip all separator until we reach something else. We are not yet
+  // guaranteed to have a segment, since the string could just end afterwards.
+  assert(cwk_path_is_separator(c));
+  do {
+    ++c;
+  } while (cwk_path_is_separator(c));
+
+  // If the string ends here, we can safely assume that there is no other
+  // segment after this one.
+  if (*c == '\0') {
+    return false;
+  }
+
+  // Now we are safe to assume there is a segment. We store the beginning of
+  // this segment in the segment struct of the caller.
+  segment->begin = c;
+
+  // And now determine the size of this segment, and store it in the struct of
+  // the caller as well.
+  c = cwk_path_find_next_stop(c);
+  segment->end = c;
+  segment->size = (size_t)(c - segment->begin);
+
+  // Tell the caller that we found a segment.
+  return true;
+}
+
+bool cwk_path_get_previous_segment(struct cwk_segment *segment)
+{
+  const char *c;
+
+  // The current position might point to the first character of the path, which
+  // means there are no previous segments available.
+  c = segment->begin;
+  if (c <= segment->segments) {
+    return false;
+  }
+
+  // We move towards the beginning of the path until we either reached the
+  // beginning or the character is no separator anymore.
+  do {
+    --c;
+    if (c < segment->segments) {
+      // So we reached the beginning here and there is no segment. So we return
+      // false and don't change the segment structure submitted by the caller.
+      return false;
+    }
+  } while (cwk_path_is_separator(c));
+
+  // We are guaranteed now that there is another segment, since we moved before
+  // the previous separator and did not reach the segment path beginning.
+  segment->end = c + 1;
+  segment->begin = cwk_path_find_previous_stop(segment->segments, c);
+  segment->size = (size_t)(segment->end - segment->begin);
+
+  return true;
+}
+
+enum cwk_segment_type cwk_path_get_segment_type(
+  const struct cwk_segment *segment)
+{
+  // We just make a string comparison with the segment contents and return the
+  // appropriate type.
+  if (strncmp(segment->begin, ".", segment->size) == 0) {
+    return CWK_CURRENT;
+  } else if (strncmp(segment->begin, "..", segment->size) == 0) {
+    return CWK_BACK;
+  }
+
+  return CWK_NORMAL;
+}
+
+bool cwk_path_is_separator(const char *str)
+{
+  const char *c;
+
+  // We loop over all characters in the read symbols.
+  c = separators[path_style];
+  while (*c) {
+    if (*c == *str) {
+      return true;
+    }
+
+    ++c;
+  }
+
+  return false;
+}
+
+size_t cwk_path_change_segment(struct cwk_segment *segment, const char *value,
+  char *buffer, size_t buffer_size)
+{
+  size_t pos, value_size, tail_size;
+
+  // First we have to output the head, which is the whole string up to the
+  // beginning of the segment. This part of the path will just stay the same.
+  pos = cwk_path_output_sized(buffer, buffer_size, 0, segment->path,
+    (size_t)(segment->begin - segment->path));
+
+  // In order to trip the submitted value, we will skip any separator at the
+  // beginning of it and behave as if it was never there.
+  while (cwk_path_is_separator(value)) {
+    ++value;
+  }
+
+  // Now we determine the length of the value. In order to do that we first
+  // locate the '\0'.
+  value_size = 0;
+  while (value[value_size]) {
+    ++value_size;
+  }
+
+  // Since we trim separators at the beginning and in the end of the value we
+  // have to subtract from the size until there are either no more characters
+  // left or the last character is no separator.
+  while (value_size > 0 && cwk_path_is_separator(&value[value_size - 1])) {
+    --value_size;
+  }
+
+  // We also have to determine the tail size, which is the part of the string
+  // following the current segment. This part will not change.
+  tail_size = strlen(segment->end);
+
+  // Now we output the tail. We have to do that, because if the buffer and the
+  // source are overlapping we would override the tail if the value is
+  // increasing in length.
+  cwk_path_output_sized(buffer, buffer_size, pos + value_size, segment->end,
+    tail_size);
+
+  // Finally we can output the value in the middle of the head and the tail,
+  // where we have enough space to fit the whole trimmed value.
+  pos += cwk_path_output_sized(buffer, buffer_size, pos, value, value_size);
+
+  // Now we add the tail size to the current position and terminate the output -
+  // basically, ensure that there is a '\0' at the end of the buffer.
+  pos += tail_size;
+  cwk_path_terminate_output(buffer, buffer_size, pos);
+
+  // And now tell the caller how long the whole path would be.
+  return pos;
+}
+
+enum cwk_path_style cwk_path_guess_style(const char *path)
+{
+  const char *c;
+  size_t root_length;
+  struct cwk_segment segment;
+
+  // First we determine the root. Only windows roots can be longer than a single
+  // slash, so if we can determine that it starts with something like "C:", we
+  // know that this is a windows path.
+  cwk_path_get_root_windows(path, &root_length);
+  if (root_length > 1) {
+    return CWK_STYLE_WINDOWS;
+  }
+
+  // Next we check for slashes. Windows uses backslashes, while unix uses
+  // forward slashes. Windows actually supports both, but our best guess is to
+  // assume windows with backslashes and unix with forward slashes.
+  for (c = path; *c; ++c) {
+    if (*c == *separators[CWK_STYLE_UNIX]) {
+      return CWK_STYLE_UNIX;
+    } else if (*c == *separators[CWK_STYLE_WINDOWS]) {
+      return CWK_STYLE_WINDOWS;
+    }
+  }
+
+  // This path does not have any slashes. We grab the last segment (which
+  // actually must be the first one), and determine whether the segment starts
+  // with a dot. A dot is a hidden folder or file in the UNIX world, in that
+  // case we assume the path to have UNIX style.
+  if (!cwk_path_get_last_segment(path, &segment)) {
+    // We couldn't find any segments, so we default to a UNIX path style since
+    // there is no way to make any assumptions.
+    return CWK_STYLE_UNIX;
+  }
+
+  if (*segment.begin == '.') {
+    return CWK_STYLE_UNIX;
+  }
+
+  // And finally we check whether the last segment contains a dot. If it
+  // contains a dot, that might be an extension. Windows is more likely to have
+  // file names with extensions, so our guess would be windows.
+  for (c = segment.begin; *c; ++c) {
+    if (*c == '.') {
+      return CWK_STYLE_WINDOWS;
+    }
+  }
+
+  // All our checks failed, so we will return a default value which is currently
+  // UNIX.
+  return CWK_STYLE_UNIX;
+}
+
+void cwk_path_set_style(enum cwk_path_style style)
+{
+  // We can just set the global path style variable and then the behaviour for
+  // all functions will change accordingly.
+  assert(style == CWK_STYLE_UNIX || style == CWK_STYLE_WINDOWS);
+  path_style = style;
+}
+
+enum cwk_path_style cwk_path_get_style(void)
+{
+  // Simply return the path style which we store in a global variable.
+  return path_style;
+}
diff --git a/Kernel/Library/cxxabi.cpp b/Kernel/Library/cxxabi.cpp
new file mode 100644
index 00000000..fc06100a
--- /dev/null
+++ b/Kernel/Library/cxxabi.cpp
@@ -0,0 +1,294 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <types.h>
+
+#include <memory.hpp>
+#include <debug.h>
+
+// TODO: complete implementation for everything
+// TODO: https://wiki.osdev.org/C%2B%2B
+
+#define ATEXIT_MAX_FUNCS 128
+
+typedef unsigned uarch_t;
+
+struct atexit_func_entry_t
+{
+    /*
+     * Each member is at least 4 bytes large. Such that each entry is 12bytes.
+     * 128 * 12 = 1.5KB exact.
+     **/
+    void (*destructor_func)(void *);
+    void *obj_ptr;
+    void *dso_handle;
+};
+
+typedef enum
+{
+    _URC_NO_REASON = 0,
+    _URC_FOREIGN_EXCEPTION_CAUGHT = 1,
+    _URC_FATAL_PHASE2_ERROR = 2,
+    _URC_FATAL_PHASE1_ERROR = 3,
+    _URC_NORMAL_STOP = 4,
+    _URC_END_OF_STACK = 5,
+    _URC_HANDLER_FOUND = 6,
+    _URC_INSTALL_CONTEXT = 7,
+    _URC_CONTINUE_UNWIND = 8
+} _Unwind_Reason_Code;
+
+struct _Unwind_Context;
+typedef unsigned _Unwind_Ptr __attribute__((__mode__(__pointer__)));
+typedef unsigned _Unwind_Exception_Class __attribute__((__mode__(__DI__)));
+typedef unsigned _Unwind_Word __attribute__((__mode__(__unwind_word__)));
+typedef void (*_Unwind_Exception_Cleanup_Fn)(_Unwind_Reason_Code, struct _Unwind_Exception *);
+typedef int _Unwind_Action;
+
+struct type_info
+{
+    const char *name;
+};
+
+struct unexpected_handler
+{
+    void (*unexpected)();
+};
+
+struct terminate_handler
+{
+    void (*handler)();
+};
+
+struct _Unwind_Exception
+{
+    _Unwind_Exception_Class exception_class;
+    _Unwind_Exception_Cleanup_Fn exception_cleanup;
+#if !defined(__USING_SJLJ_EXCEPTIONS__) && defined(__SEH__)
+    _Unwind_Word private_[6];
+#else
+    _Unwind_Word private_1;
+    _Unwind_Word private_2;
+#endif
+} __attribute__((__aligned__));
+
+struct __cxa_exception
+{
+#if __LP64__
+    size_t referenceCount;
+#endif
+    type_info *exceptionType;
+    void (*exceptionDestructor)(void *);
+    unexpected_handler unexpectedHandler;
+    terminate_handler terminateHandler;
+    __cxa_exception *nextException;
+    int handlerCount;
+
+#ifdef __ARM_EABI_UNWINDER__
+    __cxa_exception *nextPropagatingException;
+    int propagationCount;
+#else
+    int handlerSwitchValue;
+    const unsigned char *actionRecord;
+    const unsigned char *languageSpecificData;
+    _Unwind_Ptr catchTemp;
+    void *adjustedPtr;
+#endif
+#if !__LP64__
+    size_t referenceCount;
+#endif
+    _Unwind_Exception unwindHeader;
+};
+
+/* extern */ void *__dso_handle = 0;
+atexit_func_entry_t __atexit_funcs[ATEXIT_MAX_FUNCS];
+uarch_t __atexit_func_count = 0;
+
+extern "C" int __cxa_atexit(void (*f)(void *), void *objptr, void *dso)
+{
+    fixme("__cxa_atexit( %p %p %p ) triggered.", f, objptr, dso);
+    if (__atexit_func_count >= ATEXIT_MAX_FUNCS)
+        return -1;
+    __atexit_funcs[__atexit_func_count].destructor_func = f;
+    __atexit_funcs[__atexit_func_count].obj_ptr = objptr;
+    __atexit_funcs[__atexit_func_count].dso_handle = dso;
+    __atexit_func_count++;
+    return 0;
+}
+
+extern "C" void __cxa_finalize(void *f)
+{
+    fixme("__cxa_finalize( %p ) triggered.", f);
+    uarch_t i = __atexit_func_count;
+    if (!f)
+    {
+        while (i--)
+            if (__atexit_funcs[i].destructor_func)
+                (*__atexit_funcs[i].destructor_func)(__atexit_funcs[i].obj_ptr);
+
+        return;
+    }
+
+    while (i--)
+        if (__atexit_funcs[i].destructor_func == f)
+        {
+            (*__atexit_funcs[i].destructor_func)(__atexit_funcs[i].obj_ptr);
+            __atexit_funcs[i].destructor_func = 0;
+        }
+}
+
+extern "C" _Unwind_Reason_Code __gxx_personality_v0(int version, _Unwind_Action actions, _Unwind_Exception_Class exception_class, _Unwind_Exception *ue_header, _Unwind_Context *context)
+{
+    fixme("__gxx_personality_v0( %d %p %p %p %p ) triggered.", version, actions, exception_class, ue_header, context);
+    return _URC_NO_REASON;
+}
+
+extern "C" void _Unwind_Resume(struct _Unwind_Exception *exc) { fixme("_Unwind_Resume( %p ) triggered.", exc); }
+
+static inline size_t align_exception_allocation_size(size_t s, size_t a) { return (s + a - 1) & ~(a - 1); }
+
+void unexpected_header_stub() { fixme("unexpected() called."); }
+void terminate_header_stub() { fixme("terminate() called."); }
+
+extern "C" void *__cxa_allocate_exception(size_t thrown_size) throw()
+{
+    fixme("__cxa_allocate_exception( %d ) triggered.", thrown_size);
+
+    size_t real_size = align_exception_allocation_size(thrown_size + sizeof(__cxa_exception), alignof(__cxa_exception));
+
+    __cxa_exception *header = (__cxa_exception *)kmalloc(real_size);
+    if (!header)
+    {
+        error("Failed to allocate exception.");
+        return nullptr;
+    }
+
+    header->referenceCount = 1;
+    header->exceptionType = nullptr;
+    header->exceptionDestructor = nullptr;
+    header->unexpectedHandler = {.unexpected = unexpected_header_stub};
+    header->terminateHandler = {.handler = terminate_header_stub};
+    header->nextException = nullptr;
+    header->handlerCount = -1;
+    header->handlerSwitchValue = 0;
+    header->actionRecord = nullptr;
+    header->languageSpecificData = nullptr;
+    header->catchTemp = 0;
+    header->adjustedPtr = nullptr;
+
+    return header + 1;
+}
+
+extern "C" void _Unwind_RaiseException(_Unwind_Exception *exc)
+{
+    fixme("_Unwind_RaiseException( %p ) triggered.", exc);
+
+    __cxa_exception *header = ((__cxa_exception *)exc) - 1;
+    if (header->terminateHandler.handler)
+    {
+        debug("Calling terminate handler.");
+        header->terminateHandler.handler();
+    }
+    else
+    {
+        error("Unhandled exception.");
+        CPU::Stop();
+    }
+
+    CPU::Halt(true);
+}
+
+extern "C" void __cxa_throw(void *thrown_object, void *tinfo, void (*dest)(void *))
+{
+    fixme("__cxa_throw( %p %p %p ) triggered.", thrown_object, tinfo, dest);
+
+    __cxa_exception *header = ((__cxa_exception *)thrown_object) - 1;
+    header->exceptionType = (type_info *)tinfo;
+    header->exceptionDestructor = dest;
+
+    _Unwind_RaiseException(&header->unwindHeader);
+}
+
+extern "C" void __cxa_rethrow() { fixme("__cxa_rethrow() triggered."); }
+
+extern "C" void __cxa_pure_virtual() { fixme("__cxa_pure_virtual() triggered."); }
+
+extern "C" void __cxa_throw_bad_array_new_length() { fixme("__cxa_throw_bad_array_new_length() triggered."); }
+
+extern "C" void __cxa_free_exception(void *thrown_exception) { fixme("__cxa_free_exception( %p ) triggered.", thrown_exception); }
+
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 4)
+extern "C" void *__cxa_begin_catch(void *e) throw()
+#else
+extern "C" void *__cxa_begin_catch(void *e)
+#endif
+{
+    fixme("__cxa_begin_catch( %p ) triggered.", e);
+    return (void *)0;
+}
+
+extern "C" void __cxa_end_catch() { fixme("__cxa_end_catch() triggered."); }
+
+__extension__ typedef int __guard __attribute__((mode(__DI__)));
+
+extern "C" int __cxa_guard_acquire(__guard *g)
+{
+    fixme("__cxa_guard_acquire( %p ) triggered.", g);
+    return !*(char *)(g);
+}
+
+extern "C" void __cxa_guard_release(__guard *g)
+{
+    fixme("__cxa_guard_release( %p ) triggered.", g);
+    *(char *)g = 1;
+}
+
+extern "C" void __cxa_guard_abort(__guard *g) { fixme("__cxa_guard_abort( %p ) triggered.", g); }
+
+// vtable for __cxxabiv1::__class_type_info
+extern "C" void *_ZTVN10__cxxabiv117__class_type_infoE(void)
+{
+    fixme("_ZTVN10__cxxabiv117__class_type_infoE() triggered.");
+    return (void *)0;
+}
+
+// vtable for __cxxabiv1::__si_class_type_info
+extern "C" void *_ZTVN10__cxxabiv120__si_class_type_infoE(void)
+{
+    fixme("_ZTVN10__cxxabiv120__si_class_type_infoE() triggered.");
+    return (void *)0;
+}
+
+// typeinfo for int
+extern "C" void *_ZTIi(void)
+{
+    fixme("_ZTIi() triggered.");
+    return (void *)0;
+}
+
+// typeinfo for unsigned char*
+extern "C" void *_ZTIPh(void)
+{
+    fixme("_ZTIPh() triggered.");
+    return (void *)0;
+}
+
+// typeinfo for char const*
+extern "C" void *_ZTIPKc(void)
+{
+    fixme("_ZTIPKc() triggered.");
+    return (void *)0;
+}
diff --git a/Kernel/Library/dumper.cpp b/Kernel/Library/dumper.cpp
new file mode 100644
index 00000000..b2b0c62d
--- /dev/null
+++ b/Kernel/Library/dumper.cpp
@@ -0,0 +1,91 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include "dumper.hpp"
+
+#include <memory.hpp>
+#include <printf.h>
+#include <uart.hpp>
+#include <lock.hpp>
+#include <md5.h>
+
+NewLock(DumperLock);
+
+using namespace UniversalAsynchronousReceiverTransmitter;
+
+static inline void print_wrapper(char c, void *unused)
+{
+    UART(COM1).Write(c);
+    UNUSED(unused);
+}
+
+int vprintf_dumper(const char *format, va_list list) { return vfctprintf(print_wrapper, NULL, format, list); }
+
+void WriteRaw(const char *format, ...)
+{
+    va_list args;
+    va_start(args, format);
+    vprintf_dumper(format, args);
+    va_end(args);
+}
+
+void DumpData(const char *Description, void *Address, unsigned long Length)
+{
+    SmartLock(DumperLock);
+    WriteRaw("-------------------------------------------------------------------------\n");
+    unsigned char *AddressChar = (unsigned char *)Address;
+    unsigned char Buffer[17];
+    unsigned long Iterate;
+
+    if (Description != nullptr)
+        WriteRaw("%s:\n", Description);
+
+    for (Iterate = 0; Iterate < Length; Iterate++)
+    {
+        if ((Iterate % 16) == 0)
+        {
+            if (Iterate != 0)
+                WriteRaw("  %s\n", Buffer);
+            WriteRaw("  %04x ", Iterate);
+        }
+
+        WriteRaw(" %02x", AddressChar[Iterate]);
+
+        if ((AddressChar[Iterate] < 0x20) || (AddressChar[Iterate] > 0x7e))
+            Buffer[Iterate % 16] = '.';
+        else
+            Buffer[Iterate % 16] = AddressChar[Iterate];
+
+        Buffer[(Iterate % 16) + 1] = '\0';
+    }
+
+    while ((Iterate % 16) != 0)
+    {
+        WriteRaw("   ");
+        Iterate++;
+    }
+
+    WriteRaw("  %s\n", Buffer);
+    WriteRaw("-------------------------------------------------------------------------\n");
+    WriteRaw("Length: %ld bytes\n", Length);
+    uint8_t *result = md5File(AddressChar, Length);
+    WriteRaw("MD5: ");
+    for (int i = 0; i < 16; i++)
+        WriteRaw("%02x", result[i]);
+    kfree(result);
+    WriteRaw("\n-------------------------------------------------------------------------\n");
+}
diff --git a/Kernel/Library/errno.cpp b/Kernel/Library/errno.cpp
new file mode 100644
index 00000000..cc353061
--- /dev/null
+++ b/Kernel/Library/errno.cpp
@@ -0,0 +1,27 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <errno.h>
+
+#include <types.h>
+#include <debug.h>
+
+int *__errno_location(void)
+{
+    fixme("errno_location() is not implemented yet!");
+    return nullptr;
+}
diff --git a/Kernel/Library/liballoc_1_1.c b/Kernel/Library/liballoc_1_1.c
new file mode 100644
index 00000000..46fd60a5
--- /dev/null
+++ b/Kernel/Library/liballoc_1_1.c
@@ -0,0 +1,793 @@
+#include "liballoc_1_1.h"
+
+#pragma GCC diagnostic ignored "-Wconversion"
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+
+/**  Durand's Amazing Super Duper Memory functions.  */
+
+#define VERSION "1.1"
+#define ALIGNMENT 16ul // 4ul				///< This is the byte alignment that memory must be allocated on. IMPORTANT for GTK and other stuff.
+
+#define ALIGN_TYPE char					   /// unsigned char[16] /// unsigned short
+#define ALIGN_INFO sizeof(ALIGN_TYPE) * 16 ///< Alignment information is stored right before the pointer. This is the number of bytes of information stored there.
+
+#define USE_CASE1
+#define USE_CASE2
+#define USE_CASE3
+#define USE_CASE4
+#define USE_CASE5
+
+/** This macro will conveniently align our pointer upwards */
+#define ALIGN(ptr)                                       \
+	if (ALIGNMENT > 1)                                   \
+	{                                                    \
+		uintptr_t diff;                                  \
+		ptr = (void *)((uintptr_t)ptr + ALIGN_INFO);     \
+		diff = (uintptr_t)ptr & (ALIGNMENT - 1);         \
+		if (diff != 0)                                   \
+		{                                                \
+			diff = ALIGNMENT - diff;                     \
+			ptr = (void *)((uintptr_t)ptr + diff);       \
+		}                                                \
+		*((ALIGN_TYPE *)((uintptr_t)ptr - ALIGN_INFO)) = \
+			diff + ALIGN_INFO;                           \
+	}
+
+#define UNALIGN(ptr)                                                     \
+	if (ALIGNMENT > 1)                                                   \
+	{                                                                    \
+		uintptr_t diff = *((ALIGN_TYPE *)((uintptr_t)ptr - ALIGN_INFO)); \
+		if (diff < (ALIGNMENT + ALIGN_INFO))                             \
+		{                                                                \
+			ptr = (void *)((uintptr_t)ptr - diff);                       \
+		}                                                                \
+	}
+
+#define LIBALLOC_MAGIC 0xc001c0de
+#define LIBALLOC_DEAD 0xdeaddead
+
+// #define LIBALLOCDEBUG 1
+#define LIBALLOCINFO 1
+
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+// #include <stdio.h>
+// #include <stdlib.h>
+#include <debug.h>
+
+// #define FLUSH() fflush(stdout)
+#define FLUSH()
+#define atexit(x)
+#define printf(m, ...) trace(m, ##__VA_ARGS__)
+
+#endif
+
+/** A structure found at the top of all system allocated
+ * memory blocks. It details the usage of the memory block.
+ */
+struct liballoc_major
+{
+	struct liballoc_major *prev;  ///< Linked list information.
+	struct liballoc_major *next;  ///< Linked list information.
+	unsigned int pages;			  ///< The number of pages in the block.
+	unsigned int size;			  ///< The number of pages in the block.
+	unsigned int usage;			  ///< The number of bytes used in the block.
+	struct liballoc_minor *first; ///< A pointer to the first allocated memory in the block.
+};
+
+/** This is a structure found at the beginning of all
+ * sections in a major block which were allocated by a
+ * malloc, calloc, realloc call.
+ */
+struct liballoc_minor
+{
+	struct liballoc_minor *prev;  ///< Linked list information.
+	struct liballoc_minor *next;  ///< Linked list information.
+	struct liballoc_major *block; ///< The owning block. A pointer to the major structure.
+	unsigned int magic;			  ///< A magic number to idenfity correctness.
+	unsigned int size;			  ///< The size of the memory allocated. Could be 1 byte or more.
+	unsigned int req_size;		  ///< The size of memory requested.
+};
+
+static struct liballoc_major *l_memRoot = NULL; ///< The root memory block acquired from the system.
+static struct liballoc_major *l_bestBet = NULL; ///< The major with the most free memory.
+
+static unsigned int l_pageSize = 4096;	   ///< The size of an individual page. Set up in liballoc_init.
+static unsigned int l_pageCount = 16;	   ///< The number of pages to request per chunk. Set up in liballoc_init.
+static unsigned long long l_allocated = 0; ///< Running total of allocated memory.
+static unsigned long long l_inuse = 0;	   ///< Running total of used memory.
+
+static long long l_warningCount = 0;	 ///< Number of warnings encountered
+static long long l_errorCount = 0;		 ///< Number of actual errors
+static long long l_possibleOverruns = 0; ///< Number of possible overruns
+
+// ***********   HELPER FUNCTIONS  *******************************
+
+static void *liballoc_memset(void *s, int c, size_t n)
+{
+	unsigned int i;
+	for (i = 0; i < n; i++)
+		((char *)s)[i] = c;
+
+	return s;
+}
+static void *liballoc_memcpy(void *s1, const void *s2, size_t n)
+{
+	char *cdest;
+	char *csrc;
+	unsigned int *ldest = (unsigned int *)s1;
+	unsigned int *lsrc = (unsigned int *)s2;
+
+	while (n >= sizeof(unsigned int))
+	{
+		*ldest++ = *lsrc++;
+		n -= sizeof(unsigned int);
+	}
+
+	cdest = (char *)ldest;
+	csrc = (char *)lsrc;
+
+	while (n > 0)
+	{
+		*cdest++ = *csrc++;
+		n -= 1;
+	}
+
+	return s1;
+}
+
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+static void liballoc_dump()
+{
+#ifdef LIBALLOCDEBUG
+	struct liballoc_major *maj = l_memRoot;
+	struct liballoc_minor *min = NULL;
+#endif
+
+	printf("liballoc: ------ Memory data ---------------\n");
+	printf("liballoc: System memory allocated: %i bytes\n", l_allocated);
+	printf("liballoc: Memory in used (malloc'ed): %i bytes\n", l_inuse);
+	printf("liballoc: Warning count: %i\n", l_warningCount);
+	printf("liballoc: Error count: %i\n", l_errorCount);
+	printf("liballoc: Possible overruns: %i\n", l_possibleOverruns);
+
+#ifdef LIBALLOCDEBUG
+	while (maj != NULL)
+	{
+		printf("liballoc: %lx: total = %i, used = %i\n",
+			   maj,
+			   maj->size,
+			   maj->usage);
+
+		min = maj->first;
+		while (min != NULL)
+		{
+			printf("liballoc:    %lx: %i bytes\n",
+				   min,
+				   min->size);
+			min = min->next;
+		}
+
+		maj = maj->next;
+	}
+#endif
+
+	FLUSH();
+}
+#endif
+
+// ***************************************************************
+
+static struct liballoc_major *allocate_new_page(unsigned int size)
+{
+	unsigned int st;
+	struct liballoc_major *maj;
+
+	// This is how much space is required.
+	st = size + sizeof(struct liballoc_major);
+	st += sizeof(struct liballoc_minor);
+
+	// Perfect amount of space?
+	if ((st % l_pageSize) == 0)
+		st = st / (l_pageSize);
+	else
+		st = st / (l_pageSize) + 1;
+	// No, add the buffer.
+
+	// Make sure it's >= the minimum size.
+	if (st < l_pageCount)
+		st = l_pageCount;
+
+	maj = (struct liballoc_major *)liballoc_alloc(st);
+
+	if (maj == NULL)
+	{
+		l_warningCount += 1;
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+		printf("liballoc: WARNING: liballoc_alloc( %i ) return NULL\n", st);
+		FLUSH();
+#endif
+		return NULL; // uh oh, we ran out of memory.
+	}
+
+	maj->prev = NULL;
+	maj->next = NULL;
+	maj->pages = st;
+	maj->size = st * l_pageSize;
+	maj->usage = sizeof(struct liballoc_major);
+	maj->first = NULL;
+
+	l_allocated += maj->size;
+
+#ifdef LIBALLOCDEBUG
+	printf("liballoc: Resource allocated %lx of %i pages (%i bytes) for %i size.\n", maj, st, maj->size, size);
+
+	printf("liballoc: Total memory usage = %i KB\n", (int)((l_allocated / (1024))));
+	FLUSH();
+#endif
+
+	return maj;
+}
+
+void *PREFIX(malloc)(size_t req_size)
+{
+	int startedBet = 0;
+	unsigned long long bestSize = 0;
+	void *p = NULL;
+	uintptr_t diff;
+	struct liballoc_major *maj;
+	struct liballoc_minor *min;
+	struct liballoc_minor *new_min;
+	unsigned long size = req_size;
+
+	// For alignment, we adjust size so there's enough space to align.
+	if (ALIGNMENT > 1)
+	{
+		size += ALIGNMENT + ALIGN_INFO;
+	}
+	// So, ideally, we really want an alignment of 0 or 1 in order
+	// to save space.
+
+	liballoc_lock();
+
+	if (size == 0)
+	{
+		l_warningCount += 1;
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+		printf("liballoc: WARNING: alloc( 0 ) called from %lx\n",
+			   __builtin_return_address(0));
+		FLUSH();
+#endif
+		liballoc_unlock();
+		return PREFIX(malloc)(1);
+	}
+
+	if (l_memRoot == NULL)
+	{
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+#ifdef LIBALLOCDEBUG
+		printf("liballoc: initialization of liballoc " VERSION "\n");
+#endif
+		atexit(liballoc_dump);
+		FLUSH();
+#endif
+
+		// This is the first time we are being used.
+		l_memRoot = allocate_new_page(size);
+		if (l_memRoot == NULL)
+		{
+			liballoc_unlock();
+#ifdef LIBALLOCDEBUG
+			printf("liballoc: initial l_memRoot initialization failed\n", p);
+			FLUSH();
+#endif
+			return NULL;
+		}
+
+#ifdef LIBALLOCDEBUG
+		printf("liballoc: set up first memory major %lx\n", l_memRoot);
+		FLUSH();
+#endif
+	}
+
+#ifdef LIBALLOCDEBUG
+	printf("liballoc: %lx PREFIX(malloc)( %i ): ",
+		   __builtin_return_address(0),
+		   size);
+	FLUSH();
+#endif
+
+	// Now we need to bounce through every major and find enough space....
+
+	maj = l_memRoot;
+	startedBet = 0;
+
+	// Start at the best bet....
+	if (l_bestBet != NULL)
+	{
+		bestSize = l_bestBet->size - l_bestBet->usage;
+
+		if (bestSize > (size + sizeof(struct liballoc_minor)))
+		{
+			maj = l_bestBet;
+			startedBet = 1;
+		}
+	}
+
+	while (maj != NULL)
+	{
+		diff = maj->size - maj->usage;
+		// free memory in the block
+
+		if (bestSize < diff)
+		{
+			// Hmm.. this one has more memory then our bestBet. Remember!
+			l_bestBet = maj;
+			bestSize = diff;
+		}
+
+#ifdef USE_CASE1
+
+		// CASE 1:  There is not enough space in this major block.
+		if (diff < (size + sizeof(struct liballoc_minor)))
+		{
+#ifdef LIBALLOCDEBUG
+			printf("CASE 1: Insufficient space in block %lx\n", maj);
+			FLUSH();
+#endif
+
+			// Another major block next to this one?
+			if (maj->next != NULL)
+			{
+				maj = maj->next; // Hop to that one.
+				continue;
+			}
+
+			if (startedBet == 1) // If we started at the best bet,
+			{					 // let's start all over again.
+				maj = l_memRoot;
+				startedBet = 0;
+				continue;
+			}
+
+			// Create a new major block next to this one and...
+			maj->next = allocate_new_page(size); // next one will be okay.
+			if (maj->next == NULL)
+				break; // no more memory.
+			maj->next->prev = maj;
+			maj = maj->next;
+
+			// .. fall through to CASE 2 ..
+		}
+
+#endif
+
+#ifdef USE_CASE2
+
+		// CASE 2: It's a brand new block.
+		if (maj->first == NULL)
+		{
+			maj->first = (struct liballoc_minor *)((uintptr_t)maj + sizeof(struct liballoc_major));
+
+			maj->first->magic = LIBALLOC_MAGIC;
+			maj->first->prev = NULL;
+			maj->first->next = NULL;
+			maj->first->block = maj;
+			maj->first->size = size;
+			maj->first->req_size = req_size;
+			maj->usage += size + sizeof(struct liballoc_minor);
+
+			l_inuse += size;
+
+			p = (void *)((uintptr_t)(maj->first) + sizeof(struct liballoc_minor));
+
+			ALIGN(p);
+
+#ifdef LIBALLOCDEBUG
+			printf("CASE 2: returning %lx\n", p);
+			FLUSH();
+#endif
+			liballoc_unlock(); // release the lock
+			return p;
+		}
+
+#endif
+
+#ifdef USE_CASE3
+
+		// CASE 3: Block in use and enough space at the start of the block.
+		diff = (uintptr_t)(maj->first);
+		diff -= (uintptr_t)maj;
+		diff -= sizeof(struct liballoc_major);
+
+		if (diff >= (size + sizeof(struct liballoc_minor)))
+		{
+			// Yes, space in front. Squeeze in.
+			maj->first->prev = (struct liballoc_minor *)((uintptr_t)maj + sizeof(struct liballoc_major));
+			maj->first->prev->next = maj->first;
+			maj->first = maj->first->prev;
+
+			maj->first->magic = LIBALLOC_MAGIC;
+			maj->first->prev = NULL;
+			maj->first->block = maj;
+			maj->first->size = size;
+			maj->first->req_size = req_size;
+			maj->usage += size + sizeof(struct liballoc_minor);
+
+			l_inuse += size;
+
+			p = (void *)((uintptr_t)(maj->first) + sizeof(struct liballoc_minor));
+			ALIGN(p);
+
+#ifdef LIBALLOCDEBUG
+			printf("CASE 3: returning %lx\n", p);
+			FLUSH();
+#endif
+			liballoc_unlock(); // release the lock
+			return p;
+		}
+
+#endif
+
+#ifdef USE_CASE4
+
+		// CASE 4: There is enough space in this block. But is it contiguous?
+		min = maj->first;
+
+		// Looping within the block now...
+		while (min != NULL)
+		{
+			// CASE 4.1: End of minors in a block. Space from last and end?
+			if (min->next == NULL)
+			{
+				// the rest of this block is free...  is it big enough?
+				diff = (uintptr_t)(maj) + maj->size;
+				diff -= (uintptr_t)min;
+				diff -= sizeof(struct liballoc_minor);
+				diff -= min->size;
+				// minus already existing usage..
+
+				if (diff >= (size + sizeof(struct liballoc_minor)))
+				{
+					// yay....
+					min->next = (struct liballoc_minor *)((uintptr_t)min + sizeof(struct liballoc_minor) + min->size);
+					min->next->prev = min;
+					min = min->next;
+					min->next = NULL;
+					min->magic = LIBALLOC_MAGIC;
+					min->block = maj;
+					min->size = size;
+					min->req_size = req_size;
+					maj->usage += size + sizeof(struct liballoc_minor);
+
+					l_inuse += size;
+
+					p = (void *)((uintptr_t)min + sizeof(struct liballoc_minor));
+					ALIGN(p);
+
+#ifdef LIBALLOCDEBUG
+					printf("CASE 4.1: returning %lx\n", p);
+					FLUSH();
+#endif
+					liballoc_unlock(); // release the lock
+					return p;
+				}
+			}
+
+			// CASE 4.2: Is there space between two minors?
+			if (min->next != NULL)
+			{
+				// is the difference between here and next big enough?
+				diff = (uintptr_t)(min->next);
+				diff -= (uintptr_t)min;
+				diff -= sizeof(struct liballoc_minor);
+				diff -= min->size;
+				// minus our existing usage.
+
+				if (diff >= (size + sizeof(struct liballoc_minor)))
+				{
+					// yay......
+					new_min = (struct liballoc_minor *)((uintptr_t)min + sizeof(struct liballoc_minor) + min->size);
+
+					new_min->magic = LIBALLOC_MAGIC;
+					new_min->next = min->next;
+					new_min->prev = min;
+					new_min->size = size;
+					new_min->req_size = req_size;
+					new_min->block = maj;
+					min->next->prev = new_min;
+					min->next = new_min;
+					maj->usage += size + sizeof(struct liballoc_minor);
+
+					l_inuse += size;
+
+					p = (void *)((uintptr_t)new_min + sizeof(struct liballoc_minor));
+					ALIGN(p);
+
+#ifdef LIBALLOCDEBUG
+					printf("CASE 4.2: returning %lx\n", p);
+					FLUSH();
+#endif
+
+					liballoc_unlock(); // release the lock
+					return p;
+				}
+			} // min->next != NULL
+
+			min = min->next;
+		} // while min != NULL ...
+
+#endif
+
+#ifdef USE_CASE5
+
+		// CASE 5: Block full! Ensure next block and loop.
+		if (maj->next == NULL)
+		{
+#ifdef LIBALLOCDEBUG
+			printf("CASE 5: block full\n");
+			FLUSH();
+#endif
+
+			if (startedBet == 1)
+			{
+				maj = l_memRoot;
+				startedBet = 0;
+				continue;
+			}
+
+			// we've run out. we need more...
+			maj->next = allocate_new_page(size); // next one guaranteed to be okay
+			if (maj->next == NULL)
+				break; //  uh oh,  no more memory.....
+			maj->next->prev = maj;
+		}
+
+#endif
+
+		maj = maj->next;
+	} // while (maj != NULL)
+
+	liballoc_unlock(); // release the lock
+
+#ifdef LIBALLOCDEBUG
+	printf("All cases exhausted. No memory available.\n");
+	FLUSH();
+#endif
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+	printf("liballoc: WARNING: PREFIX(malloc)( %i ) returning NULL.\n", size);
+	liballoc_dump();
+	FLUSH();
+#endif
+	return NULL;
+}
+
+void PREFIX(free)(void *ptr)
+{
+	struct liballoc_minor *min;
+	struct liballoc_major *maj;
+
+	if (ptr == NULL)
+	{
+		l_warningCount += 1;
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+		printf("liballoc: WARNING: PREFIX(free)( NULL ) called from %lx\n",
+			   __builtin_return_address(0));
+		FLUSH();
+#endif
+		return;
+	}
+
+	UNALIGN(ptr);
+
+	liballoc_lock(); // lockit
+
+	min = (struct liballoc_minor *)((uintptr_t)ptr - sizeof(struct liballoc_minor));
+
+	if (min->magic != LIBALLOC_MAGIC)
+	{
+		l_errorCount += 1;
+
+		// Check for overrun errors. For all bytes of LIBALLOC_MAGIC
+		if (
+			((min->magic & 0xFFFFFF) == (LIBALLOC_MAGIC & 0xFFFFFF)) ||
+			((min->magic & 0xFFFF) == (LIBALLOC_MAGIC & 0xFFFF)) ||
+			((min->magic & 0xFF) == (LIBALLOC_MAGIC & 0xFF)))
+		{
+			l_possibleOverruns += 1;
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+			printf("liballoc: ERROR: Possible 1-3 byte overrun for magic %lx != %lx\n",
+				   min->magic,
+				   LIBALLOC_MAGIC);
+			FLUSH();
+#endif
+		}
+
+		if (min->magic == LIBALLOC_DEAD)
+		{
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+			printf("liballoc: ERROR: multiple PREFIX(free)() attempt on %lx from %lx.\n",
+				   ptr,
+				   __builtin_return_address(0));
+			FLUSH();
+#endif
+		}
+		else
+		{
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+			printf("liballoc: ERROR: Bad PREFIX(free)( %lx ) called from %lx\n",
+				   ptr,
+				   __builtin_return_address(0));
+			FLUSH();
+#endif
+		}
+
+		// being lied to...
+		liballoc_unlock(); // release the lock
+		return;
+	}
+
+#ifdef LIBALLOCDEBUG
+	printf("liballoc: %lx PREFIX(free)( %lx ): ",
+		   __builtin_return_address(0),
+		   ptr);
+	FLUSH();
+#endif
+
+	maj = min->block;
+
+	l_inuse -= min->size;
+
+	maj->usage -= (min->size + sizeof(struct liballoc_minor));
+	min->magic = LIBALLOC_DEAD; // No mojo.
+
+	if (min->next != NULL)
+		min->next->prev = min->prev;
+	if (min->prev != NULL)
+		min->prev->next = min->next;
+
+	if (min->prev == NULL)
+		maj->first = min->next;
+	// Might empty the block. This was the first
+	// minor.
+
+	// We need to clean up after the majors now....
+
+	if (maj->first == NULL) // Block completely unused.
+	{
+		if (l_memRoot == maj)
+			l_memRoot = maj->next;
+		if (l_bestBet == maj)
+			l_bestBet = NULL;
+		if (maj->prev != NULL)
+			maj->prev->next = maj->next;
+		if (maj->next != NULL)
+			maj->next->prev = maj->prev;
+		l_allocated -= maj->size;
+
+		liballoc_free(maj, maj->pages);
+	}
+	else
+	{
+		if (l_bestBet != NULL)
+		{
+			int bestSize = l_bestBet->size - l_bestBet->usage;
+			int majSize = maj->size - maj->usage;
+
+			if (majSize > bestSize)
+				l_bestBet = maj;
+		}
+	}
+
+#ifdef LIBALLOCDEBUG
+	printf("OK\n");
+	FLUSH();
+#endif
+
+	liballoc_unlock(); // release the lock
+}
+
+void *PREFIX(calloc)(size_t nobj, size_t size)
+{
+	int real_size;
+	void *p;
+
+	real_size = nobj * size;
+
+	p = PREFIX(malloc)(real_size);
+
+	liballoc_memset(p, 0, real_size);
+
+	return p;
+}
+
+void *PREFIX(realloc)(void *p, size_t size)
+{
+	void *ptr;
+	struct liballoc_minor *min;
+	unsigned int real_size;
+
+	// Honour the case of size == 0 => free old and return NULL
+	if (size == 0)
+	{
+		PREFIX(free)
+		(p);
+		return NULL;
+	}
+
+	// In the case of a NULL pointer, return a simple malloc.
+	if (p == NULL)
+		return PREFIX(malloc)(size);
+
+	// Unalign the pointer if required.
+	ptr = p;
+	UNALIGN(ptr);
+
+	liballoc_lock(); // lockit
+
+	min = (struct liballoc_minor *)((uintptr_t)ptr - sizeof(struct liballoc_minor));
+
+	// Ensure it is a valid structure.
+	if (min->magic != LIBALLOC_MAGIC)
+	{
+		l_errorCount += 1;
+
+		// Check for overrun errors. For all bytes of LIBALLOC_MAGIC
+		if (
+			((min->magic & 0xFFFFFF) == (LIBALLOC_MAGIC & 0xFFFFFF)) ||
+			((min->magic & 0xFFFF) == (LIBALLOC_MAGIC & 0xFFFF)) ||
+			((min->magic & 0xFF) == (LIBALLOC_MAGIC & 0xFF)))
+		{
+			l_possibleOverruns += 1;
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+			printf("liballoc: ERROR: Possible 1-3 byte overrun for magic %lx != %lx\n",
+				   min->magic,
+				   LIBALLOC_MAGIC);
+			FLUSH();
+#endif
+		}
+
+		if (min->magic == LIBALLOC_DEAD)
+		{
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+			printf("liballoc: ERROR: multiple PREFIX(free)() attempt on %lx from %lx.\n",
+				   ptr,
+				   __builtin_return_address(0));
+			FLUSH();
+#endif
+		}
+		else
+		{
+#if defined LIBALLOCDEBUG || defined LIBALLOCINFO
+			printf("liballoc: ERROR: Bad PREFIX(free)( %lx ) called from %lx\n",
+				   ptr,
+				   __builtin_return_address(0));
+			FLUSH();
+#endif
+		}
+
+		// being lied to...
+		liballoc_unlock(); // release the lock
+		return NULL;
+	}
+
+	// Definitely a memory block.
+
+	real_size = min->req_size;
+
+	if (real_size >= size)
+	{
+		min->req_size = size;
+		liballoc_unlock();
+		return p;
+	}
+
+	liballoc_unlock();
+
+	// If we got here then we're reallocating to a block bigger than us.
+	ptr = PREFIX(malloc)(size); // We need to allocate new memory
+	liballoc_memcpy(ptr, p, real_size);
+	PREFIX(free)
+	(p);
+
+	return ptr;
+}
diff --git a/Kernel/Library/liballoc_1_1.h b/Kernel/Library/liballoc_1_1.h
new file mode 100644
index 00000000..3f3e7e5d
--- /dev/null
+++ b/Kernel/Library/liballoc_1_1.h
@@ -0,0 +1,74 @@
+#ifndef _LIBALLOC_H
+#define _LIBALLOC_H
+
+#include <types.h>
+
+/** \defgroup ALLOCHOOKS liballoc hooks
+ *
+ * These are the OS specific functions which need to
+ * be implemented on any platform that the library
+ * is expected to work on.
+ */
+
+/** @{ */
+
+// If we are told to not define our own size_t, then we skip the define.
+// #define _HAVE_UINTPTR_T
+// typedef	unsigned long	uintptr_t;
+
+// This lets you prefix malloc and friends
+#define PREFIX(func) kliballoc_##func
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+    /** This function is supposed to lock the memory data structures. It
+     * could be as simple as disabling interrupts or acquiring a spinlock.
+     * It's up to you to decide.
+     *
+     * \return 0 if the lock was acquired successfully. Anything else is
+     * failure.
+     */
+    extern int liballoc_lock();
+
+    /** This function unlocks what was previously locked by the liballoc_lock
+     * function.  If it disabled interrupts, it enables interrupts. If it
+     * had acquiried a spinlock, it releases the spinlock. etc.
+     *
+     * \return 0 if the lock was successfully released.
+     */
+    extern int liballoc_unlock();
+
+    /** This is the hook into the local system which allocates pages. It
+     * accepts an integer parameter which is the number of pages
+     * required.  The page size was set up in the liballoc_init function.
+     *
+     * \return NULL if the pages were not allocated.
+     * \return A pointer to the allocated memory.
+     */
+    extern void *liballoc_alloc(size_t);
+
+    /** This frees previously allocated memory. The void* parameter passed
+     * to the function is the exact same value returned from a previous
+     * liballoc_alloc call.
+     *
+     * The integer value is the number of pages to free.
+     *
+     * \return 0 if the memory was successfully freed.
+     */
+    extern int liballoc_free(void *, size_t);
+
+    extern void *PREFIX(malloc)(size_t);          ///< The standard function.
+    extern void *PREFIX(realloc)(void *, size_t); ///< The standard function.
+    extern void *PREFIX(calloc)(size_t, size_t);  ///< The standard function.
+    extern void PREFIX(free)(void *);             ///< The standard function.
+
+#ifdef __cplusplus
+}
+#endif
+
+/** @} */
+
+#endif
diff --git a/Kernel/Library/liballocimpl.cpp b/Kernel/Library/liballocimpl.cpp
new file mode 100644
index 00000000..7080190d
--- /dev/null
+++ b/Kernel/Library/liballocimpl.cpp
@@ -0,0 +1,14 @@
+#include <types.h>
+#include <lock.hpp>
+#include <memory.hpp>
+
+NewLock(liballocLock);
+
+EXTERNC int liballoc_lock() { return liballocLock.Lock(__FUNCTION__); }
+EXTERNC int liballoc_unlock() { return liballocLock.Unlock(); }
+EXTERNC void *liballoc_alloc(size_t Pages) { return KernelAllocator.RequestPages(Pages); }
+EXTERNC int liballoc_free(void *Address, size_t Pages)
+{
+    KernelAllocator.FreePages(Address, Pages);
+    return 0;
+}
diff --git a/Kernel/Library/md5.c b/Kernel/Library/md5.c
new file mode 100644
index 00000000..dd8e4da0
--- /dev/null
+++ b/Kernel/Library/md5.c
@@ -0,0 +1,257 @@
+/*
+ * Derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm
+ * and modified slightly to be functionally identical but condensed into control structures.
+ */
+
+#include <md5.h>
+
+#include <memory.hpp>
+#include <convert.h>
+
+/*
+ * Constants defined by the MD5 algorithm
+ */
+#define A 0x67452301
+#define B 0xefcdab89
+#define C 0x98badcfe
+#define D 0x10325476
+
+static uint32_t S[] = {7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
+                       5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
+                       4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
+                       6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21};
+
+static uint32_t K[] = {0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
+                       0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
+                       0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
+                       0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
+                       0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
+                       0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
+                       0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
+                       0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
+                       0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
+                       0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
+                       0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
+                       0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
+                       0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
+                       0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
+                       0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
+                       0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391};
+
+/*
+ * Bit-manipulation functions defined by the MD5 algorithm
+ */
+#define F(X, Y, Z) ((X & Y) | (~X & Z))
+#define G(X, Y, Z) ((X & Z) | (Y & ~Z))
+#define H(X, Y, Z) (X ^ Y ^ Z)
+#define I(X, Y, Z) (Y ^ (X | ~Z))
+
+/*
+ * Padding used to make the size (in bits) of the input congruent to 448 mod 512
+ */
+static uint8_t PADDING[] = {0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
+
+/*
+ * Initialize a context
+ */
+void md5Init(MD5Context *ctx)
+{
+    ctx->size = (uint64_t)0;
+
+    ctx->buffer[0] = (uint32_t)A;
+    ctx->buffer[1] = (uint32_t)B;
+    ctx->buffer[2] = (uint32_t)C;
+    ctx->buffer[3] = (uint32_t)D;
+}
+
+/*
+ * Add some amount of input to the context
+ *
+ * If the input fills out a block of 512 bits, apply the algorithm (md5Step)
+ * and save the result in the buffer. Also updates the overall size.
+ */
+void md5Update(MD5Context *ctx, uint8_t *input_buffer, size_t input_len)
+{
+    uint32_t input[16];
+    unsigned int offset = ctx->size % 64;
+    ctx->size += (uint64_t)input_len;
+
+    // Copy each byte in input_buffer into the next space in our context input
+    for (unsigned int i = 0; i < input_len; ++i)
+    {
+        ctx->input[offset++] = (uint8_t) * (input_buffer + i);
+
+        // If we've filled our context input, copy it into our local array input
+        // then reset the offset to 0 and fill in a new buffer.
+        // Every time we fill out a chunk, we run it through the algorithm
+        // to enable some back and forth between cpu and i/o
+        if (offset % 64 == 0)
+        {
+            for (unsigned int j = 0; j < 16; ++j)
+            {
+                // Convert to little-endian
+                // The local variable `input` our 512-bit chunk separated into 32-bit words
+                // we can use in calculations
+                input[j] = (uint32_t)(ctx->input[(j * 4) + 3]) << 24 |
+                           (uint32_t)(ctx->input[(j * 4) + 2]) << 16 |
+                           (uint32_t)(ctx->input[(j * 4) + 1]) << 8 |
+                           (uint32_t)(ctx->input[(j * 4)]);
+            }
+            md5Step(ctx->buffer, input);
+            offset = 0;
+        }
+    }
+}
+
+/*
+ * Pad the current input to get to 448 bytes, append the size in bits to the very end,
+ * and save the result of the final iteration into digest.
+ */
+void md5Finalize(MD5Context *ctx)
+{
+    uint32_t input[16];
+    unsigned int offset = ctx->size % 64;
+    unsigned int padding_length = offset < 56 ? 56 - offset : (56 + 64) - offset;
+
+    // Fill in the padding and do the changes to size that resulted from the update
+    md5Update(ctx, PADDING, padding_length);
+    ctx->size -= (uint64_t)padding_length;
+
+    // Do a final update (internal to this function)
+    // Last two 32-bit words are the two halves of the size (converted from bytes to bits)
+    for (unsigned int j = 0; j < 14; ++j)
+    {
+        input[j] = (uint32_t)(ctx->input[(j * 4) + 3]) << 24 |
+                   (uint32_t)(ctx->input[(j * 4) + 2]) << 16 |
+                   (uint32_t)(ctx->input[(j * 4) + 1]) << 8 |
+                   (uint32_t)(ctx->input[(j * 4)]);
+    }
+    input[14] = (uint32_t)(ctx->size * 8);
+#ifdef a32
+    input[15] = (uint32_t)((ctx->size >> 32) | (ctx->size << 32)) >> 32;
+#else
+    input[15] = (uint32_t)((ctx->size * 8) >> 32);
+#endif
+
+    md5Step(ctx->buffer, input);
+
+    // Move the result into digest (convert from little-endian)
+    for (unsigned int i = 0; i < 4; ++i)
+    {
+        ctx->digest[(i * 4) + 0] = (uint8_t)((ctx->buffer[i] & 0x000000FF));
+        ctx->digest[(i * 4) + 1] = (uint8_t)((ctx->buffer[i] & 0x0000FF00) >> 8);
+        ctx->digest[(i * 4) + 2] = (uint8_t)((ctx->buffer[i] & 0x00FF0000) >> 16);
+        ctx->digest[(i * 4) + 3] = (uint8_t)((ctx->buffer[i] & 0xFF000000) >> 24);
+    }
+}
+
+/*
+ * Step on 512 bits of input with the main MD5 algorithm.
+ */
+void md5Step(uint32_t *buffer, uint32_t *input)
+{
+    uint32_t AA = buffer[0];
+    uint32_t BB = buffer[1];
+    uint32_t CC = buffer[2];
+    uint32_t DD = buffer[3];
+
+    uint32_t E;
+
+    unsigned int j;
+
+    for (unsigned int i = 0; i < 64; ++i)
+    {
+        switch (i / 16)
+        {
+        case 0:
+            E = F(BB, CC, DD);
+            j = i;
+            break;
+        case 1:
+            E = G(BB, CC, DD);
+            j = ((i * 5) + 1) % 16;
+            break;
+        case 2:
+            E = H(BB, CC, DD);
+            j = ((i * 3) + 5) % 16;
+            break;
+        default:
+            E = I(BB, CC, DD);
+            j = (i * 7) % 16;
+            break;
+        }
+
+        uint32_t temp = DD;
+        DD = CC;
+        CC = BB;
+        BB = BB + rotateLeft(AA + E + K[i] + input[j], S[i]);
+        AA = temp;
+    }
+
+    buffer[0] += AA;
+    buffer[1] += BB;
+    buffer[2] += CC;
+    buffer[3] += DD;
+}
+
+/*
+ * Functions that will return a pointer to the hash of the provided input
+ */
+uint8_t *md5String(char *input)
+{
+    MD5Context ctx;
+    md5Init(&ctx);
+    md5Update(&ctx, (uint8_t *)input, strlen(input));
+    md5Finalize(&ctx);
+
+    uint8_t *result = kmalloc(16);
+    if (result == NULL)
+        return (uint8_t *)"error";
+    memcpy(result, ctx.digest, 16);
+    return result;
+}
+
+uint8_t *md5File(uint8_t *buffer, size_t input_len)
+{
+    char *input_buffer = (char *)buffer;
+    size_t input_size = input_len;
+
+    MD5Context ctx;
+    md5Init(&ctx);
+
+    while (input_size > 0)
+    {
+        size_t chunk_size = input_size > 1024 ? 1024 : input_size;
+        md5Update(&ctx, (uint8_t *)input_buffer, chunk_size);
+        input_buffer += chunk_size;
+        input_size -= chunk_size;
+    }
+
+    // while ((input_size = fread(input_buffer, 1, 1024, file)) > 0)
+    // {
+    //     md5Update(&ctx, (uint8_t *)input_buffer, input_size);
+    // }
+
+    md5Finalize(&ctx);
+
+    uint8_t *result = kmalloc(16);
+    if (result == NULL)
+        return (uint8_t *)"error";
+    memcpy(result, ctx.digest, 16);
+    return result;
+}
+
+/*
+ * Rotates a 32-bit word left by n bits
+ */
+uint32_t rotateLeft(uint32_t x, uint32_t n)
+{
+    return (x << n) | (x >> (32 - n));
+}
diff --git a/Kernel/Library/printf.c b/Kernel/Library/printf.c
new file mode 100644
index 00000000..7032a34d
--- /dev/null
+++ b/Kernel/Library/printf.c
@@ -0,0 +1,1592 @@
+/**
+ * @author (c) Eyal Rozenberg <eyalroz1@gmx.com>
+ *             2021-2022, Haifa, Palestine/Israel
+ * @author (c) Marco Paland (info@paland.com)
+ *             2014-2019, PALANDesign Hannover, Germany
+ *
+ * @note Others have made smaller contributions to this file: see the
+ * contributors page at https://github.com/eyalroz/printf/graphs/contributors
+ * or ask one of the authors. The original code for exponential specifiers was
+ * contributed by Martijn Jasperse <m.jasperse@gmail.com>.
+ *
+ * @brief Small stand-alone implementation of the printf family of functions
+ * (`(v)printf`, `(v)s(n)printf` etc., geared towards use on embedded systems with
+ * a very limited resources.
+ *
+ * @note the implementations are thread-safe; re-entrant; use no functions from
+ * the standard library; and do not dynamically allocate any memory.
+ *
+ * @license The MIT License (MIT)
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+
+// Define this globally (e.g. gcc -DPRINTF_INCLUDE_CONFIG_H=1 ...) to include the
+// printf_config.h header file
+#if PRINTF_INCLUDE_CONFIG_H
+#include "printf_config.h"
+#endif
+
+#include <printf.h>
+
+#ifdef __cplusplus
+#include <cstdint>
+#include <climits>
+#else
+#include <types.h>
+#include <limits.h>
+#endif // __cplusplus
+
+#if PRINTF_ALIAS_STANDARD_FUNCTION_NAMES
+#define printf printf
+#define sprintf sprintf
+#define vsprintf vsprintf
+#define snprintf_ snprintf
+#define vsnprintf vsnprintf
+#define vprintf vprintf
+#endif
+
+// 'ntoa' conversion buffer size, this must be big enough to hold one converted
+// numeric number including padded zeros (dynamically created on stack)
+#ifndef PRINTF_INTEGER_BUFFER_SIZE
+#define PRINTF_INTEGER_BUFFER_SIZE 32
+#endif
+
+// size of the fixed (on-stack) buffer for printing individual decimal numbers.
+// this must be big enough to hold one converted floating-point value including
+// padded zeros.
+#ifndef PRINTF_DECIMAL_BUFFER_SIZE
+#define PRINTF_DECIMAL_BUFFER_SIZE 32
+#endif
+
+// Support for the decimal notation floating point conversion specifiers (%f, %F)
+#ifndef PRINTF_SUPPORT_DECIMAL_SPECIFIERS
+#define PRINTF_SUPPORT_DECIMAL_SPECIFIERS 1
+#endif
+
+// Support for the exponential notation floating point conversion specifiers (%e, %g, %E, %G)
+#ifndef PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+#define PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS 1
+#endif
+
+// Support for the length write-back specifier (%n)
+#ifndef PRINTF_SUPPORT_WRITEBACK_SPECIFIER
+#define PRINTF_SUPPORT_WRITEBACK_SPECIFIER 1
+#endif
+
+// Default precision for the floating point conversion specifiers (the C standard sets this at 6)
+#ifndef PRINTF_DEFAULT_FLOAT_PRECISION
+#define PRINTF_DEFAULT_FLOAT_PRECISION 6
+#endif
+
+// According to the C languages standard, printf() and related functions must be able to print any
+// integral number in floating-point notation, regardless of length, when using the %f specifier -
+// possibly hundreds of characters, potentially overflowing your buffers. In this implementation,
+// all values beyond this threshold are switched to exponential notation.
+#ifndef PRINTF_MAX_INTEGRAL_DIGITS_FOR_DECIMAL
+#define PRINTF_MAX_INTEGRAL_DIGITS_FOR_DECIMAL 9
+#endif
+
+// Support for the long long integral types (with the ll, z and t length modifiers for specifiers
+// %d,%i,%o,%x,%X,%u, and with the %p specifier). Note: 'L' (long double) is not supported.
+#ifndef PRINTF_SUPPORT_LONG_LONG
+#define PRINTF_SUPPORT_LONG_LONG 1
+#endif
+
+// The number of terms in a Taylor series expansion of log_10(x) to
+// use for approximation - including the power-zero term (i.e. the
+// value at the point of expansion).
+#ifndef PRINTF_LOG10_TAYLOR_TERMS
+#define PRINTF_LOG10_TAYLOR_TERMS 4
+#endif
+
+#if PRINTF_LOG10_TAYLOR_TERMS <= 1
+#error "At least one non-constant Taylor expansion is necessary for the log10() calculation"
+#endif
+
+// Be extra-safe, and don't assume format specifiers are completed correctly
+// before the format string end.
+#ifndef PRINTF_CHECK_FOR_NUL_IN_FORMAT_SPECIFIER
+#define PRINTF_CHECK_FOR_NUL_IN_FORMAT_SPECIFIER 1
+#endif
+
+#define PRINTF_PREFER_DECIMAL false
+#define PRINTF_PREFER_EXPONENTIAL true
+
+///////////////////////////////////////////////////////////////////////////////
+
+// The following will convert the number-of-digits into an exponential-notation literal
+#define PRINTF_CONCATENATE(s1, s2) s1##s2
+#define PRINTF_EXPAND_THEN_CONCATENATE(s1, s2) PRINTF_CONCATENATE(s1, s2)
+#define PRINTF_FLOAT_NOTATION_THRESHOLD PRINTF_EXPAND_THEN_CONCATENATE(1e, PRINTF_MAX_INTEGRAL_DIGITS_FOR_DECIMAL)
+
+// internal flag definitions
+#define FLAGS_ZEROPAD (1U << 0U)
+#define FLAGS_LEFT (1U << 1U)
+#define FLAGS_PLUS (1U << 2U)
+#define FLAGS_SPACE (1U << 3U)
+#define FLAGS_HASH (1U << 4U)
+#define FLAGS_UPPERCASE (1U << 5U)
+#define FLAGS_CHAR (1U << 6U)
+#define FLAGS_SHORT (1U << 7U)
+#define FLAGS_INT (1U << 8U)
+// Only used with PRINTF_SUPPORT_MSVC_STYLE_INTEGER_SPECIFIERS
+#define FLAGS_LONG (1U << 9U)
+#define FLAGS_LONG_LONG (1U << 10U)
+#define FLAGS_PRECISION (1U << 11U)
+#define FLAGS_ADAPT_EXP (1U << 12U)
+#define FLAGS_POINTER (1U << 13U)
+// Note: Similar, but not identical, effect as FLAGS_HASH
+#define FLAGS_SIGNED (1U << 14U)
+// Only used with PRINTF_SUPPORT_MSVC_STYLE_INTEGER_SPECIFIERS
+
+#ifdef PRINTF_SUPPORT_MSVC_STYLE_INTEGER_SPECIFIERS
+
+#define FLAGS_INT8 FLAGS_CHAR
+
+#if (SHRT_MAX == 32767LL)
+#define FLAGS_INT16 FLAGS_SHORT
+#elif (INT_MAX == 32767LL)
+#define FLAGS_INT16 FLAGS_INT
+#elif (LONG_MAX == 32767LL)
+#define FLAGS_INT16 FLAGS_LONG
+#elif (LLONG_MAX == 32767LL)
+#define FLAGS_INT16 FLAGS_LONG_LONG
+#else
+#error "No basic integer type has a size of 16 bits exactly"
+#endif
+
+#if (SHRT_MAX == 2147483647LL)
+#define FLAGS_INT32 FLAGS_SHORT
+#elif (INT_MAX == 2147483647LL)
+#define FLAGS_INT32 FLAGS_INT
+#elif (LONG_MAX == 2147483647LL)
+#define FLAGS_INT32 FLAGS_LONG
+#elif (LLONG_MAX == 2147483647LL)
+#define FLAGS_INT32 FLAGS_LONG_LONG
+#else
+#error "No basic integer type has a size of 32 bits exactly"
+#endif
+
+#if (SHRT_MAX == 9223372036854775807LL)
+#define FLAGS_INT64 FLAGS_SHORT
+#elif (INT_MAX == 9223372036854775807LL)
+#define FLAGS_INT64 FLAGS_INT
+#elif (LONG_MAX == 9223372036854775807LL)
+#define FLAGS_INT64 FLAGS_LONG
+#elif (LLONG_MAX == 9223372036854775807LL)
+#define FLAGS_INT64 FLAGS_LONG_LONG
+#else
+#error "No basic integer type has a size of 64 bits exactly"
+#endif
+
+#endif // PRINTF_SUPPORT_MSVC_STYLE_INTEGER_SPECIFIERS
+
+typedef unsigned int printf_flags_t;
+
+#define BASE_BINARY 2
+#define BASE_OCTAL 8
+#define BASE_DECIMAL 10
+#define BASE_HEX 16
+
+typedef uint8_t numeric_base_t;
+
+#if PRINTF_SUPPORT_LONG_LONG
+typedef unsigned long long printf_unsigned_value_t;
+typedef long long printf_signed_value_t;
+#else
+typedef unsigned long printf_unsigned_value_t;
+typedef long printf_signed_value_t;
+#endif
+
+// The printf()-family functions return an `int`; it is therefore
+// unnecessary/inappropriate to use size_t - often larger than int
+// in practice - for non-negative related values, such as widths,
+// precisions, offsets into buffers used for printing and the sizes
+// of these buffers. instead, we use:
+typedef unsigned int printf_size_t;
+#define PRINTF_MAX_POSSIBLE_BUFFER_SIZE INT_MAX
+// If we were to nitpick, this would actually be INT_MAX + 1,
+// since INT_MAX is the maximum return value, which excludes the
+// trailing '\0'.
+
+#if (PRINTF_SUPPORT_DECIMAL_SPECIFIERS || PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS)
+#include <float.h>
+#if FLT_RADIX != 2
+#error "Non-binary-radix floating-point types are unsupported."
+#endif
+
+#if DBL_MANT_DIG == 24
+
+#define DOUBLE_SIZE_IN_BITS 32
+typedef uint32_t double_uint_t;
+#define DOUBLE_EXPONENT_MASK 0xFFU
+#define DOUBLE_BASE_EXPONENT 127
+#define DOUBLE_MAX_SUBNORMAL_EXPONENT_OF_10 -38
+#define DOUBLE_MAX_SUBNORMAL_POWER_OF_10 1e-38
+
+#elif DBL_MANT_DIG == 53
+
+#define DOUBLE_SIZE_IN_BITS 64
+typedef uint64_t double_uint_t;
+#define DOUBLE_EXPONENT_MASK 0x7FFU
+#define DOUBLE_BASE_EXPONENT 1023
+#define DOUBLE_MAX_SUBNORMAL_EXPONENT_OF_10 -308
+#define DOUBLE_MAX_SUBNORMAL_POWER_OF_10 1e-308
+
+#else
+#error "Unsupported double type configuration"
+#endif
+#define DOUBLE_STORED_MANTISSA_BITS (DBL_MANT_DIG - 1)
+
+typedef union
+{
+    double_uint_t U;
+    double F;
+} double_with_bit_access;
+
+// This is unnecessary in C99, since compound initializers can be used,
+// but:
+// 1. Some compilers are finicky about this;
+// 2. Some people may want to convert this to C89;
+// 3. If you try to use it as C++, only C++20 supports compound literals
+static inline NIF double_with_bit_access get_bit_access(double x)
+{
+    double_with_bit_access dwba;
+    dwba.F = x;
+    return dwba;
+}
+
+static inline NIF int get_sign_bit(double x)
+{
+    // The sign is stored in the highest bit
+    return (int)(get_bit_access(x).U >> (DOUBLE_SIZE_IN_BITS - 1));
+}
+
+static inline int get_exp2(double_with_bit_access x)
+{
+    // The exponent in an IEEE-754 floating-point number occupies a contiguous
+    // sequence of bits (e.g. 52..62 for 64-bit doubles), but with a non-trivial representation: An
+    // unsigned offset from some negative value (with the extremal offset values reserved for
+    // special use).
+    return (int)((x.U >> DOUBLE_STORED_MANTISSA_BITS) & DOUBLE_EXPONENT_MASK) - DOUBLE_BASE_EXPONENT;
+}
+#define PRINTF_ABS(_x) ((_x) > 0 ? (_x) : -(_x))
+
+#endif // (PRINTF_SUPPORT_DECIMAL_SPECIFIERS || PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS)
+
+// Note in particular the behavior here on LONG_MIN or LLONG_MIN; it is valid
+// and well-defined, but if you're not careful you can easily trigger undefined
+// behavior with -LONG_MIN or -LLONG_MIN
+#define ABS_FOR_PRINTING(_x) ((printf_unsigned_value_t)((_x) > 0 ? (_x) : -((printf_signed_value_t)_x)))
+
+// wrapper (used as buffer) for output function type
+//
+// One of the following must hold:
+// 1. max_chars is 0
+// 2. buffer is non-null
+// 3. function is non-null
+//
+// ... otherwise bad things will happen.
+typedef struct
+{
+    void (*function)(char c, void *extra_arg);
+    void *extra_function_arg;
+    char *buffer;
+    printf_size_t pos;
+    printf_size_t max_chars;
+} output_gadget_t;
+
+// Note: This function currently assumes it is not passed a '\0' c,
+// or alternatively, that '\0' can be passed to the function in the output
+// gadget. The former assumption holds within the printf library. It also
+// assumes that the output gadget has been properly initialized.
+static inline NIF void putchar_via_gadget(output_gadget_t *gadget, char c)
+{
+    printf_size_t write_pos = gadget->pos++;
+    // We're _always_ increasing pos, so as to count how may characters
+    // _would_ have been written if not for the max_chars limitation
+    if (write_pos >= gadget->max_chars)
+    {
+        return;
+    }
+    if (gadget->function != NULL)
+    {
+        // No check for c == '\0' .
+        gadget->function(c, gadget->extra_function_arg);
+    }
+    else
+    {
+        // it must be the case that gadget->buffer != NULL , due to the constraint
+        // on output_gadget_t ; and note we're relying on write_pos being non-negative.
+        gadget->buffer[write_pos] = c;
+    }
+}
+
+// Possibly-write the string-terminating '\0' character
+static inline NIF void append_termination_with_gadget(output_gadget_t *gadget)
+{
+    if (gadget->function != NULL || gadget->max_chars == 0)
+    {
+        return;
+    }
+    if (gadget->buffer == NULL)
+    {
+        return;
+    }
+    printf_size_t null_char_pos = gadget->pos < gadget->max_chars ? gadget->pos : gadget->max_chars - 1;
+    gadget->buffer[null_char_pos] = '\0';
+}
+
+extern void putchar(char c);
+
+// We can't use putchar_ as is, since our output gadget
+// only takes pointers to functions with an extra argument
+static inline NIF void putchar_wrapper(char c, void *unused)
+{
+    putchar(c);
+    UNUSED(unused);
+}
+
+static inline NIF output_gadget_t discarding_gadget(void)
+{
+    output_gadget_t gadget;
+    gadget.function = NULL;
+    gadget.extra_function_arg = NULL;
+    gadget.buffer = NULL;
+    gadget.pos = 0;
+    gadget.max_chars = 0;
+    return gadget;
+}
+
+static inline NIF output_gadget_t buffer_gadget(char *buffer, size_t buffer_size)
+{
+    printf_size_t usable_buffer_size = (buffer_size > PRINTF_MAX_POSSIBLE_BUFFER_SIZE) ? PRINTF_MAX_POSSIBLE_BUFFER_SIZE : (printf_size_t)buffer_size;
+    output_gadget_t result = discarding_gadget();
+    if (buffer != NULL)
+    {
+        result.buffer = buffer;
+        result.max_chars = usable_buffer_size;
+    }
+    return result;
+}
+
+static inline NIF output_gadget_t function_gadget(void (*function)(char, void *), void *extra_arg)
+{
+    output_gadget_t result = discarding_gadget();
+    result.function = function;
+    result.extra_function_arg = extra_arg;
+    result.max_chars = PRINTF_MAX_POSSIBLE_BUFFER_SIZE;
+    return result;
+}
+
+static inline NIF output_gadget_t extern_putchar_gadget(void)
+{
+    return function_gadget(putchar_wrapper, NULL);
+}
+
+// internal secure strlen
+// @return The length of the string (excluding the terminating 0) limited by 'maxsize'
+// @note strlen uses size_t, but wes only use this function with printf_size_t
+// variables - hence the signature.
+static inline NIF printf_size_t strnlen_s_(const char *str, printf_size_t maxsize)
+{
+    const char *s;
+    for (s = str; *s && maxsize--; ++s)
+        ;
+    return (printf_size_t)(s - str);
+}
+
+// internal test if char is a digit (0-9)
+// @return true if char is a digit
+static inline NIF bool is_digit_(char ch)
+{
+    return (ch >= '0') && (ch <= '9');
+}
+
+// internal ASCII string to printf_size_t conversion
+static NIF printf_size_t atou_(const char **str)
+{
+    printf_size_t i = 0U;
+    while (is_digit_(**str))
+    {
+        i = i * 10U + (printf_size_t)(*((*str)++) - '0');
+    }
+    return i;
+}
+
+// output the specified string in reverse, taking care of any zero-padding
+static NIF void out_rev_(output_gadget_t *output, const char *buf, printf_size_t len, printf_size_t width, printf_flags_t flags)
+{
+    const printf_size_t start_pos = output->pos;
+
+    // pad spaces up to given width
+    if (!(flags & FLAGS_LEFT) && !(flags & FLAGS_ZEROPAD))
+    {
+        for (printf_size_t i = len; i < width; i++)
+        {
+            putchar_via_gadget(output, ' ');
+        }
+    }
+
+    // reverse string
+    while (len)
+    {
+        putchar_via_gadget(output, buf[--len]);
+    }
+
+    // append pad spaces up to given width
+    if (flags & FLAGS_LEFT)
+    {
+        while (output->pos - start_pos < width)
+        {
+            putchar_via_gadget(output, ' ');
+        }
+    }
+}
+
+// Invoked by print_integer after the actual number has been printed, performing necessary
+// work on the number's prefix (as the number is initially printed in reverse order)
+static NIF void print_integer_finalization(output_gadget_t *output, char *buf, printf_size_t len, bool negative, numeric_base_t base, printf_size_t precision, printf_size_t width, printf_flags_t flags)
+{
+    printf_size_t unpadded_len = len;
+
+    // pad with leading zeros
+    {
+        if (!(flags & FLAGS_LEFT))
+        {
+            if (width && (flags & FLAGS_ZEROPAD) && (negative || (flags & (FLAGS_PLUS | FLAGS_SPACE))))
+            {
+                width--;
+            }
+            while ((flags & FLAGS_ZEROPAD) && (len < width) && (len < PRINTF_INTEGER_BUFFER_SIZE))
+            {
+                buf[len++] = '0';
+            }
+        }
+
+        while ((len < precision) && (len < PRINTF_INTEGER_BUFFER_SIZE))
+        {
+            buf[len++] = '0';
+        }
+
+        if (base == BASE_OCTAL && (len > unpadded_len))
+        {
+            // Since we've written some zeros, we've satisfied the alternative format leading space requirement
+            flags &= ~FLAGS_HASH;
+        }
+    }
+
+    // handle hash
+    if (flags & (FLAGS_HASH | FLAGS_POINTER))
+    {
+        if (!(flags & FLAGS_PRECISION) && len && ((len == precision) || (len == width)))
+        {
+            // Let's take back some padding digits to fit in what will eventually
+            // be the format-specific prefix
+            if (unpadded_len < len)
+            {
+                len--; // This should suffice for BASE_OCTAL
+            }
+            if (len && (base == BASE_HEX || base == BASE_BINARY) && (unpadded_len < len))
+            {
+                len--; // ... and an extra one for 0x or 0b
+            }
+        }
+        if ((base == BASE_HEX) && !(flags & FLAGS_UPPERCASE) && (len < PRINTF_INTEGER_BUFFER_SIZE))
+        {
+            buf[len++] = 'x';
+        }
+        else if ((base == BASE_HEX) && (flags & FLAGS_UPPERCASE) && (len < PRINTF_INTEGER_BUFFER_SIZE))
+        {
+            buf[len++] = 'X';
+        }
+        else if ((base == BASE_BINARY) && (len < PRINTF_INTEGER_BUFFER_SIZE))
+        {
+            buf[len++] = 'b';
+        }
+        if (len < PRINTF_INTEGER_BUFFER_SIZE)
+        {
+            buf[len++] = '0';
+        }
+    }
+
+    if (len < PRINTF_INTEGER_BUFFER_SIZE)
+    {
+        if (negative)
+        {
+            buf[len++] = '-';
+        }
+        else if (flags & FLAGS_PLUS)
+        {
+            buf[len++] = '+'; // ignore the space if the '+' exists
+        }
+        else if (flags & FLAGS_SPACE)
+        {
+            buf[len++] = ' ';
+        }
+    }
+
+    out_rev_(output, buf, len, width, flags);
+}
+
+// An internal itoa-like function
+static NIF void print_integer(output_gadget_t *output, printf_unsigned_value_t value, bool negative, numeric_base_t base, printf_size_t precision, printf_size_t width, printf_flags_t flags)
+{
+    char buf[PRINTF_INTEGER_BUFFER_SIZE];
+    printf_size_t len = 0U;
+
+    if (!value)
+    {
+        if (!(flags & FLAGS_PRECISION))
+        {
+            buf[len++] = '0';
+            flags &= ~FLAGS_HASH;
+            // We drop this flag this since either the alternative and regular modes of the specifier
+            // don't differ on 0 values, or (in the case of octal) we've already provided the special
+            // handling for this mode.
+        }
+        else if (base == BASE_HEX)
+        {
+            flags &= ~FLAGS_HASH;
+            // We drop this flag this since either the alternative and regular modes of the specifier
+            // don't differ on 0 values
+        }
+    }
+    else
+    {
+        do
+        {
+            const char digit = (char)(value % base);
+            buf[len++] = (char)(digit < 10 ? '0' + digit : (flags & FLAGS_UPPERCASE ? 'A' : 'a') + digit - 10);
+            value /= base;
+        } while (value && (len < PRINTF_INTEGER_BUFFER_SIZE));
+    }
+
+    print_integer_finalization(output, buf, len, negative, base, precision, width, flags);
+}
+
+#if (PRINTF_SUPPORT_DECIMAL_SPECIFIERS || PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS)
+
+// Stores a fixed-precision representation of a double relative
+// to a fixed precision (which cannot be determined by examining this structure)
+struct double_components
+{
+    int_fast64_t integral;
+    int_fast64_t fractional;
+    // ... truncation of the actual fractional part of the double value, scaled
+    // by the precision value
+    bool is_negative;
+};
+
+#define NUM_DECIMAL_DIGITS_IN_INT64_T 18
+#define PRINTF_MAX_PRECOMPUTED_POWER_OF_10 NUM_DECIMAL_DIGITS_IN_INT64_T
+static const double powers_of_10[NUM_DECIMAL_DIGITS_IN_INT64_T] = {
+    1e00, 1e01, 1e02, 1e03, 1e04, 1e05, 1e06, 1e07, 1e08,
+    1e09, 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17};
+
+#define PRINTF_MAX_SUPPORTED_PRECISION NUM_DECIMAL_DIGITS_IN_INT64_T - 1
+
+// Break up a double number - which is known to be a finite non-negative number -
+// into its base-10 parts: integral - before the decimal point, and fractional - after it.
+// Taken the precision into account, but does not change it even internally.
+static struct NIF double_components get_components(double number, printf_size_t precision)
+{
+    struct double_components number_;
+    number_.is_negative = get_sign_bit(number);
+    double abs_number = (number_.is_negative) ? -number : number;
+    number_.integral = (int_fast64_t)abs_number;
+    double remainder = (abs_number - (double)number_.integral) * powers_of_10[precision];
+    number_.fractional = (int_fast64_t)remainder;
+
+    remainder -= (double)number_.fractional;
+
+    if (remainder > 0.5)
+    {
+        ++number_.fractional;
+        // handle rollover, e.g. case 0.99 with precision 1 is 1.0
+        if ((double)number_.fractional >= powers_of_10[precision])
+        {
+            number_.fractional = 0;
+            ++number_.integral;
+        }
+    }
+    else if ((remainder == 0.5) && ((number_.fractional == 0U) || (number_.fractional & 1U)))
+    {
+        // if halfway, round up if odd OR if last digit is 0
+        ++number_.fractional;
+    }
+
+    if (precision == 0U)
+    {
+        remainder = abs_number - (double)number_.integral;
+        if ((!(remainder < 0.5) || (remainder > 0.5)) && (number_.integral & 1))
+        {
+            // exactly 0.5 and ODD, then round up
+            // 1.5 -> 2, but 2.5 -> 2
+            ++number_.integral;
+        }
+    }
+    return number_;
+}
+
+#if PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+struct scaling_factor
+{
+    double raw_factor;
+    bool multiply; // if true, need to multiply by raw_factor; otherwise need to divide by it
+};
+
+static double apply_scaling(double num, struct scaling_factor normalization)
+{
+    return normalization.multiply ? num * normalization.raw_factor : num / normalization.raw_factor;
+}
+
+static double unapply_scaling(double normalized, struct scaling_factor normalization)
+{
+#ifdef __GNUC__
+// accounting for a static analysis bug in GCC 6.x and earlier
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+    return normalization.multiply ? normalized / normalization.raw_factor : normalized * normalization.raw_factor;
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+}
+
+static struct scaling_factor update_normalization(struct scaling_factor sf, double extra_multiplicative_factor)
+{
+    struct scaling_factor result;
+    if (sf.multiply)
+    {
+        result.multiply = true;
+        result.raw_factor = sf.raw_factor * extra_multiplicative_factor;
+    }
+    else
+    {
+        int factor_exp2 = get_exp2(get_bit_access(sf.raw_factor));
+        int extra_factor_exp2 = get_exp2(get_bit_access(extra_multiplicative_factor));
+
+        // Divide the larger-exponent raw raw_factor by the smaller
+        if (PRINTF_ABS(factor_exp2) > PRINTF_ABS(extra_factor_exp2))
+        {
+            result.multiply = false;
+            result.raw_factor = sf.raw_factor / extra_multiplicative_factor;
+        }
+        else
+        {
+            result.multiply = true;
+            result.raw_factor = extra_multiplicative_factor / sf.raw_factor;
+        }
+    }
+    return result;
+}
+
+static struct double_components get_normalized_components(bool negative, printf_size_t precision, double non_normalized, struct scaling_factor normalization, int floored_exp10)
+{
+    struct double_components components;
+    components.is_negative = negative;
+    double scaled = apply_scaling(non_normalized, normalization);
+
+    bool close_to_representation_extremum = ((-floored_exp10 + (int)precision) >= DBL_MAX_10_EXP - 1);
+    if (close_to_representation_extremum)
+    {
+        // We can't have a normalization factor which also accounts for the precision, i.e. moves
+        // some decimal digits into the mantissa, since it's unrepresentable, or nearly unrepresentable.
+        // So, we'll give up early on getting extra precision...
+        return get_components(negative ? -scaled : scaled, precision);
+    }
+    components.integral = (int_fast64_t)scaled;
+    double remainder = non_normalized - unapply_scaling((double)components.integral, normalization);
+    double prec_power_of_10 = powers_of_10[precision];
+    struct scaling_factor account_for_precision = update_normalization(normalization, prec_power_of_10);
+    double scaled_remainder = apply_scaling(remainder, account_for_precision);
+    double rounding_threshold = 0.5;
+
+    components.fractional = (int_fast64_t)scaled_remainder; // when precision == 0, the assigned value should be 0
+    scaled_remainder -= (double)components.fractional;      // when precision == 0, this will not change scaled_remainder
+
+    components.fractional += (scaled_remainder >= rounding_threshold);
+    if (scaled_remainder == rounding_threshold)
+    {
+        // banker's rounding: Round towards the even number (making the mean error 0)
+        components.fractional &= ~((int_fast64_t)0x1);
+    }
+    // handle rollover, e.g. the case of 0.99 with precision 1 becoming (0,100),
+    // and must then be corrected into (1, 0).
+    // Note: for precision = 0, this will "translate" the rounding effect from
+    // the fractional part to the integral part where it should actually be
+    // felt (as prec_power_of_10 is 1)
+    if ((double)components.fractional >= prec_power_of_10)
+    {
+        components.fractional = 0;
+        ++components.integral;
+    }
+    return components;
+}
+#endif // PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+
+static NIF void print_broken_up_decimal(
+    struct double_components number_, output_gadget_t *output, printf_size_t precision,
+    printf_size_t width, printf_flags_t flags, char *buf, printf_size_t len)
+{
+    if (precision != 0U)
+    {
+        // do fractional part, as an unsigned number
+
+        printf_size_t count = precision;
+
+        // %g/%G mandates we skip the trailing 0 digits...
+        if ((flags & FLAGS_ADAPT_EXP) && !(flags & FLAGS_HASH) && (number_.fractional > 0))
+        {
+            while (true)
+            {
+                int_fast64_t digit = number_.fractional % 10U;
+                if (digit != 0)
+                {
+                    break;
+                }
+                --count;
+                number_.fractional /= 10U;
+            }
+            // ... and even the decimal point if there are no
+            // non-zero fractional part digits (see below)
+        }
+
+        if (number_.fractional > 0 || !(flags & FLAGS_ADAPT_EXP) || (flags & FLAGS_HASH))
+        {
+            while (len < PRINTF_DECIMAL_BUFFER_SIZE)
+            {
+                --count;
+                buf[len++] = (char)('0' + number_.fractional % 10U);
+                if (!(number_.fractional /= 10U))
+                {
+                    break;
+                }
+            }
+            // add extra 0s
+            while ((len < PRINTF_DECIMAL_BUFFER_SIZE) && (count > 0U))
+            {
+                buf[len++] = '0';
+                --count;
+            }
+            if (len < PRINTF_DECIMAL_BUFFER_SIZE)
+            {
+                buf[len++] = '.';
+            }
+        }
+    }
+    else
+    {
+        if ((flags & FLAGS_HASH) && (len < PRINTF_DECIMAL_BUFFER_SIZE))
+        {
+            buf[len++] = '.';
+        }
+    }
+
+    // Write the integer part of the number (it comes after the fractional
+    // since the character order is reversed)
+    while (len < PRINTF_DECIMAL_BUFFER_SIZE)
+    {
+        buf[len++] = (char)('0' + (number_.integral % 10));
+        if (!(number_.integral /= 10))
+        {
+            break;
+        }
+    }
+
+    // pad leading zeros
+    if (!(flags & FLAGS_LEFT) && (flags & FLAGS_ZEROPAD))
+    {
+        if (width && (number_.is_negative || (flags & (FLAGS_PLUS | FLAGS_SPACE))))
+        {
+            width--;
+        }
+        while ((len < width) && (len < PRINTF_DECIMAL_BUFFER_SIZE))
+        {
+            buf[len++] = '0';
+        }
+    }
+
+    if (len < PRINTF_DECIMAL_BUFFER_SIZE)
+    {
+        if (number_.is_negative)
+        {
+            buf[len++] = '-';
+        }
+        else if (flags & FLAGS_PLUS)
+        {
+            buf[len++] = '+'; // ignore the space if the '+' exists
+        }
+        else if (flags & FLAGS_SPACE)
+        {
+            buf[len++] = ' ';
+        }
+    }
+
+    out_rev_(output, buf, len, width, flags);
+}
+
+// internal ftoa for fixed decimal floating point
+static NIF void print_decimal_number(output_gadget_t *output, double number, printf_size_t precision, printf_size_t width, printf_flags_t flags, char *buf, printf_size_t len)
+{
+    struct double_components value_ = get_components(number, precision);
+    print_broken_up_decimal(value_, output, precision, width, flags, buf, len);
+}
+
+#if PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+
+// A floor function - but one which only works for numbers whose
+// floor value is representable by an int.
+static int bastardized_floor(double x)
+{
+    if (x >= 0)
+    {
+        return (int)x;
+    }
+    int n = (int)x;
+    return (((double)n) == x) ? n : n - 1;
+}
+
+// Computes the base-10 logarithm of the input number - which must be an actual
+// positive number (not infinity or NaN, nor a sub-normal)
+static double log10_of_positive(double positive_number)
+{
+    // The implementation follows David Gay (https://www.ampl.com/netlib/fp/dtoa.c).
+    //
+    // Since log_10 ( M * 2^x ) = log_10(M) + x , we can separate the components of
+    // our input number, and need only solve log_10(M) for M between 1 and 2 (as
+    // the base-2 mantissa is always 1-point-something). In that limited range, a
+    // Taylor series expansion of log10(x) should serve us well enough; and we'll
+    // take the mid-point, 1.5, as the point of expansion.
+
+    double_with_bit_access dwba = get_bit_access(positive_number);
+    // based on the algorithm by David Gay (https://www.ampl.com/netlib/fp/dtoa.c)
+    int exp2 = get_exp2(dwba);
+    // drop the exponent, so dwba.F comes into the range [1,2)
+    dwba.U = (dwba.U & (((double_uint_t)(1) << DOUBLE_STORED_MANTISSA_BITS) - 1U)) |
+             ((double_uint_t)DOUBLE_BASE_EXPONENT << DOUBLE_STORED_MANTISSA_BITS);
+    double z = (dwba.F - 1.5);
+    return (
+        // Taylor expansion around 1.5:
+        0.1760912590556812420       // Expansion term 0: ln(1.5)            / ln(10)
+        + z * 0.2895296546021678851 // Expansion term 1: (M - 1.5)   * 2/3  / ln(10)
+#if PRINTF_LOG10_TAYLOR_TERMS > 2
+        - z * z * 0.0965098848673892950 // Expansion term 2: (M - 1.5)^2 * 2/9  / ln(10)
+#if PRINTF_LOG10_TAYLOR_TERMS > 3
+        + z * z * z * 0.0428932821632841311 // Expansion term 2: (M - 1.5)^3 * 8/81 / ln(10)
+#endif
+#endif
+        // exact log_2 of the exponent x, with logarithm base change
+        + exp2 * 0.30102999566398119521 // = exp2 * log_10(2) = exp2 * ln(2)/ln(10)
+    );
+}
+
+static double pow10_of_int(int floored_exp10)
+{
+    // A crude hack for avoiding undesired behavior with barely-normal or slightly-subnormal values.
+    if (floored_exp10 == DOUBLE_MAX_SUBNORMAL_EXPONENT_OF_10)
+    {
+        return DOUBLE_MAX_SUBNORMAL_POWER_OF_10;
+    }
+    // Compute 10^(floored_exp10) but (try to) make sure that doesn't overflow
+    double_with_bit_access dwba;
+    int exp2 = bastardized_floor(floored_exp10 * 3.321928094887362 + 0.5);
+    const double z = floored_exp10 * 2.302585092994046 - exp2 * 0.6931471805599453;
+    const double z2 = z * z;
+    dwba.U = ((double_uint_t)(exp2) + DOUBLE_BASE_EXPONENT) << DOUBLE_STORED_MANTISSA_BITS;
+    // compute exp(z) using continued fractions,
+    // see https://en.wikipedia.org/wiki/Exponential_function#Continued_fractions_for_ex
+    dwba.F *= 1 + 2 * z / (2 - z + (z2 / (6 + (z2 / (10 + z2 / 14)))));
+    return dwba.F;
+}
+
+static NIF void print_exponential_number(output_gadget_t *output, double number, printf_size_t precision, printf_size_t width, printf_flags_t flags, char *buf, printf_size_t len)
+{
+    const bool negative = get_sign_bit(number);
+    // This number will decrease gradually (by factors of 10) as we "extract" the exponent out of it
+    double abs_number = negative ? -number : number;
+
+    int floored_exp10;
+    bool abs_exp10_covered_by_powers_table;
+    struct scaling_factor normalization;
+
+    // Determine the decimal exponent
+    if (abs_number == 0.0)
+    {
+        // TODO: This is a special-case for 0.0 (and -0.0); but proper handling is required for denormals more generally.
+        floored_exp10 = 0; // ... and no need to set a normalization factor or check the powers table
+    }
+    else
+    {
+        double exp10 = log10_of_positive(abs_number);
+        floored_exp10 = bastardized_floor(exp10);
+        double p10 = pow10_of_int(floored_exp10);
+        // correct for rounding errors
+        if (abs_number < p10)
+        {
+            floored_exp10--;
+            p10 /= 10;
+        }
+        abs_exp10_covered_by_powers_table = PRINTF_ABS(floored_exp10) < PRINTF_MAX_PRECOMPUTED_POWER_OF_10;
+        normalization.raw_factor = abs_exp10_covered_by_powers_table ? powers_of_10[PRINTF_ABS(floored_exp10)] : p10;
+    }
+
+    // We now begin accounting for the widths of the two parts of our printed field:
+    // the decimal part after decimal exponent extraction, and the base-10 exponent part.
+    // For both of these, the value of 0 has a special meaning, but not the same one:
+    // a 0 exponent-part width means "don't print the exponent"; a 0 decimal-part width
+    // means "use as many characters as necessary".
+
+    bool fall_back_to_decimal_only_mode = false;
+    if (flags & FLAGS_ADAPT_EXP)
+    {
+        int required_significant_digits = (precision == 0) ? 1 : (int)precision;
+        // Should we want to fall-back to "%f" mode, and only print the decimal part?
+        fall_back_to_decimal_only_mode = (floored_exp10 >= -4 && floored_exp10 < required_significant_digits);
+        // Now, let's adjust the precision
+        // This also decided how we adjust the precision value - as in "%g" mode,
+        // "precision" is the number of _significant digits_, and this is when we "translate"
+        // the precision value to an actual number of decimal digits.
+        int precision_ = fall_back_to_decimal_only_mode ? (int)precision - 1 - floored_exp10 : (int)precision - 1; // the presence of the exponent ensures only one significant digit comes before the decimal point
+        precision = (precision_ > 0 ? (unsigned)precision_ : 0U);
+        flags |= FLAGS_PRECISION; // make sure print_broken_up_decimal respects our choice above
+    }
+
+    normalization.multiply = (floored_exp10 < 0 && abs_exp10_covered_by_powers_table);
+    bool should_skip_normalization = (fall_back_to_decimal_only_mode || floored_exp10 == 0);
+    struct double_components decimal_part_components =
+        should_skip_normalization ? get_components(negative ? -abs_number : abs_number, precision) : get_normalized_components(negative, precision, abs_number, normalization, floored_exp10);
+
+    // Account for roll-over, e.g. rounding from 9.99 to 100.0 - which effects
+    // the exponent and may require additional tweaking of the parts
+    if (fall_back_to_decimal_only_mode)
+    {
+        if ((flags & FLAGS_ADAPT_EXP) && floored_exp10 >= -1 && decimal_part_components.integral == powers_of_10[floored_exp10 + 1])
+        {
+            floored_exp10++; // Not strictly necessary, since floored_exp10 is no longer really used
+            precision--;
+            // ... and it should already be the case that decimal_part_components.fractional == 0
+        }
+        // TODO: What about rollover strictly within the fractional part?
+    }
+    else
+    {
+        if (decimal_part_components.integral >= 10)
+        {
+            floored_exp10++;
+            decimal_part_components.integral = 1;
+            decimal_part_components.fractional = 0;
+        }
+    }
+
+    // the floored_exp10 format is "E%+03d" and largest possible floored_exp10 value for a 64-bit double
+    // is "307" (for 2^1023), so we set aside 4-5 characters overall
+    printf_size_t exp10_part_width = fall_back_to_decimal_only_mode ? 0U : (PRINTF_ABS(floored_exp10) < 100) ? 4U
+                                                                                                             : 5U;
+
+    printf_size_t decimal_part_width =
+        ((flags & FLAGS_LEFT) && exp10_part_width) ?
+                                                   // We're padding on the right, so the width constraint is the exponent part's
+                                                   // problem, not the decimal part's, so we'll use as many characters as we need:
+            0U
+                                                   :
+                                                   // We're padding on the left; so the width constraint is the decimal part's
+                                                   // problem. Well, can both the decimal part and the exponent part fit within our overall width?
+            ((width > exp10_part_width) ?
+                                        // Yes, so we limit our decimal part's width.
+                                        // (Note this is trivially valid even if we've fallen back to "%f" mode)
+                 width - exp10_part_width
+                                        :
+                                        // No; we just give up on any restriction on the decimal part and use as many
+                                        // characters as we need
+                 0U);
+
+    const printf_size_t printed_exponential_start_pos = output->pos;
+    print_broken_up_decimal(decimal_part_components, output, precision, decimal_part_width, flags, buf, len);
+
+    if (!fall_back_to_decimal_only_mode)
+    {
+        putchar_via_gadget(output, (flags & FLAGS_UPPERCASE) ? 'E' : 'e');
+        print_integer(output,
+                      ABS_FOR_PRINTING(floored_exp10),
+                      floored_exp10 < 0, 10, 0, exp10_part_width - 1,
+                      FLAGS_ZEROPAD | FLAGS_PLUS);
+        if (flags & FLAGS_LEFT)
+        {
+            // We need to right-pad with spaces to meet the width requirement
+            while (output->pos - printed_exponential_start_pos < width)
+            {
+                putchar_via_gadget(output, ' ');
+            }
+        }
+    }
+}
+#endif // PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+
+static NIF void print_floating_point(output_gadget_t *output, double value, printf_size_t precision, printf_size_t width, printf_flags_t flags, bool prefer_exponential)
+{
+    char buf[PRINTF_DECIMAL_BUFFER_SIZE];
+    printf_size_t len = 0U;
+
+    // test for special values
+    if (value != value)
+    {
+        out_rev_(output, "nan", 3, width, flags);
+        return;
+    }
+    if (value < -DBL_MAX)
+    {
+        out_rev_(output, "fni-", 4, width, flags);
+        return;
+    }
+    if (value > DBL_MAX)
+    {
+        out_rev_(output, (flags & FLAGS_PLUS) ? "fni+" : "fni", (flags & FLAGS_PLUS) ? 4U : 3U, width, flags);
+        return;
+    }
+
+    if (!prefer_exponential &&
+        ((value > PRINTF_FLOAT_NOTATION_THRESHOLD) || (value < -PRINTF_FLOAT_NOTATION_THRESHOLD)))
+    {
+        // The required behavior of standard printf is to print _every_ integral-part digit -- which could mean
+        // printing hundreds of characters, overflowing any fixed internal buffer and necessitating a more complicated
+        // implementation.
+#if PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+        print_exponential_number(output, value, precision, width, flags, buf, len);
+#endif
+        return;
+    }
+
+    // set default precision, if not set explicitly
+    if (!(flags & FLAGS_PRECISION))
+    {
+        precision = PRINTF_DEFAULT_FLOAT_PRECISION;
+    }
+
+    // limit precision so that our integer holding the fractional part does not overflow
+    while ((len < PRINTF_DECIMAL_BUFFER_SIZE) && (precision > PRINTF_MAX_SUPPORTED_PRECISION))
+    {
+        buf[len++] = '0'; // This respects the precision in terms of result length only
+        precision--;
+    }
+
+#if PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+    if (prefer_exponential)
+        print_exponential_number(output, value, precision, width, flags, buf, len);
+    else
+#endif
+        print_decimal_number(output, value, precision, width, flags, buf, len);
+}
+
+#endif // (PRINTF_SUPPORT_DECIMAL_SPECIFIERS || PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS)
+
+// Advances the format pointer past the flags, and returns the parsed flags
+// due to the characters passed
+static NIF printf_flags_t parse_flags(const char **format)
+{
+    printf_flags_t flags = 0U;
+    do
+    {
+        switch (**format)
+        {
+        case '0':
+            flags |= FLAGS_ZEROPAD;
+            (*format)++;
+            break;
+        case '-':
+            flags |= FLAGS_LEFT;
+            (*format)++;
+            break;
+        case '+':
+            flags |= FLAGS_PLUS;
+            (*format)++;
+            break;
+        case ' ':
+            flags |= FLAGS_SPACE;
+            (*format)++;
+            break;
+        case '#':
+            flags |= FLAGS_HASH;
+            (*format)++;
+            break;
+        default:
+            return flags;
+        }
+    } while (true);
+}
+
+static inline NIF void format_string_loop(output_gadget_t *output, const char *format, va_list args)
+{
+#if PRINTF_CHECK_FOR_NUL_IN_FORMAT_SPECIFIER
+#define ADVANCE_IN_FORMAT_STRING(cptr_) \
+    do                                  \
+    {                                   \
+        (cptr_)++;                      \
+        if (!*(cptr_))                  \
+            return;                     \
+    } while (0)
+#else
+#define ADVANCE_IN_FORMAT_STRING(cptr_) (cptr_)++
+#endif
+
+    while (*format)
+    {
+        if (*format != '%')
+        {
+            // A regular content character
+            putchar_via_gadget(output, *format);
+            format++;
+            continue;
+        }
+        // We're parsing a format specifier: %[flags][width][.precision][length]
+        ADVANCE_IN_FORMAT_STRING(format);
+
+        printf_flags_t flags = parse_flags(&format);
+
+        // evaluate width field
+        printf_size_t width = 0U;
+        if (is_digit_(*format))
+        {
+            width = (printf_size_t)atou_(&format);
+        }
+        else if (*format == '*')
+        {
+            const int w = va_arg(args, int);
+            if (w < 0)
+            {
+                flags |= FLAGS_LEFT; // reverse padding
+                width = (printf_size_t)-w;
+            }
+            else
+            {
+                width = (printf_size_t)w;
+            }
+            ADVANCE_IN_FORMAT_STRING(format);
+        }
+
+        // evaluate precision field
+        printf_size_t precision = 0U;
+        if (*format == '.')
+        {
+            flags |= FLAGS_PRECISION;
+            ADVANCE_IN_FORMAT_STRING(format);
+            if (is_digit_(*format))
+            {
+                precision = (printf_size_t)atou_(&format);
+            }
+            else if (*format == '*')
+            {
+                const int precision_ = va_arg(args, int);
+                precision = precision_ > 0 ? (printf_size_t)precision_ : 0U;
+                ADVANCE_IN_FORMAT_STRING(format);
+            }
+        }
+
+        // evaluate length field
+        switch (*format)
+        {
+#ifdef PRINTF_SUPPORT_MSVC_STYLE_INTEGER_SPECIFIERS
+        case 'I':
+        {
+            ADVANCE_IN_FORMAT_STRING(format);
+            // Greedily parse for size in bits: 8, 16, 32 or 64
+            switch (*format)
+            {
+            case '8':
+                flags |= FLAGS_INT8;
+                ADVANCE_IN_FORMAT_STRING(format);
+                break;
+            case '1':
+                ADVANCE_IN_FORMAT_STRING(format);
+                if (*format == '6')
+                {
+                    format++;
+                    flags |= FLAGS_INT16;
+                }
+                break;
+            case '3':
+                ADVANCE_IN_FORMAT_STRING(format);
+                if (*format == '2')
+                {
+                    ADVANCE_IN_FORMAT_STRING(format);
+                    flags |= FLAGS_INT32;
+                }
+                break;
+            case '6':
+                ADVANCE_IN_FORMAT_STRING(format);
+                if (*format == '4')
+                {
+                    ADVANCE_IN_FORMAT_STRING(format);
+                    flags |= FLAGS_INT64;
+                }
+                break;
+            default:
+                break;
+            }
+            break;
+        }
+#endif
+        case 'l':
+            flags |= FLAGS_LONG;
+            ADVANCE_IN_FORMAT_STRING(format);
+            if (*format == 'l')
+            {
+                flags |= FLAGS_LONG_LONG;
+                ADVANCE_IN_FORMAT_STRING(format);
+            }
+            break;
+        case 'h':
+            flags |= FLAGS_SHORT;
+            ADVANCE_IN_FORMAT_STRING(format);
+            if (*format == 'h')
+            {
+                flags |= FLAGS_CHAR;
+                ADVANCE_IN_FORMAT_STRING(format);
+            }
+            break;
+        case 't':
+            flags |= (sizeof(ptrdiff_t) == sizeof(long) ? FLAGS_LONG : FLAGS_LONG_LONG);
+            ADVANCE_IN_FORMAT_STRING(format);
+            break;
+        case 'j':
+            flags |= (sizeof(intmax_t) == sizeof(long) ? FLAGS_LONG : FLAGS_LONG_LONG);
+            ADVANCE_IN_FORMAT_STRING(format);
+            break;
+        case 'z':
+            flags |= (sizeof(size_t) == sizeof(long) ? FLAGS_LONG : FLAGS_LONG_LONG);
+            ADVANCE_IN_FORMAT_STRING(format);
+            break;
+        default:
+            break;
+        }
+
+        // evaluate specifier
+        switch (*format)
+        {
+        case 'd':
+        case 'i':
+        case 'u':
+        case 'x':
+        case 'X':
+        case 'o':
+        case 'b':
+        {
+
+            if (*format == 'd' || *format == 'i')
+            {
+                flags |= FLAGS_SIGNED;
+            }
+
+            numeric_base_t base;
+            if (*format == 'x' || *format == 'X')
+            {
+                base = BASE_HEX;
+            }
+            else if (*format == 'o')
+            {
+                base = BASE_OCTAL;
+            }
+            else if (*format == 'b')
+            {
+                base = BASE_BINARY;
+            }
+            else
+            {
+                base = BASE_DECIMAL;
+                flags &= ~FLAGS_HASH; // decimal integers have no alternative presentation
+            }
+
+            if (*format == 'X')
+            {
+                flags |= FLAGS_UPPERCASE;
+            }
+
+            format++;
+            // ignore '0' flag when precision is given
+            if (flags & FLAGS_PRECISION)
+            {
+                flags &= ~FLAGS_ZEROPAD;
+            }
+
+            if (flags & FLAGS_SIGNED)
+            {
+                // A signed specifier: d, i or possibly I + bit size if enabled
+
+                if (flags & FLAGS_LONG_LONG)
+                {
+#if PRINTF_SUPPORT_LONG_LONG
+                    const long long value = va_arg(args, long long);
+                    print_integer(output, ABS_FOR_PRINTING(value), value < 0, base, precision, width, flags);
+#endif
+                }
+                else if (flags & FLAGS_LONG)
+                {
+                    const long value = va_arg(args, long);
+                    print_integer(output, ABS_FOR_PRINTING(value), value < 0, base, precision, width, flags);
+                }
+                else
+                {
+                    // We never try to interpret the argument as something potentially-smaller than int,
+                    // due to integer promotion rules: Even if the user passed a short int, short unsigned
+                    // etc. - these will come in after promotion, as int's (or unsigned for the case of
+                    // short unsigned when it has the same size as int)
+                    const int value =
+                        (flags & FLAGS_CHAR) ? (signed char)va_arg(args, int) : (flags & FLAGS_SHORT) ? (short int)va_arg(args, int)
+                                                                                                      : va_arg(args, int);
+                    print_integer(output, ABS_FOR_PRINTING(value), value < 0, base, precision, width, flags);
+                }
+            }
+            else
+            {
+                // An unsigned specifier: u, x, X, o, b
+
+                flags &= ~(FLAGS_PLUS | FLAGS_SPACE);
+
+                if (flags & FLAGS_LONG_LONG)
+                {
+#if PRINTF_SUPPORT_LONG_LONG
+                    print_integer(output, (printf_unsigned_value_t)va_arg(args, unsigned long long), false, base, precision, width, flags);
+#endif
+                }
+                else if (flags & FLAGS_LONG)
+                {
+                    print_integer(output, (printf_unsigned_value_t)va_arg(args, unsigned long), false, base, precision, width, flags);
+                }
+                else
+                {
+                    const unsigned int value =
+                        (flags & FLAGS_CHAR) ? (unsigned char)va_arg(args, unsigned int) : (flags & FLAGS_SHORT) ? (unsigned short int)va_arg(args, unsigned int)
+                                                                                                                 : va_arg(args, unsigned int);
+                    print_integer(output, (printf_unsigned_value_t)value, false, base, precision, width, flags);
+                }
+            }
+            break;
+        }
+#if PRINTF_SUPPORT_DECIMAL_SPECIFIERS
+        case 'f':
+        case 'F':
+            if (*format == 'F')
+                flags |= FLAGS_UPPERCASE;
+            print_floating_point(output, va_arg(args, double), precision, width, flags, PRINTF_PREFER_DECIMAL);
+            format++;
+            break;
+#endif
+#if PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+        case 'e':
+        case 'E':
+        case 'g':
+        case 'G':
+            if ((*format == 'g') || (*format == 'G'))
+                flags |= FLAGS_ADAPT_EXP;
+            if ((*format == 'E') || (*format == 'G'))
+                flags |= FLAGS_UPPERCASE;
+            print_floating_point(output, va_arg(args, double), precision, width, flags, PRINTF_PREFER_EXPONENTIAL);
+            format++;
+            break;
+#endif // PRINTF_SUPPORT_EXPONENTIAL_SPECIFIERS
+        case 'c':
+        {
+            printf_size_t l = 1U;
+            // pre padding
+            if (!(flags & FLAGS_LEFT))
+            {
+                while (l++ < width)
+                {
+                    putchar_via_gadget(output, ' ');
+                }
+            }
+            // char output
+            putchar_via_gadget(output, (char)va_arg(args, int));
+            // post padding
+            if (flags & FLAGS_LEFT)
+            {
+                while (l++ < width)
+                {
+                    putchar_via_gadget(output, ' ');
+                }
+            }
+            format++;
+            break;
+        }
+
+        case 's':
+        {
+            const char *p = va_arg(args, char *);
+            if (p == NULL)
+            {
+                out_rev_(output, ")llun(", 6, width, flags);
+            }
+            else
+            {
+                printf_size_t l = strnlen_s_(p, precision ? precision : PRINTF_MAX_POSSIBLE_BUFFER_SIZE);
+                // pre padding
+                if (flags & FLAGS_PRECISION)
+                {
+                    l = (l < precision ? l : precision);
+                }
+                if (!(flags & FLAGS_LEFT))
+                {
+                    while (l++ < width)
+                    {
+                        putchar_via_gadget(output, ' ');
+                    }
+                }
+                // string output
+                while ((*p != 0) && (!(flags & FLAGS_PRECISION) || precision))
+                {
+                    putchar_via_gadget(output, *(p++));
+                    --precision;
+                }
+                // post padding
+                if (flags & FLAGS_LEFT)
+                {
+                    while (l++ < width)
+                    {
+                        putchar_via_gadget(output, ' ');
+                    }
+                }
+            }
+            format++;
+            break;
+        }
+
+        case 'p':
+        {
+            width = sizeof(void *) * 2U + 2; // 2 hex chars per byte + the "0x" prefix
+            flags |= FLAGS_ZEROPAD | FLAGS_POINTER;
+            uintptr_t value = (uintptr_t)va_arg(args, void *);
+            (value == (uintptr_t)NULL) ? out_rev_(output, ")lin(", 5, width, flags) : print_integer(output, (printf_unsigned_value_t)value, false, BASE_HEX, precision, width, flags);
+            format++;
+            break;
+        }
+
+        case '%':
+            putchar_via_gadget(output, '%');
+            format++;
+            break;
+
+            // Many people prefer to disable support for %n, as it lets the caller
+            // engineer a write to an arbitrary location, of a value the caller
+            // effectively controls - which could be a security concern in some cases.
+#if PRINTF_SUPPORT_WRITEBACK_SPECIFIER
+        case 'n':
+        {
+            if (flags & FLAGS_CHAR)
+                *(va_arg(args, char *)) = (char)output->pos;
+            else if (flags & FLAGS_SHORT)
+                *(va_arg(args, short *)) = (short)output->pos;
+            else if (flags & FLAGS_LONG)
+                *(va_arg(args, long *)) = (long)output->pos;
+#if PRINTF_SUPPORT_LONG_LONG
+            else if (flags & FLAGS_LONG_LONG)
+                *(va_arg(args, long long *)) = (long long int)output->pos;
+#endif // PRINTF_SUPPORT_LONG_LONG
+            else
+                *(va_arg(args, int *)) = (int)output->pos;
+            format++;
+            break;
+        }
+#endif // PRINTF_SUPPORT_WRITEBACK_SPECIFIER
+
+        default:
+            putchar_via_gadget(output, *format);
+            format++;
+            break;
+        }
+    }
+}
+
+// internal vsnprintf - used for implementing _all library functions
+static NIF int vsnprintf_impl(output_gadget_t *output, const char *format, va_list args)
+{
+    // Note: The library only calls vsnprintf_impl() with output->pos being 0. However, it is
+    // possible to call this function with a non-zero pos value for some "remedial printing".
+    format_string_loop(output, format, args);
+
+    // termination
+    append_termination_with_gadget(output);
+
+    // return written chars without terminating \0
+    return (int)output->pos;
+}
+
+///////////////////////////////////////////////////////////////////////////////
+
+NIF int vprintf(const char *format, va_list arg)
+{
+    output_gadget_t gadget = extern_putchar_gadget();
+    return vsnprintf_impl(&gadget, format, arg);
+}
+
+NIF int vsnprintf(char *s, size_t n, const char *format, va_list arg)
+{
+    output_gadget_t gadget = buffer_gadget(s, n);
+    return vsnprintf_impl(&gadget, format, arg);
+}
+
+NIF int vsprintf(char *s, const char *format, va_list arg)
+{
+    return vsnprintf(s, PRINTF_MAX_POSSIBLE_BUFFER_SIZE, format, arg);
+}
+
+NIF int vfctprintf(void (*out)(char c, void *extra_arg), void *extra_arg, const char *format, va_list arg)
+{
+    output_gadget_t gadget = function_gadget(out, extra_arg);
+    return vsnprintf_impl(&gadget, format, arg);
+}
+
+NIF int printf(const char *format, ...)
+{
+    va_list args;
+    va_start(args, format);
+    const int ret = vprintf(format, args);
+    va_end(args);
+    return ret;
+}
+
+NIF int sprintf(char *s, const char *format, ...)
+{
+    va_list args;
+    va_start(args, format);
+    const int ret = vsprintf(s, format, args);
+    va_end(args);
+    return ret;
+}
+
+NIF int snprintf(char *s, size_t n, const char *format, ...)
+{
+    va_list args;
+    va_start(args, format);
+    const int ret = vsnprintf(s, n, format, args);
+    va_end(args);
+    return ret;
+}
+
+NIF int fctprintf(void (*out)(char c, void *extra_arg), void *extra_arg, const char *format, ...)
+{
+    va_list args;
+    va_start(args, format);
+    const int ret = vfctprintf(out, extra_arg, format, args);
+    va_end(args);
+    return ret;
+}
diff --git a/Kernel/Library/targp.c b/Kernel/Library/targp.c
new file mode 100644
index 00000000..80639972
--- /dev/null
+++ b/Kernel/Library/targp.c
@@ -0,0 +1,47 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <targp.h>
+
+#include <memory.hpp>
+#include <convert.h>
+
+void targp_parse(const char *cmd, char **argv, int *argc)
+{
+    const char delim[] = " ";
+
+    char *token = strtok((char *)cmd, delim);
+    while (token != NULL)
+    {
+        char *quote = strchr(token, '"');
+        if (quote != NULL)
+        {
+            memmove(quote, quote + 1, strlen(quote));
+            char *endQuote = strchr(quote, '"');
+            if (endQuote != NULL)
+                *endQuote = '\0';
+        }
+
+        char *arg = (char *)kmalloc(strlen(token) + 1);
+        strcpy(arg, token);
+
+        argv[(*argc)++] = arg;
+
+        token = strtok(NULL, delim);
+    }
+    argv[(*argc)] = NULL;
+}
diff --git a/Kernel/Makefile b/Kernel/Makefile
new file mode 100644
index 00000000..fce20b25
--- /dev/null
+++ b/Kernel/Makefile
@@ -0,0 +1,196 @@
+# Config file
+include ../Makefile.conf
+
+KERNEL_FILENAME = kernel.fsys
+
+CC = ../$(COMPILER_PATH)/$(COMPILER_ARCH)gcc
+CPP = ../$(COMPILER_PATH)/$(COMPILER_ARCH)g++
+LD = ../$(COMPILER_PATH)/$(COMPILER_ARCH)ld
+AS = ../$(COMPILER_PATH)/$(COMPILER_ARCH)as
+NM = ../$(COMPILER_PATH)/$(COMPILER_ARCH)nm
+OBJCOPY = ../$(COMPILER_PATH)/$(COMPILER_ARCH)objcopy
+OBJDUMP = ../$(COMPILER_PATH)/$(COMPILER_ARCH)objdump
+GDB = ../$(COMPILER_PATH)/$(COMPILER_ARCH)gdb
+RUSTC = /usr/bin/rustc
+NASM = /usr/bin/nasm
+
+RUST_TARGET_PATH = Architecture/$(OSARCH)/rust-target.json
+
+GIT_COMMIT = $(shell git rev-parse HEAD)
+GIT_COMMIT_SHORT = $(shell git rev-parse --short HEAD)
+
+BMP_SOURCES = $(shell find ./ -type f -name '*.bmp')
+PSF_SOURCES = $(shell find ./ -type f -name '*.psf')
+ifeq ($(OSARCH), amd64)
+ASM_SOURCES = $(shell find ./ -type f -name '*.asm' -not -path "./Architecture/i386/*" -not -path "./Architecture/aarch64/*")
+S_SOURCES = $(shell find ./ -type f -name '*.S' -not -path "./Architecture/i386/*" -not -path "./Architecture/aarch64/*")
+C_SOURCES = $(shell find ./ -type f -name '*.c' -not -path "./Architecture/i386/*" -not -path "./Architecture/aarch64/*")
+CPP_SOURCES = $(shell find ./ -type f -name '*.cpp' -not -path "./Architecture/i386/*" -not -path "./Architecture/aarch64/*")
+RS_SOURCES = $(shell find ./ -type f -name '*.rs' -not -path "./Architecture/i386/*" -not -path "./Architecture/aarch64/*")
+else ifeq ($(OSARCH), i386)
+ASM_SOURCES = $(shell find ./ -type f -name '*.asm' -not -path "./Architecture/amd64/*" -not -path "./Architecture/aarch64/*")
+S_SOURCES = $(shell find ./ -type f -name '*.S' -not -path "./Architecture/amd64/*" -not -path "./Architecture/aarch64/*")
+C_SOURCES = $(shell find ./ -type f -name '*.c' -not -path "./Architecture/amd64/*" -not -path "./Architecture/aarch64/*")
+CPP_SOURCES = $(shell find ./ -type f -name '*.cpp' -not -path "./Architecture/amd64/*" -not -path "./Architecture/aarch64/*")
+RS_SOURCES = $(shell find ./ -type f -name '*.rs' -not -path "./Architecture/amd64/*" -not -path "./Architecture/aarch64/*")
+else ifeq ($(OSARCH), aarch64)
+ASM_SOURCES = $(shell find ./ -type f -name '*.asm' -not -path "./Architecture/amd64/*" -not -path "./Architecture/i386/*")
+S_SOURCES = $(shell find ./ -type f -name '*.S' -not -path "./Architecture/amd64/*" -not -path "./Architecture/i386/*")
+C_SOURCES = $(shell find ./ -type f -name '*.c' -not -path "./Architecture/amd64/*" -not -path "./Architecture/i386/*")
+CPP_SOURCES = $(shell find ./ -type f -name '*.cpp' -not -path "./Architecture/amd64/*" -not -path "./Architecture/i386/*")
+RS_SOURCES = $(shell find ./ -type f -name '*.rs' -not -path "./Architecture/amd64/*" -not -path "./Architecture/i386/*")
+endif
+HEADERS = $(sort $(dir $(wildcard ./include/*))) $(sort $(dir $(wildcard ./include_std/*)))
+OBJ = $(C_SOURCES:.c=.o) $(CPP_SOURCES:.cpp=.o) $(RS_SOURCES:.rs=.o) $(ASM_SOURCES:.asm=.o) $(S_SOURCES:.S=.o) $(PSF_SOURCES:.psf=.o) $(BMP_SOURCES:.bmp=.o)
+STACK_USAGE_OBJ = $(C_SOURCES:.c=.su) $(CPP_SOURCES:.cpp=.su)
+GCNO_OBJ = $(C_SOURCES:.c=.gcno) $(CPP_SOURCES:.cpp=.gcno)
+INCLUDE_DIR = -I./include -I./include_std
+
+LDFLAGS := -Wl,-Map kernel.map -shared -nostdlib -nodefaultlibs -nolibc
+
+# Disable all warnings by adding "-w" in WARNCFLAG and if you want to treat the warnings as errors, add "-Werror"
+WARNCFLAG = -Wall -Wextra \
+			-Wfloat-equal -Wpointer-arith -Wcast-align \
+			-Wredundant-decls -Winit-self -Wswitch-default \
+			-Wstrict-overflow=5 -Wconversion
+
+# https://gcc.gnu.org/onlinedocs/gcc/x86-Options.html
+CFLAGS :=										\
+	$(INCLUDE_DIR)								\
+	-DKERNEL_NAME='"$(OSNAME)"' 				\
+	-DKERNEL_VERSION='"$(KERNEL_VERSION)"'		\
+	-DGIT_COMMIT='"$(GIT_COMMIT)"'				\
+	-DGIT_COMMIT_SHORT='"$(GIT_COMMIT_SHORT)"'
+
+SIMD_FLAGS := -msse -msse2 -msse3 -mssse3 -msse4.1 -msse4.2 -mavx -mavx2 -mavx512f
+
+ifeq ($(OSARCH), amd64)
+
+CFLAGS += -fno-pic -fno-pie					\
+		  -mno-red-zone -march=core2 -pipe	\
+		  -mcmodel=kernel -fno-builtin -Da64 -Da86
+CFLAG_STACK_PROTECTOR := -fstack-protector-all
+LDFLAGS += -TArchitecture/amd64/linker.ld 	\
+	-fno-pic -fno-pie 						\
+	-Wl,-static,--no-dynamic-linker,-ztext 	\
+	-nostdlib -nodefaultlibs -nolibc  		\
+	-zmax-page-size=0x1000					\
+	-Wl,-Map kernel.map -shared
+
+else ifeq ($(OSARCH), i386)
+
+CFLAGS += -fno-pic -fno-pie -mno-80387 -mno-mmx -mno-3dnow	\
+		  -mno-red-zone -march=pentium -pipe -msoft-float	\
+		  -fno-builtin -Da32 -Da86
+CFLAG_STACK_PROTECTOR := -fstack-protector-all
+LDFLAGS += -TArchitecture/i386/linker.ld 	\
+	-fno-pic -fno-pie 						\
+	-Wl,-static,--no-dynamic-linker,-ztext 	\
+	-nostdlib -nodefaultlibs -nolibc  		\
+	-zmax-page-size=0x1000					\
+	-Wl,-Map kernel.map -shared
+
+else ifeq ($(OSARCH), aarch64)
+
+CFLAGS += -pipe -fno-builtin -Wstack-protector -Daa64 -fPIC -mno-outline-atomics
+CFLAG_STACK_PROTECTOR := -fstack-protector-all
+LDFLAGS += -TArchitecture/aarch64/linker.ld -fPIC -pie \
+	-Wl,-static,--no-dynamic-linker,-ztext \
+	-nostdlib -nodefaultlibs -nolibc \
+	-zmax-page-size=0x1000 \
+	-Wl,-Map kernel.map -static
+
+endif
+
+ifeq ($(OSARCH), amd64)
+NASMFLAGS := -f elf64
+else ifeq ($(OSARCH), i386)
+NASMFLAGS := -f elf32
+else ifeq ($(OSARCH), aarch64)
+NASMFLAGS :=
+endif
+
+# -finstrument-functions for __cyg_profile_func_enter & __cyg_profile_func_exit. Used for profiling and debugging.
+ifeq ($(DEBUG), 1)
+#	CFLAGS += --coverage
+#	CFLAGS += -pg
+#	CFLAGS += -finstrument-functions
+	CFLAGS += -DDEBUG -ggdb3 -O0 -fdiagnostics-color=always -fverbose-asm -fstack-usage -fsanitize=undefined
+ifneq ($(OSARCH), aarch64)
+	CFLAGS += -fstack-check
+endif
+	LDFLAGS += -ggdb3 -O0
+	NASMFLAGS += -F dwarf -g
+	WARNCFLAG += -Wno-unused-function -Wno-maybe-uninitialized -Wno-builtin-declaration-mismatch -Wno-unknown-pragmas -Wno-unused-parameter -Wno-unused-variable
+ifeq ($(TESTING), 1)
+	CFLAGS += -DTESTING
+endif
+endif
+
+default:
+	$(error Please specify a target)
+
+prepare:
+	$(info Nothing to prepare)
+
+build: $(KERNEL_FILENAME)
+
+dump:
+ifeq (,$(wildcard $(KERNEL_FILENAME)))
+	$(error $(KERNEL_FILENAME) does not exist)
+endif
+	$(info Dumping $(KERNEL_FILENAME) in AT T syntax...)
+	$(OBJDUMP) -D -g -s -d $(KERNEL_FILENAME) > kernel_dump.map
+	$(info Dumping $(KERNEL_FILENAME) in Intel syntax...)
+	$(OBJDUMP) -M intel -D -g -s -d $(KERNEL_FILENAME) > kernel_dump_intel.map
+
+$(KERNEL_FILENAME): $(OBJ)
+	$(info Linking $@)
+	$(CC) $(LDFLAGS) $(OBJ) -o $@
+
+%.o: %.c $(HEADERS)
+	$(info Compiling $<)
+	$(CC) $(CFLAGS) $(CFLAG_STACK_PROTECTOR) $(WARNCFLAG) -std=c17 -c $< -o $@
+
+# https://gcc.gnu.org/projects/cxx-status.html
+%.o: %.cpp $(HEADERS)
+	$(info Compiling $<)
+	$(CPP) $(CFLAGS) $(CFLAG_STACK_PROTECTOR) $(WARNCFLAG) -std=c++20 -fexceptions -c $< -o $@ -fno-rtti
+
+%.o: %.rs $(HEADERS) $(RUST_TARGET_PATH)
+	$(info Compiling $<)
+	$(RUSTC) $< -C panic=abort -C soft-float --emit=obj -o $@
+
+%.o: %.asm
+ifeq ($(OSARCH), aarch64)
+	$(error aarch64 does not support NASM)
+endif
+	$(info Compiling $<)
+	$(NASM) $< $(NASMFLAGS) -o $@
+
+%.o: %.S
+	$(info Compiling $<)
+	$(AS) -c $< -o $@
+
+%.o: %.psf
+ifeq ($(OSARCH), amd64)
+	$(OBJCOPY) -O elf64-x86-64 -I binary $< $@
+else ifeq ($(OSARCH), i386)
+	$(OBJCOPY) -O elf32-i386 -I binary $< $@
+else ifeq ($(OSARCH), aarch64)
+	$(OBJCOPY) -O elf64-littleaarch64 -I binary $< $@
+endif
+	$(NM) $@
+
+%.o: %.bmp
+ifeq ($(OSARCH), amd64)
+	$(OBJCOPY) -O elf64-x86-64 -I binary $< $@
+else ifeq ($(OSARCH), i386)
+	$(OBJCOPY) -O elf32-i386 -I binary $< $@
+else ifeq ($(OSARCH), aarch64)
+	$(OBJCOPY) -O elf64-littlearch64 -I binary $< $@
+endif
+	$(NM) $@
+
+clean:
+	rm -f *.bin *.o *.elf *.sym kernel.map kernel_dump.map kernel_dump_intel.map $(OBJ) $(STACK_USAGE_OBJ) $(GCNO_OBJ) $(KERNEL_FILENAME)
diff --git a/Kernel/Network/AddressResolutionProtocol.cpp b/Kernel/Network/AddressResolutionProtocol.cpp
new file mode 100644
index 00000000..539b74ec
--- /dev/null
+++ b/Kernel/Network/AddressResolutionProtocol.cpp
@@ -0,0 +1,245 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/arp.hpp>
+#include <debug.h>
+#include <smart_ptr.hpp>
+
+#include "../kernel.h"
+
+/* conversion from ‘uint48_t’ {aka ‘long unsigned int’} to ‘long unsigned int:48’ may change value */
+#pragma GCC diagnostic ignored "-Wconversion"
+
+namespace NetworkARP
+{
+    DiscoveredAddress *ARP::ManageDiscoveredAddresses(DAType Type, InternetProtocol IP, MediaAccessControl MAC)
+    {
+        switch (Type)
+        {
+        case DA_ADD:
+        {
+            DiscoveredAddress *tmp = new DiscoveredAddress;
+            tmp->IP = IP;
+            tmp->MAC = MAC;
+            DiscoveredAddresses.push_back(tmp);
+            netdbg("Added %s to discovered addresses", IP.v4.ToStringLittleEndian());
+            return tmp;
+        }
+        case DA_DEL:
+        {
+            for (size_t i = 0; i < DiscoveredAddresses.size(); i++)
+            {
+                if (DiscoveredAddresses[i]->IP.v4 == IP.v4)
+                {
+                    DiscoveredAddress *tmp = DiscoveredAddresses[i];
+                    netdbg("Removed %s from discovered addresses", IP.v4.ToStringLittleEndian());
+                    delete tmp, tmp = nullptr;
+                    DiscoveredAddresses.remove(i);
+                    break;
+                }
+            }
+            return nullptr;
+        }
+        case DA_SEARCH:
+        {
+            for (size_t i = 0; i < DiscoveredAddresses.size(); i++)
+            {
+                if (DiscoveredAddresses[i]->IP.v4 == IP.v4)
+                {
+                    netdbg("Found %s in discovered addresses", IP.v4.ToStringLittleEndian());
+                    return DiscoveredAddresses[i];
+                }
+            }
+            return nullptr;
+        }
+        case DA_UPDATE:
+        {
+            for (size_t i = 0; i < DiscoveredAddresses.size(); i++)
+            {
+                if (DiscoveredAddresses[i]->IP.v4 == IP.v4)
+                {
+                    DiscoveredAddresses[i]->MAC = MAC;
+                    netdbg("Updated %s in discovered addresses", IP.v4.ToStringLittleEndian());
+                    return DiscoveredAddresses[i];
+                }
+            }
+            return nullptr;
+        }
+        default:
+        {
+            return nullptr;
+        }
+        }
+        return nullptr;
+    }
+
+    ARP::ARP(NetworkEthernet::Ethernet *Ethernet) : NetworkEthernet::EthernetEvents(NetworkEthernet::TYPE_ARP)
+    {
+        debug("ARP interface %#lx created.", this);
+        this->Ethernet = Ethernet;
+    }
+
+    ARP::~ARP()
+    {
+        debug("ARP interface %#lx destroyed.", this);
+    }
+
+    MediaAccessControl InvalidMAC;
+    InternetProtocol InvalidIP;
+    DiscoveredAddress InvalidRet = {.MAC = InvalidMAC, .IP = InvalidIP};
+
+    DiscoveredAddress *ARP::Search(InternetProtocol TargetIP)
+    {
+        DiscoveredAddress *ret = ManageDiscoveredAddresses(DA_SEARCH, TargetIP, MediaAccessControl());
+        if (ret)
+            return ret;
+        warn("No address found for %s", TargetIP.v4.ToStringLittleEndian());
+        return &InvalidRet;
+    }
+
+    DiscoveredAddress *ARP::Update(InternetProtocol TargetIP, MediaAccessControl TargetMAC)
+    {
+        DiscoveredAddress *ret = ManageDiscoveredAddresses(DA_UPDATE, TargetIP, TargetMAC);
+        if (ret)
+            return ret;
+        warn("No address found for %s", TargetIP.v4.ToStringLittleEndian());
+        return &InvalidRet;
+    }
+
+    uint48_t ARP::Resolve(InternetProtocol IP)
+    {
+        netdbg("Resolving %s", IP.v4.ToStringLittleEndian());
+        if (IP.v4 == 0xFFFFFFFF)
+            return 0xFFFFFFFFFFFF;
+
+        /* If we can't find the MAC, return the default value which is 0xFFFFFFFFFFFF. */
+        uint48_t ret = this->Search(IP)->MAC.ToHex();
+        netdbg("Resolved %s to %lx", IP.v4.ToStringLittleEndian(), ret);
+
+        if (ret == 0xFFFFFFFFFFFF)
+        {
+            netdbg("Sending request");
+            /* If we can't find the MAC, send a request.
+               Because we are going to send this over the network, we need to byteswap first.
+               This is actually very confusing for me. */
+            ARPHeader *Header = new ARPHeader;
+            Header->HardwareType = b16(ARPHardwareType::HTYPE_ETHERNET);
+            Header->ProtocolType = b16(NetworkEthernet::FrameType::TYPE_IPV4);
+            Header->HardwareSize = b8(6);
+            Header->ProtocolSize = b8(4);
+            Header->Operation = b16(ARPOperation::REQUEST);
+            Header->SenderMAC = b48(Ethernet->GetInterface()->MAC.ToHex());
+            Header->SenderIP = b32(Ethernet->GetInterface()->IP.v4.ToHex());
+            Header->TargetMAC = b48(0xFFFFFFFFFFFF);
+            Header->TargetIP = b32(IP.v4.ToHex());
+            netdbg("SIP: %s; TIP: %s", InternetProtocol().v4.FromHex(Header->SenderIP).ToStringLittleEndian(),
+                   InternetProtocol().v4.FromHex(Header->TargetIP).ToStringLittleEndian());
+            /* Send the request to the broadcast MAC address. */
+            Ethernet->Send({.Address = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF}}, NetworkEthernet::FrameType::TYPE_ARP, (uint8_t *)Header, sizeof(ARPHeader));
+            delete Header, Header = nullptr;
+        }
+
+        int RequestTimeout = 20;
+        debug("Waiting for response");
+        while (ret == 0xFFFFFFFFFFFF)
+        {
+            ret = this->Search(IP)->MAC.ToHex();
+            if (--RequestTimeout == 0)
+            {
+                warn("Request timeout.");
+                return 0;
+            }
+            netdbg("Still waiting...");
+            TaskManager->Sleep(1000);
+        }
+
+        return ret;
+    }
+
+    void ARP::Broadcast(InternetProtocol IP)
+    {
+        netdbg("Sending broadcast");
+        uint48_t ResolvedMAC = this->Resolve(IP);
+        ARPHeader *Header = new ARPHeader;
+        Header->HardwareType = b16(ARPHardwareType::HTYPE_ETHERNET);
+        Header->ProtocolType = b16(NetworkEthernet::FrameType::TYPE_IPV4);
+        Header->HardwareSize = b8(0x6);
+        Header->ProtocolSize = b8(0x4);
+        Header->Operation = b16(ARPOperation::REQUEST);
+        Header->SenderMAC = b48(Ethernet->GetInterface()->MAC.ToHex());
+        Header->SenderIP = b32(Ethernet->GetInterface()->IP.v4.ToHex());
+        Header->TargetMAC = b48(ResolvedMAC);
+        Header->TargetIP = b32(IP.v4.ToHex());
+        Ethernet->Send(MediaAccessControl().FromHex(ResolvedMAC), NetworkEthernet::FrameType::TYPE_ARP, (uint8_t *)Header, sizeof(ARPHeader));
+        delete Header, Header = nullptr;
+    }
+
+    bool ARP::OnEthernetPacketReceived(uint8_t *Data, uint64_t Length)
+    {
+        UNUSED(Length);
+        netdbg("Received packet");
+        ARPHeader *Header = (ARPHeader *)Data;
+
+        InternetProtocol SenderIPv4;
+        SenderIPv4.v4 = SenderIPv4.v4.FromHex(b32(Header->SenderIP));
+
+        /* We only support Ethernet and IPv4. */
+        if (b16(Header->HardwareType) != ARPHardwareType::HTYPE_ETHERNET || b16(Header->ProtocolType) != NetworkEthernet::FrameType::TYPE_IPV4)
+        {
+            warn("Invalid hardware/protocol type (%d/%d)", b16(Header->HardwareType), b16(Header->ProtocolType));
+            return false;
+        }
+
+        InternetProtocol TmpIPStruct;
+        InternetProtocol().v4.FromHex(b32(Header->SenderIP));
+
+        if (ManageDiscoveredAddresses(DA_SEARCH, TmpIPStruct, MediaAccessControl().FromHex(b48(Header->SenderMAC))) == nullptr)
+        {
+            netdbg("Discovered new address %s", SenderIPv4.v4.ToStringLittleEndian());
+            TmpIPStruct.v4.FromHex(b32(Header->SenderIP));
+            ManageDiscoveredAddresses(DA_ADD, TmpIPStruct, MediaAccessControl().FromHex(b48(Header->SenderMAC)));
+        }
+        else
+        {
+            netdbg("Updated address %s", SenderIPv4.v4.ToStringLittleEndian());
+            TmpIPStruct.v4.FromHex(b32(Header->SenderIP));
+            ManageDiscoveredAddresses(DA_UPDATE, TmpIPStruct, MediaAccessControl().FromHex(b48(Header->SenderMAC)));
+        }
+
+        switch (b16(Header->Operation))
+        {
+        case ARPOperation::REQUEST:
+            netdbg("Received request from %s", SenderIPv4.v4.ToStringLittleEndian());
+            /* We need to byteswap before we send it back. */
+            Header->TargetMAC = b48(Header->SenderMAC);
+            Header->TargetIP = b32(Header->SenderIP);
+            Header->SenderMAC = b48(Ethernet->GetInterface()->MAC.ToHex());
+            Header->SenderIP = b32(Ethernet->GetInterface()->IP.v4.ToHex());
+            Header->Operation = b16(ARPOperation::REPLY);
+            Ethernet->Send(MediaAccessControl().FromHex(Header->TargetMAC), NetworkEthernet::FrameType::TYPE_ARP, (uint8_t *)Header, sizeof(ARPHeader));
+            netdbg("Sent request for %s", SenderIPv4.v4.ToStringLittleEndian());
+            break;
+        case ARPOperation::REPLY:
+            fixme("Received reply from %s", SenderIPv4.v4.ToStringLittleEndian());
+            break;
+        default:
+            warn("Invalid operation (%d)", b16(Header->Operation));
+            break;
+        }
+        return false;
+    }
+}
diff --git a/Kernel/Network/Checksum.cpp b/Kernel/Network/Checksum.cpp
new file mode 100644
index 00000000..7b317a77
--- /dev/null
+++ b/Kernel/Network/Checksum.cpp
@@ -0,0 +1,31 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/net.hpp>
+
+uint16_t CalculateChecksum(uint16_t *Data, uint64_t Length)
+{
+    uint16_t *Data16 = (uint16_t *)Data;
+    uint64_t Checksum = 0;
+    for (uint64_t i = 0; i < Length / 2; i++)
+        Checksum += ((Data16[i] & 0xFF00) >> 8) | ((Data16[i] & 0x00FF) << 8);
+    if (Length % 2)
+        Checksum += ((uint16_t)((char *)Data16)[Length - 1]) << 8;
+    while (Checksum & 0xFFFF0000)
+        Checksum = (Checksum & 0xFFFF) + (Checksum >> 16);
+    return (uint16_t)(((~Checksum & 0xFF00) >> 8) | ((~Checksum & 0x00FF) << 8));
+}
diff --git a/Kernel/Network/DomainNameSystem.cpp b/Kernel/Network/DomainNameSystem.cpp
new file mode 100644
index 00000000..46593bcf
--- /dev/null
+++ b/Kernel/Network/DomainNameSystem.cpp
@@ -0,0 +1,35 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/dns.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkDNS
+{
+    DNS::DNS(NetworkUDP::Socket *Socket) : NetworkUDP::UDPEvents()
+    {
+        debug("DNS interface %#lx created.", this);
+        this->UDPSocket = Socket;
+    }
+
+    DNS::~DNS()
+    {
+        debug("DNS interface %#lx destroyed.", this);
+    }
+}
diff --git a/Kernel/Network/DynamicHostConfigurationProtocol.cpp b/Kernel/Network/DynamicHostConfigurationProtocol.cpp
new file mode 100644
index 00000000..334efc4b
--- /dev/null
+++ b/Kernel/Network/DynamicHostConfigurationProtocol.cpp
@@ -0,0 +1,186 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/dhcp.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkDHCP
+{
+    DHCP::DHCP(NetworkUDP::Socket *Socket, NetworkInterfaceManager::DeviceInterface *Interface)
+    {
+        debug("DHCP interface %#lx created.", this);
+        this->UDPSocket = Socket;
+        this->Interface = Interface;
+        Socket->LocalPort = b16(68);
+
+        InternetProtocol::Version4 DefaultIPv4 = {.Address = {0x0, 0x0, 0x0, 0x0}};
+        InternetProtocol::Version6 DefaultIPv6 = {.Address = {0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0}};
+
+        this->IP.v4 = DefaultIPv4;
+        this->IP.v6 = DefaultIPv6;
+
+        this->Gateway.v4 = DefaultIPv4;
+        this->Gateway.v6 = DefaultIPv6;
+
+        this->SubNetworkMask.v4 = DefaultIPv4;
+        this->SubNetworkMask.v6 = DefaultIPv6;
+
+        this->DomainNameSystem.v4 = DefaultIPv4;
+        this->DomainNameSystem.v6 = DefaultIPv6;
+    }
+
+    DHCP::~DHCP()
+    {
+        debug("DHCP interface %#lx destroyed.", this);
+    }
+
+    void DHCP::CreatePacket(DHCPHeader *Packet, uint8_t MessageType, uint32_t RequestIP)
+    {
+        Packet->Opcode = b8(DHCP_OP_BOOTREQUEST);
+        Packet->HardwareType = b8(1);
+        Packet->HardwareAddressLength = b8(6);
+        Packet->Hops = b8(0);
+        Packet->TransactionID = b32(DHCP_TRANSACTION_ID);
+        Packet->Flags = b16(0x40);
+        uint48_t InterfaceMAC = b48(Interface->MAC.ToHex());
+        memcpy(Packet->ClientHardwareAddress, &InterfaceMAC, sizeof(InterfaceMAC));
+
+        uint8_t *Ptr = Packet->Options;
+        *((uint32_t *)(Ptr)) = b32(0x63825363); // Magic Cookie
+        Ptr += 4;
+
+        *(Ptr++) = DHCP_OPTION_MESSAGE_TYPE;
+        *(Ptr++) = DHCP_MESSAGE_TYPE_DISCOVER;
+        *(Ptr++) = MessageType;
+
+        *(Ptr++) = DHCP_OPTION_CLIENT_IDENTIFIER;
+        *(Ptr++) = 0x07;
+        *(Ptr++) = 0x01;
+        memcpy(Ptr, &InterfaceMAC, sizeof(InterfaceMAC));
+        Ptr += 6;
+
+        *(Ptr++) = DHCP_OPTION_REQUESTED_IP;
+        *(Ptr++) = 0x04;
+        *((uint32_t *)(Ptr)) = b32(0x0a00020e);
+        memcpy((uint32_t *)(Ptr), &RequestIP, 4);
+        Ptr += 4;
+
+        *(Ptr++) = DHCP_OPTION_HOST_NAME;
+        char *HostName = (char *)KERNEL_NAME;
+        *(Ptr++) = s_cst(uint8_t, 1 + strlen(HostName));
+        memcpy(Ptr, HostName, strlen(HostName));
+        Ptr += strlen(HostName);
+
+        *(Ptr++) = DHCP_OPTION_PAD;
+
+        *(Ptr++) = DHCP_OPTION_PARAMETER_REQUEST_LIST;
+        *(Ptr++) = DHCP_OPTION_COOKIE_SERVER;
+        *(Ptr++) = DHCP_OPTION_SUBNETMASK;
+        *(Ptr++) = DHCP_OPTION_ROUTER;
+        *(Ptr++) = DHCP_OPTION_DOMAIN_NAME_SERVER;
+        *(Ptr++) = DHCP_OPTION_DOMAIN_NAME;
+        *(Ptr++) = DHCP_OPTION_NETBIOS_NAME_SERVERS;
+        *(Ptr++) = DHCP_OPTION_NETBIOS_NODE_TYPE;
+        *(Ptr++) = DHCP_OPTION_NETBIOS_SCOPE;
+        *(Ptr++) = DHCP_OPTION_MAX_MESSAGE_SIZE;
+
+        *(Ptr++) = DHCP_OPTION_END;
+    }
+
+    void DHCP::Request()
+    {
+        netdbg("Requesting IP address");
+        DHCPHeader packet;
+        memset(&packet, 0, sizeof(DHCPHeader));
+
+        CreatePacket(&packet, DHCP_MESSAGE_TYPE_DISCOVER, 0x00000000);
+        this->UDPSocket->SocketUDP->Send(this->UDPSocket, (uint8_t *)&packet, sizeof(DHCPHeader));
+
+        debug("Waiting for response...");
+        int RequestTimeout = 20;
+        while (!Received)
+        {
+            if (--RequestTimeout == 0)
+            {
+                warn("Request timeout.");
+                break;
+            }
+            netdbg("Still waiting...");
+            TaskManager->Sleep(1000);
+        }
+    }
+
+    void DHCP::Request(InternetProtocol IP)
+    {
+        netdbg("Requesting IP address %s", IP.v4.ToStringLittleEndian());
+        DHCPHeader packet;
+        memset(&packet, 0, sizeof(DHCPHeader));
+
+        /* CreatePacket() accepts IP as MSB */
+        CreatePacket(&packet, DHCP_MESSAGE_TYPE_REQUEST, b32(IP.v4.ToHex()));
+        UDPSocket->SocketUDP->Send(UDPSocket, (uint8_t *)&packet, sizeof(DHCPHeader));
+    }
+
+    void *DHCP::GetOption(DHCPHeader *Packet, uint8_t Type)
+    {
+        uint8_t *Option = Packet->Options + 4;
+        uint8_t Current = *Option;
+        while (Current != 0xFF)
+        {
+            uint8_t OptionLength = *(Option + 1);
+            if (Current == Type)
+                return Option + 2;
+            Option += (2 + OptionLength);
+            Current = *Option;
+        }
+        warn("Option %#x not found", Type);
+        return nullptr;
+    }
+
+    void DHCP::OnUDPPacketReceived(NetworkUDP::Socket *Socket, uint8_t *Data, uint64_t Length)
+    {
+        UNUSED(Socket);
+        UNUSED(Length);
+        DHCPHeader *Packet = (DHCPHeader *)Data;
+        uint8_t *MessageType = (uint8_t *)GetOption(Packet, DHCP_OPTION_MESSAGE_TYPE);
+
+        switch (*MessageType)
+        {
+        case DHCP_OPTION_TIME_OFFSET:
+        {
+            InternetProtocol ReqIP;
+            ReqIP.v4.FromHex(b32(Packet->YourIP));
+            netdbg("Received DHCP offer for IP %s", ReqIP.v4.ToStringLittleEndian());
+            this->Request(ReqIP);
+            break;
+        }
+        case DHCP_OPTION_NAME_SERVER:
+            this->IP.v4.FromHex(b32(Packet->YourIP));
+            this->Gateway.v4.FromHex(b32((uint32_t)(*(uintptr_t *)GetOption(Packet, DHCP_OPTION_ROUTER))));
+            this->DomainNameSystem.v4.FromHex(b32((uint32_t)(*(uintptr_t *)GetOption(Packet, DHCP_OPTION_DOMAIN_NAME_SERVER))));
+            this->SubNetworkMask.v4.FromHex(b32((uint32_t)(*(uintptr_t *)GetOption(Packet, DHCP_OPTION_SUBNETMASK))));
+            this->Received = true;
+            netdbg("Received DHCP ACK for IP %s", this->IP.v4.ToStringLittleEndian());
+            break;
+        default:
+            warn("Received unknown message type %#x", *MessageType);
+            break;
+        }
+    }
+}
diff --git a/Kernel/Network/Ethernet.cpp b/Kernel/Network/Ethernet.cpp
new file mode 100644
index 00000000..e2aad974
--- /dev/null
+++ b/Kernel/Network/Ethernet.cpp
@@ -0,0 +1,148 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/eth.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+/* conversion from ‘uint48_t’ {aka ‘long unsigned int’} to ‘long unsigned int:48’ may change value */
+#pragma GCC diagnostic ignored "-Wconversion"
+
+namespace NetworkEthernet
+{
+    struct EthernetEventHelperStruct
+    {
+        EthernetEvents *Ptr;
+        uint16_t Type;
+    };
+
+    std::vector<EthernetEventHelperStruct> RegisteredEvents;
+
+    Ethernet::Ethernet(NetworkInterfaceManager::DeviceInterface *Interface) : NetworkInterfaceManager::Events(Interface)
+    {
+        debug("Ethernet interface %#lx created.", this);
+        this->Interface = Interface;
+    }
+    Ethernet::~Ethernet()
+    {
+        debug("Ethernet interface %#lx destroyed.", this);
+    }
+
+    void Ethernet::Send(MediaAccessControl MAC, FrameType Type, uint8_t *Data, uint64_t Length)
+    {
+        netdbg("Sending frame type %#x to %s", Type, MAC.ToString());
+        size_t PacketLength = sizeof(EthernetHeader) + Length;
+        EthernetPacket *Packet = (EthernetPacket *)kmalloc(PacketLength);
+
+        Packet->Header.DestinationMAC = b48(MAC.ToHex());
+        Packet->Header.SourceMAC = b48(this->Interface->MAC.ToHex());
+        Packet->Header.Type = b16(Type);
+
+        memcpy(Packet->Data, Data, Length);
+        /* Network Interface Manager takes care of physical allocation.
+           So basically, we allocate here and then it allocates again but 1:1 mapped. */
+        NIManager->Send(Interface, (uint8_t *)Packet, PacketLength);
+        kfree(Packet);
+    }
+
+    void Ethernet::Receive(uint8_t *Data, uint64_t Length)
+    {
+        EthernetPacket *Packet = (EthernetPacket *)Data;
+        size_t PacketLength = Length - sizeof(EthernetHeader);
+        /* TODO: I have to do checks here to be sure that PacketLength is right */
+        UNUSED(PacketLength);
+
+        MediaAccessControl SourceMAC;
+        SourceMAC.FromHex(b48(Packet->Header.SourceMAC));
+        MediaAccessControl DestinationMAC;
+        DestinationMAC.FromHex(b48(Packet->Header.DestinationMAC));
+
+        netdbg("Received frame type %#x from %s to %s", b16(Packet->Header.Type), SourceMAC.ToString(), DestinationMAC.ToString());
+
+        /*                 Byte-swapped               little-endian                   */
+        if (b48(Packet->Header.DestinationMAC) == 0xFFFFFFFFFFFF ||
+            /*                 Byte-swapped           Driver interface has little-endian order */
+            b48(Packet->Header.DestinationMAC) == this->Interface->MAC.ToHex())
+        /* This is true only if the packet is for us (Interface MAC or broadcast) */
+        {
+            netdbg("Received data from %s [Type %#x]", SourceMAC.ToString(), b16(Packet->Header.Type));
+            bool Reply = false;
+
+            switch (b16(Packet->Header.Type))
+            {
+            case TYPE_IPV4:
+                foreach (auto e in RegisteredEvents)
+                    if (e.Type == TYPE_IPV4)
+                        Reply = e.Ptr->OnEthernetPacketReceived((uint8_t *)Packet->Data, Length);
+                break;
+            case TYPE_ARP:
+                foreach (auto e in RegisteredEvents)
+                    if (e.Type == TYPE_ARP)
+                        Reply = e.Ptr->OnEthernetPacketReceived((uint8_t *)Packet->Data, Length);
+                break;
+            case TYPE_RARP:
+                foreach (auto e in RegisteredEvents)
+                    if (e.Type == TYPE_RARP)
+                        Reply = e.Ptr->OnEthernetPacketReceived((uint8_t *)Packet->Data, Length);
+                break;
+            case TYPE_IPV6:
+                foreach (auto e in RegisteredEvents)
+                    if (e.Type == TYPE_IPV6)
+                        Reply = e.Ptr->OnEthernetPacketReceived((uint8_t *)Packet->Data, Length);
+                break;
+            default:
+                warn("Unknown packet type %#lx", Packet->Header.Type);
+                break;
+            }
+            if (Reply)
+            {
+                /* FIXME: I should reply, right? I have to do more research here... */
+                // Packet->Header.DestinationMAC = Packet->Header.SourceMAC;
+                // Packet->Header.SourceMAC = b48(this->Interface->MAC.ToHex());
+                fixme("Replying to %s [%s]=>[%s]", SourceMAC.ToString(),
+                      this->Interface->MAC.ToString(), DestinationMAC.ToString());
+            }
+        }
+        else
+        {
+            netdbg("Packet not for us [%s]=>[%s]", this->Interface->MAC.ToString(), DestinationMAC.ToString());
+        }
+    }
+
+    void Ethernet::OnInterfaceReceived(NetworkInterfaceManager::DeviceInterface *Interface, uint8_t *Data, uint64_t Length)
+    {
+        if (Interface == this->Interface)
+            this->Receive(Data, Length);
+    }
+
+    EthernetEvents::EthernetEvents(FrameType Type)
+    {
+        this->FType = Type;
+        RegisteredEvents.push_back({.Ptr = this, .Type = (uint16_t)Type});
+    }
+
+    EthernetEvents::~EthernetEvents()
+    {
+        for (size_t i = 0; i < RegisteredEvents.size(); i++)
+            if (RegisteredEvents[i].Ptr == this)
+            {
+                RegisteredEvents.remove(i);
+                return;
+            }
+    }
+}
diff --git a/Kernel/Network/InternetControlMessageProtocol.cpp b/Kernel/Network/InternetControlMessageProtocol.cpp
new file mode 100644
index 00000000..6ed70c5e
--- /dev/null
+++ b/Kernel/Network/InternetControlMessageProtocol.cpp
@@ -0,0 +1,77 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/icmpv4.hpp>
+#include <net/icmpv6.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkICMPv4
+{
+    ICMPv4::ICMPv4(NetworkInterfaceManager::DeviceInterface *Interface)
+    {
+        debug("ICMPv4 interface %#lx created.", this);
+        this->Interface = Interface;
+    }
+
+    ICMPv4::~ICMPv4()
+    {
+        debug("ICMPv4 interface %#lx destroyed.", this);
+    }
+
+    void ICMPv4::Send(/* ???? */)
+    {
+        fixme("Unimplemented");
+    }
+
+    void ICMPv4::Receive(ICMPPacket *Packet)
+    {
+        if (Packet->Header.Type == ICMPv4Type::TYPE_ECHO)
+        {
+            // TODO: This probably doesn't work
+            netdbg("Echo Request");
+            Packet->Header.Type = ICMPv4Type::TYPE_ECHO_REPLY;
+            Packet->Header.Code = 0x0;
+            Packet->Header.Checksum = CalculateChecksum((uint16_t *)Packet, sizeof(ICMPHeader));
+            NIManager->Send(this->Interface, (uint8_t *)Packet, sizeof(ICMPHeader) + 0);
+        }
+        else
+        {
+            netdbg("Unknown type %d", Packet->Header.Type);
+        }
+    }
+}
+
+namespace NetworkICMPv6
+{
+    ICMPv6::ICMPv6(NetworkInterfaceManager::DeviceInterface *Interface) { this->Interface = Interface; }
+    ICMPv6::~ICMPv6() {}
+
+    void ICMPv6::Send(uint8_t *Data, uint64_t Length)
+    {
+        UNUSED(Data);
+        UNUSED(Length);
+        fixme("Unimplemented");
+    }
+
+    void ICMPv6::Receive(uint8_t *Data)
+    {
+        UNUSED(Data);
+        fixme("Unimplemented");
+    }
+}
diff --git a/Kernel/Network/InternetProtocol.cpp b/Kernel/Network/InternetProtocol.cpp
new file mode 100644
index 00000000..9d8ff78d
--- /dev/null
+++ b/Kernel/Network/InternetProtocol.cpp
@@ -0,0 +1,142 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/ipv4.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkIPv4
+{
+    IPv4::IPv4(NetworkARP::ARP *ARP, NetworkEthernet::Ethernet *Ethernet) : NetworkEthernet::EthernetEvents(NetworkEthernet::TYPE_IPV4)
+    {
+        debug("IPv4 interface %#lx created.", this);
+        this->ARP = ARP;
+        this->Ethernet = Ethernet;
+    }
+
+    IPv4::~IPv4()
+    {
+        debug("IPv4 interface %#lx destroyed.", this);
+    }
+
+    void IPv4::Send(uint8_t *Data, uint64_t Length, uint8_t Protocol, InternetProtocol DestinationIP)
+    {
+        netdbg("Sending %ld bytes to %s", Length, DestinationIP.v4.ToStringLittleEndian());
+        IPv4Packet *Packet = (IPv4Packet *)kmalloc(Length + sizeof(IPv4Header));
+
+        /* This part is the most confusing one for me. */
+        Packet->Header.Version = b8(4);
+        Packet->Header.IHL = b8(sizeof(IPv4Header) / 4);
+        Packet->Header.TypeOfService = b8(0);
+        /* We don't byteswap. */
+        Packet->Header.TotalLength = s_cst(uint16_t, Length + sizeof(IPv4Header));
+        Packet->Header.TotalLength = s_cst(uint16_t, ((Packet->Header.TotalLength & 0xFF00) >> 8) | ((Packet->Header.TotalLength & 0x00FF) << 8));
+
+        Packet->Header.Identification = b16(0x0000);
+        Packet->Header.Flags = b8(0x0);
+        Packet->Header.FragmentOffset = b8(0x0);
+        Packet->Header.TimeToLive = b8(64);
+        Packet->Header.Protocol = b8(Protocol);
+        Packet->Header.DestinationIP = b32(DestinationIP.v4.ToHex());
+        Packet->Header.SourceIP = b32(Ethernet->GetInterface()->IP.v4.ToHex());
+        Packet->Header.HeaderChecksum = b16(0x0);
+        Packet->Header.HeaderChecksum = CalculateChecksum((uint16_t *)Packet, sizeof(IPv4Header));
+
+        memcpy(Packet->Data, Data, Length);
+        InternetProtocol DestinationRoute = DestinationIP;
+        if ((DestinationIP.v4.ToHex() & SubNetworkMaskIP.v4.ToHex()) != (b32(Packet->Header.SourceIP) & SubNetworkMaskIP.v4.ToHex()))
+            DestinationRoute = SubNetworkMaskIP;
+
+        Ethernet->Send(MediaAccessControl().FromHex(ARP->Resolve(DestinationRoute)), this->GetFrameType(), (uint8_t *)Packet, Length + sizeof(IPv4Header));
+        kfree(Packet);
+    }
+
+    std::vector<IPv4Events *> RegisteredEvents;
+
+    bool IPv4::OnEthernetPacketReceived(uint8_t *Data, uint64_t Length)
+    {
+        IPv4Packet *Packet = (IPv4Packet *)Data;
+        netdbg("Received %d bytes [Protocol %ld]", Length, Packet->Header.Protocol);
+        if (Length < sizeof(IPv4Header))
+        {
+            warn("Packet too short");
+            return false;
+        }
+
+        bool Reply = false;
+
+        if (b32(Packet->Header.DestinationIP) == Ethernet->GetInterface()->IP.v4.ToHex() || b32(Packet->Header.DestinationIP) == 0xFFFFFFFF || Ethernet->GetInterface()->IP.v4.ToHex() == 0)
+        {
+            uint64_t TotalLength = Packet->Header.TotalLength;
+            if (TotalLength > Length)
+                TotalLength = Length;
+
+            foreach (auto Event in RegisteredEvents)
+                if (Packet->Header.Protocol == Event->GetProtocol())
+                {
+                    InternetProtocol SourceIP;
+                    InternetProtocol DestinationIP;
+
+                    SourceIP.v4 = SourceIP.v4.FromHex(b32(Packet->Header.SourceIP));
+                    DestinationIP.v4 = DestinationIP.v4.FromHex(b32(Packet->Header.DestinationIP));
+
+                    if (Event->OnIPv4PacketReceived(SourceIP, DestinationIP, (uint8_t *)((uint64_t)Data + 4 * Packet->Header.IHL), TotalLength - 4 * Packet->Header.IHL))
+                        Reply = true;
+                }
+        }
+        else
+        {
+            netdbg("Not for us. We are %s but this is for %s",
+                   Ethernet->GetInterface()->IP.v4.ToHex(),
+                   Packet->Header.DestinationIP);
+        }
+
+        if (Reply)
+        {
+            uint32_t SwapIP = Packet->Header.DestinationIP;
+            Packet->Header.DestinationIP = Packet->Header.SourceIP;
+            Packet->Header.SourceIP = SwapIP;
+            Packet->Header.TimeToLive = 0x40;
+            Packet->Header.HeaderChecksum = 0x0;
+            Packet->Header.HeaderChecksum = CalculateChecksum((uint16_t *)Data, 4 * Packet->Header.TotalLength);
+            NIManager->Send(Ethernet->GetInterface(), (uint8_t *)Data, Length);
+        }
+        return Reply;
+    }
+
+    IPv4Events::IPv4Events(IPv4Protocols Protocol)
+    {
+        this->Protocol = (uint8_t)Protocol;
+        RegisteredEvents.push_back(this);
+    }
+
+    IPv4Events::~IPv4Events()
+    {
+        for (uint64_t i = 0; i < RegisteredEvents.size(); i++)
+            if (RegisteredEvents[i] == this)
+            {
+                RegisteredEvents.remove(i);
+                break;
+            }
+    }
+}
+
+namespace NetworkIPv6
+{
+
+}
diff --git a/Kernel/Network/NetworkController.cpp b/Kernel/Network/NetworkController.cpp
new file mode 100644
index 00000000..1b5dcb7f
--- /dev/null
+++ b/Kernel/Network/NetworkController.cpp
@@ -0,0 +1,250 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/nc.hpp>
+
+#include <net/ipv4.hpp>
+#include <net/dhcp.hpp>
+#include <net/eth.hpp>
+#include <net/arp.hpp>
+#include <net/ntp.hpp>
+#include <net/dns.hpp>
+#include <net/udp.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+#include "../DAPI.hpp"
+#include "../Fex.hpp"
+
+/* FIXME: The functions MUST have little endian parameters and return values. */
+
+namespace NetworkInterfaceManager
+{
+    std::vector<Events *> RegisteredEvents;
+
+    NetworkInterface::NetworkInterface()
+    {
+        mem = new Memory::MemMgr(nullptr, TaskManager->GetCurrentProcess()->memDirectory);
+        if (DriverManager->GetDrivers().size() > 0)
+        {
+            foreach (auto Driver in DriverManager->GetDrivers())
+                if (((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.Type == FexDriverType::FexDriverType_Network)
+                    this->FetchNetworkCards(Driver.DriverUID);
+        }
+        else
+            KPrint("\eE85230No network drivers found! Cannot fetch network cards!");
+
+        DbgNetwork();
+    }
+
+    NetworkInterface::~NetworkInterface()
+    {
+        debug("Destructor called");
+
+        // Stop the network stack
+        this->StopNetworkStack();
+
+        // Unregister all events
+        RegisteredEvents.clear();
+
+        foreach (auto inf in Interfaces)
+        {
+            if (inf)
+            {
+                Interfaces.remove(inf);
+                delete inf, inf = nullptr;
+            }
+        }
+
+        // Delete all interfaces and their callbacks and free the memory
+        delete mem, mem = nullptr;
+    }
+
+    void NetworkInterface::FetchNetworkCards(unsigned long DriverUID)
+    {
+        KernelCallback cb{};
+        cb.Reason = FetchReason;
+        DriverManager->IOCB(DriverUID, &cb);
+
+        DeviceInterface *Iface = (DeviceInterface *)mem->RequestPages(TO_PAGES(sizeof(DeviceInterface) + 1));
+        strcpy(Iface->Name, cb.NetworkCallback.Fetch.Name);
+        Iface->ID = this->CardIDs++;
+        Iface->MAC.FromHex(cb.NetworkCallback.Fetch.MAC);
+        Iface->DriverID = DriverUID;
+        Interfaces.push_back(Iface);
+
+        foreach (auto var in RegisteredEvents)
+            var->OnInterfaceAdded(Iface);
+
+        debug("Network Card: %s; MAC: %#lx", Iface->Name, Iface->MAC.ToHex());
+    }
+
+#ifdef DEBUG_NETWORK
+#define DbgWriteScreen(x, ...) KPrint(x, ##__VA_ARGS__)
+#else
+#define DbgWriteScreen(x, ...) debug(x, ##__VA_ARGS__)
+#endif
+
+    void NetworkInterface::StartNetworkStack()
+    {
+        TaskManager->GetCurrentThread()->SetPriority(Tasking::TaskPriority::Critical);
+        DeviceInterface *DefaultDevice = nullptr;
+        foreach (auto inf in Interfaces)
+            if (inf)
+            {
+                DefaultDevice = inf;
+                break;
+            }
+
+        if (!DefaultDevice)
+            error("No network device found!");
+        else
+        {
+            DbgWriteScreen("Using %s (%s) as the default network device", DefaultDevice->Name, DefaultDevice->MAC.ToString());
+            NetworkEthernet::Ethernet *eth = new NetworkEthernet::Ethernet(DefaultDevice); // Use the first device found as the ethernet device
+            NetworkARP::ARP *arp = new NetworkARP::ARP(eth);
+            NetworkIPv4::IPv4 *ipv4 = new NetworkIPv4::IPv4(arp, eth);
+            NetworkUDP::UDP *udp = new NetworkUDP::UDP(ipv4, DefaultDevice);
+            NetworkUDP::Socket *DHCP_Socket = udp->Connect(InternetProtocol() /* Default value is 255.255.255.255 */, 67);
+            NetworkDHCP::DHCP *dhcp = new NetworkDHCP::DHCP(DHCP_Socket, DefaultDevice);
+            debug("eth: %p; arp: %p; ipv4: %p; udp: %p; dhcp: %p", eth, arp, ipv4, udp, dhcp);
+            udp->Bind(DHCP_Socket, dhcp);
+            dhcp->Request();
+
+            DefaultDevice->IP.v4.FromHex(dhcp->IP.v4.ToHex());
+            ipv4->SubNetworkMaskIP = dhcp->SubNetworkMask;
+            ipv4->GatewayIP = dhcp->Gateway;
+            arp->Broadcast(dhcp->Gateway);
+            TaskManager->Sleep(200);
+            DbgWriteScreen("IP: %s", dhcp->IP.v4.ToStringLittleEndian());
+            DbgWriteScreen("SubNetwork Mask: %s", dhcp->SubNetworkMask.v4.ToStringLittleEndian());
+            DbgWriteScreen("Gateway: %s", dhcp->Gateway.v4.ToStringLittleEndian());
+            DbgWriteScreen("DNS: %s", dhcp->DomainNameSystem.v4.ToStringLittleEndian());
+            TaskManager->Sleep(200);
+
+            /* TODO: This is a quick workaround we need DNS resolver asap.
+
+            https://tf.nist.gov/tf-cgi/servers.cgi
+            https://www.ntppool.org
+
+            - 0.ro.pool.ntp.org ( {86, 127, 71, 168} )
+            - time-a-g.nist.gov ( {129, 6, 15, 28} )
+            */
+            // InternetProtocol ip = {.v4 = {.Address = {129, 6, 15, 28}},
+            //                        .v6 = {.Address = {}}};
+            // NetworkUDP::Socket *NTP_Socket = udp->Connect(ip, 123);
+            // NetworkNTP::NTP *ntp = new NetworkNTP::NTP(NTP_Socket);
+            // udp->Bind(NTP_Socket, ntp);
+            // int UnixTimestamp = ntp->ReadTime();
+            // Time::Clock time = Time::ConvertFromUnix(UnixTimestamp);
+            // DbgWriteScreen("NTP: %d - %d.%d.%d %d:%d:%d", time.Counter,
+            //                time.Day, time.Month, time.Year,
+            //                time.Hour, time.Minute, time.Second);
+            TaskManager->Sleep(200);
+
+            /* TODO: Store everything in an vector and initialize all network cards */
+        }
+
+        TaskManager->GetCurrentThread()->SetPriority(Tasking::TaskPriority::Idle);
+        CPU::Halt(true);
+    }
+
+    void NetworkInterface::StopNetworkStack()
+    {
+        fixme("Stop network stack");
+    }
+
+    ReadFSFunction(NetRead)
+    {
+        UNUSED(node);
+        UNUSED(Offset);
+        UNUSED(Size);
+        UNUSED(Buffer);
+        fixme("Not implemented.");
+        return Size;
+    }
+
+    WriteFSFunction(NetWrite)
+    {
+        UNUSED(node);
+        UNUSED(Offset);
+        UNUSED(Size);
+        UNUSED(Buffer);
+        fixme("Not implemented.");
+        return Size;
+    }
+
+    void CallStartNetworkStackWrapper() { NIManager->StartNetworkStack(); }
+
+    void NetworkInterface::StartService()
+    {
+        this->NetSvcThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (Tasking::IP)CallStartNetworkStackWrapper);
+        this->NetSvcThread->Rename("Network Service");
+    }
+
+    void NetworkInterface::DrvSend(unsigned int DriverID, unsigned char *Data, unsigned short Size)
+    {
+        foreach (auto inf in this->Interfaces)
+            if (inf->DriverID == DriverID)
+                NIManager->Send(inf, Data, Size);
+    }
+
+    void NetworkInterface::DrvReceive(unsigned int DriverID, unsigned char *Data, unsigned short Size)
+    {
+        foreach (auto inf in this->Interfaces)
+            if (inf->DriverID == DriverID)
+                NIManager->Receive(inf, Data, Size);
+    }
+
+    void NetworkInterface::Send(DeviceInterface *Interface, uint8_t *Data, uint64_t Length)
+    {
+        void *DataToBeSent = mem->RequestPages(TO_PAGES(Length + 1));
+        memcpy(DataToBeSent, Data, Length);
+
+        KernelCallback cb{};
+        cb.Reason = SendReason;
+        cb.NetworkCallback.Send.Data = (uint8_t *)DataToBeSent;
+        cb.NetworkCallback.Send.Length = Length;
+        DriverManager->IOCB(Interface->DriverID, &cb);
+
+        mem->FreePages(DataToBeSent, TO_PAGES(Length + 1));
+        foreach (auto var in RegisteredEvents)
+            var->OnInterfaceSent(Interface, Data, Length);
+    }
+
+    void NetworkInterface::Receive(DeviceInterface *Interface, uint8_t *Data, uint64_t Length)
+    {
+        foreach (auto re in RegisteredEvents)
+            re->OnInterfaceReceived(Interface, Data, Length);
+    }
+
+    Events::Events(DeviceInterface *Interface)
+    {
+        UNUSED(Interface);
+        RegisteredEvents.push_back(this);
+    }
+
+    Events::~Events()
+    {
+        for (size_t i = 0; i < RegisteredEvents.size(); i++)
+            if (RegisteredEvents[i] == this)
+            {
+                RegisteredEvents.remove(i);
+                return;
+            }
+    }
+}
diff --git a/Kernel/Network/NetworkDebugger.cpp b/Kernel/Network/NetworkDebugger.cpp
new file mode 100644
index 00000000..c6be08e5
--- /dev/null
+++ b/Kernel/Network/NetworkDebugger.cpp
@@ -0,0 +1,100 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/nc.hpp>
+
+/*
+TODO: This code is a mess. It needs to be cleaned up.
+*/
+
+#ifdef DEBUG_NETWORK
+
+#include <uart.hpp>
+#include <printf.h>
+#include <lock.hpp>
+
+using namespace UniversalAsynchronousReceiverTransmitter;
+
+NewLock(netdbg_lock);
+
+namespace NetDbg
+{
+    class NETWORK_DEBUG : public NetworkInterfaceManager::Events
+    {
+    public:
+        static inline void print_wrapper(char c, void *unused) { UART(COM1).Write(c); }
+        int vprintf(const char *format, va_list list) { return vfctprintf(print_wrapper, NULL, format, list); }
+        void WriteRaw(const char *format, ...)
+        {
+            va_list args;
+            va_start(args, format);
+            vprintf(format, args);
+            va_end(args);
+        }
+
+        void DumpData(const char *Description, void *Address, unsigned long Length)
+        {
+            SmartLock(netdbg_lock);
+            WriteRaw("-------------------------------------------------------------------------\n");
+            unsigned char *AddressChar = (unsigned char *)Address;
+            unsigned char Buffer[17];
+            unsigned long Iterate;
+
+            if (Description != nullptr)
+                WriteRaw("%s:\n", Description);
+
+            for (Iterate = 0; Iterate < Length; Iterate++)
+            {
+                if ((Iterate % 16) == 0)
+                {
+                    if (Iterate != 0)
+                        WriteRaw("  %s\n", Buffer);
+                    WriteRaw("  %04x ", Iterate);
+                }
+
+                WriteRaw(" %02x", AddressChar[Iterate]);
+
+                if ((AddressChar[Iterate] < 0x20) || (AddressChar[Iterate] > 0x7e))
+                    Buffer[Iterate % 16] = '.';
+                else
+                    Buffer[Iterate % 16] = AddressChar[Iterate];
+
+                Buffer[(Iterate % 16) + 1] = '\0';
+            }
+
+            while ((Iterate % 16) != 0)
+            {
+                WriteRaw("   ");
+                Iterate++;
+            }
+
+            WriteRaw("  %s\n", Buffer);
+            WriteRaw("-------------------------------------------------------------------------\n");
+        }
+
+        NETWORK_DEBUG() : NetworkInterfaceManager::Events(nullptr) { netdbg("NetworkDebugger initialized."); }
+        ~NETWORK_DEBUG() { netdbg("NetworkDebugger destroyed."); }
+        void OnInterfaceReceived(NetworkInterfaceManager::DeviceInterface *Interface, uint8_t *Data, uint64_t Length) { DumpData("Received", Data, Length); }
+        void OnInterfaceSent(NetworkInterfaceManager::DeviceInterface *Interface, uint8_t *Data, uint64_t Length) { DumpData("Sent", Data, Length); }
+    };
+}
+
+NetDbg::NETWORK_DEBUG *N;
+void DbgNetwork() { N = new NetDbg::NETWORK_DEBUG; }
+void DbgDumpData(const char *Description, void *Address, unsigned long Length) { N->DumpData(Description, Address, Length); }
+
+#endif
diff --git a/Kernel/Network/NetworkTimeProtocol.cpp b/Kernel/Network/NetworkTimeProtocol.cpp
new file mode 100644
index 00000000..36ad6998
--- /dev/null
+++ b/Kernel/Network/NetworkTimeProtocol.cpp
@@ -0,0 +1,75 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/ntp.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkNTP
+{
+    void NTP::OnUDPPacketReceived(NetworkUDP::Socket *Socket, uint8_t *Data, uint64_t Length)
+    {
+        UNUSED(Socket);
+        UNUSED(Length);
+        this->NTPPacket = *(NTPHeader *)Data;
+        this->TimeReceived = true;
+        netdbg("Received UDP packet for NTP.");
+    }
+
+    NTP::NTP(NetworkUDP::Socket *Socket) : NetworkUDP::UDPEvents()
+    {
+        debug("NTP interface %#lx created.", this);
+        this->UDPSocket = Socket;
+    }
+
+    NTP::~NTP()
+    {
+        debug("NTP interface %#lx destroyed.", this);
+    }
+
+    int NTP::ReadTime()
+    {
+        netdbg("Requesting time");
+        this->TimeReceived = false;
+
+        NTPHeader ReqPacket;                      // This may require phyiscal memory allocation but Ethernet already has this job.
+        memset(&ReqPacket, 0, sizeof(NTPHeader)); // Zero out the packet
+        *((char *)&ReqPacket) = 0x1b;             // byteswap nightmare, this is the code below but in little endian
+        // ReqPacket.LeapIndicator = 0;
+        // ReqPacket.VersionNumber = 3;
+        // ReqPacket.Mode = 3;
+        UDPSocket->SocketUDP->Send(UDPSocket, (uint8_t *)&ReqPacket, sizeof(NTPHeader));
+
+        debug("Waiting for response...");
+        int RequestTimeout = 20;
+        while (!this->TimeReceived)
+        {
+            if (--RequestTimeout == 0)
+            {
+                warn("Request timeout.");
+                return 0;
+            }
+            netdbg("Still waiting...");
+            TaskManager->Sleep(1000);
+        }
+
+        long UnixTimestamp = b32(this->NTPPacket.TransmitTimestamp[0]) - 2208988800;
+        debug("Unix time: %d", UnixTimestamp);
+        return s_cst(int, UnixTimestamp);
+    }
+}
diff --git a/Kernel/Network/TransmissionControlProtocol.cpp b/Kernel/Network/TransmissionControlProtocol.cpp
new file mode 100644
index 00000000..7a4b2bc7
--- /dev/null
+++ b/Kernel/Network/TransmissionControlProtocol.cpp
@@ -0,0 +1,25 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/tcp.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkTCP
+{
+}
diff --git a/Kernel/Network/UserDatagramProtocol.cpp b/Kernel/Network/UserDatagramProtocol.cpp
new file mode 100644
index 00000000..82884235
--- /dev/null
+++ b/Kernel/Network/UserDatagramProtocol.cpp
@@ -0,0 +1,145 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <net/udp.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+
+namespace NetworkUDP
+{
+    struct EventInfo
+    {
+        Socket *UDPSocket;
+        uint16_t Port;
+    };
+    std::vector<EventInfo> RegisteredEvents;
+
+    UDPEvents::UDPEvents() {}
+
+    UDPEvents::~UDPEvents() {}
+
+    /* -------------------------------------------------------------------------------------------------------------------------------- */
+
+    UDP::UDP(NetworkIPv4::IPv4 *ipv4, NetworkInterfaceManager::DeviceInterface *Interface) : NetworkIPv4::IPv4Events(NetworkIPv4::PROTOCOL_UDP)
+    {
+        debug("UDP interface %#lx created.", this);
+        this->ipv4 = ipv4;
+        this->Interface = Interface;
+    }
+
+    UDP::~UDP()
+    {
+        debug("UDP interface %#lx destroyed.", this);
+    }
+
+    uint16_t UsablePort = 0x200;
+
+    Socket *UDP::Connect(InternetProtocol IP, uint16_t Port)
+    {
+        netdbg("Connecting to %s", IP.v4.ToStringLittleEndian(), Port);
+        Socket *socket = new Socket(this);
+        socket->RemoteIP = IP;
+        socket->RemotePort = Port;
+        socket->LocalPort = UsablePort++; // TODO: track ports
+        socket->LocalIP = Interface->IP;
+        socket->LocalPort = b16(socket->LocalPort);
+        socket->RemotePort = b16(socket->RemotePort);
+        RegisteredEvents.push_back({.UDPSocket = socket, .Port = socket->LocalPort});
+        return socket;
+    }
+
+    Socket *UDP::Listen(uint16_t Port)
+    {
+        UNUSED(Port);
+        fixme("Not implemented.");
+        return nullptr;
+    }
+
+    void UDP::Disconnect(Socket *Socket)
+    {
+        UNUSED(Socket);
+        fixme("Not implemented.");
+    }
+
+    void UDP::Send(Socket *Socket, uint8_t *Data, uint64_t Length)
+    {
+        netdbg("Sending %d bytes to %s", Length, Socket->RemoteIP.v4.ToStringLittleEndian(), Socket->RemotePort);
+        uint16_t TotalLength = s_cst(uint16_t, Length + sizeof(UDPHeader));
+        UDPPacket *packet = (UDPPacket *)kmalloc(TotalLength);
+        packet->Header.SourcePort = Socket->LocalPort;
+        packet->Header.DestinationPort = Socket->RemotePort;
+        packet->Header.Length = b16(TotalLength);
+        memcpy(packet->Data, Data, Length);
+        packet->Header.Checksum = 0; // I totally should do this. Some devices may require it.
+        // packet->Header.Checksum = CalculateChecksum((uint16_t *)packet, TotalLength);
+        this->ipv4->Send((uint8_t *)packet, TotalLength, 0x11, Socket->RemoteIP);
+        kfree(packet);
+    }
+
+    void UDP::Bind(Socket *Socket, UDPEvents *EventHandler)
+    {
+        netdbg("Binding socket to %s", Socket->LocalIP.v4.ToStringLittleEndian(), Socket->LocalPort);
+        Socket->EventHandler = EventHandler;
+    }
+
+    bool UDP::OnIPv4PacketReceived(InternetProtocol SourceIP, InternetProtocol DestinationIP, uint8_t *Data, uint64_t Length)
+    {
+        netdbg("Received %d bytes from %s", Length, SourceIP.v4.ToStringLittleEndian());
+        if (Length < sizeof(UDPHeader))
+            return false;
+
+        UDPHeader *udp = (UDPHeader *)Data;
+
+        netdbg("SP:%d | DP:%d | L:%d | CHK:%#x", b16(udp->SourcePort), b16(udp->DestinationPort), b16(udp->Length), b16(udp->Checksum));
+
+        Socket *GoodSocket = nullptr;
+
+        foreach (auto &var in RegisteredEvents)
+        {
+            netdbg("UDP->SKT[]: LP:%d | LIP:%s | RP:%d | RIP:%s | LST:%d",
+                   b16(var.UDPSocket->LocalPort),
+                   var.UDPSocket->LocalIP.v4.ToStringLittleEndian(),
+                   b16(var.UDPSocket->RemotePort),
+                   var.UDPSocket->RemoteIP.v4.ToStringLittleEndian(),
+                   b16(var.UDPSocket->Listening));
+            if (var.UDPSocket->LocalPort == udp->DestinationPort &&
+                var.UDPSocket->LocalIP.v4 == DestinationIP.v4 &&
+                var.UDPSocket->Listening == true)
+            {
+                var.UDPSocket->Listening = false;
+                var.UDPSocket->RemotePort = b16(udp->SourcePort);
+                var.UDPSocket->RemoteIP = SourceIP;
+                netdbg("E1");
+                return true;
+            }
+
+            GoodSocket = var.UDPSocket;
+        }
+        if (GoodSocket)
+            GoodSocket->EventHandler->OnUDPPacketReceived(GoodSocket, ((UDPPacket *)Data)->Data, Length);
+
+        netdbg("E0 (Success)");
+        return false;
+    }
+
+    /* -------------------------------------------------------------------------------------------------------------------------------- */
+
+    Socket::Socket(UDP *_UDP) { this->SocketUDP = _UDP; }
+
+    Socket::~Socket() {}
+}
diff --git a/Kernel/Profiling/cyg.cpp b/Kernel/Profiling/cyg.cpp
new file mode 100644
index 00000000..ba5c3b34
--- /dev/null
+++ b/Kernel/Profiling/cyg.cpp
@@ -0,0 +1,112 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <types.h>
+#include <printf.h>
+#include <uart.hpp>
+
+#include "../kernel.h"
+
+bool EnableProfiler = false;
+bool Wait = false;
+unsigned long long LogDepth = 0;
+unsigned int Level = 0;
+using namespace UniversalAsynchronousReceiverTransmitter;
+
+static inline SafeFunction NIF void profiler_uart_wrapper(char c, void *unused)
+{
+    bool renable = EnableProfiler;
+    EnableProfiler = false;
+    UART(COM2).Write(c);
+    UNUSED(unused);
+    if (renable)
+        EnableProfiler = true;
+}
+
+EXTERNC SafeFunction NIF void __cyg_profile_func_enter(void *Function, void *CallSite)
+{
+    if (!EnableProfiler)
+        return;
+
+    while (Wait)
+#if defined(a86)
+        asmv("pause");
+#elif defined(aa64)
+        asmv("yield");
+#endif
+    Wait = true;
+
+    if (Level > 40)
+        Level--;
+
+    Level++;
+
+    if (!KernelSymbolTable)
+        fctprintf(profiler_uart_wrapper, nullptr, "%lld [%02d]: \033[42m->\033[0m%*c \033[33m%p\033[0m  -  \033[33m%p\033[0m\n",
+                  LogDepth++,
+                  Level - 1,
+                  Level,
+                  ' ',
+                  Function,
+                  CallSite);
+    else
+        fctprintf(profiler_uart_wrapper, nullptr, "%lld [%02d]: \033[42m->\033[0m%*c \033[33m%s\033[0m  -  \033[33m%s\033[0m\n",
+                  LogDepth++,
+                  Level - 1,
+                  Level,
+                  ' ',
+                  KernelSymbolTable->GetSymbolFromAddress((uintptr_t)Function),
+                  KernelSymbolTable->GetSymbolFromAddress((uintptr_t)CallSite));
+    Wait = false;
+}
+
+EXTERNC SafeFunction NIF void __cyg_profile_func_exit(void *Function, void *CallSite)
+{
+    if (!EnableProfiler)
+        return;
+
+    while (Wait)
+#if defined(a86)
+        asmv("pause");
+#elif defined(aa64)
+        asmv("yield");
+#endif
+    Wait = true;
+
+    if (Level > 40)
+        Level--;
+
+    Level--;
+
+    if (!KernelSymbolTable)
+        fctprintf(profiler_uart_wrapper, nullptr, "%lld [%02d]: \033[41m<-\033[0m%*c \033[33m%p\033[0m  -  \033[33m%p\033[0m\n",
+                  LogDepth++,
+                  Level - 1,
+                  Level,
+                  ' ',
+                  Function,
+                  CallSite);
+    else
+        fctprintf(profiler_uart_wrapper, nullptr, "%lld [%02d]: \033[41m<-\033[0m%*c \033[33m%s\033[0m  -  \033[33m%s\033[0m\n",
+                  LogDepth++,
+                  Level - 1,
+                  Level,
+                  ' ',
+                  KernelSymbolTable->GetSymbolFromAddress((uintptr_t)Function),
+                  KernelSymbolTable->GetSymbolFromAddress((uintptr_t)CallSite));
+    Wait = false;
+}
diff --git a/Kernel/Profiling/gcov.cpp b/Kernel/Profiling/gcov.cpp
new file mode 100644
index 00000000..b5277f60
--- /dev/null
+++ b/Kernel/Profiling/gcov.cpp
@@ -0,0 +1,88 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <types.h>
+#include <printf.h>
+#include <uart.hpp>
+
+#include "../kernel.h"
+
+using namespace UniversalAsynchronousReceiverTransmitter;
+
+#if BITS_PER_LONG >= 64
+typedef long gcov_type;
+#else
+typedef long long gcov_type;
+#endif
+
+struct gcov_fn_info
+{
+    unsigned int ident;
+    unsigned int checksum;
+    unsigned int n_ctrs[0];
+};
+
+struct gcov_ctr_info
+{
+    unsigned int num;
+    gcov_type *values;
+    void (*merge)(gcov_type *, unsigned int);
+};
+
+struct gcov_info
+{
+    unsigned int version;
+    struct gcov_info *next;
+    unsigned int stamp;
+    const char *filename;
+    unsigned int n_functions;
+    const struct gcov_fn_info *functions;
+    unsigned int ctr_mask;
+    struct gcov_ctr_info counts[0];
+};
+
+static inline SafeFunction NIF void gcov_uart_wrapper(char c, void *unused)
+{
+    UART(COM2).Write(c);
+    UNUSED(unused);
+}
+
+// TODO: Implement
+
+EXTERNC SafeFunction NIF void __gcov_init(gcov_info *p __unused)
+{
+}
+
+EXTERNC SafeFunction NIF void __gcov_exit(void)
+{
+}
+
+EXTERNC SafeFunction NIF void __gcov_flush(void)
+{
+}
+
+EXTERNC SafeFunction NIF void __gcov_merge_add(gcov_type *counters, unsigned int n_counters)
+{
+    UNUSED(counters);
+    UNUSED(n_counters);
+}
+
+EXTERNC SafeFunction NIF void __gcov_merge_single(gcov_type *counters, unsigned int n_counters)
+{
+    UNUSED(counters);
+    UNUSED(n_counters);
+}
diff --git a/Kernel/Profiling/gprof.cpp b/Kernel/Profiling/gprof.cpp
new file mode 100644
index 00000000..53fab552
--- /dev/null
+++ b/Kernel/Profiling/gprof.cpp
@@ -0,0 +1,38 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <types.h>
+#include <printf.h>
+#include <uart.hpp>
+
+#include "../kernel.h"
+
+using namespace UniversalAsynchronousReceiverTransmitter;
+
+static inline SafeFunction NIF void gprof_uart_wrapper(char c, void *unused)
+{
+    UART(COM2).Write(c);
+    UNUSED(unused);
+}
+
+EXTERNC SafeFunction NIF void mcount(unsigned long frompc, unsigned long selfpc)
+{
+    // TODO: Implement
+    /* https://docs.kernel.org/trace/ftrace-design.html */
+    UNUSED(frompc);
+    UNUSED(selfpc);
+}
diff --git a/Kernel/README.md b/Kernel/README.md
new file mode 100644
index 00000000..a66e149a
--- /dev/null
+++ b/Kernel/README.md
@@ -0,0 +1,11 @@
+# Kernel
+
+The core of the operating system.
+
+---
+
+Use `Fennix` repo to build the operating system.
+
+```bash
+git clone --recurse-submodules https://github.com/Fennix-Project/Fennix.git
+```
diff --git a/Kernel/Recovery/RecoveryMain.cpp b/Kernel/Recovery/RecoveryMain.cpp
new file mode 100644
index 00000000..4cb5e0c4
--- /dev/null
+++ b/Kernel/Recovery/RecoveryMain.cpp
@@ -0,0 +1,366 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <recovery.hpp>
+#include <task.hpp>
+#include <lock.hpp>
+#include <gui.hpp>
+#include <debug.h>
+
+#include "../kernel.h"
+#include "../Fex.hpp"
+#include "../DAPI.hpp"
+
+using Tasking::IP;
+using Tasking::PCB;
+using Tasking::TaskTrustLevel;
+using Tasking::TCB;
+using VirtualFileSystem::File;
+using VirtualFileSystem::FileStatus;
+using namespace GraphicalUserInterface;
+
+#ifdef DEBUG
+extern uint64_t FIi, PDi, PWi, PWWi, PCi, mmi;
+#endif
+
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_start;
+extern uintptr_t _binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_end;
+
+NewLock(PlayAudioLock);
+
+namespace Recovery
+{
+    WidgetCollection *wdgDbgWin = nullptr;
+    Window *DbgWin = nullptr;
+
+    char *AudioFile = (char *)"/home/default/Music/Ludwig van Beethoven - Fur Elise.mp3";
+
+    void PlayAudio()
+    {
+        TaskManager->GetCurrentThread()->Rename("PlayAudio Test");
+        SmartLock(PlayAudioLock);
+        Driver::DriverFile AudioDrv;
+
+        foreach (auto Driver in DriverManager->GetDrivers())
+        {
+            if (((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.Type == FexDriverType::FexDriverType_Audio)
+            {
+                AudioDrv = Driver;
+                break;
+            }
+        }
+
+        if (!AudioDrv.Enabled)
+        {
+            error("No audio drivers found! Cannot play audio!");
+            return;
+        }
+
+        VirtualFileSystem::File pcm = vfs->Open(AudioFile);
+
+        if (!pcm.IsOK())
+        {
+            error("Cannot open audio file! Cannot play audio!");
+            return;
+        }
+
+        void *PCMRaw = KernelAllocator.RequestPages(TO_PAGES(pcm.node->Length + 1));
+        memcpy(PCMRaw, (void *)pcm.node->Address, pcm.node->Length);
+
+        KernelCallback callback{};
+        callback.Reason = SendReason;
+        callback.AudioCallback.Send.Data = (uint8_t *)PCMRaw;
+        callback.AudioCallback.Send.Length = pcm.node->Length;
+        debug("Playing audio...");
+        int status = DriverManager->IOCB(AudioDrv.DriverUID, &callback);
+        UNUSED(status);
+        debug("Audio played! %d", status);
+        KernelAllocator.FreePages((void *)PCMRaw, TO_PAGES(pcm.node->Length + 1));
+        vfs->Close(pcm);
+        TEXIT(0);
+    }
+
+    void PlayAudioWrapper() { TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (IP)PlayAudio)->SetPriority(Tasking::TaskPriority::Idle); }
+
+    void ChangeSampleRate(char SR)
+    {
+        Driver::DriverFile AudioDrv;
+
+        foreach (auto Driver in DriverManager->GetDrivers())
+        {
+            if (((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.Type == FexDriverType::FexDriverType_Audio)
+            {
+                AudioDrv = Driver;
+                break;
+            }
+        }
+
+        if (!AudioDrv.Enabled)
+        {
+            error("No audio drivers found! Cannot play audio!");
+            return;
+        }
+
+        KernelCallback callback{};
+        callback.Reason = AdjustReason;
+        callback.AudioCallback.Adjust._SampleRate = true;
+        callback.AudioCallback.Adjust.SampleRate = SR;
+        int status = DriverManager->IOCB(AudioDrv.DriverUID, &callback);
+        UNUSED(status);
+        debug("Sample rate changed! %d", status);
+    }
+
+    void CSR8000() { ChangeSampleRate(0); }
+    void CSR11025() { ChangeSampleRate(1); }
+    void CSR16000() { ChangeSampleRate(2); }
+    void CSR22050() { ChangeSampleRate(3); }
+    void CSR32000() { ChangeSampleRate(4); }
+    void CSR44100() { ChangeSampleRate(5); }
+    void CSR48000() { ChangeSampleRate(6); }
+    void CSR88200() { ChangeSampleRate(7); }
+    void CSR96000() { ChangeSampleRate(8); }
+
+    void ChangeVolume(char percentage)
+    {
+        Driver::DriverFile AudioDrv;
+
+        foreach (auto Driver in DriverManager->GetDrivers())
+        {
+            if (((FexExtended *)((uintptr_t)Driver.Address + EXTENDED_SECTION_ADDRESS))->Driver.Type == FexDriverType::FexDriverType_Audio)
+            {
+                AudioDrv = Driver;
+                break;
+            }
+        }
+
+        if (!AudioDrv.Enabled)
+        {
+            error("No audio drivers found! Cannot play audio!");
+            return;
+        }
+
+        KernelCallback callback{};
+        callback.Reason = AdjustReason;
+        callback.AudioCallback.Adjust._Volume = true;
+        callback.AudioCallback.Adjust.Volume = percentage;
+        int status = DriverManager->IOCB(AudioDrv.DriverUID, &callback);
+        UNUSED(status);
+        debug("Volume changed! %d", status);
+    }
+
+    void CV0() { ChangeVolume(0); }
+    void CV10() { ChangeVolume(10); }
+    void CV20() { ChangeVolume(20); }
+    void CV30() { ChangeVolume(30); }
+    void CV40() { ChangeVolume(40); }
+    void CV50() { ChangeVolume(50); }
+    void CV60() { ChangeVolume(60); }
+    void CV70() { ChangeVolume(70); }
+    void CV80() { ChangeVolume(80); }
+    void CV90() { ChangeVolume(90); }
+    void CV100() { ChangeVolume(100); }
+
+    void BufBight10() { Display->SetBrightness(10, 200); }
+    void BufBight20() { Display->SetBrightness(20, 200); }
+    void BufBight30() { Display->SetBrightness(30, 200); }
+    void BufBight40() { Display->SetBrightness(40, 200); }
+    void BufBight50() { Display->SetBrightness(50, 200); }
+    void BufBight60() { Display->SetBrightness(60, 200); }
+    void BufBight70() { Display->SetBrightness(70, 200); }
+    void BufBight80() { Display->SetBrightness(80, 200); }
+    void BufBight90() { Display->SetBrightness(90, 200); }
+    void BufBight100() { Display->SetBrightness(100, 200); }
+
+    // void audio_dev_connected() { AudioFile = (char *)"/system/config/audio/media/dev_connected.mp3"; }
+    // void audio_dev_disconnected() { AudioFile = (char *)"/system/config/audio/media/dev_disconnected.mp3"; }
+    // void audio_dev_error() { AudioFile = (char *)"/system/config/audio/media/dev_error.mp3"; }
+    // void audio_error() { AudioFile = (char *)"/system/config/audio/media/error.mp3"; }
+    // void audio_notification() { AudioFile = (char *)"/system/config/audio/media/notification.mp3"; }
+    // void audio_warning() { AudioFile = (char *)"/system/config/audio/media/warning.mp3"; }
+
+    void KernelRecovery::RecoveryThread()
+    {
+        while (wdgDbgWin == nullptr || DbgWin == nullptr)
+            TaskManager->Sleep(100);
+
+        wdgDbgWin->CreateLabel({5, 0, 0, 0}, "Scheduler Ticks  /  Last Task Ticks");
+        GraphicalUserInterface::Handle SchedLblHnd = wdgDbgWin->CreateLabel({5, 15, 0, 0}, "0000000000000000 / 0000000000000000");
+
+        wdgDbgWin->CreateLabel({5, 40, 0, 0}, "Memory Usage");
+        GraphicalUserInterface::Handle MemLblHnd = wdgDbgWin->CreateLabel({5, 55, 0, 0}, "0MB / 0GB (0MB reserved) 0% (0000000000000000 bytes allocated)");
+
+#ifdef DEBUG
+        wdgDbgWin->CreateLabel({5, 95, 0, 0}, "GUI Info");
+        wdgDbgWin->CreateLabel({5, 110, 0, 0}, "  Fetch Inputs   /  Paint Desktop   / Paint Widgets");
+        GraphicalUserInterface::Handle GUI1LblHnd = wdgDbgWin->CreateLabel({5, 125, 0, 0}, "0000000000000000 / 0000000000000000 / 0000000000000000");
+        wdgDbgWin->CreateLabel({5, 140, 0, 0}, "  Paint Windows  /   Paint Cursor   / Memset & Update");
+        GraphicalUserInterface::Handle GUI2LblHnd = wdgDbgWin->CreateLabel({5, 155, 0, 0}, "0000000000000000 / 0000000000000000 / 0000000000000000");
+#endif
+
+        wdgDbgWin->CreateLabel({5, 195, 0, 0}, "Audio");
+        wdgDbgWin->CreateButton({5, 210, 85, 15}, "Play Audio", (uintptr_t)PlayAudioWrapper);
+
+        wdgDbgWin->CreateLabel({5, 235, 0, 0}, "Sample Rate");
+        wdgDbgWin->CreateButton({5, 250, 45, 15}, "8000", (uintptr_t)CSR8000);
+        wdgDbgWin->CreateButton({55, 250, 45, 15}, "11025", (uintptr_t)CSR11025);
+        wdgDbgWin->CreateButton({105, 250, 45, 15}, "16000", (uintptr_t)CSR16000);
+        wdgDbgWin->CreateButton({155, 250, 45, 15}, "22050", (uintptr_t)CSR22050);
+        wdgDbgWin->CreateButton({205, 250, 45, 15}, "32000", (uintptr_t)CSR32000);
+        wdgDbgWin->CreateButton({255, 250, 45, 15}, "44100", (uintptr_t)CSR44100);
+        wdgDbgWin->CreateButton({305, 250, 45, 15}, "48000", (uintptr_t)CSR48000);
+        wdgDbgWin->CreateButton({355, 250, 45, 15}, "88200", (uintptr_t)CSR88200);
+        wdgDbgWin->CreateButton({405, 250, 45, 15}, "96000", (uintptr_t)CSR96000);
+
+        wdgDbgWin->CreateLabel({5, 265, 0, 0}, "Volume");
+        wdgDbgWin->CreateButton({5, 280, 25, 15}, "0%", (uintptr_t)CV0);
+        wdgDbgWin->CreateButton({35, 280, 25, 15}, "10%", (uintptr_t)CV10);
+        wdgDbgWin->CreateButton({65, 280, 25, 15}, "20%", (uintptr_t)CV20);
+        wdgDbgWin->CreateButton({95, 280, 25, 15}, "30%", (uintptr_t)CV30);
+        wdgDbgWin->CreateButton({125, 280, 25, 15}, "40%", (uintptr_t)CV40);
+        wdgDbgWin->CreateButton({155, 280, 25, 15}, "50%", (uintptr_t)CV50);
+        wdgDbgWin->CreateButton({185, 280, 25, 15}, "60%", (uintptr_t)CV60);
+        wdgDbgWin->CreateButton({215, 280, 25, 15}, "70%", (uintptr_t)CV70);
+        wdgDbgWin->CreateButton({245, 280, 25, 15}, "80%", (uintptr_t)CV80);
+        wdgDbgWin->CreateButton({275, 280, 25, 15}, "90%", (uintptr_t)CV90);
+        wdgDbgWin->CreateButton({305, 280, 25, 15}, "100%", (uintptr_t)CV100);
+
+        GraphicalUserInterface::Handle wdgDbgCurrentAudioLbl = wdgDbgWin->CreateLabel({5, 295, 0, 0}, "Current Audio: ");
+        // wdgDbgWin->CreateButton({5, 310, 85, 15}, "dev_connected.mp3", (uintptr_t)audio_dev_connected);
+        // wdgDbgWin->CreateButton({95, 310, 85, 15}, "dev_disconnected.mp3", (uintptr_t)audio_dev_disconnected);
+        // wdgDbgWin->CreateButton({185, 310, 85, 15}, "dev_error.mp3", (uintptr_t)audio_dev_error);
+        // wdgDbgWin->CreateButton({275, 310, 85, 15}, "error.mp3", (uintptr_t)audio_error);
+        // wdgDbgWin->CreateButton({365, 310, 85, 15}, "notification.mp3", (uintptr_t)audio_notification);
+        // wdgDbgWin->CreateButton({455, 310, 85, 15}, "warning.mp3", (uintptr_t)audio_warning);
+
+        wdgDbgWin->CreateLabel({5, 325, 0, 0}, "Display Brightness");
+        wdgDbgWin->CreateButton({5, 340, 25, 15}, "10%", (uintptr_t)BufBight10);
+        wdgDbgWin->CreateButton({35, 340, 25, 15}, "20%", (uintptr_t)BufBight20);
+        wdgDbgWin->CreateButton({65, 340, 25, 15}, "30%", (uintptr_t)BufBight30);
+        wdgDbgWin->CreateButton({95, 340, 25, 15}, "40%", (uintptr_t)BufBight40);
+        wdgDbgWin->CreateButton({125, 340, 25, 15}, "50%", (uintptr_t)BufBight50);
+        wdgDbgWin->CreateButton({155, 340, 25, 15}, "60%", (uintptr_t)BufBight60);
+        wdgDbgWin->CreateButton({185, 340, 25, 15}, "70%", (uintptr_t)BufBight70);
+        wdgDbgWin->CreateButton({215, 340, 25, 15}, "80%", (uintptr_t)BufBight80);
+        wdgDbgWin->CreateButton({245, 340, 25, 15}, "90%", (uintptr_t)BufBight90);
+        wdgDbgWin->CreateButton({275, 340, 25, 15}, "100%", (uintptr_t)BufBight100);
+
+        DbgWin->AddWidget(wdgDbgWin);
+
+        char TicksText[128];
+        uint64_t MemUsed = 0;
+        uint64_t MemTotal = 0;
+        uint64_t MemReserved = 0;
+        while (true)
+        {
+            sprintf(TicksText, "%016ld / %016ld", TaskManager->GetSchedulerTicks(), TaskManager->GetLastTaskTicks());
+            wdgDbgWin->SetText(SchedLblHnd, TicksText);
+            static int RefreshMemCounter = 0;
+            if (RefreshMemCounter-- == 0)
+            {
+                MemUsed = KernelAllocator.GetUsedMemory();
+                MemTotal = KernelAllocator.GetTotalMemory();
+                MemReserved = KernelAllocator.GetReservedMemory();
+                uint64_t MemPercent = (MemUsed * 100) / MemTotal;
+                sprintf(TicksText, "%ldMB / %ldGB (%ldMB reserved) %ld%% (%ld bytes allocated)", TO_MB(MemUsed), TO_GB(MemTotal), TO_MB(MemReserved), MemPercent, MemUsed);
+                wdgDbgWin->SetText(MemLblHnd, TicksText);
+                RefreshMemCounter = 25;
+            }
+            sprintf(TicksText, "Debug - %ldx%ld", DbgWin->GetPosition().Width, DbgWin->GetPosition().Height);
+            DbgWin->SetTitle(TicksText);
+            sprintf(TicksText, "Current Audio: %s", AudioFile);
+            wdgDbgWin->SetText(wdgDbgCurrentAudioLbl, TicksText);
+
+#ifdef DEBUG
+            static int RefreshGUIDbgCounter = 0;
+            if (RefreshGUIDbgCounter-- == 0)
+            {
+                sprintf(TicksText, "%016ld / %016ld / %016ld", FIi, PDi, PWi);
+                wdgDbgWin->SetText(GUI1LblHnd, TicksText);
+                sprintf(TicksText, "%016ld / %016ld / %016ld", PWWi, PCi, mmi);
+                wdgDbgWin->SetText(GUI2LblHnd, TicksText);
+                RefreshGUIDbgCounter = 5;
+            }
+#endif
+            TaskManager->Sleep(100);
+        }
+    }
+
+    void RecoveryThreadWrapper()
+    {
+        while (!RecoveryScreen)
+            CPU::Pause();
+        RecoveryScreen->RecoveryThread();
+    }
+
+    void RebootCommandThread() { KST_Reboot(); }
+    void ShutdownCommandThread() { KST_Shutdown(); }
+
+    void RebootCommandWrapper() { TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (IP)RebootCommandThread); }
+    void ShutdownCommandWrapper() { TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (IP)ShutdownCommandThread); }
+
+    GraphicalUserInterface::GUI *gui = nullptr;
+    void GUIWrapper() { gui->Loop(); }
+
+    KernelRecovery::KernelRecovery()
+    {
+        // PCB *proc = TaskManager->CreateProcess(TaskManager->GetCurrentProcess(), "Recovery", TaskTrustLevel::Kernel, nullptr);
+
+        gui = new GraphicalUserInterface::GUI;
+
+        guiThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (IP)GUIWrapper);
+        guiThread->Rename("GUI Thread");
+        guiThread->SetPriority(Tasking::TaskPriority::Critical);
+
+        Rect RecoveryModeWindow;
+        RecoveryModeWindow.Width = 460;
+        RecoveryModeWindow.Height = 100;
+        RecoveryModeWindow.Left = Display->GetBuffer(200)->Width / 2 - RecoveryModeWindow.Width / 2;
+        RecoveryModeWindow.Top = Display->GetBuffer(200)->Height / 2 - RecoveryModeWindow.Height / 2;
+        Window *RecWin = new Window(gui, RecoveryModeWindow, "Recovery Mode");
+        gui->AddWindow(RecWin);
+
+        WidgetCollection *wdgRecWin = new WidgetCollection(RecWin);
+        wdgRecWin->CreateLabel({80, 10, 0, 0}, "This is not fully implemented.");
+        wdgRecWin->CreateLabel({10, 40, 0, 0}, "All you can do is shutdown/reboot the system.");
+        wdgRecWin->CreateButton({10, 70, 90, 20}, "Reboot", (uintptr_t)RebootCommandWrapper);
+        wdgRecWin->CreateButton({110, 70, 90, 20}, "Shutdown", (uintptr_t)ShutdownCommandWrapper);
+        RecWin->AddWidget(wdgRecWin);
+
+        Rect DebugWindow;
+        DebugWindow.Width = 460;
+        DebugWindow.Height = 380;
+        DebugWindow.Left = 5;
+        DebugWindow.Top = 25;
+        DbgWin = new Window(gui, DebugWindow, "Debug");
+        gui->AddWindow(DbgWin);
+
+        wdgDbgWin = new WidgetCollection(DbgWin);
+        Video::Font *NewFont = new Video::Font(&_binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_start, &_binary_Files_tamsyn_font_1_11_Tamsyn7x14r_psf_end, Video::FontType::PCScreenFont2);
+        wdgDbgWin->ReplaceFont(NewFont);
+        recoveryThread = TaskManager->CreateThread(TaskManager->GetCurrentProcess(), (IP)RecoveryThreadWrapper);
+        recoveryThread->Rename("Recovery Thread");
+        recoveryThread->SetPriority(Tasking::TaskPriority::Idle);
+    }
+
+    KernelRecovery::~KernelRecovery()
+    {
+        debug("Destructor called");
+        TaskManager->KillThread(guiThread, 0);
+        TaskManager->KillThread(recoveryThread, 0);
+        delete gui, gui = nullptr;
+    }
+}
diff --git a/Kernel/SystemCalls/Linux.cpp b/Kernel/SystemCalls/Linux.cpp
new file mode 100644
index 00000000..9cf71ce3
--- /dev/null
+++ b/Kernel/SystemCalls/Linux.cpp
@@ -0,0 +1,2458 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <syscalls.hpp>
+
+#include <debug.h>
+#include <cpu.hpp>
+
+#include "../kernel.h"
+
+typedef __INT32_TYPE__ mode_t;
+
+#define internal_unimpl(a, b, c, d, e, f, g)                                                     \
+    {                                                                                            \
+        fixme("Unimplemented Syscall: %lld %lld %lld %lld %lld %lld %lld", a, b, c, d, e, f, g); \
+    }
+
+#define stub(a, b, c, d, e, f, g)                                                  \
+    {                                                                              \
+        fixme("( %lld %lld %lld %lld %lld %lld %lld ) stub", a, b, c, d, e, f, g); \
+    }
+
+static ssize_t sys_read(int fd, void *buf, size_t count)
+{
+    fixme("read( %p %p %ld )", fd, buf, count);
+    return -1;
+}
+
+static ssize_t sys_write(int fd, const char *buf, size_t count)
+{
+    fixme("write( %p %p %ld )", fd, buf, count);
+    return -1;
+}
+
+static ssize_t sys_open(const char *filename, int flags, mode_t mode)
+{
+    fixme("open( %s %d %d )", filename, flags, mode);
+    return -1;
+}
+
+static ssize_t sys_close(int fd)
+{
+    fixme("close( %d )", fd);
+    return -1;
+}
+
+static ssize_t sys_stat(const char *filename, void *statbuf)
+{
+    fixme("stat( %s %p )", filename, statbuf);
+    return -1;
+}
+
+static uint64_t sys_fstat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lstat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_poll(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lseek(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mmap(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mprotect(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_munmap(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_brk(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigaction(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigprocmask(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigreturn(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ioctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pread64(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pwrite64(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_readv(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_writev(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_access(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pipe(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_select(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_yield(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mremap(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_msync(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mincore(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_madvise(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_shmget(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_shmat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_shmctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_dup(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_dup2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pause(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_nanosleep(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getitimer(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_alarm(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setitimer(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getpid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sendfile(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_socket(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_connect(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_accept(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sendto(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_recvfrom(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sendmsg(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_recvmsg(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_shutdown(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_bind(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_listen(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getsockname(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getpeername(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_socketpair(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setsockopt(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getsockopt(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_clone(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fork(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_vfork(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static int sys_execve(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_exit(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_wait4(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_kill(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_uname(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_semget(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_semop(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_semctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_shmdt(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_msgget(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_msgsnd(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_msgrcv(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_msgctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fcntl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_flock(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fsync(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fdatasync(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_truncate(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ftruncate(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getdents(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getcwd(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_chdir(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fchdir(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rename(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mkdir(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rmdir(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_creat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_link(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_unlink(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_symlink(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_readlink(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_chmod(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fchmod(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_chown(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fchown(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lchown(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_umask(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_gettimeofday(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getrlimit(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getrusage(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sysinfo(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_times(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ptrace(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static unsigned int sys_getuid(void)
+{
+    stub(0, 0, 0, 0, 0, 0, 0);
+    return 0;
+}
+
+static uint64_t sys_syslog(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static unsigned int sys_getgid(void)
+{
+    stub(0, 0, 0, 0, 0, 0, 0);
+    return 0;
+}
+
+static uint64_t sys_setuid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setgid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static unsigned int sys_geteuid(void)
+{
+    stub(0, 0, 0, 0, 0, 0, 0);
+    return 0;
+}
+
+static unsigned int sys_getegid(void)
+{
+    stub(0, 0, 0, 0, 0, 0, 0);
+    return 0;
+}
+
+static uint64_t sys_setpgid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getppid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getpgrp(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setsid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setreuid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setregid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getgroups(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setgroups(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setresuid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getresuid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setresgid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getresgid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getpgid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setfsuid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setfsgid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getsid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_capget(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_capset(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigpending(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigtimedwait(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigqueueinfo(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_sigsuspend(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sigaltstack(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_utime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mknod(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_uselib(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_personality(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ustat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_statfs(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fstatfs(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sysfs(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getpriority(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setpriority(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_setparam(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_getparam(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_setscheduler(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_getscheduler(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_get_priority_max(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_get_priority_min(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_rr_get_interval(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mlock(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_munlock(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mlockall(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_munlockall(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_vhangup(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_modify_ldt(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pivot_root(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys__sysctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_prctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_arch_prctl(int code, unsigned long arg2, unsigned long arg3, unsigned long arg4, unsigned long arg5)
+{
+    trace("( code=%#lx, arg2=%lx, arg3=%lx, arg4=%lx, arg5=%lx )", code, arg2, arg3, arg4, arg5);
+
+    switch (code)
+    {
+    case 0x1001: // ARCH_SET_GS
+    {
+#if defined(a64)
+        CPU::x64::wrmsr(CPU::x64::MSRID::MSR_GS_BASE, arg2);
+#elif defined(a32)
+        CPU::x32::wrmsr(CPU::x32::MSRID::MSR_GS_BASE, arg2);
+#endif
+        return arg2;
+    }
+    case 0x1002: // ARCH_SET_FS
+    {
+#if defined(a64)
+        CPU::x64::wrmsr(CPU::x64::MSRID::MSR_FS_BASE, arg2);
+#elif defined(a32)
+        CPU::x32::wrmsr(CPU::x32::MSRID::MSR_FS_BASE, arg2);
+#endif
+        return arg2;
+    }
+    case 0x1003: // ARCH_GET_FS
+    {
+#if defined(a64)
+        return CPU::x64::rdmsr(CPU::x64::MSRID::MSR_FS_BASE);
+#elif defined(a32)
+        return CPU::x32::rdmsr(CPU::x32::MSRID::MSR_FS_BASE);
+#endif
+    }
+    case 0x1004: // ARCH_GET_GS
+    {
+#if defined(a64)
+        return CPU::x64::rdmsr(CPU::x64::MSRID::MSR_GS_BASE);
+#elif defined(a32)
+        return CPU::x32::rdmsr(CPU::x32::MSRID::MSR_GS_BASE);
+#endif
+    }
+    default:
+        warn("Unimplemented prctl code %#lx (arg2=%lx, arg3=%lx, arg4=%lx, arg5=%lx)", code, arg2, arg3, arg4, arg5);
+        return -1; /* EINVAL */
+    }
+    return -1;
+}
+
+static uint64_t sys_adjtimex(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setrlimit(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_chroot(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sync(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_acct(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_settimeofday(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mount(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_umount2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_swapon(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_swapoff(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_reboot(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sethostname(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setdomainname(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_iopl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ioperm(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_create_module(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_init_module(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_delete_module(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_get_kernel_syms(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_query_module(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_quotactl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_nfsservctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getpmsg(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_putpmsg(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_afs_syscall(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_tuxcall(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_security(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_gettid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_readahead(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lsetxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fsetxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lgetxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fgetxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_listxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_llistxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_flistxattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_removexattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lremovexattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fremovexattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_tkill(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_time(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_futex(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_setaffinity(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_getaffinity(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_set_thread_area(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_io_setup(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_io_destroy(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_io_getevents(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_io_submit(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_io_cancel(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_get_thread_area(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_lookup_dcookie(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_create(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_ctl_old(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_wait_old(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_remap_file_pages(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getdents64(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_set_tid_address(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_restart_syscall(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_semtimedop(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fadvise64(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timer_create(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timer_settime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timer_gettime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timer_getoverrun(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timer_delete(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_clock_settime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_clock_gettime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_clock_getres(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_clock_nanosleep(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_exit_group(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_wait(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_ctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_tgkill(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_utimes(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_vserver(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mbind(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_set_mempolicy(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_get_mempolicy(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mq_open(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mq_unlink(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mq_timedsend(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mq_timedreceive(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mq_notify(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mq_getsetattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_kexec_load(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_waitid(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_add_key(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_request_key(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_keyctl(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ioprio_set(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ioprio_get(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_inotify_init(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_inotify_add_watch(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_inotify_rm_watch(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_migrate_pages(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_openat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mkdirat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_mknodat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fchownat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_futimesat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_newfstatat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_unlinkat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_renameat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_linkat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_symlinkat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_readlinkat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fchmodat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_faccessat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pselect6(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_ppoll(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_unshare(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_set_robust_list(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_get_robust_list(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_splice(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_tee(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sync_file_range(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_vmsplice(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_move_pages(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_utimensat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_pwait(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_signalfd(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timerfd_create(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_eventfd(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fallocate(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timerfd_settime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_timerfd_gettime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_accept4(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_signalfd4(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_eventfd2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_epoll_create1(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_dup3(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pipe2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_inotify_init1(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_preadv(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_pwritev(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_rt_tgsigqueueinfo(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_perf_event_open(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_recvmmsg(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fanotify_init(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_fanotify_mark(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_prlimit64(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_name_to_handle_at(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_open_by_handle_at(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_clock_adjtime(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_syncfs(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sendmmsg(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_setns(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getcpu(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_process_vm_readv(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_process_vm_writev(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_kcmp(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_finit_module(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_setattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_sched_getattr(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_renameat2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_seccomp(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_getrandom(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_memfd_create(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_kexec_file_load(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t sys_bpf(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t stub_execveat(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t userfaultfd(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t membarrier(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t mlock2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t copy_file_range(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t preadv2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t pwritev2(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t pkey_mprotect(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t pkey_alloc(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t pkey_free(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t statx(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t io_pgetevents(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t rseq(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+static uint64_t pkey_mprotect_(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g)
+{
+    internal_unimpl(a, b, c, d, e, f, g);
+    return -1;
+}
+
+// Syscalls list: https://filippo.io/linux-syscall-table/ https://blog.rchapman.org/posts/Linux_System_Call_Table_for_x86_64/
+
+static void *LinuxSyscallsTable[] = {
+    [0] = (void *)sys_read,
+    [1] = (void *)sys_write,
+    [2] = (void *)sys_open,
+    [3] = (void *)sys_close,
+    [4] = (void *)sys_stat,
+    [5] = (void *)sys_fstat,
+    [6] = (void *)sys_lstat,
+    [7] = (void *)sys_poll,
+    [8] = (void *)sys_lseek,
+    [9] = (void *)sys_mmap,
+    [10] = (void *)sys_mprotect,
+    [11] = (void *)sys_munmap,
+    [12] = (void *)sys_brk,
+    [13] = (void *)sys_rt_sigaction,
+    [14] = (void *)sys_rt_sigprocmask,
+    [15] = (void *)sys_rt_sigreturn,
+    [16] = (void *)sys_ioctl,
+    [17] = (void *)sys_pread64,
+    [18] = (void *)sys_pwrite64,
+    [19] = (void *)sys_readv,
+    [20] = (void *)sys_writev,
+    [21] = (void *)sys_access,
+    [22] = (void *)sys_pipe,
+    [23] = (void *)sys_select,
+    [24] = (void *)sys_sched_yield,
+    [25] = (void *)sys_mremap,
+    [26] = (void *)sys_msync,
+    [27] = (void *)sys_mincore,
+    [28] = (void *)sys_madvise,
+    [29] = (void *)sys_shmget,
+    [30] = (void *)sys_shmat,
+    [31] = (void *)sys_shmctl,
+    [32] = (void *)sys_dup,
+    [33] = (void *)sys_dup2,
+    [34] = (void *)sys_pause,
+    [35] = (void *)sys_nanosleep,
+    [36] = (void *)sys_getitimer,
+    [37] = (void *)sys_alarm,
+    [38] = (void *)sys_setitimer,
+    [39] = (void *)sys_getpid,
+    [40] = (void *)sys_sendfile,
+    [41] = (void *)sys_socket,
+    [42] = (void *)sys_connect,
+    [43] = (void *)sys_accept,
+    [44] = (void *)sys_sendto,
+    [45] = (void *)sys_recvfrom,
+    [46] = (void *)sys_sendmsg,
+    [47] = (void *)sys_recvmsg,
+    [48] = (void *)sys_shutdown,
+    [49] = (void *)sys_bind,
+    [50] = (void *)sys_listen,
+    [51] = (void *)sys_getsockname,
+    [52] = (void *)sys_getpeername,
+    [53] = (void *)sys_socketpair,
+    [54] = (void *)sys_setsockopt,
+    [55] = (void *)sys_getsockopt,
+    [56] = (void *)sys_clone,
+    [57] = (void *)sys_fork,
+    [58] = (void *)sys_vfork,
+    [59] = (void *)sys_execve,
+    [60] = (void *)sys_exit,
+    [61] = (void *)sys_wait4,
+    [62] = (void *)sys_kill,
+    [63] = (void *)sys_uname,
+    [64] = (void *)sys_semget,
+    [65] = (void *)sys_semop,
+    [66] = (void *)sys_semctl,
+    [67] = (void *)sys_shmdt,
+    [68] = (void *)sys_msgget,
+    [69] = (void *)sys_msgsnd,
+    [70] = (void *)sys_msgrcv,
+    [71] = (void *)sys_msgctl,
+    [72] = (void *)sys_fcntl,
+    [73] = (void *)sys_flock,
+    [74] = (void *)sys_fsync,
+    [75] = (void *)sys_fdatasync,
+    [76] = (void *)sys_truncate,
+    [77] = (void *)sys_ftruncate,
+    [78] = (void *)sys_getdents,
+    [79] = (void *)sys_getcwd,
+    [80] = (void *)sys_chdir,
+    [81] = (void *)sys_fchdir,
+    [82] = (void *)sys_rename,
+    [83] = (void *)sys_mkdir,
+    [84] = (void *)sys_rmdir,
+    [85] = (void *)sys_creat,
+    [86] = (void *)sys_link,
+    [87] = (void *)sys_unlink,
+    [88] = (void *)sys_symlink,
+    [89] = (void *)sys_readlink,
+    [90] = (void *)sys_chmod,
+    [91] = (void *)sys_fchmod,
+    [92] = (void *)sys_chown,
+    [93] = (void *)sys_fchown,
+    [94] = (void *)sys_lchown,
+    [95] = (void *)sys_umask,
+    [96] = (void *)sys_gettimeofday,
+    [97] = (void *)sys_getrlimit,
+    [98] = (void *)sys_getrusage,
+    [99] = (void *)sys_sysinfo,
+    [100] = (void *)sys_times,
+    [101] = (void *)sys_ptrace,
+    [102] = (void *)sys_getuid,
+    [103] = (void *)sys_syslog,
+    [104] = (void *)sys_getgid,
+    [105] = (void *)sys_setuid,
+    [106] = (void *)sys_setgid,
+    [107] = (void *)sys_geteuid,
+    [108] = (void *)sys_getegid,
+    [109] = (void *)sys_setpgid,
+    [110] = (void *)sys_getppid,
+    [111] = (void *)sys_getpgrp,
+    [112] = (void *)sys_setsid,
+    [113] = (void *)sys_setreuid,
+    [114] = (void *)sys_setregid,
+    [115] = (void *)sys_getgroups,
+    [116] = (void *)sys_setgroups,
+    [117] = (void *)sys_setresuid,
+    [118] = (void *)sys_getresuid,
+    [119] = (void *)sys_setresgid,
+    [120] = (void *)sys_getresgid,
+    [121] = (void *)sys_getpgid,
+    [122] = (void *)sys_setfsuid,
+    [123] = (void *)sys_setfsgid,
+    [124] = (void *)sys_getsid,
+    [125] = (void *)sys_capget,
+    [126] = (void *)sys_capset,
+    [127] = (void *)sys_rt_sigpending,
+    [128] = (void *)sys_rt_sigtimedwait,
+    [129] = (void *)sys_rt_sigqueueinfo,
+    [130] = (void *)sys_rt_sigsuspend,
+    [131] = (void *)sys_sigaltstack,
+    [132] = (void *)sys_utime,
+    [133] = (void *)sys_mknod,
+    [134] = (void *)sys_uselib,
+    [135] = (void *)sys_personality,
+    [136] = (void *)sys_ustat,
+    [137] = (void *)sys_statfs,
+    [138] = (void *)sys_fstatfs,
+    [139] = (void *)sys_sysfs,
+    [140] = (void *)sys_getpriority,
+    [141] = (void *)sys_setpriority,
+    [142] = (void *)sys_sched_setparam,
+    [143] = (void *)sys_sched_getparam,
+    [144] = (void *)sys_sched_setscheduler,
+    [145] = (void *)sys_sched_getscheduler,
+    [146] = (void *)sys_sched_get_priority_max,
+    [147] = (void *)sys_sched_get_priority_min,
+    [148] = (void *)sys_sched_rr_get_interval,
+    [149] = (void *)sys_mlock,
+    [150] = (void *)sys_munlock,
+    [151] = (void *)sys_mlockall,
+    [152] = (void *)sys_munlockall,
+    [153] = (void *)sys_vhangup,
+    [154] = (void *)sys_modify_ldt,
+    [155] = (void *)sys_pivot_root,
+    [156] = (void *)sys__sysctl,
+    [157] = (void *)sys_prctl,
+    [158] = (void *)sys_arch_prctl,
+    [159] = (void *)sys_adjtimex,
+    [160] = (void *)sys_setrlimit,
+    [161] = (void *)sys_chroot,
+    [162] = (void *)sys_sync,
+    [163] = (void *)sys_acct,
+    [164] = (void *)sys_settimeofday,
+    [165] = (void *)sys_mount,
+    [166] = (void *)sys_umount2,
+    [167] = (void *)sys_swapon,
+    [168] = (void *)sys_swapoff,
+    [169] = (void *)sys_reboot,
+    [170] = (void *)sys_sethostname,
+    [171] = (void *)sys_setdomainname,
+    [172] = (void *)sys_iopl,
+    [173] = (void *)sys_ioperm,
+    [174] = (void *)sys_create_module,
+    [175] = (void *)sys_init_module,
+    [176] = (void *)sys_delete_module,
+    [177] = (void *)sys_get_kernel_syms,
+    [178] = (void *)sys_query_module,
+    [179] = (void *)sys_quotactl,
+    [180] = (void *)sys_nfsservctl,
+    [181] = (void *)sys_getpmsg,
+    [182] = (void *)sys_putpmsg,
+    [183] = (void *)sys_afs_syscall,
+    [184] = (void *)sys_tuxcall,
+    [185] = (void *)sys_security,
+    [186] = (void *)sys_gettid,
+    [187] = (void *)sys_readahead,
+    [188] = (void *)sys_setxattr,
+    [189] = (void *)sys_lsetxattr,
+    [190] = (void *)sys_fsetxattr,
+    [191] = (void *)sys_getxattr,
+    [192] = (void *)sys_lgetxattr,
+    [193] = (void *)sys_fgetxattr,
+    [194] = (void *)sys_listxattr,
+    [195] = (void *)sys_llistxattr,
+    [196] = (void *)sys_flistxattr,
+    [197] = (void *)sys_removexattr,
+    [198] = (void *)sys_lremovexattr,
+    [199] = (void *)sys_fremovexattr,
+    [200] = (void *)sys_tkill,
+    [201] = (void *)sys_time,
+    [202] = (void *)sys_futex,
+    [203] = (void *)sys_sched_setaffinity,
+    [204] = (void *)sys_sched_getaffinity,
+    [205] = (void *)sys_set_thread_area,
+    [206] = (void *)sys_io_setup,
+    [207] = (void *)sys_io_destroy,
+    [208] = (void *)sys_io_getevents,
+    [209] = (void *)sys_io_submit,
+    [210] = (void *)sys_io_cancel,
+    [211] = (void *)sys_get_thread_area,
+    [212] = (void *)sys_lookup_dcookie,
+    [213] = (void *)sys_epoll_create,
+    [214] = (void *)sys_epoll_ctl_old,
+    [215] = (void *)sys_epoll_wait_old,
+    [216] = (void *)sys_remap_file_pages,
+    [217] = (void *)sys_getdents64,
+    [218] = (void *)sys_set_tid_address,
+    [219] = (void *)sys_restart_syscall,
+    [220] = (void *)sys_semtimedop,
+    [221] = (void *)sys_fadvise64,
+    [222] = (void *)sys_timer_create,
+    [223] = (void *)sys_timer_settime,
+    [224] = (void *)sys_timer_gettime,
+    [225] = (void *)sys_timer_getoverrun,
+    [226] = (void *)sys_timer_delete,
+    [227] = (void *)sys_clock_settime,
+    [228] = (void *)sys_clock_gettime,
+    [229] = (void *)sys_clock_getres,
+    [230] = (void *)sys_clock_nanosleep,
+    [231] = (void *)sys_exit_group,
+    [232] = (void *)sys_epoll_wait,
+    [233] = (void *)sys_epoll_ctl,
+    [234] = (void *)sys_tgkill,
+    [235] = (void *)sys_utimes,
+    [236] = (void *)sys_vserver,
+    [237] = (void *)sys_mbind,
+    [238] = (void *)sys_set_mempolicy,
+    [239] = (void *)sys_get_mempolicy,
+    [240] = (void *)sys_mq_open,
+    [241] = (void *)sys_mq_unlink,
+    [242] = (void *)sys_mq_timedsend,
+    [243] = (void *)sys_mq_timedreceive,
+    [244] = (void *)sys_mq_notify,
+    [245] = (void *)sys_mq_getsetattr,
+    [246] = (void *)sys_kexec_load,
+    [247] = (void *)sys_waitid,
+    [248] = (void *)sys_add_key,
+    [249] = (void *)sys_request_key,
+    [250] = (void *)sys_keyctl,
+    [251] = (void *)sys_ioprio_set,
+    [252] = (void *)sys_ioprio_get,
+    [253] = (void *)sys_inotify_init,
+    [254] = (void *)sys_inotify_add_watch,
+    [255] = (void *)sys_inotify_rm_watch,
+    [256] = (void *)sys_migrate_pages,
+    [257] = (void *)sys_openat,
+    [258] = (void *)sys_mkdirat,
+    [259] = (void *)sys_mknodat,
+    [260] = (void *)sys_fchownat,
+    [261] = (void *)sys_futimesat,
+    [262] = (void *)sys_newfstatat,
+    [263] = (void *)sys_unlinkat,
+    [264] = (void *)sys_renameat,
+    [265] = (void *)sys_linkat,
+    [266] = (void *)sys_symlinkat,
+    [267] = (void *)sys_readlinkat,
+    [268] = (void *)sys_fchmodat,
+    [269] = (void *)sys_faccessat,
+    [270] = (void *)sys_pselect6,
+    [271] = (void *)sys_ppoll,
+    [272] = (void *)sys_unshare,
+    [273] = (void *)sys_set_robust_list,
+    [274] = (void *)sys_get_robust_list,
+    [275] = (void *)sys_splice,
+    [276] = (void *)sys_tee,
+    [277] = (void *)sys_sync_file_range,
+    [278] = (void *)sys_vmsplice,
+    [279] = (void *)sys_move_pages,
+    [280] = (void *)sys_utimensat,
+    [281] = (void *)sys_epoll_pwait,
+    [282] = (void *)sys_signalfd,
+    [283] = (void *)sys_timerfd_create,
+    [284] = (void *)sys_eventfd,
+    [285] = (void *)sys_fallocate,
+    [286] = (void *)sys_timerfd_settime,
+    [287] = (void *)sys_timerfd_gettime,
+    [288] = (void *)sys_accept4,
+    [289] = (void *)sys_signalfd4,
+    [290] = (void *)sys_eventfd2,
+    [291] = (void *)sys_epoll_create1,
+    [292] = (void *)sys_dup3,
+    [293] = (void *)sys_pipe2,
+    [294] = (void *)sys_inotify_init1,
+    [295] = (void *)sys_preadv,
+    [296] = (void *)sys_pwritev,
+    [297] = (void *)sys_rt_tgsigqueueinfo,
+    [298] = (void *)sys_perf_event_open,
+    [299] = (void *)sys_recvmmsg,
+    [300] = (void *)sys_fanotify_init,
+    [301] = (void *)sys_fanotify_mark,
+    [302] = (void *)sys_prlimit64,
+    [303] = (void *)sys_name_to_handle_at,
+    [304] = (void *)sys_open_by_handle_at,
+    [305] = (void *)sys_clock_adjtime,
+    [306] = (void *)sys_syncfs,
+    [307] = (void *)sys_sendmmsg,
+    [308] = (void *)sys_setns,
+    [309] = (void *)sys_getcpu,
+    [310] = (void *)sys_process_vm_readv,
+    [311] = (void *)sys_process_vm_writev,
+    [312] = (void *)sys_kcmp,
+    [313] = (void *)sys_finit_module,
+    [314] = (void *)sys_sched_setattr,
+    [315] = (void *)sys_sched_getattr,
+    [316] = (void *)sys_renameat2,
+    [317] = (void *)sys_seccomp,
+    [318] = (void *)sys_getrandom,
+    [319] = (void *)sys_memfd_create,
+    [320] = (void *)sys_kexec_file_load,
+    [321] = (void *)sys_bpf,
+    [322] = (void *)stub_execveat,
+    [323] = (void *)userfaultfd,
+    [324] = (void *)membarrier,
+    [325] = (void *)mlock2,
+    [326] = (void *)copy_file_range,
+    [327] = (void *)preadv2,
+    [328] = (void *)pwritev2,
+    [329] = (void *)pkey_mprotect,
+    [330] = (void *)pkey_alloc,
+    [331] = (void *)pkey_free,
+    [332] = (void *)statx,
+    [333] = (void *)io_pgetevents,
+    [334] = (void *)rseq,
+    [335] = (void *)pkey_mprotect_,
+};
+
+uintptr_t HandleLinuxSyscalls(SyscallsFrame *Frame)
+{
+#if defined(a64)
+    if (Frame->rax > sizeof(LinuxSyscallsTable))
+    {
+        fixme("Syscall %lld not implemented", Frame->rax);
+        return -1;
+    }
+
+    uint64_t (*call)(uint64_t, ...) = reinterpret_cast<uint64_t (*)(uint64_t, ...)>(LinuxSyscallsTable[Frame->rax]);
+    if (!call)
+    {
+        error("Syscall %#llx failed.", Frame->rax);
+        return -1;
+    }
+    uint64_t ret = call(Frame->rdi, Frame->rsi, Frame->rdx, Frame->r10, Frame->r8, Frame->r9);
+    Frame->rax = ret;
+    return ret;
+#elif defined(a32)
+    return 0;
+#elif defined(aa64)
+    return 0;
+#endif
+}
diff --git a/Kernel/SystemCalls/Native.cpp b/Kernel/SystemCalls/Native.cpp
new file mode 100644
index 00000000..2e34d325
--- /dev/null
+++ b/Kernel/SystemCalls/Native.cpp
@@ -0,0 +1,466 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <syscalls.hpp>
+#include <memory.hpp>
+#include <lock.hpp>
+#include <exec.hpp>
+
+#include <debug.h>
+
+#include "../syscalls.h"
+#include "../kernel.h"
+
+#include "../ipc.h"
+
+using InterProcessCommunication::IPC;
+using InterProcessCommunication::IPCID;
+using Tasking::Token;
+using Tasking::TTL;
+using Tasking::TTL::Trusted;
+using Tasking::TTL::TrustedByKernel;
+using Tasking::TTL::UnknownTrustLevel;
+using Tasking::TTL::Untrusted;
+
+static inline bool CheckTrust(int TrustLevel)
+{
+    // SmartTimeoutLock(SyscallsLock, 10000); - This is already done in the caller
+    Token token = TaskManager->GetCurrentThread()->Security.UniqueToken;
+    if (TaskManager->GetSecurityManager()->IsTokenTrusted(token, TrustLevel))
+        return true;
+
+    warn("Thread %s(%lld) tried to access a system call \"%s\" with insufficient trust level",
+         TaskManager->GetCurrentThread()->Name, TaskManager->GetCurrentThread()->ID,
+         KernelSymbolTable->GetSymbolFromAddress((uintptr_t)__builtin_extract_return_addr(__builtin_return_address(0))));
+    debug("Token: token=%#lx, trust=%d", token, TaskManager->GetSecurityManager()->GetTokenTrustLevel(token));
+    return false;
+}
+
+static int sys_exit(SyscallsFrame *Frame, int code)
+{
+    /* Allow everyone to exit */
+    if (!CheckTrust(TrustedByKernel | Trusted | Untrusted | UnknownTrustLevel))
+        return SYSCALL_ACCESS_DENIED;
+
+    trace("Userspace thread %s(%lld) exited with code %#llx", TaskManager->GetCurrentThread()->Name, TaskManager->GetCurrentThread()->ID, code);
+    TaskManager->GetCurrentThread()->ExitCode = code;
+    TaskManager->GetCurrentThread()->Status = Tasking::TaskStatus::Terminated;
+    UNUSED(Frame);
+    return SYSCALL_OK;
+}
+
+static int sys_print(SyscallsFrame *Frame, char Char, int Index)
+{
+    /* Only trusted threads can write to the kernel console */
+    if (!CheckTrust(TrustedByKernel | Trusted))
+        return SYSCALL_ACCESS_DENIED;
+
+    char ret = Display->Print(Char, Index, true);
+    if (!Config.BootAnimation && Index == 0)
+#ifdef DEBUG
+        Display->SetBuffer(Index);
+#else
+        if (Char == '\n')
+            Display->SetBuffer(Index);
+#endif
+    UNUSED(Frame);
+    return ret;
+}
+
+static uintptr_t sys_request_pages(SyscallsFrame *Frame, size_t Count)
+{
+    /* Allow everyone to request pages */
+    if (!CheckTrust(TrustedByKernel | Trusted | Untrusted))
+        return SYSCALL_ACCESS_DENIED;
+    UNUSED(Frame);
+    return (uintptr_t)TaskManager->GetCurrentThread()->Memory->RequestPages(Count + 1, true);
+}
+
+static int sys_free_pages(SyscallsFrame *Frame, uintptr_t Address, size_t Count)
+{
+    /* Allow everyone to free pages */
+    if (!CheckTrust(TrustedByKernel | Trusted | Untrusted))
+        return SYSCALL_ACCESS_DENIED;
+    TaskManager->GetCurrentThread()->Memory->FreePages((void *)Address, Count + 1);
+    UNUSED(Frame);
+    return SYSCALL_OK;
+}
+
+static int sys_detach_address(SyscallsFrame *Frame, uintptr_t Address)
+{
+    /* Only trusted threads can detach allocated addresses */
+    if (!CheckTrust(TrustedByKernel | Trusted))
+        return SYSCALL_ACCESS_DENIED;
+    TaskManager->GetCurrentThread()->Memory->DetachAddress((void *)Address);
+    UNUSED(Frame);
+    return SYSCALL_OK;
+}
+
+static uintptr_t sys_kernelctl(SyscallsFrame *Frame, uint64_t Command, uint64_t Arg1, uint64_t Arg2, uint64_t Arg3, uint64_t Arg4)
+{
+    if (!CheckTrust(TrustedByKernel | Trusted | Untrusted))
+        return SYSCALL_ACCESS_DENIED;
+
+    return SYSCALL_NOT_IMPLEMENTED;
+
+    // switch (Command)
+    // {
+    // case KCTL_GET_PID:
+    //     return TaskManager->GetCurrentThread()->Parent->ID;
+    // case KCTL_GET_TID:
+    //     return TaskManager->GetCurrentThread()->ID;
+    // case KCTL_GET_PAGE_SIZE:
+    //     return PAGE_SIZE;
+    // case KCTL_IS_CRITICAL:
+    //     return TaskManager->GetCurrentThread()->Security.IsCritical;
+    // case KCTL_REGISTER_ELF_LIB:
+    // {
+    //     if (!CheckTrust(TrustedByKernel | Trusted))
+    //         return SYSCALL_ACCESS_DENIED;
+    //     char *Identifier = (char *)Arg1;
+    //     const char *Path = (const char *)Arg2;
+
+    //     if (!Identifier || !Path)
+    //         return SYSCALL_INVALID_ARGUMENT;
+
+    //     std::string FullPath = Path;
+    //     int retries = 0;
+    // RetryReadPath:
+    //     debug("KCTL_REGISTER_ELF_LIB: Trying to open %s", FullPath.c_str());
+    //     VirtualFileSystem::File f = vfs->Open(FullPath.c_str());
+
+    //     if (!f.IsOK())
+    //     {
+    //         FullPath.clear();
+    //         switch (retries)
+    //         {
+    //         case 0:
+    //             FullPath = "/system/lib/";
+    //             break;
+    //         case 1:
+    //             FullPath = "/system/lib64/";
+    //             break;
+    //         case 2:
+    //             FullPath = "/system/";
+    //             break;
+    //         case 3:
+    //         {
+    //             // TODO: Check process binary path
+    //             break;
+    //         }
+    //         default:
+    //         {
+    //             vfs->Close(f);
+    //             return SYSCALL_INVALID_ARGUMENT;
+    //         }
+    //         }
+    //         FullPath += Path;
+    //         vfs->Close(f);
+    //         retries++;
+    //         goto RetryReadPath;
+    //     }
+
+    //     vfs->Close(f);
+    //     if (Execute::AddLibrary(Identifier, (void *)f.node->Address, f.node->Length))
+    //         return SYSCALL_OK;
+    //     else
+    //         return SYSCALL_INTERNAL_ERROR;
+    // }
+    // case KCTL_GET_ELF_LIB_FILE:
+    // {
+    //     if (!CheckTrust(TrustedByKernel | Trusted))
+    //         return SYSCALL_ACCESS_DENIED;
+    //     char *Identifier = (char *)Arg1;
+    //     if (!Identifier)
+    //         return 0;
+
+    //     Execute::SharedLibraries lib = Execute::GetLibrary(Identifier);
+    //     if (!lib.Address)
+    //     {
+    //         debug("Failed to get library address %#lx", (uintptr_t)lib.Address);
+    //     }
+
+    //     debug("Returning library address %#lx (%s)", (uintptr_t)lib.Address, Identifier);
+    //     return (uintptr_t)lib.Address;
+    // }
+    // case KCTL_GET_ELF_LIB_MEMORY_IMAGE:
+    // {
+    //     if (!CheckTrust(TrustedByKernel | Trusted))
+    //         return SYSCALL_ACCESS_DENIED;
+    //     char *Identifier = (char *)Arg1;
+    //     if (!Identifier)
+    //         return 0;
+
+    //     Execute::SharedLibraries lib = Execute::GetLibrary(Identifier);
+
+    //     if (!lib.MemoryImage)
+    //     {
+    //         debug("Failed to get library memory image %#lx", (uintptr_t)lib.MemoryImage);
+    //     }
+
+    //     debug("Returning memory image %#lx (%s)", (uintptr_t)lib.MemoryImage, Identifier);
+    //     return (uintptr_t)lib.MemoryImage;
+    // }
+    // case KCTL_GET_FRAMEBUFFER_BUFFER:
+    //     return r_cst(uint64_t, Display->GetBuffer(0)->Buffer);
+    // case KCTL_GET_FRAMEBUFFER_WIDTH:
+    //     return Display->GetBuffer(0)->Width;
+    // case KCTL_GET_FRAMEBUFFER_HEIGHT:
+    //     return Display->GetBuffer(0)->Height;
+    // case KCTL_GET_FRAMEBUFFER_SIZE:
+    //     return Display->GetBuffer(0)->Size;
+    // default:
+    // {
+    //     warn("KernelCTL: Unknown command: %lld", Command);
+    //     return SYSCALL_INVALID_ARGUMENT;
+    // }
+    // }
+
+    UNUSED(Arg1);
+    UNUSED(Arg2);
+    UNUSED(Arg3);
+    UNUSED(Arg4);
+    UNUSED(Frame);
+}
+
+static int sys_ipc(SyscallsFrame *Frame, enum IPCCommand Command, enum IPCType Type, int ID, int Flags, void *Buffer, size_t Size)
+{
+    /* Allow everyone to use IPC */
+    if (!CheckTrust(TrustedByKernel | Trusted | Untrusted))
+        return SYSCALL_ACCESS_DENIED;
+    UNUSED(Frame);
+    return TaskManager->GetCurrentProcess()->IPC->HandleSyscall(Command, Type, ID, Flags, Buffer, Size);
+}
+
+static uint64_t sys_file_open(SyscallsFrame *Frame, const char *Path, uint64_t Flags)
+{
+    debug("(Path: %s, Flags: %#lx)", Path, Flags);
+    VirtualFileSystem::File KPObj = vfs->Open(Path);
+    if (!KPObj.IsOK())
+    {
+        debug("Failed to open file %s (%d)", Path, KPObj.Status);
+        vfs->Close(KPObj);
+        return SYSCALL_INTERNAL_ERROR;
+    }
+
+    VirtualFileSystem::File *KernelPrivate = (VirtualFileSystem::File *)TaskManager->GetCurrentThread()->Memory->RequestPages(TO_PAGES(sizeof(VirtualFileSystem::File)));
+    *KernelPrivate = KPObj;
+    debug("Opened file %s (%d)", KPObj.Name, KPObj.Status);
+    return (uint64_t)KernelPrivate;
+    UNUSED(Frame);
+    UNUSED(Flags);
+}
+
+static int sys_file_close(SyscallsFrame *Frame, void *KernelPrivate)
+{
+    debug("(KernelPrivate: %#lx)", KernelPrivate);
+    if (KernelPrivate)
+    {
+        VirtualFileSystem::File KPObj = *(VirtualFileSystem::File *)KernelPrivate;
+        debug("Closed file %s (%d)", KPObj.Name, KPObj.Status);
+        vfs->Close(KPObj);
+        TaskManager->GetCurrentThread()->Memory->FreePages(KernelPrivate, TO_PAGES(sizeof(VirtualFileSystem::File)));
+        return SYSCALL_OK;
+    }
+    return SYSCALL_INVALID_ARGUMENT;
+    UNUSED(Frame);
+}
+
+static uint64_t sys_file_read(SyscallsFrame *Frame, void *KernelPrivate, uint64_t Offset, uint8_t *Buffer, uint64_t Size)
+{
+    debug("(KernelPrivate: %#lx, Offset: %#lx, Buffer: %#lx, Size: %#lx)", KernelPrivate, Offset, Buffer, Size);
+    return vfs->Read(*(VirtualFileSystem::File *)KernelPrivate, Offset, Buffer, Size);
+    UNUSED(Frame);
+}
+
+static uint64_t sys_file_write(SyscallsFrame *Frame, void *KernelPrivate, uint64_t Offset, uint8_t *Buffer, uint64_t Size)
+{
+    debug("(KernelPrivate: %#lx, Offset: %#lx, Buffer: %#lx, Size: %#lx)", KernelPrivate, Offset, Buffer, Size);
+    return vfs->Write(*(VirtualFileSystem::File *)KernelPrivate, Offset, Buffer, Size);
+    UNUSED(Frame);
+}
+
+static int sys_file_seek(SyscallsFrame *Frame)
+{
+    fixme("sys_file_seek: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_file_status(SyscallsFrame *Frame)
+{
+    fixme("sys_file_status: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_sleep(SyscallsFrame *Frame, uint64_t Milliseconds)
+{
+    UNUSED(Frame);
+    if (!CheckTrust(TrustedByKernel | Trusted | Untrusted))
+        return SYSCALL_ACCESS_DENIED;
+    TaskManager->Sleep(Milliseconds);
+    return 0;
+}
+
+static int sys_wait(SyscallsFrame *Frame)
+{
+    fixme("sys_wait: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_kill(SyscallsFrame *Frame)
+{
+    fixme("sys_kill: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_spawn(SyscallsFrame *Frame)
+{
+    fixme("sys_spawn: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_spawn_thread(SyscallsFrame *Frame)
+{
+    fixme("sys_spawn_thread: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_get_thread_list_of_process(SyscallsFrame *Frame)
+{
+    fixme("sys_get_thread_list_of_process: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_get_current_process(SyscallsFrame *Frame)
+{
+    fixme("sys_get_current_process: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_get_current_thread(SyscallsFrame *Frame)
+{
+    fixme("sys_get_current_thread: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_get_process_by_pid(SyscallsFrame *Frame)
+{
+    fixme("sys_get_process_by_pid: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_get_thread_by_tid(SyscallsFrame *Frame)
+{
+    fixme("sys_get_thread_by_tid: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_kill_process(SyscallsFrame *Frame)
+{
+    fixme("sys_kill_process: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_kill_thread(SyscallsFrame *Frame)
+{
+    fixme("sys_kill_thread: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_sys_reserved_create_process(SyscallsFrame *Frame)
+{
+    fixme("sys_sys_reserved_create_process: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static int sys_sys_reserved_create_thread(SyscallsFrame *Frame)
+{
+    fixme("sys_sys_reserved_create_thread: %#lx", Frame);
+    return SYSCALL_NOT_IMPLEMENTED;
+}
+
+static void *NativeSyscallsTable[] = {
+    [_Exit] = (void *)sys_exit,
+    [_Print] = (void *)sys_print,
+
+    [_RequestPages] = (void *)sys_request_pages,
+    [_FreePages] = (void *)sys_free_pages,
+    [_DetachAddress] = (void *)sys_detach_address,
+
+    [_KernelCTL] = (void *)sys_kernelctl,
+    [_IPC] = (void *)sys_ipc,
+
+    [_FileOpen] = (void *)sys_file_open,
+    [_FileClose] = (void *)sys_file_close,
+    [_FileRead] = (void *)sys_file_read,
+    [_FileWrite] = (void *)sys_file_write,
+    [_FileSeek] = (void *)sys_file_seek,
+    [_FileStatus] = (void *)sys_file_status,
+
+    [_Sleep] = (void *)sys_sleep,
+    [_Wait] = (void *)sys_wait,
+    [_Kill] = (void *)sys_kill,
+    [_Spawn] = (void *)sys_spawn,
+    [_SpawnThread] = (void *)sys_spawn_thread,
+    [_GetThreadListOfProcess] = (void *)sys_get_thread_list_of_process,
+    [_GetCurrentProcess] = (void *)sys_get_current_process,
+    [_GetCurrentThread] = (void *)sys_get_current_thread,
+    [_GetProcessByPID] = (void *)sys_get_process_by_pid,
+    [_GetThreadByTID] = (void *)sys_get_thread_by_tid,
+    [_KillProcess] = (void *)sys_kill_process,
+    [_KillThread] = (void *)sys_kill_thread,
+    [_SysReservedCreateProcess] = (void *)sys_sys_reserved_create_process,
+    [_SysReservedCreateThread] = (void *)sys_sys_reserved_create_thread,
+};
+
+uintptr_t HandleNativeSyscalls(SyscallsFrame *Frame)
+{
+#if defined(a64)
+    if (Frame->rax > sizeof(NativeSyscallsTable))
+    {
+        fixme("Syscall %ld not implemented", Frame->rax);
+        return SYSCALL_NOT_IMPLEMENTED;
+    }
+
+    uintptr_t (*call)(uintptr_t, ...) = reinterpret_cast<uintptr_t (*)(uintptr_t, ...)>(NativeSyscallsTable[Frame->rax]);
+    if (!call)
+    {
+        error("Syscall %#lx failed.", Frame->rax);
+        return SYSCALL_INTERNAL_ERROR;
+    }
+
+    // debug("[%#lx]->( %#lx  %#lx  %#lx  %#lx  %#lx  %#lx )",
+    //       Frame->rax,
+    //       Frame->rdi, Frame->rsi, Frame->rdx, Frame->rcx, Frame->r8, Frame->r9);
+
+    uintptr_t ret = call((uintptr_t)Frame, Frame->rdi, Frame->rsi, Frame->rdx, Frame->r10, Frame->r8, Frame->r9);
+    Frame->rax = ret;
+    return ret;
+#elif defined(a32)
+    if (Frame->eax > sizeof(NativeSyscallsTable))
+    {
+        fixme("Syscall %ld not implemented", Frame->eax);
+        return SYSCALL_NOT_IMPLEMENTED;
+    }
+
+    /* ... */
+
+    return SYSCALL_INTERNAL_ERROR;
+#elif defined(aa64)
+    return SYSCALL_INTERNAL_ERROR;
+#endif
+}
diff --git a/Kernel/SystemCalls/Syscalls.cpp b/Kernel/SystemCalls/Syscalls.cpp
new file mode 100644
index 00000000..c9740a0c
--- /dev/null
+++ b/Kernel/SystemCalls/Syscalls.cpp
@@ -0,0 +1,65 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <syscalls.hpp>
+
+#include <debug.h>
+
+#include "../kernel.h"
+
+NewLock(SyscallsLock);
+
+extern "C" uintptr_t SystemCallsHandler(SyscallsFrame *Frame)
+{
+    CPU::Interrupts(CPU::Enable);
+    SmartLock(SyscallsLock); /* TODO: This should be replaced or moved somewhere else. */
+
+    Tasking::TaskInfo *Ptinfo = &TaskManager->GetCurrentProcess()->Info;
+    Tasking::TaskInfo *Ttinfo = &TaskManager->GetCurrentThread()->Info;
+    uint64_t TempTimeCalc = TimeManager->GetCounter();
+
+    switch (Ttinfo->Compatibility)
+    {
+    case Tasking::TaskCompatibility::Native:
+    {
+        uintptr_t ret = HandleNativeSyscalls(Frame);
+        Ptinfo->KernelTime += TimeManager->GetCounter() - TempTimeCalc;
+        Ttinfo->KernelTime += TimeManager->GetCounter() - TempTimeCalc;
+        return ret;
+    }
+    case Tasking::TaskCompatibility::Linux:
+    {
+        uintptr_t ret = HandleLinuxSyscalls(Frame);
+        Ptinfo->KernelTime += TimeManager->GetCounter() - TempTimeCalc;
+        Ttinfo->KernelTime += TimeManager->GetCounter() - TempTimeCalc;
+        return ret;
+    }
+    case Tasking::TaskCompatibility::Windows:
+    {
+        error("Windows compatibility not implemented yet.");
+        break;
+    }
+    default:
+    {
+        error("Unknown compatibility mode! Killing thread...");
+        TaskManager->KillThread(TaskManager->GetCurrentThread(), -0xCA11);
+        break;
+    }
+    }
+    assert(false); /* Should never reach here. */
+    return 0;
+}
diff --git a/Kernel/Tasking/InterProcessCommunication.cpp b/Kernel/Tasking/InterProcessCommunication.cpp
new file mode 100644
index 00000000..b68954c9
--- /dev/null
+++ b/Kernel/Tasking/InterProcessCommunication.cpp
@@ -0,0 +1,259 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <ipc.hpp>
+
+#include <task.hpp>
+
+#include "../kernel.h"
+#include "../ipc.h"
+
+namespace InterProcessCommunication
+{
+    IPCHandle *IPC::Create(IPCType Type, char UniqueToken[16])
+    {
+        SmartLock(this->IPCLock);
+        IPCHandle *Hnd = (IPCHandle *)mem->RequestPages(TO_PAGES(sizeof(IPCHandle) + 1));
+
+        Hnd->ID = NextID++;
+        Hnd->Node = vfs->Create(UniqueToken, VirtualFileSystem::NodeFlags::FILE, IPCNode);
+        Hnd->Buffer = nullptr;
+        Hnd->Length = 0;
+        Hnd->Listening = false;
+
+        Handles.push_back(Hnd);
+        debug("Created IPC with ID %d", Hnd->ID);
+        return Hnd;
+    }
+
+    IPCErrorCode IPC::Destroy(IPCID ID)
+    {
+        SmartLock(this->IPCLock);
+        for (size_t i = 0; i < Handles.size(); i++)
+        {
+            if (Handles[i]->ID == ID)
+            {
+                vfs->Delete(Handles[i]->Node);
+                mem->FreePages(Handles[i], TO_PAGES(sizeof(IPCHandle) + 1));
+                Handles.remove(i);
+                debug("Destroyed IPC with ID %d", ID);
+                return IPCSuccess;
+            }
+        }
+        debug("Failed to destroy IPC with ID %d", ID);
+        return IPCIDNotFound;
+    }
+
+    IPCErrorCode IPC::Allocate(IPCID ID, long Size)
+    {
+        SmartLock(this->IPCLock);
+        if (Size < 0)
+            return IPCError;
+
+        foreach (auto Hnd in Handles)
+        {
+            if (Hnd->ID == ID)
+            {
+                if (Hnd->Buffer != nullptr || Hnd->Length != 0)
+                    return IPCAlreadyAllocated;
+
+                Hnd->Buffer = (uint8_t *)mem->RequestPages(TO_PAGES(Size + 1));
+                Hnd->Length = Size;
+                return IPCSuccess;
+            }
+        }
+        return IPCIDNotFound;
+    }
+
+    IPCErrorCode IPC::Deallocate(IPCID ID)
+    {
+        SmartLock(this->IPCLock);
+        foreach (auto Hnd in Handles)
+        {
+            if (Hnd->ID == ID)
+            {
+                if (Hnd->Buffer == nullptr || Hnd->Length == 0)
+                    return IPCNotAllocated;
+
+                mem->FreePages(Hnd->Buffer, TO_PAGES(Hnd->Length + 1));
+                Hnd->Buffer = nullptr;
+                Hnd->Length = 0;
+                return IPCSuccess;
+            }
+        }
+        return IPCIDNotFound;
+    }
+
+    IPCErrorCode IPC::Read(IPCID ID, void *Buffer, long Size)
+    {
+        SmartLock(this->IPCLock);
+        if (Size < 0)
+            return IPCError;
+
+        foreach (auto Hnd in Handles)
+        {
+            if (Hnd->ID == ID)
+            {
+                if (Hnd->Listening)
+                {
+                    debug("IPC %d is listening", ID);
+                    return IPCNotListening;
+                }
+                if (Hnd->Length < Size)
+                {
+                    debug("IPC %d is too small", ID);
+                    return IPCError;
+                }
+                debug("IPC %d reading %d bytes", ID, Size);
+                memcpy(Buffer, Hnd->Buffer, Size);
+                debug("IPC read %d bytes", Size);
+                return IPCSuccess;
+            }
+        }
+        debug("IPC %d not found", ID);
+        return IPCIDNotFound;
+    }
+
+    IPCErrorCode IPC::Write(IPCID ID, void *Buffer, long Size)
+    {
+        SmartLock(this->IPCLock);
+        if (Size < 0)
+        {
+            debug("IPC %d is too small", ID);
+            return IPCError;
+        }
+
+        foreach (auto Hnd in Handles)
+        {
+            if (Hnd->ID == ID)
+            {
+                if (!Hnd->Listening)
+                {
+                    debug("IPC %d is NOT listening", ID);
+                    return IPCNotListening;
+                }
+                if (Hnd->Length < Size)
+                {
+                    debug("IPC %d is too small", ID);
+                    return IPCError;
+                }
+                debug("IPC %d writing %d bytes", ID, Size);
+                memcpy(Hnd->Buffer, Buffer, Size);
+                Hnd->Listening = false;
+                debug("IPC %d wrote %d bytes and now is %s", ID, Size, Hnd->Listening ? "listening" : "ready");
+                return IPCSuccess;
+            }
+        }
+        debug("IPC %d not found", ID);
+        return IPCIDNotFound;
+    }
+
+    IPCErrorCode IPC::Listen(IPCID ID, bool Listen)
+    {
+        foreach (auto Hnd in Handles)
+        {
+            if (Hnd->ID == ID)
+            {
+                Hnd->Listening = Listen;
+                debug("IPC %d is now set to %s", ID, Listen ? "listening" : "ready");
+                return IPCSuccess;
+            }
+        }
+        debug("IPC %d not found", ID);
+        return IPCIDNotFound;
+    }
+
+    IPCErrorCode IPC::Wait(IPCID ID)
+    {
+        foreach (auto Hnd in Handles)
+        {
+            if (Hnd->ID == ID)
+            {
+                if (!CPU::Interrupts())
+                    warn("Interrupts are disabled. This may cause a kernel hang.");
+                debug("Waiting for IPC %d (now %s)", ID, Hnd->Listening ? "listening" : "ready");
+                while (Hnd->Listening)
+                    CPU::Pause();
+                debug("IPC %d is ready", ID);
+                return IPCSuccess;
+            }
+        }
+        debug("IPC %d not found", ID);
+        return IPCIDNotFound;
+    }
+
+    IPCHandle *IPC::SearchByToken(char UniqueToken[16])
+    {
+        foreach (auto Hnd in Handles)
+        {
+            if (strcmp(Hnd->Node->Name, UniqueToken) == 0)
+            {
+                debug("Found IPC with token %s", UniqueToken);
+                return Hnd;
+            }
+        }
+        debug("Failed to find IPC with token %s", UniqueToken);
+        return nullptr;
+    }
+
+    int IPC::HandleSyscall(long Command, long Type, int ID, int Flags, void *Buffer, size_t Size)
+    {
+        switch (Command)
+        {
+        case IPC_CREATE:
+        {
+            char UniqueToken[16];
+            if (Buffer != nullptr)
+                strcpy(UniqueToken, (char *)Buffer);
+            else
+                snprintf(UniqueToken, 16, "IPC_%d", ID);
+            IPCHandle *Hnd = this->Create((IPCType)Type, UniqueToken);
+            this->Allocate(Hnd->ID, Size ? Size : PAGE_SIZE);
+            return Hnd->ID;
+        }
+        case IPC_READ:
+            return this->Read(ID, Buffer, Size);
+        case IPC_WRITE:
+            return TaskManager->GetProcessByID(Flags)->IPC->Write(ID, Buffer, Size);
+        case IPC_DELETE:
+        {
+            this->Deallocate(ID);
+            return this->Destroy(ID);
+        }
+        case IPC_WAIT:
+            return this->Wait(ID);
+        case IPC_LISTEN:
+            return this->Listen(ID, Flags);
+        default:
+            return IPCInvalidCommand;
+        }
+        return IPCError;
+    }
+
+    IPC::IPC(void *Process)
+    {
+        this->Process = Process;
+        mem = new Memory::MemMgr(nullptr, ((Tasking::PCB *)Process)->memDirectory);
+        IPCNode = vfs->Create("ipc", VirtualFileSystem::NodeFlags::DIRECTORY, ((Tasking::PCB *)this->Process)->ProcessDirectory);
+    }
+
+    IPC::~IPC()
+    {
+        delete mem, mem = nullptr;
+        vfs->Delete(IPCNode, true);
+    }
+}
diff --git a/Kernel/Tasking/Scheduler.cpp b/Kernel/Tasking/Scheduler.cpp
new file mode 100644
index 00000000..7d410264
--- /dev/null
+++ b/Kernel/Tasking/Scheduler.cpp
@@ -0,0 +1,727 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <task.hpp>
+
+#include <dumper.hpp>
+#include <convert.h>
+#include <lock.hpp>
+#include <printf.h>
+#include <smp.hpp>
+#include <io.h>
+
+#include "../kernel.h"
+
+#if defined(a64)
+#include "../Architecture/amd64/cpu/apic.hpp"
+#include "../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#include "../Architecture/i386/cpu/apic.hpp"
+#elif defined(aa64)
+#endif
+
+NewLock(SchedulerLock);
+
+/* FIXME: On screen task manager is corrupting the stack... */
+// #define ON_SCREEN_SCHEDULER_TASK_MANAGER 1
+
+// #define DEBUG_SCHEDULER 1
+// #define DEBUG_GET_NEXT_AVAILABLE_PROCESS 1
+// #define DEBUG_GET_NEXT_AVAILABLE_THREAD 1
+// #define DEBUG_FIND_NEW_PROCESS 1
+// #define DEBUG_SCHEDULER_SEARCH_PROCESS_THREAD 1
+// #define DEBUG_WAKE_UP_THREADS 1
+
+/* Global */
+#ifdef DEBUG_SCHEDULER
+
+#define DEBUG_GET_NEXT_AVAILABLE_PROCESS 1
+#define DEBUG_GET_NEXT_AVAILABLE_THREAD 1
+#define DEBUG_FIND_NEW_PROCESS 1
+#define DEBUG_SCHEDULER_SEARCH_PROCESS_THREAD 1
+#define DEBUG_WAKE_UP_THREADS 1
+
+#define schedbg(m, ...)      \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define schedbg(m, ...)
+#endif
+
+/* GetNextAvailableThread */
+#ifdef DEBUG_GET_NEXT_AVAILABLE_PROCESS
+#define gnap_schedbg(m, ...) \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define gnap_schedbg(m, ...)
+#endif
+
+/* GetNextAvailableProcess */
+#ifdef DEBUG_GET_NEXT_AVAILABLE_THREAD
+#define gnat_schedbg(m, ...) \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define gnat_schedbg(m, ...)
+#endif
+
+/* FindNewProcess */
+#ifdef DEBUG_FIND_NEW_PROCESS
+#define fnp_schedbg(m, ...)  \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define fnp_schedbg(m, ...)
+#endif
+
+/* SchedulerSearchProcessThread */
+#ifdef DEBUG_SCHEDULER_SEARCH_PROCESS_THREAD
+#define sspt_schedbg(m, ...) \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define sspt_schedbg(m, ...)
+#endif
+
+/* WakeUpThreads */
+#ifdef DEBUG_WAKE_UP_THREADS
+#define wut_schedbg(m, ...)  \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define wut_schedbg(m, ...)
+#endif
+
+extern "C" SafeFunction NIF void TaskingScheduler_OneShot(int TimeSlice)
+{
+    if (TimeSlice == 0)
+        TimeSlice = Tasking::TaskPriority::Normal;
+#if defined(a64)
+    ((APIC::Timer *)Interrupts::apicTimer[GetCurrentCPU()->ID])->OneShot(CPU::x86::IRQ16, TimeSlice);
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+}
+
+namespace Tasking
+{
+#if defined(a64)
+    SafeFunction NIF bool Task::FindNewProcess(void *CPUDataPointer)
+    {
+        CPUData *CurrentCPU = (CPUData *)CPUDataPointer;
+        fnp_schedbg("%d processes", ProcessList.size());
+#ifdef DEBUG_FIND_NEW_PROCESS
+        foreach (auto process in ProcessList)
+            fnp_schedbg("Process %d %s", process->ID, process->Name);
+#endif
+        foreach (auto process in ProcessList)
+        {
+            if (InvalidPCB(process))
+                continue;
+
+            switch (process->Status)
+            {
+            case TaskStatus::Ready:
+                fnp_schedbg("Ready process (%s)%d",
+                            process->Name, process->ID);
+                break;
+            default:
+                fnp_schedbg("Process \"%s\"(%d) status %d",
+                            process->Name, process->ID,
+                            process->Status);
+
+                /* We don't actually remove the process. RemoveProcess
+                   firstly checks if it's terminated, if not, it will
+                   loop through Threads and call RemoveThread on
+                   terminated threads. */
+                RemoveProcess(process);
+                continue;
+            }
+
+            foreach (auto thread in process->Threads)
+            {
+                if (InvalidTCB(thread))
+                    continue;
+
+                if (thread->Status != TaskStatus::Ready)
+                    continue;
+
+                if (thread->Info.Affinity[CurrentCPU->ID] == false)
+                    continue;
+
+                CurrentCPU->CurrentProcess = process;
+                CurrentCPU->CurrentThread = thread;
+                return true;
+            }
+        }
+        fnp_schedbg("No process to run.");
+        return false;
+    }
+
+    SafeFunction NIF bool Task::GetNextAvailableThread(void *CPUDataPointer)
+    {
+        CPUData *CurrentCPU = (CPUData *)CPUDataPointer;
+
+        for (size_t i = 0; i < CurrentCPU->CurrentProcess->Threads.size(); i++)
+        {
+            if (CurrentCPU->CurrentProcess->Threads[i] == CurrentCPU->CurrentThread.load())
+            {
+                size_t TempIndex = i;
+            RetryAnotherThread:
+                TCB *nextThread = CurrentCPU->CurrentProcess->Threads[TempIndex + 1];
+
+                if (unlikely(InvalidTCB(nextThread)))
+                {
+                    if (TempIndex > CurrentCPU->CurrentProcess->Threads.size())
+                        break;
+                    TempIndex++;
+
+                    gnat_schedbg("Thread %#lx is invalid", nextThread);
+                    goto RetryAnotherThread;
+                }
+
+                gnat_schedbg("\"%s\"(%d) and next thread is \"%s\"(%d)",
+                             CurrentCPU->CurrentProcess->Threads[i]->Name,
+                             CurrentCPU->CurrentProcess->Threads[i]->ID,
+                             thread->Name, thread->ID);
+
+                if (nextThread->Status != TaskStatus::Ready)
+                {
+                    gnat_schedbg("Thread %d is not ready", nextThread->ID);
+                    TempIndex++;
+                    goto RetryAnotherThread;
+                }
+
+                if (nextThread->Info.Affinity[CurrentCPU->ID] == false)
+                    continue;
+
+                CurrentCPU->CurrentThread = nextThread;
+                gnat_schedbg("[thd 0 -> end] Scheduling thread %d parent of %s->%d Procs %d",
+                             thread->ID, thread->Parent->Name,
+                             CurrentCPU->CurrentProcess->Threads.size(), ProcessList.size());
+                return true;
+            }
+#ifdef DEBUG
+            else
+            {
+                gnat_schedbg("Thread %d is not the current one",
+                             CurrentCPU->CurrentProcess->Threads[i]->ID);
+            }
+#endif
+        }
+        return false;
+    }
+
+    SafeFunction NIF bool Task::GetNextAvailableProcess(void *CPUDataPointer)
+    {
+        CPUData *CurrentCPU = (CPUData *)CPUDataPointer;
+
+        bool Skip = true;
+        foreach (auto process in ProcessList)
+        {
+            if (process == CurrentCPU->CurrentProcess.load())
+            {
+                Skip = false;
+                gnap_schedbg("Found current process %#lx", process);
+                continue;
+            }
+
+            if (Skip)
+            {
+                gnap_schedbg("Skipping process %#lx", process);
+                continue;
+            }
+
+            if (InvalidPCB(process))
+            {
+                gnap_schedbg("Invalid process %#lx", process);
+                continue;
+            }
+
+            if (process->Status != TaskStatus::Ready)
+            {
+                gnap_schedbg("Process %d is not ready", process->ID);
+                continue;
+            }
+
+            foreach (auto thread in process->Threads)
+            {
+                if (InvalidTCB(thread))
+                {
+                    gnap_schedbg("Invalid thread %#lx", thread);
+                    continue;
+                }
+
+                if (thread->Status != TaskStatus::Ready)
+                {
+                    gnap_schedbg("Thread %d is not ready", thread->ID);
+                    continue;
+                }
+
+                if (thread->Info.Affinity[CurrentCPU->ID] == false)
+                    continue;
+
+                CurrentCPU->CurrentProcess = process;
+                CurrentCPU->CurrentThread = thread;
+                gnap_schedbg("[cur proc+1 -> first thd] Scheduling thread %d %s->%d (Total Procs %d)",
+                             thread->ID, thread->Name, process->Threads.size(), ProcessList.size());
+                return true;
+            }
+        }
+        gnap_schedbg("No process to run.");
+        return false;
+    }
+
+    SafeFunction NIF bool Task::SchedulerSearchProcessThread(void *CPUDataPointer)
+    {
+        CPUData *CurrentCPU = (CPUData *)CPUDataPointer;
+
+        foreach (auto process in ProcessList)
+        {
+            if (InvalidPCB(process))
+            {
+                sspt_schedbg("Invalid process %#lx", process);
+                continue;
+            }
+
+            if (process->Status != TaskStatus::Ready)
+            {
+                sspt_schedbg("Process %d is not ready", process->ID);
+                continue;
+            }
+
+            foreach (auto thread in process->Threads)
+            {
+                if (InvalidTCB(thread))
+                {
+                    sspt_schedbg("Invalid thread %#lx", thread);
+                    continue;
+                }
+
+                if (thread->Status != TaskStatus::Ready)
+                {
+                    sspt_schedbg("Thread %d is not ready", thread->ID);
+                    continue;
+                }
+
+                if (thread->Info.Affinity[CurrentCPU->ID] == false)
+                    continue;
+
+                CurrentCPU->CurrentProcess = process;
+                CurrentCPU->CurrentThread = thread;
+                sspt_schedbg("[proc 0 -> end -> first thd] Scheduling thread %d parent of %s->%d (Procs %d)",
+                             thread->ID, thread->Parent->Name, process->Threads.size(), ProcessList.size());
+                return true;
+            }
+        }
+        return false;
+    }
+
+    SafeFunction NIF void Task::UpdateProcessStatus()
+    {
+        foreach (auto process in ProcessList)
+        {
+            if (InvalidPCB(process))
+                continue;
+
+            if (process->Status == TaskStatus::Terminated ||
+                process->Status == TaskStatus::Stopped)
+                continue;
+
+            bool AllThreadsSleeping = true;
+            foreach (auto thread in process->Threads)
+            {
+                if (thread->Status != TaskStatus::Sleeping)
+                {
+                    AllThreadsSleeping = false;
+                    break;
+                }
+            }
+
+            if (AllThreadsSleeping)
+                process->Status = TaskStatus::Sleeping;
+            else if (process->Status == TaskStatus::Sleeping)
+                process->Status = TaskStatus::Ready;
+        }
+    }
+
+    SafeFunction NIF void Task::WakeUpThreads()
+    {
+        foreach (auto process in ProcessList)
+        {
+            if (InvalidPCB(process))
+                continue;
+
+            if (process->Status == TaskStatus::Terminated ||
+                process->Status == TaskStatus::Stopped)
+                continue;
+
+            foreach (auto thread in process->Threads)
+            {
+                if (InvalidTCB(thread))
+                    continue;
+
+                if (thread->Status != TaskStatus::Sleeping)
+                    continue;
+
+                /* Check if the thread is ready to wake up. */
+                if (thread->Info.SleepUntil < TimeManager->GetCounter())
+                {
+                    if (process->Status == TaskStatus::Sleeping)
+                        process->Status = TaskStatus::Ready;
+                    thread->Status = TaskStatus::Ready;
+
+                    thread->Info.SleepUntil = 0;
+                    wut_schedbg("Thread \"%s\"(%d) woke up.", thread->Name, thread->ID);
+                }
+                else
+                {
+                    wut_schedbg("Thread \"%s\"(%d) is not ready to wake up. (SleepUntil: %d, Counter: %d)",
+                                thread->Name, thread->ID, thread->Info.SleepUntil, TimeManager->GetCounter());
+                }
+            }
+        }
+    }
+
+#ifdef ON_SCREEN_SCHEDULER_TASK_MANAGER
+    int SuccessSource = 0;
+    int sanity;
+
+    const char *Statuses[] = {
+        "FF0000", /* Unknown */
+        "AAFF00", /* Ready */
+        "00AA00", /* Running */
+        "FFAA00", /* Sleeping */
+        "FFAA00", /* Waiting */
+        "FF0088", /* Stopped */
+        "FF0000", /* Terminated */
+    };
+
+    const char *StatusesSign[] = {
+        "Unknown",
+        "Ready",
+        "Run",
+        "Sleep",
+        "Wait",
+        "Stop",
+        "Terminated",
+    };
+
+    const char *SuccessSourceStrings[] = {
+        "Unknown",
+        "GetNextAvailableThread",
+        "GetNextAvailableProcess",
+        "SchedulerSearchProcessThread",
+    };
+
+    SafeFunction NIF void OnScreenTaskManagerUpdate()
+    {
+        TimeManager->Sleep(100);
+        Video::ScreenBuffer *sb = Display->GetBuffer(0);
+        for (short i = 0; i < 340; i++)
+        {
+            for (short j = 0; j < 200; j++)
+            {
+                uint32_t *Pixel = (uint32_t *)((uintptr_t)sb->Buffer + (j * sb->Width + i) * (bInfo->Framebuffer[0].BitsPerPixel / 8));
+                *Pixel = 0x222222;
+            }
+        }
+
+        uint32_t tmpX, tmpY;
+        Display->GetBufferCursor(0, &tmpX, &tmpY);
+        Display->SetBufferCursor(0, 0, 0);
+        printf("\eF02C21Task Manager\n");
+        foreach (auto Proc in TaskManager->GetProcessList())
+        {
+            int Status = Proc->Status;
+            printf("\e%s-> \eAABBCC%s \e00AAAA%s\n",
+                   Statuses[Status], Proc->Name, StatusesSign[Status]);
+
+            foreach (auto Thd in Proc->Threads)
+            {
+                Status = Thd->Status;
+                printf("  \e%s-> \eAABBCC%s \e00AAAA%s\n\eAABBCC",
+                       Statuses[Status], Thd->Name, StatusesSign[Status]);
+            }
+        }
+        register uintptr_t CurrentStackAddress asm("rsp");
+        printf("Sanity: %d, Stack: %#lx\nSched. Source: %s", sanity++, CurrentStackAddress, SuccessSourceStrings[SuccessSource]);
+        if (sanity > 1000)
+            sanity = 0;
+        Display->SetBufferCursor(0, tmpX, tmpY);
+        Display->SetBuffer(0);
+        TimeManager->Sleep(100);
+    }
+#endif
+
+    SafeFunction NIF void Task::Schedule(CPU::x64::TrapFrame *Frame)
+    {
+        if (StopScheduler)
+        {
+            warn("Scheduler stopped.");
+            return;
+        }
+        bool ProcessNotChanged = false;
+        CPU::x64::writecr3({.raw = (uint64_t)KernelPageTable}); /* Restore kernel page table for safety reasons. */
+        uint64_t SchedTmpTicks = TimeManager->GetCounter();
+        this->LastTaskTicks.store(SchedTmpTicks - this->SchedulerTicks.load());
+        CPUData *CurrentCPU = GetCurrentCPU();
+        schedbg("Scheduler called on CPU %d.", CurrentCPU->ID);
+        schedbg("%d: %ld%%", CurrentCPU->ID, GetUsage(CurrentCPU->ID));
+
+#ifdef DEBUG_SCHEDULER
+        {
+            schedbg("================================================================");
+            schedbg("Status: 0-ukn | 1-rdy | 2-run | 3-wait | 4-term");
+            schedbg("Technical Informations on regs %#lx", Frame->InterruptNumber);
+            size_t ds;
+            asmv("mov %%ds, %0"
+                 : "=r"(ds));
+            schedbg("FS=%#lx  GS=%#lx  SS=%#lx  CS=%#lx  DS=%#lx",
+                    CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE), CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE),
+                    Frame->ss, Frame->cs, ds);
+            schedbg("R8=%#lx  R9=%#lx  R10=%#lx  R11=%#lx",
+                    Frame->r8, Frame->r9, Frame->r10, Frame->r11);
+            schedbg("R12=%#lx  R13=%#lx  R14=%#lx  R15=%#lx",
+                    Frame->r12, Frame->r13, Frame->r14, Frame->r15);
+            schedbg("RAX=%#lx  RBX=%#lx  RCX=%#lx  RDX=%#lx",
+                    Frame->rax, Frame->rbx, Frame->rcx, Frame->rdx);
+            schedbg("RSI=%#lx  RDI=%#lx  RBP=%#lx  RSP=%#lx",
+                    Frame->rsi, Frame->rdi, Frame->rbp, Frame->rsp);
+            schedbg("RIP=%#lx  RFL=%#lx  INT=%#lx  ERR=%#lx",
+                    Frame->rip, Frame->rflags, Frame->InterruptNumber, Frame->ErrorCode);
+            schedbg("================================================================");
+        }
+#endif
+
+        if (unlikely(InvalidPCB(CurrentCPU->CurrentProcess.load()) || InvalidTCB(CurrentCPU->CurrentThread.load())))
+        {
+            schedbg("Invalid process or thread. Finding a new one.");
+            ProcessNotChanged = true;
+            if (this->FindNewProcess(CurrentCPU))
+                goto Success;
+            else
+                goto Idle;
+        }
+        else
+        {
+            CurrentCPU->CurrentThread->Registers = *Frame;
+            CPU::x64::fxsave(CurrentCPU->CurrentThread->FPU);
+            CurrentCPU->CurrentThread->GSBase = CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE);
+            CurrentCPU->CurrentThread->FSBase = CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE);
+
+            if (CurrentCPU->CurrentProcess->Status == TaskStatus::Running)
+                CurrentCPU->CurrentProcess->Status = TaskStatus::Ready;
+            if (CurrentCPU->CurrentThread->Status == TaskStatus::Running)
+                CurrentCPU->CurrentThread->Status = TaskStatus::Ready;
+
+            this->UpdateProcessStatus();
+            schedbg("Passed UpdateProcessStatus");
+
+            this->WakeUpThreads();
+            schedbg("Passed WakeUpThreads");
+
+            if (this->GetNextAvailableThread(CurrentCPU))
+            {
+#ifdef ON_SCREEN_SCHEDULER_TASK_MANAGER
+                SuccessSource = 1;
+#endif
+                ProcessNotChanged = true;
+                goto Success;
+            }
+            schedbg("Passed GetNextAvailableThread");
+
+            if (this->GetNextAvailableProcess(CurrentCPU))
+            {
+#ifdef ON_SCREEN_SCHEDULER_TASK_MANAGER
+                SuccessSource = 2;
+#endif
+                goto Success;
+            }
+            schedbg("Passed GetNextAvailableProcess");
+
+            if (SchedulerSearchProcessThread(CurrentCPU))
+            {
+#ifdef ON_SCREEN_SCHEDULER_TASK_MANAGER
+                SuccessSource = 3;
+#endif
+                schedbg("Passed SchedulerSearchProcessThread");
+                goto Success;
+            }
+            else
+            {
+                schedbg("SchedulerSearchProcessThread failed. Going idle.");
+                goto Idle;
+            }
+        }
+
+        warn("Unwanted reach!");
+        TaskingScheduler_OneShot(100);
+        goto End;
+
+    Idle:
+        ProcessNotChanged = true;
+        CurrentCPU->CurrentProcess = IdleProcess;
+        CurrentCPU->CurrentThread = IdleThread;
+
+    Success:
+        schedbg("Process \"%s\"(%d) Thread \"%s\"(%d) is now running on CPU %d",
+                CurrentCPU->CurrentProcess->Name, CurrentCPU->CurrentProcess->ID,
+                CurrentCPU->CurrentThread->Name, CurrentCPU->CurrentThread->ID, CurrentCPU->ID);
+
+        if (!ProcessNotChanged)
+            UpdateUsage(&CurrentCPU->CurrentProcess->Info, &CurrentCPU->CurrentProcess->Security, CurrentCPU->ID);
+        UpdateUsage(&CurrentCPU->CurrentThread->Info, &CurrentCPU->CurrentThread->Security, CurrentCPU->ID);
+
+        CurrentCPU->CurrentProcess->Status = TaskStatus::Running;
+        CurrentCPU->CurrentThread->Status = TaskStatus::Running;
+
+        *Frame = CurrentCPU->CurrentThread->Registers;
+
+        for (size_t i = 0; i < sizeof(CurrentCPU->CurrentThread->IPHistory) / sizeof(CurrentCPU->CurrentThread->IPHistory[0]); i++)
+            CurrentCPU->CurrentThread->IPHistory[i + 1] = CurrentCPU->CurrentThread->IPHistory[i];
+
+        CurrentCPU->CurrentThread->IPHistory[0] = Frame->rip;
+
+        GlobalDescriptorTable::SetKernelStack((void *)((uintptr_t)CurrentCPU->CurrentThread->Stack->GetStackTop()));
+        CPU::x64::writecr3({.raw = (uint64_t)CurrentCPU->CurrentProcess->PageTable});
+        /* Not sure if this is needed, but it's better to be safe than sorry. */
+        asmv("movq %cr3, %rax");
+        asmv("movq %rax, %cr3");
+        CPU::x64::fxrstor(CurrentCPU->CurrentThread->FPU);
+        CPU::x64::wrmsr(CPU::x64::MSR_GS_BASE, CurrentCPU->CurrentThread->GSBase);
+        CPU::x64::wrmsr(CPU::x64::MSR_FS_BASE, CurrentCPU->CurrentThread->FSBase);
+
+#ifdef ON_SCREEN_SCHEDULER_TASK_MANAGER
+        OnScreenTaskManagerUpdate();
+#endif
+
+        switch (CurrentCPU->CurrentProcess->Security.TrustLevel)
+        {
+        case TaskTrustLevel::System:
+        case TaskTrustLevel::Kernel:
+            // wrmsr(MSR_SHADOW_GS_BASE, (uint64_t)CurrentCPU->CurrentThread);
+            break;
+        case TaskTrustLevel::User:
+            // wrmsr(MSR_SHADOW_GS_BASE, CurrentCPU->CurrentThread->gs);
+            break;
+        default:
+            error("Unknown trust level %d.",
+                  CurrentCPU->CurrentProcess->Security.TrustLevel);
+            break;
+        }
+
+        if (!ProcessNotChanged)
+            (&CurrentCPU->CurrentProcess->Info)->LastUpdateTime = TimeManager->GetCounter();
+        (&CurrentCPU->CurrentThread->Info)->LastUpdateTime = TimeManager->GetCounter();
+        TaskingScheduler_OneShot(CurrentCPU->CurrentThread->Info.Priority);
+
+        if (CurrentCPU->CurrentThread->Security.IsDebugEnabled && CurrentCPU->CurrentThread->Security.IsKernelDebugEnabled)
+            trace("%s[%ld]: RIP=%#lx  RBP=%#lx  RSP=%#lx",
+                  CurrentCPU->CurrentThread->Name, CurrentCPU->CurrentThread->ID,
+                  CurrentCPU->CurrentThread->Registers.rip,
+                  CurrentCPU->CurrentThread->Registers.rbp,
+                  CurrentCPU->CurrentThread->Registers.rsp);
+
+        schedbg("================================================================");
+        schedbg("Technical Informations on Thread %s[%ld]:",
+                CurrentCPU->CurrentThread->Name, CurrentCPU->CurrentThread->ID);
+        uint64_t ds;
+        asmv("mov %%ds, %0"
+             : "=r"(ds));
+        schedbg("FS=%#lx  GS=%#lx  SS=%#lx  CS=%#lx  DS=%#lx",
+                CPU::x64::rdmsr(CPU::x64::MSR_FS_BASE), CPU::x64::rdmsr(CPU::x64::MSR_GS_BASE),
+                Frame->ss, Frame->cs, ds);
+        schedbg("R8=%#lx  R9=%#lx  R10=%#lx  R11=%#lx",
+                Frame->r8, Frame->r9, Frame->r10, Frame->r11);
+        schedbg("R12=%#lx  R13=%#lx  R14=%#lx  R15=%#lx",
+                Frame->r12, Frame->r13, Frame->r14, Frame->r15);
+        schedbg("RAX=%#lx  RBX=%#lx  RCX=%#lx  RDX=%#lx",
+                Frame->rax, Frame->rbx, Frame->rcx, Frame->rdx);
+        schedbg("RSI=%#lx  RDI=%#lx  RBP=%#lx  RSP=%#lx",
+                Frame->rsi, Frame->rdi, Frame->rbp, Frame->rsp);
+        schedbg("RIP=%#lx  RFL=%#lx  INT=%#lx  ERR=%#lx",
+                Frame->rip, Frame->rflags, Frame->InterruptNumber, Frame->ErrorCode);
+        schedbg("================================================================");
+
+    End:
+        this->SchedulerTicks.store(TimeManager->GetCounter() - SchedTmpTicks);
+        __sync; /* TODO: Is this really needed? */
+    }
+
+    SafeFunction NIF void Task::OnInterruptReceived(CPU::x64::TrapFrame *Frame)
+    {
+        SmartCriticalSection(SchedulerLock);
+        this->Schedule(Frame);
+    }
+#elif defined(a32)
+    SafeFunction bool Task::FindNewProcess(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction bool Task::GetNextAvailableThread(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction bool Task::GetNextAvailableProcess(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction bool Task::SchedulerSearchProcessThread(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction void Task::Schedule(void *Frame)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction void Task::OnInterruptReceived(CPU::x32::TrapFrame *Frame) { this->Schedule(Frame); }
+#elif defined(aa64)
+    SafeFunction bool Task::FindNewProcess(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction bool Task::GetNextAvailableThread(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction bool Task::GetNextAvailableProcess(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction bool Task::SchedulerSearchProcessThread(void *CPUDataPointer)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction void Task::Schedule(CPU::aarch64::TrapFrame *Frame)
+    {
+        fixme("unimplemented");
+    }
+
+    SafeFunction void Task::OnInterruptReceived(CPU::aarch64::TrapFrame *Frame) { this->Schedule(Frame); }
+#endif
+}
diff --git a/Kernel/Tasking/Security.cpp b/Kernel/Tasking/Security.cpp
new file mode 100644
index 00000000..b8500dc7
--- /dev/null
+++ b/Kernel/Tasking/Security.cpp
@@ -0,0 +1,149 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <task.hpp>
+
+#include <rand.hpp>
+#include <debug.h>
+#include <vector>
+
+namespace Tasking
+{
+    Token Security::CreateToken()
+    {
+        uint64_t ret = 0;
+    Retry:
+        ret = Random::rand64();
+        foreach (auto t in Tokens)
+            if (t.token == ret)
+                goto Retry;
+
+        Tokens.push_back({ret, UnknownTrustLevel, 0, false});
+        debug("Created token %#lx", ret);
+        return ret;
+    }
+
+    bool Security::TrustToken(Token token, TTL TrustLevel)
+    {
+        foreach (auto &t in Tokens)
+        {
+            if (t.token == token)
+            {
+                t.TrustLevel = TrustLevel;
+                debug("Trusted token %#lx to level %d", token, t.TrustLevel);
+                return true;
+            }
+        }
+        warn("Failed to trust token %#lx", token);
+        return false;
+    }
+
+    bool Security::UntrustToken(Token token)
+    {
+        foreach (auto &t in Tokens)
+        {
+            if (t.token == token)
+            {
+                t.TrustLevel = Untrusted;
+                debug("Untrusted token %#lx", token);
+                return true;
+            }
+        }
+        warn("Failed to untrust token %#lx", token);
+        return false;
+    }
+
+    bool Security::AddTrustLevel(Token token, TTL TrustLevel)
+    {
+        foreach (auto &t in Tokens)
+        {
+            if (t.token == token)
+            {
+                t.TrustLevel |= TrustLevel;
+                debug("Added trust level %d to token %#lx", t.TrustLevel, token);
+                return true;
+            }
+        }
+        warn("Failed to add trust level %d to token %#lx", TrustLevel, token);
+        return false;
+    }
+
+    bool Security::RemoveTrustLevel(Token token, TTL TrustLevel)
+    {
+        foreach (auto &t in Tokens)
+        {
+            if (t.token == token)
+            {
+                t.TrustLevel &= ~TrustLevel;
+                debug("Removed trust level %d from token %#lx", t.TrustLevel, token);
+                return true;
+            }
+        }
+        warn("Failed to remove trust level %d from token %#lx", TrustLevel, token);
+        return false;
+    }
+
+    bool Security::DestroyToken(Token token)
+    {
+        fixme("DestroyToken->true");
+        UNUSED(token);
+        return true;
+    }
+
+    bool Security::IsTokenTrusted(Token token, TTL TrustLevel)
+    {
+        foreach (auto t in Tokens)
+            if (t.token == token)
+            {
+                if (t.TrustLevel == TrustLevel)
+                    return true;
+                else
+                    return false;
+            }
+
+        warn("Failed to check trust level of token %#lx", token);
+        return false;
+    }
+
+    bool Security::IsTokenTrusted(Token token, int TrustLevel)
+    {
+        foreach (auto t in Tokens)
+            if (t.token == token)
+            {
+                if (t.TrustLevel & TrustLevel)
+                    return true;
+                else
+                    return false;
+            }
+
+        warn("Failed to check trust level of token %#lx", token);
+        return false;
+    }
+
+    int Security::GetTokenTrustLevel(Token token)
+    {
+        foreach (auto t in Tokens)
+            if (t.token == token)
+                return t.TrustLevel;
+
+        warn("Failed to get trust level of token %#lx", token);
+        return UnknownTrustLevel;
+    }
+
+    Security::Security() {}
+    Security::~Security() { Tokens.clear(); }
+}
diff --git a/Kernel/Tasking/Task.cpp b/Kernel/Tasking/Task.cpp
new file mode 100644
index 00000000..aefda10b
--- /dev/null
+++ b/Kernel/Tasking/Task.cpp
@@ -0,0 +1,874 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <task.hpp>
+
+#include <dumper.hpp>
+#include <convert.h>
+#include <lock.hpp>
+#include <printf.h>
+#include <smp.hpp>
+#include <io.h>
+
+#include "../kernel.h"
+
+#if defined(a64)
+#include "../Architecture/amd64/cpu/apic.hpp"
+#include "../Architecture/amd64/cpu/gdt.hpp"
+#elif defined(a32)
+#include "../Architecture/i386/cpu/apic.hpp"
+#elif defined(aa64)
+#endif
+
+// #define DEBUG_TASKING 1
+
+#ifdef DEBUG_TASKING
+#define tskdbg(m, ...)       \
+    debug(m, ##__VA_ARGS__); \
+    __sync
+#else
+#define tskdbg(m, ...)
+#endif
+
+NewLock(TaskingLock);
+
+namespace Tasking
+{
+    void Task::Schedule()
+    {
+        if (!StopScheduler)
+            TaskingScheduler_OneShot(1);
+        // APIC::InterruptCommandRegisterLow icr;
+        // icr.Vector = CPU::x86::IRQ16;
+        // icr.Level = APIC::APICLevel::Assert;
+        // ((APIC::APIC *)Interrupts::apic[0])->IPI(GetCurrentCPU()->ID, icr);
+    }
+
+#if defined(a86)
+    __naked __used __no_stack_protector NIF void IdleProcessLoop()
+    {
+        asmv("IdleLoop:\n"
+             "hlt\n"
+             "jmp IdleLoop\n");
+#elif defined(aa64)
+    __used __no_stack_protector NIF void IdleProcessLoop()
+    {
+        asmv("IdleLoop:\n"
+             "wfe\n"
+             "b IdleLoop\n");
+#endif
+    }
+
+    SafeFunction NIF bool Task::InvalidPCB(PCB *pcb)
+    {
+        if (!pcb)
+            return true;
+        if (pcb >= (PCB *)(UINTPTR_MAX - 0x1ffe)) /* Uninitialized pointers may have uintptr_t max value instead of nullptr. */
+            return true;
+        if (pcb < (PCB *)(0x1000)) /* In this section of the memory is reserved by the kernel. */
+            return true;
+        if (!Memory::Virtual().Check((void *)pcb)) /* Check if it's mapped. */
+            return true;
+        return false;
+    }
+
+    SafeFunction NIF bool Task::InvalidTCB(TCB *tcb)
+    {
+        if (!tcb)
+            return true;
+        if (tcb >= (TCB *)(UINTPTR_MAX - 0x1ffe)) /* Uninitialized pointers may have uintptr_t max value instead of nullptr. */
+            return true;
+        if (tcb < (TCB *)(0x1000)) /* In this section of the memory is reserved by the kernel. */
+            return true;
+        if (!Memory::Virtual().Check((void *)tcb)) /* Check if it's mapped. */
+            return true;
+        return false;
+    }
+
+    SafeFunction NIF void Task::RemoveThread(TCB *Thread)
+    {
+        for (size_t i = 0; i < Thread->Parent->Threads.size(); i++)
+            if (Thread->Parent->Threads[i] == Thread)
+            {
+                trace("Thread \"%s\"(%d) removed from process \"%s\"(%d)",
+                      Thread->Name, Thread->ID, Thread->Parent->Name, Thread->Parent->ID);
+                // Free memory
+                delete Thread->Stack, Thread->Stack = nullptr;
+                delete Thread->Memory, Thread->Memory = nullptr;
+                SecurityManager.DestroyToken(Thread->Security.UniqueToken);
+                delete Thread->Parent->Threads[i], Thread->Parent->Threads[i] = nullptr;
+                // Remove from the list
+                Thread->Parent->Threads.remove(i);
+                break;
+            }
+    }
+
+    SafeFunction NIF void Task::RemoveProcess(PCB *Process)
+    {
+        if (Process == nullptr)
+            return;
+
+        if (Process->Status == Terminated)
+        {
+            foreach (TCB *thread in Process->Threads)
+                RemoveThread(thread);
+
+            foreach (PCB *process in Process->Children)
+                RemoveProcess(process);
+
+            for (size_t i = 0; i < ProcessList.size(); i++)
+            {
+                if (ProcessList[i] == Process)
+                {
+                    trace("Process \"%s\"(%d) removed from the list", Process->Name, Process->ID);
+                    // Free memory
+                    delete ProcessList[i]->IPC, ProcessList[i]->IPC = nullptr;
+                    delete ProcessList[i]->ELFSymbolTable, ProcessList[i]->ELFSymbolTable = nullptr;
+                    SecurityManager.DestroyToken(ProcessList[i]->Security.UniqueToken);
+                    if (ProcessList[i]->Security.TrustLevel == TaskTrustLevel::User)
+                        KernelAllocator.FreePages((void *)ProcessList[i]->PageTable, TO_PAGES(sizeof(Memory::PageTable4) + 1));
+
+                    // Remove the process from parent's children list
+                    if (ProcessList[i]->Parent)
+                        for (size_t j = 0; j < ProcessList[i]->Parent->Children.size(); j++)
+                        {
+                            if (ProcessList[i]->Parent->Children[j] == ProcessList[i])
+                            {
+                                ProcessList[i]->Parent->Children.remove(j);
+                                break;
+                            }
+                        }
+
+                    // Delete process directory
+                    vfs->Delete(ProcessList[i]->ProcessDirectory, true);
+
+                    // Free memory
+                    delete ProcessList[i], ProcessList[i] = nullptr;
+                    // Remove from the list
+                    ProcessList.remove(i);
+                    break;
+                }
+            }
+        }
+        else
+        {
+            foreach (TCB *thread in Process->Threads)
+                if (thread->Status == Terminated)
+                    RemoveThread(thread);
+        }
+    }
+
+    SafeFunction NIF void Task::UpdateUsage(TaskInfo *Info, TaskSecurity *Security, int Core)
+    {
+        uint64_t CurrentTime = TimeManager->GetCounter();
+        uint64_t TimePassed = CurrentTime - Info->LastUpdateTime;
+        // Info->LastUpdateTime = CurrentTime;
+
+        if (Security->TrustLevel == TaskTrustLevel::User)
+            Info->UserTime += TimePassed;
+        else
+            Info->KernelTime += TimePassed;
+    }
+
+    void ThreadDoExit()
+    {
+        // TODO: How I can lock the scheduler without causing a deadlock?
+        CPUData *CPUData = GetCurrentCPU();
+        CPUData->CurrentThread->Status = TaskStatus::Terminated;
+        debug("\"%s\"(%d) exited with code: %#lx", CPUData->CurrentThread->Name, CPUData->CurrentThread->ID, CPUData->CurrentThread->ExitCode);
+        CPU::Halt(true);
+    }
+
+    PCB *Task::GetCurrentProcess() { return GetCurrentCPU()->CurrentProcess.load(); }
+    TCB *Task::GetCurrentThread() { return GetCurrentCPU()->CurrentThread.load(); }
+
+    PCB *Task::GetProcessByID(UPID ID)
+    {
+        for (size_t i = 0; i < ProcessList.size(); i++)
+            if (ProcessList[i]->ID == ID)
+                return ProcessList[i];
+        return nullptr;
+    }
+
+    TCB *Task::GetThreadByID(UTID ID)
+    {
+        for (size_t i = 0; i < ProcessList.size(); i++)
+            for (size_t j = 0; j < ProcessList[i]->Threads.size(); j++)
+                if (ProcessList[i]->Threads[j]->ID == ID)
+                    return ProcessList[i]->Threads[j];
+        return nullptr;
+    }
+
+    void Task::WaitForProcess(PCB *pcb)
+    {
+        if (InvalidPCB(pcb))
+            return;
+        if (pcb->Status == TaskStatus::UnknownStatus)
+            return;
+        debug("Waiting for process \"%s\"(%d)", pcb->Name, pcb->ID);
+        while (pcb->Status != TaskStatus::Terminated)
+            CPU::Pause();
+    }
+
+    void Task::WaitForThread(TCB *tcb)
+    {
+        if (InvalidTCB(tcb))
+            return;
+        if (tcb->Status == TaskStatus::UnknownStatus)
+            return;
+        debug("Waiting for thread \"%s\"(%d)", tcb->Name, tcb->ID);
+        while (tcb->Status != TaskStatus::Terminated)
+            CPU::Pause();
+    }
+
+    void Task::WaitForProcessStatus(PCB *pcb, TaskStatus status)
+    {
+        if (InvalidPCB(pcb))
+            return;
+        if (pcb->Status == TaskStatus::UnknownStatus)
+            return;
+        debug("Waiting for process \"%s\"(%d) to reach status: %d", pcb->Name, pcb->ID, status);
+        while (pcb->Status != status)
+            CPU::Pause();
+    }
+
+    void Task::WaitForThreadStatus(TCB *tcb, TaskStatus status)
+    {
+        if (InvalidTCB(tcb))
+            return;
+        if (tcb->Status == TaskStatus::UnknownStatus)
+            return;
+        debug("Waiting for thread \"%s\"(%d) to reach status: %d", tcb->Name, tcb->ID, status);
+        while (tcb->Status != status)
+            CPU::Pause();
+    }
+
+    void Task::Sleep(uint64_t Milliseconds)
+    {
+        SmartLock(TaskingLock);
+        TCB *thread = this->GetCurrentThread();
+        thread->Status = TaskStatus::Sleeping;
+        if (thread->Parent->Threads.size() == 1)
+            thread->Parent->Status = TaskStatus::Sleeping;
+        thread->Info.SleepUntil = TimeManager->CalculateTarget(Milliseconds, Time::Units::Milliseconds);
+        tskdbg("Thread \"%s\"(%d) is going to sleep until %llu", thread->Name, thread->ID, thread->Info.SleepUntil);
+        // TaskingScheduler_OneShot(1);
+        // IRQ16
+        TaskingLock.Unlock();
+#if defined(a86)
+        asmv("int $0x30"); /* This will trigger the IRQ16 instantly so we won't execute the next instruction */
+#elif defined(aa64)
+        asmv("svc #0x30"); /* This will trigger the IRQ16 instantly so we won't execute the next instruction */
+#endif
+    }
+
+    void Task::SignalShutdown()
+    {
+        fixme("SignalShutdown()");
+        // TODO: Implement this
+        // This should hang until all processes are terminated
+    }
+
+    void Task::CleanupProcessesThread()
+    {
+        while (true)
+        {
+            this->Sleep(1000);
+            foreach (auto process in ProcessList)
+            {
+                if (InvalidPCB(process))
+                    continue;
+
+                RemoveProcess(process);
+            }
+        }
+    }
+
+    void Task::RevertProcessCreation(PCB *Process)
+    {
+        for (size_t i = 0; i < ProcessList.size(); i++)
+        {
+            if (ProcessList[i] == Process)
+            {
+                SecurityManager.DestroyToken(Process->Security.UniqueToken);
+                if (Process->Security.TrustLevel == TaskTrustLevel::User)
+                    KernelAllocator.FreePages((void *)Process->PageTable, TO_PAGES(sizeof(Memory::PageTable4) + 1));
+
+                if (Process->Parent)
+                    for (size_t j = 0; j < Process->Parent->Children.size(); j++)
+                    {
+                        if (Process->Parent->Children[j] == Process)
+                        {
+                            Process->Parent->Children.remove(j);
+                            break;
+                        }
+                    }
+
+                delete Process->IPC, Process->IPC = nullptr;
+                delete Process->ELFSymbolTable, Process->ELFSymbolTable = nullptr;
+                delete Process, Process = nullptr;
+                ProcessList.remove(i);
+                NextPID--;
+                break;
+            }
+        }
+    }
+
+    void Task::RevertThreadCreation(TCB *Thread)
+    {
+        for (size_t j = 0; j < Thread->Parent->Threads.size(); j++)
+        {
+            if (Thread->Parent->Threads[j] == Thread)
+            {
+                Thread->Parent->Threads.remove(j);
+                break;
+            }
+        }
+
+        delete Thread->Stack, Thread->Stack = nullptr;
+        delete Thread->Memory, Thread->Memory = nullptr;
+        SecurityManager.DestroyToken(Thread->Security.UniqueToken);
+        delete Thread, Thread = nullptr;
+        NextTID--;
+    }
+
+    TCB *Task::CreateThread(PCB *Parent,
+                            IP EntryPoint,
+                            const char **argv,
+                            const char **envp,
+                            const std::vector<AuxiliaryVector> &auxv,
+                            IPOffset Offset,
+                            TaskArchitecture Architecture,
+                            TaskCompatibility Compatibility)
+    {
+        SmartLock(TaskingLock);
+        TCB *Thread = new TCB;
+        if (Parent == nullptr)
+        {
+            Thread->Parent = this->GetCurrentProcess();
+            if (Thread->Parent == nullptr)
+            {
+                error("Failed to get current process. Thread cannot be created.");
+                delete Thread;
+                return nullptr;
+            }
+        }
+        else
+            Thread->Parent = Parent;
+
+        if (InvalidPCB(Parent))
+        {
+            error("Parent is invalid");
+            delete Thread;
+            return nullptr;
+        }
+
+        Thread->ID = this->NextTID++;
+        strcpy(Thread->Name, Parent->Name);
+        Thread->EntryPoint = EntryPoint;
+        Thread->Offset = Offset;
+        Thread->ExitCode = 0xdead;
+        Thread->Status = TaskStatus::Ready;
+        Thread->Memory = new Memory::MemMgr(Parent->PageTable, Parent->memDirectory);
+        Thread->FPU = (CPU::x64::FXState *)Thread->Memory->RequestPages(TO_PAGES(sizeof(CPU::x64::FXState) + 1));
+        memset(Thread->FPU, 0, FROM_PAGES(TO_PAGES(sizeof(CPU::x64::FXState))));
+
+        Thread->Security.TrustLevel = Parent->Security.TrustLevel;
+        Thread->Security.UniqueToken = SecurityManager.CreateToken();
+
+        // TODO: Is really a good idea to use the FPU in kernel mode?
+        Thread->FPU->mxcsr = 0b0001111110000000;
+        Thread->FPU->mxcsrmask = 0b1111111110111111;
+        Thread->FPU->fcw = 0b0000001100111111;
+
+        CPU::x64::fxrstor(Thread->FPU);
+        // uint16_t FCW = 0b1100111111;
+        // asmv("fldcw %0"
+        //      :
+        //      : "m"(FCW)
+        //      : "memory");
+        // uint32_t MXCSR = 0b1111110000000;
+        // asmv("ldmxcsr %0"
+        //      :
+        //      : "m"(MXCSR)
+        //      : "memory");
+        // CPU::x64::fxsave(Thread->FPU);
+
+#if defined(a64)
+        memset(&Thread->Registers, 0, sizeof(CPU::x64::TrapFrame)); // Just in case
+        Thread->Registers.rip = (EntryPoint + Offset);
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+        switch (Parent->Security.TrustLevel)
+        {
+        case TaskTrustLevel::System:
+            warn("Trust level not supported.");
+            [[fallthrough]];
+        case TaskTrustLevel::Kernel:
+        {
+            Thread->Security.IsCritical = true;
+            Thread->Stack = new Memory::StackGuard(false, Parent->PageTable);
+#if defined(a64)
+            SecurityManager.TrustToken(Thread->Security.UniqueToken, TTL::TrustedByKernel);
+            Thread->GSBase = CPU::x64::rdmsr(CPU::x64::MSRID::MSR_GS_BASE);
+            Thread->FSBase = CPU::x64::rdmsr(CPU::x64::MSRID::MSR_FS_BASE);
+            Thread->Registers.cs = GDT_KERNEL_CODE;
+            Thread->Registers.ss = GDT_KERNEL_DATA;
+            Thread->Registers.rflags.AlwaysOne = 1;
+            Thread->Registers.rflags.IF = 1;
+            Thread->Registers.rflags.ID = 1;
+            Thread->Registers.rsp = ((uintptr_t)Thread->Stack->GetStackTop());
+            POKE(uintptr_t, Thread->Registers.rsp) = (uintptr_t)ThreadDoExit;
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+            break;
+        }
+        case TaskTrustLevel::User:
+        {
+            Thread->Stack = new Memory::StackGuard(true, Parent->PageTable);
+#if defined(a64)
+            SecurityManager.TrustToken(Thread->Security.UniqueToken, TTL::Untrusted);
+            Thread->GSBase = 0;
+            Thread->FSBase = 0;
+            Thread->Registers.cs = GDT_USER_CODE;
+            Thread->Registers.ss = GDT_USER_DATA;
+            Thread->Registers.rflags.AlwaysOne = 1;
+            Thread->Registers.rflags.IF = 1;
+            Thread->Registers.rflags.ID = 1;
+            Thread->Registers.rsp = ((uintptr_t)Thread->Stack->GetStackTop());
+
+#pragma region
+
+            size_t ArgvSize = 0;
+            if (argv)
+                while (argv[ArgvSize] != nullptr)
+                    ArgvSize++;
+
+            size_t EnvpSize = 0;
+            if (envp)
+                while (envp[EnvpSize] != nullptr)
+                    EnvpSize++;
+
+            debug("ArgvSize: %d", ArgvSize);
+            debug("EnvpSize: %d", EnvpSize);
+
+            /* https://articles.manugarg.com/aboutelfauxiliaryvectors.html */
+            /* https://refspecs.linuxbase.org/elf/x86_64-abi-0.99.pdf#figure.3.9 */
+            // rsp is the top of the stack
+            char *Stack = (char *)Thread->Stack->GetStackPhysicalTop();
+            // Temporary stack pointer for strings
+            char *StackStrings = (char *)Stack;
+            char *StackStringsVirtual = (char *)Thread->Stack->GetStackTop();
+
+            // Store string pointers for later
+            uintptr_t *ArgvStrings = new uintptr_t[ArgvSize];
+            uintptr_t *EnvpStrings = new uintptr_t[EnvpSize];
+
+            for (size_t i = 0; i < ArgvSize; i++)
+            {
+                // Subtract the length of the string and the null terminator
+                StackStrings -= strlen(argv[i]) + 1;
+                StackStringsVirtual -= strlen(argv[i]) + 1;
+                // Store the pointer to the string
+                ArgvStrings[i] = (uintptr_t)StackStringsVirtual;
+                // Copy the string to the stack
+                strcpy(StackStrings, argv[i]);
+            }
+
+            for (size_t i = 0; i < EnvpSize; i++)
+            {
+                // Subtract the length of the string and the null terminator
+                StackStrings -= strlen(envp[i]) + 1;
+                StackStringsVirtual -= strlen(envp[i]) + 1;
+                // Store the pointer to the string
+                EnvpStrings[i] = (uintptr_t)StackStringsVirtual;
+                // Copy the string to the stack
+                strcpy(StackStrings, envp[i]);
+            }
+
+            // Align the stack to 16 bytes
+            StackStrings -= (uintptr_t)StackStrings & 0xF;
+            // Set "Stack" to the new stack pointer
+            Stack = (char *)StackStrings;
+            // If argv and envp sizes are odd then we need to align the stack
+            Stack -= (ArgvSize + EnvpSize) % 2;
+
+            // We need 8 bit pointers for the stack from here
+            uintptr_t *Stack64 = (uintptr_t *)Stack;
+
+            // Store the null terminator
+            Stack64--;
+            *Stack64 = AT_NULL;
+
+            // auxv_array is initialized with auxv elements. If the array is empty then we add a null terminator
+            std::vector<AuxiliaryVector> auxv_array = auxv;
+            if (auxv_array.size() == 0)
+                auxv_array.push_back({.archaux = {.a_type = AT_NULL, .a_un = {.a_val = 0}}});
+
+            // Store auxillary vector
+            foreach (AuxiliaryVector var in auxv_array)
+            {
+                // Subtract the size of the auxillary vector
+                Stack64 -= sizeof(Elf64_auxv_t) / sizeof(uintptr_t);
+                // Store the auxillary vector
+                POKE(Elf64_auxv_t, Stack64) = var.archaux;
+                // TODO: Store strings to the stack
+            }
+
+            // Store the null terminator
+            Stack64--;
+            *Stack64 = AT_NULL;
+
+            // Store EnvpStrings[] to the stack
+            Stack64 -= EnvpSize; // (1 Stack64 = 8 bits; Stack64 = 8 * EnvpSize)
+            for (size_t i = 0; i < EnvpSize; i++)
+            {
+                *(Stack64 + i) = (uintptr_t)EnvpStrings[i];
+                debug("EnvpStrings[%d]: %#lx", i, EnvpStrings[i]);
+            }
+
+            // Store the null terminator
+            Stack64--;
+            *Stack64 = AT_NULL;
+
+            // Store ArgvStrings[] to the stack
+            Stack64 -= ArgvSize; // (1 Stack64 = 8 bits; Stack64 = 8 * ArgvSize)
+            for (size_t i = 0; i < ArgvSize; i++)
+            {
+                *(Stack64 + i) = (uintptr_t)ArgvStrings[i];
+                debug("ArgvStrings[%d]: %#lx", i, ArgvStrings[i]);
+            }
+
+            // Store the argc
+            Stack64--;
+            *Stack64 = ArgvSize;
+
+            // Set "Stack" to the new stack pointer
+            Stack = (char *)Stack64;
+
+            /* We need the virtual address but because we are in the kernel we can't use the process page table.
+                So we modify the physical address and store how much we need to subtract to get the virtual address for RSP. */
+            uintptr_t SubtractStack = (uintptr_t)Thread->Stack->GetStackPhysicalTop() - (uintptr_t)Stack;
+            debug("SubtractStack: %#lx", SubtractStack);
+
+            // Set the stack pointer to the new stack
+            Thread->Registers.rsp = ((uintptr_t)Thread->Stack->GetStackTop() - SubtractStack);
+
+            delete[] ArgvStrings;
+            delete[] EnvpStrings;
+
+#ifdef DEBUG
+            DumpData("Stack Data", (void *)((uintptr_t)Thread->Stack->GetStackPhysicalTop() - (uintptr_t)SubtractStack), SubtractStack);
+#endif
+
+            Thread->Registers.rdi = (uintptr_t)ArgvSize;                                         // argc
+            Thread->Registers.rsi = (uintptr_t)(Thread->Registers.rsp + 8);                      // argv
+            Thread->Registers.rcx = (uintptr_t)EnvpSize;                                         // envc
+            Thread->Registers.rdx = (uintptr_t)(Thread->Registers.rsp + 8 + (8 * ArgvSize) + 8); // envp
+
+#pragma endregion
+
+            /* We need to leave the libc's crt to make a syscall when the Thread is exited or we are going to get GPF or PF exception. */
+
+            Memory::Virtual uva = Memory::Virtual(Parent->PageTable);
+            if (!uva.Check((void *)Offset, Memory::PTFlag::US))
+            {
+                error("Offset is not user accessible");
+                uva.Map((void *)Offset, (void *)Offset, Memory::PTFlag::RW | Memory::PTFlag::US); // We try one more time.
+            }
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+#ifdef DEBUG_TASKING
+            DumpData(Thread->Name, Thread->Stack, STACK_SIZE);
+#endif
+            break;
+        }
+        default:
+        {
+            error("Unknown elevation.");
+            delete Thread->Stack;
+            this->NextTID--;
+            delete Thread;
+            return nullptr;
+        }
+        }
+
+        Thread->Info = {};
+        Thread->Info.SpawnTime = TimeManager->GetCounter();
+        Thread->Info.Year = 0;
+        Thread->Info.Month = 0;
+        Thread->Info.Day = 0;
+        Thread->Info.Hour = 0;
+        Thread->Info.Minute = 0;
+        Thread->Info.Second = 0;
+        for (int i = 0; i < MAX_CPU; i++)
+        {
+            Thread->Info.Affinity[i] = true;
+        }
+        Thread->Info.Priority = TaskPriority::Normal;
+        Thread->Info.Architecture = Architecture;
+        Thread->Info.Compatibility = Compatibility;
+
+#ifdef DEBUG
+#ifdef a64
+        debug("Thread offset is %#lx (EntryPoint: %#lx) => RIP: %#lx", Thread->Offset, Thread->EntryPoint, Thread->Registers.rip);
+        if (Parent->Security.TrustLevel == TaskTrustLevel::User)
+            debug("Thread stack region is %#lx-%#lx (U) and rsp is %#lx", Thread->Stack->GetStackBottom(), Thread->Stack->GetStackTop(), Thread->Registers.rsp);
+        else
+            debug("Thread stack region is %#lx-%#lx (K) and rsp is %#lx", Thread->Stack->GetStackBottom(), Thread->Stack->GetStackTop(), Thread->Registers.rsp);
+#elif defined(a32)
+        debug("Thread offset is %#lx (EntryPoint: %#lx) => RIP: %#lx", Thread->Offset, Thread->EntryPoint, Thread->Registers.eip);
+        if (Parent->Security.TrustLevel == TaskTrustLevel::User)
+            debug("Thread stack region is %#lx-%#lx (U) and rsp is %#lx", Thread->Stack->GetStackBottom(), Thread->Stack->GetStackTop(), Thread->Registers.esp);
+        else
+            debug("Thread stack region is %#lx-%#lx (K) and rsp is %#lx", Thread->Stack->GetStackBottom(), Thread->Stack->GetStackTop(), Thread->Registers.esp);
+#elif defined(aa64)
+#endif
+        debug("Created thread \"%s\"(%d) in process \"%s\"(%d)",
+              Thread->Name, Thread->ID,
+              Thread->Parent->Name, Thread->Parent->ID);
+#endif
+
+        Parent->Threads.push_back(Thread);
+        return Thread;
+    }
+
+    PCB *Task::CreateProcess(PCB *Parent,
+                             const char *Name,
+                             TaskTrustLevel TrustLevel, void *Image,
+                             bool DoNotCreatePageTable)
+    {
+        SmartLock(TaskingLock);
+        PCB *Process = new PCB;
+        Process->ID = this->NextPID++;
+        strcpy(Process->Name, Name);
+        if (Parent == nullptr)
+            Process->Parent = this->GetCurrentProcess();
+        else
+            Process->Parent = Parent;
+        Process->ExitCode = 0xdead;
+        Process->Status = TaskStatus::Ready;
+
+        Process->Security.TrustLevel = TrustLevel;
+        Process->Security.UniqueToken = SecurityManager.CreateToken();
+
+        char ProcFSName[16];
+        sprintf(ProcFSName, "%ld", Process->ID);
+        Process->ProcessDirectory = vfs->Create(ProcFSName, VirtualFileSystem::NodeFlags::DIRECTORY, ProcFS);
+        Process->memDirectory = vfs->Create("mem", VirtualFileSystem::NodeFlags::DIRECTORY, Process->ProcessDirectory);
+        Process->IPC = new InterProcessCommunication::IPC((void *)Process);
+
+        switch (TrustLevel)
+        {
+        case TaskTrustLevel::System:
+            warn("Trust level not supported.");
+            [[fallthrough]];
+        case TaskTrustLevel::Kernel:
+        {
+            Process->Security.IsCritical = true;
+            SecurityManager.TrustToken(Process->Security.UniqueToken, TTL::TrustedByKernel);
+#if defined(a64)
+            if (!DoNotCreatePageTable)
+                Process->PageTable = (Memory::PageTable4 *)CPU::x64::readcr3().raw;
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+            break;
+        }
+        case TaskTrustLevel::User:
+        {
+            SecurityManager.TrustToken(Process->Security.UniqueToken, TTL::Untrusted);
+#if defined(a64)
+            if (!DoNotCreatePageTable)
+            {
+                Process->PageTable = (Memory::PageTable4 *)KernelAllocator.RequestPages(TO_PAGES(sizeof(Memory::PageTable4) + 1));
+                memcpy(Process->PageTable, (void *)KernelPageTable, PAGE_SIZE);
+            }
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+            break;
+        }
+        default:
+        {
+            error("Unknown elevation.");
+            this->NextPID--;
+            delete Process;
+            return nullptr;
+        }
+        }
+
+        Process->Info = {};
+        Process->Info.SpawnTime = TimeManager->GetCounter();
+        Process->Info.Year = 0;
+        Process->Info.Month = 0;
+        Process->Info.Day = 0;
+        Process->Info.Hour = 0;
+        Process->Info.Minute = 0;
+        Process->Info.Second = 0;
+        for (int i = 0; i < MAX_CPU; i++)
+        {
+            Process->Info.Affinity[i] = true;
+        }
+        Process->Info.Priority = TaskPriority::Normal;
+
+        debug("Process page table: %#lx", Process->PageTable);
+        debug("Created process \"%s\"(%d) in process \"%s\"(%d)",
+              Process->Name, Process->ID,
+              Parent ? Process->Parent->Name : "None",
+              Parent ? Process->Parent->ID : 0);
+
+        if (Image)
+        {
+            // TODO: Check if it's ELF
+            Process->ELFSymbolTable = new SymbolResolver::Symbols((uintptr_t)Image);
+        }
+        else
+        {
+            debug("No image provided for process \"%s\"(%d)", Process->Name, Process->ID);
+        }
+
+        if (Parent)
+            Parent->Children.push_back(Process);
+        ProcessList.push_back(Process);
+        return Process;
+    }
+
+    Task::Task(const IP EntryPoint) : Interrupts::Handler(16) /* IRQ16 */
+    {
+        SmartLock(TaskingLock);
+#if defined(a64)
+        // Map the IRQ16 to the first CPU.
+        ((APIC::APIC *)Interrupts::apic[0])->RedirectIRQ(0, CPU::x86::IRQ16 - CPU::x86::IRQ0, 1);
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+        KPrint("Starting Tasking With Instruction Pointer: %p (\e666666%s\eCCCCCC)", EntryPoint, KernelSymbolTable->GetSymbolFromAddress(EntryPoint));
+        TaskingLock.Unlock();
+
+#if defined(a64)
+        TaskArchitecture Arch = TaskArchitecture::x64;
+#elif defined(a32)
+        TaskArchitecture Arch = TaskArchitecture::x32;
+#elif defined(aa64)
+    TaskArchitecture Arch = TaskArchitecture::ARM64;
+#endif
+        PCB *kproc = CreateProcess(nullptr, "Kernel", TaskTrustLevel::Kernel);
+        TCB *kthrd = CreateThread(kproc, EntryPoint, nullptr, nullptr, std::vector<AuxiliaryVector>(), 0, Arch);
+        kthrd->Rename("Main Thread");
+        debug("Created Kernel Process: %s and Thread: %s", kproc->Name, kthrd->Name);
+        TaskingLock.Lock(__FUNCTION__);
+
+        bool MONITORSupported = false;
+        if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+        {
+            CPU::x86::AMD::CPUID0x00000001 cpuid;
+            cpuid.Get();
+            MONITORSupported = cpuid.ECX.MONITOR;
+        }
+        else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+        {
+            CPU::x86::Intel::CPUID0x00000001 cpuid;
+            cpuid.Get();
+            MONITORSupported = cpuid.ECX.MONITOR;
+        }
+
+        if (MONITORSupported)
+        {
+            trace("CPU has MONITOR/MWAIT support.");
+        }
+
+        if (!CPU::Interrupts(CPU::Check))
+        {
+            error("Interrupts are not enabled.");
+            CPU::Interrupts(CPU::Enable);
+        }
+
+        TaskingLock.Unlock();
+        IdleProcess = CreateProcess(nullptr, (char *)"Idle", TaskTrustLevel::Kernel);
+        for (int i = 0; i < SMP::CPUCores; i++)
+        {
+            IdleThread = CreateThread(IdleProcess, reinterpret_cast<uintptr_t>(IdleProcessLoop));
+            char IdleName[16];
+            sprintf(IdleName, "Idle Thread %d", i);
+            IdleThread->Rename(IdleName);
+            IdleThread->SetPriority(Idle);
+            for (int j = 0; j < MAX_CPU; j++)
+                IdleThread->Info.Affinity[j] = false;
+            IdleThread->Info.Affinity[i] = true;
+        }
+        debug("Tasking Started");
+#if defined(a64)
+        ((APIC::Timer *)Interrupts::apicTimer[0])->OneShot(CPU::x86::IRQ16, 100);
+
+        /* FIXME: The kernel is not ready for multi-core tasking. */
+        // for (int i = 1; i < SMP::CPUCores; i++)
+        // {
+        //     ((APIC::Timer *)Interrupts::apicTimer[i])->OneShot(CPU::x86::IRQ16, 100);
+        //     APIC::InterruptCommandRegisterLow icr;
+        //     icr.Vector = CPU::x86::IRQ16;
+        //     icr.Level = APIC::APICLevel::Assert;
+        //     ((APIC::APIC *)Interrupts::apic[0])->IPI(i, icr);
+        // }
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+    }
+
+    Task::~Task()
+    {
+        debug("Destructor called");
+        {
+            SmartLock(TaskingLock);
+            foreach (PCB *Process in ProcessList)
+            {
+                foreach (TCB *Thread in Process->Threads)
+                {
+                    if (Thread == GetCurrentCPU()->CurrentThread.load() ||
+                        Thread == CleanupThread)
+                        continue;
+                    this->KillThread(Thread, 0xFFFF);
+                }
+
+                if (Process == GetCurrentCPU()->CurrentProcess.load())
+                    continue;
+                this->KillProcess(Process, 0xFFFF);
+            }
+        }
+
+        while (ProcessList.size() > 0)
+        {
+            trace("Waiting for %d processes to terminate", ProcessList.size());
+            int NotTerminated = 0;
+            foreach (PCB *Process in ProcessList)
+            {
+                debug("Process %s(%d) is still running (or waiting to be removed status %#lx)", Process->Name, Process->ID, Process->Status);
+                if (Process->Status == TaskStatus::Terminated)
+                    continue;
+                NotTerminated++;
+            }
+            if (NotTerminated == 1)
+                break;
+            TaskingScheduler_OneShot(100);
+        }
+
+        trace("Tasking stopped");
+    }
+}
diff --git a/Kernel/Tests/CPUID.cpp b/Kernel/Tests/CPUID.cpp
new file mode 100644
index 00000000..c6c409b2
--- /dev/null
+++ b/Kernel/Tests/CPUID.cpp
@@ -0,0 +1,155 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <types.h>
+#include <memory.hpp>
+#include <debug.h>
+
+extern bool DebuggerIsAttached;
+
+__constructor void TestCPUIDStructs()
+{
+    if (!DebuggerIsAttached)
+        return;
+
+    if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+    {
+        CPU::x86::AMD::CPUID0x00000000 cpuid0;
+        CPU::x86::AMD::CPUID0x00000001 cpuid1;
+        CPU::x86::AMD::CPUID0x00000005 cpuid5;
+        CPU::x86::AMD::CPUID0x00000006 cpuid6;
+        CPU::x86::AMD::CPUID0x00000007 cpuid7;
+        CPU::x86::AMD::CPUID0x0000000B_ECX_0 cpuidB_C_0;
+        CPU::x86::AMD::CPUID0x0000000B_ECX_1 cpuidB_C_1;
+        CPU::x86::AMD::CPUID0x0000000D_ECX_0 cpuidD_C_0;
+        CPU::x86::AMD::CPUID0x0000000D_ECX_1 cpuidD_C_1;
+        CPU::x86::AMD::CPUID0x0000000D_ECX_2 cpuidD_C_2;
+        CPU::x86::AMD::CPUID0x0000000D_ECX_11 cpuidD_C_11;
+        CPU::x86::AMD::CPUID0x0000000D_ECX_12 cpuidD_C_12;
+        CPU::x86::AMD::CPUID0x0000000D_ECX_3E cpuidD_C_3E;
+        CPU::x86::AMD::CPUID0x80000000 cpuid80000000;
+        CPU::x86::AMD::CPUID0x80000001 cpuid80000001;
+        CPU::x86::AMD::CPUID0x80000002 cpuid80000002;
+        CPU::x86::AMD::CPUID0x80000003 cpuid80000003;
+        CPU::x86::AMD::CPUID0x80000004 cpuid80000004;
+        CPU::x86::AMD::CPUID0x80000005 cpuid80000005;
+        CPU::x86::AMD::CPUID0x80000006 cpuid80000006;
+        CPU::x86::AMD::CPUID0x80000007 cpuid80000007;
+        CPU::x86::AMD::CPUID0x80000008 cpuid80000008;
+        CPU::x86::AMD::CPUID0x8000000A cpuid8000000A;
+        CPU::x86::AMD::CPUID0x80000019 cpuid80000019;
+        CPU::x86::AMD::CPUID0x8000001A cpuid8000001A;
+        CPU::x86::AMD::CPUID0x8000001B cpuid8000001B;
+        CPU::x86::AMD::CPUID0x8000001C cpuid8000001C;
+        CPU::x86::AMD::CPUID0x8000001D cpuid8000001D;
+        CPU::x86::AMD::CPUID0x8000001E cpuid8000001E;
+        CPU::x86::AMD::CPUID0x8000001F cpuid8000001F;
+        CPU::x86::AMD::CPUID0x80000020 cpuid80000020;
+        CPU::x86::AMD::CPUID0x80000021 cpuid80000021;
+        CPU::x86::AMD::CPUID0x80000022 cpuid80000022;
+        CPU::x86::AMD::CPUID0x80000023 cpuid80000023;
+        CPU::x86::AMD::CPUID0x80000026 cpuid80000026;
+
+        cpuid0.Get();
+        cpuid1.Get();
+        cpuid5.Get();
+        cpuid6.Get();
+        cpuid7.Get();
+        cpuidB_C_0.Get();
+        cpuidB_C_1.Get();
+        cpuidD_C_0.Get();
+        cpuidD_C_1.Get();
+        cpuidD_C_2.Get();
+        cpuidD_C_11.Get();
+        cpuidD_C_12.Get();
+        cpuidD_C_3E.Get();
+        cpuid80000000.Get();
+        cpuid80000001.Get();
+        cpuid80000002.Get();
+        cpuid80000003.Get();
+        cpuid80000004.Get();
+        cpuid80000005.Get();
+        cpuid80000006.Get();
+        cpuid80000007.Get();
+        cpuid80000008.Get();
+        cpuid8000000A.Get();
+        cpuid80000019.Get();
+        cpuid8000001A.Get();
+        cpuid8000001B.Get();
+        cpuid8000001C.Get();
+        cpuid8000001D.Get();
+        cpuid8000001E.Get();
+        cpuid8000001F.Get();
+        cpuid80000020.Get();
+        cpuid80000021.Get();
+        cpuid80000022.Get();
+        cpuid80000023.Get();
+        cpuid80000026.Get();
+
+        // asmv("int3");
+    }
+    else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+    {
+        CPU::x86::Intel::CPUID0x00000000 cpuid0;
+        CPU::x86::Intel::CPUID0x00000001 cpuid1;
+        CPU::x86::Intel::CPUID0x00000002 cpuid2;
+        CPU::x86::Intel::CPUID0x00000003 cpuid3;
+        CPU::x86::Intel::CPUID0x00000004_1 cpuid4_1;
+        CPU::x86::Intel::CPUID0x00000005 cpuid5;
+        CPU::x86::Intel::CPUID0x00000006 cpuid6;
+        CPU::x86::Intel::CPUID0x00000007_0 cpuid7_0;
+        CPU::x86::Intel::CPUID0x00000007_1 cpuid7_1;
+        CPU::x86::Intel::CPUID0x0000000A cpuidA;
+        CPU::x86::Intel::CPUID0x00000015 cpuid15;
+        CPU::x86::Intel::CPUID0x00000016 cpuid16;
+        CPU::x86::Intel::CPUID0x80000000 cpuid80000000;
+        CPU::x86::Intel::CPUID0x80000001 cpuid80000001;
+        CPU::x86::Intel::CPUID0x80000002 cpuid80000002;
+        CPU::x86::Intel::CPUID0x80000003 cpuid80000003;
+        CPU::x86::Intel::CPUID0x80000004 cpuid80000004;
+        CPU::x86::Intel::CPUID0x80000006 cpuid80000006;
+        CPU::x86::Intel::CPUID0x80000008 cpuid80000008;
+        CPU::x86::Intel::CPUID0x8000000A cpuid8000000A;
+
+        cpuid0.Get();
+        cpuid1.Get();
+        cpuid2.Get();
+        cpuid3.Get();
+        cpuid4_1.Get();
+        cpuid5.Get();
+        cpuid6.Get();
+        cpuid7_0.Get();
+        cpuid7_1.Get();
+        cpuidA.Get();
+        cpuid15.Get();
+        cpuid16.Get();
+        cpuid80000000.Get();
+        cpuid80000001.Get();
+        cpuid80000002.Get();
+        cpuid80000003.Get();
+        cpuid80000004.Get();
+        cpuid80000006.Get();
+        cpuid80000008.Get();
+        cpuid8000000A.Get();
+
+        // asmv("int3");
+    }
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/Marco.cpp b/Kernel/Tests/Marco.cpp
new file mode 100644
index 00000000..189e9cf2
--- /dev/null
+++ b/Kernel/Tests/Marco.cpp
@@ -0,0 +1,107 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <types.h>
+#include <memory.hpp>
+#include <assert.h>
+#include <debug.h>
+
+__constructor void TestMacros()
+{
+    {
+        int a = TO_PAGES(4096);
+        int b = FROM_PAGES(1);
+
+        debug("a: 4096 -> %d", a);
+        debug("b:   a  -> %d", b);
+
+        if (a != 1)
+        {
+            error("t1: TO_PAGES is not equal to 1");
+            inf_loop;
+        }
+
+        if (b != 4096)
+        {
+            error("t1: FROM_PAGES is not equal to 4096");
+            inf_loop;
+        }
+    }
+
+    {
+        int a = TO_PAGES(4097);
+        int b = FROM_PAGES(2);
+
+        debug("a: 4097 -> %d", a);
+        debug("b:   a  -> %d", b);
+
+        if (a != 2)
+        {
+            error("t2: TO_PAGES is not equal to 2");
+            inf_loop;
+        }
+
+        if (b != 8192)
+        {
+            error("t2: FROM_PAGES is not equal to 8192");
+            inf_loop;
+        }
+    }
+
+    {
+        int a = 10;
+        assert(a == 10);
+
+        const char *str = "Hello";
+        assert(str != nullptr && str[0] == 'H');
+
+        bool flag = false;
+        assert(!flag);
+    }
+
+    debug("-------------------------");
+
+    {
+        uint64_t bytes = PAGE_SIZE;
+        uint64_t pgs = 1;
+
+        for (int i = 0; i < 128; i++)
+        {
+            uint64_t cnv_to_pgs = TO_PAGES(bytes);
+            uint64_t cnv_from_pgs = FROM_PAGES(pgs);
+
+            if (cnv_to_pgs != pgs)
+            {
+                error("TO_PAGES is not equal to %d (pages: %d)", pgs, cnv_to_pgs);
+                inf_loop;
+            }
+
+            if (cnv_from_pgs != bytes)
+            {
+                error("FROM_PAGES is not equal to %d (bytes: %d)", bytes, cnv_from_pgs);
+                inf_loop;
+            }
+
+            bytes += PAGE_SIZE;
+            pgs++;
+        }
+    }
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/MemoryAllocation.cpp b/Kernel/Tests/MemoryAllocation.cpp
new file mode 100644
index 00000000..3e410bf2
--- /dev/null
+++ b/Kernel/Tests/MemoryAllocation.cpp
@@ -0,0 +1,250 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <memory.hpp>
+#include <string.hpp>
+#include <debug.h>
+
+/* Originally from: https://github.com/EnderIce2/FennixProject/blob/main/kernel/test.cpp */
+
+#define MEMTEST_ITERATIONS 1024
+
+class test_mem_new_delete
+{
+public:
+    test_mem_new_delete();
+    ~test_mem_new_delete();
+};
+
+test_mem_new_delete::test_mem_new_delete()
+{
+    for (char i = 0; i < 2; i++)
+        ;
+}
+
+test_mem_new_delete::~test_mem_new_delete()
+{
+    for (char i = 0; i < 2; i++)
+        ;
+}
+
+extern bool EnableExternalMemoryTracer;
+extern bool DebuggerIsAttached;
+
+void TestMemoryAllocation()
+{
+    if (EnableExternalMemoryTracer || DebuggerIsAttached)
+    {
+        debug("The test is disabled when the external memory tracer or a debugger is enabled.");
+        return;
+    }
+
+    void *tmpAlloc1 = kmalloc(176);
+    void *tmpAlloc2 = kmalloc(511);
+    void *tmpAlloc3 = kmalloc(1027);
+    void *tmpAlloc4 = kmalloc(1569);
+    for (int repeat = 0; repeat < 4; repeat++)
+    {
+        debug("---------------[TEST %d]---------------\n", repeat);
+
+        debug("Single Page Request Test");
+        {
+            uint64_t prq1 = (uint64_t)KernelAllocator.RequestPage();
+            KernelAllocator.FreePage((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+                KernelAllocator.FreePage(KernelAllocator.RequestPage());
+
+            uint64_t prq2 = (uint64_t)KernelAllocator.RequestPage();
+            KernelAllocator.FreePage((void *)prq2);
+
+            debug(" Result:\t\t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("Multiple Page Request Test");
+        {
+            uint64_t prq1 = (uint64_t)KernelAllocator.RequestPages(10);
+            KernelAllocator.FreePages((void *)prq1, 10);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+                KernelAllocator.FreePages(KernelAllocator.RequestPages(20), 20);
+
+            uint64_t prq2 = (uint64_t)KernelAllocator.RequestPages(10);
+            KernelAllocator.FreePages((void *)prq2, 10);
+
+            debug(" Result:\t\t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("Multiple Fixed Malloc Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+                kfree(kmalloc(0x10000));
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:\t\t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("Multiple Dynamic Malloc Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+                kfree(kmalloc(i));
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:\t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("New/Delete Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+            {
+                test_mem_new_delete *t = new test_mem_new_delete();
+                delete t;
+            }
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:               \t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("New/Delete Fixed Array Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+            {
+                char *t = new char[128];
+                delete[] t;
+            }
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:    \t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("New/Delete Dynamic Array Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+            {
+                if (i == 0)
+                    continue;
+                char *t = new char[i];
+                delete[] t;
+            }
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:\t1-[%#lx]; 2-[%#lx]\n", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("calloc Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+            {
+                char *t = (char *)kcalloc(128, 1);
+                kfree(t);
+            }
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:\t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+
+        debug("realloc Test");
+        {
+            uint64_t prq1 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq1);
+
+            for (uint64_t i = 0; i < MEMTEST_ITERATIONS; i++)
+            {
+                char *t = (char *)kmalloc(128);
+                t = (char *)krealloc(t, 256);
+                kfree(t);
+            }
+
+            uint64_t prq2 = (uint64_t)kmalloc(0x1000);
+            kfree((void *)prq2);
+
+            debug(" Result:\t1-[%#lx]; 2-[%#lx]", (void *)prq1, (void *)prq2);
+            assert(prq1 == prq2);
+        }
+    }
+
+    kfree(tmpAlloc1);
+    kfree(tmpAlloc2);
+    kfree(tmpAlloc3);
+    kfree(tmpAlloc4);
+
+    debug("Memory Stress Test");
+    for (size_t i = 0; i < 0x1000; i++)
+        kfree(kmalloc(i));
+
+    debug("Invalid Usage Test");
+    kfree(tmpAlloc1);
+    kfree(tmpAlloc2);
+    kfree(tmpAlloc3);
+    kfree(tmpAlloc4);
+
+    void *InvMlc = kmalloc(0);
+    assert(InvMlc == nullptr);
+    krealloc(InvMlc, 0);
+    assert(InvMlc == nullptr);
+    kcalloc(0, 0);
+    assert(InvMlc == nullptr);
+    kcalloc(1, 0);
+    assert(InvMlc == nullptr);
+    kcalloc(0, 1);
+    assert(InvMlc == nullptr);
+    kfree(InvMlc);
+
+    debug("Memory Test Complete\n");
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/MemoryOperations.cpp b/Kernel/Tests/MemoryOperations.cpp
new file mode 100644
index 00000000..a38b7162
--- /dev/null
+++ b/Kernel/Tests/MemoryOperations.cpp
@@ -0,0 +1,138 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <types.h>
+#include <memory.hpp>
+#include <convert.h>
+
+extern bool EnableExternalMemoryTracer;
+extern bool DebuggerIsAttached;
+
+__constructor void TestMemoryOperations()
+{
+    if (EnableExternalMemoryTracer || DebuggerIsAttached)
+    {
+        debug("The test is disabled when the external memory tracer or a debugger is enabled.");
+        return;
+    }
+
+    int arr1[5] = {1, 2, 3, 4, 5};
+    int arr2[5] = {0, 0, 0, 0, 0};
+    char str1[] = "Hello";
+    char str2[] = "World";
+
+    memcpy_unsafe(arr2, arr1, sizeof(arr1));
+    debug("memcpy: arr2[0]=%d, arr2[1]=%d, arr2[2]=%d, arr2[3]=%d, arr2[4]=%d",
+          arr2[0], arr2[1], arr2[2], arr2[3], arr2[4]);
+    if (memcmp(arr1, arr2, sizeof(arr1)) != 0)
+    {
+        error("memcpy failed!");
+        inf_loop;
+    }
+
+    memset_unsafe(arr2, 0, sizeof(arr2));
+    debug("memset: arr2[0]=%d, arr2[1]=%d, arr2[2]=%d, arr2[3]=%d, arr2[4]=%d",
+          arr2[0], arr2[1], arr2[2], arr2[3], arr2[4]);
+    if (memcmp(arr1, arr2, sizeof(arr1)) == 0)
+    {
+        error("memset failed!");
+        inf_loop;
+    }
+
+    memmove_unsafe(str1 + 3, str1, strlen(str1) + 1);
+    debug("memmove: str1=%s", str1);
+    if (strcmp(str1, "HelHello") != 0)
+    {
+        error("memmove failed!");
+        inf_loop;
+    }
+
+    char carr[1024];
+    char carrFull[1024];
+    char carrTo[16];
+
+    for (size_t i = 0; i < 512; i++)
+    {
+        for (size_t i = 0; i < 16; i++)
+            carrTo[i] = 'a';
+
+        for (size_t i = 0; i < 1024; i += 16)
+            memcpy_unsafe(carr + i, carrTo, 16);
+
+        for (size_t i = 0; i < 1024; i++)
+        {
+            if (carr[i] != 'a')
+            {
+                error("memcpy failed!");
+                while (1)
+                    ;
+            }
+        }
+
+        for (size_t i = 0; i < 1024; i++)
+            carrFull[i] = 'b';
+
+        memcpy_unsafe(carr, carrFull, 1024);
+
+        for (size_t i = 0; i < 1024; i++)
+        {
+            if (carr[i] != 'b')
+            {
+                error("memcpy failed!");
+                while (1)
+                    ;
+            }
+        }
+    }
+
+    for (size_t i = 0; i < 512; i++)
+    {
+        for (size_t i = 0; i < 1024; i += 16)
+            memset_unsafe(carr + i, 'c', 16);
+
+        for (size_t i = 0; i < 1024; i++)
+        {
+            if (carr[i] != 'c')
+            {
+                error("memcpy failed!");
+                while (1)
+                    ;
+            }
+        }
+    }
+
+    for (size_t i = 0; i < 512; i++)
+    {
+        memset_unsafe(carr, 'd', 1024);
+
+        for (size_t i = 0; i < 1024; i++)
+        {
+            if (carr[i] != 'd')
+            {
+                error("memset failed!");
+                while (1)
+                    ;
+            }
+        }
+    }
+
+    debug("Memory operations test passed");
+}
+
+#endif
diff --git a/Kernel/Tests/RandomNumberGenerator.cpp b/Kernel/Tests/RandomNumberGenerator.cpp
new file mode 100644
index 00000000..bfab23be
--- /dev/null
+++ b/Kernel/Tests/RandomNumberGenerator.cpp
@@ -0,0 +1,68 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <rand.hpp>
+#include <debug.h>
+#include <cpu.hpp>
+
+__constructor void TestRandom()
+{
+    int RDRANDFlag = 0;
+    if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_AMD) == 0)
+    {
+        CPU::x86::AMD::CPUID0x00000001 cpuid;
+        cpuid.Get();
+        RDRANDFlag = cpuid.ECX.RDRAND;
+    }
+    else if (strcmp(CPU::Vendor(), x86_CPUID_VENDOR_INTEL) == 0)
+    {
+        CPU::x86::Intel::CPUID0x00000001 cpuid;
+        cpuid.Get();
+        RDRANDFlag = cpuid.ECX.RDRAND;
+    }
+
+    if (strcmp(CPU::Hypervisor(), x86_CPUID_VENDOR_TCG) == 0)
+        RDRANDFlag = 0;
+
+#if defined(a86)
+    if (RDRANDFlag)
+    {
+        uint64_t RDSEEDValue = 0;
+        asmv("1: rdseed %0; jnc 1b"
+             : "=r"(RDSEEDValue));
+        debug("RDSEED: %ld", RDSEEDValue);
+    }
+#endif
+
+    Random::ChangeSeed(0xdeadbeef);
+    uint16_t Seeds16[16];
+    uint32_t Seeds32[16];
+    uint64_t Seeds64[16];
+    for (short i = 0; i < 16; i++)
+    {
+        Seeds16[i] = Random::rand16();
+        Seeds32[i] = Random::rand32();
+        Seeds64[i] = Random::rand64();
+    }
+    debug("Random 16: %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld", Seeds16[0], Seeds16[1], Seeds16[2], Seeds16[3], Seeds16[4], Seeds16[5], Seeds16[6], Seeds16[7], Seeds16[8], Seeds16[9], Seeds16[10], Seeds16[11], Seeds16[12], Seeds16[13], Seeds16[14], Seeds16[15]);
+    debug("Random 32: %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld", Seeds32[0], Seeds32[1], Seeds32[2], Seeds32[3], Seeds32[4], Seeds32[5], Seeds32[6], Seeds32[7], Seeds32[8], Seeds32[9], Seeds32[10], Seeds32[11], Seeds32[12], Seeds32[13], Seeds32[14], Seeds32[15]);
+    debug("Random 64: %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld, %ld", Seeds64[0], Seeds64[1], Seeds64[2], Seeds64[3], Seeds64[4], Seeds64[5], Seeds64[6], Seeds64[7], Seeds64[8], Seeds64[9], Seeds64[10], Seeds64[11], Seeds64[12], Seeds64[13], Seeds64[14], Seeds64[15]);
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/String.cpp b/Kernel/Tests/String.cpp
new file mode 100644
index 00000000..6f646e95
--- /dev/null
+++ b/Kernel/Tests/String.cpp
@@ -0,0 +1,119 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <std/string.hpp>
+#include <debug.h>
+
+void TestString()
+{
+    std::string hw("Hello, world!");
+    debug("String length: %d", hw.length());
+    debug("String capacity: %d", hw.capacity());
+    debug("String data: %s", hw.c_str());
+    if (hw == "Hello, world!" && hw != "World, hello!")
+        debug("String comparison works!");
+    else
+    {
+        error("String comparison doesn't work! \"%s\"", hw.c_str());
+        inf_loop;
+    }
+
+    std::string hi("Hi");
+    char chi[3];
+    chi[0] = hi[0];
+    chi[1] = hi[1];
+    chi[2] = '\0';
+    if (strcmp(chi, "Hi") == 0)
+        debug("String indexing works!");
+    else
+    {
+        error("String indexing doesn't work! \"%s\" \"%s\"", chi, hi.c_str());
+        inf_loop;
+    }
+
+    hi << " there!";
+    if (hi == "Hi there!")
+        debug("String concatenation works!");
+    else
+    {
+        error("String concatenation doesn't work! \"%s\"", hi.c_str());
+        inf_loop;
+    }
+
+    hi << " " << hw;
+    if (hi == "Hi there! Hello, world!")
+        debug("String concatenation works!");
+    else
+    {
+        error("String concatenation doesn't work! \"%s\"", hi.c_str());
+        inf_loop;
+    }
+
+    std::string eq0("Hello, world!");
+    std::string eq1("Hello, world!");
+    std::string eq2("World, hello!");
+
+    if (eq0 == eq1)
+        debug("String equality works!");
+    else
+    {
+        error("String equality doesn't work! \"%s\" \"%s\"", eq0.c_str(), eq1.c_str());
+        inf_loop;
+    }
+
+    if (eq0 != eq2)
+        debug("String inequality works!");
+    else
+    {
+        error("String inequality doesn't work! \"%s\" \"%s\"", eq0.c_str(), eq2.c_str());
+        inf_loop;
+    }
+
+    char chw[14];
+    int i = 0;
+    foreach (auto c in hw)
+    {
+        chw[i] = c;
+        i++;
+    }
+    chw[i] = '\0';
+
+    if (strcmp(chw, "Hello, world!") == 0)
+        debug("String iteration works!");
+    else
+    {
+        error("String iteration doesn't work! \"%s\" \"%s\" %d", chw, hw.c_str(), i);
+        inf_loop;
+    }
+
+    std::string a("Hello");
+    std::string b("World");
+    std::string c;
+    c = a + ", " + b + "!";
+
+    if (c == "Hello, World!")
+        debug("String addition works!");
+    else
+    {
+        error("String addition doesn't work! \"%s\"", c.c_str());
+        inf_loop;
+    }
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/TypeSize.cpp b/Kernel/Tests/TypeSize.cpp
new file mode 100644
index 00000000..ab24ba39
--- /dev/null
+++ b/Kernel/Tests/TypeSize.cpp
@@ -0,0 +1,123 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <debug.h>
+
+__constructor void TestTypeSize()
+{
+    debug("--- INT TYPES ---");
+    debug("sizeof(__INT8_TYPE__) = %lld", sizeof(__INT8_TYPE__));
+    debug("sizeof(__INT16_TYPE__) = %lld", sizeof(__INT16_TYPE__));
+    debug("sizeof(__INT32_TYPE__) = %lld", sizeof(__INT32_TYPE__));
+    debug("sizeof(__INT64_TYPE__) = %lld", sizeof(__INT64_TYPE__));
+
+    debug("-- UINT TYPES ---");
+    debug("sizeof(__UINT8_TYPE__) = %lld", sizeof(__INT8_TYPE__));
+    debug("sizeof(__UINT16_TYPE__) = %lld", sizeof(__INT16_TYPE__));
+    debug("sizeof(__UINT32_TYPE__) = %lld", sizeof(__INT32_TYPE__));
+    debug("sizeof(__UINT64_TYPE__) = %lld", sizeof(__INT64_TYPE__));
+
+    debug("--- INT LEAST TYPES ---");
+    debug("sizeof(__INT_LEAST8_TYPE__) = %lld", sizeof(__INT_LEAST8_TYPE__));
+    debug("sizeof(__INT_LEAST16_TYPE__) = %lld", sizeof(__INT_LEAST16_TYPE__));
+    debug("sizeof(__INT_LEAST32_TYPE__) = %lld", sizeof(__INT_LEAST32_TYPE__));
+    debug("sizeof(__INT_LEAST64_TYPE__) = %lld", sizeof(__INT_LEAST64_TYPE__));
+
+    debug("--- UINT LEAST TYPES ---");
+    debug("sizeof(__UINT_LEAST8_TYPE__) = %lld", sizeof(__UINT_LEAST8_TYPE__));
+    debug("sizeof(__UINT_LEAST16_TYPE__) = %lld", sizeof(__UINT_LEAST16_TYPE__));
+    debug("sizeof(__UINT_LEAST32_TYPE__) = %lld", sizeof(__UINT_LEAST32_TYPE__));
+    debug("sizeof(__UINT_LEAST64_TYPE__) = %lld", sizeof(__UINT_LEAST64_TYPE__));
+
+    debug("--- INT FAST TYPES ---");
+    debug("sizeof(__INT_FAST8_TYPE__) = %lld", sizeof(__INT_FAST8_TYPE__));
+    debug("sizeof(__INT_FAST16_TYPE__) = %lld", sizeof(__INT_FAST16_TYPE__));
+    debug("sizeof(__INT_FAST32_TYPE__) = %lld", sizeof(__INT_FAST32_TYPE__));
+    debug("sizeof(__INT_FAST64_TYPE__) = %lld", sizeof(__INT_FAST64_TYPE__));
+
+    debug("--- UINT FAST TYPES ---");
+    debug("sizeof(__UINT_FAST8_TYPE__) = %lld", sizeof(__UINT_FAST8_TYPE__));
+    debug("sizeof(__UINT_FAST16_TYPE__) = %lld", sizeof(__UINT_FAST16_TYPE__));
+    debug("sizeof(__UINT_FAST32_TYPE__) = %lld", sizeof(__UINT_FAST32_TYPE__));
+    debug("sizeof(__UINT_FAST64_TYPE__) = %lld", sizeof(__UINT_FAST64_TYPE__));
+
+    debug("--- INTPTR TYPES ---");
+    debug("sizeof(__INTPTR_TYPE__) = %lld", sizeof(__INTPTR_TYPE__));
+    debug("sizeof(__UINTPTR_TYPE__) = %lld", sizeof(__UINTPTR_TYPE__));
+
+    debug("--- OTHER TYPES ---");
+    debug("sizeof(__PTRDIFF_TYPE__) = %lld", sizeof(__PTRDIFF_TYPE__));
+    debug("sizeof(__SIZE_TYPE__) = %lld", sizeof(__SIZE_TYPE__));
+    debug("sizeof(__WCHAR_TYPE__) = %lld", sizeof(__WCHAR_TYPE__));
+    debug("sizeof(__WINT_TYPE__) = %lld", sizeof(__WINT_TYPE__));
+    debug("sizeof(__SIG_ATOMIC_TYPE__) = %lld", sizeof(__SIG_ATOMIC_TYPE__));
+
+    debug("--- INTX MAX TYPES ---");
+    debug("__INT8_MAX__ = %#llx", __INT8_MAX__);
+    debug("__INT16_MAX__ = %#llx", __INT16_MAX__);
+    debug("__INT32_MAX__ = %#llx", __INT32_MAX__);
+    debug("__INT64_MAX__ = %#llx", __INT64_MAX__);
+
+    debug("--- UINTX MAX TYPES ---");
+    debug("__UINT8_MAX__ = %#llx", __UINT8_MAX__);
+    debug("__UINT16_MAX__ = %#llx", __UINT16_MAX__);
+    debug("__UINT32_MAX__ = %#llx", __UINT32_MAX__);
+    debug("__UINT64_MAX__ = %#llx", __UINT64_MAX__);
+
+    // debug("--- INTMAX TYPES ---");
+    // debug("__INTMAX_TYPE__ = %#llx", __INTMAX_TYPE__);
+    // debug("__UINTMAX_TYPE__ = %#llx", __UINTMAX_TYPE__);
+
+    debug("--- INTLEASTX MAX ---");
+    debug("__INT_LEAST8_MAX__ = %#llx", __INT_LEAST8_MAX__);
+    debug("__INT_LEAST16_MAX__ = %#llx", __INT_LEAST16_MAX__);
+    debug("__INT_LEAST32_MAX__ = %#llx", __INT_LEAST32_MAX__);
+    debug("__INT_LEAST64_MAX__ = %#llx", __INT_LEAST64_MAX__);
+
+    debug("--- UINTLEASTX MAX ---");
+    debug("__UINT_LEAST8_MAX__ = %#llx", __UINT_LEAST8_MAX__);
+    debug("__UINT_LEAST16_MAX__ = %#llx", __UINT_LEAST16_MAX__);
+
+    debug("--- INTFASTX MAX ---");
+    debug("__INT_FAST8_MAX__ = %#llx", __INT_FAST8_MAX__);
+    debug("__INT_FAST16_MAX__ = %#llx", __INT_FAST16_MAX__);
+    debug("__INT_FAST32_MAX__ = %#llx", __INT_FAST32_MAX__);
+    debug("__INT_FAST64_MAX__ = %#llx", __INT_FAST64_MAX__);
+
+    debug("--- UINTFASTX MAX ---");
+    debug("__UINT_FAST8_MAX__ = %#llx", __UINT_FAST8_MAX__);
+    debug("__UINT_FAST16_MAX__ = %#llx", __UINT_FAST16_MAX__);
+    debug("__UINT_FAST32_MAX__ = %#llx", __UINT_FAST32_MAX__);
+    debug("__UINT_FAST64_MAX__ = %#llx", __UINT_FAST64_MAX__);
+
+    debug("--- INTPTR MAX ---");
+    debug("__INTPTR_MAX__ = %#llx", __INTPTR_MAX__);
+    debug("__UINTPTR_MAX__ = %#llx", __UINTPTR_MAX__);
+
+    debug("--- OTHER MAX ---");
+    debug("__PTRDIFF_MAX__ = %#llx", __PTRDIFF_MAX__);
+    debug("__SIZE_MAX__ = %#llx", __SIZE_MAX__);
+    debug("__WCHAR_MAX__ = %#llx", __WCHAR_MAX__);
+    debug("__WINT_MAX__ = %#llx", __WINT_MAX__);
+    debug("__SIG_ATOMIC_MAX__ = %#llx", __SIG_ATOMIC_MAX__);
+    debug("__INTMAX_MAX__ = %#llx", __INTMAX_MAX__);
+    debug("__UINTMAX_MAX__ = %#llx", __UINTMAX_MAX__);
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/std.cpp b/Kernel/Tests/std.cpp
new file mode 100644
index 00000000..6b0c0e9f
--- /dev/null
+++ b/Kernel/Tests/std.cpp
@@ -0,0 +1,36 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifdef DEBUG
+
+#include <std.hpp>
+#include <assert.h>
+
+__constructor void Test_std()
+{
+    std::atomic_int a = 0;
+    a++;
+    assert(a == 1);
+
+    int b = a.exchange(2);
+    assert(b == 1);
+    assert(a == 2);
+
+    debug("std: OK");
+}
+
+#endif // DEBUG
diff --git a/Kernel/Tests/t.h b/Kernel/Tests/t.h
new file mode 100644
index 00000000..b7326d44
--- /dev/null
+++ b/Kernel/Tests/t.h
@@ -0,0 +1,28 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_non_constructor_tests_H__
+#define __FENNIX_KERNEL_non_constructor_tests_H__
+#ifdef DEBUG
+
+#include <types.h>
+
+void TestString();
+void TestMemoryAllocation();
+
+#endif // DEBUG
+#endif // !__FENNIX_KERNEL_non_constructor_tests_H__
diff --git a/Kernel/dump.sh b/Kernel/dump.sh
new file mode 100755
index 00000000..f03c7f07
--- /dev/null
+++ b/Kernel/dump.sh
@@ -0,0 +1 @@
+make dump
diff --git a/Kernel/include/abi.h b/Kernel/include/abi.h
new file mode 100644
index 00000000..1bfb9abb
--- /dev/null
+++ b/Kernel/include/abi.h
@@ -0,0 +1,91 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ABI_H__
+#define __FENNIX_KERNEL_ABI_H__
+
+#include <types.h>
+
+#define AT_NULL 0
+#define AT_IGNORE 1
+#define AT_EXECFD 2
+#define AT_PHDR 3
+#define AT_PHENT 4
+#define AT_PHNUM 5
+#define AT_PAGESZ 6
+#define AT_BASE 7
+#define AT_FLAGS 8
+#define AT_ENTRY 9
+#define AT_NOTELF 10
+#define AT_UID 11
+#define AT_EUID 12
+#define AT_GID 13
+#define AT_EGID 14
+#define AT_PLATFORM 15
+#define AT_HWCAP 16
+#define AT_CLKTCK 17
+#define AT_SECURE 23
+#define AT_BASE_PLATFORM 24
+#define AT_RANDOM 25
+#define AT_HWCAP2 26
+#define AT_EXECFN 31
+#define AT_SYSINFO 32
+#define AT_SYSINFO_EHDR 33
+#define AT_L1I_CACHESHAPE 34
+#define AT_L1D_CACHESHAPE 35
+#define AT_L2_CACHESHAPE 36
+#define AT_L3_CACHESHAPE 37
+#define AT_L1I_CACHESIZE 40
+#define AT_L1I_CACHEGEOMETRY 41
+#define AT_L1D_CACHESIZE 42
+#define AT_L1D_CACHEGEOMETRY 43
+#define AT_L2_CACHESIZE 44
+#define AT_L2_CACHEGEOMETRY 45
+#define AT_L3_CACHESIZE 46
+#define AT_L3_CACHEGEOMETRY 47
+#define AT_MINSIGSTKSZ 51
+
+typedef struct
+{
+    uint32_t a_type;
+    union
+    {
+        uint32_t a_val;
+    } a_un;
+} Elf32_auxv_t;
+
+typedef struct
+{
+    uint64_t a_type;
+    union
+    {
+        uint64_t a_val;
+    } a_un;
+} Elf64_auxv_t;
+
+typedef struct
+{
+#if defined(a64)
+    Elf64_auxv_t archaux;
+#elif defined(a32)
+    Elf32_auxv_t archaux;
+#elif defined(aa64)
+    Elf64_auxv_t archaux;
+#endif
+} AuxiliaryVector;
+
+#endif // !__FENNIX_KERNEL_ABI_H__
diff --git a/Kernel/include/bitmap.hpp b/Kernel/include/bitmap.hpp
new file mode 100644
index 00000000..62249a92
--- /dev/null
+++ b/Kernel/include/bitmap.hpp
@@ -0,0 +1,33 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_BITMAP_H__
+#define __FENNIX_KERNEL_BITMAP_H__
+
+#include <types.h>
+
+class Bitmap
+{
+public:
+    size_t Size;
+    uint8_t *Buffer;
+    bool operator[](uint64_t index);
+    bool Set(uint64_t index, bool value);
+    bool Get(uint64_t index);
+};
+
+#endif // !__FENNIX_KERNEL_BITMAP_H__
diff --git a/Kernel/include/boot/binfo.h b/Kernel/include/boot/binfo.h
new file mode 100644
index 00000000..9b322639
--- /dev/null
+++ b/Kernel/include/boot/binfo.h
@@ -0,0 +1,147 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_BOOT_INFO_H__
+#define __FENNIX_KERNEL_BOOT_INFO_H__
+
+enum MemoryType
+{
+    Unknown_Memory_Type,
+    Usable,
+    Reserved,
+    ACPIReclaimable,
+    ACPINVS,
+    BadMemory,
+    BootloaderReclaimable,
+    KernelAndModules,
+    Framebuffer,
+    Unknown
+};
+
+enum FramebufferType
+{
+    Unknown_Framebuffer_Type,
+    Indexed,
+    RGB,
+    EGA
+};
+
+#define MAX_FRAMEBUFFERS 16
+#define MAX_MEMORY_ENTRIES 256
+#define MAX_MODULES 16
+
+struct BootInfo
+{
+    struct FramebufferInfo
+    {
+        enum FramebufferType Type;
+        void *BaseAddress;
+        __UINT32_TYPE__ Width;
+        __UINT32_TYPE__ Height;
+        __UINT64_TYPE__ Pitch;
+        __UINT16_TYPE__ BitsPerPixel;
+        __UINT8_TYPE__ RedMaskSize;
+        __UINT8_TYPE__ RedMaskShift;
+        __UINT8_TYPE__ GreenMaskSize;
+        __UINT8_TYPE__ GreenMaskShift;
+        __UINT8_TYPE__ BlueMaskSize;
+        __UINT8_TYPE__ BlueMaskShift;
+        void *ExtendedDisplayIdentificationData;
+        __UINT64_TYPE__ EDIDSize;
+    } Framebuffer[MAX_FRAMEBUFFERS];
+
+    struct MemoryInfo
+    {
+        struct MemoryEntryInfo
+        {
+            void *BaseAddress;
+            __UINT64_TYPE__ Length;
+            enum MemoryType Type;
+        } Entry[MAX_MEMORY_ENTRIES];
+        __UINT64_TYPE__ Entries;
+        __UINT64_TYPE__ Size;
+    } Memory;
+
+    struct ModuleInfo
+    {
+        void *Address;
+        char Path[256];
+        char CommandLine[256];
+        __UINT64_TYPE__ Size;
+    } Modules[MAX_MODULES];
+
+    struct RSDPInfo
+    {
+        /**
+         * @brief Signature
+         */
+        __UINT8_TYPE__ Signature[8];
+        /**
+         * @brief Checksum
+         */
+        __UINT8_TYPE__ Checksum;
+        /**
+         * @brief OEM ID
+         */
+        __UINT8_TYPE__ OEMID[6];
+        /**
+         * @brief Revision
+         */
+        __UINT8_TYPE__ Revision;
+        /**
+         * @brief Address of the Root System Description Table
+         */
+        __UINT32_TYPE__ RSDTAddress;
+        /* END OF RSDP 1.0 */
+
+        /**
+         * @brief Length
+         */
+        __UINT32_TYPE__ Length;
+        /**
+         * @brief Extended System Descriptor Table
+         */
+        __UINT64_TYPE__ XSDTAddress;
+        /**
+         * @brief Extended checksum
+         */
+        __UINT8_TYPE__ ExtendedChecksum;
+        /**
+         * @brief Reserved
+         */
+        __UINT8_TYPE__ Reserved[3];
+    } __attribute__((packed)) * RSDP;
+
+    struct KernelInfo
+    {
+        void *PhysicalBase;
+        void *VirtualBase;
+        void *FileBase;
+        char CommandLine[256];
+        __UINT64_TYPE__ Size;
+    } Kernel;
+
+    struct BootloaderInfo
+    {
+        char Name[256];
+        char Version[64];
+    } Bootloader;
+
+    void *SMBIOSPtr;
+};
+
+#endif // !__FENNIX_KERNEL_BOOT_INFO_H__
diff --git a/Kernel/include/boot/protocols/multiboot2.h b/Kernel/include/boot/protocols/multiboot2.h
new file mode 100644
index 00000000..bcc4d257
--- /dev/null
+++ b/Kernel/include/boot/protocols/multiboot2.h
@@ -0,0 +1,417 @@
+/*  multiboot2.h - Multiboot 2 header file.  */
+/*  Copyright (C) 1999,2003,2007,2008,2009,2010  Free Software Foundation, Inc.
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining a copy
+ *  of this software and associated documentation files (the "Software"), to
+ *  deal in the Software without restriction, including without limitation the
+ *  rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+ *  sell copies of the Software, and to permit persons to whom the Software is
+ *  furnished to do so, subject to the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be included in
+ *  all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ *  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ *  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL ANY
+ *  DEVELOPER OR DISTRIBUTOR BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ *  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+ *  IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+#ifndef MULTIBOOT_HEADER
+#define MULTIBOOT_HEADER 1
+
+/* How many bytes from the start of the file we search for the header.  */
+#define MULTIBOOT_SEARCH 32768
+#define MULTIBOOT_HEADER_ALIGN 8
+
+/* The magic field should contain this.  */
+#define MULTIBOOT2_HEADER_MAGIC 0xe85250d6
+
+/* This should be in %eax.  */
+#define MULTIBOOT2_BOOTLOADER_MAGIC 0x36d76289
+
+/* Alignment of multiboot modules.  */
+#define MULTIBOOT_MOD_ALIGN 0x00001000
+
+/* Alignment of the multiboot info structure.  */
+#define MULTIBOOT_INFO_ALIGN 0x00000008
+
+/* Flags set in the 'flags' member of the multiboot header.  */
+
+#define MULTIBOOT_TAG_ALIGN 8
+#define MULTIBOOT_TAG_TYPE_END 0
+#define MULTIBOOT_TAG_TYPE_CMDLINE 1
+#define MULTIBOOT_TAG_TYPE_BOOT_LOADER_NAME 2
+#define MULTIBOOT_TAG_TYPE_MODULE 3
+#define MULTIBOOT_TAG_TYPE_BASIC_MEMINFO 4
+#define MULTIBOOT_TAG_TYPE_BOOTDEV 5
+#define MULTIBOOT_TAG_TYPE_MMAP 6
+#define MULTIBOOT_TAG_TYPE_VBE 7
+#define MULTIBOOT_TAG_TYPE_FRAMEBUFFER 8
+#define MULTIBOOT_TAG_TYPE_ELF_SECTIONS 9
+#define MULTIBOOT_TAG_TYPE_APM 10
+#define MULTIBOOT_TAG_TYPE_EFI32 11
+#define MULTIBOOT_TAG_TYPE_EFI64 12
+#define MULTIBOOT_TAG_TYPE_SMBIOS 13
+#define MULTIBOOT_TAG_TYPE_ACPI_OLD 14
+#define MULTIBOOT_TAG_TYPE_ACPI_NEW 15
+#define MULTIBOOT_TAG_TYPE_NETWORK 16
+#define MULTIBOOT_TAG_TYPE_EFI_MMAP 17
+#define MULTIBOOT_TAG_TYPE_EFI_BS 18
+#define MULTIBOOT_TAG_TYPE_EFI32_IH 19
+#define MULTIBOOT_TAG_TYPE_EFI64_IH 20
+#define MULTIBOOT_TAG_TYPE_LOAD_BASE_ADDR 21
+
+#define MULTIBOOT_HEADER_TAG_END 0
+#define MULTIBOOT_HEADER_TAG_INFORMATION_REQUEST 1
+#define MULTIBOOT_HEADER_TAG_ADDRESS 2
+#define MULTIBOOT_HEADER_TAG_ENTRY_ADDRESS 3
+#define MULTIBOOT_HEADER_TAG_CONSOLE_FLAGS 4
+#define MULTIBOOT_HEADER_TAG_FRAMEBUFFER 5
+#define MULTIBOOT_HEADER_TAG_MODULE_ALIGN 6
+#define MULTIBOOT_HEADER_TAG_EFI_BS 7
+#define MULTIBOOT_HEADER_TAG_ENTRY_ADDRESS_EFI32 8
+#define MULTIBOOT_HEADER_TAG_ENTRY_ADDRESS_EFI64 9
+#define MULTIBOOT_HEADER_TAG_RELOCATABLE 10
+
+#define MULTIBOOT_ARCHITECTURE_I386 0
+#define MULTIBOOT_ARCHITECTURE_MIPS32 4
+#define MULTIBOOT_HEADER_TAG_OPTIONAL 1
+
+#define MULTIBOOT_LOAD_PREFERENCE_NONE 0
+#define MULTIBOOT_LOAD_PREFERENCE_LOW 1
+#define MULTIBOOT_LOAD_PREFERENCE_HIGH 2
+
+#define MULTIBOOT_CONSOLE_FLAGS_CONSOLE_REQUIRED 1
+#define MULTIBOOT_CONSOLE_FLAGS_EGA_TEXT_SUPPORTED 2
+
+#ifndef ASM_FILE
+
+typedef unsigned char multiboot_uint8_t;
+typedef unsigned short multiboot_uint16_t;
+typedef unsigned int multiboot_uint32_t;
+typedef unsigned long long multiboot_uint64_t;
+
+struct multiboot_header
+{
+    /* Must be MULTIBOOT_MAGIC - see above.  */
+    multiboot_uint32_t magic;
+
+    /* ISA */
+    multiboot_uint32_t architecture;
+
+    /* Total header length.  */
+    multiboot_uint32_t header_length;
+
+    /* The above fields plus this one must equal 0 mod 2^32. */
+    multiboot_uint32_t checksum;
+};
+
+struct multiboot_header_tag
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+};
+
+struct multiboot_header_tag_information_request
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+    multiboot_uint32_t requests[0];
+};
+
+struct multiboot_header_tag_address
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+    multiboot_uint32_t header_addr;
+    multiboot_uint32_t load_addr;
+    multiboot_uint32_t load_end_addr;
+    multiboot_uint32_t bss_end_addr;
+};
+
+struct multiboot_header_tag_entry_address
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+    multiboot_uint32_t entry_addr;
+};
+
+struct multiboot_header_tag_console_flags
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+    multiboot_uint32_t console_flags;
+};
+
+struct multiboot_header_tag_framebuffer
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+    multiboot_uint32_t width;
+    multiboot_uint32_t height;
+    multiboot_uint32_t depth;
+};
+
+struct multiboot_header_tag_module_align
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+};
+
+struct multiboot_header_tag_relocatable
+{
+    multiboot_uint16_t type;
+    multiboot_uint16_t flags;
+    multiboot_uint32_t size;
+    multiboot_uint32_t min_addr;
+    multiboot_uint32_t max_addr;
+    multiboot_uint32_t align;
+    multiboot_uint32_t preference;
+};
+
+struct multiboot_color
+{
+    multiboot_uint8_t red;
+    multiboot_uint8_t green;
+    multiboot_uint8_t blue;
+};
+
+struct multiboot_mmap_entry
+{
+    multiboot_uint64_t addr;
+    multiboot_uint64_t len;
+#define MULTIBOOT_MEMORY_AVAILABLE 1
+#define MULTIBOOT_MEMORY_RESERVED 2
+#define MULTIBOOT_MEMORY_ACPI_RECLAIMABLE 3
+#define MULTIBOOT_MEMORY_NVS 4
+#define MULTIBOOT_MEMORY_BADRAM 5
+    multiboot_uint32_t type;
+    multiboot_uint32_t zero;
+};
+typedef struct multiboot_mmap_entry multiboot_memory_map_t;
+
+struct multiboot_tag
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+};
+
+struct multiboot_tag_string
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    char string[0];
+};
+
+struct multiboot_tag_module
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t mod_start;
+    multiboot_uint32_t mod_end;
+    char cmdline[0];
+};
+
+struct multiboot_tag_basic_meminfo
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t mem_lower;
+    multiboot_uint32_t mem_upper;
+};
+
+struct multiboot_tag_bootdev
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t biosdev;
+    multiboot_uint32_t slice;
+    multiboot_uint32_t part;
+};
+
+struct multiboot_tag_mmap
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t entry_size;
+    multiboot_uint32_t entry_version;
+    struct multiboot_mmap_entry entries[0];
+};
+
+struct multiboot_vbe_info_block
+{
+    multiboot_uint8_t external_specification[512];
+};
+
+struct multiboot_vbe_mode_info_block
+{
+    multiboot_uint8_t external_specification[256];
+};
+
+struct multiboot_tag_vbe
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+
+    multiboot_uint16_t vbe_mode;
+    multiboot_uint16_t vbe_interface_seg;
+    multiboot_uint16_t vbe_interface_off;
+    multiboot_uint16_t vbe_interface_len;
+
+    struct multiboot_vbe_info_block vbe_control_info;
+    struct multiboot_vbe_mode_info_block vbe_mode_info;
+};
+
+struct multiboot_tag_framebuffer_common
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+
+    multiboot_uint64_t framebuffer_addr;
+    multiboot_uint32_t framebuffer_pitch;
+    multiboot_uint32_t framebuffer_width;
+    multiboot_uint32_t framebuffer_height;
+    multiboot_uint8_t framebuffer_bpp;
+#define MULTIBOOT_FRAMEBUFFER_TYPE_INDEXED 0
+#define MULTIBOOT_FRAMEBUFFER_TYPE_RGB 1
+#define MULTIBOOT_FRAMEBUFFER_TYPE_EGA_TEXT 2
+    multiboot_uint8_t framebuffer_type;
+    multiboot_uint16_t reserved;
+};
+
+struct multiboot_tag_framebuffer
+{
+    struct multiboot_tag_framebuffer_common common;
+
+    union
+    {
+        struct
+        {
+            multiboot_uint16_t framebuffer_palette_num_colors;
+            struct multiboot_color framebuffer_palette[0];
+        };
+        struct
+        {
+            multiboot_uint8_t framebuffer_red_field_position;
+            multiboot_uint8_t framebuffer_red_mask_size;
+            multiboot_uint8_t framebuffer_green_field_position;
+            multiboot_uint8_t framebuffer_green_mask_size;
+            multiboot_uint8_t framebuffer_blue_field_position;
+            multiboot_uint8_t framebuffer_blue_mask_size;
+        };
+    };
+};
+
+struct multiboot_tag_elf_sections
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t num;
+    multiboot_uint32_t entsize;
+    multiboot_uint32_t shndx;
+    char sections[0];
+};
+
+struct multiboot_tag_apm
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint16_t version;
+    multiboot_uint16_t cseg;
+    multiboot_uint32_t offset;
+    multiboot_uint16_t cseg_16;
+    multiboot_uint16_t dseg;
+    multiboot_uint16_t flags;
+    multiboot_uint16_t cseg_len;
+    multiboot_uint16_t cseg_16_len;
+    multiboot_uint16_t dseg_len;
+};
+
+struct multiboot_tag_efi32
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t pointer;
+};
+
+struct multiboot_tag_efi64
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint64_t pointer;
+};
+
+struct multiboot_tag_smbios
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint8_t major;
+    multiboot_uint8_t minor;
+    multiboot_uint8_t reserved[6];
+    multiboot_uint8_t tables[0];
+};
+
+struct multiboot_tag_old_acpi
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint8_t rsdp[0];
+};
+
+struct multiboot_tag_new_acpi
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint8_t rsdp[0];
+};
+
+struct multiboot_tag_network
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint8_t dhcpack[0];
+};
+
+struct multiboot_tag_efi_mmap
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t descr_size;
+    multiboot_uint32_t descr_vers;
+    multiboot_uint8_t efi_mmap[0];
+};
+
+struct multiboot_tag_efi32_ih
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t pointer;
+};
+
+struct multiboot_tag_efi64_ih
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint64_t pointer;
+};
+
+struct multiboot_tag_load_base_addr
+{
+    multiboot_uint32_t type;
+    multiboot_uint32_t size;
+    multiboot_uint32_t load_base_addr;
+};
+
+#endif /* ! ASM_FILE */
+
+#endif /* ! MULTIBOOT_HEADER */
\ No newline at end of file
diff --git a/Kernel/include/cargs.h b/Kernel/include/cargs.h
new file mode 100644
index 00000000..ff0a481f
--- /dev/null
+++ b/Kernel/include/cargs.h
@@ -0,0 +1,187 @@
+/*
+MIT License
+
+Copyright (c) 2022 Leonard Iklé
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+
+#pragma once
+
+/**
+ * This is a simple alternative cross-platform implementation of getopt, which
+ * is used to parse argument strings submitted to the executable (argc and argv
+ * which are received in the main function).
+ */
+
+#ifndef CAG_LIBRARY_H
+#define CAG_LIBRARY_H
+
+#include <types.h>
+
+typedef unsigned int FILE; // TODO: Implement FILE
+
+#if defined(_WIN32) || defined(__CYGWIN__)
+#define CAG_EXPORT __declspec(dllexport)
+#define CAG_IMPORT __declspec(dllimport)
+#elif __GNUC__ >= 4
+#define CAG_EXPORT __attribute__((visibility("default")))
+#define CAG_IMPORT __attribute__((visibility("default")))
+#else
+#define CAG_EXPORT
+#define CAG_IMPORT
+#endif
+
+#if defined(CAG_SHARED)
+#if defined(CAG_EXPORTS)
+#define CAG_PUBLIC CAG_EXPORT
+#else
+#define CAG_PUBLIC CAG_IMPORT
+#endif
+#else
+#define CAG_PUBLIC
+#endif
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+    /**
+     * An option is used to describe a flag/argument option submitted when the
+     * program is run.
+     */
+    typedef struct cag_option
+    {
+        const char identifier;
+        const char *access_letters;
+        const char *access_name;
+        const char *value_name;
+        const char *description;
+    } cag_option;
+
+    /**
+     * A context is used to iterate over all options provided. It stores the parsing
+     * state.
+     */
+    typedef struct cag_option_context
+    {
+        const struct cag_option *options;
+        size_t option_count;
+        int argc;
+        char **argv;
+        int index;
+        int inner_index;
+        bool forced_end;
+        char identifier;
+        char *value;
+    } cag_option_context;
+
+/**
+ * This is just a small macro which calculates the size of an array.
+ */
+#define CAG_ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]))
+
+    /**
+     * @brief Prints all options to the terminal.
+     *
+     * This function prints all options to the terminal. This can be used to
+     * generate the output for a "--help" option.
+     *
+     * @param options The options which will be printed.
+     * @param option_count The option count which will be printed.
+     * @param destination The destination where the output will be printed.
+     */
+    CAG_PUBLIC void cag_option_print(const cag_option *options, size_t option_count,
+                                     FILE *destination);
+
+    /**
+     * @brief Prepare argument options context for parsing.
+     *
+     * This function prepares the context for iteration and initializes the context
+     * with the supplied options and arguments. After the context has been prepared,
+     * it can be used to fetch arguments from it.
+     *
+     * @param context The context which will be initialized.
+     * @param options The registered options which are available for the program.
+     * @param option_count The amount of options which are available for the
+     * program.
+     * @param argc The amount of arguments the user supplied in the main function.
+     * @param argv A pointer to the arguments of the main function.
+     */
+    CAG_PUBLIC void cag_option_prepare(cag_option_context *context,
+                                       const cag_option *options, size_t option_count, int argc, char **argv);
+
+    /**
+     * @brief Fetches an option from the argument list.
+     *
+     * This function fetches a single option from the argument list. The context
+     * will be moved to that item. Information can be extracted from the context
+     * after the item has been fetched.
+     * The arguments will be re-ordered, which means that non-option arguments will
+     * be moved to the end of the argument list. After all options have been
+     * fetched, all non-option arguments will be positioned after the index of
+     * the context.
+     *
+     * @param context The context from which we will fetch the option.
+     * @return Returns true if there was another option or false if the end is
+     * reached.
+     */
+    CAG_PUBLIC bool cag_option_fetch(cag_option_context *context);
+
+    /**
+     * @brief Gets the identifier of the option.
+     *
+     * This function gets the identifier of the option, which should be unique to
+     * this option and can be used to determine what kind of option this is.
+     *
+     * @param context The context from which the option was fetched.
+     * @return Returns the identifier of the option.
+     */
+    CAG_PUBLIC char cag_option_get(const cag_option_context *context);
+
+    /**
+     * @brief Gets the value from the option.
+     *
+     * This function gets the value from the option, if any. If the option does not
+     * contain a value, this function will return NULL.
+     *
+     * @param context The context from which the option was fetched.
+     * @return Returns a pointer to the value or NULL if there is no value.
+     */
+    CAG_PUBLIC const char *cag_option_get_value(const cag_option_context *context);
+
+    /**
+     * @brief Gets the current index of the context.
+     *
+     * This function gets the index within the argv arguments of the context. The
+     * context always points to the next item which it will inspect. This is
+     * particularly useful to inspect the original argument array, or to get
+     * non-option arguments after option fetching has finished.
+     *
+     * @param context The context from which the option was fetched.
+     * @return Returns the current index of the context.
+     */
+    CAG_PUBLIC int cag_option_get_index(const cag_option_context *context);
+
+#ifdef __cplusplus
+} // extern "C"
+#endif
+
+#endif
\ No newline at end of file
diff --git a/Kernel/include/convert.h b/Kernel/include/convert.h
new file mode 100644
index 00000000..13c206e5
--- /dev/null
+++ b/Kernel/include/convert.h
@@ -0,0 +1,133 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <types.h>
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+    typedef struct mbstate_t
+    {
+        int count;
+        unsigned int value;
+    } mbstate_t;
+
+#define NAN (__builtin_nanf(""))
+
+    int isdigit(int c);
+    int isspace(int c);
+    int isempty(char *str);
+    int isalpha(int c);
+    int isupper(int c);
+    unsigned int isdelim(char c, const char *delim);
+    long abs(long i);
+    void swap(char *x, char *y);
+    char *reverse(char *Buffer, int i, int j);
+
+    float sqrtf(float x);
+    double clamp(double x, double low, double high);
+
+    float lerp(float a, float b, float t);
+    float smoothstep(float a, float b, float t);
+    float cubicInterpolate(float a, float b, float t);
+
+    void backspace(char s[]);
+    void append(char s[], char n);
+
+    int atoi(const char *String);
+    double atof(const char *String);
+    char *itoa(int Value, char *Buffer, int Base);
+    char *ltoa(long Value, char *Buffer, int Base);
+    char *ultoa(unsigned long Value, char *Buffer, int Base);
+    unsigned long int strtoul(const char *str, char **endptr, int base);
+
+    void *memcpy_unsafe(void *dest, const void *src, size_t n);
+    void *memset_unsafe(void *dest, int c, size_t n);
+    void *memmove_unsafe(void *dest, const void *src, size_t n);
+    int memcmp(const void *vl, const void *vr, size_t n);
+
+    void *memcpy_sse(void *dest, const void *src, size_t n);
+    void *memcpy_sse2(void *dest, const void *src, size_t n);
+    void *memcpy_sse3(void *dest, const void *src, size_t n);
+    void *memcpy_ssse3(void *dest, const void *src, size_t n);
+    void *memcpy_sse4_1(void *dest, const void *src, size_t n);
+    void *memcpy_sse4_2(void *dest, const void *src, size_t n);
+
+    void *memset_sse(void *dest, int c, size_t n);
+    void *memset_sse2(void *dest, int c, size_t n);
+    void *memset_sse3(void *dest, int c, size_t n);
+    void *memset_ssse3(void *dest, int c, size_t n);
+    void *memset_sse4_1(void *dest, int c, size_t n);
+    void *memset_sse4_2(void *dest, int c, size_t n);
+
+    void *memmove_sse(void *dest, const void *src, size_t n);
+    void *memmove_sse2(void *dest, const void *src, size_t n);
+    void *memmove_sse3(void *dest, const void *src, size_t n);
+    void *memmove_ssse3(void *dest, const void *src, size_t n);
+    void *memmove_sse4_1(void *dest, const void *src, size_t n);
+    void *memmove_sse4_2(void *dest, const void *src, size_t n);
+
+    long unsigned strlen(const char s[]);
+    int strncmp(const char *s1, const char *s2, unsigned long n);
+    char *strcat_unsafe(char *destination, const char *source);
+    char *strcpy_unsafe(char *destination, const char *source);
+    char *strncpy(char *destination, const char *source, unsigned long num);
+    int strcmp(const char *l, const char *r);
+    char *strstr(const char *haystack, const char *needle);
+    char *strdup(const char *String);
+    char *strchr(const char *String, int Char);
+    char *strrchr(const char *String, int Char);
+    int strncasecmp(const char *lhs, const char *rhs, long unsigned int Count);
+    int strcasecmp(const char *s1, const char *s2);
+    char *strtok(char *src, const char *delim);
+    long int strtol(const char *str, char **endptr, int base);
+    size_t wcslen(const wchar_t *s);
+    size_t wcsrtombs(char *dst, const wchar_t **src, size_t len, mbstate_t *ps);
+    int log2(unsigned int n);
+
+    void *__memcpy_chk(void *dest, const void *src, size_t len, size_t slen);
+    void *__memset_chk(void *dest, int val, size_t len, size_t slen);
+    void *__memmove_chk(void *dest, const void *src, size_t len, size_t slen);
+    char *__strcat_chk(char *dest, const char *src, size_t slen);
+    char *__strcpy_chk(char *dest, const char *src, size_t slen);
+
+#ifdef __cplusplus
+}
+#endif
+
+#undef memcpy
+#define memcpy(dest, src, n) \
+    __memcpy_chk(dest, src, n, __builtin_object_size(dest, 0))
+
+#undef memset
+#define memset(dest, c, n) \
+    __memset_chk(dest, c, n, __builtin_object_size(dest, 0))
+
+#undef memmove
+#define memmove(dest, src, n) \
+    __memmove_chk(dest, src, n, __builtin_object_size(dest, 0))
+
+#undef strcat
+#define strcat(dest, src) \
+    __strcat_chk(dest, src, __builtin_object_size(dest, 0))
+
+#undef strcpy
+#define strcpy(dest, src) \
+    __strcpy_chk(dest, src, __builtin_object_size(dest, 0))
diff --git a/Kernel/include/cpu.hpp b/Kernel/include/cpu.hpp
new file mode 100644
index 00000000..1cdcaf5e
--- /dev/null
+++ b/Kernel/include/cpu.hpp
@@ -0,0 +1,803 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_H__
+#define __FENNIX_KERNEL_CPU_H__
+
+#include <types.h>
+
+#include <cpu/x86/cpuid_intel.hpp>
+#include <cpu/x86/cpuid_amd.hpp>
+#include <cpu/x86/x32/cr.hpp>
+#include <cpu/x86/x32/msr.hpp>
+#include <cpu/x86/x64/cr.hpp>
+#include <cpu/x86/x64/msr.hpp>
+#include <cpu/x86/exceptions.hpp>
+#include <cpu/x86/interrupts.hpp>
+#include <cpu/signatures.hpp>
+#include <cpu/membar.hpp>
+#include <cstring>
+
+/**
+ * @brief CPU related functions.
+ */
+namespace CPU
+{
+    /**
+     * @brief Enum for CPU::Interrupts() function.
+     */
+    enum InterruptsType
+    {
+        /**
+         * @brief Check if interrupts are enabled.
+         */
+        Check,
+        /**
+         * @brief Enable interrupts.
+         */
+        Enable,
+        /**
+         * @brief Disable interrupts.
+         */
+        Disable
+    };
+
+    enum x86SIMDType
+    {
+        SIMD_NONE = (1 << 0),
+
+        SIMD_SSE = (1 << 1),
+        SIMD_SSE2 = (1 << 2),
+        SIMD_SSE3 = (1 << 3),
+        SIMD_SSSE3 = (1 << 4),
+        SIMD_SSE41 = (1 << 5),
+        SIMD_SSE42 = (1 << 6),
+
+        SIMD_AVX = (1 << 7),
+        SIMD_AVX2 = (1 << 8),
+        SIMD_AVX512 = (1 << 9),
+
+        SIMD_AVX512F = (1 << 10),
+        SIMD_AVX512CD = (1 << 11),
+        SIMD_AVX512ER = (1 << 12),
+        SIMD_AVX512PF = (1 << 13),
+
+        SIMD_AVX512VL = (1 << 14),
+        SIMD_AVX512DQ = (1 << 16),
+        SIMD_AVX512BW = (1 << 15),
+
+        SIMD_AVX512IFMA = (1 << 17),
+        SIMD_AVX512VBMI = (1 << 18),
+
+        SIMD_AVX5124VNNIW = (1 << 19),
+        SIMD_AVX5124FMAPS = (1 << 20),
+
+        SIMD_AVX512VPOPCNTDQ = (1 << 21),
+
+        SIMD_AVX512VNNI = (1 << 22),
+        SIMD_AVX512VBMI2 = (1 << 23),
+        SIMD_AVX512BITALG = (1 << 24),
+
+        SIMD_AVX512VP2INTERSECT = (1 << 25),
+
+        SIMD_AVX512GFNI = (1 << 26),
+        SIMD_AVX512VPCLMULQDQ = (1 << 27),
+        SIMD_AVX512VAES = (1 << 28),
+    };
+
+    /**
+     * @brief Get CPU vendor identifier.
+     *
+     * @return char* CPU Vendor ID.
+     */
+    char *Vendor();
+
+    /**
+     * @brief Get CPU name.
+     *
+     * @return char* CPU Name.
+     */
+    char *Name();
+
+    /**
+     * @brief Get CPU hypervisor vendor.
+     *
+     * @return char* Hypervisor vendor.
+     */
+    char *Hypervisor();
+
+    /**
+     * @brief Check SIMD support. It will return the highest supported SIMD type.
+     *
+     * @return x86SIMDType flags.
+     */
+    uint64_t CheckSIMD();
+
+    /**
+     * @brief Check SIMD support.
+     *
+     * @param Type SIMD type.
+     * @return true if supported.
+     * @return false if not supported.
+     */
+    bool CheckSIMD(x86SIMDType Type);
+
+    /**
+     * @brief Pause the CPU
+     */
+    SafeFunction static inline void Pause(bool Loop = false)
+    {
+        do
+        {
+#if defined(a86)
+            asmv("pause");
+#elif defined(aa64)
+            asmv("yield");
+#endif
+        } while (Loop);
+    }
+
+    /**
+     * @brief Stop the CPU (infinite loop)
+     */
+#if defined(a86)
+    SafeFunction __noreturn __naked __used inline void Stop()
+    {
+        asmv("CPUStopLoop:\n"
+             "cli\n"
+             "hlt\n"
+             "jmp CPUStopLoop");
+#elif defined(aa64) // annoying warning: "‘noreturn’ function does return" and "‘naked’ attribute directive ignored"
+    SafeFunction __used inline void Stop()
+    {
+        asmv("CPUStopLoop:\n"
+             "msr daifset, #2\n" // Disable IRQs (bit 1 of the DAIF register)
+             "wfi\n"             // Wait for Interrupt (puts the processor in low-power state until an interrupt occurs)
+             "b CPUStopLoop");   // Branch to the beginning of the loop
+#endif
+    }
+
+    /**
+     * @brief Halt the CPU
+     */
+    SafeFunction static inline void Halt(bool Loop = false)
+    {
+        do
+        {
+#if defined(a86)
+            asmv("hlt");
+#elif defined(aa64)
+            asmv("wfe");
+#endif
+        } while (Loop);
+    }
+
+    /**
+     * @brief Check if interrupts are enabled
+     *
+     * @return true If InterruptsType::Check and interrupts are enabled, or if other InterruptsType were executed successfully
+     * @return false If InterruptsType::Check and interrupts are disabled, or if other InterruptsType failed
+     */
+    bool Interrupts(InterruptsType Type = Check);
+
+    /**
+     * @brief Get/Set the CPU's page table
+     *
+     * @param PT The new page table, if empty, the current page table will be returned
+     * @return void* The current page table
+     */
+    void *PageTable(void *PT = nullptr);
+
+    /** @brief To be used only once. */
+    void InitializeFeatures(long Core);
+
+    /** @brief Get CPU counter value. */
+    uintptr_t Counter();
+
+    namespace x32
+    {
+        typedef union
+        {
+            struct
+            {
+                /** @brief Carry Flag */
+                uint32_t CF : 1;
+                /** @brief Reserved */
+                uint32_t AlwaysOne : 1;
+                /** @brief Parity Flag */
+                uint32_t PF : 1;
+                /** @brief Reserved */
+                uint32_t Reserved0 : 1;
+                /** @brief Auxiliary Carry Flag */
+                uint32_t AF : 1;
+                /** @brief Reserved */
+                uint32_t Reserved1 : 1;
+                /** @brief Zero Flag */
+                uint32_t ZF : 1;
+                /** @brief Sign Flag */
+                uint32_t SF : 1;
+                /** @brief Trap Flag */
+                uint32_t TF : 1;
+                /** @brief Interrupt Enable Flag */
+                uint32_t IF : 1;
+                /** @brief Direction Flag */
+                uint32_t DF : 1;
+                /** @brief Overflow Flag */
+                uint32_t OF : 1;
+                /** @brief I/O Privilege Level */
+                uint32_t IOPL : 2;
+                /** @brief Nested Task */
+                uint32_t NT : 1;
+                /** @brief Reserved */
+                uint32_t Reserved2 : 1;
+                /** @brief Resume Flag */
+                uint32_t RF : 1;
+                /** @brief Virtual 8086 Mode */
+                uint32_t VM : 1;
+                /** @brief Alignment Check */
+                uint32_t AC : 1;
+                /** @brief Virtual Interrupt Flag */
+                uint32_t VIF : 1;
+                /** @brief Virtual Interrupt Pending */
+                uint32_t VIP : 1;
+                /** @brief ID Flag */
+                uint32_t ID : 1;
+            };
+            uint32_t raw;
+        } EFLAGS;
+
+        typedef struct TrapFrame
+        {
+            uint32_t ebp; // Base Pointer (meant for stack frames)
+            uint32_t edi; // Destination index for string operations
+            uint32_t esi; // Source index for string operations
+            uint32_t edx; // Data (commonly extends the A register)
+            uint32_t ecx; // Counter
+            uint32_t ebx; // Base
+            uint32_t eax; // Accumulator
+
+            uint32_t InterruptNumber; // Interrupt Number
+            uint32_t ErrorCode;       // Error code
+            uint32_t eip;             // Instruction Pointer
+            uint32_t cs;              // Code Segment
+            EFLAGS eflags;            // Register Flags
+            uint32_t esp;             // Stack Pointer
+            uint32_t ss;              // Stack Segment
+        } TrapFrame;
+
+        /* TODO: Does EFER exists in x32? */
+        typedef union EFER
+        {
+            struct
+            {
+                /** @brief Enable syscall & sysret instructions in 64-bit mode. */
+                uint32_t SCE : 1;
+                /** @brief Reserved */
+                uint32_t Reserved0 : 7;
+                /** @brief Enable long mode. */
+                uint32_t LME : 1;
+                /** @brief Reserved */
+                uint32_t Reserved1 : 1;
+                /** @brief Indicates long. */
+                uint32_t LMA : 1;
+                /** @brief Enable No-Execute Bit */
+                uint32_t NXE : 1;
+                /** @brief Enable Secure Virtual Machine */
+                uint32_t SVME : 1;
+                /** @brief Enable Long Mode Segment Limit */
+                uint32_t LMSLE : 1;
+                /** @brief Enable Fast FXSAVE/FXRSTOR */
+                uint32_t FFXSR : 1;
+                /** @brief Enable Translation Cache Extension */
+                uint32_t TCE : 1;
+                /** @brief Reserved */
+                uint32_t Reserved2 : 32;
+            };
+            uint32_t raw;
+        } __packed EFER;
+
+        // ! TODO: UNTESTED!
+        typedef union DR7
+        {
+            struct
+            {
+                /** @brief Local DR0 Breakpoint (0) */
+                uint32_t LocalDR0 : 1;
+                /** @brief Global DR0 Breakpoint (1) */
+                uint32_t GlobalDR0 : 1;
+                /** @brief Local DR1 Breakpoint (2) */
+                uint32_t LocalDR1 : 1;
+                /** @brief Global DR1 Breakpoint (3) */
+                uint32_t GlobalDR1 : 1;
+                /** @brief Local DR2 Breakpoint (4) */
+                uint32_t LocalDR2 : 1;
+                /** @brief Global DR2 Breakpoint (5) */
+                uint32_t GlobalDR2 : 1;
+                /** @brief Local DR3 Breakpoint (6) */
+                uint32_t LocalDR3 : 1;
+                /** @brief Global DR3 Breakpoint (7) */
+                uint32_t GlobalDR3 : 1;
+                /** @brief Reserved [7 - (16-17)] */
+                uint32_t Reserved : 9;
+                /** @brief Conditions for DR0 (16-17) */
+                uint32_t ConditionsDR0 : 1;
+                /** @brief Size of DR0 Breakpoint (18-19) */
+                uint32_t SizeDR0 : 1;
+                /** @brief Conditions for DR1 (20-21) */
+                uint32_t ConditionsDR1 : 1;
+                /** @brief Size of DR1 Breakpoint (22-23) */
+                uint32_t SizeDR1 : 1;
+                /** @brief Conditions for DR2 (24-25) */
+                uint32_t ConditionsDR2 : 1;
+                /** @brief Size of DR2 Breakpoint (26-27) */
+                uint32_t SizeDR2 : 1;
+                /** @brief Conditions for DR3 (28-29) */
+                uint32_t ConditionsDR3 : 1;
+                /** @brief Size of DR3 Breakpoint (30-31) */
+                uint32_t SizeDR3 : 1;
+            };
+            uint32_t raw;
+        } DR7;
+
+        struct FXState
+        {
+            /** @brief FPU control word */
+            uint16_t fcw;
+            /** @brief FPU status word */
+            uint16_t fsw;
+            /** @brief FPU tag words */
+            uint8_t ftw;
+            /** @brief Reserved (zero) */
+            uint8_t Reserved;
+            /** @brief FPU opcode */
+            uint16_t fop;
+            /** @brief PFU instruction pointer */
+            uint64_t rip;
+            /** @brief FPU data pointer */
+            uint64_t rdp;
+            /** @brief SSE control register */
+            uint32_t mxcsr;
+            /** @brief SSE control register mask */
+            uint32_t mxcsrmask;
+            /** @brief FPU registers (last 6 bytes reserved) */
+            uint8_t st[8][16];
+            /** @brief XMM registers */
+            uint8_t xmm[16][16];
+        } __packed;
+
+        /**
+         * @brief CPUID
+         *
+         * @param Function Leaf
+         * @param eax EAX
+         * @param ebx EBX
+         * @param ecx ECX
+         * @param edx EDX
+         */
+        static inline void cpuid(uint32_t Function, uint32_t *eax, uint32_t *ebx, uint32_t *ecx, uint32_t *edx)
+        {
+#if defined(a32)
+            asmv("cpuid"
+                 : "=a"(*eax), "=b"(*ebx), "=c"(*ecx), "=d"(*edx)
+                 : "a"(Function));
+#else
+            UNUSED(Function);
+            UNUSED(eax);
+            UNUSED(ebx);
+            UNUSED(ecx);
+            UNUSED(edx);
+#endif
+        }
+
+        SafeFunction static inline void invlpg(void *Address)
+        {
+#if defined(a32)
+            asmv("invlpg (%0)"
+                 :
+                 : "r"(Address)
+                 : "memory");
+#else
+            UNUSED(Address);
+#endif
+        }
+    }
+
+    namespace x64
+    {
+        /**
+         * @brief MSR_APIC_BASE structure
+         * @see MSR_APIC_BASE
+         */
+        typedef union
+        {
+            struct
+            {
+                /** @brief Reserved */
+                uint32_t Reserved0 : 8;
+                /**
+                 * @brief BSP Flag
+                 * @details If the BSP flag is set to 1, the processor is the bootstrap processor.
+                 */
+                uint32_t BSP : 1;
+                /** @brief Reserved */
+                uint32_t Reserved1 : 1;
+                /** @brief Enable x2APIC mode */
+                uint32_t EXTD : 1;
+                /** @brief APIC Global Enable */
+                uint32_t EN : 1;
+                /** @brief APIC Base Low Address */
+                uint32_t ApicBaseLo : 20;
+                /** @brief APIC Base High Address */
+                uint32_t ApicBaseHi : 32;
+            };
+            uint64_t raw;
+        } __packed APIC_BASE;
+
+        typedef union
+        {
+            struct
+            {
+                /** @brief Carry Flag */
+                uint64_t CF : 1;
+                /** @brief Reserved */
+                uint64_t AlwaysOne : 1;
+                /** @brief Parity Flag */
+                uint64_t PF : 1;
+                /** @brief Reserved */
+                uint64_t Reserved0 : 1;
+                /** @brief Auxiliary Carry Flag */
+                uint64_t AF : 1;
+                /** @brief Reserved */
+                uint64_t Reserved1 : 1;
+                /** @brief Zero Flag */
+                uint64_t ZF : 1;
+                /** @brief Sign Flag */
+                uint64_t SF : 1;
+                /** @brief Trap Flag */
+                uint64_t TF : 1;
+                /** @brief Interrupt Enable Flag */
+                uint64_t IF : 1;
+                /** @brief Direction Flag */
+                uint64_t DF : 1;
+                /** @brief Overflow Flag */
+                uint64_t OF : 1;
+                /** @brief I/O Privilege Level */
+                uint64_t IOPL : 2;
+                /** @brief Nested Task */
+                uint64_t NT : 1;
+                /** @brief Reserved */
+                uint64_t Reserved2 : 1;
+                /** @brief Resume Flag */
+                uint64_t RF : 1;
+                /** @brief Virtual 8086 Mode */
+                uint64_t VM : 1;
+                /** @brief Alignment Check */
+                uint64_t AC : 1;
+                /** @brief Virtual Interrupt Flag */
+                uint64_t VIF : 1;
+                /** @brief Virtual Interrupt Pending */
+                uint64_t VIP : 1;
+                /** @brief ID Flag (Allow using CPUID instruction) */
+                uint64_t ID : 1;
+                /** @brief Reserved */
+                uint64_t Reserved3 : 10;
+            };
+            uint64_t raw;
+        } RFLAGS;
+
+        typedef struct TrapFrame
+        {
+            uint64_t r15; // General purpose
+            uint64_t r14; // General purpose
+            uint64_t r13; // General purpose
+            uint64_t r12; // General purpose
+            uint64_t r11; // General purpose
+            uint64_t r10; // General purpose
+            uint64_t r9;  // General purpose
+            uint64_t r8;  // General purpose
+
+            uint64_t rbp; // Base Pointer (meant for stack frames)
+            uint64_t rdi; // Destination index for string operations
+            uint64_t rsi; // Source index for string operations
+            uint64_t rdx; // Data (commonly extends the A register)
+            uint64_t rcx; // Counter
+            uint64_t rbx; // Base
+            uint64_t rax; // Accumulator
+
+            uint64_t InterruptNumber; // Interrupt Number
+            uint64_t ErrorCode;       // Error code
+            uint64_t rip;             // Instruction Pointer
+            uint64_t cs;              // Code Segment
+            RFLAGS rflags;            // Register Flags
+            uint64_t rsp;             // Stack Pointer
+            uint64_t ss;              // Stack Segment
+        } TrapFrame;
+
+        typedef union EFER
+        {
+            struct
+            {
+                /** @brief Enable syscall & sysret instructions in 64-bit mode. */
+                uint64_t SCE : 1;
+                /** @brief Reserved */
+                uint64_t Reserved0 : 7;
+                /** @brief Enable long mode. */
+                uint64_t LME : 1;
+                /** @brief Reserved */
+                uint64_t Reserved1 : 1;
+                /** @brief Indicates long. */
+                uint64_t LMA : 1;
+                /** @brief Enable No-Execute Bit */
+                uint64_t NXE : 1;
+                /** @brief Enable Secure Virtual Machine */
+                uint64_t SVME : 1;
+                /** @brief Enable Long Mode Segment Limit */
+                uint64_t LMSLE : 1;
+                /** @brief Enable Fast FXSAVE/FXRSTOR */
+                uint64_t FFXSR : 1;
+                /** @brief Enable Translation Cache Extension */
+                uint64_t TCE : 1;
+                /** @brief Reserved */
+                uint64_t Reserved2 : 32;
+            };
+            uint64_t raw;
+        } __packed EFER;
+
+        // ! TODO: UNTESTED!
+        typedef union DR7
+        {
+            struct
+            {
+                /** @brief Local DR0 Breakpoint (0) */
+                uint64_t LocalDR0 : 1;
+                /** @brief Global DR0 Breakpoint (1) */
+                uint64_t GlobalDR0 : 1;
+                /** @brief Local DR1 Breakpoint (2) */
+                uint64_t LocalDR1 : 1;
+                /** @brief Global DR1 Breakpoint (3) */
+                uint64_t GlobalDR1 : 1;
+                /** @brief Local DR2 Breakpoint (4) */
+                uint64_t LocalDR2 : 1;
+                /** @brief Global DR2 Breakpoint (5) */
+                uint64_t GlobalDR2 : 1;
+                /** @brief Local DR3 Breakpoint (6) */
+                uint64_t LocalDR3 : 1;
+                /** @brief Global DR3 Breakpoint (7) */
+                uint64_t GlobalDR3 : 1;
+                /** @brief Reserved [7 - (16-17)] */
+                uint64_t Reserved : 9;
+                /** @brief Conditions for DR0 (16-17) */
+                uint64_t ConditionsDR0 : 1;
+                /** @brief Size of DR0 Breakpoint (18-19) */
+                uint64_t SizeDR0 : 1;
+                /** @brief Conditions for DR1 (20-21) */
+                uint64_t ConditionsDR1 : 1;
+                /** @brief Size of DR1 Breakpoint (22-23) */
+                uint64_t SizeDR1 : 1;
+                /** @brief Conditions for DR2 (24-25) */
+                uint64_t ConditionsDR2 : 1;
+                /** @brief Size of DR2 Breakpoint (26-27) */
+                uint64_t SizeDR2 : 1;
+                /** @brief Conditions for DR3 (28-29) */
+                uint64_t ConditionsDR3 : 1;
+                /** @brief Size of DR3 Breakpoint (30-31) */
+                uint64_t SizeDR3 : 1;
+            };
+            uint64_t raw;
+        } DR7;
+
+        typedef union PageFaultErrorCode
+        {
+            struct
+            {
+                /** @brief When set, the page fault was caused by a page-protection violation. When not set, it was caused by a non-present page. */
+                uint64_t P : 1;
+                /** @brief When set, the page fault was caused by a write access. When not set, it was caused by a read access. */
+                uint64_t W : 1;
+                /** @brief When set, the page fault was caused while CPL = 3. This does not necessarily mean that the page fault was a privilege violation. */
+                uint64_t U : 1;
+                /** @brief When set, one or more page directory entries contain reserved bits which are set to 1. This only applies when the PSE or PAE flags in CR4 are set to 1. */
+                uint64_t R : 1;
+                /** @brief When set, the page fault was caused by an instruction fetch. This only applies when the No-Execute bit is supported and enabled. */
+                uint64_t I : 1;
+                /** @brief When set, the page fault was caused by a protection-key violation. The PKRU register (for user-mode accesses) or PKRS MSR (for supervisor-mode accesses) specifies the protection key rights. */
+                uint64_t PK : 1;
+                /** @brief When set, the page fault was caused by a shadow stack access. */
+                uint64_t SS : 1;
+                /** @brief Reserved */
+                uint64_t Reserved0 : 8;
+                /** @brief When set, the fault was due to an SGX violation. The fault is unrelated to ordinary paging. */
+                uint64_t SGX : 1;
+                /** @brief Reserved */
+                uint64_t Reserved1 : 16;
+            };
+            uint64_t raw;
+        } PageFaultErrorCode;
+
+        // ! TODO: UNTESTED!
+        typedef union SelectorErrorCode
+        {
+            struct
+            {
+                /** @brief When set, the exception originated externally to the processor. */
+                uint64_t External : 1;
+                /** @brief IDT/GDT/LDT Table
+                 *  @details 0b00 - The Selector Index references a descriptor in the GDT.
+                 *  @details 0b01 - The Selector Index references a descriptor in the IDT.
+                 *  @details 0b10 - The Selector Index references a descriptor in the LDT.
+                 *  @details 0b11 - The Selector Index references a descriptor in the IDT.
+                 */
+                uint64_t Table : 2;
+                /** @brief The index in the GDT, IDT or LDT. */
+                uint64_t Idx : 13;
+                /** @brief Reserved */
+                uint64_t Reserved : 16;
+            };
+            uint64_t raw;
+        } SelectorErrorCode;
+
+        struct FXState
+        {
+            /** @brief FPU control word */
+            uint16_t fcw;
+            /** @brief FPU status word */
+            uint16_t fsw;
+            /** @brief FPU tag words */
+            uint8_t ftw;
+            /** @brief Reserved (zero) */
+            uint8_t Reserved;
+            /** @brief FPU opcode */
+            uint16_t fop;
+            /** @brief PFU instruction pointer */
+            uint64_t rip;
+            /** @brief FPU data pointer */
+            uint64_t rdp;
+            /** @brief SSE control register */
+            uint32_t mxcsr;
+            /** @brief SSE control register mask */
+            uint32_t mxcsrmask;
+            /** @brief FPU registers (last 6 bytes reserved) */
+            uint8_t st[8][16];
+            /** @brief XMM registers */
+            uint8_t xmm[16][16];
+        } __packed;
+
+        SafeFunction static inline void lgdt(void *gdt)
+        {
+#if defined(a64)
+            asmv("lgdt (%0)"
+                 :
+                 : "r"(gdt));
+#endif
+        }
+
+        SafeFunction static inline void lidt(void *idt)
+        {
+#if defined(a64)
+            asmv("lidt (%0)"
+                 :
+                 : "r"(idt));
+#endif
+        }
+
+        SafeFunction static inline void ltr(uint16_t Segment)
+        {
+#if defined(a64)
+            asmv("ltr %0"
+                 :
+                 : "r"(Segment));
+#endif
+        }
+
+        SafeFunction static inline void invlpg(void *Address)
+        {
+#if defined(a64)
+            asmv("invlpg (%0)"
+                 :
+                 : "r"(Address)
+                 : "memory");
+#endif
+        }
+
+        /**
+         * @brief CPUID
+         *
+         * @param Function Leaf
+         * @param eax EAX
+         * @param ebx EBX
+         * @param ecx ECX
+         * @param edx EDX
+         */
+        SafeFunction static inline void cpuid(uint32_t Function, uint32_t *eax, uint32_t *ebx, uint32_t *ecx, uint32_t *edx)
+        {
+#if defined(a64)
+            asmv("cpuid"
+                 : "=a"(*eax), "=b"(*ebx), "=c"(*ecx), "=d"(*edx)
+                 : "a"(Function));
+#endif
+        }
+
+        /**
+         * @brief Get the highest leaf function supported by CPUID
+         *
+         * @example if (GetHighestLeaf() < 0x15) { error("CPU doesn't support leaf 0x15!"); }
+         *
+         * @return uint32_t
+         */
+        SafeFunction static inline uint32_t GetHighestLeaf()
+        {
+            uint32_t eax, ebx, ecx, edx;
+            cpuid(0x0, &eax, &ebx, &ecx, &edx);
+            return eax;
+        }
+
+        SafeFunction static inline void fxsave(void *FXSaveArea)
+        {
+#if defined(a64)
+            if (!FXSaveArea || FXSaveArea >= (char *)0xfffffffffffff000)
+                return;
+
+            asmv("fxsaveq (%0)"
+                 :
+                 : "r"(FXSaveArea)
+                 : "memory");
+#endif
+        }
+
+        SafeFunction static inline void fxrstor(void *FXRstorArea)
+        {
+#if defined(a64)
+            if (!FXRstorArea || FXRstorArea >= (char *)0xfffffffffffff000)
+                return;
+
+            asmv("fxrstorq (%0)"
+                 :
+                 : "r"(FXRstorArea)
+                 : "memory");
+#endif
+        }
+    }
+
+    namespace aarch64
+    {
+        typedef struct TrapFrame
+        {
+            uint64_t x19; // General purpose
+            uint64_t x20; // General purpose
+            uint64_t x21; // General purpose
+            uint64_t x22; // General purpose
+            uint64_t x23; // General purpose
+            uint64_t x24; // General purpose
+            uint64_t x25; // General purpose
+            uint64_t x26; // General purpose
+
+            uint64_t x27; // Stack frame pointer
+            uint64_t x28; // Link register
+            uint64_t x29; // Frame pointer
+            uint64_t x30; // Program counter
+
+            uint64_t sp_el0;                  // Stack pointer
+            uint64_t elr_el1;                 // Exception Link Register
+            uint64_t spsr_el1;                // Saved Program Status Register
+            uint64_t ErrorCode /* esr_el1 */; // Exception Syndrome Register
+
+            uint64_t InterruptNumber /* iar_el1 */; // Interrupt Acknowledge Register
+        } TrapFrame;
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_H__
diff --git a/Kernel/include/cpu/arm/.gitkeep b/Kernel/include/cpu/arm/.gitkeep
new file mode 100644
index 00000000..e69de29b
diff --git a/Kernel/include/cpu/membar.hpp b/Kernel/include/cpu/membar.hpp
new file mode 100644
index 00000000..cf958607
--- /dev/null
+++ b/Kernel/include/cpu/membar.hpp
@@ -0,0 +1,73 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_MEMBAR_H__
+#define __FENNIX_KERNEL_CPU_MEMBAR_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace MemBar
+    {
+        SafeFunction static inline void Barrier()
+        {
+#if defined(a86)
+            asmv("" ::
+                     : "memory");
+#elif defined(aa64)
+            asmv("dmb ish" ::
+                     : "memory");
+#endif
+        }
+
+        SafeFunction static inline void Fence()
+        {
+#if defined(a86)
+            asmv("mfence" ::
+                     : "memory");
+#elif defined(aa64)
+            asmv("dmb ish" ::
+                     : "memory");
+#endif
+        }
+
+        SafeFunction static inline void StoreFence()
+        {
+#if defined(a86)
+            asmv("sfence" ::
+                     : "memory");
+#elif defined(aa64)
+            asmv("dmb ishst" ::
+                     : "memory");
+#endif
+        }
+
+        SafeFunction static inline void LoadFence()
+        {
+#if defined(a86)
+            asmv("lfence" ::
+                     : "memory");
+#elif defined(aa64)
+            asmv("dmb ishld" ::
+                     : "memory");
+#endif
+        }
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_MEMBAR_H__
diff --git a/Kernel/include/cpu/signatures.hpp b/Kernel/include/cpu/signatures.hpp
new file mode 100644
index 00000000..0c737e72
--- /dev/null
+++ b/Kernel/include/cpu/signatures.hpp
@@ -0,0 +1,108 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_SIGNATURES_H__
+#define __FENNIX_KERNEL_CPU_SIGNATURES_H__
+
+#include <types.h>
+
+#define x86_CPUID_VENDOR_OLDAMD "AMDisbetter!" /* Early engineering samples of AMD K5 processor */
+#define x86_CPUID_VENDOR_AMD "AuthenticAMD"
+#define x86_CPUID_VENDOR_INTEL "GenuineIntel"
+#define x86_CPUID_VENDOR_VIA "CentaurHauls"
+#define x86_CPUID_VENDOR_OLDTRANSMETA "TransmetaCPU"
+#define x86_CPUID_VENDOR_TRANSMETA "GenuineTMx86"
+#define x86_CPUID_VENDOR_CYRIX "CyrixInstead"
+#define x86_CPUID_VENDOR_CENTAUR "CentaurHauls"
+#define x86_CPUID_VENDOR_NEXGEN "NexGenDriven"
+#define x86_CPUID_VENDOR_UMC "UMC UMC UMC "
+#define x86_CPUID_VENDOR_SIS "SiS SiS SiS "
+#define x86_CPUID_VENDOR_NSC "Geode by NSC"
+#define x86_CPUID_VENDOR_RISE "RiseRiseRise"
+#define x86_CPUID_VENDOR_VORTEX "Vortex86 SoC"
+#define x86_CPUID_VENDOR_VIA2 "VIA VIA VIA "
+#define x86_CPUID_VENDOR_HYGON "HygonGenuine"
+#define x86_CPUID_VENDOR_E2K "E2K MACHINE"
+#define x86_CPUID_VENDOR_MISTER "MiSTer AO486"
+
+/* Vendor-strings from Virtual Machines. */
+#define x86_CPUID_VENDOR_VMWARE "VMwareVMware"
+#define x86_CPUID_VENDOR_XENHVM "XenVMMXenVMM"
+#define x86_CPUID_VENDOR_MICROSOFT_HV "Microsoft Hv"
+#define x86_CPUID_VENDOR_MICROSOFT_XTA "MicrosoftXTA"
+#define x86_CPUID_VENDOR_PARALLELS " lrpepyh vr"
+#define x86_CPUID_VENDOR_KVM "KVMKVMKVM"
+#define x86_CPUID_VENDOR_VIRTUALBOX "VBoxVBoxVBox"
+#define x86_CPUID_VENDOR_TCG "TCGTCGTCGTCG"
+#define x86_CPUID_VENDOR_BHYVE "bhyve bhyve "
+#define x86_CPUID_VENDOR_ACRN "ACRNACRNACRN"
+#define x86_CPUID_VENDOR_QNX "QNXQVMBSQG"
+#define x86_CPUID_VENDOR_APPLE "VirtualApple"
+
+#define x86_CPUID_SIGNATURE_INTEL_b 0x756e6547
+#define x86_CPUID_SIGNATURE_INTEL_c 0x6c65746e
+#define x86_CPUID_SIGNATURE_INTEL_d 0x49656e69
+
+#define x86_CPUID_SIGNATURE_AMD_b 0x68747541
+#define x86_CPUID_SIGNATURE_AMD_c 0x444d4163
+#define x86_CPUID_SIGNATURE_AMD_d 0x69746e65
+
+#define x86_CPUID_SIGNATURE_CENTAUR_b 0x746e6543
+#define x86_CPUID_SIGNATURE_CENTAUR_c 0x736c7561
+#define x86_CPUID_SIGNATURE_CENTAUR_d 0x48727561
+
+#define x86_CPUID_SIGNATURE_CYRIX_b 0x69727943
+#define x86_CPUID_SIGNATURE_CYRIX_c 0x64616574
+#define x86_CPUID_SIGNATURE_CYRIX_d 0x736e4978
+
+#define x86_CPUID_SIGNATURE_TM1_b 0x6e617254
+#define x86_CPUID_SIGNATURE_TM1_c 0x55504361
+#define x86_CPUID_SIGNATURE_TM1_d 0x74656d73
+
+#define x86_CPUID_SIGNATURE_TM2_b 0x756e6547
+#define x86_CPUID_SIGNATURE_TM2_c 0x3638784d
+#define x86_CPUID_SIGNATURE_TM2_d 0x54656e69
+
+#define x86_CPUID_SIGNATURE_NSC_b 0x646f6547
+#define x86_CPUID_SIGNATURE_NSC_c 0x43534e20
+#define x86_CPUID_SIGNATURE_NSC_d 0x79622065
+
+#define x86_CPUID_SIGNATURE_NEXGEN_b 0x4778654e
+#define x86_CPUID_SIGNATURE_NEXGEN_c 0x6e657669
+#define x86_CPUID_SIGNATURE_NEXGEN_d 0x72446e65
+
+#define x86_CPUID_SIGNATURE_RISE_b 0x65736952
+#define x86_CPUID_SIGNATURE_RISE_c 0x65736952
+#define x86_CPUID_SIGNATURE_RISE_d 0x65736952
+
+#define x86_CPUID_SIGNATURE_SIS_b 0x20536953
+#define x86_CPUID_SIGNATURE_SIS_c 0x20536953
+#define x86_CPUID_SIGNATURE_SIS_d 0x20536953
+
+#define x86_CPUID_SIGNATURE_UMC_b 0x20434d55
+#define x86_CPUID_SIGNATURE_UMC_c 0x20434d55
+#define x86_CPUID_SIGNATURE_UMC_d 0x20434d55
+
+#define x86_CPUID_SIGNATURE_VIA_b 0x20414956
+#define x86_CPUID_SIGNATURE_VIA_c 0x20414956
+#define x86_CPUID_SIGNATURE_VIA_d 0x20414956
+
+#define x86_CPUID_SIGNATURE_VORTEX_b 0x74726f56
+#define x86_CPUID_SIGNATURE_VORTEX_c 0x436f5320
+#define x86_CPUID_SIGNATURE_VORTEX_d 0x36387865
+
+#endif // !__FENNIX_KERNEL_CPU_SIGNATURES_H__
diff --git a/Kernel/include/cpu/x86/cpuid_amd.hpp b/Kernel/include/cpu/x86/cpuid_amd.hpp
new file mode 100644
index 00000000..164573ad
--- /dev/null
+++ b/Kernel/include/cpu/x86/cpuid_amd.hpp
@@ -0,0 +1,2159 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x86_CPUID_AMD_H__
+#define __FENNIX_KERNEL_CPU_x86_CPUID_AMD_H__
+
+#include <types.h>
+
+#if defined(a64)
+typedef uint64_t cpuid_t;
+#elif defined(a32)
+typedef uint32_t cpuid_t;
+#else
+typedef uint64_t cpuid_t;
+#endif // a64 || a32
+
+namespace CPU
+{
+    namespace x86
+    {
+        /** @brief EXPERIMENTAL IMPLEMENTATION */
+        namespace AMD
+        {
+            /** @brief Basic CPU information */
+            struct CPUID0x00000000
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x0));
+#endif // a64 || a32
+                }
+
+                /** @brief Largest Standard Function Number */
+                union
+                {
+                    struct
+                    {
+                        uint32_t LFuncStd : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Vendor */
+                union
+                {
+                    struct
+                    {
+                        char Vendor[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Vendor */
+                union
+                {
+                    struct
+                    {
+                        char Vendor[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Vendor */
+                union
+                {
+                    struct
+                    {
+                        char Vendor[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Additional CPU information */
+            struct CPUID0x00000001
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x1));
+#endif // a64 || a32
+                }
+
+                /** @brief Family, Model, Stepping Identifiers */
+                union
+                {
+                    /* "This function is an identical copy of CPUID Fn8000_0001_EAX." */
+                    struct
+                    {
+                        uint32_t Stepping : 4;
+                        uint32_t BaseModel : 4;
+                        uint32_t BaseFamily : 4;
+                        uint32_t Reserved0 : 4;
+                        uint32_t ExtModel : 4;
+                        uint32_t ExtFamily : 8;
+                        uint32_t Reserved1 : 4;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief LocalApicId, LogicalProcessorCount, CLFlush */
+                union
+                {
+                    struct
+                    {
+                        uint32_t BrandId : 8;
+                        uint32_t CLFlush : 8;
+                        uint32_t LogicalProcessorCount : 8;
+                        uint32_t LocalApicId : 8;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t SSE3 : 1;
+                        uint32_t PCLMULQDQ : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t MONITOR : 1;
+                        uint32_t Reserved1 : 5;
+                        uint32_t SSSE3 : 1;
+                        uint32_t Reserved2 : 2;
+                        uint32_t FMA : 1;
+                        uint32_t CMPXCHG16B : 1;
+                        uint32_t Reserved3 : 5;
+                        uint32_t SSE41 : 1;
+                        uint32_t SSE42 : 1;
+                        uint32_t x2APIC : 1;
+                        uint32_t MOVBE : 1;
+                        uint32_t POPCNT : 1;
+                        uint32_t Reserved4 : 1;
+                        uint32_t AES : 1;
+                        uint32_t XSAVE : 1;
+                        uint32_t OSXSAVE : 1;
+                        uint32_t AVX : 1;
+                        uint32_t F16C : 1;
+                        uint32_t RDRAND : 1;
+
+                        /**
+                         * @brief Reserved for use by hypervisor to indicate guest status.
+                         */
+                        uint32_t Hypervisor : 1;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t FPU : 1;
+                        uint32_t VME : 1;
+                        uint32_t DE : 1;
+                        uint32_t PSE : 1;
+                        uint32_t TSC : 1;
+                        uint32_t MSR : 1;
+                        uint32_t PAE : 1;
+                        uint32_t MCE : 1;
+                        uint32_t CMPXCHG8B : 1;
+                        uint32_t APIC : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t SysEnterSysExit : 1;
+                        uint32_t MTRR : 1;
+                        uint32_t PGE : 1;
+                        uint32_t MCA : 1;
+                        uint32_t CMOV : 1;
+                        uint32_t PAT : 1;
+                        uint32_t PSE36 : 1;
+                        uint32_t Reserved1 : 1;
+                        uint32_t CLFSH : 1;
+                        uint32_t Reserved2 : 3;
+                        uint32_t MMX : 1;
+                        uint32_t FXSR : 1;
+                        uint32_t SSE : 1;
+                        uint32_t SSE2 : 1;
+                        uint32_t Reserved3 : 1;
+                        uint32_t HTT : 1;
+                        uint32_t Reserved4 : 3;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Monitor and MWait Features */
+            struct CPUID0x00000005
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x5));
+#endif // a64 || a32
+                }
+
+                /** @brief Monitor/MWait */
+                union
+                {
+                    struct
+                    {
+                        uint32_t MonLineSizeMin : 16;
+                        uint32_t Reserved0 : 16;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Monitor/MWait */
+                union
+                {
+                    struct
+                    {
+                        uint32_t MonLineSizeMax : 16;
+                        uint32_t Reserved0 : 16;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Monitor/MWait */
+                union
+                {
+                    struct
+                    {
+                        uint32_t EMX : 1;
+                        uint32_t IBE : 1;
+                        uint32_t Reserved0 : 30;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Reserved */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Power Management Related Features */
+            struct CPUID0x00000006
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x6));
+#endif // a64 || a32
+                }
+
+                /** @brief Local APIC Timer Invariance */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved0 : 2;
+                        uint32_t ARAT : 1;
+                        uint32_t Reserved1 : 29;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Reserved */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Effective Processor Frequency Interface */
+                union
+                {
+                    struct
+                    {
+                        uint32_t EffFreq : 1;
+                        uint32_t Reserved0 : 31;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Reserved */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Structured Extended Feature Identifiers */
+            struct CPUID0x00000007
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x7));
+#endif // a64 || a32
+                }
+
+                /** @brief Structured Extended Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t MaxSubFn : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Structured Extended Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t FSGSBASE : 1;
+                        uint32_t Reserved0 : 2;
+                        uint32_t BMI1 : 1;
+                        uint32_t Reserved1 : 1;
+                        uint32_t AVX2 : 1;
+                        uint32_t Reserved2 : 1;
+                        uint32_t SMEP : 1;
+                        uint32_t BMI2 : 1;
+                        uint32_t Reserved3 : 1;
+                        uint32_t INVPCID : 1;
+                        uint32_t Reserved4 : 1;
+                        uint32_t PQM : 1;
+                        uint32_t Reserved5 : 2;
+                        uint32_t PQE : 1;
+                        uint32_t Reserved6 : 2;
+                        uint32_t RDSEED : 1;
+                        uint32_t ADX : 1;
+                        uint32_t SMAP : 1;
+                        uint32_t Reserved7 : 1;
+                        uint32_t RDPID : 1;
+                        uint32_t CLFLUSHOPT : 1;
+                        uint32_t CLWB : 1;
+                        uint32_t Reserved8 : 4;
+                        uint32_t SHA : 1;
+                        uint32_t Reserved9 : 2;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Structured Extended Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved0 : 2;
+                        uint32_t UMIP : 1;
+                        uint32_t PKU : 1;
+                        uint32_t OSPKE : 1;
+                        uint32_t Reserved1 : 2;
+                        uint32_t CET_SS : 1;
+                        uint32_t Reserved2 : 1;
+                        uint32_t VAES : 1;
+                        uint32_t VPCLMULQDQ : 1;
+                        uint32_t Reserved3 : 5;
+                        uint32_t LA57 : 1;
+                        uint32_t Reserved4 : 15;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Structured Extended Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Thread Level - Extended Topology Enumeration */
+            struct CPUID0x0000000B_ECX_0
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xB), "c"(0x0));
+#endif // a64 || a32
+                }
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t ThreadMaskWidth : 5;
+                        uint32_t Reserved0 : 27;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t NumberOfThreadsInACore : 5; /* No field name */
+                        uint32_t Reserved0 : 27;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t ECXInputValue : 8;
+                        uint32_t LevelNumber : 8;
+                        uint32_t Reserved0 : 16;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t x2APID_ID : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Core Level - Extended Topology Enumeration */
+            struct CPUID0x0000000B_ECX_1
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xB), "c"(0x1));
+#endif // a64 || a32
+                }
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CoreMaskWidth : 5;
+                        uint32_t Reserved0 : 27;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t NumberOfLogicalCoresInSocket : 5; /* No field name */
+                        uint32_t Reserved0 : 27;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t ECXInputValue : 8;
+                        uint32_t LevelNumber : 8;
+                        uint32_t Reserved0 : 16;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Extended Topology Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t x2APID_ID : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Extended State Enumeration */
+            struct CPUID0x0000000D_ECX_0
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xD), "c"(0x0));
+#endif // a64 || a32
+                }
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t XFeatureSupportedMask : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t XFeatureEnabledSizeMax : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t XFeatureSupportedSizeMax : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t XFeatureSupportedMask : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Extended State Enumeration */
+            struct CPUID0x0000000D_ECX_1
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xD), "c"(0x1));
+#endif // a64 || a32
+                }
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t XSAVEOPT : 1;
+                        uint32_t XSAVEC : 1;
+                        uint32_t XGETBV : 1;
+                        uint32_t XSAVES : 1;
+                        uint32_t Reserved0 : 28;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        /**
+                         * @brief The value returned on EBX represents the
+                         * fixed size of the save area (240h) plus the
+                         * state size of each enabled extended feature:
+                         * EBX = 0240h
+                         * + ((XCR0[AVX] == 1) ? 0000_0100h : 0)
+                         * + ((XCR0[MPK] == 1) ? 0000_0008h : 0)
+                         * + ((XSS[CET_U] == 1) ? 0000_0010h : 0)
+                         * + ((XSS[CET_S] == 1) ? 0000_0018h : 0)
+                         */
+                        uint32_t ebx : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved0 : 11;
+                        uint32_t CET_U : 1;
+                        uint32_t CET_S : 1;
+                        uint32_t Reserved1 : 19;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Extended State Enumeration */
+            struct CPUID0x0000000D_ECX_2
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xD), "c"(0x2));
+#endif // a64 || a32
+                }
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t YmmSaveStateSize : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t YmmSaveStateOffset : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Extended State Emulation */
+            struct CPUID0x0000000D_ECX_11
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xD), "c"(0x11));
+#endif // a64 || a32
+                }
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CetSupervisorSize : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CetSupervisorOffset : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 31;
+                        uint32_t US : 1;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Unused : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Extended State Emulation */
+            struct CPUID0x0000000D_ECX_12
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xD), "c"(0x12));
+#endif // a64 || a32
+                }
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CetSupervisorSize : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CetSupervisorOffset : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 31;
+                        uint32_t US : 1;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Extended State Emulation */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Unused : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Extended State Enumeration */
+            struct CPUID0x0000000D_ECX_3E
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xD), "c"(0x3E));
+#endif // a64 || a32
+                }
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t LwpSaveStateSize : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t LwpSaveStateOffset : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Extended State Enumeration */
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Maximum Extended Function Number and Vendor String */
+            struct CPUID0x80000000
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000000));
+#endif // a64 || a32
+                }
+
+                /** @brief Largest Extended Function Number */
+                union
+                {
+                    struct
+                    {
+                        uint32_t LFuncExt : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Processor Vendor */
+                union
+                {
+                    struct
+                    {
+                        char Vendor[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Vendor */
+                union
+                {
+                    struct
+                    {
+                        char Vendor[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Processor Vendor */
+                union
+                {
+                    struct
+                    {
+                        char Vendor[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended Processor and Processor Feature Identifiers */
+            struct CPUID0x80000001
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000001));
+#endif // a64 || a32
+                }
+
+                /** @brief AMD Family, Model, Stepping */
+                union
+                {
+                    /* "This function is an identical copy of CPUID Fn0000_0001_EAX." */
+                    struct
+                    {
+                        uint32_t Stepping : 4;
+                        uint32_t BaseModel : 4;
+                        uint32_t BaseFamily : 4;
+                        uint32_t Reserved0 : 4;
+                        uint32_t ExtendedModel : 4;
+                        uint32_t ExtendedFamily : 8;
+                        uint32_t Reserved1 : 4;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief BrandId Identifier */
+                union
+                {
+                    struct
+                    {
+                        uint32_t BrandId : 16;
+                        uint32_t Reserved0 : 12;
+                        uint32_t PkgType : 4;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t LahfSahf : 1;
+                        uint32_t CmpLegacy : 1;
+                        uint32_t SVM : 1;
+                        uint32_t ExtApicSpace : 1;
+                        uint32_t AltMovCr8 : 1;
+                        uint32_t ABM : 1;
+                        uint32_t SSE4A : 1;
+                        uint32_t MisAlignSse : 1;
+                        uint32_t ThreeDNowPrefetch : 1;
+                        uint32_t OSVW : 1;
+                        uint32_t IBS : 1;
+                        uint32_t XOP : 1;
+                        uint32_t SKINIT : 1;
+                        uint32_t WDT : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t LWP : 1;
+                        uint32_t FMA4 : 1;
+                        uint32_t TCE : 1;
+                        uint32_t Reserved1 : 3;
+                        uint32_t TBM : 1;
+                        uint32_t TopologyExtensions : 1;
+                        uint32_t PerfCtrExtCore : 1;
+                        uint32_t PerfCtrExtNB : 1;
+                        uint32_t Reserved2 : 1;
+                        uint32_t DataBkptExt : 1;
+                        uint32_t PerfTsc : 1;
+                        uint32_t PerfCtrExtLLC : 1;
+                        uint32_t MONITORX : 1;
+                        uint32_t AddrMaskExt : 1;
+                        uint32_t Reserved3 : 1;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t FPU : 1;
+                        uint32_t VME : 1;
+                        uint32_t DE : 1;
+                        uint32_t PSE : 1;
+                        uint32_t TSC : 1;
+                        uint32_t MSR : 1;
+                        uint32_t PAE : 1;
+                        uint32_t MCE : 1;
+                        uint32_t CMPXCHG8B : 1;
+                        uint32_t APIC : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t SysCallSysRet : 1;
+                        uint32_t MTRR : 1;
+                        uint32_t PGE : 1;
+                        uint32_t MCA : 1;
+                        uint32_t CMOV : 1;
+                        uint32_t PAT : 1;
+                        uint32_t PSE36 : 1;
+                        uint32_t Reserved1 : 2;
+                        uint32_t NX : 1;
+                        uint32_t Reserved2 : 1;
+                        uint32_t MmxExt : 1;
+                        uint32_t MMX : 1;
+                        uint32_t FXSR : 1;
+                        uint32_t FFXSR : 1;
+                        uint32_t Page1GB : 1;
+                        uint32_t RDTSCP : 1;
+                        uint32_t Reserved3 : 1;
+                        uint32_t LM : 1;
+                        uint32_t ThreeDNowExtended : 1;
+                        uint32_t ThreeDNow : 1;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended Processor Name String */
+            struct CPUID0x80000002
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000002));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended Processor Name String */
+            struct CPUID0x80000003
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000003));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended Processor Name String */
+            struct CPUID0x80000004
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000004));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief L1 Cache and TLB Information */
+            struct CPUID0x80000005
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000005));
+#endif // a64 || a32
+                }
+
+                /** @brief L1 TLB 2M/4M Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L1ITlb2and4MSize : 8;
+                        uint32_t L1ITlb2and4MAssoc : 8;
+                        uint32_t L1DTlb2and4MSize : 8;
+                        uint32_t L1DTlb2and4MAssoc : 8;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief L1 TLB 4K Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L1ITlb4KSize : 8;
+                        uint32_t L1ITlb4KAssoc : 8;
+                        uint32_t L1DTlb4KSize : 8;
+                        uint32_t L1DTlb4KAssoc : 8;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief L1 Data Cache Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L1DcLineSize : 8;
+                        uint32_t L1DcLinesPerTag : 8;
+                        uint32_t L1DcAssoc : 8;
+                        uint32_t L1DcSize : 8;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief L1 Instruction Cache Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L1IcLineSize : 8;
+                        uint32_t L1IcLinesPerTag : 8;
+                        uint32_t L1IcAssoc : 8;
+                        uint32_t L1IcSize : 8;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief L2 Cache and TLB and L3 Cache Information */
+            struct CPUID0x80000006
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000006));
+#endif // a64 || a32
+                }
+
+                /** @brief L2 TLB 2M/4M Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L2ITlb2and4MSize : 12;
+                        uint32_t L2ITlb2and4MAssoc : 4;
+                        uint32_t L2DTlb2and4MSize : 12;
+                        uint32_t L2DTlb2and4MAssoc : 4;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief L2 TLB 4K Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L2ITlb4KSize : 12;
+                        uint32_t L2ITlb4KAssoc : 4;
+                        uint32_t L2DTlb4KSize : 12;
+                        uint32_t L2DTlb4KAssoc : 4;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief L2 Cache Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L2LineSize : 8;
+                        uint32_t L2LinesPerTag : 4;
+                        uint32_t L2Assoc : 4;
+                        uint32_t L2Size : 16;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief L3 Cache Information */
+                union
+                {
+                    struct
+                    {
+                        uint32_t L3LineSize : 8;
+                        uint32_t L3LinesPerTag : 4;
+                        uint32_t L3Assoc : 4;
+                        uint32_t Reserved0 : 2;
+                        uint32_t L3Size : 14;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Power Management and RAS Capabilities */
+            struct CPUID0x80000007
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000007));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief RAS Capabilities */
+                union
+                {
+                    struct
+                    {
+                        uint32_t McaOverflowRecov : 1;
+                        uint32_t SUCCOR : 1;
+                        uint32_t HWA : 1;
+                        uint32_t ScalableMca : 1;
+                        uint32_t Reserved0 : 28;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Processor Power Monitoring Interface */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CpuPwrSampleTimeRatio : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief Advanced Power Management Features */
+                union
+                {
+                    struct
+                    {
+                        uint32_t TS : 1;
+                        uint32_t FID : 1;
+                        uint32_t VID : 1;
+                        uint32_t TTP : 1;
+                        uint32_t TM : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t OneHundredMHzSteps : 1;
+                        uint32_t HwPstate : 1;
+                        uint32_t TscInvariant : 1;
+                        uint32_t CPB : 1;
+                        uint32_t EffFreqRO : 1;
+                        uint32_t ProcFeedbackInterface : 1;
+                        uint32_t ProcPowerReporting : 1;
+                        uint32_t Reserved1 : 19;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Processor Capacity Parameters and Extended Feature Identification */
+            struct CPUID0x80000008
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000008));
+#endif // a64 || a32
+                }
+
+                /** @brief Long Mode Size Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t PhysAddrSize : 8;
+                        uint32_t LinAddrSize : 8;
+                        uint32_t GuestPhysAddrSize : 8;
+                        uint32_t Reserved0 : 8;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief Extended Feature Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t CLZERO : 1;
+                        uint32_t InstRetCntMsr : 1;
+                        uint32_t RstrFpErrPtrs : 1;
+                        uint32_t INVLPGB : 1;
+                        uint32_t RDPRU : 1;
+                        uint32_t Reserved0 : 3;
+                        uint32_t MCOMMIT : 1;
+                        uint32_t WBNOINVD : 1;
+                        uint32_t Reserved1 : 2;
+                        uint32_t IBPB : 1;
+                        uint32_t INT_WBINVD : 1;
+                        uint32_t IBRS : 1;
+                        uint32_t STIBP : 1;
+                        uint32_t IbrsAlwaysOn : 1;
+                        uint32_t StibpAlwaysOn : 1;
+                        uint32_t IbrsPreferred : 1;
+                        uint32_t IbrsSameMode : 1;
+                        uint32_t EferLmsleUnsupported : 1;
+                        uint32_t INVLPGBnestedPages : 1;
+                        uint32_t Reserved2 : 2;
+                        uint32_t SSBD : 1;
+                        uint32_t SsbdVirtSpecCtrl : 1;
+                        uint32_t SsbdNotRequired : 1;
+                        uint32_t Reserved3 : 1;
+                        uint32_t PSFD : 1;
+                        uint32_t BTC_NO : 1;
+                        uint32_t Reserved4 : 2;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief Size Identifiers */
+                union
+                {
+                    struct
+                    {
+                        uint32_t NT : 8;
+                        uint32_t Reserved0 : 4;
+                        uint32_t ApicIdSize : 4;
+                        uint32_t PerfTscSize : 2;
+                        uint32_t Reserved1 : 14;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief RDPRU Register Identifier Range */
+                union
+                {
+                    struct
+                    {
+                        uint32_t InvlpgbCountMax : 16;
+                        uint32_t MaxRdpruID : 16;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000000A
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000000A));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x80000019
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000019));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000001A
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000001A));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000001B
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000001B));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000001C
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000001C));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000001D
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000001D));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000001E
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000001E));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x8000001F
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000001F));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x80000020
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000020));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x80000021
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000021));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x80000022
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000022));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x80000023
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000023));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief TODO */
+            struct CPUID0x80000026
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000026));
+#endif // a64 || a32
+                }
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                /** @brief  */
+                union
+                {
+                    struct
+                    {
+                        uint32_t todo : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+        }
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x86_CPUID_AMD_H__
diff --git a/Kernel/include/cpu/x86/cpuid_intel.hpp b/Kernel/include/cpu/x86/cpuid_intel.hpp
new file mode 100644
index 00000000..607977bc
--- /dev/null
+++ b/Kernel/include/cpu/x86/cpuid_intel.hpp
@@ -0,0 +1,1420 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x86_CPUID_INTEL_H__
+#define __FENNIX_KERNEL_CPU_x86_CPUID_INTEL_H__
+
+#include <types.h>
+
+#if defined(a64)
+typedef uint64_t cpuid_t;
+#elif defined(a32)
+typedef uint32_t cpuid_t;
+#else
+typedef uint64_t cpuid_t;
+#endif // a64 || a32
+
+namespace CPU
+{
+    namespace x86
+    {
+        /** @brief EXPERIMENTAL IMPLEMENTATION */
+        namespace Intel
+        {
+            /** @brief Basic CPU information */
+            struct CPUID0x00000000
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x0));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t HighestFunctionSupported : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+                union
+                {
+                    struct
+                    {
+                        char rbx[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+                union
+                {
+                    struct
+                    {
+                        char rcx[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+                union
+                {
+                    struct
+                    {
+                        char rdx[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Additional CPU information */
+            struct CPUID0x00000001
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x1));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t SteppingID : 4;
+                        uint32_t ModelID : 4;
+                        uint32_t FamilyID : 4;
+                        uint32_t Type : 2;
+                        uint32_t Reserved0 : 2;
+                        uint32_t ExtendedModel : 4;
+                        uint32_t ExtendedFamily : 8;
+                        uint32_t Reserved1 : 4;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t BrandIndex : 8;
+                        uint32_t CLFLUSHLineSize : 8;
+                        uint32_t LogicalProcessorsPerPackage : 8;
+                        uint32_t LocalAPICID : 8;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t SSE3 : 1;
+                        uint32_t PCLMULQDQ : 1;
+                        uint32_t DTES64 : 1;
+                        uint32_t MONITOR : 1;
+                        uint32_t DS_CPL : 1;
+                        uint32_t VMX : 1;
+                        uint32_t SMX : 1;
+                        uint32_t EIST : 1;
+                        uint32_t TM2 : 1;
+                        uint32_t SSSE3 : 1;
+                        uint32_t CNXT_ID : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t FMA : 1;
+                        uint32_t CMPXCHG16B : 1;
+                        uint32_t xTPRUpdateControl : 1;
+                        uint32_t PDCM : 1;
+                        uint32_t Reserved1 : 1;
+                        uint32_t PCID : 1;
+                        uint32_t DCA : 1;
+                        uint32_t SSE4_1 : 1;
+                        uint32_t SSE4_2 : 1;
+                        uint32_t x2APIC : 1;
+                        uint32_t MOVBE : 1;
+                        uint32_t POPCNT : 1;
+                        uint32_t TSCDeadline : 1;
+                        uint32_t AES : 1;
+                        uint32_t XSAVE : 1;
+                        uint32_t OSXSAVE : 1;
+                        uint32_t AVX : 1;
+                        uint32_t F16C : 1;
+                        uint32_t RDRAND : 1;
+                        uint32_t Reserved2 : 1;
+                        uint32_t Hypervisor : 1;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t FPU : 1;
+                        uint32_t VME : 1;
+                        uint32_t DE : 1;
+                        uint32_t PSE : 1;
+                        uint32_t TSC : 1;
+                        uint32_t MSR : 1;
+                        uint32_t PAE : 1;
+                        uint32_t MCE : 1;
+                        uint32_t CX8 : 1;
+                        uint32_t APIC : 1;
+                        uint32_t Reserved0 : 1;
+                        uint32_t SEP : 1;
+                        uint32_t MTRR : 1;
+                        uint32_t PGE : 1;
+                        uint32_t MCA : 1;
+                        uint32_t CMOV : 1;
+                        uint32_t PAT : 1;
+                        uint32_t PSE36 : 1;
+                        uint32_t PSN : 1;
+                        uint32_t CLFSH : 1;
+                        uint32_t Reserved1 : 1;
+                        uint32_t DS : 1;
+                        uint32_t ACPI : 1;
+                        uint32_t MMX : 1;
+                        uint32_t FXSR : 1;
+                        uint32_t SSE : 1;
+                        uint32_t SSE2 : 1;
+                        uint32_t SS : 1;
+                        uint32_t HTT : 1;
+                        uint32_t TM : 1;
+                        uint32_t Reserved2 : 1;
+                        uint32_t PBE : 1;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief CPU cache and TLB */
+            struct CPUID0x00000002
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x2));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t CacheLineSize : 8;
+                        uint32_t CacheLinesPerTag : 8;
+                        uint32_t Associativity : 8;
+                        uint32_t CacheSize : 8;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t CacheLineSize : 8;
+                        uint32_t CacheLinesPerTag : 8;
+                        uint32_t Associativity : 8;
+                        uint32_t CacheSize : 8;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t CacheLineSize : 8;
+                        uint32_t CacheLinesPerTag : 8;
+                        uint32_t Associativity : 8;
+                        uint32_t CacheSize : 8;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t CacheLineSize : 8;
+                        uint32_t CacheLinesPerTag : 8;
+                        uint32_t Associativity : 8;
+                        uint32_t CacheSize : 8;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief CPU serial number */
+            struct CPUID0x00000003
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x3));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t ProcessorSerialNumber : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t ProcessorSerialNumber : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Cache information */
+            struct CPUID0x00000004_1
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x4), "c"(0x1)); /* FIXME */
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Type : 5;
+                        uint32_t Level : 3;
+                        uint32_t SelfInitializing : 1;
+                        uint32_t FullyAssociative : 1;
+                        uint32_t Reserved : 4;
+                        uint32_t MaxAddressableIdsForLogicalProcessors : 12;
+                        uint32_t CoresPerPackage : 6;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t SystemCoherencyLineSize : 12;
+                        uint32_t PhysicalLinePartitions : 10;
+                        uint32_t WaysOfAssociativity : 10;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief MONITOR information */
+            struct CPUID0x00000005
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x5));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t SmallestMonitorLineSize : 16;
+                        uint32_t Reserved : 16;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t LargestMonitorLineSize : 16;
+                        uint32_t Reserved : 16;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t MWAITEnumerationSupported : 1;
+                        uint32_t InterruptsAsBreakEvent : 1;
+                        uint32_t Reserved : 30;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t C0 : 4;
+                        uint32_t C1 : 4;
+                        uint32_t C2 : 4;
+                        uint32_t C3 : 4;
+                        uint32_t C4 : 4;
+                        uint32_t Reserved : 12;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Thermal and power management information */
+            struct CPUID0x00000006
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x6));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t SensorSupported : 1;
+                        uint32_t Reserved : 31;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t InterruptThreshold : 4;
+                        uint32_t Reserved : 26;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t ACNT_MCNT : 1;
+                        uint32_t Reserved : 31;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended feature flags enumeration */
+            struct CPUID0x00000007_0
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x7), "c"(0x0)); /* FIXME */
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Access to base of fs and gs */
+                        uint32_t FSGSBase : 1;
+                        /** @brief IA32_TSC_ADJUST MSR */
+                        uint32_t IA32TSCAdjust : 1;
+                        /** @brief Software Guard Extensions */
+                        uint32_t SGX : 1;
+                        /** @brief Bit Manipulation Instruction Set 1 */
+                        uint32_t BMI1 : 1;
+                        /** @brief TSX Hardware Lock Elision */
+                        uint32_t HLE : 1;
+                        /** @brief Advanced Vector Extensions 2 */
+                        uint32_t AVX2 : 1;
+                        /** @brief FDP_EXCPTN_ONLY */
+                        uint32_t FDPExcptonOnly : 1;
+                        /** @brief Supervisor Mode Execution Protection */
+                        uint32_t SMEP : 1;
+                        /** @brief Bit Manipulation Instruction Set 2 */
+                        uint32_t BMI2 : 1;
+                        /** @brief Enhanced REP MOVSB/STOSB */
+                        uint32_t ERMS : 1;
+                        /** @brief INVPCID */
+                        uint32_t INVPCID : 1;
+                        /** @brief RTM */
+                        uint32_t RTM : 1;
+                        /** @brief Intel Resource Director Monitoring */
+                        uint32_t RDT_M : 1;
+                        /** @brief Deprecates FPU CS and DS values */
+                        uint32_t DeprecatesFPU : 1;
+                        /** @brief Intel Memory Protection Extensions */
+                        uint32_t MPX : 1;
+                        /** @brief Intel Resource Director Allocation */
+                        uint32_t RDT_A : 1;
+                        /** @brief AVX-512 Foundation */
+                        uint32_t AVX512F : 1;
+                        /** @brief AVX-512 Doubleword and Quadword Instructions */
+                        uint32_t AVX512DQ : 1;
+                        /** @brief RDSEED */
+                        uint32_t RDSEED : 1;
+                        /** @brief Intel Multi-Precision Add-Carry Instruction Extensions */
+                        uint32_t ADX : 1;
+                        /** @brief Supervisor Mode Access Prevention */
+                        uint32_t SMAP : 1;
+                        /** @brief AVX-512 Integer Fused Multiply-Add Instructions */
+                        uint32_t AVX512IFMA : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved : 1;
+                        /** @brief CLFLUSHOPT */
+                        uint32_t CLFLUSHOPT : 1;
+                        /** @brief CLWB */
+                        uint32_t CLWB : 1;
+                        /** @brief Intel Processor Trace */
+                        uint32_t IntelProcessorTrace : 1;
+                        /** @brief AVX-512 Prefetch Instructions */
+                        uint32_t AVX512PF : 1;
+                        /** @brief AVX-512 Exponential and Reciprocal Instructions */
+                        uint32_t AVX512ER : 1;
+                        /** @brief AVX-512 Conflict Detection Instructions */
+                        uint32_t AVX512CD : 1;
+                        /** @brief SHA Extensions */
+                        uint32_t SHA : 1;
+                        /** @brief AVX-512 Byte and Word Instructions */
+                        uint32_t AVX512BW : 1;
+                        /** @brief AVX-512 Vector Length Extensions */
+                        uint32_t AVX512VL : 1;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief PREFETCHWT1 */
+                        uint32_t PREFETCHWT1 : 1;
+                        /** @brief AVX-512 Vector Bit Manipulation Instructions */
+                        uint32_t AVX512VBMI : 1;
+                        /** @brief User Mode Instruction Prevention */
+                        uint32_t UMIP : 1;
+                        /** @brief Memory Protection Keys for User-mode pages */
+                        uint32_t PKU : 1;
+                        /** @brief PKU enabled by OS */
+                        uint32_t OSPKE : 1;
+                        /** @brief Timed pause and user-level monitor/wait */
+                        uint32_t WaitPKG : 1;
+                        /** @brief AVX-512 Vector Bit Manipulation Instructions 2 */
+                        uint32_t AVX512VBMI2 : 1;
+                        /** @brief Control flow enforcement (CET) shadow stack */
+                        uint32_t CET_SS : 1;
+                        /** @brief Galois Field instructions */
+                        uint32_t GFNI : 1;
+                        /** @brief Vector AES instruction set (VEX-256/EVEX) */
+                        uint32_t VAES : 1;
+                        /** @brief CLMUL instruction set (VEX-256/EVEX) */
+                        uint32_t VPCLMULQDQ : 1;
+                        /** @brief AVX-512 Vector Neural Network Instructions */
+                        uint32_t AVX512VNNI : 1;
+                        /** @brief AVX-512 Bit Algorithms Instructions */
+                        uint32_t AVX512BITALG : 1;
+                        /** @brief IA32_TME related MSRs  */
+                        uint32_t TME : 1;
+                        /** @brief AVX-512 Vector Population Count Double and Quad-word */
+                        uint32_t AVX512VPOPCNTDQ : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved0 : 1;
+                        /** @brief 5-level paging (57 address bits) */
+                        uint32_t LA57 : 1;
+                        /** @brief The value of userspace MPX Address-Width Adjust used by the BNDLDX and BNDSTX Intel MPX instructions in 64-bit mode */
+                        uint32_t MAWAU : 5;
+                        /** @brief Read Processor ID and IA32_TSC_AUX  */
+                        uint32_t RDPID : 1;
+                        /** @brief Key Locker */
+                        uint32_t KL : 1;
+                        /** @brief BUS_LOCK_DETECT */
+                        uint32_t BusLockDetect : 1;
+                        /** @brief Cache line demote */
+                        uint32_t CLDEMOTE : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved1 : 1;
+                        /** @brief MOVDIRI */
+                        uint32_t MOVDIRI : 1;
+                        /** @brief MOVDIR64B */
+                        uint32_t MOVDIR64B : 1;
+                        /** @brief SGX Launch Configuration */
+                        uint32_t SGX_LC : 1;
+                        /** @brief Protection Keys for Supervisor-mode pages */
+                        uint32_t PKS : 1;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Reserved */
+                        uint32_t Reserved0 : 2;
+                        /** @brief AVX-512 4-register Neural Network Instructions */
+                        uint32_t AVX512_4VNNIW : 1;
+                        /** @brief AVX-512 4-register Multiply Accumulation Single Precision */
+                        uint32_t AVX512_4FMAPS : 1;
+                        /** @brief Fast Short REP MOVSB/STOSB */
+                        uint32_t FSRM : 1;
+                        /** @brief User Inter-Processor Interrupts */
+                        uint32_t UINTR : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved1 : 2;
+                        /** @brief AVX-512 VP2INTERSECT Doubleword and Quadword Instructions */
+                        uint32_t AVX512_VP2INTERSECT : 1;
+                        /** @brief Special Register Buffer Data Sampling Mitigations */
+                        uint32_t SRBDS_CTRL : 1;
+                        /** @brief VERW instruction clears CPU buffers */
+                        uint32_t MC_CLEAR : 1;
+                        /** @brief All TSX transactions are aborted */
+                        uint32_t TSX_FORCE_ABORT : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved2 : 1;
+                        /** @brief TSX_FORCE_ABORT MSR is available */
+                        uint32_t TsxForceAbortMsr : 1;
+                        /** @brief SERIALIZE */
+                        uint32_t SERIALIZE : 1;
+                        /** @brief Mixture of CPU types in processor topology */
+                        uint32_t HYBRID : 1;
+                        /** @brief TSXLDTRK */
+                        uint32_t TSXLDTRK : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved3 : 1;
+                        /** @brief Platform configuration for Memory Encryption Technologies Instrctuions */
+                        uint32_t PCONFIG : 1;
+                        /** @brief Architectural Last Branch Records */
+                        uint32_t LBR : 1;
+                        /** @brief Control flow enforcement (CET) indirect branch tracking */
+                        uint32_t CET_IBT : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved4 : 1;
+                        /** @brief Tile computation on bfloat16 numbers */
+                        uint32_t AMX_BF16 : 1;
+                        /** @brief AVX512-FP16 half-precision floating-point instructions */
+                        uint32_t AVX512_FP16 : 1;
+                        /** @brief Tile architecture */
+                        uint32_t AMX_TILE : 1;
+                        /** @brief Tile computation on 8-bit integers */
+                        uint32_t AMX_INT8 : 1;
+                        /** @brief Speculation Control, part of Indirect Branch Control (IBC):
+                                   Indirect Branch Restricted Speculation (IBRS) and
+                                   Indirect Branch Prediction Barrier (IBPB) */
+                        uint32_t SPEC_CTRL : 1;
+                        /** @brief Single Thread Indirect Branch Predictor, part of IBC */
+                        uint32_t STIBP : 1;
+                        /** @brief IA32_FLUSH_CMD MSR */
+                        uint32_t L1D_FLUSH : 1;
+                        /** @brief IA32_ARCH_CAPABILITIES (lists speculative side channel mitigations */
+                        uint32_t ArchCapabilities : 1;
+                        /** @brief IA32_CORE_CAPABILITIES MSR (lists model-specific core capabilities) */
+                        uint32_t CoreCapabilities : 1;
+                        /** @brief Speculative Store Bypass Disable, as mitigation for Speculative Store Bypass (IA32_SPEC_CTRL) */
+                        uint32_t SSBD : 1;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended feature flags enumeration */
+            struct CPUID0x00000007_1
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x7), "c"(0x1)); /* FIXME */
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved0 : 3;
+                        /** @brief RAO-INT */
+                        uint32_t RAO_INT : 1;
+                        /** @brief AVX Vector Neural Network Instructions (XNNI) (VEX encoded) */
+                        uint32_t AVX_VNNI : 1;
+                        /** @brief AVX-512 instructions for bfloat16 numbers */
+                        uint32_t AVX512_BF16 : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved1 : 1;
+                        /** @brief CMPccXADD */
+                        uint32_t CMPCCXADD : 1;
+                        /** @brief Architectural Performance Monitoring Extended Leaf (EAX=23h) */
+                        uint32_t ARCHPERFMONEXT : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved2 : 1;
+                        /** @brief Fast zero-length MOVSB */
+                        uint32_t FAST_ZERO_REP_MOVSB : 1;
+                        /** @brief Fast zero-length STOSB */
+                        uint32_t FAST_SHORT_REP_STOSB : 1;
+                        /** @brief Fast zero-length CMPSB and SCASB */
+                        uint32_t FAST_SHORT_REP_CMPSB_SCASB : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved3 : 4;
+                        /** @brief Flexible Return and Event Delivery */
+                        uint32_t FRED : 1;
+                        /** @brief LKGS Instruction */
+                        uint32_t LKGS : 1;
+                        /** @brief WRMSRNS instruction */
+                        uint32_t WRMSRNS : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved4 : 1;
+                        /** @brief AMX instructions for FP16 numbers */
+                        uint32_t AMX_FP16 : 1;
+                        /** @brief HRESET instruction, IA32_HRESET_ENABLE MSR, and Processor History Reset Leaf (EAX=20h) */
+                        uint32_t HRESET : 1;
+                        /** @brief AVX IFMA instructions */
+                        uint32_t AVX_IFMA : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved5 : 2;
+                        /** @brief Linear Address Masking */
+                        uint32_t LAM : 1;
+                        /** @brief RDMSRLIST and WRMSRLIST instructions, and the IA32_BARRIER MSR */
+                        uint32_t MSRLIST : 1;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief IA32_PPIN and IA32_PPIN_CTL MSRs */
+                        uint32_t PPIN : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved : 31;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Reserved */
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Reserved */
+                        uint32_t Reserved0 : 4;
+                        /** @brief AVX VNNI INT8 instructions */
+                        uint32_t AVX_VNNI_INT8 : 1;
+                        /** @brief AVX NE CONVERT instructions */
+                        uint32_t AVX_NE_CONVERT : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved1 : 8;
+                        /** @brief PREFETCHIT0 and PREFETCHIT1 instructions */
+                        uint32_t PREFETCHIT : 1;
+                        /** @brief Reserved */
+                        uint32_t Reserved2 : 17;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Performance monitors */
+            struct CPUID0x0000000A
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0xA));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t VersionID : 8;
+                        uint32_t NumberCounters : 8;
+                        uint32_t BitWidthOfCounters : 8;
+                        uint32_t LengthOfEBXBitVector : 8;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t CoreCycles : 1;
+                        uint32_t InstructionsRetired : 1;
+                        uint32_t ReferenceCycles : 1;
+                        uint32_t CacheReferences : 1;
+                        uint32_t CacheMisses : 1;
+                        uint32_t BranchInstructionsRetired : 1;
+                        uint32_t BranchMissesRetired : 1;
+                        uint32_t Reserved : 25;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t FixedFunctionCounters : 5;
+                        uint32_t CounterWidth : 8;
+                        uint32_t Reserved : 19;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Get CPU frequency information */
+            struct CPUID0x00000015
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x15));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t VersionID : 8;
+                        uint32_t NumberCounters : 8;
+                        uint32_t BitWidthOfCounters : 8;
+                        uint32_t LengthOfEBXBitVector : 8;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t CoreCycles : 1;
+                        uint32_t InstructionsRetired : 1;
+                        uint32_t ReferenceCycles : 1;
+                        uint32_t CacheReferences : 1;
+                        uint32_t CacheMisses : 1;
+                        uint32_t BranchInstructionsRetired : 1;
+                        uint32_t BranchMissesRetired : 1;
+                        uint32_t Reserved : 25;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t FixedFunctionCounters : 5;
+                        uint32_t CounterWidth : 8;
+                        uint32_t Reserved : 19;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Get CPU frequency information */
+            struct CPUID0x00000016
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x16));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        /**
+                         * @brief Denominator of the TSC frequency
+                         *
+                         * @note TSC frequency = core crystal clock frequency * EBX/EAX
+                         */
+                        uint32_t Denominator : 31;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        /**
+                         * @brief Numerator of the TSC frequency
+                         *
+                         * @note TSC frequency = core crystal clock frequency * EBX/EAX
+                         */
+                        uint32_t Numerator : 31;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Core crystal clock frequency in Hz */
+                        uint32_t CoreCrystalClock : 31;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Reserved */
+                        uint32_t Reserved : 31;
+                    };
+                    cpuid_t raw;
+                } EDX;
+            };
+
+            /** @brief Extended CPU information */
+            struct CPUID0x80000000
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000000));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t HighestExtendedFunctionSupported : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief Extended CPU information */
+            struct CPUID0x80000001
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000001));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Unknown : 32;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t LAHF_SAHF : 1;
+                        uint32_t Reserved : 31;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved0 : 11;
+                        uint32_t SYSCALL : 1;
+                        uint32_t Reserved1 : 8;
+                        uint32_t ExecuteDisable : 1;
+                        uint32_t Reserved2 : 8;
+                        uint32_t EMT64T : 1;
+                        uint32_t Reserved3 : 2;
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief CPU brand string */
+            struct CPUID0x80000002
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000002));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief CPU brand string */
+            struct CPUID0x80000003
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000003));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief CPU brand string */
+            struct CPUID0x80000004
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000004));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        char Brand[4];
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief CPU cache line information */
+            struct CPUID0x80000006
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000006));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t InstructionCount : 12;
+                        uint32_t InstructionAssociativity : 4;
+                        uint32_t DataCount : 12;
+                        uint32_t DataAssociativity : 4;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t InstructionCount : 12;
+                        uint32_t InstructionAssociativity : 4;
+                        uint32_t DataCount : 12;
+                        uint32_t DataAssociativity : 4;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t LineSize : 8;
+                        uint32_t LinePerTag : 4;
+                        uint32_t Associativity : 4;
+                        uint32_t CacheSize : 16;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief Virtual and physical memory size */
+            struct CPUID0x80000008
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x80000008));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t PhysicalAddressBits : 8;
+                        uint32_t LinearAddressBits : 8;
+                        uint32_t Reserved : 16;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+
+            /** @brief Secure virtual machine parameters */
+            struct CPUID0x8000000A
+            {
+                __always_inline inline void Get()
+                {
+#if defined(a86)
+                    asmv("cpuid"
+                         : "=a"(EAX.raw), "=b"(EBX.raw), "=c"(ECX.raw), "=d"(EDX.raw)
+                         : "a"(0x8000000A));
+#endif // a64 || a32
+                }
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t SVMRevision : 8;
+                        uint32_t Reserved : 24;
+                    };
+                    cpuid_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        uint32_t Reserved : 32;
+                    };
+                    cpuid_t raw;
+                } EDX;
+                cpuid_t raw;
+            };
+        }
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x86_CPUID_INTEL_H__
diff --git a/Kernel/include/cpu/x86/exceptions.hpp b/Kernel/include/cpu/x86/exceptions.hpp
new file mode 100644
index 00000000..3d7e071c
--- /dev/null
+++ b/Kernel/include/cpu/x86/exceptions.hpp
@@ -0,0 +1,54 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x86_EXCEPTIONS_H__
+#define __FENNIX_KERNEL_CPU_x86_EXCEPTIONS_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x86
+    {
+        enum ISRExceptions
+        {
+            DivideByZero = 0x0,
+            Debug = 0x1,
+            NonMaskableInterrupt = 0x2,
+            Breakpoint = 0x3,
+            Overflow = 0x4,
+            BoundRange = 0x5,
+            InvalidOpcode = 0x6,
+            DeviceNotAvailable = 0x7,
+            DoubleFault = 0x8,
+            CoprocessorSegmentOverrun = 0x9,
+            InvalidTSS = 0xa,
+            SegmentNotPresent = 0xb,
+            StackSegmentFault = 0xc,
+            GeneralProtectionFault = 0xd,
+            PageFault = 0xe,
+            x87FloatingPoint = 0x10,
+            AlignmentCheck = 0x11,
+            MachineCheck = 0x12,
+            SIMDFloatingPoint = 0x13,
+            Virtualization = 0x14,
+            Security = 0x1e
+        };
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x86_EXCEPTIONS_H__
diff --git a/Kernel/include/cpu/x86/hypervisor.hpp b/Kernel/include/cpu/x86/hypervisor.hpp
new file mode 100644
index 00000000..83db73fe
--- /dev/null
+++ b/Kernel/include/cpu/x86/hypervisor.hpp
@@ -0,0 +1,80 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x86_CPUID_HYPERVISOR_H__
+#define __FENNIX_KERNEL_CPU_x86_CPUID_HYPERVISOR_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x86
+    {
+        /** @brief EXPERIMENTAL IMPLEMENTATION */
+        namespace Hypervisor
+        {
+            /** @brief Get CPU hypervisor information */
+            struct CPUID0x40000000
+            {
+                union
+                {
+                    struct
+                    {
+                        /**
+                         * @brief Maximum input value for hypervisor CPUID information.
+                         * @note Can be from 0x40000001 to 0x400000FF
+                         */
+                        uint64_t MaximumInputValue : 32;
+                    };
+                    uint64_t raw;
+                } EAX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Hypervisor vendor signature */
+                        char Hypervisor[4];
+                    };
+                    uint64_t raw;
+                } EBX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Hypervisor vendor signature */
+                        char Hypervisor[4];
+                    };
+                    uint64_t raw;
+                } ECX;
+
+                union
+                {
+                    struct
+                    {
+                        /** @brief Hypervisor vendor signature */
+                        char Hypervisor[4];
+                    };
+                    uint64_t raw;
+                } EDX;
+            };
+        }
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x86_CPUID_HYPERVISOR_H__
diff --git a/Kernel/include/cpu/x86/interrupts.hpp b/Kernel/include/cpu/x86/interrupts.hpp
new file mode 100644
index 00000000..e46d83d4
--- /dev/null
+++ b/Kernel/include/cpu/x86/interrupts.hpp
@@ -0,0 +1,300 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x86_INTERRUPTS_H__
+#define __FENNIX_KERNEL_CPU_x86_INTERRUPTS_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x86
+    {
+        enum CPUInterrupts
+        {
+            /* ISR */
+
+            ISR0 = 0x0,   // Divide-by-zero Error
+            ISR1 = 0x1,   // Debug
+            ISR2 = 0x2,   // Non-maskable Interrupt
+            ISR3 = 0x3,   // Breakpoint
+            ISR4 = 0x4,   // Overflow
+            ISR5 = 0x5,   // Bound Range Exceeded
+            ISR6 = 0x6,   // Invalid Opcode
+            ISR7 = 0x7,   // Device Not Available
+            ISR8 = 0x8,   // Double Fault
+            ISR9 = 0x9,   // Coprocessor Segment Overrun
+            ISR10 = 0xa,  // Invalid TSS
+            ISR11 = 0xb,  // Segment Not P
+            ISR12 = 0xc,  // Stack-Segment Fault
+            ISR13 = 0xd,  // General Protection Fault
+            ISR14 = 0xe,  // Page Fault
+            ISR15 = 0xf,  // Reserved
+            ISR16 = 0x10, // x87 Floating-Point Exception
+            ISR17 = 0x11, // Alignment Check
+            ISR18 = 0x12, // Machine Check
+            ISR19 = 0x13, // SIMD Floating-Point Exception
+            ISR20 = 0x14, // Virtualization Exception
+            ISR21 = 0x15, // Reserved
+            ISR22 = 0x16, // Reserved
+            ISR23 = 0x17, // Reserved
+            ISR24 = 0x18, // Reserved
+            ISR25 = 0x19, // Reserved
+            ISR26 = 0x1a, // Reserved
+            ISR27 = 0x1b, // Reserved
+            ISR28 = 0x1c, // Reserved
+            ISR29 = 0x1d, // Reserved
+            ISR30 = 0x1e, // Security Exception
+            ISR31 = 0x1f, // Reserved
+
+            /* IRQ */
+
+            IRQ0 = 0x20,  // Programmable Interrupt Timer Interrupt
+            IRQ1 = 0x21,  // Keyboard Interrupt
+            IRQ2 = 0x22,  // Cascade (used internally by the two PICs. never raised)
+            IRQ3 = 0x23,  // COM2 (if enabled)
+            IRQ4 = 0x24,  // COM1 (if enabled)
+            IRQ5 = 0x25,  // LPT2 (if enabled)
+            IRQ6 = 0x26,  // Floppy Disk
+            IRQ7 = 0x27,  // LPT1 / Unreliable "spurious" interrupt (usually)
+            IRQ8 = 0x28,  // CMOS real-time clock (if enabled)
+            IRQ9 = 0x29,  // Free for peripherals / legacy SCSI / NIC
+            IRQ10 = 0x2a, // Free for peripherals / SCSI / NIC
+            IRQ11 = 0x2b, // Free for peripherals / SCSI / NIC
+            IRQ12 = 0x2c, // PS2 Mouse
+            IRQ13 = 0x2d, // FPU / Coprocessor / Inter-processor
+            IRQ14 = 0x2e, // Primary ATA Hard Disk
+            IRQ15 = 0x2f, // Secondary ATA Hard Disk
+
+            /* Reserved by OS */
+
+            IRQ16 = 0x30, // Reserved for multitasking
+            IRQ17 = 0x31,
+            IRQ18 = 0x32,
+            IRQ19 = 0x33,
+            IRQ20 = 0x34,
+            IRQ21 = 0x35,
+            IRQ22 = 0x36,
+            IRQ23 = 0x37,
+            IRQ24 = 0x38,
+            IRQ25 = 0x39,
+            IRQ26 = 0x3a,
+            IRQ27 = 0x3b,
+            IRQ28 = 0x3c,
+            IRQ29 = 0x3d, // Reserved for icr stop core
+
+            /* Free */
+
+            IRQ30 = 0x3e,
+            IRQ31 = 0x3f,
+            IRQ32 = 0x40,
+            IRQ33 = 0x41,
+            IRQ34 = 0x42,
+            IRQ35 = 0x43,
+            IRQ36 = 0x44,
+            IRQ37 = 0x45,
+            IRQ38 = 0x46,
+            IRQ39 = 0x47,
+            IRQ40 = 0x48,
+            IRQ41 = 0x49,
+            IRQ42 = 0x4a,
+            IRQ43 = 0x4b,
+            IRQ44 = 0x4c,
+            IRQ45 = 0x4d,
+            IRQ46 = 0x4e,
+            IRQ47 = 0x4f,
+            IRQ48 = 0x50,
+            IRQ49 = 0x51,
+            IRQ50 = 0x52,
+            IRQ51 = 0x53,
+            IRQ52 = 0x54,
+            IRQ53 = 0x55,
+            IRQ54 = 0x56,
+            IRQ55 = 0x57,
+            IRQ56 = 0x58,
+            IRQ57 = 0x59,
+            IRQ58 = 0x5a,
+            IRQ59 = 0x5b,
+            IRQ60 = 0x5c,
+            IRQ61 = 0x5d,
+            IRQ62 = 0x5e,
+            IRQ63 = 0x5f,
+            IRQ64 = 0x60,
+            IRQ65 = 0x61,
+            IRQ66 = 0x62,
+            IRQ67 = 0x63,
+            IRQ68 = 0x64,
+            IRQ69 = 0x65,
+            IRQ70 = 0x66,
+            IRQ71 = 0x67,
+            IRQ72 = 0x68,
+            IRQ73 = 0x69,
+            IRQ74 = 0x6a,
+            IRQ75 = 0x6b,
+            IRQ76 = 0x6c,
+            IRQ77 = 0x6d,
+            IRQ78 = 0x6e,
+            IRQ79 = 0x6f,
+            IRQ80 = 0x70,
+            IRQ81 = 0x71,
+            IRQ82 = 0x72,
+            IRQ83 = 0x73,
+            IRQ84 = 0x74,
+            IRQ85 = 0x75,
+            IRQ86 = 0x76,
+            IRQ87 = 0x77,
+            IRQ88 = 0x78,
+            IRQ89 = 0x79,
+            IRQ90 = 0x7a,
+            IRQ91 = 0x7b,
+            IRQ92 = 0x7c,
+            IRQ93 = 0x7d,
+            IRQ94 = 0x7e,
+            IRQ95 = 0x7f,
+            IRQ96 = 0x80,
+            IRQ97 = 0x81,
+            IRQ98 = 0x82,
+            IRQ99 = 0x83,
+            IRQ100 = 0x84,
+            IRQ101 = 0x85,
+            IRQ102 = 0x86,
+            IRQ103 = 0x87,
+            IRQ104 = 0x88,
+            IRQ105 = 0x89,
+            IRQ106 = 0x8a,
+            IRQ107 = 0x8b,
+            IRQ108 = 0x8c,
+            IRQ109 = 0x8d,
+            IRQ110 = 0x8e,
+            IRQ111 = 0x8f,
+            IRQ112 = 0x90,
+            IRQ113 = 0x91,
+            IRQ114 = 0x92,
+            IRQ115 = 0x93,
+            IRQ116 = 0x94,
+            IRQ117 = 0x95,
+            IRQ118 = 0x96,
+            IRQ119 = 0x97,
+            IRQ120 = 0x98,
+            IRQ121 = 0x99,
+            IRQ122 = 0x9a,
+            IRQ123 = 0x9b,
+            IRQ124 = 0x9c,
+            IRQ125 = 0x9d,
+            IRQ126 = 0x9e,
+            IRQ127 = 0x9f,
+            IRQ128 = 0xa0,
+            IRQ129 = 0xa1,
+            IRQ130 = 0xa2,
+            IRQ131 = 0xa3,
+            IRQ132 = 0xa4,
+            IRQ133 = 0xa5,
+            IRQ134 = 0xa6,
+            IRQ135 = 0xa7,
+            IRQ136 = 0xa8,
+            IRQ137 = 0xa9,
+            IRQ138 = 0xaa,
+            IRQ139 = 0xab,
+            IRQ140 = 0xac,
+            IRQ141 = 0xad,
+            IRQ142 = 0xae,
+            IRQ143 = 0xaf,
+            IRQ144 = 0xb0,
+            IRQ145 = 0xb1,
+            IRQ146 = 0xb2,
+            IRQ147 = 0xb3,
+            IRQ148 = 0xb4,
+            IRQ149 = 0xb5,
+            IRQ150 = 0xb6,
+            IRQ151 = 0xb7,
+            IRQ152 = 0xb8,
+            IRQ153 = 0xb9,
+            IRQ154 = 0xba,
+            IRQ155 = 0xbb,
+            IRQ156 = 0xbc,
+            IRQ157 = 0xbd,
+            IRQ158 = 0xbe,
+            IRQ159 = 0xbf,
+            IRQ160 = 0xc0,
+            IRQ161 = 0xc1,
+            IRQ162 = 0xc2,
+            IRQ163 = 0xc3,
+            IRQ164 = 0xc4,
+            IRQ165 = 0xc5,
+            IRQ166 = 0xc6,
+            IRQ167 = 0xc7,
+            IRQ168 = 0xc8,
+            IRQ169 = 0xc9,
+            IRQ170 = 0xca,
+            IRQ171 = 0xcb,
+            IRQ172 = 0xcc,
+            IRQ173 = 0xcd,
+            IRQ174 = 0xce,
+            IRQ175 = 0xcf,
+            IRQ176 = 0xd0,
+            IRQ177 = 0xd1,
+            IRQ178 = 0xd2,
+            IRQ179 = 0xd3,
+            IRQ180 = 0xd4,
+            IRQ181 = 0xd5,
+            IRQ182 = 0xd6,
+            IRQ183 = 0xd7,
+            IRQ184 = 0xd8,
+            IRQ185 = 0xd9,
+            IRQ186 = 0xda,
+            IRQ187 = 0xdb,
+            IRQ188 = 0xdc,
+            IRQ189 = 0xdd,
+            IRQ190 = 0xde,
+            IRQ191 = 0xdf,
+            IRQ192 = 0xe0,
+            IRQ193 = 0xe1,
+            IRQ194 = 0xe2,
+            IRQ195 = 0xe3,
+            IRQ196 = 0xe4,
+            IRQ197 = 0xe5,
+            IRQ198 = 0xe6,
+            IRQ199 = 0xe7,
+            IRQ200 = 0xe8,
+            IRQ201 = 0xe9,
+            IRQ202 = 0xea,
+            IRQ203 = 0xeb,
+            IRQ204 = 0xec,
+            IRQ205 = 0xed,
+            IRQ206 = 0xee,
+            IRQ207 = 0xef,
+            IRQ208 = 0xf0,
+            IRQ209 = 0xf1,
+            IRQ210 = 0xf2,
+            IRQ211 = 0xf3,
+            IRQ212 = 0xf4,
+            IRQ213 = 0xf5,
+            IRQ214 = 0xf6,
+            IRQ215 = 0xf7,
+            IRQ216 = 0xf8,
+            IRQ217 = 0xf9,
+            IRQ218 = 0xfa,
+            IRQ219 = 0xfb,
+            IRQ220 = 0xfc,
+            IRQ221 = 0xfd,
+            IRQ222 = 0xfe,
+            IRQ223 = 0xff,
+        };
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x86_INTERRUPTS_H__
diff --git a/Kernel/include/cpu/x86/x32/cr.hpp b/Kernel/include/cpu/x86/x32/cr.hpp
new file mode 100644
index 00000000..150ca63b
--- /dev/null
+++ b/Kernel/include/cpu/x86/x32/cr.hpp
@@ -0,0 +1,238 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x32_CR_H__
+#define __FENNIX_KERNEL_CPU_x32_CR_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x32
+    {
+        typedef union CR0
+        {
+            struct
+            {
+                /** @brief Protection Enable */
+                uint32_t PE : 1;
+                /** @brief Monitor Coprocessor */
+                uint32_t MP : 1;
+                /** @brief Emulation */
+                uint32_t EM : 1;
+                /** @brief Task Switched */
+                uint32_t TS : 1;
+                /** @brief Extension Type */
+                uint32_t ET : 1;
+                /** @brief Numeric Error */
+                uint32_t NE : 1;
+                /** @brief Reserved */
+                uint32_t Reserved0 : 10;
+                /** @brief Write Protect */
+                uint32_t WP : 1;
+                /** @brief Reserved */
+                uint32_t Reserved1 : 1;
+                /** @brief Alignment Mask */
+                uint32_t AM : 1;
+                /** @brief Reserved */
+                uint32_t Reserved2 : 10;
+                /** @brief Not Write-through */
+                uint32_t NW : 1;
+                /** @brief Cache Disable */
+                uint32_t CD : 1;
+                /** @brief Paging */
+                uint32_t PG : 1;
+            };
+            uint32_t raw;
+        } CR0;
+
+        typedef union CR2
+        {
+            struct
+            {
+                /** @brief Page Fault Linear Address */
+                uint32_t PFLA;
+            };
+            uint32_t raw;
+        } CR2;
+
+        typedef union CR3
+        {
+            struct
+            {
+                /** @brief Not used if bit 17 of CR4 is 1 */
+                uint32_t PWT : 1;
+                /** @brief Not used if bit 17 of CR4 is 1 */
+                uint32_t PCD : 1;
+                /** @brief Base of PML4T/PML5T */
+                uint32_t PDBR;
+            };
+            uint32_t raw;
+        } CR3;
+
+        typedef union CR4
+        {
+            struct
+            {
+                /** @brief Virtual-8086 Mode Extensions */
+                uint32_t VME : 1;
+                /** @brief Protected-Mode Virtual Interrupts */
+                uint32_t PVI : 1;
+                /** @brief Time Stamp Disable */
+                uint32_t TSD : 1;
+                /** @brief Debugging Extensions */
+                uint32_t DE : 1;
+                /** @brief Page Size Extensions */
+                uint32_t PSE : 1;
+                /** @brief Physical Address Extension */
+                uint32_t PAE : 1;
+                /** @brief Machine Check Enable */
+                uint32_t MCE : 1;
+                /** @brief Page Global Enable */
+                uint32_t PGE : 1;
+                /** @brief Performance Monitoring Counter */
+                uint32_t PCE : 1;
+                /** @brief Operating System Support */
+                uint32_t OSFXSR : 1;
+                /** @brief Operating System Support */
+                uint32_t OSXMMEXCPT : 1;
+                /** @brief User-Mode Instruction Prevention */
+                uint32_t UMIP : 1;
+                /** @brief Linear Address 57bit */
+                uint32_t LA57 : 1;
+                /** @brief VMX Enable */
+                uint32_t VMXE : 1;
+                /** @brief SMX Enable */
+                uint32_t SMXE : 1;
+                /** @brief Reserved */
+                uint32_t Reserved0 : 1;
+                /** @brief FSGSBASE Enable */
+                uint32_t FSGSBASE : 1;
+                /** @brief PCID Enable */
+                uint32_t PCIDE : 1;
+                /** @brief XSAVE and Processor Extended States Enable */
+                uint32_t OSXSAVE : 1;
+                /** @brief Reserved */
+                uint32_t Reserved1 : 1;
+                /** @brief SMEP Enable */
+                uint32_t SMEP : 1;
+                /** @brief SMAP Enable */
+                uint32_t SMAP : 1;
+                /** @brief Protection-Key Enable */
+                uint32_t PKE : 1;
+                /** @brief Control-flow Enforcement Technology*/
+                uint32_t CET : 1;
+                /* @brief Enable Protection Keys for Supervisor Mode Pages */
+                uint32_t PKS : 1;
+            };
+            uint32_t raw;
+        } CR4;
+
+        typedef union CR8
+        {
+            struct
+            {
+                /** @brief Task Priority Level */
+                uint32_t TPL : 1;
+            };
+            uint32_t raw;
+        } CR8;
+#if defined(a32)
+        SafeFunction static inline CR0 readcr0()
+        {
+            uint32_t Result = 0;
+            asmv("mov %%cr0, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR0){.raw = Result};
+        }
+
+        SafeFunction static inline CR2 readcr2()
+        {
+            uint32_t Result = 0;
+            asmv("mov %%cr2, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR2){.raw = Result};
+        }
+
+        SafeFunction static inline CR3 readcr3()
+        {
+            uint32_t Result = 0;
+            asmv("mov %%cr3, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR3){.raw = Result};
+        }
+
+        SafeFunction static inline CR4 readcr4()
+        {
+            uint32_t Result = 0;
+            asmv("mov %%cr4, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR4){.raw = Result};
+        }
+
+        SafeFunction static inline CR8 readcr8()
+        {
+            uint32_t Result = 0;
+            asmv("mov %%cr8, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR8){.raw = Result};
+        }
+
+        SafeFunction static inline void writecr0(CR0 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr0"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr2(CR2 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr2"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr3(CR3 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr3"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr4(CR4 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr4"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr8(CR8 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr8"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+#endif
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x32_CR_H__
diff --git a/Kernel/include/cpu/x86/x32/msr.hpp b/Kernel/include/cpu/x86/x32/msr.hpp
new file mode 100644
index 00000000..0975115a
--- /dev/null
+++ b/Kernel/include/cpu/x86/x32/msr.hpp
@@ -0,0 +1,426 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x32_MSR_H__
+#define __FENNIX_KERNEL_CPU_x32_MSR_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x32
+    {
+        enum MSRID
+        {
+            MSR_MONITOR_FILTER_SIZE = 0x6,
+            MSR_TIME_STAMP_COUNTER = 0x10,
+            MSR_PLATFORM_ID = 0x17,
+            MSR_APIC_BASE = 0x1B,
+            MSR_FEATURE_CONTROL = 0x3A,
+            MSR_TSC_ADJUST = 0x3B,
+            MSR_SPEC_CTRL = 0x48,
+            MSR_PRED_CMD = 0x49,
+            MSR_BIOS_UPDT_TRIG = 0x79,
+            MSR_BIOS_SIGN_ID = 0x8B,
+            MSR_SGXLEPUBKEYHASH0 = 0x8C,
+            MSR_SGXLEPUBKEYHASH1 = 0x8D,
+            MSR_SGXLEPUBKEYHASH2 = 0x8E,
+            MSR_SGXLEPUBKEYHASH3 = 0x8F,
+            MSR_SMM_MONITOR_CTL = 0x9B,
+            MSR_SMBASE = 0x9E,
+            MSR_PMC0 = 0xC1,
+            MSR_PMC1 = 0xC2,
+            MSR_PMC2 = 0xC3,
+            MSR_PMC3 = 0xC4,
+            MSR_PMC4 = 0xC5,
+            MSR_PMC5 = 0xC6,
+            MSR_PMC6 = 0xC7,
+            MSR_PMC7 = 0xC8,
+            MSR_UMWAIT_CONTROL = 0xE1,
+            MSR_MPERF = 0xE7,
+            MSR_APERF = 0xE8,
+            MSR_MTRRCAP = 0xFE,
+            MSR_ARCH_CAPABILITIES = 0x10A,
+            MSR_FLUSH_CMD = 0x10B,
+            MSR_SYSENTER_CS = 0x17A,
+            MSR_SYSENTER_ESP = 0x175,
+            MSR_SYSENTER_EIP = 0x176,
+            MSR_MCG_CAP = 0x179,
+            MSR_MCG_STATUS = 0x17A,
+            MSR_MCG_CTL = 0x17B,
+            MSR_PERFEVTSEL0 = 0x186,
+            MSR_PERFEVTSEL1 = 0x187,
+            MSR_PERFEVTSEL2 = 0x188,
+            MSR_PERFEVTSEL3 = 0x189,
+            MSR_PERF_STATUS = 0x198,
+            MSR_PERF_CTL = 0x199,
+            MSR_CLOCK_MODULATION = 0x19A,
+            MSR_THERM_INTERRUPT = 0x19B,
+            MSR_THERM_STATUS = 0x19C,
+            MSR_MISC_ENABLE = 0x1A0,
+            MSR_ENERGY_PERF_BIAS = 0x1B0,
+            MSR_PACKAGE_THERM_STATUS = 0x1B1,
+            MSR_PACKAGE_THERM_INTERRUPT = 0x1B2,
+            MSR_DEBUGCTL = 0x1D9,
+            MSR_SMRR_PHYSBASE = 0x1F2,
+            MSR_SMRR_PHYSMASK = 0x1F3,
+            MSR_PLATFORM_DCA_CAP = 0x1F8,
+            MSR_CPU_DCA_CAP = 0x1F9,
+            MSR_DCA_0_CAP = 0x1FA,
+            MSR_MTRR_PHYSBASE0 = 0x200,
+            MSR_MTRR_PHYSMASK0 = 0x201,
+            MSR_MTRR_PHYSBASE1 = 0x202,
+            MSR_MTRR_PHYSMASK1 = 0x203,
+            MSR_MTRR_PHYSBASE2 = 0x204,
+            MSR_MTRR_PHYSMASK2 = 0x205,
+            MSR_MTRR_PHYSBASE3 = 0x206,
+            MSR_MTRR_PHYSMASK3 = 0x207,
+            MSR_MTRR_PHYSBASE4 = 0x208,
+            MSR_MTRR_PHYSMASK4 = 0x209,
+            MSR_MTRR_PHYSBASE5 = 0x20A,
+            MSR_MTRR_PHYSMASK5 = 0x20B,
+            MSR_MTRR_PHYSBASE6 = 0x20C,
+            MSR_MTRR_PHYSMASK6 = 0x20D,
+            MSR_MTRR_PHYSBASE7 = 0x20E,
+            MSR_MTRR_PHYSMASK7 = 0x20F,
+            MSR_MTRR_PHYSBASE8 = 0x210,
+            MSR_MTRR_PHYSMASK8 = 0x211,
+            MSR_MTRR_PHYSBASE9 = 0x212,
+            MSR_MTRR_PHYSMASK9 = 0x213,
+            MSR_MTRR_FIX64K_00000 = 0x250,
+            MSR_MTRR_FIX16K_80000 = 0x258,
+            MSR_MTRR_FIX16K_A0000 = 0x259,
+            MSR_MTRR_FIX4K_C0000 = 0x268,
+            MSR_MTRR_FIX4K_C8000 = 0x269,
+            MSR_MTRR_FIX4K_D0000 = 0x26A,
+            MSR_MTRR_FIX4K_D8000 = 0x26B,
+            MSR_MTRR_FIX4K_E0000 = 0x26C,
+            MSR_MTRR_FIX4K_E8000 = 0x26D,
+            MSR_MTRR_FIX4K_F0000 = 0x26E,
+            MSR_MTRR_FIX4K_F8000 = 0x26F,
+            MSR_PAT = 0x277,
+            MSR_MC0_CTL2 = 0x280,
+            MSR_MC1_CTL2 = 0x281,
+            MSR_MC2_CTL2 = 0x282,
+            MSR_MC3_CTL2 = 0x283,
+            MSR_MC4_CTL2 = 0x284,
+            MSR_MC5_CTL2 = 0x285,
+            MSR_MC6_CTL2 = 0x286,
+            MSR_MC7_CTL2 = 0x287,
+            MSR_MC8_CTL2 = 0x288,
+            MSR_MC9_CTL2 = 0x289,
+            MSR_MC10_CTL2 = 0x28A,
+            MSR_MC11_CTL2 = 0x28B,
+            MSR_MC12_CTL2 = 0x28C,
+            MSR_MC13_CTL2 = 0x28D,
+            MSR_MC14_CTL2 = 0x28E,
+            MSR_MC15_CTL2 = 0x28F,
+            MSR_MC16_CTL2 = 0x290,
+            MSR_MC17_CTL2 = 0x291,
+            MSR_MC18_CTL2 = 0x292,
+            MSR_MC19_CTL2 = 0x293,
+            MSR_MC20_CTL2 = 0x294,
+            MSR_MC21_CTL2 = 0x295,
+            MSR_MC22_CTL2 = 0x296,
+            MSR_MC23_CTL2 = 0x297,
+            MSR_MC24_CTL2 = 0x298,
+            MSR_MC25_CTL2 = 0x299,
+            MSR_MC26_CTL2 = 0x29A,
+            MSR_MC27_CTL2 = 0x29B,
+            MSR_MC28_CTL2 = 0x29C,
+            MSR_MC29_CTL2 = 0x29D,
+            MSR_MC30_CTL2 = 0x29E,
+            MSR_MC31_CTL2 = 0x29F,
+            MSR_MTRR_DEF_TYPE = 0x2FF,
+            MSR_FIXED_CTR0 = 0x309,
+            MSR_FIXED_CTR1 = 0x30A,
+            MSR_FIXED_CTR2 = 0x30B,
+            MSR_PERF_CAPABILITIES = 0x345,
+            MSR_FIXED_CTR_CTRL = 0x38D,
+            MSR_PERF_GLOBAL_STATUS = 0x38E,
+            MSR_PERF_GLOBAL_CTRL = 0x38F,
+            MSR_PERF_GLOBAL_STATUS_RESET = 0x390,
+            MSR_PERF_GLOBAL_STATUS_SET = 0x391,
+            MSR_PERF_GLOBAL_INUSE = 0x392,
+            MSR_PEBS_ENABLE = 0x3F1,
+            MSR_MC0_CTL = 0x400,
+            MSR_MC0_STATUS = 0x401,
+            MSR_MC0_ADDR = 0x402,
+            MSR_MC0_MISC = 0x403,
+            MSR_MC1_CTL = 0x404,
+            MSR_MC1_STATUS = 0x405,
+            MSR_MC1_ADDR = 0x406,
+            MSR_MC1_MISC = 0x407,
+            MSR_MC2_CTL = 0x408,
+            MSR_MC2_STATUS = 0x409,
+            MSR_MC2_ADDR = 0x40A,
+            MSR_MC2_MISC = 0x40B,
+            MSR_MC3_CTL = 0x40C,
+            MSR_MC3_STATUS = 0x40D,
+            MSR_MC3_ADDR = 0x40E,
+            MSR_MC3_MISC = 0x40F,
+            MSR_MC4_CTL = 0x410,
+            MSR_MC4_STATUS = 0x411,
+            MSR_MC4_ADDR = 0x412,
+            MSR_MC4_MISC = 0x413,
+            MSR_MC5_CTL = 0x414,
+            MSR_MC5_STATUS = 0x415,
+            MSR_MC5_ADDR = 0x416,
+            MSR_MC5_MISC = 0x417,
+            MSR_MC6_CTL = 0x418,
+            MSR_MC6_STATUS = 0x419,
+            MSR_MC6_ADDR = 0x41A,
+            MSR_MC6_MISC = 0x41B,
+            MSR_MC7_CTL = 0x41C,
+            MSR_MC7_STATUS = 0x41D,
+            MSR_MC7_ADDR = 0x41E,
+            MSR_MC7_MISC = 0x41F,
+            MSR_MC8_CTL = 0x420,
+            MSR_MC8_STATUS = 0x421,
+            MSR_MC8_ADDR = 0x422,
+            MSR_MC8_MISC = 0x423,
+            MSR_MC9_CTL = 0x424,
+            MSR_MC9_STATUS = 0x425,
+            MSR_MC9_ADDR = 0x426,
+            MSR_MC9_MISC = 0x427,
+            MSR_MC10_CTL = 0x428,
+            MSR_MC10_STATUS = 0x429,
+            MSR_MC10_ADDR = 0x42A,
+            MSR_MC10_MISC = 0x42B,
+            MSR_MC11_CTL = 0x42C,
+            MSR_MC11_STATUS = 0x42D,
+            MSR_MC11_ADDR = 0x42E,
+            MSR_MC11_MISC = 0x42F,
+            MSR_MC12_CTL = 0x430,
+            MSR_MC12_STATUS = 0x431,
+            MSR_MC12_ADDR = 0x432,
+            MSR_MC12_MISC = 0x433,
+            MSR_MC13_CTL = 0x434,
+            MSR_MC13_STATUS = 0x435,
+            MSR_MC13_ADDR = 0x436,
+            MSR_MC13_MISC = 0x437,
+            MSR_MC14_CTL = 0x438,
+            MSR_MC14_STATUS = 0x439,
+            MSR_MC14_ADDR = 0x43A,
+            MSR_MC14_MISC = 0x43B,
+            MSR_MC15_CTL = 0x43C,
+            MSR_MC15_STATUS = 0x43D,
+            MSR_MC15_ADDR = 0x43E,
+            MSR_MC15_MISC = 0x43F,
+            MSR_MC16_CTL = 0x440,
+            MSR_MC16_STATUS = 0x441,
+            MSR_MC16_ADDR = 0x442,
+            MSR_MC16_MISC = 0x443,
+            MSR_MC17_CTL = 0x444,
+            MSR_MC17_STATUS = 0x445,
+            MSR_MC17_ADDR = 0x446,
+            MSR_MC17_MISC = 0x447,
+            MSR_MC18_CTL = 0x448,
+            MSR_MC18_STATUS = 0x449,
+            MSR_MC18_ADDR = 0x44A,
+            MSR_MC18_MISC = 0x44B,
+            MSR_MC19_CTL = 0x44C,
+            MSR_MC19_STATUS = 0x44D,
+            MSR_MC19_ADDR = 0x44E,
+            MSR_MC19_MISC = 0x44F,
+            MSR_MC20_CTL = 0x450,
+            MSR_MC20_STATUS = 0x451,
+            MSR_MC20_ADDR = 0x452,
+            MSR_MC20_MISC = 0x453,
+            MSR_MC21_CTL = 0x454,
+            MSR_MC21_STATUS = 0x455,
+            MSR_MC21_ADDR = 0x456,
+            MSR_MC21_MISC = 0x457,
+            MSR_MC22_CTL = 0x458,
+            MSR_MC22_STATUS = 0x459,
+            MSR_MC22_ADDR = 0x45A,
+            MSR_MC22_MISC = 0x45B,
+            MSR_MC23_CTL = 0x45C,
+            MSR_MC23_STATUS = 0x45D,
+            MSR_MC23_ADDR = 0x45E,
+            MSR_MC23_MISC = 0x45F,
+            MSR_MC24_CTL = 0x460,
+            MSR_MC24_STATUS = 0x461,
+            MSR_MC24_ADDR = 0x462,
+            MSR_MC24_MISC = 0x463,
+            MSR_MC25_CTL = 0x464,
+            MSR_MC25_STATUS = 0x465,
+            MSR_MC25_ADDR = 0x466,
+            MSR_MC25_MISC = 0x467,
+            MSR_MC26_CTL = 0x468,
+            MSR_MC26_STATUS = 0x469,
+            MSR_MC26_ADDR = 0x46A,
+            MSR_MC26_MISC = 0x46B,
+            MSR_MC27_CTL = 0x46C,
+            MSR_MC27_STATUS = 0x46D,
+            MSR_MC27_ADDR = 0x46E,
+            MSR_MC27_MISC = 0x46F,
+            MSR_MC28_CTL = 0x470,
+            MSR_MC28_STATUS = 0x471,
+            MSR_MC28_ADDR = 0x472,
+            MSR_MC28_MISC = 0x473,
+            MSR_VMX_BASIC = 0x480,
+            MSR_VMX_PINBASED_CTLS = 0x481,
+            MSR_VMX_PROCBASED_CTLS = 0x482,
+            MSR_VMX_EXIT_CTLS = 0x483,
+            MSR_VMX_ENTRY_CTLS = 0x484,
+            MSR_VMX_MISC = 0x485,
+            MSR_VMX_CR0_FIXED0 = 0x486,
+            MSR_VMX_CR0_FIXED1 = 0x487,
+            MSR_VMX_CR4_FIXED0 = 0x488,
+            MSR_VMX_CR4_FIXED1 = 0x489,
+            MSR_VMX_VMCS_ENUM = 0x48A,
+            MSR_VMX_PROCBASED_CTLS2 = 0x48B,
+            MSR_VMX_EPT_VPID_CAP = 0x48C,
+            MSR_VMX_TRUE_PINBASED_CTLS = 0x48D,
+            MSR_VMX_TRUE_PROCBASED_CTLS = 0x48E,
+            MSR_VMX_TRUE_EXIT_CTLS = 0x48F,
+            MSR_VMX_TRUE_ENTRY_CTLS = 0x490,
+            MSR_VMX_VMFUNC = 0x491,
+            MSR_A_PMC0 = 0x4C1,
+            MSR_A_PMC1 = 0x4C2,
+            MSR_A_PMC2 = 0x4C3,
+            MSR_A_PMC3 = 0x4C4,
+            MSR_A_PMC4 = 0x4C5,
+            MSR_A_PMC5 = 0x4C6,
+            MSR_A_PMC6 = 0x4C7,
+            MSR_A_PMC7 = 0x4C8,
+            MSR_MCG_EXT_CTL = 0x4D0,
+            MSR_SGX_SVN_STATUS = 0x500,
+            MSR_RTIT_OUTPUT_BASE = 0x560,
+            MSR_RTIT_OUTPUT_MASK_PTRS = 0x561,
+            MSR_RTIT_CTL = 0x570,
+            MSR_RTIT_STATUS = 0x571,
+            MSR_RTIT_CR3_MATCH = 0x572,
+            MSR_RTIT_ADDR0_A = 0x580,
+            MSR_RTIT_ADDR0_B = 0x581,
+            MSR_RTIT_ADDR1_A = 0x582,
+            MSR_RTIT_ADDR1_B = 0x583,
+            MSR_RTIT_ADDR2_A = 0x584,
+            MSR_RTIT_ADDR2_B = 0x585,
+            MSR_RTIT_ADDR3_A = 0x586,
+            MSR_RTIT_ADDR3_B = 0x587,
+            MSR_DS_AREA = 0x600,
+            MSR_TSC_DEADLINE = 0x6E0,
+            MSR_PM_ENABLE = 0x770,
+            MSR_HWP_CAPABILITIES = 0x771,
+            MSR_HWP_REQUEST_PKG = 0x772,
+            MSR_HWP_INTERRUPT = 0x773,
+            MSR_HWP_REQUEST = 0x774,
+            MSR_HWP_STATUS = 0x777,
+            MSR_X2APIC_APICID = 0x802,
+            MSR_X2APIC_VERSION = 0x803,
+            MSR_X2APIC_TPR = 0x808,
+            MSR_X2APIC_PPR = 0x80A,
+            MSR_X2APIC_EOI = 0x80B,
+            MSR_X2APIC_LDR = 0x80D,
+            MSR_X2APIC_SIVR = 0x80F,
+            MSR_X2APIC_ISR0 = 0x810,
+            MSR_X2APIC_ISR1 = 0x811,
+            MSR_X2APIC_ISR2 = 0x812,
+            MSR_X2APIC_ISR3 = 0x813,
+            MSR_X2APIC_ISR4 = 0x814,
+            MSR_X2APIC_ISR5 = 0x815,
+            MSR_X2APIC_ISR6 = 0x816,
+            MSR_X2APIC_ISR7 = 0x817,
+            MSR_X2APIC_TMR0 = 0x818,
+            MSR_X2APIC_TMR1 = 0x819,
+            MSR_X2APIC_TMR2 = 0x81A,
+            MSR_X2APIC_TMR3 = 0x81B,
+            MSR_X2APIC_TMR4 = 0x81C,
+            MSR_X2APIC_TMR5 = 0x81D,
+            MSR_X2APIC_TMR6 = 0x81E,
+            MSR_X2APIC_TMR7 = 0x81F,
+            MSR_X2APIC_IRR0 = 0x820,
+            MSR_X2APIC_IRR1 = 0x821,
+            MSR_X2APIC_IRR2 = 0x822,
+            MSR_X2APIC_IRR3 = 0x823,
+            MSR_X2APIC_IRR4 = 0x824,
+            MSR_X2APIC_IRR5 = 0x825,
+            MSR_X2APIC_IRR6 = 0x826,
+            MSR_X2APIC_IRR7 = 0x827,
+            MSR_X2APIC_ESR = 0x828,
+            MSR_X2APIC_LVT_CMCI = 0x82F,
+            MSR_X2APIC_ICR = 0x830,
+            MSR_X2APIC_LVT_TIMER = 0x832,
+            MSR_X2APIC_LVT_THERMAL = 0x833,
+            MSR_X2APIC_LVT_PMI = 0x834,
+            MSR_X2APIC_LVT_LINT0 = 0x835,
+            MSR_X2APIC_LVT_LINT1 = 0x836,
+            MSR_X2APIC_LVT_ERROR = 0x837,
+            MSR_X2APIC_INIT_COUNT = 0x838,
+            MSR_X2APIC_CUR_COUNT = 0x839,
+            MSR_X2APIC_DIV_CONF = 0x83E,
+            MSR_X2APIC_SELF_IPI = 0x83F,
+            MSR_DEBUG_INTERFACE = 0xC80,
+            MSR_L3_QOS_CFG = 0xC81,
+            MSR_L2_QOS_CFG = 0xC82,
+            MSR_QM_EVTSEL = 0xC8D,
+            MSR_QM_CTR = 0xC8E,
+            MSR_PQR_ASSOC = 0xC8F,
+            MSR_L3_MASK_0 = 0xC90,
+            MSR_L2_MASK_0 = 0xD10,
+            MSR_BNDCFGS = 0xD90,
+            MSR_XSS = 0xDA0,
+            MSR_PKG_HDC_CTL = 0xDB0,
+            MSR_PM_CTL1 = 0xDB1,
+            MSR_THREAD_STALL = 0xDB2,
+            /** @brief Extended Feature Enable Register (0xc0000080) */
+            MSR_EFER = 0xC0000080,
+            /** @brief legacy SYSCALL (0xC0000081) */
+            MSR_STAR = 0xC0000081,
+            /** @brief 64bit SYSCALL (0xC0000082) */
+            MSR_LSTAR = 0xC0000082,
+            /** @brief compatibility mode SYSCALL (0xC0000083) */
+            MSR_CSTAR = 0xC0000083,
+            /** @brief EFLAGS mask for syscall (0xC0000084) */
+            MSR_SYSCALL_MASK = 0xC0000084,
+            /** @brief 64bit FS base (0xC0000100) */
+            MSR_FS_BASE = 0xC0000100,
+            /** @brief 64bit GS base (0xC0000101) */
+            MSR_GS_BASE = 0xC0000101,
+            /** @brief SwapGS GS shadow (0xC0000102) */
+            MSR_SHADOW_GS_BASE = 0xC0000102,
+            /** @brief Auxiliary TSC (0xC0000103) */
+            MSR_TSC_AUX = 0xC0000103,
+            MSR_CR_PAT = 0x00000277,
+        };
+
+#if defined(a32)
+        SafeFunction static inline uint64_t rdmsr(uint32_t msr)
+        {
+            uint32_t Low, High;
+            asmv("rdmsr"
+                 : "=a"(Low), "=d"(High)
+                 : "c"(msr)
+                 : "memory");
+            return ((uint64_t)Low) | (((uint64_t)High) << 32);
+        }
+
+        SafeFunction static inline void wrmsr(uint32_t msr, uint64_t Value)
+        {
+            uint32_t Low = Value, High = Value >> 32;
+            asmv("wrmsr"
+                 :
+                 : "c"(msr), "a"(Low), "d"(High)
+                 : "memory");
+        }
+#endif
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x32_MSR_H__
diff --git a/Kernel/include/cpu/x86/x64/cr.hpp b/Kernel/include/cpu/x86/x64/cr.hpp
new file mode 100644
index 00000000..5a8fb45d
--- /dev/null
+++ b/Kernel/include/cpu/x86/x64/cr.hpp
@@ -0,0 +1,294 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x64_CR_H__
+#define __FENNIX_KERNEL_CPU_x64_CR_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x64
+    {
+        typedef union CR0
+        {
+            struct
+            {
+                /** @brief Protection Enable */
+                uint64_t PE : 1;
+                /** @brief Monitor Coprocessor */
+                uint64_t MP : 1;
+                /** @brief Emulation */
+                uint64_t EM : 1;
+                /** @brief Task Switched */
+                uint64_t TS : 1;
+                /** @brief Extension Type */
+                uint64_t ET : 1;
+                /** @brief Numeric Error */
+                uint64_t NE : 1;
+                /** @brief Reserved */
+                uint64_t Reserved0 : 10;
+                /** @brief Write Protect */
+                uint64_t WP : 1;
+                /** @brief Reserved */
+                uint64_t Reserved1 : 1;
+                /** @brief Alignment Mask */
+                uint64_t AM : 1;
+                /** @brief Reserved */
+                uint64_t Reserved2 : 10;
+                /** @brief Not Write-through */
+                uint64_t NW : 1;
+                /** @brief Cache Disable */
+                uint64_t CD : 1;
+                /** @brief Paging */
+                uint64_t PG : 1;
+            };
+            uint64_t raw;
+        } CR0;
+
+        typedef union CR2
+        {
+            struct
+            {
+                /** @brief Page Fault Linear Address */
+                uint64_t PFLA;
+            };
+            uint64_t raw;
+        } CR2;
+
+        typedef union CR3
+        {
+            struct
+            {
+                /** @brief Not used if bit 17 of CR4 is 1 */
+                uint64_t PWT : 1;
+                /** @brief Not used if bit 17 of CR4 is 1 */
+                uint64_t PCD : 1;
+                /** @brief Base of PML4T/PML5T */
+                uint64_t PDBR;
+            };
+            uint64_t raw;
+        } CR3;
+
+        typedef union CR4
+        {
+            struct
+            {
+                /** @brief Virtual-8086 Mode Extensions */
+                uint64_t VME : 1;
+                /** @brief Protected-Mode Virtual Interrupts */
+                uint64_t PVI : 1;
+                /** @brief Time Stamp Disable */
+                uint64_t TSD : 1;
+                /** @brief Debugging Extensions */
+                uint64_t DE : 1;
+                /** @brief Page Size Extensions */
+                uint64_t PSE : 1;
+                /** @brief Physical Address Extension */
+                uint64_t PAE : 1;
+                /** @brief Machine Check Enable */
+                uint64_t MCE : 1;
+                /** @brief Page Global Enable */
+                uint64_t PGE : 1;
+                /** @brief Performance Monitoring Counter */
+                uint64_t PCE : 1;
+                /** @brief Operating System Support */
+                uint64_t OSFXSR : 1;
+                /** @brief Operating System Support */
+                uint64_t OSXMMEXCPT : 1;
+                /** @brief User-Mode Instruction Prevention */
+                uint64_t UMIP : 1;
+                /** @brief Linear Address 57bit */
+                uint64_t LA57 : 1;
+                /** @brief VMX Enable */
+                uint64_t VMXE : 1;
+                /** @brief SMX Enable */
+                uint64_t SMXE : 1;
+                /** @brief Reserved */
+                uint64_t Reserved0 : 1;
+                /** @brief FSGSBASE Enable */
+                uint64_t FSGSBASE : 1;
+                /** @brief PCID Enable */
+                uint64_t PCIDE : 1;
+                /** @brief XSAVE and Processor Extended States Enable */
+                uint64_t OSXSAVE : 1;
+                /** @brief Reserved */
+                uint64_t Reserved1 : 1;
+                /** @brief SMEP Enable */
+                uint64_t SMEP : 1;
+                /** @brief SMAP Enable */
+                uint64_t SMAP : 1;
+                /** @brief Protection-Key Enable */
+                uint64_t PKE : 1;
+                /** @brief Control-flow Enforcement Technology*/
+                uint32_t CET : 1;
+                /* @brief Enable Protection Keys for Supervisor Mode Pages */
+                uint32_t PKS : 1;
+                /** @brief Reserved */
+                uint64_t Reserved2 : 7; // TODO: This could be wrong
+            };
+            uint64_t raw;
+        } CR4;
+
+        typedef union CR8
+        {
+            struct
+            {
+                /** @brief Task Priority Level */
+                uint64_t TPL : 1;
+            };
+            uint64_t raw;
+        } CR8;
+
+        typedef union XCR0
+        {
+            /*
+            On https://wiki.osdev.org/CPU_Registers_x86#XCR0 says that the PKRU bit is 9?
+            */
+            struct
+            {
+                /** @brief X87 FPU/MMX/SSE Support (must be 1) */
+                uint64_t X87 : 1;
+                /** @brief XSAVE support for MXCSR and XMM registers */
+                uint64_t SSE : 1;
+                /** @brief AVX support for YMM registers */
+                uint64_t AVX : 1;
+                /** @brief MPX support for BND registers */
+                uint64_t BNDREG : 1;
+                /** @brief MPX support for BNDCFGU and BNDSTATUS registers */
+                uint64_t BNDCSR : 1;
+                /** @brief AVX-512 support for opmask registers */
+                uint64_t OpMask : 1;
+                /** @brief AVX-512 enabled and XSAVE support for upper halves of lower ZMM registers */
+                uint64_t ZMM_HI256 : 1;
+                /** @brief AVX-512 enabled and XSAVE support for upper ZMM registers */
+                uint64_t HI16_ZMM : 1;
+                /** @brief XSAVE support for PKRU register */
+                uint64_t PKRU : 1;
+                /** @brief Reserved */
+                uint64_t Reserved0 : 53;
+                /** @brief AMD lightweight profiling */
+                uint64_t LWP : 1;
+                /** @brief Reserved */
+                uint64_t Reserved1 : 1;
+            };
+            uint64_t raw;
+        } XCR0;
+
+#if defined(a64)
+        SafeFunction static inline CR0 readcr0()
+        {
+            uint64_t Result = 0;
+            asmv("mov %%cr0, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR0){.raw = Result};
+        }
+
+        SafeFunction static inline CR2 readcr2()
+        {
+            uint64_t Result = 0;
+            asmv("mov %%cr2, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR2){.raw = Result};
+        }
+
+        SafeFunction static inline CR3 readcr3()
+        {
+            uint64_t Result = 0;
+            asmv("mov %%cr3, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR3){.raw = Result};
+        }
+
+        SafeFunction static inline CR4 readcr4()
+        {
+            uint64_t Result = 0;
+            asmv("mov %%cr4, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR4){.raw = Result};
+        }
+
+        SafeFunction static inline CR8 readcr8()
+        {
+            uint64_t Result = 0;
+            asmv("mov %%cr8, %[Result]"
+                 : [Result] "=q"(Result));
+            return (CR8){.raw = Result};
+        }
+
+        SafeFunction static inline XCR0 readxcr0()
+        {
+            uint64_t Result = 0;
+            asmv("xgetbv"
+                 : "=a"(Result)
+                 : "c"(0)
+                 : "edx");
+            return (XCR0){.raw = Result};
+        }
+
+        SafeFunction static inline void writecr0(CR0 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr0"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr2(CR2 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr2"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr3(CR3 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr3"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr4(CR4 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr4"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writecr8(CR8 ControlRegister)
+        {
+            asmv("mov %[ControlRegister], %%cr8"
+                 :
+                 : [ControlRegister] "q"(ControlRegister.raw)
+                 : "memory");
+        }
+
+        SafeFunction static inline void writexcr0(XCR0 ControlRegister)
+        {
+            asmv("xsetbv"
+                 :
+                 : "a"(ControlRegister.raw), "c"(0)
+                 : "edx");
+        }
+#endif
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x64_CR_H__
diff --git a/Kernel/include/cpu/x86/x64/msr.hpp b/Kernel/include/cpu/x86/x64/msr.hpp
new file mode 100644
index 00000000..a078cc19
--- /dev/null
+++ b/Kernel/include/cpu/x86/x64/msr.hpp
@@ -0,0 +1,427 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CPU_x64_MSR_H__
+#define __FENNIX_KERNEL_CPU_x64_MSR_H__
+
+#include <types.h>
+
+namespace CPU
+{
+    namespace x64
+    {
+        enum MSRID
+        {
+            MSR_MONITOR_FILTER_SIZE = 0x6,
+            MSR_TIME_STAMP_COUNTER = 0x10,
+            MSR_PLATFORM_ID = 0x17,
+            MSR_APIC_BASE = 0x1B,
+            MSR_FEATURE_CONTROL = 0x3A,
+            MSR_TSC_ADJUST = 0x3B,
+            MSR_SPEC_CTRL = 0x48,
+            MSR_PRED_CMD = 0x49,
+            MSR_BIOS_UPDT_TRIG = 0x79,
+            MSR_BIOS_SIGN_ID = 0x8B,
+            MSR_SGXLEPUBKEYHASH0 = 0x8C,
+            MSR_SGXLEPUBKEYHASH1 = 0x8D,
+            MSR_SGXLEPUBKEYHASH2 = 0x8E,
+            MSR_SGXLEPUBKEYHASH3 = 0x8F,
+            MSR_SMM_MONITOR_CTL = 0x9B,
+            MSR_SMBASE = 0x9E,
+            MSR_PMC0 = 0xC1,
+            MSR_PMC1 = 0xC2,
+            MSR_PMC2 = 0xC3,
+            MSR_PMC3 = 0xC4,
+            MSR_PMC4 = 0xC5,
+            MSR_PMC5 = 0xC6,
+            MSR_PMC6 = 0xC7,
+            MSR_PMC7 = 0xC8,
+            MSR_UMWAIT_CONTROL = 0xE1,
+            MSR_MPERF = 0xE7,
+            MSR_APERF = 0xE8,
+            MSR_MTRRCAP = 0xFE,
+            MSR_ARCH_CAPABILITIES = 0x10A,
+            MSR_FLUSH_CMD = 0x10B,
+            MSR_SYSENTER_CS = 0x17A,
+            MSR_SYSENTER_ESP = 0x175,
+            MSR_SYSENTER_EIP = 0x176,
+            MSR_MCG_CAP = 0x179,
+            MSR_MCG_STATUS = 0x17A,
+            MSR_MCG_CTL = 0x17B,
+            MSR_PERFEVTSEL0 = 0x186,
+            MSR_PERFEVTSEL1 = 0x187,
+            MSR_PERFEVTSEL2 = 0x188,
+            MSR_PERFEVTSEL3 = 0x189,
+            MSR_PERF_STATUS = 0x198,
+            MSR_PERF_CTL = 0x199,
+            MSR_CLOCK_MODULATION = 0x19A,
+            MSR_THERM_INTERRUPT = 0x19B,
+            MSR_THERM_STATUS = 0x19C,
+            MSR_MISC_ENABLE = 0x1A0,
+            MSR_ENERGY_PERF_BIAS = 0x1B0,
+            MSR_PACKAGE_THERM_STATUS = 0x1B1,
+            MSR_PACKAGE_THERM_INTERRUPT = 0x1B2,
+            MSR_DEBUGCTL = 0x1D9,
+            MSR_SMRR_PHYSBASE = 0x1F2,
+            MSR_SMRR_PHYSMASK = 0x1F3,
+            MSR_PLATFORM_DCA_CAP = 0x1F8,
+            MSR_CPU_DCA_CAP = 0x1F9,
+            MSR_DCA_0_CAP = 0x1FA,
+            MSR_MTRR_PHYSBASE0 = 0x200,
+            MSR_MTRR_PHYSMASK0 = 0x201,
+            MSR_MTRR_PHYSBASE1 = 0x202,
+            MSR_MTRR_PHYSMASK1 = 0x203,
+            MSR_MTRR_PHYSBASE2 = 0x204,
+            MSR_MTRR_PHYSMASK2 = 0x205,
+            MSR_MTRR_PHYSBASE3 = 0x206,
+            MSR_MTRR_PHYSMASK3 = 0x207,
+            MSR_MTRR_PHYSBASE4 = 0x208,
+            MSR_MTRR_PHYSMASK4 = 0x209,
+            MSR_MTRR_PHYSBASE5 = 0x20A,
+            MSR_MTRR_PHYSMASK5 = 0x20B,
+            MSR_MTRR_PHYSBASE6 = 0x20C,
+            MSR_MTRR_PHYSMASK6 = 0x20D,
+            MSR_MTRR_PHYSBASE7 = 0x20E,
+            MSR_MTRR_PHYSMASK7 = 0x20F,
+            MSR_MTRR_PHYSBASE8 = 0x210,
+            MSR_MTRR_PHYSMASK8 = 0x211,
+            MSR_MTRR_PHYSBASE9 = 0x212,
+            MSR_MTRR_PHYSMASK9 = 0x213,
+            MSR_MTRR_FIX64K_00000 = 0x250,
+            MSR_MTRR_FIX16K_80000 = 0x258,
+            MSR_MTRR_FIX16K_A0000 = 0x259,
+            MSR_MTRR_FIX4K_C0000 = 0x268,
+            MSR_MTRR_FIX4K_C8000 = 0x269,
+            MSR_MTRR_FIX4K_D0000 = 0x26A,
+            MSR_MTRR_FIX4K_D8000 = 0x26B,
+            MSR_MTRR_FIX4K_E0000 = 0x26C,
+            MSR_MTRR_FIX4K_E8000 = 0x26D,
+            MSR_MTRR_FIX4K_F0000 = 0x26E,
+            MSR_MTRR_FIX4K_F8000 = 0x26F,
+            MSR_PAT = 0x277,
+            MSR_MC0_CTL2 = 0x280,
+            MSR_MC1_CTL2 = 0x281,
+            MSR_MC2_CTL2 = 0x282,
+            MSR_MC3_CTL2 = 0x283,
+            MSR_MC4_CTL2 = 0x284,
+            MSR_MC5_CTL2 = 0x285,
+            MSR_MC6_CTL2 = 0x286,
+            MSR_MC7_CTL2 = 0x287,
+            MSR_MC8_CTL2 = 0x288,
+            MSR_MC9_CTL2 = 0x289,
+            MSR_MC10_CTL2 = 0x28A,
+            MSR_MC11_CTL2 = 0x28B,
+            MSR_MC12_CTL2 = 0x28C,
+            MSR_MC13_CTL2 = 0x28D,
+            MSR_MC14_CTL2 = 0x28E,
+            MSR_MC15_CTL2 = 0x28F,
+            MSR_MC16_CTL2 = 0x290,
+            MSR_MC17_CTL2 = 0x291,
+            MSR_MC18_CTL2 = 0x292,
+            MSR_MC19_CTL2 = 0x293,
+            MSR_MC20_CTL2 = 0x294,
+            MSR_MC21_CTL2 = 0x295,
+            MSR_MC22_CTL2 = 0x296,
+            MSR_MC23_CTL2 = 0x297,
+            MSR_MC24_CTL2 = 0x298,
+            MSR_MC25_CTL2 = 0x299,
+            MSR_MC26_CTL2 = 0x29A,
+            MSR_MC27_CTL2 = 0x29B,
+            MSR_MC28_CTL2 = 0x29C,
+            MSR_MC29_CTL2 = 0x29D,
+            MSR_MC30_CTL2 = 0x29E,
+            MSR_MC31_CTL2 = 0x29F,
+            MSR_MTRR_DEF_TYPE = 0x2FF,
+            MSR_FIXED_CTR0 = 0x309,
+            MSR_FIXED_CTR1 = 0x30A,
+            MSR_FIXED_CTR2 = 0x30B,
+            MSR_PERF_CAPABILITIES = 0x345,
+            MSR_FIXED_CTR_CTRL = 0x38D,
+            MSR_PERF_GLOBAL_STATUS = 0x38E,
+            MSR_PERF_GLOBAL_CTRL = 0x38F,
+            MSR_PERF_GLOBAL_STATUS_RESET = 0x390,
+            MSR_PERF_GLOBAL_STATUS_SET = 0x391,
+            MSR_PERF_GLOBAL_INUSE = 0x392,
+            MSR_PEBS_ENABLE = 0x3F1,
+            MSR_MC0_CTL = 0x400,
+            MSR_MC0_STATUS = 0x401,
+            MSR_MC0_ADDR = 0x402,
+            MSR_MC0_MISC = 0x403,
+            MSR_MC1_CTL = 0x404,
+            MSR_MC1_STATUS = 0x405,
+            MSR_MC1_ADDR = 0x406,
+            MSR_MC1_MISC = 0x407,
+            MSR_MC2_CTL = 0x408,
+            MSR_MC2_STATUS = 0x409,
+            MSR_MC2_ADDR = 0x40A,
+            MSR_MC2_MISC = 0x40B,
+            MSR_MC3_CTL = 0x40C,
+            MSR_MC3_STATUS = 0x40D,
+            MSR_MC3_ADDR = 0x40E,
+            MSR_MC3_MISC = 0x40F,
+            MSR_MC4_CTL = 0x410,
+            MSR_MC4_STATUS = 0x411,
+            MSR_MC4_ADDR = 0x412,
+            MSR_MC4_MISC = 0x413,
+            MSR_MC5_CTL = 0x414,
+            MSR_MC5_STATUS = 0x415,
+            MSR_MC5_ADDR = 0x416,
+            MSR_MC5_MISC = 0x417,
+            MSR_MC6_CTL = 0x418,
+            MSR_MC6_STATUS = 0x419,
+            MSR_MC6_ADDR = 0x41A,
+            MSR_MC6_MISC = 0x41B,
+            MSR_MC7_CTL = 0x41C,
+            MSR_MC7_STATUS = 0x41D,
+            MSR_MC7_ADDR = 0x41E,
+            MSR_MC7_MISC = 0x41F,
+            MSR_MC8_CTL = 0x420,
+            MSR_MC8_STATUS = 0x421,
+            MSR_MC8_ADDR = 0x422,
+            MSR_MC8_MISC = 0x423,
+            MSR_MC9_CTL = 0x424,
+            MSR_MC9_STATUS = 0x425,
+            MSR_MC9_ADDR = 0x426,
+            MSR_MC9_MISC = 0x427,
+            MSR_MC10_CTL = 0x428,
+            MSR_MC10_STATUS = 0x429,
+            MSR_MC10_ADDR = 0x42A,
+            MSR_MC10_MISC = 0x42B,
+            MSR_MC11_CTL = 0x42C,
+            MSR_MC11_STATUS = 0x42D,
+            MSR_MC11_ADDR = 0x42E,
+            MSR_MC11_MISC = 0x42F,
+            MSR_MC12_CTL = 0x430,
+            MSR_MC12_STATUS = 0x431,
+            MSR_MC12_ADDR = 0x432,
+            MSR_MC12_MISC = 0x433,
+            MSR_MC13_CTL = 0x434,
+            MSR_MC13_STATUS = 0x435,
+            MSR_MC13_ADDR = 0x436,
+            MSR_MC13_MISC = 0x437,
+            MSR_MC14_CTL = 0x438,
+            MSR_MC14_STATUS = 0x439,
+            MSR_MC14_ADDR = 0x43A,
+            MSR_MC14_MISC = 0x43B,
+            MSR_MC15_CTL = 0x43C,
+            MSR_MC15_STATUS = 0x43D,
+            MSR_MC15_ADDR = 0x43E,
+            MSR_MC15_MISC = 0x43F,
+            MSR_MC16_CTL = 0x440,
+            MSR_MC16_STATUS = 0x441,
+            MSR_MC16_ADDR = 0x442,
+            MSR_MC16_MISC = 0x443,
+            MSR_MC17_CTL = 0x444,
+            MSR_MC17_STATUS = 0x445,
+            MSR_MC17_ADDR = 0x446,
+            MSR_MC17_MISC = 0x447,
+            MSR_MC18_CTL = 0x448,
+            MSR_MC18_STATUS = 0x449,
+            MSR_MC18_ADDR = 0x44A,
+            MSR_MC18_MISC = 0x44B,
+            MSR_MC19_CTL = 0x44C,
+            MSR_MC19_STATUS = 0x44D,
+            MSR_MC19_ADDR = 0x44E,
+            MSR_MC19_MISC = 0x44F,
+            MSR_MC20_CTL = 0x450,
+            MSR_MC20_STATUS = 0x451,
+            MSR_MC20_ADDR = 0x452,
+            MSR_MC20_MISC = 0x453,
+            MSR_MC21_CTL = 0x454,
+            MSR_MC21_STATUS = 0x455,
+            MSR_MC21_ADDR = 0x456,
+            MSR_MC21_MISC = 0x457,
+            MSR_MC22_CTL = 0x458,
+            MSR_MC22_STATUS = 0x459,
+            MSR_MC22_ADDR = 0x45A,
+            MSR_MC22_MISC = 0x45B,
+            MSR_MC23_CTL = 0x45C,
+            MSR_MC23_STATUS = 0x45D,
+            MSR_MC23_ADDR = 0x45E,
+            MSR_MC23_MISC = 0x45F,
+            MSR_MC24_CTL = 0x460,
+            MSR_MC24_STATUS = 0x461,
+            MSR_MC24_ADDR = 0x462,
+            MSR_MC24_MISC = 0x463,
+            MSR_MC25_CTL = 0x464,
+            MSR_MC25_STATUS = 0x465,
+            MSR_MC25_ADDR = 0x466,
+            MSR_MC25_MISC = 0x467,
+            MSR_MC26_CTL = 0x468,
+            MSR_MC26_STATUS = 0x469,
+            MSR_MC26_ADDR = 0x46A,
+            MSR_MC26_MISC = 0x46B,
+            MSR_MC27_CTL = 0x46C,
+            MSR_MC27_STATUS = 0x46D,
+            MSR_MC27_ADDR = 0x46E,
+            MSR_MC27_MISC = 0x46F,
+            MSR_MC28_CTL = 0x470,
+            MSR_MC28_STATUS = 0x471,
+            MSR_MC28_ADDR = 0x472,
+            MSR_MC28_MISC = 0x473,
+            MSR_VMX_BASIC = 0x480,
+            MSR_VMX_PINBASED_CTLS = 0x481,
+            MSR_VMX_PROCBASED_CTLS = 0x482,
+            MSR_VMX_EXIT_CTLS = 0x483,
+            MSR_VMX_ENTRY_CTLS = 0x484,
+            MSR_VMX_MISC = 0x485,
+            MSR_VMX_CR0_FIXED0 = 0x486,
+            MSR_VMX_CR0_FIXED1 = 0x487,
+            MSR_VMX_CR4_FIXED0 = 0x488,
+            MSR_VMX_CR4_FIXED1 = 0x489,
+            MSR_VMX_VMCS_ENUM = 0x48A,
+            MSR_VMX_PROCBASED_CTLS2 = 0x48B,
+            MSR_VMX_EPT_VPID_CAP = 0x48C,
+            MSR_VMX_TRUE_PINBASED_CTLS = 0x48D,
+            MSR_VMX_TRUE_PROCBASED_CTLS = 0x48E,
+            MSR_VMX_TRUE_EXIT_CTLS = 0x48F,
+            MSR_VMX_TRUE_ENTRY_CTLS = 0x490,
+            MSR_VMX_VMFUNC = 0x491,
+            MSR_A_PMC0 = 0x4C1,
+            MSR_A_PMC1 = 0x4C2,
+            MSR_A_PMC2 = 0x4C3,
+            MSR_A_PMC3 = 0x4C4,
+            MSR_A_PMC4 = 0x4C5,
+            MSR_A_PMC5 = 0x4C6,
+            MSR_A_PMC6 = 0x4C7,
+            MSR_A_PMC7 = 0x4C8,
+            MSR_MCG_EXT_CTL = 0x4D0,
+            MSR_SGX_SVN_STATUS = 0x500,
+            MSR_RTIT_OUTPUT_BASE = 0x560,
+            MSR_RTIT_OUTPUT_MASK_PTRS = 0x561,
+            MSR_RTIT_CTL = 0x570,
+            MSR_RTIT_STATUS = 0x571,
+            MSR_RTIT_CR3_MATCH = 0x572,
+            MSR_RTIT_ADDR0_A = 0x580,
+            MSR_RTIT_ADDR0_B = 0x581,
+            MSR_RTIT_ADDR1_A = 0x582,
+            MSR_RTIT_ADDR1_B = 0x583,
+            MSR_RTIT_ADDR2_A = 0x584,
+            MSR_RTIT_ADDR2_B = 0x585,
+            MSR_RTIT_ADDR3_A = 0x586,
+            MSR_RTIT_ADDR3_B = 0x587,
+            MSR_DS_AREA = 0x600,
+            MSR_TSC_DEADLINE = 0x6E0,
+            MSR_PM_ENABLE = 0x770,
+            MSR_HWP_CAPABILITIES = 0x771,
+            MSR_HWP_REQUEST_PKG = 0x772,
+            MSR_HWP_INTERRUPT = 0x773,
+            MSR_HWP_REQUEST = 0x774,
+            MSR_HWP_STATUS = 0x777,
+            MSR_X2APIC_APICID = 0x802,
+            MSR_X2APIC_VERSION = 0x803,
+            MSR_X2APIC_TPR = 0x808,
+            MSR_X2APIC_PPR = 0x80A,
+            MSR_X2APIC_EOI = 0x80B,
+            MSR_X2APIC_LDR = 0x80D,
+            MSR_X2APIC_SIVR = 0x80F,
+            MSR_X2APIC_ISR0 = 0x810,
+            MSR_X2APIC_ISR1 = 0x811,
+            MSR_X2APIC_ISR2 = 0x812,
+            MSR_X2APIC_ISR3 = 0x813,
+            MSR_X2APIC_ISR4 = 0x814,
+            MSR_X2APIC_ISR5 = 0x815,
+            MSR_X2APIC_ISR6 = 0x816,
+            MSR_X2APIC_ISR7 = 0x817,
+            MSR_X2APIC_TMR0 = 0x818,
+            MSR_X2APIC_TMR1 = 0x819,
+            MSR_X2APIC_TMR2 = 0x81A,
+            MSR_X2APIC_TMR3 = 0x81B,
+            MSR_X2APIC_TMR4 = 0x81C,
+            MSR_X2APIC_TMR5 = 0x81D,
+            MSR_X2APIC_TMR6 = 0x81E,
+            MSR_X2APIC_TMR7 = 0x81F,
+            MSR_X2APIC_IRR0 = 0x820,
+            MSR_X2APIC_IRR1 = 0x821,
+            MSR_X2APIC_IRR2 = 0x822,
+            MSR_X2APIC_IRR3 = 0x823,
+            MSR_X2APIC_IRR4 = 0x824,
+            MSR_X2APIC_IRR5 = 0x825,
+            MSR_X2APIC_IRR6 = 0x826,
+            MSR_X2APIC_IRR7 = 0x827,
+            MSR_X2APIC_ESR = 0x828,
+            MSR_X2APIC_LVT_CMCI = 0x82F,
+            MSR_X2APIC_ICR = 0x830,
+            MSR_X2APIC_LVT_TIMER = 0x832,
+            MSR_X2APIC_LVT_THERMAL = 0x833,
+            MSR_X2APIC_LVT_PMI = 0x834,
+            MSR_X2APIC_LVT_LINT0 = 0x835,
+            MSR_X2APIC_LVT_LINT1 = 0x836,
+            MSR_X2APIC_LVT_ERROR = 0x837,
+            MSR_X2APIC_INIT_COUNT = 0x838,
+            MSR_X2APIC_CUR_COUNT = 0x839,
+            MSR_X2APIC_DIV_CONF = 0x83E,
+            MSR_X2APIC_SELF_IPI = 0x83F,
+            MSR_DEBUG_INTERFACE = 0xC80,
+            MSR_L3_QOS_CFG = 0xC81,
+            MSR_L2_QOS_CFG = 0xC82,
+            MSR_QM_EVTSEL = 0xC8D,
+            MSR_QM_CTR = 0xC8E,
+            MSR_PQR_ASSOC = 0xC8F,
+            MSR_L3_MASK_0 = 0xC90,
+            MSR_L2_MASK_0 = 0xD10,
+            MSR_BNDCFGS = 0xD90,
+            MSR_XSS = 0xDA0,
+            MSR_PKG_HDC_CTL = 0xDB0,
+            MSR_PM_CTL1 = 0xDB1,
+            MSR_THREAD_STALL = 0xDB2,
+            /** @brief Extended Feature Enable Register (0xc0000080) */
+            MSR_EFER = 0xC0000080,
+            /** @brief legacy SYSCALL (0xC0000081) */
+            MSR_STAR = 0xC0000081,
+            /** @brief 64bit SYSCALL (0xC0000082) */
+            MSR_LSTAR = 0xC0000082,
+            /** @brief compatibility mode SYSCALL (0xC0000083) */
+            MSR_CSTAR = 0xC0000083,
+            /** @brief EFLAGS mask for syscall (0xC0000084) */
+            MSR_SYSCALL_MASK = 0xC0000084,
+            /** @brief 64bit FS base (0xC0000100) */
+            MSR_FS_BASE = 0xC0000100,
+            /** @brief 64bit GS base (0xC0000101) */
+            MSR_GS_BASE = 0xC0000101,
+            /** @brief SwapGS GS shadow (0xC0000102) */
+            MSR_SHADOW_GS_BASE = 0xC0000102,
+            /** @brief Auxiliary TSC (0xC0000103) */
+            MSR_TSC_AUX = 0xC0000103,
+            MSR_CR_PAT = 0x00000277,
+            MSR_CR_PAT_RESET = 0x0007040600070406ULL
+        };
+
+#if defined(a64)
+        SafeFunction static inline uint64_t rdmsr(uint32_t msr)
+        {
+            uint32_t Low, High;
+            asmv("rdmsr"
+                 : "=a"(Low), "=d"(High)
+                 : "c"(msr)
+                 : "memory");
+            return ((uint64_t)Low) | (((uint64_t)High) << 32);
+        }
+
+        SafeFunction static inline void wrmsr(uint32_t msr, uint64_t Value)
+        {
+            uint32_t Low = s_cst(uint32_t, Value), High = s_cst(uint32_t, Value >> 32);
+            asmv("wrmsr"
+                 :
+                 : "c"(msr), "a"(Low), "d"(High)
+                 : "memory");
+        }
+#endif
+    }
+}
+
+#endif // !__FENNIX_KERNEL_CPU_x64_MSR_H__
diff --git a/Kernel/include/crc32.h b/Kernel/include/crc32.h
new file mode 100644
index 00000000..23d6c692
--- /dev/null
+++ b/Kernel/include/crc32.h
@@ -0,0 +1,25 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_CRC32_H__
+#define __FENNIX_KERNEL_CRC32_H__
+
+#include <types.h>
+
+EXTERNC uint32_t crc32(const uint8_t *Buffer, int Length);
+
+#endif // !__FENNIX_KERNEL_CRC32_H__
diff --git a/Kernel/include/cwalk.h b/Kernel/include/cwalk.h
new file mode 100644
index 00000000..463db649
--- /dev/null
+++ b/Kernel/include/cwalk.h
@@ -0,0 +1,521 @@
+/*
+MIT License
+
+Copyright (c) 2020 Leonard Iklé
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+
+#pragma once
+
+#ifndef CWK_LIBRARY_H
+#define CWK_LIBRARY_H
+
+#include <types.h>
+
+#if defined(_WIN32) || defined(__CYGWIN__)
+#define CWK_EXPORT __declspec(dllexport)
+#define CWK_IMPORT __declspec(dllimport)
+#elif __GNUC__ >= 4
+#define CWK_EXPORT __attribute__((visibility("default")))
+#define CWK_IMPORT __attribute__((visibility("default")))
+#else
+#define CWK_EXPORT
+#define CWK_IMPORT
+#endif
+
+#if defined(CWK_SHARED)
+#if defined(CWK_EXPORTS)
+#define CWK_PUBLIC CWK_EXPORT
+#else
+#define CWK_PUBLIC CWK_IMPORT
+#endif
+#else
+#define CWK_PUBLIC
+#endif
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+/**
+ * A segment represents a single component of a path. For instance, on linux a
+ * path might look like this "/var/log/", which consists of two segments "var"
+ * and "log".
+ */
+struct cwk_segment
+{
+  const char *path;
+  const char *segments;
+  const char *begin;
+  const char *end;
+  size_t size;
+};
+
+/**
+ * The segment type can be used to identify whether a segment is a special
+ * segment or not.
+ *
+ * CWK_NORMAL - normal folder or file segment
+ * CWK_CURRENT - "./" current folder segment
+ * CWK_BACK - "../" relative back navigation segment
+ */
+enum cwk_segment_type
+{
+  CWK_NORMAL,
+  CWK_CURRENT,
+  CWK_BACK
+};
+
+/**
+ * @brief Determines the style which is used for the path parsing and
+ * generation.
+ */
+enum cwk_path_style
+{
+  CWK_STYLE_WINDOWS,
+  CWK_STYLE_UNIX
+};
+
+/**
+ * @brief Generates an absolute path based on a base.
+ *
+ * This function generates an absolute path based on a base path and another
+ * path. It is guaranteed to return an absolute path. If the second submitted
+ * path is absolute, it will override the base path. The result will be
+ * written to a buffer, which might be truncated if the buffer is not large
+ * enough to hold the full path. However, the truncated result will always be
+ * null-terminated. The returned value is the amount of characters which the
+ * resulting path would take if it was not truncated (excluding the
+ * null-terminating character).
+ *
+ * @param base The absolute base path on which the relative path will be
+ * applied.
+ * @param path The relative path which will be applied on the base path.
+ * @param buffer The buffer where the result will be written to.
+ * @param buffer_size The size of the result buffer.
+ * @return Returns the total amount of characters of the new absolute path.
+ */
+CWK_PUBLIC size_t cwk_path_get_absolute(const char *base, const char *path,
+  char *buffer, size_t buffer_size);
+
+/**
+ * @brief Generates a relative path based on a base.
+ *
+ * This function generates a relative path based on a base path and another
+ * path. It determines how to get to the submitted path, starting from the
+ * base directory. The result will be written to a buffer, which might be
+ * truncated if the buffer is not large enough to hold the full path. However,
+ * the truncated result will always be null-terminated. The returned value is
+ * the amount of characters which the resulting path would take if it was not
+ * truncated (excluding the null-terminating character).
+ *
+ * @param base_directory The base path from which the relative path will
+ * start.
+ * @param path The target path where the relative path will point to.
+ * @param buffer The buffer where the result will be written to.
+ * @param buffer_size The size of the result buffer.
+ * @return Returns the total amount of characters of the full path.
+ */
+CWK_PUBLIC size_t cwk_path_get_relative(const char *base_directory,
+  const char *path, char *buffer, size_t buffer_size);
+
+/**
+ * @brief Joins two paths together.
+ *
+ * This function generates a new path by combining the two submitted paths. It
+ * will remove double separators, and unlike cwk_path_get_absolute it permits
+ * the use of two relative paths to combine. The result will be written to a
+ * buffer, which might be truncated if the buffer is not large enough to hold
+ * the full path. However, the truncated result will always be
+ * null-terminated. The returned value is the amount of characters which the
+ * resulting path would take if it was not truncated (excluding the
+ * null-terminating character).
+ *
+ * @param path_a The first path which comes first.
+ * @param path_b The second path which comes after the first.
+ * @param buffer The buffer where the result will be written to.
+ * @param buffer_size The size of the result buffer.
+ * @return Returns the total amount of characters of the full, combined path.
+ */
+CWK_PUBLIC size_t cwk_path_join(const char *path_a, const char *path_b,
+  char *buffer, size_t buffer_size);
+
+/**
+ * @brief Joins multiple paths together.
+ *
+ * This function generates a new path by joining multiple paths together. It
+ * will remove double separators, and unlike cwk_path_get_absolute it permits
+ * the use of multiple relative paths to combine. The last path of the
+ * submitted string array must be set to NULL. The result will be written to a
+ * buffer, which might be truncated if the buffer is not large enough to hold
+ * the full path. However, the truncated result will always be
+ * null-terminated. The returned value is the amount of characters which the
+ * resulting path would take if it was not truncated (excluding the
+ * null-terminating character).
+ *
+ * @param paths An array of paths which will be joined.
+ * @param buffer The buffer where the result will be written to.
+ * @param buffer_size The size of the result buffer.
+ * @return Returns the total amount of characters of the full, combined path.
+ */
+CWK_PUBLIC size_t cwk_path_join_multiple(const char **paths, char *buffer,
+  size_t buffer_size);
+
+/**
+ * @brief Determines the root of a path.
+ *
+ * This function determines the root of a path by finding its length. The
+ * root always starts at the submitted path. If the path has no root, the
+ * length will be set to zero.
+ *
+ * @param path The path which will be inspected.
+ * @param length The output of the root length.
+ */
+CWK_PUBLIC void cwk_path_get_root(const char *path, size_t *length);
+
+/**
+ * @brief Changes the root of a path.
+ *
+ * This function changes the root of a path. It does not normalize the result.
+ * The result will be written to a buffer, which might be truncated if the
+ * buffer is not large enough to hold the full path. However, the truncated
+ * result will always be null-terminated. The returned value is the amount of
+ * characters which the resulting path would take if it was not truncated
+ * (excluding the null-terminating character).
+ *
+ * @param path The original path which will get a new root.
+ * @param new_root The new root which will be placed in the path.
+ * @param buffer The output buffer where the result is written to.
+ * @param buffer_size The size of the output buffer where the result is
+ * written to.
+ * @return Returns the total amount of characters of the new path.
+ */
+CWK_PUBLIC size_t cwk_path_change_root(const char *path, const char *new_root,
+  char *buffer, size_t buffer_size);
+
+/**
+ * @brief Determine whether the path is absolute or not.
+ *
+ * This function checks whether the path is an absolute path or not. A path is
+ * considered to be absolute if the root ends with a separator.
+ *
+ * @param path The path which will be checked.
+ * @return Returns true if the path is absolute or false otherwise.
+ */
+CWK_PUBLIC bool cwk_path_is_absolute(const char *path);
+
+/**
+ * @brief Determine whether the path is relative or not.
+ *
+ * This function checks whether the path is a relative path or not. A path is
+ * considered to be relative if the root does not end with a separator.
+ *
+ * @param path The path which will be checked.
+ * @return Returns true if the path is relative or false otherwise.
+ */
+CWK_PUBLIC bool cwk_path_is_relative(const char *path);
+
+/**
+ * @brief Gets the basename of a file path.
+ *
+ * This function gets the basename of a file path. A pointer to the beginning
+ * of the basename will be returned through the basename parameter. This
+ * pointer will be positioned on the first letter after the separator. The
+ * length of the file path will be returned through the length parameter. The
+ * length will be set to zero and the basename to NULL if there is no basename
+ * available.
+ *
+ * @param path The path which will be inspected.
+ * @param basename The output of the basename pointer.
+ * @param length The output of the length of the basename. This may be
+ * null if not required.
+ */
+CWK_PUBLIC void cwk_path_get_basename(const char *path, const char **basename,
+  size_t *length);
+
+/**
+ * @brief Changes the basename of a file path.
+ *
+ * This function changes the basename of a file path. This function will not
+ * write out more than the specified buffer can contain. However, the
+ * generated string is always null-terminated - even if not the whole path is
+ * written out. The function returns the total number of characters the
+ * complete buffer would have, even if it was not written out completely. The
+ * path may be the same memory address as the buffer.
+ *
+ * @param path The original path which will be used for the modified path.
+ * @param new_basename The new basename which will replace the old one.
+ * @param buffer The buffer where the changed path will be written to.
+ * @param buffer_size The size of the result buffer where the changed path is
+ * written to.
+ * @return Returns the size which the complete new path would have if it was
+ * not truncated.
+ */
+CWK_PUBLIC size_t cwk_path_change_basename(const char *path,
+  const char *new_basename, char *buffer, size_t buffer_size);
+
+/**
+ * @brief Gets the dirname of a file path.
+ *
+ * This function determines the dirname of a file path and returns the length
+ * up to which character is considered to be part of it. If no dirname is
+ * found, the length will be set to zero. The beginning of the dirname is
+ * always equal to the submitted path pointer.
+ *
+ * @param path The path which will be inspected.
+ * @param length The length of the dirname.
+ */
+CWK_PUBLIC void cwk_path_get_dirname(const char *path, size_t *length);
+
+/**
+ * @brief Gets the extension of a file path.
+ *
+ * This function extracts the extension portion of a file path. A pointer to
+ * the beginning of the extension will be returned through the extension
+ * parameter if an extension is found and true is returned. This pointer will
+ * be positioned on the dot. The length of the extension name will be returned
+ * through the length parameter. If no extension is found both parameters
+ * won't be touched and false will be returned.
+ *
+ * @param path The path which will be inspected.
+ * @param extension The output of the extension pointer.
+ * @param length The output of the length of the extension.
+ * @return Returns true if an extension is found or false otherwise.
+ */
+CWK_PUBLIC bool cwk_path_get_extension(const char *path, const char **extension,
+  size_t *length);
+
+/**
+ * @brief Determines whether the file path has an extension.
+ *
+ * This function determines whether the submitted file path has an extension.
+ * This will evaluate to true if the last segment of the path contains a dot.
+ *
+ * @param path The path which will be inspected.
+ * @return Returns true if the path has an extension or false otherwise.
+ */
+CWK_PUBLIC bool cwk_path_has_extension(const char *path);
+
+/**
+ * @brief Changes the extension of a file path.
+ *
+ * This function changes the extension of a file name. The function will
+ * append an extension if the basename does not have an extension, or use the
+ * extension as a basename if the path does not have a basename. This function
+ * will not write out more than the specified buffer can contain. However, the
+ * generated string is always null-terminated - even if not the whole path is
+ * written out. The function returns the total number of characters the
+ * complete buffer would have, even if it was not written out completely. The
+ * path may be the same memory address as the buffer.
+ *
+ * @param path The path which will be used to make the change.
+ * @param new_extension The extension which will be placed within the new
+ * path.
+ * @param buffer The output buffer where the result will be written to.
+ * @param buffer_size The size of the output buffer where the result will be
+ * written to.
+ * @return Returns the total size which the output would have if it was not
+ * truncated.
+ */
+CWK_PUBLIC size_t cwk_path_change_extension(const char *path,
+  const char *new_extension, char *buffer, size_t buffer_size);
+
+/**
+ * @brief Creates a normalized version of the path.
+ *
+ * This function creates a normalized version of the path within the specified
+ * buffer. This function will not write out more than the specified buffer can
+ * contain. However, the generated string is always null-terminated - even if
+ * not the whole path is written out. The function returns the total number of
+ * characters the complete buffer would have, even if it was not written out
+ * completely. The path may be the same memory address as the buffer.
+ *
+ * The following will be true for the normalized path:
+ * 1) "../" will be resolved.
+ * 2) "./" will be removed.
+ * 3) double separators will be fixed with a single separator.
+ * 4) separator suffixes will be removed.
+ *
+ * @param path The path which will be normalized.
+ * @param buffer The buffer where the new path is written to.
+ * @param buffer_size The size of the buffer.
+ * @return The size which the complete normalized path has if it was not
+ * truncated.
+ */
+CWK_PUBLIC size_t cwk_path_normalize(const char *path, char *buffer,
+  size_t buffer_size);
+
+/**
+ * @brief Finds common portions in two paths.
+ *
+ * This function finds common portions in two paths and returns the number
+ * characters from the beginning of the base path which are equal to the other
+ * path.
+ *
+ * @param path_base The base path which will be compared with the other path.
+ * @param path_other The other path which will compared with the base path.
+ * @return Returns the number of characters which are common in the base path.
+ */
+CWK_PUBLIC size_t cwk_path_get_intersection(const char *path_base,
+  const char *path_other);
+
+/**
+ * @brief Gets the first segment of a path.
+ *
+ * This function finds the first segment of a path. The position of the
+ * segment is set to the first character after the separator, and the length
+ * counts all characters until the next separator (excluding the separator).
+ *
+ * @param path The path which will be inspected.
+ * @param segment The segment which will be extracted.
+ * @return Returns true if there is a segment or false if there is none.
+ */
+CWK_PUBLIC bool cwk_path_get_first_segment(const char *path,
+  struct cwk_segment *segment);
+
+/**
+ * @brief Gets the last segment of the path.
+ *
+ * This function gets the last segment of a path. This function may return
+ * false if the path doesn't contain any segments, in which case the submitted
+ * segment parameter is not modified. The position of the segment is set to
+ * the first character after the separator, and the length counts all
+ * characters until the end of the path (excluding the separator).
+ *
+ * @param path The path which will be inspected.
+ * @param segment The segment which will be extracted.
+ * @return Returns true if there is a segment or false if there is none.
+ */
+CWK_PUBLIC bool cwk_path_get_last_segment(const char *path,
+  struct cwk_segment *segment);
+
+/**
+ * @brief Advances to the next segment.
+ *
+ * This function advances the current segment to the next segment. If there
+ * are no more segments left, the submitted segment structure will stay
+ * unchanged and false is returned.
+ *
+ * @param segment The current segment which will be advanced to the next one.
+ * @return Returns true if another segment was found or false otherwise.
+ */
+CWK_PUBLIC bool cwk_path_get_next_segment(struct cwk_segment *segment);
+
+/**
+ * @brief Moves to the previous segment.
+ *
+ * This function moves the current segment to the previous segment. If the
+ * current segment is the first one, the submitted segment structure will stay
+ * unchanged and false is returned.
+ *
+ * @param segment The current segment which will be moved to the previous one.
+ * @return Returns true if there is a segment before this one or false
+ * otherwise.
+ */
+CWK_PUBLIC bool cwk_path_get_previous_segment(struct cwk_segment *segment);
+
+/**
+ * @brief Gets the type of the submitted path segment.
+ *
+ * This function inspects the contents of the segment and determines the type
+ * of it. Currently, there are three types CWK_NORMAL, CWK_CURRENT and
+ * CWK_BACK. A CWK_NORMAL segment is a normal folder or file entry. A
+ * CWK_CURRENT is a "./" and a CWK_BACK a "../" segment.
+ *
+ * @param segment The segment which will be inspected.
+ * @return Returns the type of the segment.
+ */
+CWK_PUBLIC enum cwk_segment_type cwk_path_get_segment_type(
+  const struct cwk_segment *segment);
+
+/**
+ * @brief Changes the content of a segment.
+ *
+ * This function overrides the content of a segment to the submitted value and
+ * outputs the whole new path to the submitted buffer. The result might
+ * require less or more space than before if the new value length differs from
+ * the original length. The output is truncated if the new path is larger than
+ * the submitted buffer size, but it is always null-terminated. The source of
+ * the segment and the submitted buffer may be the same.
+ *
+ * @param segment The segment which will be modifier.
+ * @param value The new content of the segment.
+ * @param buffer The buffer where the modified path will be written to.
+ * @param buffer_size The size of the output buffer.
+ * @return Returns the total size which would have been written if the output
+ * was not truncated.
+ */
+CWK_PUBLIC size_t cwk_path_change_segment(struct cwk_segment *segment,
+  const char *value, char *buffer, size_t buffer_size);
+
+/**
+ * @brief Checks whether the submitted pointer points to a separator.
+ *
+ * This function simply checks whether the submitted pointer points to a
+ * separator, which has to be null-terminated (but not necessarily after the
+ * separator). The function will return true if it is a separator, or false
+ * otherwise.
+ *
+ * @param symbol A pointer to a string.
+ * @return Returns true if it is a separator, or false otherwise.
+ */
+CWK_PUBLIC bool cwk_path_is_separator(const char *str);
+
+/**
+ * @brief Guesses the path style.
+ *
+ * This function guesses the path style based on a submitted path-string. The
+ * guessing will look at the root and the type of slashes contained in the
+ * path and return the style which is more likely used in the path.
+ *
+ * @param path The path which will be inspected.
+ * @return Returns the style which is most likely used for the path.
+ */
+CWK_PUBLIC enum cwk_path_style cwk_path_guess_style(const char *path);
+
+/**
+ * @brief Configures which path style is used.
+ *
+ * This function configures which path style is used. The following styles are
+ * currently supported.
+ *
+ * CWK_STYLE_WINDOWS: Use backslashes as a separator and volume for the root.
+ * CWK_STYLE_UNIX: Use slashes as a separator and a slash for the root.
+ *
+ * @param style The style which will be used from now on.
+ */
+CWK_PUBLIC void cwk_path_set_style(enum cwk_path_style style);
+
+/**
+ * @brief Gets the path style configuration.
+ *
+ * This function gets the style configuration which is currently used for the
+ * paths. This configuration determines how paths are parsed and generated.
+ *
+ * @return Returns the current path style configuration.
+ */
+CWK_PUBLIC enum cwk_path_style cwk_path_get_style(void);
+
+#ifdef __cplusplus
+} // extern "C"
+#endif
+
+#endif
\ No newline at end of file
diff --git a/Kernel/include/debug.h b/Kernel/include/debug.h
new file mode 100644
index 00000000..8309e956
--- /dev/null
+++ b/Kernel/include/debug.h
@@ -0,0 +1,106 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DEBUGGER_H__
+#define __FENNIX_KERNEL_DEBUGGER_H__
+
+#include <types.h>
+
+enum DebugLevel
+{
+    DebugLevelNone = 0,
+    DebugLevelError = 1,
+    DebugLevelWarning = 2,
+    DebugLevelInfo = 3,
+    DebugLevelDebug = 4,
+    DebugLevelTrace = 5,
+    DebugLevelFixme = 6,
+    DebugLevelUbsan = 7
+};
+
+#ifdef __cplusplus
+
+namespace SysDbg
+{
+    void Write(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+    void WriteLine(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+    void LockedWrite(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+    void LockedWriteLine(DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+}
+
+#define error(Format, ...) SysDbg::WriteLine(DebugLevelError, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define warn(Format, ...) SysDbg::WriteLine(DebugLevelWarning, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define info(Format, ...) SysDbg::WriteLine(DebugLevelInfo, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#ifdef DEBUG
+#define debug(Format, ...) SysDbg::WriteLine(DebugLevelDebug, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define ubsan(Format, ...) SysDbg::WriteLine(DebugLevelUbsan, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#else
+#define debug(Format, ...)
+#define ubsan(Format, ...)
+#endif
+#define trace(Format, ...) SysDbg::WriteLine(DebugLevelTrace, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define fixme(Format, ...) SysDbg::WriteLine(DebugLevelFixme, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+
+#define locked_error(Format, ...) SysDbg::LockedWriteLine(DebugLevelError, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_warn(Format, ...) SysDbg::LockedWriteLine(DebugLevelWarning, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_info(Format, ...) SysDbg::LockedWriteLine(DebugLevelInfo, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#ifdef DEBUG
+#define locked_debug(Format, ...) SysDbg::LockedWriteLine(DebugLevelDebug, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_ubsan(Format, ...) SysDbg::LockedWriteLine(DebugLevelUbsan, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#else
+#define locked_debug(Format, ...)
+#define locked_ubsan(Format, ...)
+#endif
+#define locked_trace(Format, ...) SysDbg::LockedWriteLine(DebugLevelTrace, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_fixme(Format, ...) SysDbg::LockedWriteLine(DebugLevelFixme, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+
+#else
+
+void SysDbgWrite(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+void SysDbgWriteLine(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+void SysDbgLockedWrite(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+void SysDbgLockedWriteLine(enum DebugLevel Level, const char *File, int Line, const char *Function, const char *Format, ...);
+
+#define error(Format, ...) SysDbgWriteLine(DebugLevelError, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define warn(Format, ...) SysDbgWriteLine(DebugLevelWarning, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define info(Format, ...) SysDbgWriteLine(DebugLevelInfo, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#ifdef DEBUG
+#define debug(Format, ...) SysDbgWriteLine(DebugLevelDebug, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define ubsan(Format, ...) SysDbgWriteLine(DebugLevelUbsan, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#else
+#define debug(Format, ...)
+#define ubsan(Format, ...)
+#endif
+#define trace(Format, ...) SysDbgWriteLine(DebugLevelTrace, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define fixme(Format, ...) SysDbgWriteLine(DebugLevelFixme, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+
+#define locked_error(Format, ...) SysDbgLockedWriteLine(DebugLevelError, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_warn(Format, ...) SysDbgLockedWriteLine(DebugLevelWarning, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_info(Format, ...) SysDbgLockedWriteLine(DebugLevelInfo, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#ifdef DEBUG
+#define locked_debug(Format, ...) SysDbgLockedWriteLine(DebugLevelDebug, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_ubsan(Format, ...) SysDbgLockedWriteLine(DebugLevelUbsan, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#else
+#define locked_debug(Format, ...)
+#define locked_ubsan(Format, ...)
+#endif
+#define locked_trace(Format, ...) SysDbgLockedWriteLine(DebugLevelTrace, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+#define locked_fixme(Format, ...) SysDbgLockedWriteLine(DebugLevelFixme, __FILE__, __LINE__, __FUNCTION__, Format, ##__VA_ARGS__)
+
+#endif // __cplusplus
+
+#endif // !__FENNIX_KERNEL_DEBUGGER_H__
diff --git a/Kernel/include/disk.hpp b/Kernel/include/disk.hpp
new file mode 100644
index 00000000..8bdfb943
--- /dev/null
+++ b/Kernel/include/disk.hpp
@@ -0,0 +1,182 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DISK_H__
+#define __FENNIX_KERNEL_DISK_H__
+
+#include <types.h>
+#include <vector>
+
+namespace Disk
+{
+#define MBR_MAGIC0 0x55
+#define MBR_MAGIC1 0xAA
+
+// "EFI PART"
+#define GPT_MAGIC 0x5452415020494645ULL
+
+    enum PartitionStyle
+    {
+        Unknown,
+        MBR,
+        GPT
+    };
+
+    enum PartitionFlags
+    {
+        Present,
+        Bootable,
+        EFISystemPartition
+    };
+
+    struct MasterBootRecordPartition
+    {
+        uint8_t Flags;
+        uint8_t CHSFirst[3];
+        uint8_t Type;
+        uint8_t CHSLast[3];
+        uint32_t LBAFirst;
+        uint32_t Sectors;
+    } __packed;
+
+    struct MasterBootRecord
+    {
+        uint8_t Bootstrap[440];
+        uint32_t UniqueID;
+        uint16_t Reserved;
+        MasterBootRecordPartition Partitions[4];
+        uint8_t Signature[2];
+    } __packed;
+
+    struct GUIDPartitionTablePartition
+    {
+        uint64_t TypeLow;
+        uint64_t TypeHigh;
+        uint64_t GUIDLow;
+        uint64_t GUIDHigh;
+        uint64_t StartLBA;
+        uint64_t EndLBA;
+        uint64_t Attributes;
+        char Label[72];
+    } __packed;
+
+    struct GUIDPartitionTable
+    {
+        uint64_t Signature;
+        uint32_t Revision;
+        uint32_t HdrSize;
+        uint32_t HdrCRC32;
+        uint32_t Reserved;
+        uint64_t LBA;
+        uint64_t ALTLBA;
+        uint64_t FirstBlock;
+        uint64_t LastBlock;
+        uint64_t GUIDLow;
+        uint64_t GUIDHigh;
+        uint64_t PartLBA;
+        uint32_t PartCount;
+        uint32_t EntrySize;
+        uint32_t PartCRC32;
+    } __packed;
+
+    struct PartitionTable
+    {
+        MasterBootRecord MBR;
+        GUIDPartitionTable GPT;
+    };
+
+    class Partition
+    {
+    public:
+        char Label[72] = "Unidentified Partition";
+        size_t StartLBA = 0xdeadbeef;
+        size_t EndLBA = 0xdeadbeef;
+        size_t Sectors = 0xdeadbeef;
+        size_t Flags = 0xdeadbeef;
+        unsigned char Port = 0;
+        PartitionStyle Style = PartitionStyle::Unknown;
+        size_t Index = 0;
+
+        size_t Read(size_t Offset, size_t Count, uint8_t *Buffer)
+        {
+            return 0;
+            UNUSED(Offset);
+            UNUSED(Count);
+            UNUSED(Buffer);
+        }
+
+        size_t Write(size_t Offset, size_t Count, uint8_t *Buffer)
+        {
+            return 0;
+            UNUSED(Offset);
+            UNUSED(Count);
+            UNUSED(Buffer);
+        }
+
+        Partition() {}
+        ~Partition() {}
+    };
+
+    class Drive
+    {
+    public:
+        char Name[64] = "Unidentified Drive";
+        uint8_t *Buffer = nullptr;
+        PartitionTable Table;
+        PartitionStyle Style = PartitionStyle::Unknown;
+        std::vector<Partition> Partitions;
+        bool MechanicalDisk = false;
+        size_t UniqueIdentifier = 0xdeadbeef;
+
+        size_t Read(size_t Offset, size_t Count, uint8_t *Buffer)
+        {
+            return 0;
+            UNUSED(Offset);
+            UNUSED(Count);
+            UNUSED(Buffer);
+        }
+
+        size_t Write(size_t Offset, size_t Count, uint8_t *Buffer)
+        {
+            return 0;
+            UNUSED(Offset);
+            UNUSED(Count);
+            UNUSED(Buffer);
+        }
+
+        Drive()
+        { // TODO: Allocate buffer
+        }
+        ~Drive() {}
+    };
+
+    class Manager
+    {
+    private:
+        unsigned char AvailablePorts = 0;
+        int BytesPerSector = 0;
+
+        std::vector<Drive> drives;
+
+    public:
+        void FetchDisks(unsigned long DriverUID);
+        Manager();
+        ~Manager();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_DISK_H__
diff --git a/Kernel/include/display.hpp b/Kernel/include/display.hpp
new file mode 100644
index 00000000..64c0b71c
--- /dev/null
+++ b/Kernel/include/display.hpp
@@ -0,0 +1,165 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DISPLAY_H__
+#define __FENNIX_KERNEL_DISPLAY_H__
+
+#include <types.h>
+
+#include <boot/binfo.h>
+#include <memory.hpp>
+#include <debug.h>
+#include <cstring>
+
+namespace Video
+{
+#define PSF1_MAGIC0 0x36
+#define PSF1_MAGIC1 0x04
+
+#define PSF2_MAGIC0 0x72
+#define PSF2_MAGIC1 0xb5
+#define PSF2_MAGIC2 0x4a
+#define PSF2_MAGIC3 0x86
+
+    struct PSF1_HEADER
+    {
+        uint8_t magic[2];
+        uint8_t mode;
+        uint8_t charsize;
+    };
+
+    struct PSF2_HEADER
+    {
+        uint8_t magic[4];
+        uint32_t version;
+        uint32_t headersize;
+        uint32_t flags;
+        uint32_t length;
+        uint32_t charsize;
+        uint32_t height, width;
+    };
+
+    typedef struct _PSF1_FONT
+    {
+        PSF1_HEADER *Header;
+        void *GlyphBuffer;
+    } PSF1_FONT;
+
+    typedef struct _PSF2_FONT
+    {
+        PSF2_HEADER *Header;
+        void *GlyphBuffer;
+    } PSF2_FONT;
+
+    enum FontType
+    {
+        None,
+        PCScreenFont1,
+        PCScreenFont2
+    };
+
+    struct FontInfo
+    {
+        uintptr_t *StartAddress;
+        uintptr_t *EndAddress;
+        PSF1_FONT *PSF1Font;
+        PSF2_FONT *PSF2Font;
+        uint32_t Width, Height;
+        FontType Type;
+    };
+
+    class Font
+    {
+    private:
+        FontInfo Info;
+
+    public:
+        FontInfo GetInfo() { return Info; }
+        Font(uintptr_t *Start, uintptr_t *End, FontType Type);
+        ~Font();
+    };
+
+    struct ScreenBuffer
+    {
+        void *Buffer = nullptr;
+        uint32_t Width, Height;
+        size_t Size;
+        uint32_t Color;
+        uint32_t CursorX, CursorY;
+        char Brightness;
+        bool DoNotScroll;
+        long Checksum;
+    };
+
+    class Display
+    {
+    private:
+        BootInfo::FramebufferInfo framebuffer;
+        Font *CurrentFont = nullptr;
+        ScreenBuffer Buffers[256];
+        bool ColorIteration = false;
+        int ColorPickerIteration = 0;
+
+    public:
+        Font *GetCurrentFont();
+        void SetCurrentFont(Font *Font);
+        uint16_t GetBitsPerPixel();
+        uint64_t GetPitch();
+
+        /**
+         * @brief Create a new buffer
+         *
+         * This function creates a new buffer.
+         * 
+         * For @see Width and @see Height. Both values must be greater than 0.
+         *
+         * @note Some indexes are reserved for the kernel.
+         * 0 - Main buffer
+         * 1 - Loading screen buffer
+         * 200 - GUI buffer
+         * 250 - Empty (crash screen)
+         * 251 - Console (crash screen)
+         * 252 - Tasks (crash screen)
+         * 253 - Frames (crash screen)
+         * 254 - Details (crash screen)
+         * 255 - Main (crash screen)
+         *
+         * @param Width The width of the buffer
+         * @param Height The height of the buffer
+         * @param Index The index of the buffer (0-255)
+         */
+        void CreateBuffer(uint32_t Width, uint32_t Height, int Index);
+        void SetBuffer(int Index);
+        ScreenBuffer *GetBuffer(int Index);
+        void ClearBuffer(int Index);
+        void DeleteBuffer(int Index);
+        void SetBrightness(int Value, int Index);
+        void SetBufferCursor(int Index, uint32_t X, uint32_t Y);
+        void GetBufferCursor(int Index, uint32_t *X, uint32_t *Y);
+        void SetPixel(uint32_t X, uint32_t Y, uint32_t Color, int Index);
+        uint32_t GetPixel(uint32_t X, uint32_t Y, int Index);
+        void Scroll(int Index, int Lines);
+        void SetDoNotScroll(bool Value, int Index);
+
+        char Print(char Char, int Index, bool WriteToUART = false);
+        void DrawString(const char *String, uint32_t X, uint32_t Y, int Index, bool WriteToUART = false);
+        Display(BootInfo::FramebufferInfo Info, bool LoadDefaultFont = true);
+        ~Display();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_DISPLAY_H__
diff --git a/Kernel/include/driver.hpp b/Kernel/include/driver.hpp
new file mode 100644
index 00000000..d75cfb50
--- /dev/null
+++ b/Kernel/include/driver.hpp
@@ -0,0 +1,142 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DRIVER_H__
+#define __FENNIX_KERNEL_DRIVER_H__
+
+#include <types.h>
+
+#include <memory.hpp>
+#include <ints.hpp>
+#include <debug.h>
+#include <cpu.hpp>
+#include <pci.hpp>
+#include <vector>
+
+namespace Driver
+{
+    enum DriverCode
+    {
+        ERROR,
+        OK,
+        NOT_AVAILABLE,
+        INVALID_FEX_HEADER,
+        INVALID_DRIVER_DATA,
+        NOT_DRIVER,
+        NOT_IMPLEMENTED,
+        DRIVER_RETURNED_ERROR,
+        UNKNOWN_DRIVER_TYPE,
+        PCI_DEVICE_NOT_FOUND,
+        DRIVER_CONFLICT
+    };
+
+    class DriverInterruptHook;
+    struct DriverFile
+    {
+        bool Enabled = false;
+        unsigned long DriverUID = 0;
+        void *Address = nullptr;
+        void *InterruptCallback = nullptr;
+        Memory::MemMgr *MemTrk = nullptr;
+        DriverInterruptHook *InterruptHook[16]{};
+
+        bool operator==(const DriverFile &Other) const
+        {
+            return DriverUID == Other.DriverUID;
+        }
+    };
+
+    class DriverInterruptHook : public Interrupts::Handler
+    {
+    private:
+        DriverFile Handle;
+        bool Enabled = true;
+
+#if defined(a64)
+        void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+#elif defined(a32)
+        void OnInterruptReceived(CPU::x32::TrapFrame *Frame);
+#elif defined(aa64)
+        void OnInterruptReceived(CPU::aarch64::TrapFrame *Frame);
+#endif
+
+    public:
+        void Enable() { Enabled = true; }
+        void Disable() { Enabled = false; }
+        bool IsEnabled() { return Enabled; }
+        DriverInterruptHook(int Interrupt, DriverFile Handle);
+        virtual ~DriverInterruptHook() = default;
+    };
+
+    class Driver
+    {
+    private:
+        std::vector<DriverFile> Drivers;
+        unsigned long DriverUIDs = 0;
+        DriverCode CallDriverEntryPoint(void *fex, void *KAPIAddress);
+
+        void MapPCIAddresses(PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCIGeneric(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCIDisplay(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCINetwork(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCIStorage(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCIFileSystem(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCIInput(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode BindPCIAudio(Memory::MemMgr *mem, void *fex, PCI::PCIDeviceHeader *PCIDevice);
+        DriverCode DriverLoadBindPCI(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf = false);
+
+        DriverCode BindInterruptGeneric(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInterruptDisplay(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInterruptNetwork(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInterruptStorage(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInterruptFileSystem(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInterruptInput(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInterruptAudio(Memory::MemMgr *mem, void *fex);
+        DriverCode DriverLoadBindInterrupt(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf = false);
+
+        DriverCode BindInputGeneric(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInputDisplay(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInputNetwork(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInputStorage(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInputFileSystem(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInputInput(Memory::MemMgr *mem, void *fex);
+        DriverCode BindInputAudio(Memory::MemMgr *mem, void *fex);
+        DriverCode DriverLoadBindInput(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf = false);
+
+        DriverCode BindProcessGeneric(Memory::MemMgr *mem, void *fex);
+        DriverCode BindProcessDisplay(Memory::MemMgr *mem, void *fex);
+        DriverCode BindProcessNetwork(Memory::MemMgr *mem, void *fex);
+        DriverCode BindProcessStorage(Memory::MemMgr *mem, void *fex);
+        DriverCode BindProcessFileSystem(Memory::MemMgr *mem, void *fex);
+        DriverCode BindProcessInput(Memory::MemMgr *mem, void *fex);
+        DriverCode BindProcessAudio(Memory::MemMgr *mem, void *fex);
+        DriverCode DriverLoadBindProcess(void *DrvExtHdr, uintptr_t DriverAddress, size_t Size, bool IsElf = false);
+
+    public:
+        std::vector<DriverFile> GetDrivers() { return Drivers; }
+        void Panic();
+        void UnloadAllDrivers();
+        bool UnloadDriver(unsigned long DUID);
+        int IOCB(unsigned long DUID, /* KernelCallback */ void *KCB);
+        DriverCode LoadDriver(uintptr_t DriverAddress, size_t Size);
+        DriverCode StartDrivers();
+        Driver();
+        ~Driver();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_DRIVER_H__
diff --git a/Kernel/include/dumper.hpp b/Kernel/include/dumper.hpp
new file mode 100644
index 00000000..58a0e381
--- /dev/null
+++ b/Kernel/include/dumper.hpp
@@ -0,0 +1,25 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_LIB_DUMPER_H__
+#define __FENNIX_LIB_DUMPER_H__
+
+#include <types.h>
+
+void DumpData(const char *Description, void *Address, unsigned long Length);
+
+#endif // !__FENNIX_LIB_DUMPER_H__
diff --git a/Kernel/include/elf.h b/Kernel/include/elf.h
new file mode 100644
index 00000000..0451c683
--- /dev/null
+++ b/Kernel/include/elf.h
@@ -0,0 +1,494 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ELF_H__
+#define __FENNIX_KERNEL_ELF_H__
+
+#include <types.h>
+
+// https://wiki.osdev.org/ELF_Tutorial
+// https://github.com/torvalds/linux/blob/master/include/uapi/linux/elf.h
+
+/* 32-bit ELF base types. */
+typedef uint32_t Elf32_Addr;
+typedef uint16_t Elf32_Half;
+typedef uint32_t Elf32_Off;
+typedef int32_t Elf32_Sword;
+typedef uint32_t Elf32_Word;
+
+/* 64-bit ELF base types. */
+typedef uint64_t Elf64_Addr;
+typedef uint16_t Elf64_Half;
+typedef int16_t Elf64_SHalf;
+typedef uint64_t Elf64_Off;
+typedef int32_t Elf64_Sword;
+typedef uint32_t Elf64_Word;
+typedef uint64_t Elf64_Xword;
+typedef int64_t Elf64_Sxword;
+
+#define EI_NIDENT 16
+
+typedef struct elf32_hdr
+{
+    unsigned char e_ident[EI_NIDENT]; /* ELF "magic number" */
+    Elf32_Half e_type;
+    Elf32_Half e_machine;
+    Elf32_Word e_version;
+    Elf32_Addr e_entry; /* Entry point virtual address */
+    Elf32_Off e_phoff;  /* Program header table file offset */
+    Elf32_Off e_shoff;  /* Section header table file offset */
+    Elf32_Word e_flags;
+    Elf32_Half e_ehsize;
+    Elf32_Half e_phentsize;
+    Elf32_Half e_phnum;
+    Elf32_Half e_shentsize;
+    Elf32_Half e_shnum;
+    Elf32_Half e_shstrndx;
+} Elf32_Ehdr;
+
+typedef struct elf64_hdr
+{
+    unsigned char e_ident[EI_NIDENT]; /* ELF "magic number" */
+    Elf64_Half e_type;
+    Elf64_Half e_machine;
+    Elf64_Word e_version;
+    Elf64_Addr e_entry; /* Entry point virtual address */
+    Elf64_Off e_phoff;  /* Program header table file offset */
+    Elf64_Off e_shoff;  /* Section header table file offset */
+    Elf64_Word e_flags;
+    Elf64_Half e_ehsize;
+    Elf64_Half e_phentsize;
+    Elf64_Half e_phnum;
+    Elf64_Half e_shentsize;
+    Elf64_Half e_shnum;
+    Elf64_Half e_shstrndx;
+} Elf64_Ehdr;
+
+typedef struct elf32_shdr
+{
+    Elf32_Word sh_name;
+    Elf32_Word sh_type;
+    Elf32_Word sh_flags;
+    Elf32_Addr sh_addr;
+    Elf32_Off sh_offset;
+    Elf32_Word sh_size;
+    Elf32_Word sh_link;
+    Elf32_Word sh_info;
+    Elf32_Word sh_addralign;
+    Elf32_Word sh_entsize;
+} Elf32_Shdr;
+
+typedef struct elf64_shdr
+{
+    Elf64_Word sh_name;       /* Section name, index in string tbl */
+    Elf64_Word sh_type;       /* Type of section */
+    Elf64_Xword sh_flags;     /* Miscellaneous section attributes */
+    Elf64_Addr sh_addr;       /* Section virtual addr at execution */
+    Elf64_Off sh_offset;      /* Section file offset */
+    Elf64_Xword sh_size;      /* Size of section in bytes */
+    Elf64_Word sh_link;       /* Index of another section */
+    Elf64_Word sh_info;       /* Additional section information */
+    Elf64_Xword sh_addralign; /* Section alignment */
+    Elf64_Xword sh_entsize;   /* Entry size if section holds table */
+} Elf64_Shdr;
+
+typedef struct
+{
+    Elf32_Word p_type;
+    Elf32_Off p_offset;
+    Elf32_Addr p_vaddr;
+    Elf32_Addr p_paddr;
+    Elf32_Word p_filesz;
+    Elf32_Word p_memsz;
+    Elf32_Word p_flags;
+    Elf32_Word p_align;
+} Elf32_Phdr;
+
+typedef struct
+{
+    Elf64_Word p_type;
+    Elf64_Word p_flags;
+    Elf64_Off p_offset;
+    Elf64_Addr p_vaddr;
+    Elf64_Addr p_paddr;
+    Elf64_Xword p_filesz;
+    Elf64_Xword p_memsz;
+    Elf64_Xword p_align;
+} Elf64_Phdr;
+
+typedef struct elf32_rel
+{
+    Elf32_Addr r_offset;
+    Elf32_Word r_info;
+} Elf32_Rel;
+
+typedef struct elf64_rel
+{
+    Elf64_Addr r_offset; /* Location at which to apply the action */
+    Elf64_Xword r_info;  /* index and type of relocation */
+} Elf64_Rel;
+
+typedef struct elf32_sym
+{
+    Elf32_Word st_name;
+    Elf32_Addr st_value;
+    Elf32_Word st_size;
+    unsigned char st_info;
+    unsigned char st_other;
+    Elf32_Half st_shndx;
+} Elf32_Sym;
+
+typedef struct elf64_sym
+{
+    Elf64_Word st_name;     /* Symbol name, index in string tbl */
+    unsigned char st_info;  /* Type and binding attributes */
+    unsigned char st_other; /* No defined meaning, 0 */
+    Elf64_Half st_shndx;    /* Associated section index */
+    Elf64_Addr st_value;    /* Value of the symbol */
+    Elf64_Xword st_size;    /* Associated symbol size */
+} Elf64_Sym;
+
+struct Elf32_Dyn
+{
+    Elf32_Sword d_tag; /* Type of dynamic table entry. */
+    union
+    {
+        Elf32_Word d_val; /* Integer value of entry. */
+        Elf32_Addr d_ptr; /* Pointer value of entry. */
+    } d_un;
+};
+
+struct Elf64_Dyn
+{
+    Elf64_Sxword d_tag; /* Type of dynamic table entry. */
+    union
+    {
+        Elf64_Xword d_val; /* Integer value of entry. */
+        Elf64_Addr d_ptr;  /* Pointer value of entry. */
+    } d_un;
+};
+
+typedef struct
+{
+    Elf64_Addr r_offset;
+    Elf64_Xword r_info;
+    Elf64_Sxword r_addend;
+} Elf64_Rela;
+
+enum Elf_Ident
+{
+    EI_MAG0 = 0,       // 0x7F
+    EI_MAG1 = 1,       // 'E'
+    EI_MAG2 = 2,       // 'L'
+    EI_MAG3 = 3,       // 'F'
+    EI_CLASS = 4,      // Architecture (32/64)
+    EI_DATA = 5,       // Byte Order
+    EI_VERSION = 6,    // ELF Version
+    EI_OSABI = 7,      // OS Specific
+    EI_ABIVERSION = 8, // OS Specific
+    EI_PAD = 9         // Padding
+};
+
+enum Elf_OSABI
+{
+    ELFOSABI_NONE = 0,
+    ELFOSABI_HPUX = 1,
+    ELFOSABI_NETBSD = 2,
+    ELFOSABI_LINUX = 3,
+    ELFOSABI_HURD = 4,
+    ELFOSABI_SOLARIS = 6,
+    ELFOSABI_AIX = 7,
+    ELFOSABI_IRIX = 8,
+    ELFOSABI_FREEBSD = 9,
+    ELFOSABI_TRU64 = 10,
+    ELFOSABI_MODESTO = 11,
+    ELFOSABI_OPENBSD = 12,
+    ELFOSABI_OPENVMS = 13,
+    ELFOSABI_NSK = 14,
+    ELFOSABI_AROS = 15,
+    ELFOSABI_FENIXOS = 16,
+    ELFOSABI_CLOUDABI = 17,
+    ELFOSABI_OPENVOS = 18,
+    ELFOSABI_C6000_ELFABI = 64,
+    ELFOSABI_C6000_LINUX = 65,
+    ELFOSABI_ARM = 97,
+    ELFOSABI_STANDALONE = 255
+};
+
+enum Elf_Type
+{
+    ET_NONE = 0,        // Unknown Type
+    ET_REL = 1,         // Relocatable File
+    ET_EXEC = 2,        // Executable File
+    ET_DYN = 3,         // Shared Object File
+    ET_CORE = 4,        // Core File
+    ET_LOPROC = 0xff00, // Processor Specific
+    ET_HIPROC = 0xffff  // Processor Specific
+};
+
+enum RtT_Types
+{
+    R_386_NONE = 0, // No relocation
+    R_386_32 = 1,   // Symbol + Offset
+    R_386_PC32 = 2, // Symbol + Offset - Section Offset
+
+    R_X86_64_NONE = 0,
+    R_X86_64_64 = 1,
+    R_X86_64_PC32 = 2,
+    R_X86_64_GOT32 = 3,
+    R_X86_64_PLT32 = 4,
+    R_X86_64_COPY = 5,
+    R_X86_64_GLOB_DAT = 6,
+    R_X86_64_JUMP_SLOT = 7,
+    R_X86_64_RELATIVE = 8,
+    R_X86_64_GOTPCREL = 9,
+    R_X86_64_32 = 10,
+    R_X86_64_32S = 11,
+    R_X86_64_16 = 12,
+};
+
+enum ProgFlags_Types
+{
+    PF_X = 1,
+    PF_W = 2,
+    PF_R = 4
+};
+
+enum StT_Bindings
+{
+    /**
+     * @brief Local symbol. Symbol is not visible outside the object file.
+     */
+    STB_LOCAL = 0,
+    /**
+     * @brief Global symbol. These symbols are visible to all object files being combined.
+     */
+    STB_GLOBAL = 1,
+    /**
+     * @brief Weak symbols. These symbols are like global symbols, but their definitions are not required. Weak symbols are not visible outside the object file containing their definition.
+     */
+    STB_WEAK = 2,
+    /**
+     * @brief Values in this inclusive range are reserved for operating system-specific semantics.
+     */
+    STB_LOOS = 10,
+    /**
+     * @brief Values in this inclusive range are reserved for operating system-specific semantics.
+     */
+    STB_HIOS = 12,
+    /**
+     * @brief Values in this inclusive range are reserved for processor-specific semantics.
+     */
+    STB_LOPROC = 13,
+    /**
+     * @brief Values in this inclusive range are reserved for processor-specific semantics.
+     */
+    STB_HIPROC = 15
+};
+
+enum StT_Types
+{
+    STT_NOTYPE = 0, // No type
+    STT_OBJECT = 1, // Variables, arrays, etc.
+    STT_FUNC = 2    // Methods or functions
+};
+
+enum SegmentTypes
+{
+    PT_NULL = 0,
+    PT_LOAD = 1,
+    PT_DYNAMIC = 2,
+    PT_INTERP = 3,
+    PT_NOTE = 4,
+    PT_SHLIB = 5,
+    PT_PHDR = 6,
+    PT_TLS = 7,
+    PT_LOSUNW = 0x6ffffffa,
+    PT_SUNWBSS = 0x6ffffffb,
+    PT_SUNWSTACK = 0x6ffffffa,
+    PT_HISUNW = 0x6fffffff,
+    PT_LOPROC = 0x70000000,
+    PT_HIPROC = 0x7fffffff
+};
+
+/* https://docs.oracle.com/cd/E19683-01/817-3677/chapter6-42444/index.html */
+enum DynamicArrayTags
+{
+    DT_NULL = 0,
+    DT_NEEDED = 1,
+    DT_PLTRELSZ = 2,
+    DT_PLTGOT = 3,
+    DT_HASH = 4,
+    DT_STRTAB = 5,
+    DT_SYMTAB = 6,
+    DT_RELA = 7,
+    DT_RELASZ = 8,
+    DT_RELAENT = 9,
+    DT_STRSZ = 10,
+    DT_SYMENT = 11,
+    DT_INIT = 12,
+    DT_FINI = 13,
+    DT_SONAME = 14,
+    DT_RPATH = 15,
+    DT_SYMBOLIC = 16,
+    DT_REL = 17,
+    DT_RELSZ = 18,
+    DT_RELENT = 19,
+    DT_PLTREL = 20,
+    DT_DEBUG = 21,
+    DT_TEXTREL = 22,
+    DT_JMPREL = 23,
+    DT_BIND_NOW = 24,
+    DT_INIT_ARRAY = 25,
+    DT_FINI_ARRAY = 26,
+    DT_INIT_ARRAYSZ = 27,
+    DT_FINI_ARRAYSZ = 28,
+    DT_RUNPATH = 29,
+    DT_FLAGS = 30,
+    DT_ENCODING = 32,
+    DT_PREINIT_ARRAY = 32,
+    DT_PREINIT_ARRAYSZ = 33,
+    DT_LOOS = 0x6000000d,
+    DT_SUNW_RTLDINF = 0x6000000e,
+    DT_HIOS = 0x6ffff000,
+    DT_VALRNGLO = 0x6ffffd00,
+    DT_CHECKSUM = 0x6ffffdf8,
+    DT_PLTPADSZ = 0x6ffffdf9,
+    DT_MOVEENT = 0x6ffffdfa,
+    DT_MOVESZ = 0x6ffffdfb,
+    DT_FEATURE_1 = 0x6ffffdfc,
+    DT_POSFLAG_1 = 0x6ffffdfd,
+    DT_SYMINSZ = 0x6ffffdfe,
+    DT_SYMINENT = 0x6ffffdff,
+    DT_VALRNGHI = 0x6ffffdff,
+    DT_ADDRRNGLO = 0x6ffffe00,
+    DT_CONFIG = 0x6ffffefa,
+    DT_DEPAUDIT = 0x6ffffefb,
+    DT_AUDIT = 0x6ffffefc,
+    DT_PLTPAD = 0x6ffffefd,
+    DT_MOVETAB = 0x6ffffefe,
+    DT_SYMINFO = 0x6ffffeff,
+    DT_ADDRRNGHI = 0x6ffffeff,
+    DT_RELACOUNT = 0x6ffffff9,
+    DT_RELCOUNT = 0x6ffffffa,
+    DT_FLAGS_1 = 0x6ffffffb,
+    DT_VERDEF = 0x6ffffffc,
+    DT_VERDEFNUM = 0x6ffffffd,
+    DT_VERNEED = 0x6ffffffe,
+    DT_VERNEEDNUM = 0x6fffffff,
+    DT_LOPROC = 0x70000000,
+    DT_SPARC_REGISTER = 0x70000001,
+    DT_AUXILIARY = 0x7ffffffd,
+    DT_USED = 0x7ffffffe,
+    DT_FILTER = 0x7fffffff,
+    DT_HIPROC = 0x7fffffff
+};
+
+// used for Elf64_Sym st_info
+#define ELF32_ST_BIND(info) ((info) >> 4)
+#define ELF32_ST_TYPE(info) ((info)&0xf)
+#define ELF32_ST_INFO(bind, type) (((bind) << 4) + ((type)&0xf))
+#define ELF64_ST_BIND(info) ((info) >> 4)
+#define ELF64_ST_TYPE(info) ((info)&0xf)
+#define ELF64_ST_INFO(bind, type) (((bind) << 4) + ((type)&0xf))
+
+// used for Elf64_Sym st_other
+#define ELF32_ST_VISIBILITY(o) ((o)&0x3)
+#define ELF64_ST_VISIBILITY(o) ((o)&0x3)
+
+#define DO_386_32(S, A) ((S) + (A))
+#define DO_386_PC32(S, A, P) ((S) + (A) - (P))
+
+#define DO_64_64(S, A) ((S) + (A))
+#define DO_64_PC32(S, A, P) ((S) + (A) - (P))
+
+#define ELF32_R_SYM(i) ((i) >> 8)
+#define ELF32_R_TYPE(i) ((unsigned char)(i))
+#define ELF32_R_INFO(s, t) (((s) << 8) + (unsigned char)(t))
+
+#define ELF64_R_SYM(i) ((i) >> 32)
+#define ELF64_R_TYPE(i) ((i)&0xffffffffL)
+#define ELF64_R_INFO(s, t) (((s) << 32) + ((t)&0xffffffffL))
+
+#define SHN_UNDEF 0
+#define SHN_ABS 0xfff1
+
+#define SHT_NOBITS 8
+#define SHT_REL 9
+
+#define SHF_WRITE 0x1
+#define SHF_ALLOC 0x2
+
+#define EM_386 0x3      // x86 Machine Type
+#define EM_X86_64 0x3E  // 64bit
+#define EM_ARM 0x28     // ARM
+#define EM_AARCH64 0xb7 // ARM64
+
+#define EV_CURRENT 0x1 // ELF Current Version
+
+#define ELFMAG0 0x7F // e_ident[EI_MAG0]
+#define ELFMAG1 'E'  // e_ident[EI_MAG1]
+#define ELFMAG2 'L'  // e_ident[EI_MAG2]
+#define ELFMAG3 'F'  // e_ident[EI_MAG3]
+
+#define ELFDATANONE 0 /* e_ident[EI_DATA] */
+#define ELFDATA2LSB 1
+#define ELFDATA2MSB 2
+
+#define ELFCLASSNONE 0 /* EI_CLASS */
+#define ELFCLASS32 1
+#define ELFCLASS64 2
+#define ELFCLASSNUM 3
+
+#define SHT_NULL 0                    /* Section header table entry unused */
+#define SHT_PROGBITS 1                /* Program data */
+#define SHT_SYMTAB 2                  /* Symbol table */
+#define SHT_STRTAB 3                  /* String table */
+#define SHT_RELA 4                    /* Relocation entries with addends */
+#define SHT_HASH 5                    /* Symbol hash table */
+#define SHT_DYNAMIC 6                 /* Dynamic linking information */
+#define SHT_NOTE 7                    /* Notes */
+#define SHT_NOBITS 8                  /* Program space with no data (bss) */
+#define SHT_REL 9                     /* Relocation entries, no addends */
+#define SHT_SHLIB 10                  /* Reserved */
+#define SHT_DYNSYM 11                 /* Dynamic linker symbol table */
+#define SHT_INIT_ARRAY 14             /* Array of constructors */
+#define SHT_FINI_ARRAY 15             /* Array of destructors */
+#define SHT_PREINIT_ARRAY 16          /* Array of pre-constructors */
+#define SHT_GROUP 17                  /* Section group */
+#define SHT_SYMTAB_SHNDX 18           /* Extended section indeces */
+#define SHT_NUM 19                    /* Number of defined types.  */
+#define SHT_LOOS 0x60000000           /* Start OS-specific.  */
+#define SHT_GNU_ATTRIBUTES 0x6ffffff5 /* Object attributes.  */
+#define SHT_GNU_HASH 0x6ffffff6       /* GNU-style hash table.  */
+#define SHT_GNU_LIBLIST 0x6ffffff7    /* Prelink library list */
+#define SHT_CHECKSUM 0x6ffffff8       /* Checksum for DSO content.  */
+#define SHT_LOSUNW 0x6ffffffa         /* Sun-specific low bound.  */
+#define SHT_SUNW_move 0x6ffffffa
+#define SHT_SUNW_COMDAT 0x6ffffffb
+#define SHT_SUNW_syminfo 0x6ffffffc
+#define SHT_GNU_verdef 0x6ffffffd  /* Version definition section.  */
+#define SHT_GNU_verneed 0x6ffffffe /* Version needs section.  */
+#define SHT_GNU_versym 0x6fffffff  /* Version symbol table.  */
+#define SHT_HISUNW 0x6fffffff      /* Sun-specific high bound.  */
+#define SHT_HIOS 0x6fffffff        /* End OS-specific type */
+#define SHT_LOPROC 0x70000000      /* Start of processor-specific */
+#define SHT_HIPROC 0x7fffffff      /* End of processor-specific */
+#define SHT_LOUSER 0x80000000      /* Start of application-specific */
+#define SHT_HIUSER 0x8fffffff      /* End of application-specific */
+
+#endif // !__FENNIX_KERNEL_ELF_H__
diff --git a/Kernel/include/exec.hpp b/Kernel/include/exec.hpp
new file mode 100644
index 00000000..2de18081
--- /dev/null
+++ b/Kernel/include/exec.hpp
@@ -0,0 +1,148 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILE_EXECUTE_H__
+#define __FENNIX_KERNEL_FILE_EXECUTE_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+#include <task.hpp>
+#include <std.hpp>
+#include <elf.h>
+
+namespace Execute
+{
+    enum BinaryType
+    {
+        BinTypeInvalid,
+        BinTypeFex,
+        BinTypeELF,
+        BinTypePE,
+        BinTypeNE,
+        BinTypeMZ,
+        BinTypeUnknown
+    };
+
+    enum ExStatus
+    {
+        Unknown,
+        OK,
+        Unsupported,
+        GenericError,
+        InvalidFile,
+        InvalidFileFormat,
+        InvalidFileHeader,
+        InvalidFileData,
+        InvalidFileEntryPoint,
+        InvalidFilePath
+    };
+
+    struct SpawnData
+    {
+        ExStatus Status;
+        Tasking::PCB *Process;
+        Tasking::TCB *Thread;
+    };
+
+    struct SharedLibraries
+    {
+        char Identifier[64];
+        uint64_t Timeout;
+        int RefCount;
+
+        uintptr_t Address;
+        uintptr_t MemoryImage;
+        size_t Length;
+    };
+
+    struct ELFBaseLoad
+    {
+        bool Success;
+        bool Interpreter;
+        SpawnData sd;
+        Tasking::IP InstructionPointer;
+
+        std::vector<const char *> NeededLibraries;
+        void *MemoryImage;
+        void *VirtualMemoryImage;
+
+        /* This should be deleted after copying the allocated pages to the thread
+           Intended to be used only inside BaseLoad.cpp */
+        Memory::MemMgr *TmpMem;
+
+        /* Same as above, for BaseLoad.cpp only */
+        std::vector<AuxiliaryVector> auxv;
+    };
+
+    struct MmImage
+    {
+        void *Phyiscal;
+        void *Virtual;
+    };
+
+    BinaryType GetBinaryType(void *Image);
+    BinaryType GetBinaryType(char *Path);
+
+    SpawnData Spawn(char *Path, const char **argv, const char **envp);
+
+    ELFBaseLoad ELFLoad(char *Path, const char **argv, const char **envp,
+                        Tasking::TaskCompatibility Compatibility = Tasking::TaskCompatibility::Native);
+
+    Elf64_Shdr *GetELFSheader(Elf64_Ehdr *Header);
+    Elf64_Shdr *GetELFSection(Elf64_Ehdr *Header, uint64_t Index);
+    char *GetELFStringTable(Elf64_Ehdr *Header);
+    char *ELFLookupString(Elf64_Ehdr *Header, uintptr_t Offset);
+    Elf64_Sym *ELFLookupSymbol(Elf64_Ehdr *Header, const char *Name);
+    uintptr_t ELFGetSymbolValue(Elf64_Ehdr *Header, uint64_t Table, uint64_t Index);
+    Elf64_Dyn *ELFGetDynamicTag(void *ElfFile, enum DynamicArrayTags Tag);
+
+    /**
+     * @brief Create a ELF Memory Image
+     *
+     * @param mem The memory manager to use
+     * @param pV Memory::Virtual object to use
+     * @param ElfFile ELF file loaded in memory (FULL FILE)
+     * @param Length Length of @p ElfFile
+     * @return The Memory Image (Physical and Virtual)
+     */
+    MmImage ELFCreateMemoryImage(Memory::MemMgr *mem, Memory::Virtual &pV, void *ElfFile, size_t Length);
+
+    uintptr_t LoadELFInterpreter(Memory::MemMgr *mem, Memory::Virtual &pV, const char *Interpreter);
+
+    ELFBaseLoad ELFLoadRel(void *ElfFile,
+                           VirtualFileSystem::File &ExFile,
+                           Tasking::PCB *Process);
+
+    ELFBaseLoad ELFLoadExec(void *ElfFile,
+                            VirtualFileSystem::File &ExFile,
+                            Tasking::PCB *Process);
+
+    ELFBaseLoad ELFLoadDyn(void *ElfFile,
+                           VirtualFileSystem::File &ExFile,
+                           Tasking::PCB *Process);
+
+    void StartExecuteService();
+    bool AddLibrary(char *Identifier,
+                    void *ElfImage,
+                    size_t Length,
+                    const Memory::Virtual &pV = Memory::Virtual());
+    void SearchLibrary(char *Identifier);
+    SharedLibraries GetLibrary(char *Identifier);
+}
+
+#endif // !__FENNIX_KERNEL_FILE_EXECUTE_H__
diff --git a/Kernel/include/filesystem.hpp b/Kernel/include/filesystem.hpp
new file mode 100644
index 00000000..8b135ffd
--- /dev/null
+++ b/Kernel/include/filesystem.hpp
@@ -0,0 +1,182 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILESYSTEM_H__
+#define __FENNIX_KERNEL_FILESYSTEM_H__
+
+#include <types.h>
+#include <smart_ptr.hpp>
+#include <vector>
+
+namespace VirtualFileSystem
+{
+#define FILENAME_LENGTH 256
+
+    struct Node;
+
+    typedef size_t (*OperationMount)(const char *, unsigned long, const void *);
+    typedef size_t (*OperationUmount)(int);
+    typedef size_t (*OperationRead)(Node *node, size_t Offset, size_t Size, uint8_t *Buffer);
+    typedef size_t (*OperationWrite)(Node *node, size_t Offset, size_t Size, uint8_t *Buffer);
+    typedef void (*OperationOpen)(Node *node, uint8_t Mode, uint8_t Flags);
+    typedef void (*OperationClose)(Node *node);
+    typedef size_t (*OperationSync)(void);
+    typedef void (*OperationCreate)(Node *node, char *Name, uint16_t NameLength);
+    typedef void (*OperationMkdir)(Node *node, char *Name, uint16_t NameLength);
+
+#define MountFSFunction(name) size_t name(const char *unknown0, unsigned long unknown1, const uint8_t *unknown2)
+#define UMountFSFunction(name) size_t name(int unknown0)
+
+#define ReadFSFunction(name) size_t name(VirtualFileSystem::Node *node, size_t Offset, size_t Size, uint8_t *Buffer)
+#define WriteFSFunction(name) size_t name(VirtualFileSystem::Node *node, size_t Offset, size_t Size, uint8_t *Buffer)
+#define OpenFSFunction(name) void name(VirtualFileSystem::Node *node, uint8_t Mode, uint8_t Flags)
+#define CloseFSFunction(name) void name(VirtualFileSystem::Node *node)
+#define SyncFSFunction(name) size_t name(void)
+#define CreateFSFunction(name) void name(VirtualFileSystem::Node *node, char *Name, uint16_t NameLength)
+#define MkdirFSFunction(name) void name(VirtualFileSystem::Node *node, char *Name, uint16_t NameLength)
+
+    enum FileStatus
+    {
+        OK,
+        NotFound,
+        NotEmpty,
+        NotSupported,
+        AccessDenied,
+        Timeout,
+        SectorNotFound,
+        PartiallyCompleted,
+
+        InvalidName,
+        InvalidParameter,
+        InvalidHandle,
+        InvalidPath,
+        InvalidDevice,
+        InvalidOperator,
+        InvalidNode,
+
+        FileExists,
+        FileIsADirectory,
+        FileIsInvalid,
+
+        DirectoryNotEmpty,
+        NotADirectory,
+
+        UnknownFileStatusError
+    };
+
+    enum NodeFlags
+    {
+        NODE_FLAG_ERROR = 0x0,
+        FILE = 0x01,
+        DIRECTORY = 0x02,
+        CHARDEVICE = 0x03,
+        BLOCKDEVICE = 0x04,
+        PIPE = 0x05,
+        SYMLINK = 0x06,
+        MOUNTPOINT = 0x08
+    };
+
+    struct FileSystemOperations
+    {
+        char Name[FILENAME_LENGTH];
+        OperationMount Mount = nullptr;
+        OperationUmount Umount = nullptr;
+        OperationRead Read = nullptr;
+        OperationWrite Write = nullptr;
+        OperationOpen Open = nullptr;
+        OperationClose Close = nullptr;
+        OperationCreate Create = nullptr;
+        OperationMkdir MakeDirectory = nullptr;
+    };
+
+    struct Node
+    {
+        char Name[FILENAME_LENGTH];
+        uint64_t IndexNode = 0;
+        uint64_t Mask = 0;
+        uint64_t Mode = 0;
+        NodeFlags Flags = NodeFlags::NODE_FLAG_ERROR;
+        uint64_t UserIdentifier = 0, GroupIdentifier = 0;
+        uintptr_t Address = 0;
+        size_t Length = 0;
+        Node *Parent = nullptr;
+        FileSystemOperations *Operator = nullptr;
+        /* For root node:
+        0 - root "/"
+        1 - etc
+        ...
+        */
+        std::vector<Node *> Children;
+    };
+
+    struct File
+    {
+        char Name[FILENAME_LENGTH];
+        FileStatus Status;
+        Node *node;
+
+        bool IsOK() { return Status == FileStatus::OK; }
+    };
+
+    /* Manage / etc.. */
+    class Virtual
+    {
+    private:
+        Node *FileSystemRoot = nullptr;
+
+    public:
+        std::shared_ptr<char> GetPathFromNode(Node *node);
+        Node *GetNodeFromPath(const char *Path, Node *Parent = nullptr);
+
+        /**
+         * @brief Convert a Node to a File
+         *
+         * @param node Node to convert
+         * @return Converted node
+         */
+        File ConvertNodeToFILE(Node *node);
+
+        Node *GetParent(const char *Path, Node *Parent);
+        Node *GetRootNode() { return FileSystemRoot; }
+
+        Node *AddNewChild(const char *Name, Node *Parent);
+        Node *GetChild(const char *Name, Node *Parent);
+        FileStatus RemoveChild(const char *Name, Node *Parent);
+
+        std::shared_ptr<char> NormalizePath(const char *Path, Node *Parent = nullptr);
+        bool PathExists(const char *Path, Node *Parent = nullptr);
+        Node *CreateRoot(const char *RootName, FileSystemOperations *Operator);
+        Node *Create(const char *Path, NodeFlags Flag, Node *Parent = nullptr);
+
+        FileStatus Delete(const char *Path, bool Recursive = false, Node *Parent = nullptr);
+        FileStatus Delete(Node *Path, bool Recursive = false, Node *Parent = nullptr);
+
+        File Mount(const char *Path, FileSystemOperations *Operator);
+        FileStatus Unmount(File &File);
+
+        size_t Read(File &File, size_t Offset, uint8_t *Buffer, size_t Size);
+        size_t Write(File &File, size_t Offset, uint8_t *Buffer, size_t Size);
+
+        File Open(const char *Path, Node *Parent = nullptr);
+        FileStatus Close(File &File);
+
+        Virtual();
+        ~Virtual();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_FILESYSTEM_H__
diff --git a/Kernel/include/filesystem/ext2.hpp b/Kernel/include/filesystem/ext2.hpp
new file mode 100644
index 00000000..24793cb2
--- /dev/null
+++ b/Kernel/include/filesystem/ext2.hpp
@@ -0,0 +1,91 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILESYSTEM_EXT2_H__
+#define __FENNIX_KERNEL_FILESYSTEM_EXT2_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+
+namespace VirtualFileSystem
+{
+    class EXT2
+    {
+    public:
+        struct SuperBlock
+        {
+            uint32_t Inodes;
+            uint32_t Blocks;
+            uint32_t ReservedBlocks;
+            uint32_t FreeBlock;
+            uint32_t FreeInodes;
+            uint32_t FirstDataBlock;
+            uint32_t LogBlockSize;
+            uint32_t LogFragSize;
+            uint32_t BlocksPerGroup;
+            uint32_t FragsPerGroup;
+            uint32_t InodesPerGroup;
+            uint32_t LastMountTime;
+            uint32_t LastWrittenTime;
+            uint16_t MountedTimes;
+            uint16_t MaximumMountedTimes;
+            uint16_t Magic;
+            uint16_t State;
+            uint16_t Errors;
+            uint16_t MinorRevLevel;
+            uint32_t LastCheck;
+            uint32_t CheckInternval;
+            uint32_t SystemID;
+            uint32_t RevLevel;
+            uint16_t ReservedBlocksUserID;
+            uint16_t ReservedBlocksGroupID;
+
+            uint32_t FirstInode;
+            uint16_t InodeSize;
+            uint16_t BlockGroups;
+            uint32_t FeatureCompatibility;
+            uint32_t FeatureIncompatibility;
+            uint32_t FeatureRoCompatibility;
+            uint8_t UUID[16];
+            char VolumeName[16];
+            char LastMounted[64];
+            uint32_t BitmapAlogrithm;
+
+            uint8_t PreallocatedBlocks;
+            uint8_t PreallocatedDirectoryBlocks;
+
+            uint16_t Padding;
+            uint8_t JournalUUID[16];
+            uint32_t JournalInum;
+            uint32_t JournalDev;
+            uint32_t LastOrphan;
+            uint32_t HashSeed[4];
+            uint8_t DefHashVersion;
+            uint8_t ReservedCharPad;
+            uint16_t ReservedWordPad;
+            uint32_t DefaultMountOptions;
+            uint32_t FirstMetaBg;
+            uint32_t Reserved[190];
+        };
+
+        EXT2(void *partition);
+        ~EXT2();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_FILESYSTEM_EXT2_H__
diff --git a/Kernel/include/filesystem/fat.hpp b/Kernel/include/filesystem/fat.hpp
new file mode 100644
index 00000000..7781a403
--- /dev/null
+++ b/Kernel/include/filesystem/fat.hpp
@@ -0,0 +1,77 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILESYSTEM_FAT_H__
+#define __FENNIX_KERNEL_FILESYSTEM_FAT_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+
+namespace VirtualFileSystem
+{
+    class FAT
+    {
+    public:
+        enum FatType
+        {
+            Unknown,
+            FAT12,
+            FAT16,
+            FAT32
+        };
+
+        /* https://wiki.osdev.org/FAT */
+        struct BIOSParameterBlock
+        {
+            /** @brief The first three bytes EB 3C 90 disassemble to JMP SHORT 3C NOP. (The 3C value may be different.) The reason for this is to jump over the disk format information (the BPB and EBPB). Since the first sector of the disk is loaded into ram at location 0x0000:0x7c00 and executed, without this jump, the processor would attempt to execute data that isn't code. Even for non-bootable volumes, code matching this pattern (or using the E9 jump opcode) is required to be present by both Windows and OS X. To fulfil this requirement, an infinite loop can be placed here with the bytes EB FE 90. */
+            uint8_t JumpBoot[3];
+            /** @brief OEM identifier. The first 8 Bytes (3 - 10) is the version of DOS being used. The next eight Bytes 29 3A 63 7E 2D 49 48 and 43 read out the name of the version. The official FAT Specification from Microsoft says that this field is really meaningless and is ignored by MS FAT Drivers, however it does recommend the value "MSWIN4.1" as some 3rd party drivers supposedly check it and expect it to have that value. Older versions of dos also report MSDOS5.1, linux-formatted floppy will likely to carry "mkdosfs" here, and FreeDOS formatted disks have been observed to have "FRDOS5.1" here. If the string is less than 8 bytes, it is padded with spaces. */
+            uint8_t OEM[8];
+            /** @brief The number of Bytes per sector (remember, all numbers are in the little-endian format). */
+            uint16_t BytesPerSector;
+            /** @brief Number of sectors per cluster. */
+            uint8_t SectorsPerCluster;
+            /** @brief Number of reserved sectors. The boot record sectors are included in this value. */
+            uint16_t ReservedSectors;
+            /** @brief Number of File Allocation Tables (FAT's) on the storage media. Often this value is 2. */
+            uint8_t NumberOfFATs;
+            /** @brief Number of root directory entries (must be set so that the root directory occupies entire sectors). */
+            uint16_t RootDirectoryEntries;
+            /** @brief The total sectors in the logical volume. If this value is 0, it means there are more than 65535 sectors in the volume, and the actual count is stored in the Large Sector Count entry at 0x20. */
+            uint16_t Sectors16;
+            /** @brief This Byte indicates the media descriptor type. */
+            uint8_t Media;
+            /** @brief Number of sectors per FAT. FAT12/FAT16 only. */
+            uint16_t SectorsPerFAT;
+            /** @brief Number of sectors per track. */
+            uint16_t SectorsPerTrack;
+            /** @brief Number of heads or sides on the storage media. */
+            uint16_t NumberOfHeads;
+            /** @brief Number of hidden sectors. (i.e. the LBA of the beginning of the partition). */
+            uint32_t HiddenSectors;
+            /** @brief Large sector count. This field is set if there are more than 65535 sectors in the volume, resulting in a value which does not fit in the Number of Sectors entry at 0x13. */
+            uint32_t Sectors32;
+        } __packed;
+
+        FatType GetFATType(BIOSParameterBlock *bpb);
+        FAT(void *partition);
+        ~FAT();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_FILESYSTEM_FAT_H__
diff --git a/Kernel/include/filesystem/initrd.hpp b/Kernel/include/filesystem/initrd.hpp
new file mode 100644
index 00000000..994df1d3
--- /dev/null
+++ b/Kernel/include/filesystem/initrd.hpp
@@ -0,0 +1,48 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILESYSTEM_INITRD_H__
+#define __FENNIX_KERNEL_FILESYSTEM_INITRD_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+
+namespace VirtualFileSystem
+{
+    class Initrd
+    {
+    public:
+        struct InitrdHeader
+        {
+            uint32_t nfiles;
+        };
+
+        struct InitrdFileHeader
+        {
+            uint8_t magic;
+            char name[64];
+            uint32_t offset;
+            uint32_t length;
+        };
+
+        Initrd(uintptr_t Address);
+        ~Initrd();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_FILESYSTEM_INITRD_H__
diff --git a/Kernel/include/filesystem/mounts.hpp b/Kernel/include/filesystem/mounts.hpp
new file mode 100644
index 00000000..71cafaf8
--- /dev/null
+++ b/Kernel/include/filesystem/mounts.hpp
@@ -0,0 +1,114 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILESYSTEM_DEV_H__
+#define __FENNIX_KERNEL_FILESYSTEM_DEV_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+
+namespace VirtualFileSystem
+{
+    /* Manage /system/dev */
+    class Device
+    {
+    public:
+        Node *AddFileSystem(FileSystemOperations *Operator, uint64_t Mode, const char *Name, int Flags);
+        Device();
+        ~Device();
+    };
+
+    /* Manage /system/mnt */
+    class Mount
+    {
+    public:
+        Node *MountFileSystem(FileSystemOperations *Operator, uint64_t Mode, const char *Name);
+        void DetectAndMountFS(void *drive);
+        Mount();
+        ~Mount();
+    };
+
+    /* Manage /system/prc */
+    class Process
+    {
+    public:
+        Process();
+        ~Process();
+    };
+
+    /* Manage /system/drv */
+    class Driver
+    {
+    public:
+        Node *AddDriver(struct FileSystemOperations *Operator, uint64_t Mode, const char *Name, int Flags);
+        Driver();
+        ~Driver();
+    };
+
+    /* Manage /system/net */
+    class Network
+    {
+    public:
+        Node *AddNetworkCard(struct FileSystemOperations *Operator, uint64_t Mode, const char *Name, int Flags);
+        Network();
+        ~Network();
+    };
+
+    /* Manage /system/dev/serialX */
+    class Serial
+    {
+    public:
+        Serial();
+        ~Serial();
+    };
+
+    /* Manage /system/dev/random */
+    class Random
+    {
+    public:
+        Random();
+        ~Random();
+    };
+
+    /* Manage /system/dev/null */
+    class Null
+    {
+    public:
+        Null();
+        ~Null();
+    };
+
+    /* Manage /system/dev/zero */
+    class Zero
+    {
+    public:
+        Zero();
+        ~Zero();
+    };
+
+    /* Manage /system/dev/fbX */
+    class FB
+    {
+    public:
+        void SetFrameBufferData(uintptr_t Address, size_t Size, uint32_t Width, uint32_t Height, uint32_t PixelsPerScanLine);
+        FB();
+        ~FB();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_FILESYSTEM_DEV_H__
diff --git a/Kernel/include/filesystem/ustar.hpp b/Kernel/include/filesystem/ustar.hpp
new file mode 100644
index 00000000..220932c8
--- /dev/null
+++ b/Kernel/include/filesystem/ustar.hpp
@@ -0,0 +1,88 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_FILESYSTEM_USTAR_H__
+#define __FENNIX_KERNEL_FILESYSTEM_USTAR_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+
+namespace VirtualFileSystem
+{
+    class USTAR
+    {
+        enum FileType
+        {
+            REGULAR_FILE = '0',
+            HARDLINK = '1',
+            SYMLINK = '2',
+            CHARDEV = '3',
+            BLOCKDEV = '4',
+            DIRECTORY = '5',
+            FIFO = '6'
+        };
+
+        struct FileHeader
+        {
+            char name[100];
+            char mode[8];
+            char uid[8];
+            char gid[8];
+            char size[12];
+            char mtime[12];
+            char chksum[8];
+            char typeflag[1];
+            char link[100];
+            char signature[6];
+            char version[2];
+            char owner[32];
+            char group[32];
+            char dev_maj[8];
+            char dev_min[8];
+            char prefix[155];
+            char pad[12];
+        };
+
+    private:
+        uint32_t getsize(const char *s)
+        {
+            uint32_t ret = 0;
+            while (*s)
+            {
+                ret *= 8;
+                ret += *s - '0';
+                s++;
+            }
+            return ret;
+        }
+
+        int string2int(const char *str)
+        {
+            int res = 0;
+            for (int i = 0; str[i] != '\0'; ++i)
+                res = res * 10 + str[i] - '0';
+            return res;
+        }
+
+    public:
+        USTAR(uintptr_t Address, Virtual *vfs_ctx);
+        ~USTAR();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_FILESYSTEM_USTAR_H__
diff --git a/Kernel/include/gui.hpp b/Kernel/include/gui.hpp
new file mode 100644
index 00000000..4e6caee6
--- /dev/null
+++ b/Kernel/include/gui.hpp
@@ -0,0 +1,408 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_GUI_H__
+#define __FENNIX_KERNEL_GUI_H__
+
+#include <types.h>
+#include <display.hpp>
+#include <memory.hpp>
+#include <debug.h>
+#include <vector>
+
+namespace GraphicalUserInterface
+{
+    typedef uintptr_t Handle;
+
+    struct MouseData
+    {
+        int64_t X;
+        int64_t Y;
+        int64_t Z;
+        bool Left;
+        bool Right;
+        bool Middle;
+    };
+
+    struct ScreenBitmap
+    {
+        int64_t Width;
+        int64_t Height;
+        uint64_t Size;
+        uint64_t Pitch;
+        uint64_t BitsPerPixel;
+        uint8_t *Data;
+    };
+
+    struct Rect
+    {
+        int64_t Left;
+        int64_t Top;
+        int64_t Width;
+        int64_t Height;
+
+        bool Contains(int64_t X, int64_t Y)
+        {
+            return (X >= Left && X <= Left + Width && Y >= Top && Y <= Top + Height);
+        }
+
+        bool Contains(Rect rect)
+        {
+            return (rect.Left >= Left && rect.Left + rect.Width <= Left + Width && rect.Top >= Top && rect.Top + rect.Height <= Top + Height);
+        }
+    };
+
+    enum CursorType
+    {
+        Visible = 0,
+        Hidden,
+        Arrow,
+        Hand,
+        Wait,
+        IBeam,
+        ResizeHorizontal,
+        ResizeVertical,
+        ResizeDiagonalLeft,
+        ResizeDiagonalRight,
+        ResizeAll,
+        Cross,
+        Help,
+        No,
+        AppStarting,
+    };
+
+    struct Event
+    {
+        struct
+        {
+            int64_t Width;
+            int64_t Height;
+        } Resize;
+
+        struct
+        {
+            int64_t X;
+            int64_t Y;
+            bool Left;
+            bool Right;
+            bool Middle;
+        } MouseDown;
+
+        struct
+        {
+            int64_t X;
+            int64_t Y;
+            bool Left;
+            bool Right;
+            bool Middle;
+        } MouseUp;
+
+        struct
+        {
+            int64_t X;
+            int64_t Y;
+            bool Left;
+            bool Right;
+            bool Middle;
+        } MouseMove;
+    };
+
+    /*
+        virtual void OnMouseMove(Event *e) {}
+        virtual void OnMouseClick(Event *e) {}
+        virtual void OnMouseDoubleClick(Event *e) {}
+        virtual void OnMouseDown(Event *e) {}
+        virtual void OnMouseUp(Event *e) {}
+        virtual void OnMouseWheel(Event *e) {}
+        virtual void OnMouseEnter(Event *e) {}
+        virtual void OnMouseLeave(Event *e) {}
+        virtual void OnMouseHover(Event *e) {}
+        virtual void OnMouseDrag(Event *e) {}
+        virtual void OnMouseDragStart(Event *e) {}
+        virtual void OnMouseDragEnd(Event *e) {}
+        virtual void OnMouseDragEnter(Event *e) {}
+        virtual void OnMouseDragLeave(Event *e) {}
+        virtual void OnMouseDragHover(Event *e) {}
+        virtual void OnMouseDragDrop(Event *e) {}
+        virtual void OnMouseDragDropEnter(Event *e) {}
+        virtual void OnMouseDragDropLeave(Event *e) {}
+        virtual void OnMouseDragDropHover(Event *e) {}
+        virtual void OnMouseDragDropEnd(Event *e) {}
+        virtual void OnMouseDragDropStart(Event *e) {}
+        virtual void OnMouseDragDropCancel(Event *e) {}
+        virtual void OnMouseDragDropComplete(Event *e) {}
+        virtual void OnMouseDragDropAbort(Event *e) {}
+
+        virtual void OnKeyDown(Event *e) {}
+        virtual void OnKeyUp(Event *e) {}
+        virtual void OnKeyPress(Event *e) {}
+
+        virtual void OnFocusEnter(Event *e) {}
+        virtual void OnFocusLeave(Event *e) {}
+        virtual void OnFocusHover(Event *e) {}
+
+        virtual void OnResize(Event *e) {}
+        virtual void OnMinimize(Event *e) {}
+        virtual void OnMaximize(Event *e) {}
+        virtual void OnMove(Event *e) {}
+        virtual void OnShow(Event *e) {}
+        virtual void OnHide(Event *e) {}
+        virtual void OnClose(Event *e) {}
+        virtual void OnDestroy(Event *e) {}
+
+        virtual void OnPaint(Event *e) {}
+        virtual void OnPaintBackground(Event *e) {}
+        virtual void OnPaintForeground(Event *e) {}
+        virtual void OnPaintOverlay(Event *e) {}
+        virtual void OnPaintAll(Event *e) {}
+        virtual void OnPaintChildren(Event *e) {}
+        virtual void OnPaintChildrenBackground(Event *e) {}
+        virtual void OnPaintChildrenForeground(Event *e) {}
+        virtual void OnPaintChildrenBorder(Event *e) {}
+        virtual void OnPaintChildrenShadow(Event *e) {}
+        virtual void OnPaintChildrenOverlay(Event *e) {}
+        virtual void OnPaintChildrenAll(Event *e) {}
+    */
+
+    void SetPixel(ScreenBitmap *Bitmap, long X, long Y, uint32_t Color);
+    void DrawOverBitmap(ScreenBitmap *DestinationBitmap,
+                        ScreenBitmap *SourceBitmap,
+                        long Top,
+                        long Left,
+                        bool IgnoreZero = true);
+    void PutRect(ScreenBitmap *Bitmap, Rect rect, uint32_t Color);
+    void PutBorder(ScreenBitmap *Bitmap, Rect rect, uint32_t Color);
+    uint32_t BlendColors(uint32_t c1, uint32_t c2, float t);
+    void PutBorderWithShadow(ScreenBitmap *Bitmap, Rect rect, uint32_t Color);
+    void DrawShadow(ScreenBitmap *Bitmap, Rect rect);
+    void PaintChar(Video::Font *font, ScreenBitmap *Bitmap, char c, uint32_t Color, long *CharCursorX, long *CharCursorY);
+    void DrawString(ScreenBitmap *Bitmap, Rect rect, const char *Text, uint32_t Color);
+
+    class WidgetCollection
+    {
+    private:
+        Memory::MemMgr *mem;
+        ScreenBitmap *Buffer;
+        Video::Font *CurrentFont;
+        void *ParentWindow;
+        bool NeedRedraw;
+
+        struct HandleMeta
+        {
+            char Type[4];
+        };
+
+        struct LabelObject
+        {
+            HandleMeta Handle;
+            Rect rect;
+            char Text[512];
+            uint32_t Color;
+            long CharCursorX, CharCursorY;
+        };
+
+        struct PanelObject
+        {
+            HandleMeta Handle;
+            Rect rect;
+            uint32_t Color;
+            uint32_t BorderColor;
+            uint32_t ShadowColor;
+            bool Shadow;
+        };
+
+        struct ButtonObject
+        {
+            HandleMeta Handle;
+            Rect rect;
+            char Text[512];
+            uint32_t Color;
+            uint32_t HoverColor;
+            uint32_t PressedColor;
+            uint32_t BorderColor;
+            uint32_t ShadowColor;
+            long CharCursorX, CharCursorY;
+            bool Shadow;
+            bool Hover;
+            bool Pressed;
+            uintptr_t OnClick;
+        };
+
+        std::vector<LabelObject *> Labels;
+        std::vector<PanelObject *> Panels;
+        std::vector<ButtonObject *> Buttons;
+
+    public:
+        void ReplaceFont(Video::Font *NewFont)
+        {
+            delete this->CurrentFont;
+            this->CurrentFont = NewFont;
+        }
+
+        Handle CreatePanel(Rect rect, uint32_t Color);
+        Handle CreateButton(Rect rect, const char *Text, uintptr_t OnClick = (uintptr_t) nullptr);
+        Handle CreateLabel(Rect rect, const char *Text);
+        Handle CreateTextBox(Rect rect, const char *Text);
+        Handle CreateCheckBox(Rect rect, const char *Text);
+        Handle CreateRadioButton(Rect rect, const char *Text);
+        Handle CreateComboBox(Rect rect, const char *Text);
+        Handle CreateListBox(Rect rect, const char *Text);
+        Handle CreateProgressBar(Rect rect, const char *Text);
+        Handle CreateContextMenu(Rect rect, const char *Text);
+
+        void SetText(Handle handle, const char *Text);
+
+        WidgetCollection(void /* Window */ *ParentWindow);
+        ~WidgetCollection();
+
+        void OnMouseMove(Event *e);
+        void OnMouseClick(Event *e);
+        void OnMouseDoubleClick(Event *e);
+        void OnMouseDown(Event *e);
+        void OnMouseUp(Event *e);
+        void OnMouseWheel(Event *e);
+        void OnMouseEnter(Event *e);
+        void OnMouseLeave(Event *e);
+        void OnMouseHover(Event *e);
+        void OnMouseDrag(Event *e);
+        void OnMouseDragStart(Event *e);
+        void OnMouseDragEnd(Event *e);
+
+        void OnKeyDown(Event *e);
+        void OnKeyUp(Event *e);
+        void OnKeyPress(Event *e);
+
+        void OnShow(Event *e);
+        void OnHide(Event *e);
+        void OnDestroy(Event *e);
+
+        void OnPaint(Event *e);
+        void OnPaintBackground(Event *e);
+        void OnPaintForeground(Event *e);
+    };
+
+    class Window
+    {
+    private:
+        Memory::MemMgr *mem;
+        ScreenBitmap *Buffer;
+        Rect Position;
+        Rect LastPosition;
+        char Title[256];
+        std::vector<WidgetCollection *> Widgets;
+        void *ParentGUI;
+
+        bool Maximized;
+        bool Minimized;
+
+    public:
+        bool IsMaximized() { return Maximized; }
+        bool IsMinimized() { return Minimized; }
+        ScreenBitmap *GetBuffer() { return Buffer; }
+        Rect GetPosition() { return Position; }
+        Rect *GetPositionPtr() { return &Position; }
+        const char *GetTitle() { return (const char *)Title; }
+        void SetTitle(const char *Title) { strcpy(this->Title, Title); }
+        void AddWidget(WidgetCollection *widget);
+
+        Window(void *ParentGUI, Rect rect, const char *Title);
+        ~Window();
+
+        void OnMouseMove(Event *e);
+        void OnMouseClick(Event *e);
+        void OnMouseDoubleClick(Event *e);
+        void OnMouseDown(Event *e);
+        void OnMouseUp(Event *e);
+        void OnMouseWheel(Event *e);
+        void OnMouseEnter(Event *e);
+        void OnMouseLeave(Event *e);
+        void OnMouseHover(Event *e);
+        void OnMouseDrag(Event *e);
+        void OnMouseDragStart(Event *e);
+        void OnMouseDragEnd(Event *e);
+
+        void OnKeyDown(Event *e);
+        void OnKeyUp(Event *e);
+        void OnKeyPress(Event *e);
+
+        void OnFocusEnter(Event *e);
+        void OnFocusLeave(Event *e);
+        void OnFocusHover(Event *e);
+
+        void OnResize(Event *e);
+        void OnMinimize(Event *e);
+        void OnMaximize(Event *e);
+        void OnMove(Event *e);
+        void OnShow(Event *e);
+        void OnHide(Event *e);
+        void OnClose(Event *e);
+        void OnDestroy(Event *e);
+
+        void OnPaint(Event *e);
+        void OnPaintBackground(Event *e);
+        void OnPaintForeground(Event *e);
+        void OnPaintOverlay(Event *e);
+        void OnPaintAll(Event *e);
+        void OnPaintChildren(Event *e);
+        void OnPaintChildrenBackground(Event *e);
+        void OnPaintChildrenForeground(Event *e);
+        void OnPaintChildrenBorder(Event *e);
+        void OnPaintChildrenShadow(Event *e);
+        void OnPaintChildrenOverlay(Event *e);
+        void OnPaintChildrenAll(Event *e);
+    };
+
+    class GUI
+    {
+    private:
+        MouseData MouseArray[256];
+        Memory::MemMgr *mem;
+        Video::Font *CurrentFont;
+        Rect Desktop;
+        ScreenBitmap *BackBuffer;
+        ScreenBitmap *DesktopBuffer;
+        ScreenBitmap *OverlayBuffer;
+        ScreenBitmap *CursorBuffer;
+        std::vector<WidgetCollection *> Widgets;
+        std::vector<Window *> Windows;
+        CursorType Cursor = CursorType::Arrow;
+        CursorType LastCursor = CursorType::Arrow;
+        bool CursorVisible = true;
+        bool IsRunning = false;
+
+        bool DesktopBufferRepaint = true;
+        bool OverlayBufferRepaint = true;
+        bool OverlayFullRepaint = true;
+        bool CursorBufferRepaint = true;
+
+        void FetchInputs();
+        void PaintDesktop();
+        void PaintWidgets();
+        void PaintWindows();
+        void PaintCursor();
+
+    public:
+        void SetCursorType(CursorType Type = CursorType::Visible) { this->Cursor = Type; }
+        void Loop();
+        void AddWindow(Window *window);
+        void AddWidget(WidgetCollection *widget);
+        GUI();
+        ~GUI();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_GUI_H__
diff --git a/Kernel/include/hashmap.hpp b/Kernel/include/hashmap.hpp
new file mode 100644
index 00000000..f1238609
--- /dev/null
+++ b/Kernel/include/hashmap.hpp
@@ -0,0 +1,121 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+
+#define HASHMAP_ERROR -0x8A50
+
+template <typename K, typename V>
+class HashNode
+{
+public:
+    V Value;
+    K Key;
+
+    HashNode(K Key, V Value)
+    {
+        this->Value = Value;
+        this->Key = Key;
+    }
+};
+
+template <typename K, typename V>
+class HashMap
+{
+    int HashMapSize;
+    int HashMapCapacity;
+    HashNode<K, V> **Nodes;
+    HashNode<K, V> *DummyNode;
+
+public:
+    HashMap()
+    {
+        HashMapCapacity = 20;
+        HashMapSize = 0;
+        Nodes = new HashNode<K, V> *[HashMapCapacity];
+        for (int i = 0; i < HashMapCapacity; i++)
+            Nodes[i] = nullptr;
+        DummyNode = new HashNode<K, V>(-1, -1);
+    }
+
+    ~HashMap()
+    {
+        for (int i = 0; i < HashMapCapacity; i++)
+            if (Nodes[i] != nullptr)
+                delete Nodes[i], Nodes[i] = nullptr;
+        delete[] Nodes, Nodes = nullptr;
+        delete DummyNode, DummyNode = nullptr;
+    }
+
+    int HashCode(K Key) { return Key % HashMapCapacity; }
+
+    void AddNode(K Key, V Value)
+    {
+        HashNode<K, V> *tmp = new HashNode<K, V>(Key, Value);
+        int Index = HashCode(Key);
+
+        while (Nodes[Index] != nullptr && Nodes[Index]->Key != Key && Nodes[Index]->Key != (K)-1)
+        {
+            Index++;
+            Index %= HashMapCapacity;
+        }
+
+        if (Nodes[Index] == nullptr || Nodes[Index]->Key == (K)-1)
+            HashMapSize++;
+        Nodes[Index] = tmp;
+    }
+
+    V DeleteNode(int Key)
+    {
+        int Index = HashCode(Key);
+
+        while (Nodes[Index] != nullptr)
+        {
+            if (Nodes[Index]->Key == Key)
+            {
+                HashNode<K, V> *tmp = Nodes[Index];
+                Nodes[Index] = DummyNode;
+                HashMapSize--;
+                return tmp->Value;
+            }
+            Index++;
+            Index %= HashMapCapacity;
+        }
+        return HASHMAP_ERROR;
+    }
+
+    V Get(int Key)
+    {
+        int Index = HashCode(Key);
+        int Iterate = 0;
+
+        while (Nodes[Index] != nullptr)
+        {
+            if (Iterate++ > HashMapCapacity)
+                return HASHMAP_ERROR;
+
+            if (Nodes[Index]->Key == (K)Key)
+                return Nodes[Index]->Value;
+            Index++;
+            Index %= HashMapCapacity;
+        }
+        return HASHMAP_ERROR;
+    }
+
+    int Size() { return HashMapSize; }
+    bool IsEmpty() { return HashMapSize == 0; }
+};
diff --git a/Kernel/include/intrin.hpp b/Kernel/include/intrin.hpp
new file mode 100644
index 00000000..fc47ea70
--- /dev/null
+++ b/Kernel/include/intrin.hpp
@@ -0,0 +1,80 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_INTRIN_H__
+#define __FENNIX_KERNEL_INTRIN_H__
+
+#include <types.h>
+#include <debug.h>
+
+namespace FXSR
+{
+    void _fxsave(void *mem_addr)
+    {
+#ifdef a64
+        __builtin_ia32_fxsave(mem_addr);
+#endif
+    }
+
+    void _fxrstor(void *mem_addr)
+    {
+#ifdef a64
+        __builtin_ia32_fxrstor(mem_addr);
+#endif
+    }
+
+    void _fxsave64(void *mem_addr)
+    {
+#ifdef a64
+        asmv("fxsaveq (%0)"
+             :
+             : "r"(mem_addr)
+             : "memory");
+#endif
+    }
+
+    void _fxrstor64(void *mem_addr)
+    {
+#ifdef a64
+        asmv("fxrstorq (%0)"
+             :
+             : "r"(mem_addr)
+             : "memory");
+#endif
+    }
+}
+
+namespace SMAP
+{
+    void _clac(void)
+    {
+#if defined(a86)
+        asmv("clac" ::
+                 : "cc");
+#endif // a64 || a32
+    }
+
+    void _stac(void)
+    {
+#if defined(a86)
+        asmv("stac" ::
+                 : "cc");
+#endif // a64 || a32
+    }
+}
+
+#endif // !__FENNIX_KERNEL_INTRIN_H__
diff --git a/Kernel/include/ints.hpp b/Kernel/include/ints.hpp
new file mode 100644
index 00000000..99affe5b
--- /dev/null
+++ b/Kernel/include/ints.hpp
@@ -0,0 +1,78 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_INTERRUPTS_H__
+#define __FENNIX_KERNEL_INTERRUPTS_H__
+
+#include <types.h>
+#include <cpu.hpp>
+
+namespace Interrupts
+{
+#ifdef DEBUG // For performance reasons
+#define INT_FRAMES_MAX 512
+#else
+#define INT_FRAMES_MAX 8
+#endif
+
+#if defined(a64)
+    /* APIC::APIC */ extern void *apic[256];       // MAX_CPU
+    /* APIC::Timer */ extern void *apicTimer[256]; // MAX_CPU
+#elif defined(a32)
+    /* APIC::APIC */ extern void *apic[256];       // MAX_CPU
+    /* APIC::Timer */ extern void *apicTimer[256]; // MAX_CPU
+#elif defined(aa64)
+#endif
+    extern void *InterruptFrames[INT_FRAMES_MAX];
+
+    void Initialize(int Core);
+    void Enable(int Core);
+    void InitializeTimer(int Core);
+    void RemoveAll();
+
+    class Handler
+    {
+    private:
+        int InterruptNumber;
+
+    protected:
+        /**
+         * @brief Set a new interrupt number.
+         * @param InterruptNumber The interrupt number. NOT the IRQ number! (IRQ0 != 32)
+         */
+        void SetInterruptNumber(int InterruptNumber) { this->InterruptNumber = InterruptNumber; }
+        int GetInterruptNumber() { return this->InterruptNumber; }
+
+        /**
+         * @brief Create a new interrupt handler.
+         * @param InterruptNumber The interrupt number. NOT the IRQ number! (IRQ0 != 32)
+         */
+        Handler(int InterruptNumber);
+        ~Handler();
+
+    public:
+#if defined(a64)
+        virtual void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+#elif defined(a32)
+        virtual void OnInterruptReceived(CPU::x32::TrapFrame *Frame);
+#elif defined(aa64)
+        virtual void OnInterruptReceived(CPU::aarch64::TrapFrame *Frame);
+#endif
+    };
+}
+
+#endif // !__FENNIX_KERNEL_INTERRUPTS_H__
diff --git a/Kernel/include/io.h b/Kernel/include/io.h
new file mode 100644
index 00000000..ab127f7c
--- /dev/null
+++ b/Kernel/include/io.h
@@ -0,0 +1,237 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_IO_H__
+#define __FENNIX_KERNEL_IO_H__
+
+#include <types.h>
+
+#if defined(a86)
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    static inline uint8_t inportb(uint16_t Port)
+    {
+        uint8_t Result;
+        asm("in %%dx, %%al"
+            : "=a"(Result)
+            : "d"(Port));
+        return Result;
+    }
+
+    static inline uint16_t inportw(uint16_t Port)
+    {
+        uint16_t Result;
+        asm("in %%dx, %%ax"
+            : "=a"(Result)
+            : "d"(Port));
+        return Result;
+    }
+
+    static inline uint32_t inportl(uint16_t Port)
+    {
+        uint32_t Result;
+        asmv("inl %1, %0"
+             : "=a"(Result)
+             : "dN"(Port));
+        return Result;
+    }
+
+    static inline void outportb(uint16_t Port, uint8_t Data)
+    {
+        asmv("out %%al, %%dx"
+             :
+             : "a"(Data), "d"(Port));
+    }
+
+    static inline void outportw(uint16_t Port, uint16_t Data)
+    {
+        asmv("out %%ax, %%dx"
+             :
+             : "a"(Data), "d"(Port));
+    }
+
+    static inline void outportl(uint16_t Port, uint32_t Data)
+    {
+        asmv("outl %1, %0"
+             :
+             : "dN"(Port), "a"(Data));
+    }
+
+    static inline uint8_t mmioin8(uint64_t Address)
+    {
+        asmv("" ::
+                 : "memory");
+        uint8_t Result = *(volatile uint8_t *)(uintptr_t)Address;
+        asmv("" ::
+                 : "memory");
+        return Result;
+    }
+
+    static inline uint16_t mmioin16(uint64_t Address)
+    {
+        asmv("" ::
+                 : "memory");
+        uint16_t Result = *(volatile uint16_t *)(uintptr_t)Address;
+        asmv("" ::
+                 : "memory");
+        return Result;
+    }
+
+    static inline uint32_t mmioin32(uint64_t Address)
+    {
+        asmv("" ::
+                 : "memory");
+        uint32_t Result = *(volatile uint32_t *)(uintptr_t)Address;
+        asmv("" ::
+                 : "memory");
+        return Result;
+    }
+
+    static inline uint64_t mmioin64(uint64_t Address)
+    {
+        asmv("" ::
+                 : "memory");
+        uint64_t Result = *(volatile uint64_t *)(uintptr_t)Address;
+        asmv("" ::
+                 : "memory");
+        return Result;
+    }
+
+    static inline void mmioout8(uint64_t Address, uint8_t Data)
+    {
+        asmv("" ::
+                 : "memory");
+        *(volatile uint8_t *)Address = Data;
+        asmv("" ::
+                 : "memory");
+    }
+
+    static inline void mmioout16(uint64_t Address, uint16_t Data)
+    {
+        asmv("" ::
+                 : "memory");
+        *(volatile uint16_t *)Address = Data;
+        asmv("" ::
+                 : "memory");
+    }
+
+    static inline void mmioout32(uint64_t Address, uint32_t Data)
+    {
+        asmv("" ::
+                 : "memory");
+        *(volatile uint32_t *)Address = Data;
+        asmv("" ::
+                 : "memory");
+    }
+
+    static inline void mmioout64(uint64_t Address, uint64_t Data)
+    {
+        asmv("" ::
+                 : "memory");
+        *(volatile uint64_t *)Address = Data;
+        asmv("" ::
+                 : "memory");
+    }
+
+    static inline void mmoutb(void *Address, uint8_t Value)
+    {
+        asmv("mov %1, %0"
+             : "=m"((*(uint8_t *)(Address)))
+             : "r"(Value)
+             : "memory");
+    }
+
+    static inline void mmoutw(void *Address, uint16_t Value)
+    {
+        asmv("mov %1, %0"
+             : "=m"((*(uint16_t *)(Address)))
+             : "r"(Value)
+             : "memory");
+    }
+
+    static inline void mmoutl(void *Address, uint32_t Value)
+    {
+        asmv("mov %1, %0"
+             : "=m"((*(uint32_t *)(Address)))
+             : "r"(Value)
+             : "memory");
+    }
+
+    static inline void mmoutq(void *Address, uint64_t Value)
+    {
+        asmv("mov %1, %0"
+             : "=m"((*(uint64_t *)(Address)))
+             : "r"(Value)
+             : "memory");
+    }
+
+    static inline uint8_t mminb(void *Address)
+    {
+        uint8_t Result;
+        asmv("mov %1, %0"
+             : "=r"(Result)
+             : "m"((*(uint8_t *)(Address)))
+             : "memory");
+        return Result;
+    }
+
+    static inline uint16_t mminw(void *Address)
+    {
+        uint16_t Result;
+        asmv("mov %1, %0"
+             : "=r"(Result)
+             : "m"((*(uint16_t *)(Address)))
+             : "memory");
+        return Result;
+    }
+
+    static inline uint32_t mminl(void *Address)
+    {
+        uint32_t Result;
+        asmv("mov %1, %0"
+             : "=r"(Result)
+             : "m"((*(uint32_t *)(Address)))
+             : "memory");
+        return Result;
+    }
+
+    static inline uint64_t mminq(void *Address)
+    {
+        uint64_t Result;
+        asmv("mov %1, %0"
+             : "=r"(Result)
+             : "m"((*(uint64_t *)(Address)))
+             : "memory");
+        return Result;
+    }
+#ifdef __cplusplus
+}
+#endif
+
+#define inb(Port) inportb(Port)
+#define inw(Port) inportw(Port)
+#define inl(Port) inportl(Port)
+#define outb(Port, Data) outportb(Port, Data)
+#define outw(Port, Data) outportw(Port, Data)
+#define outl(Port, Data) outportl(Port, Data)
+
+#endif // defined(a86)
+
+#endif // !__FENNIX_KERNEL_IO_H__
diff --git a/Kernel/include/ipc.hpp b/Kernel/include/ipc.hpp
new file mode 100644
index 00000000..1ffc0a37
--- /dev/null
+++ b/Kernel/include/ipc.hpp
@@ -0,0 +1,92 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_IPC_H__
+#define __FENNIX_KERNEL_IPC_H__
+
+#include <types.h>
+#include <filesystem.hpp>
+#include <memory.hpp>
+#include <lock.hpp>
+#include <vector>
+#include <atomic>
+
+namespace InterProcessCommunication
+{
+    typedef int IPCID;
+
+    enum IPCType
+    {
+        IPCNone,
+        IPCMessagePassing,
+        IPCPort,
+        IPCSharedMemory,
+        IPCPipe,
+        IPCSocket
+    };
+
+    enum IPCErrorCode
+    {
+        IPCError = -1,
+        IPCSuccess,
+        IPCNotListening,
+        IPCTimeout,
+        IPCInvalidCommand,
+        IPCAlreadyAllocated,
+        IPCNotAllocated,
+        IPCIDInUse,
+        IPCIDNotRegistered,
+        IPCIDNotFound
+    };
+
+    struct IPCHandle
+    {
+        IPCID ID;
+        VirtualFileSystem::Node *Node;
+        void *Buffer;
+        long Length;
+        std::atomic_bool Listening;
+    };
+
+    class IPC
+    {
+    private:
+        NewLock(IPCLock);
+        IPCID NextID = 0;
+        std::vector<IPCHandle *> Handles;
+        Memory::MemMgr *mem;
+        VirtualFileSystem::Node *IPCNode;
+        void *Process;
+
+    public:
+        IPCHandle *Create(IPCType Type, char UniqueToken[16]);
+        IPCErrorCode Destroy(IPCID ID);
+        IPCErrorCode Allocate(IPCID ID, long Size);
+        IPCErrorCode Deallocate(IPCID ID);
+        IPCErrorCode Read(IPCID ID, void *Buffer, long Size);
+        IPCErrorCode Write(IPCID ID, void *Buffer, long Size);
+        IPCErrorCode Listen(IPCID ID, bool Listen);
+        IPCErrorCode Wait(IPCID ID);
+        IPCHandle *SearchByToken(char UniqueToken[16]);
+        int HandleSyscall(long Command, long Type, int ID, int Flags, void *Buffer, size_t Size);
+
+        IPC(void *Process);
+        ~IPC();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_IPC_H__
diff --git a/Kernel/include/kconfig.hpp b/Kernel/include/kconfig.hpp
new file mode 100644
index 00000000..6afcd2e9
--- /dev/null
+++ b/Kernel/include/kconfig.hpp
@@ -0,0 +1,40 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_KERNEL_CONFIG_H__
+#define __FENNIX_KERNEL_KERNEL_CONFIG_H__
+
+#include <types.h>
+#include <memory.hpp>
+
+struct KernelConfig
+{
+    Memory::MemoryAllocatorType AllocatorType;
+    bool SchedulerType;
+    char DriverDirectory[256];
+    char InitPath[256];
+    bool InterruptsOnCrash;
+    int Cores;
+    int IOAPICInterruptCore;
+    bool UnlockDeadLock;
+    bool SIMD;
+    bool BootAnimation;
+};
+
+void ParseConfig(char *ConfigString, KernelConfig *ModConfig);
+
+#endif // !__FENNIX_KERNEL_KERNEL_CONFIG_H__
diff --git a/Kernel/include/lock.hpp b/Kernel/include/lock.hpp
new file mode 100644
index 00000000..31fd7b1c
--- /dev/null
+++ b/Kernel/include/lock.hpp
@@ -0,0 +1,159 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_LOCK_H__
+#define __FENNIX_KERNEL_LOCK_H__
+
+#include <types.h>
+
+#include <cpu.hpp>
+#include <atomic>
+
+#ifdef __cplusplus
+
+/* Enabled ONLY on crash. */
+extern bool ForceUnlock;
+
+/**
+ * @brief Get how many locks are currently in use.
+ *
+ * @return size_t
+ */
+size_t GetLocksCount();
+
+/** @brief Please use this macro to create a new lock. */
+class LockClass
+{
+    struct SpinLockData
+    {
+        std::atomic_uint64_t LockData = 0x0;
+        std::atomic<const char *> CurrentHolder = "(nul)";
+        std::atomic<const char *> AttemptingToGet = "(nul)";
+        std::atomic_uintptr_t StackPointerHolder = 0;
+        std::atomic_uintptr_t StackPointerAttempt = 0;
+        std::atomic_size_t Count = 0;
+        std::atomic_long Core = 0;
+    };
+
+private:
+    SpinLockData LockData;
+    std::atomic_bool IsLocked = false;
+    std::atomic_ulong DeadLocks = 0;
+
+    void DeadLock(SpinLockData Lock);
+    void TimeoutDeadLock(SpinLockData Lock, uint64_t Timeout);
+
+public:
+    SpinLockData *GetLockData() { return &LockData; }
+    int Lock(const char *FunctionName);
+    int Unlock();
+
+    int TimeoutLock(const char *FunctionName, uint64_t Timeout);
+};
+
+/** @brief Please use this macro to create a new smart lock. */
+class SmartLockClass
+{
+private:
+    LockClass *LockPointer = nullptr;
+
+public:
+    SmartLockClass(LockClass &Lock, const char *FunctionName)
+    {
+        this->LockPointer = &Lock;
+        this->LockPointer->Lock(FunctionName);
+    }
+    ~SmartLockClass() { this->LockPointer->Unlock(); }
+};
+
+class SmartTimeoutLockClass
+{
+private:
+    LockClass *LockPointer = nullptr;
+
+public:
+    SmartTimeoutLockClass(LockClass &Lock, const char *FunctionName, uint64_t Timeout)
+    {
+        this->LockPointer = &Lock;
+        this->LockPointer->TimeoutLock(FunctionName, Timeout);
+    }
+    ~SmartTimeoutLockClass() { this->LockPointer->Unlock(); }
+};
+
+/** @brief Please use this macro to create a new smart critical section lock. */
+class SmartLockCriticalSectionClass
+{
+private:
+    LockClass *LockPointer = nullptr;
+    bool InterruptsEnabled = false;
+
+public:
+    SmartLockCriticalSectionClass(LockClass &Lock, const char *FunctionName)
+    {
+        if (CPU::Interrupts(CPU::Check))
+            InterruptsEnabled = true;
+        CPU::Interrupts(CPU::Disable);
+        this->LockPointer = &Lock;
+        this->LockPointer->Lock(FunctionName);
+    }
+    ~SmartLockCriticalSectionClass()
+    {
+        this->LockPointer->Unlock();
+        if (InterruptsEnabled)
+            CPU::Interrupts(CPU::Enable);
+    }
+};
+
+/** @brief Please use this macro to create a new critical section. */
+class SmartCriticalSectionClass
+{
+private:
+    bool InterruptsEnabled = false;
+
+public:
+    bool IsInterruptsEnabled() { return InterruptsEnabled; }
+
+    SmartCriticalSectionClass()
+    {
+        if (CPU::Interrupts(CPU::Check))
+            InterruptsEnabled = true;
+        CPU::Interrupts(CPU::Disable);
+    }
+    ~SmartCriticalSectionClass()
+    {
+        if (InterruptsEnabled)
+            CPU::Interrupts(CPU::Enable);
+    }
+};
+
+/** @brief Create a new lock (can be used with SmartCriticalSection). */
+#define NewLock(Name) LockClass Name
+
+/** @brief Simple lock that is automatically released when the scope ends. */
+#define SmartLock(LockClassName) SmartLockClass CONCAT(lock##_, __COUNTER__)(LockClassName, __FUNCTION__)
+
+/** @brief Simple lock with timeout that is automatically released when the scope ends. */
+#define SmartTimeoutLock(LockClassName, Timeout) SmartTimeoutLockClass CONCAT(lock##_, __COUNTER__)(LockClassName, __FUNCTION__, Timeout)
+
+/** @brief Simple critical section that is automatically released when the scope ends and interrupts are restored if they were enabled. */
+#define SmartCriticalSection(LockClassName) SmartLockCriticalSectionClass CONCAT(lock##_, __COUNTER__)(LockClassName, __FUNCTION__)
+
+/** @brief Automatically disable interrupts and restore them when the scope ends. */
+#define CriticalSection SmartCriticalSectionClass
+
+#endif // __cplusplus
+#endif // !__FENNIX_KERNEL_LOCK_H__
diff --git a/Kernel/include/md5.h b/Kernel/include/md5.h
new file mode 100644
index 00000000..382d47ab
--- /dev/null
+++ b/Kernel/include/md5.h
@@ -0,0 +1,54 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_MD5_H__
+#define __FENNIX_KERNEL_MD5_H__
+
+#include <types.h>
+
+/*
+https://github.com/Zunawe/md5-c
+*/
+
+START_EXTERNC
+
+typedef struct
+{
+    size_t size;      // Size of input in bytes
+    uint32_t buffer[4]; // Current accumulation of hash
+    uint8_t input[64];  // Input to be used in the next step
+    uint8_t digest[16]; // Result of algorithm
+} MD5Context;
+
+void md5Init(MD5Context *ctx);
+void md5Update(MD5Context *ctx, uint8_t *input, size_t input_len);
+void md5Finalize(MD5Context *ctx);
+void md5Step(uint32_t *buffer, uint32_t *input);
+
+uint8_t *md5String(char *input);
+uint8_t *md5File(uint8_t *buffer, size_t input_len);
+
+uint32_t F(uint32_t X, uint32_t Y, uint32_t Z);
+uint32_t G(uint32_t X, uint32_t Y, uint32_t Z);
+uint32_t H(uint32_t X, uint32_t Y, uint32_t Z);
+uint32_t I(uint32_t X, uint32_t Y, uint32_t Z);
+
+uint32_t rotateLeft(uint32_t x, uint32_t n);
+
+END_EXTERNC
+
+#endif // !__FENNIX_KERNEL_MD5_H__
diff --git a/Kernel/include/memory.hpp b/Kernel/include/memory.hpp
new file mode 100644
index 00000000..f8884b5f
--- /dev/null
+++ b/Kernel/include/memory.hpp
@@ -0,0 +1,898 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_INTERNAL_MEMORY_H__
+#define __FENNIX_KERNEL_INTERNAL_MEMORY_H__
+
+#ifdef __cplusplus
+#include <filesystem.hpp>
+#include <boot/binfo.h>
+#include <bitmap.hpp>
+#include <lock.hpp>
+#include <std.hpp>
+#endif // __cplusplus
+#include <types.h>
+
+#ifdef __cplusplus
+
+extern uintptr_t _kernel_start, _kernel_end;
+extern uintptr_t _bootstrap_start, _bootstrap_end;
+extern uintptr_t _kernel_text_end, _kernel_data_end, _kernel_rodata_end;
+
+// kilobyte
+#define TO_KB(d) ((d) / 1024)
+// megabyte
+#define TO_MB(d) ((d) / 1024 / 1024)
+// gigabyte
+#define TO_GB(d) ((d) / 1024 / 1024 / 1024)
+// terabyte
+#define TO_TB(d) ((d) / 1024 / 1024 / 1024 / 1024)
+// petabyte
+#define TO_PB(d) ((d) / 1024 / 1024 / 1024 / 1024 / 1024)
+// exobyte
+#define TO_EB(d) ((d) / 1024 / 1024 / 1024 / 1024 / 1024 / 1024)
+// zettabyte
+#define TO_ZB(d) ((d) / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024)
+// yottabyte
+#define TO_YB(d) ((d) / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024)
+// brontobyte
+#define TO_BB(d) ((d) / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024)
+// geopbyte
+#define TO_GPB(d) ((d) / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024 / 1024)
+
+#define PAGE_SIZE 0x1000        // 4KB
+#define PAGE_SIZE_4K PAGE_SIZE  // 4KB
+#define PAGE_SIZE_2M 0x200000   // 2MB
+#define PAGE_SIZE_1G 0x40000000 // 1GB
+
+#define STACK_SIZE 0x4000      // 16kb
+#define USER_STACK_SIZE 0x2000 // 8kb
+
+// To pages
+#define TO_PAGES(d) (((d) + PAGE_SIZE - 1) / PAGE_SIZE)
+// From pages
+#define FROM_PAGES(d) ((d)*PAGE_SIZE)
+
+#if defined(a64) || defined(aa64)
+#define NORMAL_VMA_OFFSET 0xFFFF800000000000
+#define KERNEL_VMA_OFFSET 0xFFFFFFFF80000000
+#define KERNEL_HEAP_BASE 0xFFFFA00000000000
+#define USER_HEAP_BASE 0xFFFFB00000000000
+#define USER_STACK_BASE 0xFFFFEFFFFFFF0000
+#elif defined(a32)
+#define NORMAL_VMA_OFFSET 0x80000000
+#define KERNEL_VMA_OFFSET 0xC0000000
+#define KERNEL_HEAP_BASE 0xA0000000
+#define USER_HEAP_BASE 0xB0000000
+#define USER_STACK_BASE 0xEFFFFFFF
+#endif
+
+namespace Memory
+{
+    enum MemoryAllocatorType
+    {
+        None,
+        Pages,
+        XallocV1,
+        liballoc11
+    };
+
+    /**
+     * @brief https://wiki.osdev.org/images/4/41/64-bit_page_tables1.png
+     * @brief https://wiki.osdev.org/images/6/6b/64-bit_page_tables2.png
+     */
+    enum PTFlag
+    {
+        /** @brief Present */
+        P = 1 << 0,
+
+        /** @brief Read/Write */
+        RW = 1 << 1,
+
+        /** @brief User/Supervisor */
+        US = 1 << 2,
+
+        /** @brief Write-Through */
+        PWT = 1 << 3,
+
+        /** @brief Cache Disable */
+        PCD = 1 << 4,
+
+        /** @brief Accessed */
+        A = 1 << 5,
+
+        /** @brief Dirty */
+        D = 1 << 6,
+
+        /** @brief Page Size */
+        PS = 1 << 7,
+
+        /** @brief Global */
+        G = 1 << 8,
+
+        /** @brief Available 0 */
+        AVL0 = 1 << 9,
+
+        /** @brief Available 1 */
+        AVL1 = 1 << 10,
+
+        /** @brief Available 2 */
+        AVL2 = 1 << 11,
+
+        /** @brief Page Attribute Table */
+        PAT = 1 << 12,
+
+        /** @brief Available 3 */
+        AVL3 = (uint64_t)1 << 52,
+
+        /** @brief Available 4 */
+        AVL4 = (uint64_t)1 << 53,
+
+        /** @brief Available 5 */
+        AVL5 = (uint64_t)1 << 54,
+
+        /** @brief Available 6 */
+        AVL6 = (uint64_t)1 << 55,
+
+        /** @brief Available 7 */
+        AVL7 = (uint64_t)1 << 56,
+
+        /** @brief Available 8 */
+        AVL8 = (uint64_t)1 << 57,
+
+        /** @brief Available 9 */
+        AVL9 = (uint64_t)1 << 58,
+
+        /** @brief Protection Key 0 */
+        PK0 = (uint64_t)1 << 59,
+
+        /** @brief Protection Key 1 */
+        PK1 = (uint64_t)1 << 60,
+
+        /** @brief Protection Key 2 */
+        PK2 = (uint64_t)1 << 61,
+
+        /** @brief Protection Key 3 */
+        PK3 = (uint64_t)1 << 62,
+
+        /** @brief Execute Disable */
+        XD = (uint64_t)1 << 63
+    };
+
+    /* 2.2 Paging in IA-32e Mode - https://composter.com.ua/documents/TLBs_Paging-Structure_Caches_and_Their_Invalidation.pdf */
+
+    union __packed PageTableEntry
+    {
+        struct
+        {
+            uint64_t Present : 1;            // 0
+            uint64_t ReadWrite : 1;          // 1
+            uint64_t UserSupervisor : 1;     // 2
+            uint64_t WriteThrough : 1;       // 3
+            uint64_t CacheDisable : 1;       // 4
+            uint64_t Accessed : 1;           // 5
+            uint64_t Dirty : 1;              // 6
+            uint64_t PageAttributeTable : 1; // 7
+            uint64_t Global : 1;             // 8
+            uint64_t Available0 : 3;         // 9-11
+            uint64_t Address : 40;           // 12-51
+            uint64_t Available1 : 7;         // 52-58
+            uint64_t ProtectionKey : 4;      // 59-62
+            uint64_t ExecuteDisable : 1;     // 63
+        };
+        uint64_t raw;
+
+        /** @brief Set Address */
+        void SetAddress(uintptr_t _Address)
+        {
+#if defined(a64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#elif defined(a32)
+            _Address &= 0x000FFFFF;
+            this->raw &= 0xFFC00003;
+            this->raw |= (_Address << 12);
+#elif defined(aa64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#endif
+        }
+
+        /** @brief Get Address */
+        uintptr_t GetAddress()
+        {
+#if defined(a64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#elif defined(a32)
+            return (this->raw & 0x003FFFFF000) >> 12;
+#elif defined(aa64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#endif
+        }
+    };
+
+    struct __packed PageTableEntryPtr
+    {
+        PageTableEntry Entries[512];
+    };
+
+    union __packed PageDirectoryEntry
+    {
+        struct
+        {
+            uint64_t Present : 1;        // 0
+            uint64_t ReadWrite : 1;      // 1
+            uint64_t UserSupervisor : 1; // 2
+            uint64_t WriteThrough : 1;   // 3
+            uint64_t CacheDisable : 1;   // 4
+            uint64_t Accessed : 1;       // 5
+            uint64_t Available0 : 1;     // 6
+            uint64_t PageSize : 1;       // 7
+            uint64_t Available1 : 4;     // 8-11
+            uint64_t Address : 40;       // 12-51
+            uint64_t Available2 : 11;    // 52-62
+            uint64_t ExecuteDisable : 1; // 63
+        };
+
+        struct
+        {
+            uint64_t Present : 1;            // 0
+            uint64_t ReadWrite : 1;          // 1
+            uint64_t UserSupervisor : 1;     // 2
+            uint64_t WriteThrough : 1;       // 3
+            uint64_t CacheDisable : 1;       // 4
+            uint64_t Accessed : 1;           // 5
+            uint64_t Dirty : 1;              // 6
+            uint64_t PageSize : 1;           // 7
+            uint64_t Global : 1;             // 8
+            uint64_t Available0 : 3;         // 9-11
+            uint64_t PageAttributeTable : 1; // 12
+            uint64_t Reserved0 : 8;          // 13-20
+            uint64_t Address : 31;           // 21-51
+            uint64_t Available1 : 7;         // 52-58
+            uint64_t ProtectionKey : 4;      // 59-62
+            uint64_t ExecuteDisable : 1;     // 63
+        } TwoMB;
+
+        uint64_t raw;
+
+        /** @brief Set PageTableEntryPtr address */
+        void SetAddress(uintptr_t _Address)
+        {
+#if defined(a64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#elif defined(a32)
+            _Address &= 0x000FFFFF;
+            this->raw &= 0xFFC00003;
+            this->raw |= (_Address << 12);
+#elif defined(aa64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#endif
+        }
+
+        /** @brief Get PageTableEntryPtr address */
+        uintptr_t GetAddress()
+        {
+#if defined(a64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#elif defined(a32)
+            return (this->raw & 0x003FFFFF000) >> 12;
+#elif defined(aa64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#endif
+        }
+    };
+
+    struct __packed PageDirectoryEntryPtr
+    {
+        PageDirectoryEntry Entries[512];
+    };
+
+    union __packed PageDirectoryPointerTableEntry
+    {
+        struct
+        {
+            uint64_t Present : 1;        // 0
+            uint64_t ReadWrite : 1;      // 1
+            uint64_t UserSupervisor : 1; // 2
+            uint64_t WriteThrough : 1;   // 3
+            uint64_t CacheDisable : 1;   // 4
+            uint64_t Accessed : 1;       // 5
+            uint64_t Available0 : 1;     // 6
+            uint64_t PageSize : 1;       // 7
+            uint64_t Available1 : 4;     // 8-11
+            uint64_t Address : 40;       // 12-51
+            uint64_t Available2 : 11;    // 52-62
+            uint64_t ExecuteDisable : 1; // 63
+        };
+
+        struct
+        {
+            uint64_t Present : 1;            // 0
+            uint64_t ReadWrite : 1;          // 1
+            uint64_t UserSupervisor : 1;     // 2
+            uint64_t WriteThrough : 1;       // 3
+            uint64_t CacheDisable : 1;       // 4
+            uint64_t Accessed : 1;           // 5
+            uint64_t Dirty : 1;              // 6
+            uint64_t PageSize : 1;           // 7
+            uint64_t Global : 1;             // 8
+            uint64_t Available0 : 3;         // 9-11
+            uint64_t PageAttributeTable : 1; // 12
+            uint64_t Reserved0 : 17;         // 13-29
+            uint64_t Address : 22;           // 30-51
+            uint64_t Available1 : 7;         // 52-58
+            uint64_t ProtectionKey : 4;      // 59-62
+            uint64_t ExecuteDisable : 1;     // 63
+        } OneGB;
+
+        uint64_t raw;
+
+        /** @brief Set PageDirectoryEntryPtr address */
+        void SetAddress(uintptr_t _Address)
+        {
+#if defined(a64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#elif defined(a32)
+            _Address &= 0x000FFFFF;
+            this->raw &= 0xFFC00003;
+            this->raw |= (_Address << 12);
+#elif defined(aa64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#endif
+        }
+
+        /** @brief Get PageDirectoryEntryPtr address */
+        uintptr_t GetAddress()
+        {
+#if defined(a64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#elif defined(a32)
+            return (this->raw & 0x003FFFFF000) >> 12;
+#elif defined(aa64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#endif
+        }
+    };
+
+    struct __packed PageDirectoryPointerTableEntryPtr
+    {
+        PageDirectoryPointerTableEntry Entries[512];
+    };
+
+    union __packed PageMapLevel4
+    {
+        struct
+        {
+            uint64_t Present : 1;        // 0
+            uint64_t ReadWrite : 1;      // 1
+            uint64_t UserSupervisor : 1; // 2
+            uint64_t WriteThrough : 1;   // 3
+            uint64_t CacheDisable : 1;   // 4
+            uint64_t Accessed : 1;       // 5
+            uint64_t Available0 : 1;     // 6
+            uint64_t Reserved0 : 1;      // 7
+            uint64_t Available1 : 4;     // 8-11
+            uint64_t Address : 40;       // 12-51
+            uint64_t Available2 : 11;    // 52-62
+            uint64_t ExecuteDisable : 1; // 63
+        };
+        uint64_t raw;
+
+        /** @brief Set PageDirectoryPointerTableEntryPtr address */
+        void SetAddress(uintptr_t _Address)
+        {
+#if defined(a64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#elif defined(a32)
+            _Address &= 0x000FFFFF;
+            this->raw &= 0xFFC00003;
+            this->raw |= (_Address << 12);
+#elif defined(aa64)
+            _Address &= 0x000000FFFFFFFFFF;
+            this->raw &= 0xFFF0000000000FFF;
+            this->raw |= (_Address << 12);
+#endif
+        }
+
+        /** @brief Get PageDirectoryPointerTableEntryPtr address */
+        uintptr_t GetAddress()
+        {
+#if defined(a64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#elif defined(a32)
+            return (this->raw & 0x003FFFFF000) >> 12;
+#elif defined(aa64)
+            return (this->raw & 0x000FFFFFFFFFF000) >> 12;
+#endif
+        }
+    };
+
+    struct PageTable4
+    {
+        PageMapLevel4 Entries[512];
+
+        /**
+         * @brief Update CR3 with this PageTable4
+         */
+        void Update()
+        {
+#if defined(a86)
+            asmv("mov %0, %%cr3" ::"r"(this));
+#elif defined(aa64)
+            asmv("msr ttbr0_el1, %0" ::"r"(this));
+#endif
+        }
+    } __aligned(0x1000);
+
+    struct __packed PageMapLevel5
+    {
+        /* FIXME: NOT IMPLEMENTED! */
+    };
+
+    struct PageTable5
+    {
+        PageMapLevel5 Entries[512];
+    } __aligned(0x1000);
+
+    class Physical
+    {
+    private:
+        NewLock(MemoryLock);
+
+        uint64_t TotalMemory = 0;
+        uint64_t FreeMemory = 0;
+        uint64_t ReservedMemory = 0;
+        uint64_t UsedMemory = 0;
+        uint64_t PageBitmapIndex = 0;
+        Bitmap PageBitmap;
+
+    public:
+        Bitmap GetPageBitmap() { return PageBitmap; }
+
+        /**
+         * @brief Get Total Memory
+         *
+         * @return uint64_t
+         */
+        uint64_t GetTotalMemory();
+
+        /**
+         * @brief Get Free Memory
+         *
+         * @return uint64_t
+         */
+        uint64_t GetFreeMemory();
+
+        /**
+         * @brief Get Reserved Memory
+         *
+         * @return uint64_t
+         */
+        uint64_t GetReservedMemory();
+
+        /**
+         * @brief Get Used Memory
+         *
+         * @return uint64_t
+         */
+        uint64_t GetUsedMemory();
+
+        /**
+         * @brief Swap page
+         *
+         * @param Address Address of the page
+         * @return true if swap was successful
+         * @return false if swap was unsuccessful
+         */
+        bool SwapPage(void *Address);
+
+        /**
+         * @brief Swap pages
+         *
+         * @param Address Address of the pages
+         * @param PageCount Number of pages
+         * @return true if swap was successful
+         * @return false if swap was unsuccessful
+         */
+        bool SwapPages(void *Address, size_t PageCount);
+
+        /**
+         * @brief Unswap page
+         *
+         * @param Address Address of the page
+         * @return true if unswap was successful
+         * @return false if unswap was unsuccessful
+         */
+        bool UnswapPage(void *Address);
+
+        /**
+         * @brief Unswap pages
+         *
+         * @param Address Address of the pages
+         * @param PageCount Number of pages
+         * @return true if unswap was successful
+         * @return false if unswap was unsuccessful
+         */
+        bool UnswapPages(void *Address, size_t PageCount);
+
+        /**
+         * @brief Lock page
+         *
+         * @param Address Address of the page
+         */
+        void LockPage(void *Address);
+
+        /**
+         * @brief Lock pages
+         *
+         * @param Address Address of the pages
+         * @param PageCount Number of pages
+         */
+        void LockPages(void *Address, size_t PageCount);
+
+        void ReservePage(void *Address);
+        void ReservePages(void *Address, size_t PageCount);
+        void UnreservePage(void *Address);
+        void UnreservePages(void *Address, size_t PageCount);
+
+        /**
+         * @brief Request page
+         *
+         * @return void* Allocated page address
+         */
+        void *RequestPage();
+
+        /**
+         * @brief Request pages
+         *
+         * @param PageCount Number of pages
+         * @return void* Allocated pages address
+         */
+        void *RequestPages(size_t Count);
+
+        /**
+         * @brief Free page
+         *
+         * @param Address Address of the page
+         */
+        void FreePage(void *Address);
+
+        /**
+         * @brief Free pages
+         *
+         * @param Address Address of the pages
+         * @param PageCount Number of pages
+         */
+        void FreePages(void *Address, size_t Count);
+
+        /** @brief Do not use. */
+        void Init(BootInfo *Info);
+
+        /** @brief Do not use. */
+        Physical();
+
+        /** @brief Do not use. */
+        ~Physical();
+    };
+
+    class Virtual
+    {
+    private:
+        NewLock(MemoryLock);
+        PageTable4 *Table = nullptr;
+
+    public:
+        enum MapType
+        {
+            NoMapType,
+            FourKB,
+            TwoMB,
+            OneGB
+        };
+
+        class PageMapIndexer
+        {
+        public:
+            uintptr_t PMLIndex = 0;
+            uintptr_t PDPTEIndex = 0;
+            uintptr_t PDEIndex = 0;
+            uintptr_t PTEIndex = 0;
+            PageMapIndexer(uintptr_t VirtualAddress);
+        };
+
+        /**
+         * @brief Check if page has the specified flag.
+         *
+         * @param VirtualAddress Virtual address of the page
+         * @param Flag Flag to check
+         * @param Type Type of the page. Check MapType enum.
+         * @return true if page has the specified flag.
+         * @return false if page is has the specified flag.
+         */
+        bool Check(void *VirtualAddress, PTFlag Flag = PTFlag::P, MapType Type = MapType::FourKB);
+
+        /**
+         * @brief Get physical address of the page.
+         * @param VirtualAddress Virtual address of the page.
+         * @return Physical address of the page.
+         */
+        void *GetPhysical(void *VirtualAddress);
+
+        /**
+         * @brief Map page.
+         *
+         * @param VirtualAddress Virtual address of the page.
+         * @param PhysicalAddress Physical address of the page.
+         * @param Flags Flags of the page. Check PTFlag enum.
+         * @param Type Type of the page. Check MapType enum.
+         */
+        void Map(void *VirtualAddress, void *PhysicalAddress, uint64_t Flag = PTFlag::P, MapType Type = MapType::FourKB);
+
+        /**
+         * @brief Map multiple pages.
+         *
+         * @param VirtualAddress First virtual address of the page.
+         * @param PhysicalAddress First physical address of the page.
+         * @param Length Length to map.
+         * @param Flags Flags of the page. Check PTFlag enum.
+         * @param Type Type of the page. Check MapType enum.
+         */
+        __always_inline inline void Map(void *VirtualAddress, void *PhysicalAddress, size_t Length, uint64_t Flags, MapType Type = MapType::FourKB)
+        {
+            int PageSize = PAGE_SIZE_4K;
+
+            if (Type == MapType::TwoMB)
+                PageSize = PAGE_SIZE_2M;
+            else if (Type == MapType::OneGB)
+                PageSize = PAGE_SIZE_1G;
+
+            for (uintptr_t i = 0; i < Length; i += PageSize)
+                this->Map((void *)((uintptr_t)VirtualAddress + i), (void *)((uintptr_t)PhysicalAddress + i), Flags, Type);
+        }
+
+        /**
+         * @brief Map multiple pages efficiently.
+         *
+         * This function will detect the best page size to map the pages.
+         *
+         * @note This function will not check if PSE or 1GB pages are enabled or supported.
+         *
+         * @param VirtualAddress First virtual address of the page.
+         * @param PhysicalAddress First physical address of the page.
+         * @param Length Length of the pages.
+         * @param Flags Flags of the page. Check PTFlag enum.
+         * @param Fit If true, the function will try to fit the pages in the smallest page size.
+         * @param FailOnModulo If true, the function will return NoMapType if the length is not a multiple of the page size.
+         * @return The best page size to map the pages.
+         */
+        __always_inline inline MapType OptimizedMap(void *VirtualAddress, void *PhysicalAddress, size_t Length, uint64_t Flags, bool Fit = false, bool FailOnModulo = false)
+        {
+            if (unlikely(Fit))
+            {
+                while (Length >= PAGE_SIZE_1G)
+                {
+                    this->Map(VirtualAddress, PhysicalAddress, Length, Flags, Virtual::MapType::OneGB);
+                    VirtualAddress = (void *)((uintptr_t)VirtualAddress + PAGE_SIZE_1G);
+                    PhysicalAddress = (void *)((uintptr_t)PhysicalAddress + PAGE_SIZE_1G);
+                    Length -= PAGE_SIZE_1G;
+                }
+
+                while (Length >= PAGE_SIZE_2M)
+                {
+                    this->Map(VirtualAddress, PhysicalAddress, Length, Flags, Virtual::MapType::TwoMB);
+                    VirtualAddress = (void *)((uintptr_t)VirtualAddress + PAGE_SIZE_2M);
+                    PhysicalAddress = (void *)((uintptr_t)PhysicalAddress + PAGE_SIZE_2M);
+                    Length -= PAGE_SIZE_2M;
+                }
+
+                while (Length >= PAGE_SIZE_4K)
+                {
+                    this->Map(VirtualAddress, PhysicalAddress, Length, Flags, Virtual::MapType::FourKB);
+                    VirtualAddress = (void *)((uintptr_t)VirtualAddress + PAGE_SIZE_4K);
+                    PhysicalAddress = (void *)((uintptr_t)PhysicalAddress + PAGE_SIZE_4K);
+                    Length -= PAGE_SIZE_4K;
+                }
+
+                return Virtual::MapType::FourKB;
+            }
+
+            Virtual::MapType Type = Virtual::MapType::FourKB;
+
+            if (Length >= PAGE_SIZE_1G)
+            {
+                Type = Virtual::MapType::OneGB;
+                if (Length % PAGE_SIZE_1G != 0)
+                {
+                    warn("Length is not a multiple of 1GB.");
+                    if (FailOnModulo)
+                        return Virtual::MapType::NoMapType;
+                }
+            }
+            else if (Length >= PAGE_SIZE_2M)
+            {
+                Type = Virtual::MapType::TwoMB;
+                if (Length % PAGE_SIZE_2M != 0)
+                {
+                    warn("Length is not a multiple of 2MB.");
+                    if (FailOnModulo)
+                        return Virtual::MapType::NoMapType;
+                }
+            }
+
+            this->Map(VirtualAddress, PhysicalAddress, Length, Flags, Type);
+            return Type;
+        }
+
+        /**
+         * @brief Unmap page.
+         *
+         * @param VirtualAddress Virtual address of the page.
+         * @param Type Type of the page. Check MapType enum.
+         */
+        void Unmap(void *VirtualAddress, MapType Type = MapType::FourKB);
+
+        /**
+         * @brief Unmap multiple pages.
+         *
+         * @param VirtualAddress First virtual address of the page.
+         * @param Length Length to map.
+         * @param Type Type of the page. Check MapType enum.
+         */
+        __always_inline inline void Unmap(void *VirtualAddress, size_t Length, MapType Type = MapType::FourKB)
+        {
+            int PageSize = PAGE_SIZE_4K;
+
+            if (Type == MapType::TwoMB)
+                PageSize = PAGE_SIZE_2M;
+            else if (Type == MapType::OneGB)
+                PageSize = PAGE_SIZE_1G;
+
+            for (uintptr_t i = 0; i < Length; i += PageSize)
+                this->Unmap((void *)((uintptr_t)VirtualAddress + i), Type);
+        }
+
+        /**
+         * @brief Remap page.
+         *
+         * @param VirtualAddress Virtual address of the page.
+         * @param PhysicalAddress Physical address of the page.
+         * @param Flags Flags of the page. Check PTFlag enum.
+         * @param Type Type of the page. Check MapType enum.
+         */
+        __always_inline inline void Remap(void *VirtualAddress, void *PhysicalAddress, uint64_t Flags, MapType Type = MapType::FourKB)
+        {
+            this->Unmap(VirtualAddress, Type);
+            this->Map(VirtualAddress, PhysicalAddress, Flags, Type);
+        }
+
+        /**
+         * @brief Construct a new Virtual object
+         *
+         * @param Table Page table. If null, it will use the current page table.
+         */
+        Virtual(PageTable4 *Table = nullptr);
+
+        /**
+         * @brief Destroy the Virtual object
+         *
+         */
+        ~Virtual();
+    };
+
+    class StackGuard
+    {
+    private:
+        void *StackBottom = nullptr;
+        void *StackTop = nullptr;
+        void *StackPhyiscalBottom = nullptr;
+        void *StackPhyiscalTop = nullptr;
+        uint64_t Size = 0;
+        bool UserMode = false;
+        PageTable4 *Table = nullptr;
+
+    public:
+        /** @brief For general info */
+        void *GetStackBottom() { return StackBottom; }
+        /** @brief For RSP */
+        void *GetStackTop() { return StackTop; }
+        /** @brief For general info */
+        void *GetStackPhysicalBottom() { return StackPhyiscalBottom; }
+        /** @brief For general info */
+        void *GetStackPhysicalTop() { return StackPhyiscalTop; }
+        /** @brief Called by exception handler */
+        bool Expand(uintptr_t FaultAddress);
+        /**
+         * @brief Construct a new Stack Guard object
+         * @param User Stack for user mode?
+         */
+        StackGuard(bool User, PageTable4 *Table);
+        /**
+         * @brief Destroy the Stack Guard object
+         */
+        ~StackGuard();
+    };
+
+    class MemMgr
+    {
+    public:
+        struct AllocatedPages
+        {
+            void *Address;
+            size_t PageCount;
+        };
+
+        std::vector<AllocatedPages> GetAllocatedPagesList() { return AllocatedPagesList; }
+        uint64_t GetAllocatedMemorySize();
+
+        bool Add(void *Address, size_t Count);
+
+        void *RequestPages(size_t Count, bool User = false);
+        void FreePages(void *Address, size_t Count);
+
+        void DetachAddress(void *Address);
+
+        MemMgr(PageTable4 *PageTable = nullptr, VirtualFileSystem::Node *Directory = nullptr);
+        ~MemMgr();
+
+    private:
+        Bitmap PageBitmap;
+        PageTable4 *PageTable;
+        VirtualFileSystem::Node *Directory;
+
+        std::vector<AllocatedPages> AllocatedPagesList;
+    };
+}
+
+void InitializeMemoryManagement(BootInfo *Info);
+
+void *operator new(size_t Size);
+void *operator new[](size_t Size);
+void *operator new(size_t Size, std::align_val_t Alignment);
+void operator delete(void *Pointer);
+void operator delete[](void *Pointer);
+void operator delete(void *Pointer, long unsigned int Size);
+void operator delete[](void *Pointer, long unsigned int Size);
+
+extern Memory::Physical KernelAllocator;
+extern Memory::PageTable4 *KernelPageTable;
+
+#endif // __cplusplus
+
+EXTERNC void *malloc(size_t Size);
+EXTERNC void *calloc(size_t n, size_t Size);
+EXTERNC void *realloc(void *Address, size_t Size);
+EXTERNC void free(void *Address);
+
+#define kmalloc(Size) malloc(Size)
+#define kcalloc(n, Size) calloc(n, Size)
+#define krealloc(Address, Size) realloc(Address, Size)
+#define kfree(Address) free(Address)
+
+#endif // !__FENNIX_KERNEL_INTERNAL_MEMORY_H__
diff --git a/Kernel/include/msexec.h b/Kernel/include/msexec.h
new file mode 100644
index 00000000..d075cbdf
--- /dev/null
+++ b/Kernel/include/msexec.h
@@ -0,0 +1,248 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_MSEXEC_H__
+#define __FENNIX_KERNEL_MSEXEC_H__
+
+#include <types.h>
+
+// some of the code is from: https://github.com/dotnet/llilc/blob/main/include/clr/ntimage.h
+
+#define near /* __near */
+#define far  /* __far */
+#define NEAR near
+#define FAR far
+#define CONST const
+
+typedef char CHAR;
+typedef unsigned char UCHAR;
+typedef wchar_t WCHAR;
+typedef unsigned short USHORT;
+typedef long LONG;
+
+typedef unsigned long DWORD;
+typedef int BOOL;
+typedef unsigned char BYTE;
+typedef unsigned short WORD;
+typedef float FLOAT;
+typedef FLOAT *PFLOAT;
+typedef BOOL near *PBOOL;
+typedef BOOL far *LPBOOL;
+typedef BYTE near *PBYTE;
+typedef BYTE far *LPBYTE;
+typedef int near *PINT;
+typedef int far *LPINT;
+typedef WORD near *PWORD;
+typedef WORD far *LPWORD;
+typedef long far *LPLONG;
+typedef DWORD near *PDWORD;
+typedef DWORD far *LPDWORD;
+typedef void far *LPVOID;
+typedef CONST void far *LPCVOID;
+
+typedef int INT;
+typedef unsigned int UINT;
+typedef unsigned int *PUINT;
+
+typedef short SHORT;
+typedef DWORD ULONG;
+typedef double DOUBLE;
+
+#define IMAGE_DOS_SIGNATURE 0x5A4D      /* MZ */
+#define IMAGE_OS2_SIGNATURE 0x454E      /* NE */
+#define IMAGE_OS2_SIGNATURE_LE 0x454C   /* LE */
+#define IMAGE_NT_SIGNATURE 0x00004550   /* PE00 */
+#define IMAGE_EDOS_SIGNATURE 0x44454550 /* PEED */
+
+#define IMAGE_SIZEOF_FILE_HEADER 20
+
+#define IMAGE_FILE_MACHINE_UNKNOWN 0
+#define IMAGE_FILE_MACHINE_I860 0x14d
+#define IMAGE_FILE_MACHINE_I386 0x14c
+#define IMAGE_FILE_MACHINE_R3000 0x162
+#define IMAGE_FILE_MACHINE_R4000 0x166
+#define IMAGE_FILE_MACHINE_R10000 0x0168
+#define IMAGE_FILE_MACHINE_ALPHA 0x184
+#define IMAGE_FILE_MACHINE_POWERPC 0x01F0
+#define IMAGE_FILE_MACHINE_POWERPCBE 0x01F2
+#define IMAGE_FILE_MACHINE_SH3 0x01a2
+#define IMAGE_FILE_MACHINE_SH3E 0x01a4
+#define IMAGE_FILE_MACHINE_SH4 0x01a6
+#define IMAGE_FILE_MACHINE_ARM 0x01c0
+#define IMAGE_FILE_MACHINE_THUMB 0x01c2
+#define IMAGE_FILE_MACHINE_IA64 0x0200
+#define IMAGE_FILE_MACHINE_MIPS16 0x0266
+#define IMAGE_FILE_MACHINE_MIPSFPU 0x0366
+#define IMAGE_FILE_MACHINE_MIPSFPU16 0x0466
+#define IMAGE_FILE_MACHINE_ALPHA64 0x0284
+#define IMAGE_FILE_MACHINE_AXP64 IMAGE_FILE_MACHINE_ALPHA64
+#define IMAGE_FILE_MACHINE_AMD64 0x8664
+#define IMAGE_FILE_MACHINE_CEF 0xC0EF
+
+#define IMAGE_NUMBEROF_DIRECTORY_ENTRIES 16
+#define IMAGE_DIRECTORY_ENTRY_EXPORT 0
+#define IMAGE_DIRECTORY_ENTRY_IMPORT 1
+#define IMAGE_DIRECTORY_ENTRY_RESOURCE 2
+#define IMAGE_DIRECTORY_ENTRY_EXCEPTION 3
+#define IMAGE_DIRECTORY_ENTRY_SECURITY 4
+#define IMAGE_DIRECTORY_ENTRY_BASERELOC 5
+#define IMAGE_DIRECTORY_ENTRY_DEBUG 6
+#define IMAGE_DIRECTORY_ENTRY_ARCHITECTURE 7
+#define IMAGE_DIRECTORY_ENTRY_GLOBALPTR 8
+#define IMAGE_DIRECTORY_ENTRY_TLS 9
+#define IMAGE_DIRECTORY_ENTRY_LOAD_CONFIG 10
+#define IMAGE_DIRECTORY_ENTRY_BOUND_IMPORT 11
+#define IMAGE_DIRECTORY_ENTRY_IAT 12
+#define IMAGE_DIRECTORY_ENTRY_DELAY_IMPORT 13
+#define IMAGE_DIRECTORY_ENTRY_COM_DESCRIPTOR 14
+
+typedef struct _IMAGE_DOS_HEADER // DOS .EXE header
+{
+    USHORT e_magic;    // Magic number
+    USHORT e_cblp;     // Bytes on last page of file
+    USHORT e_cp;       // Pages in file
+    USHORT e_crlc;     // Relocations
+    USHORT e_cparhdr;  // Size of header in paragraphs
+    USHORT e_minalloc; // Minimum extra paragraphs needed
+    USHORT e_maxalloc; // Maximum extra paragraphs needed
+    USHORT e_ss;       // Initial (relative) SS value
+    USHORT e_sp;       // Initial SP value
+    USHORT e_csum;     // Checksum
+    USHORT e_ip;       // Initial IP value
+    USHORT e_cs;       // Initial (relative) CS value
+    USHORT e_lfarlc;   // File address of relocation table
+    USHORT e_ovno;     // Overlay number
+    USHORT e_res[4];   // Reserved words
+    USHORT e_oemid;    // OEM identifier (for e_oeminfo)
+    USHORT e_oeminfo;  // OEM information; e_oemid specific
+    USHORT e_res2[10]; // Reserved words
+    USHORT e_lfanew;   // File address of new exe header
+} IMAGE_DOS_HEADER, *PIMAGE_DOS_HEADER;
+
+typedef struct _IMAGE_OS2_HEADER // OS/2 .EXE header
+{
+    USHORT ne_magic;        // Magic number
+    UCHAR ne_ver;           // Version number
+    UCHAR ne_rev;           // Revision number
+    USHORT ne_enttab;       // Offset of Entry Table
+    USHORT ne_cbenttab;     // Number of bytes in Entry Table
+    UINT ne_crc;            // Checksum of whole file
+    USHORT ne_flags;        // Flag word
+    USHORT ne_autodata;     // Automatic data segment number
+    USHORT ne_heap;         // Initial heap allocation
+    USHORT ne_stack;        // Initial stack allocation
+    UINT ne_csip;           // Initial CS:IP setting
+    UINT ne_sssp;           // Initial SS:SP setting
+    USHORT ne_cseg;         // Count of file segments
+    USHORT ne_cmod;         // Entries in Module Reference Table
+    USHORT ne_cbnrestab;    // Size of non-resident name table
+    USHORT ne_segtab;       // Offset of Segment Table
+    USHORT ne_rsrctab;      // Offset of Resource Table
+    USHORT ne_restab;       // Offset of resident name table
+    USHORT ne_modtab;       // Offset of Module Reference Table
+    USHORT ne_imptab;       // Offset of Imported Names Table
+    UINT ne_nrestab;        // Offset of Non-resident Names Table
+    USHORT ne_cmovent;      // Count of movable entries
+    USHORT ne_align;        // Segment alignment shift count
+    USHORT ne_cres;         // Count of resource segments
+    UCHAR ne_exetyp;        // Target Operating system
+    UCHAR ne_flagsothers;   // Other .EXE flags
+    USHORT ne_pretthunks;   // offset to return thunks
+    USHORT ne_psegrefbytes; // offset to segment ref. bytes
+    USHORT ne_swaparea;     // Minimum code swap area size
+    USHORT ne_expver;       // Expected Windows version number
+} IMAGE_OS2_HEADER, *PIMAGE_OS2_HEADER;
+
+typedef struct _IMAGE_SECTION_HEADER
+{
+#define IMAGE_SIZEOF_SHORT_NAME 8
+    uint8_t Name[IMAGE_SIZEOF_SHORT_NAME];
+    union
+    {
+        uint32_t PhysicalAddress;
+        uint32_t VirtualSize;
+    } Misc;
+    uint32_t VirtualAddress;
+    uint32_t SizeOfRawData;
+    uint32_t PointerToRawData;
+    uint32_t PointerToRelocations;
+    uint32_t PointerToLinenumbers;
+    uint16_t NumberOfRelocations;
+    uint16_t NumberOfLinenumbers;
+    uint32_t Characteristics;
+} IMAGE_SECTION_HEADER, *PIMAGE_SECTION_HEADER;
+
+typedef struct _IMAGE_FILE_HEADER
+{
+    uint16_t Machine;
+    uint16_t NumberOfSections;
+    uint32_t TimeDateStamp;
+    uint32_t PointerToSymbolTable;
+    uint32_t NumberOfSymbols;
+    uint16_t SizeOfOptionalHeader;
+    uint16_t Characteristics;
+} IMAGE_FILE_HEADER, *PIMAGE_FILE_HEADER;
+
+typedef struct _IMAGE_DATA_DIRECTORY
+{
+    uint32_t VirtualAddress;
+    uint32_t Size;
+} IMAGE_DATA_DIRECTORY, *PIMAGE_DATA_DIRECTORY;
+
+typedef struct _IMAGE_OPTIONAL_HEADER
+{
+    uint16_t Magic;
+    uint8_t MajorLinkerVersion;
+    uint8_t MinorLinkerVersion;
+    uint32_t SizeOfCode;
+    uint32_t SizeOfInitializedData;
+    uint32_t SizeOfUninitializedData;
+    uint32_t AddressOfEntryPoint;
+    uint32_t BaseOfCode;
+    uint32_t BaseOfData;
+    uint32_t ImageBase;
+    uint32_t SectionAlignment;
+    uint32_t FileAlignment;
+    uint16_t MajorOperatingSystemVersion;
+    uint16_t MinorOperatingSystemVersion;
+    uint16_t MajorImageVersion;
+    uint16_t MinorImageVersion;
+    uint16_t MajorSubsystemVersion;
+    uint16_t MinorSubsystemVersion;
+    uint32_t Win32VersionValue;
+    uint32_t SizeOfImage;
+    uint32_t SizeOfHeaders;
+    uint32_t CheckSum;
+    uint16_t Subsystem;
+    uint16_t DllCharacteristics;
+    uint32_t SizeOfStackReserve;
+    uint32_t SizeOfStackCommit;
+    uint32_t SizeOfHeapReserve;
+    uint32_t SizeOfHeapCommit;
+    uint32_t LoaderFlags;
+    uint32_t NumberOfRvaAndSizes;
+    IMAGE_DATA_DIRECTORY DataDirectory[IMAGE_NUMBEROF_DIRECTORY_ENTRIES];
+} IMAGE_OPTIONAL_HEADER, *PIMAGE_OPTIONAL_HEADER;
+
+typedef struct _IMAGE_NT_HEADERS
+{
+    uint32_t Signature;
+    IMAGE_FILE_HEADER FileHeader;
+    IMAGE_OPTIONAL_HEADER OptionalHeader;
+} IMAGE_NT_HEADERS, *PIMAGE_NT_HEADERS;
+
+#endif // !__FENNIX_KERNEL_MSEXEC_H__
diff --git a/Kernel/include/net/arp.hpp b/Kernel/include/net/arp.hpp
new file mode 100644
index 00000000..d4ecce8f
--- /dev/null
+++ b/Kernel/include/net/arp.hpp
@@ -0,0 +1,106 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_NETWORK_ARP_H__
+#define __FENNIX_KERNEL_NETWORK_ARP_H__
+
+#include <net/eth.hpp>
+#include <net/nc.hpp>
+#include <types.h>
+#include <vector>
+
+namespace NetworkARP
+{
+    enum ARPOperation
+    {
+        REQUEST = 0x1,
+        REPLY = 0x2
+    };
+
+    enum ARPHardwareType
+    {
+        HTYPE_ETHERNET = 1,
+        HTYPE_802_3 = 6,
+        HTYPE_ARCNET = 7,
+        HTYPE_FRAME_RELAY = 15,
+        HTYPE_ATM = 16,
+        HTYPE_HDLC = 17,
+        HTYPE_FIBRE_CHANNEL = 18,
+        HTYPE_ATM_2 = 19,
+        HTYPE_SERIAL_LINE = 20
+    };
+
+    struct ARPHeader
+    {
+        uint16_t HardwareType;
+        uint16_t ProtocolType;
+        uint8_t HardwareSize;
+        uint8_t ProtocolSize;
+        uint16_t Operation;
+        uint48_t SenderMAC : 48;
+        uint32_t SenderIP;
+        uint48_t TargetMAC : 48;
+        uint32_t TargetIP;
+    } __packed;
+
+    struct DiscoveredAddress
+    {
+        MediaAccessControl MAC;
+        InternetProtocol IP;
+    };
+
+    class ARP : public NetworkEthernet::EthernetEvents
+    {
+    private:
+        NetworkEthernet::Ethernet *Ethernet;
+
+        enum DAType
+        {
+            DA_ADD = 1,
+            DA_DEL = 2,
+            DA_SEARCH = 3,
+            DA_UPDATE = 4
+        };
+
+        std::vector<NetworkARP::DiscoveredAddress *> DiscoveredAddresses;
+        DiscoveredAddress *ManageDiscoveredAddresses(DAType Type, InternetProtocol IP, MediaAccessControl MAC);
+        DiscoveredAddress *Search(InternetProtocol TargetIP);
+        DiscoveredAddress *Update(InternetProtocol TargetIP, MediaAccessControl TargetMAC);
+        bool OnEthernetPacketReceived(uint8_t *Data, uint64_t Length);
+
+    public:
+        ARP(NetworkEthernet::Ethernet *Ethernet);
+        ~ARP();
+
+        /**
+         * @brief Resolve an IP address to a MAC address.
+         *
+         * @param IP The IP address to resolve. (Little-endian)
+         * @return uint48_t The MAC address of the IP address.
+         */
+        uint48_t Resolve(InternetProtocol IP);
+
+        /**
+         * @brief Broadcast an ARP packet.
+         *
+         * @param IP The IP address to broadcast.
+         */
+        void Broadcast(InternetProtocol IP);
+    };
+}
+
+#endif // !__FENNIX_KERNEL_NETWORK_ARP_H__
diff --git a/Kernel/include/net/dhcp.hpp b/Kernel/include/net/dhcp.hpp
new file mode 100644
index 00000000..6cca532a
--- /dev/null
+++ b/Kernel/include/net/dhcp.hpp
@@ -0,0 +1,182 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DHCP_H__
+#define __FENNIX_KERNEL_DHCP_H__
+
+#include <net/ipv4.hpp>
+#include <net/udp.hpp>
+#include <net/nc.hpp>
+#include <types.h>
+
+namespace NetworkDHCP
+{
+    struct DHCPHeader
+    {
+        uint8_t Opcode;
+        uint8_t HardwareType;
+        uint8_t HardwareAddressLength;
+        uint8_t Hops;
+        uint32_t TransactionID;
+        uint16_t Seconds;
+        uint16_t Flags;
+        uint32_t ClientIP;
+        uint32_t YourIP;
+        uint32_t ServerIP;
+        uint32_t GatewayIP;
+        uint8_t ClientHardwareAddress[16];
+        uint8_t ServerHostName[64];
+        uint8_t BootFileName[128];
+        uint8_t Options[64];
+    } __packed;
+
+    enum DHCPOperation
+    {
+        DHCP_OP_BOOTREQUEST = 1,
+        DHCP_OP_BOOTREPLY = 2
+    };
+
+    /* TODO: Complete list from https://en.wikipedia.org/wiki/Dynamic_Host_Configuration_Protocol#Options */
+    enum DHCPOption
+    {
+        DHCP_OPTION_PAD = 0,
+        DHCP_OPTION_SUBNETMASK = 1,
+        DHCP_OPTION_TIME_OFFSET = 2,
+        DHCP_OPTION_ROUTER = 3,
+        DHCP_OPTION_TIME_SERVER = 4,
+        DHCP_OPTION_NAME_SERVER = 5,
+        DHCP_OPTION_DOMAIN_NAME_SERVER = 6,
+        DHCP_OPTION_LOG_SERVER = 7,
+        DHCP_OPTION_COOKIE_SERVER = 8,
+        DHCP_OPTION_LPR_SERVER = 9,
+        DHCP_OPTION_IMPRESS_SERVER = 10,
+        DHCP_OPTION_RESOURCE_LOCATION_SERVER = 11,
+        DHCP_OPTION_HOST_NAME = 12,
+        DHCP_OPTION_BOOT_FILE_SIZE = 13,
+        DHCP_OPTION_MERIT_DUMP_FILE = 14,
+        DHCP_OPTION_DOMAIN_NAME = 15,
+        DHCP_OPTION_SWAP_SERVER = 16,
+        DHCP_OPTION_ROOT_PATH = 17,
+        DHCP_OPTION_EXTENSION_PATH = 18,
+
+        DHCP_OPTION_IP_FORWARDING = 19,
+        DHCP_OPTION_NON_LOCAL_SOURCE_ROUTING = 20,
+        DHCP_OPTION_POLICY_FILTER = 21,
+        DHCP_OPTION_MAX_DATAGRAM_REASSEMBLY_SIZE = 22,
+        DHCP_OPTION_DEFAULT_IP_TTL = 23,
+        DHCP_OPTION_PATH_MTU_AGING_TIMEOUT = 24,
+        DHCP_OPTION_PATH_MTU_PLATEAU_TABLE = 25,
+
+        DHCP_OPTION_INTERFACE_MTU = 26,
+        DHCP_OPTION_ALL_SUBNETS_ARE_LOCAL = 27,
+        DHCP_OPTION_BROADCAST_ADDRESS = 28,
+        DHCP_OPTION_PERFORM_MASK_DISCOVERY = 29,
+        DHCP_OPTION_MASK_SUPPLIER = 30,
+        DHCP_OPTION_ROUTER_DISCOVERY = 31,
+        DHCP_OPTION_ROUTER_SOLICITATION_ADDRESS = 32,
+        DHCP_OPTION_STATIC_ROUTE = 33,
+
+        DHCP_OPTION_TRAILER_ENCAPSULATION = 34,
+        DHCP_OPTION_ARP_CACHE_TIMEOUT = 35,
+        DHCP_OPTION_ETHERNET_ENCAPSULATION = 36,
+
+        DHCP_OPTION_DEFAULT_TCP_TTL = 37,
+        DHCP_OPTION_TCP_KEEPALIVE_INTERVAL = 38,
+        DHCP_OPTION_TCP_KEEPALIVE_GARBAGE = 39,
+
+        DHCP_OPTION_NIS_DOMAIN = 40,
+        DHCP_OPTION_NIS_SERVERS = 41,
+        DHCP_OPTION_NTP_SERVERS = 42,
+        DHCP_OPTION_VENDOR_SPECIFIC = 43,
+        DHCP_OPTION_NETBIOS_NAME_SERVERS = 44,
+        DHCP_OPTION_NETBIOS_DD_SERVER = 45,
+        DHCP_OPTION_NETBIOS_NODE_TYPE = 46,
+        DHCP_OPTION_NETBIOS_SCOPE = 47,
+        DHCP_OPTION_X_FONT_SERVERS = 48,
+        DHCP_OPTION_X_DISPLAY_MANAGER = 49,
+
+        DHCP_OPTION_REQUESTED_IP = 50,
+        DHCP_OPTION_IP_LEASE_TIME = 51,
+        DHCP_OPTION_OPTION_OVERLOAD = 52,
+        DHCP_OPTION_MESSAGE_TYPE = 53,
+        DHCP_OPTION_SERVER_IDENTIFIER = 54,
+        DHCP_OPTION_PARAMETER_REQUEST_LIST = 55,
+        DHCP_OPTION_MESSAGE = 56,
+        DHCP_OPTION_MAX_MESSAGE_SIZE = 57,
+        DHCP_OPTION_T1_TIMEOUT = 58,
+        DHCP_OPTION_T2_TIMEOUT = 59,
+        DHCP_OPTION_VENDOR_CLASS_IDENTIFIER = 60,
+        DHCP_OPTION_CLIENT_IDENTIFIER = 61,
+
+        DHCP_OPTION_NETWORK_TIME_SERVER = 62,
+
+        DHCP_OPTION_END = 255
+    };
+
+    enum DHCPMessageType
+    {
+        DHCP_MESSAGE_TYPE_DISCOVER = 1,
+        DHCP_MESSAGE_TYPE_OFFER = 2,
+        DHCP_MESSAGE_TYPE_REQUEST = 3,
+        DHCP_MESSAGE_TYPE_DECLINE = 4,
+        DHCP_MESSAGE_TYPE_ACK = 5,
+        DHCP_MESSAGE_TYPE_NAK = 6,
+        DHCP_MESSAGE_TYPE_RELEASE = 7,
+        DHCP_MESSAGE_TYPE_INFORM = 8,
+        DHCP_MESSAGE_TYPE_FORCERENEW = 9,
+        DHCP_MESSAGE_TYPE_LEASEQUERY = 10,
+        DHCP_MESSAGE_TYPE_LEASEUNASSIGNED = 11,
+        DHCP_MESSAGE_TYPE_LEASEUNKNOWN = 12,
+        DHCP_MESSAGE_TYPE_LEASEACTIVE = 13,
+        DHCP_MESSAGE_TYPE_BULKLEASEQUERY = 14,
+        DHCP_MESSAGE_TYPE_LEASEQUERYDONE = 15,
+        DHCP_MESSAGE_TYPE_ACTIVELEASEQUERY = 16,
+        DHCP_MESSAGE_TYPE_LEASEQUERYSTATUS = 17,
+        DHCP_MESSAGE_TYPE_DHCPTLS = 18
+    };
+
+#define DHCP_TRANSACTION_ID 0xFE2EC005
+
+    class DHCP : public NetworkUDP::UDPEvents
+    {
+    private:
+        NetworkUDP::Socket *UDPSocket;
+        NetworkInterfaceManager::DeviceInterface *Interface;
+        bool Received = false;
+
+        void CreatePacket(DHCPHeader *Packet, uint8_t MessageType, uint32_t RequestIP);
+        void *GetOption(DHCPHeader *Packet, uint8_t Type);
+        void OnUDPPacketReceived(NetworkUDP::Socket *Socket, uint8_t *Data, uint64_t Length);
+
+    public:
+        /** @brief IP address (Little-endian) */
+        InternetProtocol IP = {};
+        /** @brief Gateway address (Little-endian) */
+        InternetProtocol Gateway = {};
+        /** @brief Subnet mask (Little-endian) */
+        InternetProtocol SubNetworkMask = {};
+        /** @brief DNS server address (Little-endian) */
+        InternetProtocol DomainNameSystem = {};
+
+        DHCP(NetworkUDP::Socket *Socket, NetworkInterfaceManager::DeviceInterface *Interface);
+        ~DHCP();
+        void Request();
+        void Request(InternetProtocol IP);
+    };
+}
+
+#endif // !__FENNIX_KERNEL_DHCP_H__
diff --git a/Kernel/include/net/dns.hpp b/Kernel/include/net/dns.hpp
new file mode 100644
index 00000000..8cff0bb9
--- /dev/null
+++ b/Kernel/include/net/dns.hpp
@@ -0,0 +1,37 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_DNS_H__
+#define __FENNIX_KERNEL_DNS_H__
+
+#include <net/udp.hpp>
+#include <types.h>
+
+namespace NetworkDNS
+{
+    class DNS : public NetworkUDP::UDPEvents
+    {
+    private:
+        NetworkUDP::Socket *UDPSocket;
+
+    public:
+        DNS(NetworkUDP::Socket *Socket);
+        ~DNS();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_DNS_H__
diff --git a/Kernel/include/net/eth.hpp b/Kernel/include/net/eth.hpp
new file mode 100644
index 00000000..73083d1f
--- /dev/null
+++ b/Kernel/include/net/eth.hpp
@@ -0,0 +1,108 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_NETWORK_ETHERNET_H__
+#define __FENNIX_KERNEL_NETWORK_ETHERNET_H__
+
+#include <types.h>
+#include <net/nc.hpp>
+
+namespace NetworkEthernet
+{
+    enum FrameType
+    {
+        TYPE_IPV4 = 0x0800,
+        TYPE_ARP = 0x0806,
+        TYPE_RARP = 0x8035,
+        TYPE_IPV6 = 0x86DD
+    };
+
+    struct EthernetHeader
+    {
+        uint48_t DestinationMAC : 48;
+        uint48_t SourceMAC : 48;
+        uint16_t Type;
+    } __packed;
+
+    struct EthernetPacket
+    {
+        EthernetHeader Header;
+        uint8_t Data[];
+    };
+
+    class EthernetEvents
+    {
+    private:
+        FrameType FType;
+
+    protected:
+        EthernetEvents(FrameType Type);
+        ~EthernetEvents();
+
+    public:
+        FrameType GetFrameType() { return FType; }
+        virtual void OnEthernetPacketSent(EthernetPacket *Packet)
+        {
+            UNUSED(Packet);
+            netdbg("Event not handled. [%p]", Packet);
+        }
+
+        virtual bool OnEthernetPacketReceived(uint8_t *Data, uint64_t Length)
+        {
+            UNUSED(Data);
+            UNUSED(Length);
+            netdbg("Event not handled. [%p, %d]", Data, Length);
+            return false;
+        }
+    };
+
+    class Ethernet : public NetworkInterfaceManager::Events
+    {
+    private:
+        NetworkInterfaceManager::DeviceInterface *Interface;
+        void Receive(uint8_t *Data, uint64_t Length);
+        void OnInterfaceReceived(NetworkInterfaceManager::DeviceInterface *Interface, uint8_t *Data, uint64_t Length);
+
+    public:
+        /** @brief Get driver interface
+         * @return Driver interface
+         */
+        NetworkInterfaceManager::DeviceInterface *GetInterface()
+        {
+            netdbg("Interface: %#lx (MAC: %s; IPv4: %s; IPv6: %s)", this->Interface,
+                   this->Interface->MAC.ToString(),
+                   this->Interface->IP.v4.ToStringLittleEndian(),
+                   this->Interface->IP.v6.ToStringLittleEndian());
+            return this->Interface;
+        }
+
+        Ethernet(NetworkInterfaceManager::DeviceInterface *Interface);
+        ~Ethernet();
+
+        /**
+         * @brief Send an Ethernet packet.
+         *
+         * @param MAC The MAC address of the destination. (Big-endian)
+         * @param Type The type of the packet.
+         * @param Data The data to send.
+         * @param Length The length of the data.
+         */
+        void Send(MediaAccessControl MAC, FrameType Type, uint8_t *Data, uint64_t Length);
+    };
+}
+
+#endif // !__FENNIX_KERNEL_NETWORK_ETHERNET_H__
diff --git a/Kernel/include/net/icmpv4.hpp b/Kernel/include/net/icmpv4.hpp
new file mode 100644
index 00000000..7611a5cb
--- /dev/null
+++ b/Kernel/include/net/icmpv4.hpp
@@ -0,0 +1,71 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ICMPv4_H__
+#define __FENNIX_KERNEL_ICMPv4_H__
+
+#include <net/nc.hpp>
+#include <types.h>
+
+namespace NetworkICMPv4
+{
+    enum ICMPv4Type
+    {
+        TYPE_ECHO_REPLY = 0,
+        TYPE_DESTINATION_UNREACHABLE = 3,
+        TYPE_SOURCE_QUENCH = 4,
+        TYPE_REDIRECT = 5,
+        TYPE_ECHO = 8,
+        TYPE_ROUTER_ADVERTISEMENT = 9,
+        TYPE_ROUTER_SELECTION = 10,
+        TYPE_TIME_EXCEEDED = 11,
+        TYPE_PARAMETER_PROBLEM = 12,
+        TYPE_TIMESTAMP = 13,
+        TYPE_TIMESTAMP_REPLY = 14
+    };
+
+    struct ICMPHeader
+    {
+        uint8_t Type;
+        uint8_t Code;
+        uint16_t Checksum;
+        uint16_t Identifier;
+        uint16_t SequenceNumber;
+    };
+
+    struct ICMPPacket
+    {
+        ICMPHeader Header;
+        uint8_t Data[];
+    };
+
+    class ICMPv4
+    {
+    private:
+        NetworkInterfaceManager::DeviceInterface *Interface;
+
+    public:
+        NetworkInterfaceManager::DeviceInterface *GetInterface() { return this->Interface; }
+
+        ICMPv4(NetworkInterfaceManager::DeviceInterface *Interface);
+        ~ICMPv4();
+        void Send(/* ???? */);
+        void Receive(ICMPPacket *Packet);
+    };
+}
+
+#endif // !__FENNIX_KERNEL_ICMPv4_H__
diff --git a/Kernel/include/net/icmpv6.hpp b/Kernel/include/net/icmpv6.hpp
new file mode 100644
index 00000000..fd2c7688
--- /dev/null
+++ b/Kernel/include/net/icmpv6.hpp
@@ -0,0 +1,56 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ICMPv6_H__
+#define __FENNIX_KERNEL_ICMPv6_H__
+
+#include <net/nc.hpp>
+#include <types.h>
+
+namespace NetworkICMPv6
+{
+    struct ICMPHeader
+    {
+        uint8_t Type;
+        uint8_t Code;
+        uint16_t Checksum;
+        uint16_t Identifier;
+        uint16_t SequenceNumber;
+    };
+
+    struct ICMPPacket
+    {
+        ICMPHeader Header;
+        uint8_t Data[];
+    };
+
+    class ICMPv6
+    {
+    private:
+        NetworkInterfaceManager::DeviceInterface *Interface;
+
+    public:
+        NetworkInterfaceManager::DeviceInterface *GetInterface() { return this->Interface; }
+
+        ICMPv6(NetworkInterfaceManager::DeviceInterface *Interface);
+        ~ICMPv6();
+        void Send(uint8_t *Data, uint64_t Length);
+        void Receive(uint8_t *Data);
+    };
+}
+
+#endif // !__FENNIX_KERNEL_ICMPv6_H__
diff --git a/Kernel/include/net/ipv4.hpp b/Kernel/include/net/ipv4.hpp
new file mode 100644
index 00000000..71f55c2e
--- /dev/null
+++ b/Kernel/include/net/ipv4.hpp
@@ -0,0 +1,137 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_IPv4_H__
+#define __FENNIX_KERNEL_IPv4_H__
+
+#include <net/ipv4.hpp>
+#include <net/arp.hpp>
+#include <net/nc.hpp>
+#include <types.h>
+
+namespace NetworkIPv4
+{
+    struct IPv4Header
+    {
+        uint8_t IHL : 4;
+        uint8_t Version : 4;
+        uint8_t TypeOfService;
+        uint16_t TotalLength;
+        uint16_t Identification;
+        uint8_t Flags;
+        uint8_t FragmentOffset;
+        uint8_t TimeToLive;
+        uint8_t Protocol;
+        uint16_t HeaderChecksum;
+        uint32_t SourceIP;
+        uint32_t DestinationIP;
+
+        /* On wikipedia page we have this: https://en.wikipedia.org/wiki/File:IPv4_Packet-en.svg
+           but only the code above works... */
+        // uint8_t Version : 4;
+        // uint8_t IHL : 4;
+        // uint16_t TypeOfService : 8;
+        // uint16_t TotalLength : 12;
+        // uint16_t Identification : 16;
+        // uint16_t Flags : 3;
+        // uint16_t FragmentOffset : 13;
+        // uint8_t TimeToLive : 8;
+        // uint8_t Protocol : 8;
+        // uint16_t HeaderChecksum;
+        // uint32_t SourceIP;
+        // uint32_t DestinationIP;
+    };
+
+    struct IPv4Packet
+    {
+        IPv4Header Header;
+        uint8_t Data[];
+    };
+
+    enum IPv4Protocols
+    {
+        PROTOCOL_ICMP = 1,
+        PROTOCOL_IGMP = 2,
+        PROTOCOL_TCP = 6,
+        PROTOCOL_UDP = 17,
+        PROTOCOL_IPV6 = 41,
+        PROTOCOL_ROUTING = 43,
+        PROTOCOL_FRAGMENT = 44,
+        PROTOCOL_ESP = 50,
+        PROTOCOL_AH = 51,
+        PROTOCOL_ICMPV6 = 58,
+        PROTOCOL_NONE = 59,
+        PROTOCOL_DSTOPTS = 60,
+        PROTOCOL_ND = 77,
+        PROTOCOL_ICLFXBM = 78,
+        PROTOCOL_PIM = 103,
+        PROTOCOL_COMP = 108,
+        PROTOCOL_SCTP = 132,
+        PROTOCOL_UDPLITE = 136,
+        PROTOCOL_RAW = 255
+    };
+
+    class IPv4 : public NetworkEthernet::EthernetEvents
+    {
+    private:
+        NetworkARP::ARP *ARP;
+        NetworkEthernet::Ethernet *Ethernet;
+
+        virtual bool OnEthernetPacketReceived(uint8_t *Data, uint64_t Length);
+
+    public:
+        InternetProtocol GatewayIP;
+        InternetProtocol SubNetworkMaskIP;
+        IPv4(NetworkARP::ARP *ARP, NetworkEthernet::Ethernet *Ethernet);
+        ~IPv4();
+
+        /**
+         * @brief Send an IPv4 packet.
+         *
+         * @param Data The data to send.
+         * @param Length The length of the data.
+         * @param Protocol The protocol of the packet.
+         * @param DestinationIP The IP address of the destination. (Big-endian)
+         */
+        void Send(uint8_t *Data, uint64_t Length, uint8_t Protocol, InternetProtocol DestinationIP);
+    };
+
+    class IPv4Events
+    {
+    private:
+        uint8_t Protocol;
+
+    protected:
+        IPv4Events(IPv4Protocols Protocol);
+        ~IPv4Events();
+
+    public:
+        uint8_t GetProtocol() { return Protocol; }
+
+        virtual bool OnIPv4PacketReceived(InternetProtocol SourceIP, InternetProtocol DestinationIP, uint8_t *Data, uint64_t Length)
+        {
+            UNUSED(SourceIP);
+            UNUSED(DestinationIP);
+            UNUSED(Data);
+            UNUSED(Length);
+            warn("Not implemented.");
+            return false;
+        }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_IPv4_H__
diff --git a/Kernel/include/net/ipv6.hpp b/Kernel/include/net/ipv6.hpp
new file mode 100644
index 00000000..f67f3438
--- /dev/null
+++ b/Kernel/include/net/ipv6.hpp
@@ -0,0 +1,44 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_IPv6_H__
+#define __FENNIX_KERNEL_IPv6_H__
+
+#include <types.h>
+
+namespace NetworkIPv6
+{
+    struct IPv6Header
+    {
+        uint32_t Version;
+        uint8_t TrafficClass;
+        uint16_t FlowLabel;
+        uint16_t PayloadLength;
+        uint8_t NextHeader;
+        uint8_t HopLimit;
+        uint32_t SourceIP;
+        uint32_t DestinationIP;
+    };
+
+    struct IPv6Packet
+    {
+        IPv6Header Header;
+        uint8_t Data[];
+    };
+}
+
+#endif // !__FENNIX_KERNEL_IPv6_H__
diff --git a/Kernel/include/net/nc.hpp b/Kernel/include/net/nc.hpp
new file mode 100644
index 00000000..21e0d355
--- /dev/null
+++ b/Kernel/include/net/nc.hpp
@@ -0,0 +1,116 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_NETWORK_CONTROLLER_H__
+#define __FENNIX_KERNEL_NETWORK_CONTROLLER_H__
+
+#include <net/net.hpp>
+#include <memory.hpp>
+#include <task.hpp>
+#include <types.h>
+#include <debug.h>
+#include <vector>
+
+namespace NetworkInterfaceManager
+{
+    struct DeviceInterface
+    {
+        /** @brief Device interface name */
+        char Name[128];
+
+        /** @brief Device interface index */
+        uint64_t ID;
+
+        /** @brief Device interface MAC address (Big-endian) */
+        MediaAccessControl MAC;
+
+        /** @brief Device interface IP address (Big-endian) */
+        InternetProtocol IP;
+
+        /** @brief Reserved */
+        unsigned long DriverID;
+    };
+
+    class Events
+    {
+    protected:
+        Events(DeviceInterface *Interface);
+        ~Events();
+
+    public:
+        virtual void OnInterfaceAdded(DeviceInterface *Interface)
+        {
+            UNUSED(Interface);
+            netdbg("Event for %s not handled.", Interface->Name);
+        }
+
+        virtual void OnInterfaceRemoved(DeviceInterface *Interface)
+        {
+            UNUSED(Interface);
+            netdbg("Event for %s not handled.", Interface->Name);
+        }
+
+        virtual void OnInterfaceChanged(DeviceInterface *Interface)
+        {
+            UNUSED(Interface);
+            netdbg("Event for %s not handled.", Interface->Name);
+        }
+
+        virtual void OnInterfaceReceived(DeviceInterface *Interface, uint8_t *Data, uint64_t Length)
+        {
+            UNUSED(Interface);
+            UNUSED(Data);
+            UNUSED(Length);
+            netdbg("Event for %s not handled.", Interface->Name);
+        }
+
+        virtual void OnInterfaceSent(DeviceInterface *Interface, uint8_t *Data, uint64_t Length)
+        {
+            UNUSED(Interface);
+            UNUSED(Data);
+            UNUSED(Length);
+            netdbg("Event for %s not handled.", Interface->Name);
+        }
+    };
+
+    class NetworkInterface
+    {
+    private:
+        Memory::MemMgr *mem;
+        int CardIDs = 0;
+        std::vector<DeviceInterface *> Interfaces;
+
+        Tasking::TCB *NetSvcThread;
+        void StopNetworkStack();
+        void FetchNetworkCards(unsigned long DriverUID);
+
+    public:
+        NetworkInterface();
+        ~NetworkInterface();
+
+        void StartService();
+
+        void Send(DeviceInterface *Interface, uint8_t *Data, uint64_t Length);
+        void Receive(DeviceInterface *Interface, uint8_t *Data, uint64_t Length);
+
+        void DrvSend(unsigned int DriverID, unsigned char *Data, unsigned short Size);
+        void DrvReceive(unsigned int DriverID, unsigned char *Data, unsigned short Size);
+        void StartNetworkStack();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_NETWORK_CONTROLLER_H__
diff --git a/Kernel/include/net/net.hpp b/Kernel/include/net/net.hpp
new file mode 100644
index 00000000..d3dcb722
--- /dev/null
+++ b/Kernel/include/net/net.hpp
@@ -0,0 +1,232 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_NETWORK_H__
+#define __FENNIX_KERNEL_NETWORK_H__
+
+#include <types.h>
+#include <printf.h>
+
+// #define DEBUG_NETWORK 1
+
+#ifdef DEBUG_NETWORK
+#define netdbg(m, ...) debug(m, ##__VA_ARGS__)
+void DbgNetwork();
+void DbgDumpData(const char *Description, void *Address, unsigned long Length);
+#else
+#define netdbg(m, ...)
+static inline void DbgNetwork() { return; }
+static inline void DbgDumpData(const char *Description, void *Address, unsigned long Length)
+{
+    UNUSED(Description);
+    UNUSED(Address);
+    UNUSED(Length);
+    return;
+}
+#endif
+
+enum Endianness
+{
+    LITTLE_ENDIAN,
+    BIG_ENDIAN
+};
+
+struct MediaAccessControl
+{
+    uint8_t Address[6] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
+    Endianness Endianess = LITTLE_ENDIAN;
+
+    inline bool operator==(const MediaAccessControl &lhs) const
+    {
+        return lhs.Address[0] == this->Address[0] &&
+               lhs.Address[1] == this->Address[1] &&
+               lhs.Address[2] == this->Address[2] &&
+               lhs.Address[3] == this->Address[3] &&
+               lhs.Address[4] == this->Address[4] &&
+               lhs.Address[5] == this->Address[5];
+    }
+
+    inline bool operator==(const uint48_t &lhs) const
+    {
+        MediaAccessControl MAC;
+        MAC.Address[0] = (uint8_t)((lhs >> 40) & 0xFF);
+        MAC.Address[1] = (uint8_t)((lhs >> 32) & 0xFF);
+        MAC.Address[2] = (uint8_t)((lhs >> 24) & 0xFF);
+        MAC.Address[3] = (uint8_t)((lhs >> 16) & 0xFF);
+        MAC.Address[4] = (uint8_t)((lhs >> 8) & 0xFF);
+        MAC.Address[5] = (uint8_t)(lhs & 0xFF);
+        return MAC.Address[0] == this->Address[0] &&
+               MAC.Address[1] == this->Address[1] &&
+               MAC.Address[2] == this->Address[2] &&
+               MAC.Address[3] == this->Address[3] &&
+               MAC.Address[4] == this->Address[4] &&
+               MAC.Address[5] == this->Address[5];
+    }
+
+    inline bool operator!=(const MediaAccessControl &lhs) const { return !(*this == lhs); }
+    inline bool operator!=(const uint48_t &lhs) const { return !(*this == lhs); }
+
+    inline uint48_t ToHex()
+    {
+        return ((uint48_t)this->Address[0] << 40) |
+               ((uint48_t)this->Address[1] << 32) |
+               ((uint48_t)this->Address[2] << 24) |
+               ((uint48_t)this->Address[3] << 16) |
+               ((uint48_t)this->Address[4] << 8) |
+               ((uint48_t)this->Address[5]);
+    }
+
+    inline MediaAccessControl FromHex(uint48_t Hex)
+    {
+        this->Address[0] = (uint8_t)((Hex >> 40) & 0xFF);
+        this->Address[1] = (uint8_t)((Hex >> 32) & 0xFF);
+        this->Address[2] = (uint8_t)((Hex >> 24) & 0xFF);
+        this->Address[3] = (uint8_t)((Hex >> 16) & 0xFF);
+        this->Address[4] = (uint8_t)((Hex >> 8) & 0xFF);
+        this->Address[5] = (uint8_t)(Hex & 0xFF);
+        return *this;
+    }
+
+    inline bool Valid()
+    {
+        // TODO: More complex MAC validation
+        return (this->Address[0] != 0 ||
+                this->Address[1] != 0 ||
+                this->Address[2] != 0 ||
+                this->Address[3] != 0 ||
+                this->Address[4] != 0 ||
+                this->Address[5] != 0) &&
+               (this->Address[0] != 0xFF ||
+                this->Address[1] != 0xFF ||
+                this->Address[2] != 0xFF ||
+                this->Address[3] != 0xFF ||
+                this->Address[4] != 0xFF ||
+                this->Address[5] != 0xFF);
+    }
+
+    char *ToString()
+    {
+        static char Buffer[18];
+        sprintf(Buffer, "%02X:%02X:%02X:%02X:%02X:%02X", this->Address[0], this->Address[1], this->Address[2], this->Address[3], this->Address[4], this->Address[5]);
+        return Buffer;
+    }
+};
+
+/* There's a confusion between LSB and MSB. Not sure if "ToStringLittleEndian" and "ToStringBigEndian" are implemented correctly.
+   Because x86 is a LSB architecture, I'm assuming that the "ToStringLittleEndian" is correct? */
+struct InternetProtocol
+{
+    struct Version4
+    {
+        uint8_t Address[4] = {255, 255, 255, 255};
+        Endianness Endianess = LITTLE_ENDIAN;
+
+        inline bool operator==(const InternetProtocol::Version4 &lhs) const
+        {
+            return lhs.Address[0] == this->Address[0] &&
+                   lhs.Address[1] == this->Address[1] &&
+                   lhs.Address[2] == this->Address[2] &&
+                   lhs.Address[3] == this->Address[3];
+        }
+
+        inline bool operator==(const uint32_t &lhs) const
+        {
+            InternetProtocol::Version4 IP;
+            IP.Address[0] = (uint8_t)((lhs >> 24) & 0xFF);
+            IP.Address[1] = (uint8_t)((lhs >> 16) & 0xFF);
+            IP.Address[2] = (uint8_t)((lhs >> 8) & 0xFF);
+            IP.Address[3] = (uint8_t)(lhs & 0xFF);
+
+            return IP.Address[0] == this->Address[0] &&
+                   IP.Address[1] == this->Address[1] &&
+                   IP.Address[2] == this->Address[2] &&
+                   IP.Address[3] == this->Address[3];
+        }
+
+        inline bool operator!=(const InternetProtocol::Version4 &lhs) const { return !(*this == lhs); }
+        inline bool operator!=(const uint32_t &lhs) const { return !(*this == lhs); }
+
+        inline uint32_t ToHex()
+        {
+            return ((uint32_t)this->Address[0] << 24) |
+                   ((uint32_t)this->Address[1] << 16) |
+                   ((uint32_t)this->Address[2] << 8) |
+                   ((uint32_t)this->Address[3]);
+        }
+
+        inline InternetProtocol::Version4 FromHex(uint32_t Hex)
+        {
+            this->Address[0] = (uint8_t)((Hex >> 24) & 0xFF);
+            this->Address[1] = (uint8_t)((Hex >> 16) & 0xFF);
+            this->Address[2] = (uint8_t)((Hex >> 8) & 0xFF);
+            this->Address[3] = (uint8_t)(Hex & 0xFF);
+            return *this;
+        }
+
+        char *ToStringLittleEndian()
+        {
+            static char Buffer[16];
+            sprintf(Buffer, "%d.%d.%d.%d", this->Address[0], this->Address[1], this->Address[2], this->Address[3]);
+            return Buffer;
+        }
+
+        char *ToStringBigEndian()
+        {
+            static char Buffer[16];
+            sprintf(Buffer, "%d.%d.%d.%d", this->Address[3], this->Address[2], this->Address[1], this->Address[0]);
+            return Buffer;
+        }
+    } v4;
+
+    struct Version6
+    {
+        uint16_t Address[8] = {0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF};
+        Endianness Endianess = LITTLE_ENDIAN;
+
+        inline bool operator==(const InternetProtocol::Version6 &lhs) const
+        {
+            return lhs.Address[0] == this->Address[0] &&
+                   lhs.Address[1] == this->Address[1] &&
+                   lhs.Address[2] == this->Address[2] &&
+                   lhs.Address[3] == this->Address[3] &&
+                   lhs.Address[4] == this->Address[4] &&
+                   lhs.Address[5] == this->Address[5] &&
+                   lhs.Address[6] == this->Address[6] &&
+                   lhs.Address[7] == this->Address[7];
+        }
+
+        inline bool operator!=(const InternetProtocol::Version6 &lhs) const { return !(*this == lhs); }
+
+        char *ToStringLittleEndian()
+        {
+            static char Buffer[40];
+            sprintf(Buffer, "%04X:%04X:%04X:%04X:%04X:%04X:%04X:%04X", this->Address[0], this->Address[1], this->Address[2], this->Address[3], this->Address[4], this->Address[5], this->Address[6], this->Address[7]);
+            return Buffer;
+        }
+
+        char *ToStringBigEndian()
+        {
+            static char Buffer[40];
+            sprintf(Buffer, "%04X:%04X:%04X:%04X:%04X:%04X:%04X:%04X", this->Address[7], this->Address[6], this->Address[5], this->Address[4], this->Address[3], this->Address[2], this->Address[1], this->Address[0]);
+            return Buffer;
+        }
+    } v6;
+};
+
+uint16_t CalculateChecksum(uint16_t *Data, uint64_t Length);
+
+#endif // !__FENNIX_KERNEL_NETWORK_H__
diff --git a/Kernel/include/net/ntp.hpp b/Kernel/include/net/ntp.hpp
new file mode 100644
index 00000000..20b79f7b
--- /dev/null
+++ b/Kernel/include/net/ntp.hpp
@@ -0,0 +1,166 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_NTP_H__
+#define __FENNIX_KERNEL_NTP_H__
+
+#include <net/udp.hpp>
+#include <types.h>
+
+namespace NetworkNTP
+{
+    struct NTPHeader
+    {
+        /** @brief Leap indicator
+         * 00 - no warning
+         * 01 - last minute has 61 seconds
+         * 10 - last minute has 59 seconds
+         * 11 - alarm condition (clock not synchronized)
+         */
+        uint8_t LeapIndicator : 2;
+        /** @brief Version number of the protocol
+         * 3 - IPv4 only
+         * 4 - IPv4, IPv6 and OSI
+         * 5 - IPv4, IPv6 and OSI
+         * 6 - IPv4, IPv6 and OSI
+         * 7 - IPv4, IPv6 and OSI
+         */
+        uint8_t VersionNumber : 3;
+        /** @brief Mode
+         * 0 - reserved
+         * 1 - symmetric active
+         * 2 - symmetric passive
+         * 3 - client
+         * 4 - server
+         * 5 - broadcast
+         * 6 - reserved for NTP control message
+         * 7 - reserved for private use
+         */
+        uint8_t Mode : 3;
+        /** @brief Stratum
+         * 0 - unspecified or unavailable
+         * 1 - primary reference (e.g. radio clock)
+         * 2-15 - secondary reference (via NTP or SNTP)
+         * 16 - unsynchronized
+         * 17-255 - reserved
+         */
+        uint8_t Stratum;
+        /** @brief Polling interval
+         * 4 - 16 seconds
+         * 5 - 32 seconds
+         * 6 - 64 seconds
+         * 7 - 128 seconds
+         * 8 - 256 seconds
+         * 9 - 512 seconds
+         * 10 - 1024 seconds
+         * 11 - 2048 seconds
+         * 12 - 4096 seconds
+         * 13 - 8192 seconds
+         * 14 - 16384 seconds
+         * 15 - 32768 seconds
+         */
+        uint8_t Poll;
+        /** @brief Precision
+         * -6 - 0.015625 seconds
+         * -5 - 0.03125 seconds
+         * -4 - 0.0625 seconds
+         * -3 - 0.125 seconds
+         * -2 - 0.25 seconds
+         * -1 - 0.5 seconds
+         * 0 - 1 second
+         * 1 - 2 seconds
+         * 2 - 4 seconds
+         * 3 - 8 seconds
+         * 4 - 16 seconds
+         * 5 - 32 seconds
+         * 6 - 64 seconds
+         * 7 - 128 seconds
+         */
+        uint8_t Precision;
+        /** @brief Root delay
+         * Total round trip delay to the primary reference source
+         */
+        uint32_t RootDelay;
+        /** @brief Root dispersion
+         * Nominal error relative to the primary reference source
+         */
+        uint32_t RootDispersion;
+        /** @brief Reference identifier
+         * 0x00000000 - unspecified
+         * 0x00000001 - radio clock
+         * 0x00000002 - atomic clock
+         * 0x00000003 - GPS receiver
+         * 0x00000004 - local oscillator
+         * 0x00000005 - LORAN-C receiver
+         * 0x00000006 - microprocessor
+         * 0x00000007 - internet
+         * 0x00000008 - FLL
+         * 0x00000009 - other
+         * 0x0000000A - WWV
+         * 0x0000000B - WWVB
+         * 0x0000000C - WWVH
+         * 0x0000000D - NIST dialup
+         * 0x0000000E - telephone
+         * 0x0000000F - reserved
+         */
+        uint32_t ReferenceIdentifier;
+        /** @brief Reference timestamp
+         * The time at which the clock was last set or corrected
+         */
+        uint32_t ReferenceTimestamp[2];
+        /** @brief Originate timestamp
+         * The time at which the request departed the client for the server
+         */
+        uint32_t OriginateTimestamp[2];
+        /** @brief Receive timestamp
+         * The time at which the request arrived at the server
+         */
+        uint32_t ReceiveTimestamp[2];
+        /** @brief Transmit timestamp
+         * The time at which the reply departed the server for the client
+         */
+        uint32_t TransmitTimestamp[2];
+        /** @brief Message authentication code
+         * Key identifier
+         * @note Only when the NTP authentication scheme is used
+         */
+        // uint32_t MessageAuthenticationCode;
+    } __packed;
+
+    class NTP : public NetworkUDP::UDPEvents
+    {
+    private:
+        NetworkUDP::Socket *UDPSocket;
+        bool TimeReceived = false;
+        NTPHeader NTPPacket;
+
+        virtual void OnUDPPacketReceived(NetworkUDP::Socket *Socket, uint8_t *Data, uint64_t Length);
+
+    public:
+        NTP(NetworkUDP::Socket *Socket);
+        ~NTP();
+
+        /**
+         * @brief Get the time from the NTP server
+         * 
+         * @return Unix Timestamp
+         */
+        int ReadTime();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_NTP_H__
diff --git a/Kernel/include/net/tcp.hpp b/Kernel/include/net/tcp.hpp
new file mode 100644
index 00000000..000198b3
--- /dev/null
+++ b/Kernel/include/net/tcp.hpp
@@ -0,0 +1,27 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_TCP_H__
+#define __FENNIX_KERNEL_TCP_H__
+
+#include <types.h>
+
+namespace NetworkTCP
+{
+}
+
+#endif // !__FENNIX_KERNEL_TCP_H__
diff --git a/Kernel/include/net/udp.hpp b/Kernel/include/net/udp.hpp
new file mode 100644
index 00000000..ab3d6a36
--- /dev/null
+++ b/Kernel/include/net/udp.hpp
@@ -0,0 +1,97 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_UDP_H__
+#define __FENNIX_KERNEL_UDP_H__
+
+#include <net/ipv4.hpp>
+#include <net/udp.hpp>
+#include <net/nc.hpp>
+#include <types.h>
+
+namespace NetworkUDP
+{
+    struct UDPHeader
+    {
+        uint16_t SourcePort;
+        uint16_t DestinationPort;
+        uint16_t Length;
+        uint16_t Checksum;
+    } __packed;
+
+    struct UDPPacket
+    {
+        UDPHeader Header;
+        uint8_t Data[];
+    };
+
+    class Socket;
+
+    class UDPEvents
+    {
+    protected:
+        UDPEvents();
+        ~UDPEvents();
+
+    public:
+        virtual void OnUDPPacketReceived(Socket *Socket, uint8_t *Data, uint64_t Length)
+        {
+            UNUSED(Socket);
+            UNUSED(Data);
+            UNUSED(Length);
+            warn("Not implemented.");
+        }
+    };
+
+    class UDP : public NetworkIPv4::IPv4Events
+    {
+    private:
+        NetworkIPv4::IPv4 *ipv4;
+        NetworkInterfaceManager::DeviceInterface *Interface;
+
+    public:
+        NetworkInterfaceManager::DeviceInterface *GetInterface() { return this->Interface; }
+
+        UDP(NetworkIPv4::IPv4 *ipv4, NetworkInterfaceManager::DeviceInterface *Interface);
+        ~UDP();
+
+        virtual Socket *Connect(InternetProtocol IP, uint16_t Port);
+        virtual Socket *Listen(uint16_t Port);
+        virtual void Disconnect(Socket *Socket);
+        virtual void Send(Socket *Socket, uint8_t *Data, uint64_t Length);
+        virtual void Bind(Socket *Socket, UDPEvents *EventHandler);
+
+        virtual bool OnIPv4PacketReceived(InternetProtocol SourceIP, InternetProtocol DestinationIP, uint8_t *Data, uint64_t Length);
+    };
+
+    class Socket
+    {
+    public:
+        InternetProtocol LocalIP;
+        uint16_t LocalPort = 0;
+        InternetProtocol RemoteIP;
+        uint16_t RemotePort = 0;
+        bool Listening = false;
+        UDPEvents *EventHandler = nullptr;
+        UDP *SocketUDP = nullptr;
+
+        Socket(UDP *_UDP);
+        ~Socket();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_UDP_H__
diff --git a/Kernel/include/pci.hpp b/Kernel/include/pci.hpp
new file mode 100644
index 00000000..0925abc5
--- /dev/null
+++ b/Kernel/include/pci.hpp
@@ -0,0 +1,240 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_PCI_H__
+#define __FENNIX_KERNEL_PCI_H__
+
+#include <types.h>
+
+#include <debug.h>
+#include <vector>
+
+namespace PCI
+{
+    namespace Descriptors
+    {
+        enum PCIVendors
+        {
+            SymbiosLogic = 0x1000,
+            RedHat = 0x1AF4,
+            REDHat2 = 0x1B36,
+            Realtek = 0x10EC,
+            VirtualBox = 0x80EE,
+            Ensoniq = 0x1274,
+            QEMU = 0x1234,
+            VMware = 0x15AD,
+            IntelCorporation = 0x8086,
+            AdvancedMicroDevices = 0x1022,
+            NVIDIACorporation = 0x10DE
+        };
+
+        const char *const DeviceClasses[]{
+            "Unclassified",
+            "Mass Storage Controller",
+            "Network Controller",
+            "Display Controller",
+            "Multimedia Controller",
+            "Memory Controller",
+            "Bridge Device",
+            "Simple Communication Controller",
+            "Base System Peripheral",
+            "Input Device Controller",
+            "Docking Station",
+            "Processor",
+            "Serial Bus Controller",
+            "Wireless Controller",
+            "Intelligent Controller",
+            "Satellite Communication Controller",
+            "Encryption Controller",
+            "Signal Processing Controller",
+            "Processing Accelerator",
+            "Non Essential Instrumentation"};
+
+        const char *MassStorageControllerSubclassName(uint8_t SubclassCode);
+        const char *NetworkControllerSubclassName(uint8_t SubclassCode);
+        const char *DisplayControllerSubclassName(uint8_t SubclassCode);
+        const char *CommunicationControllerSubclassName(uint8_t SubclassCode);
+        const char *BaseSystemPeripheralSubclassName(uint8_t SubclassCode);
+        const char *SerialBusControllerSubclassName(uint8_t SubclassCode);
+        const char *BridgeDeviceSubclassName(uint8_t SubclassCode);
+        const char *WirelessControllerSubclassName(uint8_t SubclassCode);
+        const char *GetVendorName(uint32_t VendorID);
+        const char *GetDeviceName(uint32_t VendorID, uint32_t DeviceID);
+        const char *GetSubclassName(uint8_t ClassCode, uint8_t SubclassCode);
+        const char *GetProgIFName(uint8_t ClassCode, uint8_t SubclassCode, uint8_t ProgIF);
+    }
+
+    /* https://sites.uclouvain.be/SystInfo/usr/include/linux/pci_regs.h.html */
+    enum PCICommands
+    {
+        /** @brief Enable response in I/O space */
+        PCI_COMMAND_IO = 0x1,
+        /** @brief Enable response in Memory space */
+        PCI_COMMAND_MEMORY = 0x2,
+        /** @brief Enable bus mastering */
+        PCI_COMMAND_MASTER = 0x4,
+        /** @brief Enable response to special cycles */
+        PCI_COMMAND_SPECIAL = 0x8,
+        /** @brief Use memory write and invalidate */
+        PCI_COMMAND_INVALIDATE = 0x10,
+        /** @brief Enable palette snooping */
+        PCI_COMMAND_VGA_PALETTE = 0x20,
+        /** @brief Enable parity checking */
+        PCI_COMMAND_PARITY = 0x40,
+        /** @brief Enable address/data stepping */
+        PCI_COMMAND_WAIT = 0x80,
+        /** @brief Enable SERR */
+        PCI_COMMAND_SERR = 0x100,
+        /** @brief Enable back-to-back writes */
+        PCI_COMMAND_FAST_BACK = 0x200,
+        /** @brief INTx Emulation Disable */
+        PCI_COMMAND_INTX_DISABLE = 0x400
+    };
+
+    struct PCIDeviceHeader
+    {
+        uint16_t VendorID;
+        uint16_t DeviceID;
+        uint16_t Command;
+        uint16_t Status;
+        uint8_t RevisionID;
+        uint8_t ProgIF;
+        uint8_t Subclass;
+        uint8_t Class;
+        uint8_t CacheLineSize;
+        uint8_t LatencyTimer;
+        uint8_t HeaderType;
+        uint8_t BIST;
+    };
+
+    /**
+     * @brief PCI Header Type 0
+     *
+     */
+    struct PCIHeader0
+    {
+        PCIDeviceHeader Header;
+        uint32_t BAR0;
+        uint32_t BAR1;
+        uint32_t BAR2;
+        uint32_t BAR3;
+        uint32_t BAR4;
+        uint32_t BAR5;
+        uint32_t CardbusCISPointer;
+        uint16_t SubsystemVendorID;
+        uint16_t SubsystemID;
+        uint32_t ExpansionROMBaseAddress;
+        uint8_t CapabilitiesPointer;
+        uint8_t Reserved0;
+        uint16_t Reserved1;
+        uint32_t Reserved2;
+        uint8_t InterruptLine;
+        uint8_t InterruptPin;
+        uint8_t MinGrant;
+        uint8_t MaxLatency;
+    };
+
+    /**
+     * @brief PCI Header Type 1 (PCI-to-PCI Bridge)
+     */
+    struct PCIHeader1
+    {
+        PCIDeviceHeader Header;
+        uint32_t BAR0;
+        uint32_t BAR1;
+        uint8_t PrimaryBusNumber;
+        uint8_t SecondaryBusNumber;
+        uint8_t SubordinateBusNumber;
+        uint8_t SecondaryLatencyTimer;
+        uint8_t IOBase;
+        uint8_t IOLimit;
+        uint16_t SecondaryStatus;
+        uint16_t MemoryBase;
+        uint16_t MemoryLimit;
+        uint16_t PrefetchableMemoryBase;
+        uint16_t PrefetchableMemoryLimit;
+        uint32_t PrefetchableMemoryBaseUpper32;
+        uint32_t PrefetchableMemoryLimitUpper32;
+        uint16_t IOBaseUpper16;
+        uint16_t IOLimitUpper16;
+        uint8_t CapabilitiesPointer;
+        uint8_t Reserved0;
+        uint16_t Reserved1;
+        uint32_t ExpansionROMBaseAddress;
+        uint8_t InterruptLine;
+        uint8_t InterruptPin;
+        uint16_t BridgeControl;
+    };
+
+    /**
+     * @brief PCI Header Type 2 (PCI-to-CardBus Bridge)
+     */
+    struct PCIHeader2
+    {
+        PCIDeviceHeader Header;
+        uint32_t CardbusSocketRegistersBaseAddress;
+        uint8_t CapabilitiesPointer;
+        uint8_t Reserved0;
+        uint16_t SecondaryStatus;
+        uint8_t PCIbusNumber;
+        uint8_t CardbusBusNumber;
+        uint8_t SubordinateBusNumber;
+        uint8_t CardbusLatencyTimer;
+        uint32_t MemoryBase0;
+        uint32_t MemoryLimit0;
+        uint32_t MemoryBase1;
+        uint32_t MemoryLimit1;
+        uint32_t IOBase0;
+        uint32_t IOLimit0;
+        uint32_t IOBase1;
+        uint32_t IOLimit1;
+        uint8_t InterruptLine;
+        uint8_t InterruptPin;
+        uint16_t BridgeControl;
+        uint16_t SubsystemVendorID;
+        uint16_t SubsystemID;
+        uint32_t LegacyBaseAddress;
+    };
+
+    struct DeviceConfig
+    {
+        uintptr_t BaseAddress;
+        uint16_t PCISegGroup;
+        uint8_t StartBus;
+        uint8_t EndBus;
+        uint32_t Reserved;
+    } __packed;
+
+    class PCI
+    {
+    private:
+        std::vector<PCIDeviceHeader *> Devices;
+
+    public:
+        std::vector<PCIDeviceHeader *> &GetDevices() { return Devices; }
+        void EnumerateFunction(uintptr_t DeviceAddress, uint64_t Function);
+        void EnumerateDevice(uintptr_t BusAddress, uint64_t Device);
+        void EnumerateBus(uintptr_t BaseAddress, uint64_t Bus);
+        std::vector<PCIDeviceHeader *> FindPCIDevice(uint8_t Class, uint8_t Subclass, uint8_t ProgIF);
+        std::vector<PCIDeviceHeader *> FindPCIDevice(int VendorID, int DeviceID);
+
+        PCI();
+        ~PCI();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_PCI_H__
diff --git a/Kernel/include/power.hpp b/Kernel/include/power.hpp
new file mode 100644
index 00000000..c8406cf9
--- /dev/null
+++ b/Kernel/include/power.hpp
@@ -0,0 +1,70 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_POWER_H__
+#define __FENNIX_KERNEL_POWER_H__
+
+#include <types.h>
+
+namespace Power
+{
+    class Power
+    {
+    private:
+        void *acpi = nullptr;
+        void *dsdt = nullptr;
+        void *madt = nullptr;
+
+    public:
+        /**
+         * @brief Get Advanced Configuration and Power Interface. (Available only on x32 and x64)
+         *
+         * @return void* (ACPI::ACPI *)
+         */
+        void *GetACPI() { return this->acpi; }
+
+        /**
+         * @brief Get Differentiated System Description Table. (Available only on x32 and x64)
+         *
+         * @return void* (ACPI::DSDT *)
+         */
+        void *GetDSDT() { return this->dsdt; }
+
+        /**
+         * @brief Get Multiple APIC Description Table. (Available only on x32 and x64)
+         *
+         * @return void* (ACPI::MADT *)
+         */
+        void *GetMADT() { return this->madt; }
+
+        /**
+         * @brief Reboot the system.
+         */
+        void Reboot();
+
+        /**
+         * @brief Shutdown the system.
+         */
+        void Shutdown();
+
+        void InitDSDT();
+        Power();
+        ~Power();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_POWER_H__
diff --git a/Kernel/include/printf.h b/Kernel/include/printf.h
new file mode 100644
index 00000000..52866c68
--- /dev/null
+++ b/Kernel/include/printf.h
@@ -0,0 +1,194 @@
+/**
+ * @author (c) Eyal Rozenberg <eyalroz1@gmx.com>
+ *             2021-2022, Haifa, Palestine/Israel
+ * @author (c) Marco Paland (info@paland.com)
+ *             2014-2019, PALANDesign Hannover, Germany
+ *
+ * @note Others have made smaller contributions to this file: see the
+ * contributors page at https://github.com/eyalroz/printf/graphs/contributors
+ * or ask one of the authors.
+ *
+ * @brief Small stand-alone implementation of the printf family of functions
+ * (`(v)printf`, `(v)s(n)printf` etc., geared towards use on embedded systems with
+ * a very limited resources.
+ *
+ * @note the implementations are thread-safe; re-entrant; use no functions from
+ * the standard library; and do not dynamically allocate any memory.
+ *
+ * @license The MIT License (MIT)
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#ifndef PRINTF_H_
+#define PRINTF_H_
+
+#include <types.h>
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+#ifdef __GNUC__
+#define ATTR_PRINTF(one_based_format_index, first_arg) \
+    __attribute__((format(__printf__, (one_based_format_index), (first_arg))))
+#define ATTR_VPRINTF(one_based_format_index) ATTR_PRINTF((one_based_format_index), 0)
+#else
+#define ATTR_PRINTF((one_based_format_index), (first_arg))
+#define ATTR_VPRINTF(one_based_format_index)
+#endif
+
+#ifndef PRINTF_ALIAS_STANDARD_FUNCTION_NAMES
+#define PRINTF_ALIAS_STANDARD_FUNCTION_NAMES 0
+#endif
+
+#if PRINTF_ALIAS_STANDARD_FUNCTION_NAMES
+#define printf printf
+#define sprintf sprintf
+#define vsprintf vsprintf
+#define snprintf_ snprintf
+#define vsnprintf vsnprintf
+#define vprintf vprintf
+#endif
+
+// If you want to include this implementation file directly rather than
+// link against, this will let you control the functions' visibility,
+// e.g. make them static so as not to clash with other objects also
+// using them.
+#ifndef PRINTF_VISIBILITY
+#define PRINTF_VISIBILITY
+#endif
+
+    /**
+     * Prints/send a single character to some opaque output entity
+     *
+     * @note This function is not implemented by the library, only declared; you must provide an
+     * implementation if you wish to use the @ref printf / @ref vprintf function (and possibly
+     * for linking against the library, if your toolchain does not support discarding unused functions)
+     *
+     * @note The output could be as simple as a wrapper for the `write()` system call on a Unix-like
+     * system, or even libc's @ref putchar , for replicating actual functionality of libc's @ref printf
+     * function; but on an embedded system it may involve interaction with a special output device,
+     * like a UART, etc.
+     *
+     * @note in libc's @ref putchar, the parameter type is an int; this was intended to support the
+     * representation of either a proper character or EOF in a variable - but this is really not
+     * meaningful to pass into @ref putchar and is discouraged today. See further discussion in:
+     * @link https://stackoverflow.com/q/17452847/1593077
+     *
+     * @param c the single character to print
+     */
+    // PRINTF_VISIBILITY
+    // void putchar(char c);
+
+    /**
+     * An implementation of the C standard's printf/vprintf
+     *
+     * @note you must implement a @ref putchar_ function for using this function - it invokes @ref putchar_
+     * rather than directly performing any I/O (which insulates it from any dependence on the operating system
+     * and external libraries).
+     *
+     * @param format A string specifying the format of the output, with %-marked specifiers of how to interpret
+     * additional arguments.
+     * @param arg Additional arguments to the function, one for each %-specifier in @p format string
+     * @return The number of characters written into @p s, not counting the terminating null character
+     */
+    ///@{
+    PRINTF_VISIBILITY
+    int printf(const char *format, ...) ATTR_PRINTF(1, 2);
+    PRINTF_VISIBILITY
+    int vprintf(const char *format, va_list arg) ATTR_VPRINTF(1);
+    ///@}
+
+    /**
+     * An implementation of the C standard's sprintf/vsprintf
+     *
+     * @note For security considerations (the potential for exceeding the buffer bounds), please consider using
+     * the size-constrained variant, @ref snprintf / @ref vsnprintf , instead.
+     *
+     * @param s An array in which to store the formatted string. It must be large enough to fit the formatted
+     * output!
+     * @param format A string specifying the format of the output, with %-marked specifiers of how to interpret
+     * additional arguments.
+     * @param arg Additional arguments to the function, one for each specifier in @p format
+     * @return The number of characters written into @p s, not counting the terminating null character
+     */
+    ///@{
+    PRINTF_VISIBILITY
+    int sprintf(char *s, const char *format, ...) ATTR_PRINTF(2, 3);
+    PRINTF_VISIBILITY
+    int vsprintf(char *s, const char *format, va_list arg) ATTR_VPRINTF(2);
+    ///@}
+
+    /**
+     * An implementation of the C standard's snprintf/vsnprintf
+     *
+     * @param s An array in which to store the formatted string. It must be large enough to fit either the
+     * entire formatted output, or at least @p n characters. Alternatively, it can be NULL, in which case
+     * nothing will be printed, and only the number of characters which _could_ have been printed is
+     * tallied and returned.
+     * @param n The maximum number of characters to write to the array, including a terminating null character
+     * @param format A string specifying the format of the output, with %-marked specifiers of how to interpret
+     * additional arguments.
+     * @param arg Additional arguments to the function, one for each specifier in @p format
+     * @return The number of characters that COULD have been written into @p s, not counting the terminating
+     *         null character. A value equal or larger than @p n indicates truncation. Only when the returned value
+     *         is non-negative and less than @p n, the null-terminated string has been fully and successfully printed.
+     */
+    ///@{
+    PRINTF_VISIBILITY
+    int snprintf(char *s, size_t count, const char *format, ...) ATTR_PRINTF(3, 4);
+    PRINTF_VISIBILITY
+    int vsnprintf(char *s, size_t count, const char *format, va_list arg) ATTR_VPRINTF(3);
+    ///@}
+
+    /**
+     * printf/vprintf with user-specified output function
+     *
+     * An alternative to @ref printf, in which the output function is specified dynamically
+     * (rather than @ref putchar_ being used)
+     *
+     * @param out An output function which takes one character and a type-erased additional parameters
+     * @param extra_arg The type-erased argument to pass to the output function @p out with each call
+     * @param format A string specifying the format of the output, with %-marked specifiers of how to interpret
+     * additional arguments.
+     * @param arg Additional arguments to the function, one for each specifier in @p format
+     * @return The number of characters for which the output f unction was invoked, not counting the terminating null character
+     *
+     */
+    PRINTF_VISIBILITY
+    int fctprintf(void (*out)(char c, void *extra_arg), void *extra_arg, const char *format, ...) ATTR_PRINTF(3, 4);
+    PRINTF_VISIBILITY
+    int vfctprintf(void (*out)(char c, void *extra_arg), void *extra_arg, const char *format, va_list arg) ATTR_VPRINTF(3);
+
+#if PRINTF_ALIAS_STANDARD_FUNCTION_NAMES
+#undef printf
+#undef sprintf
+#undef vsprintf
+#undef snprintf_
+#undef vsnprintf
+#undef vprintf
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // PRINTF_H_
\ No newline at end of file
diff --git a/Kernel/include/rand.hpp b/Kernel/include/rand.hpp
new file mode 100644
index 00000000..50aa4fa3
--- /dev/null
+++ b/Kernel/include/rand.hpp
@@ -0,0 +1,31 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_RANDOM_H__
+#define __FENNIX_KERNEL_RANDOM_H__
+
+#include <types.h>
+
+namespace Random
+{
+    uint16_t rand16();
+    uint32_t rand32();
+    uint64_t rand64();
+    void ChangeSeed(uint64_t CustomSeed);
+}
+
+#endif // !__FENNIX_KERNEL_RANDOM_H__
diff --git a/Kernel/include/recovery.hpp b/Kernel/include/recovery.hpp
new file mode 100644
index 00000000..ae56d1ac
--- /dev/null
+++ b/Kernel/include/recovery.hpp
@@ -0,0 +1,41 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_RECOVERY_H__
+#define __FENNIX_KERNEL_RECOVERY_H__
+
+#include <types.h>
+#include <memory.hpp>
+#include <task.hpp>
+
+namespace Recovery
+{
+    class KernelRecovery
+    {
+    private:
+        Memory::MemMgr *mem;
+        Tasking::TCB *guiThread;
+        Tasking::TCB *recoveryThread;
+
+    public:
+        void RecoveryThread();
+        KernelRecovery();
+        ~KernelRecovery();
+    };
+}
+
+#endif // !__FENNIX_KERNEL_RECOVERY_H__
diff --git a/Kernel/include/smart_ptr.hpp b/Kernel/include/smart_ptr.hpp
new file mode 100644
index 00000000..577084f1
--- /dev/null
+++ b/Kernel/include/smart_ptr.hpp
@@ -0,0 +1,19 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <std/smart_ptr.hpp>
diff --git a/Kernel/include/smp.hpp b/Kernel/include/smp.hpp
new file mode 100644
index 00000000..473d4345
--- /dev/null
+++ b/Kernel/include/smp.hpp
@@ -0,0 +1,81 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_SMP_H__
+#define __FENNIX_KERNEL_SMP_H__
+
+#include <task.hpp>
+#include <types.h>
+#include <atomic>
+
+/** @brief Maximum supported number of CPU cores by the kernel */
+#define MAX_CPU 256
+#define CPU_DATA_CHECKSUM 0xC0FFEE
+
+struct CPUArchData
+{
+#if defined(a64)
+    CPU::x64::FXState *FPU;
+    /* TODO */
+#elif defined(a32)
+#elif defined(aa64)
+#endif
+};
+
+struct CPUData
+{
+    /** @brief Used by syscall handler */
+    uint8_t *SystemCallStack; /* gs+0x0 */
+
+    /** @brief Used by syscall handler */
+    uintptr_t TempStack; /* gs+0x8 */
+
+    /** @brief Used by CPU */
+    uintptr_t Stack; /* gs+0x10 */
+
+    /** @brief CPU ID. */
+    int ID;
+
+    /** @brief Local CPU error code. */
+    long ErrorCode;
+
+    /** @brief Current running process */
+    std::atomic<Tasking::PCB *> CurrentProcess;
+
+    /** @brief Current running thread */
+    std::atomic<Tasking::TCB *> CurrentThread;
+
+    /** @brief Architecture-specific data. */
+    CPUArchData Data;
+
+    /** @brief Checksum. Used to verify the integrity of the data. Must be equal to CPU_DATA_CHECKSUM (0xC0FFEE). */
+    int Checksum;
+
+    /** @brief Is CPU online? */
+    bool IsActive;
+} __aligned(16);
+
+CPUData *GetCurrentCPU();
+CPUData *GetCPU(long ID);
+
+namespace SMP
+{
+    extern int CPUCores;
+    void Initialize(void *madt);
+}
+
+#endif // !__FENNIX_KERNEL_SMP_H__
diff --git a/Kernel/include/stb/image.h b/Kernel/include/stb/image.h
new file mode 100644
index 00000000..7cd378ee
--- /dev/null
+++ b/Kernel/include/stb/image.h
@@ -0,0 +1,9370 @@
+/* stb_image - v2.28 - public domain image loader - http://nothings.org/stb
+                                  no warranty implied; use at your own risk
+
+   Do this:
+      #define STB_IMAGE_IMPLEMENTATION
+   before you include this file in *one* C or C++ file to create the implementation.
+
+   // i.e. it should look like this:
+   #include ...
+   #include ...
+   #include ...
+   #define STB_IMAGE_IMPLEMENTATION
+   #include "stb_image.h"
+
+   You can #define STBI_ASSERT(x) before the #include to avoid using assert.h.
+   And #define STBI_MALLOC, STBI_REALLOC, and STBI_FREE to avoid using malloc,realloc,free
+
+
+   QUICK NOTES:
+      Primarily of interest to game developers and other people who can
+          avoid problematic images and only need the trivial interface
+
+      JPEG baseline & progressive (12 bpc/arithmetic not supported, same as stock IJG lib)
+      PNG 1/2/4/8/16-bit-per-channel
+
+      TGA (not sure what subset, if a subset)
+      BMP non-1bpp, non-RLE
+      PSD (composited view only, no extra channels, 8/16 bit-per-channel)
+
+      GIF (*comp always reports as 4-channel)
+      HDR (radiance rgbE format)
+      PIC (Softimage PIC)
+      PNM (PPM and PGM binary only)
+
+      Animated GIF still needs a proper API, but here's one way to do it:
+          http://gist.github.com/urraka/685d9a6340b26b830d49
+
+      - decode from memory or through FILE (define STBI_NO_STDIO to remove code)
+      - decode from arbitrary I/O callbacks
+      - SIMD acceleration on x86/x64 (SSE2) and ARM (NEON)
+
+   Full documentation under "DOCUMENTATION" below.
+
+
+LICENSE
+
+  See end of file for license information.
+
+RECENT REVISION HISTORY:
+
+      2.28  (2023-01-29) many error fixes, security errors, just tons of stuff
+      2.27  (2021-07-11) document stbi_info better, 16-bit PNM support, bug fixes
+      2.26  (2020-07-13) many minor fixes
+      2.25  (2020-02-02) fix warnings
+      2.24  (2020-02-02) fix warnings; thread-local failure_reason and flip_vertically
+      2.23  (2019-08-11) fix clang static analysis warning
+      2.22  (2019-03-04) gif fixes, fix warnings
+      2.21  (2019-02-25) fix typo in comment
+      2.20  (2019-02-07) support utf8 filenames in Windows; fix warnings and platform ifdefs
+      2.19  (2018-02-11) fix warning
+      2.18  (2018-01-30) fix warnings
+      2.17  (2018-01-29) bugfix, 1-bit BMP, 16-bitness query, fix warnings
+      2.16  (2017-07-23) all functions have 16-bit variants; optimizations; bugfixes
+      2.15  (2017-03-18) fix png-1,2,4; all Imagenet JPGs; no runtime SSE detection on GCC
+      2.14  (2017-03-03) remove deprecated STBI_JPEG_OLD; fixes for Imagenet JPGs
+      2.13  (2016-12-04) experimental 16-bit API, only for PNG so far; fixes
+      2.12  (2016-04-02) fix typo in 2.11 PSD fix that caused crashes
+      2.11  (2016-04-02) 16-bit PNGS; enable SSE2 in non-gcc x64
+                         RGB-format JPEG; remove white matting in PSD;
+                         allocate large structures on the stack;
+                         correct channel count for PNG & BMP
+      2.10  (2016-01-22) avoid warning introduced in 2.09
+      2.09  (2016-01-16) 16-bit TGA; comments in PNM files; STBI_REALLOC_SIZED
+
+   See end of file for full revision history.
+
+
+ ============================    Contributors    =========================
+
+ Image formats                          Extensions, features
+    Sean Barrett (jpeg, png, bmp)          Jetro Lauha (stbi_info)
+    Nicolas Schulz (hdr, psd)              Martin "SpartanJ" Golini (stbi_info)
+    Jonathan Dummer (tga)                  James "moose2000" Brown (iPhone PNG)
+    Jean-Marc Lienher (gif)                Ben "Disch" Wenger (io callbacks)
+    Tom Seddon (pic)                       Omar Cornut (1/2/4-bit PNG)
+    Thatcher Ulrich (psd)                  Nicolas Guillemot (vertical flip)
+    Ken Miller (pgm, ppm)                  Richard Mitton (16-bit PSD)
+    github:urraka (animated gif)           Junggon Kim (PNM comments)
+    Christopher Forseth (animated gif)     Daniel Gibson (16-bit TGA)
+                                           socks-the-fox (16-bit PNG)
+                                           Jeremy Sawicki (handle all ImageNet JPGs)
+ Optimizations & bugfixes                  Mikhail Morozov (1-bit BMP)
+    Fabian "ryg" Giesen                    Anael Seghezzi (is-16-bit query)
+    Arseny Kapoulkine                      Simon Breuss (16-bit PNM)
+    John-Mark Allen
+    Carmelo J Fdez-Aguera
+
+ Bug & warning fixes
+    Marc LeBlanc            David Woo          Guillaume George     Martins Mozeiko
+    Christpher Lloyd        Jerry Jansson      Joseph Thomson       Blazej Dariusz Roszkowski
+    Phil Jordan                                Dave Moore           Roy Eltham
+    Hayaki Saito            Nathan Reed        Won Chun
+    Luke Graham             Johan Duparc       Nick Verigakis       the Horde3D community
+    Thomas Ruf              Ronny Chevalier                         github:rlyeh
+    Janez Zemva             John Bartholomew   Michal Cichon        github:romigrou
+    Jonathan Blow           Ken Hamada         Tero Hanninen        github:svdijk
+    Eugene Golushkov        Laurent Gomila     Cort Stratton        github:snagar
+    Aruelien Pocheville     Sergio Gonzalez    Thibault Reuille     github:Zelex
+    Cass Everitt            Ryamond Barbiero                        github:grim210
+    Paul Du Bois            Engin Manap        Aldo Culquicondor    github:sammyhw
+    Philipp Wiesemann       Dale Weiler        Oriol Ferrer Mesia   github:phprus
+    Josh Tobin              Neil Bickford      Matthew Gregan       github:poppolopoppo
+    Julian Raschke          Gregory Mullen     Christian Floisand   github:darealshinji
+    Baldur Karlsson         Kevin Schmidt      JR Smith             github:Michaelangel007
+                            Brad Weinberger    Matvey Cherevko      github:mosra
+    Luca Sas                Alexander Veselov  Zack Middleton       [reserved]
+    Ryan C. Gordon          [reserved]                              [reserved]
+                     DO NOT ADD YOUR NAME HERE
+
+                     Jacko Dirks
+
+  To add your name to the credits, pick a random blank space in the middle and fill it.
+  80% of merge conflicts on stb PRs are due to people adding their name at the end
+  of the credits.
+*/
+
+#ifndef STBI_INCLUDE_STB_IMAGE_H
+#define STBI_INCLUDE_STB_IMAGE_H
+
+// DOCUMENTATION
+//
+// Limitations:
+//    - no 12-bit-per-channel JPEG
+//    - no JPEGs with arithmetic coding
+//    - GIF always returns *comp=4
+//
+// Basic usage (see HDR discussion below for HDR usage):
+//    int x,y,n;
+//    unsigned char *data = stbi_load(filename, &x, &y, &n, 0);
+//    // ... process data if not NULL ...
+//    // ... x = width, y = height, n = # 8-bit components per pixel ...
+//    // ... replace '0' with '1'..'4' to force that many components per pixel
+//    // ... but 'n' will always be the number that it would have been if you said 0
+//    stbi_image_free(data);
+//
+// Standard parameters:
+//    int *x                 -- outputs image width in pixels
+//    int *y                 -- outputs image height in pixels
+//    int *channels_in_file  -- outputs # of image components in image file
+//    int desired_channels   -- if non-zero, # of image components requested in result
+//
+// The return value from an image loader is an 'unsigned char *' which points
+// to the pixel data, or NULL on an allocation failure or if the image is
+// corrupt or invalid. The pixel data consists of *y scanlines of *x pixels,
+// with each pixel consisting of N interleaved 8-bit components; the first
+// pixel pointed to is top-left-most in the image. There is no padding between
+// image scanlines or between pixels, regardless of format. The number of
+// components N is 'desired_channels' if desired_channels is non-zero, or
+// *channels_in_file otherwise. If desired_channels is non-zero,
+// *channels_in_file has the number of components that _would_ have been
+// output otherwise. E.g. if you set desired_channels to 4, you will always
+// get RGBA output, but you can check *channels_in_file to see if it's trivially
+// opaque because e.g. there were only 3 channels in the source image.
+//
+// An output image with N components has the following components interleaved
+// in this order in each pixel:
+//
+//     N=#comp     components
+//       1           grey
+//       2           grey, alpha
+//       3           red, green, blue
+//       4           red, green, blue, alpha
+//
+// If image loading fails for any reason, the return value will be NULL,
+// and *x, *y, *channels_in_file will be unchanged. The function
+// stbi_failure_reason() can be queried for an extremely brief, end-user
+// unfriendly explanation of why the load failed. Define STBI_NO_FAILURE_STRINGS
+// to avoid compiling these strings at all, and STBI_FAILURE_USERMSG to get slightly
+// more user-friendly ones.
+//
+// Paletted PNG, BMP, GIF, and PIC images are automatically depalettized.
+//
+// To query the width, height and component count of an image without having to
+// decode the full file, you can use the stbi_info family of functions:
+//
+//   int x,y,n,ok;
+//   ok = stbi_info(filename, &x, &y, &n);
+//   // returns ok=1 and sets x, y, n if image is a supported format,
+//   // 0 otherwise.
+//
+// Note that stb_image pervasively uses ints in its public API for sizes,
+// including sizes of memory buffers. This is now part of the API and thus
+// hard to change without causing breakage. As a result, the various image
+// loaders all have certain limits on image size; these differ somewhat
+// by format but generally boil down to either just under 2GB or just under
+// 1GB. When the decoded image would be larger than this, stb_image decoding
+// will fail.
+//
+// Additionally, stb_image will reject image files that have any of their
+// dimensions set to a larger value than the configurable STBI_MAX_DIMENSIONS,
+// which defaults to 2**24 = 16777216 pixels. Due to the above memory limit,
+// the only way to have an image with such dimensions load correctly
+// is for it to have a rather extreme aspect ratio. Either way, the
+// assumption here is that such larger images are likely to be malformed
+// or malicious. If you do need to load an image with individual dimensions
+// larger than that, and it still fits in the overall size limit, you can
+// #define STBI_MAX_DIMENSIONS on your own to be something larger.
+//
+// ===========================================================================
+//
+// UNICODE:
+//
+//   If compiling for Windows and you wish to use Unicode filenames, compile
+//   with
+//       #define STBI_WINDOWS_UTF8
+//   and pass utf8-encoded filenames. Call stbi_convert_wchar_to_utf8 to convert
+//   Windows wchar_t filenames to utf8.
+//
+// ===========================================================================
+//
+// Philosophy
+//
+// stb libraries are designed with the following priorities:
+//
+//    1. easy to use
+//    2. easy to maintain
+//    3. good performance
+//
+// Sometimes I let "good performance" creep up in priority over "easy to maintain",
+// and for best performance I may provide less-easy-to-use APIs that give higher
+// performance, in addition to the easy-to-use ones. Nevertheless, it's important
+// to keep in mind that from the standpoint of you, a client of this library,
+// all you care about is #1 and #3, and stb libraries DO NOT emphasize #3 above all.
+//
+// Some secondary priorities arise directly from the first two, some of which
+// provide more explicit reasons why performance can't be emphasized.
+//
+//    - Portable ("ease of use")
+//    - Small source code footprint ("easy to maintain")
+//    - No dependencies ("ease of use")
+//
+// ===========================================================================
+//
+// I/O callbacks
+//
+// I/O callbacks allow you to read from arbitrary sources, like packaged
+// files or some other source. Data read from callbacks are processed
+// through a small internal buffer (currently 128 bytes) to try to reduce
+// overhead.
+//
+// The three functions you must define are "read" (reads some bytes of data),
+// "skip" (skips some bytes of data), "eof" (reports if the stream is at the end).
+//
+// ===========================================================================
+//
+// SIMD support
+//
+// The JPEG decoder will try to automatically use SIMD kernels on x86 when
+// supported by the compiler. For ARM Neon support, you must explicitly
+// request it.
+//
+// (The old do-it-yourself SIMD API is no longer supported in the current
+// code.)
+//
+// On x86, SSE2 will automatically be used when available based on a run-time
+// test; if not, the generic C versions are used as a fall-back. On ARM targets,
+// the typical path is to have separate builds for NEON and non-NEON devices
+// (at least this is true for iOS and Android). Therefore, the NEON support is
+// toggled by a build flag: define STBI_NEON to get NEON loops.
+//
+// If for some reason you do not want to use any of SIMD code, or if
+// you have issues compiling it, you can disable it entirely by
+// defining STBI_NO_SIMD.
+//
+// ===========================================================================
+//
+// HDR image support   (disable by defining STBI_NO_HDR)
+//
+// stb_image supports loading HDR images in general, and currently the Radiance
+// .HDR file format specifically. You can still load any file through the existing
+// interface; if you attempt to load an HDR file, it will be automatically remapped
+// to LDR, assuming gamma 2.2 and an arbitrary scale factor defaulting to 1;
+// both of these constants can be reconfigured through this interface:
+//
+//     stbi_hdr_to_ldr_gamma(2.2f);
+//     stbi_hdr_to_ldr_scale(1.0f);
+//
+// (note, do not use _inverse_ constants; stbi_image will invert them
+// appropriately).
+//
+// Additionally, there is a new, parallel interface for loading files as
+// (linear) floats to preserve the full dynamic range:
+//
+//    float *data = stbi_loadf(filename, &x, &y, &n, 0);
+//
+// If you load LDR images through this interface, those images will
+// be promoted to floating point values, run through the inverse of
+// constants corresponding to the above:
+//
+//     stbi_ldr_to_hdr_scale(1.0f);
+//     stbi_ldr_to_hdr_gamma(2.2f);
+//
+// Finally, given a filename (or an open file or memory block--see header
+// file for details) containing image data, you can query for the "most
+// appropriate" interface to use (that is, whether the image is HDR or
+// not), using:
+//
+//     stbi_is_hdr(char *filename);
+//
+// ===========================================================================
+//
+// iPhone PNG support:
+//
+// We optionally support converting iPhone-formatted PNGs (which store
+// premultiplied BGRA) back to RGB, even though they're internally encoded
+// differently. To enable this conversion, call
+// stbi_convert_iphone_png_to_rgb(1).
+//
+// Call stbi_set_unpremultiply_on_load(1) as well to force a divide per
+// pixel to remove any premultiplied alpha *only* if the image file explicitly
+// says there's premultiplied data (currently only happens in iPhone images,
+// and only if iPhone convert-to-rgb processing is on).
+//
+// ===========================================================================
+//
+// ADDITIONAL CONFIGURATION
+//
+//  - You can suppress implementation of any of the decoders to reduce
+//    your code footprint by #defining one or more of the following
+//    symbols before creating the implementation.
+//
+//        STBI_NO_JPEG
+//        STBI_NO_PNG
+//        STBI_NO_BMP
+//        STBI_NO_PSD
+//        STBI_NO_TGA
+//        STBI_NO_GIF
+//        STBI_NO_HDR
+//        STBI_NO_PIC
+//        STBI_NO_PNM   (.ppm and .pgm)
+//
+//  - You can request *only* certain decoders and suppress all other ones
+//    (this will be more forward-compatible, as addition of new decoders
+//    doesn't require you to disable them explicitly):
+//
+//        STBI_ONLY_JPEG
+//        STBI_ONLY_PNG
+//        STBI_ONLY_BMP
+//        STBI_ONLY_PSD
+//        STBI_ONLY_TGA
+//        STBI_ONLY_GIF
+//        STBI_ONLY_HDR
+//        STBI_ONLY_PIC
+//        STBI_ONLY_PNM   (.ppm and .pgm)
+//
+//   - If you use STBI_NO_PNG (or _ONLY_ without PNG), and you still
+//     want the zlib decoder to be available, #define STBI_SUPPORT_ZLIB
+//
+//  - If you define STBI_MAX_DIMENSIONS, stb_image will reject images greater
+//    than that size (in either width or height) without further processing.
+//    This is to let programs in the wild set an upper bound to prevent
+//    denial-of-service attacks on untrusted data, as one could generate a
+//    valid image of gigantic dimensions and force stb_image to allocate a
+//    huge block of memory and spend disproportionate time decoding it. By
+//    default this is set to (1 << 24), which is 16777216, but that's still
+//    very big.
+
+#ifndef STBI_NO_STDIO
+#include <stdio.h>
+#endif // STBI_NO_STDIO
+
+#define STBI_VERSION 1
+
+enum
+{
+    STBI_default = 0, // only used for desired_channels
+
+    STBI_grey = 1,
+    STBI_grey_alpha = 2,
+    STBI_rgb = 3,
+    STBI_rgb_alpha = 4
+};
+
+#include <stdlib.h>
+typedef unsigned char stbi_uc;
+typedef unsigned short stbi_us;
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+#ifndef STBIDEF
+#ifdef STB_IMAGE_STATIC
+#define STBIDEF static
+#else
+#define STBIDEF extern
+#endif
+#endif
+
+    //////////////////////////////////////////////////////////////////////////////
+    //
+    // PRIMARY API - works on images of any type
+    //
+
+    //
+    // load image by filename, open file, or memory buffer
+    //
+
+    typedef struct
+    {
+        int (*read)(void *user, char *data, int size); // fill 'data' with 'size' bytes.  return number of bytes actually read
+        void (*skip)(void *user, int n);               // skip the next 'n' bytes, or 'unget' the last -n bytes if negative
+        int (*eof)(void *user);                        // returns nonzero if we are at end of file/data
+    } stbi_io_callbacks;
+
+    ////////////////////////////////////
+    //
+    // 8-bits-per-channel interface
+    //
+
+    STBIDEF stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels);
+    STBIDEF stbi_uc *stbi_load_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels);
+
+#ifndef STBI_NO_STDIO
+    STBIDEF stbi_uc *stbi_load(char const *filename, int *x, int *y, int *channels_in_file, int desired_channels);
+    STBIDEF stbi_uc *stbi_load_from_file(FILE *f, int *x, int *y, int *channels_in_file, int desired_channels);
+// for stbi_load_from_file, file pointer is left pointing immediately after image
+#endif
+
+#ifndef STBI_NO_GIF
+    STBIDEF stbi_uc *stbi_load_gif_from_memory(stbi_uc const *buffer, int len, int **delays, int *x, int *y, int *z, int *comp, int req_comp);
+#endif
+
+#ifdef STBI_WINDOWS_UTF8
+    STBIDEF int stbi_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t *input);
+#endif
+
+    ////////////////////////////////////
+    //
+    // 16-bits-per-channel interface
+    //
+
+    STBIDEF stbi_us *stbi_load_16_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels);
+    STBIDEF stbi_us *stbi_load_16_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels);
+
+#ifndef STBI_NO_STDIO
+    STBIDEF stbi_us *stbi_load_16(char const *filename, int *x, int *y, int *channels_in_file, int desired_channels);
+    STBIDEF stbi_us *stbi_load_from_file_16(FILE *f, int *x, int *y, int *channels_in_file, int desired_channels);
+#endif
+
+////////////////////////////////////
+//
+// float-per-channel interface
+//
+#ifndef STBI_NO_LINEAR
+    STBIDEF float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels);
+    STBIDEF float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels);
+
+#ifndef STBI_NO_STDIO
+    STBIDEF float *stbi_loadf(char const *filename, int *x, int *y, int *channels_in_file, int desired_channels);
+    STBIDEF float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *channels_in_file, int desired_channels);
+#endif
+#endif
+
+#ifndef STBI_NO_HDR
+    STBIDEF void stbi_hdr_to_ldr_gamma(float gamma);
+    STBIDEF void stbi_hdr_to_ldr_scale(float scale);
+#endif // STBI_NO_HDR
+
+#ifndef STBI_NO_LINEAR
+    STBIDEF void stbi_ldr_to_hdr_gamma(float gamma);
+    STBIDEF void stbi_ldr_to_hdr_scale(float scale);
+#endif // STBI_NO_LINEAR
+
+    // stbi_is_hdr is always defined, but always returns false if STBI_NO_HDR
+    STBIDEF int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user);
+    STBIDEF int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len);
+#ifndef STBI_NO_STDIO
+    STBIDEF int stbi_is_hdr(char const *filename);
+    STBIDEF int stbi_is_hdr_from_file(FILE *f);
+#endif // STBI_NO_STDIO
+
+    // get a VERY brief reason for failure
+    // on most compilers (and ALL modern mainstream compilers) this is threadsafe
+    STBIDEF const char *stbi_failure_reason(void);
+
+    // free the loaded image -- this is just free()
+    STBIDEF void stbi_image_free(void *retval_from_stbi_load);
+
+    // get image dimensions & components without fully decoding
+    STBIDEF int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+    STBIDEF int stbi_info_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp);
+    STBIDEF int stbi_is_16_bit_from_memory(stbi_uc const *buffer, int len);
+    STBIDEF int stbi_is_16_bit_from_callbacks(stbi_io_callbacks const *clbk, void *user);
+
+#ifndef STBI_NO_STDIO
+    STBIDEF int stbi_info(char const *filename, int *x, int *y, int *comp);
+    STBIDEF int stbi_info_from_file(FILE *f, int *x, int *y, int *comp);
+    STBIDEF int stbi_is_16_bit(char const *filename);
+    STBIDEF int stbi_is_16_bit_from_file(FILE *f);
+#endif
+
+    // for image formats that explicitly notate that they have premultiplied alpha,
+    // we just return the colors as stored in the file. set this flag to force
+    // unpremultiplication. results are undefined if the unpremultiply overflow.
+    STBIDEF void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply);
+
+    // indicate whether we should process iphone images back to canonical format,
+    // or just pass them through "as-is"
+    STBIDEF void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert);
+
+    // flip the image vertically, so the first pixel in the output array is the bottom left
+    STBIDEF void stbi_set_flip_vertically_on_load(int flag_true_if_should_flip);
+
+    // as above, but only applies to images loaded on the thread that calls the function
+    // this function is only available if your compiler supports thread-local variables;
+    // calling it will fail to link if your compiler doesn't
+    STBIDEF void stbi_set_unpremultiply_on_load_thread(int flag_true_if_should_unpremultiply);
+    STBIDEF void stbi_convert_iphone_png_to_rgb_thread(int flag_true_if_should_convert);
+    STBIDEF void stbi_set_flip_vertically_on_load_thread(int flag_true_if_should_flip);
+
+    // ZLIB client - used by PNG, available for other purposes
+
+    STBIDEF char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen);
+    STBIDEF char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header);
+    STBIDEF char *stbi_zlib_decode_malloc(const char *buffer, int len, int *outlen);
+    STBIDEF int stbi_zlib_decode_buffer(char *obuffer, int olen, const char *ibuffer, int ilen);
+
+    STBIDEF char *stbi_zlib_decode_noheader_malloc(const char *buffer, int len, int *outlen);
+    STBIDEF int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen);
+
+#ifdef __cplusplus
+}
+#endif
+
+//
+//
+////   end header file   /////////////////////////////////////////////////////
+#endif // STBI_INCLUDE_STB_IMAGE_H
+
+#ifdef STB_IMAGE_IMPLEMENTATION
+
+#if defined(STBI_ONLY_JPEG) || defined(STBI_ONLY_PNG) || defined(STBI_ONLY_BMP) || defined(STBI_ONLY_TGA) || defined(STBI_ONLY_GIF) || defined(STBI_ONLY_PSD) || defined(STBI_ONLY_HDR) || defined(STBI_ONLY_PIC) || defined(STBI_ONLY_PNM) || defined(STBI_ONLY_ZLIB)
+#ifndef STBI_ONLY_JPEG
+#define STBI_NO_JPEG
+#endif
+#ifndef STBI_ONLY_PNG
+#define STBI_NO_PNG
+#endif
+#ifndef STBI_ONLY_BMP
+#define STBI_NO_BMP
+#endif
+#ifndef STBI_ONLY_PSD
+#define STBI_NO_PSD
+#endif
+#ifndef STBI_ONLY_TGA
+#define STBI_NO_TGA
+#endif
+#ifndef STBI_ONLY_GIF
+#define STBI_NO_GIF
+#endif
+#ifndef STBI_ONLY_HDR
+#define STBI_NO_HDR
+#endif
+#ifndef STBI_ONLY_PIC
+#define STBI_NO_PIC
+#endif
+#ifndef STBI_ONLY_PNM
+#define STBI_NO_PNM
+#endif
+#endif
+
+#if defined(STBI_NO_PNG) && !defined(STBI_SUPPORT_ZLIB) && !defined(STBI_NO_ZLIB)
+#define STBI_NO_ZLIB
+#endif
+
+#include <stdarg.h>
+#include <stddef.h> // ptrdiff_t on osx
+#include <stdlib.h>
+#include <string.h>
+#include <limits.h>
+
+#if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR)
+#include <math.h> // ldexp, pow
+#endif
+
+#ifndef STBI_NO_STDIO
+#include <stdio.h>
+#endif
+
+#ifndef STBI_ASSERT
+#include <assert.h>
+#define STBI_ASSERT(x) assert(x)
+#endif
+
+#ifdef __cplusplus
+#define STBI_EXTERN extern "C"
+#else
+#define STBI_EXTERN extern
+#endif
+
+#ifndef _MSC_VER
+#ifdef __cplusplus
+#define stbi_inline inline
+#else
+#define stbi_inline
+#endif
+#else
+#define stbi_inline __forceinline
+#endif
+
+#ifndef STBI_NO_THREAD_LOCALS
+#if defined(__cplusplus) && __cplusplus >= 201103L
+#define STBI_THREAD_LOCAL thread_local
+#elif defined(__GNUC__) && __GNUC__ < 5
+#define STBI_THREAD_LOCAL __thread
+#elif defined(_MSC_VER)
+#define STBI_THREAD_LOCAL __declspec(thread)
+#elif defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L && !defined(__STDC_NO_THREADS__)
+#define STBI_THREAD_LOCAL _Thread_local
+#endif
+
+#ifndef STBI_THREAD_LOCAL
+#if defined(__GNUC__)
+#define STBI_THREAD_LOCAL __thread
+#endif
+#endif
+#endif
+
+#if defined(_MSC_VER) || defined(__SYMBIAN32__)
+typedef unsigned short stbi__uint16;
+typedef signed short stbi__int16;
+typedef unsigned int stbi__uint32;
+typedef signed int stbi__int32;
+#else
+#include <stdint.h>
+typedef uint16_t stbi__uint16;
+typedef int16_t stbi__int16;
+typedef uint32_t stbi__uint32;
+typedef int32_t stbi__int32;
+#endif
+
+// should produce compiler error if size is wrong
+typedef unsigned char validate_uint32[sizeof(stbi__uint32) == 4 ? 1 : -1];
+
+#ifdef _MSC_VER
+#define STBI_NOTUSED(v) (void)(v)
+#else
+#define STBI_NOTUSED(v) (void)sizeof(v)
+#endif
+
+#ifdef _MSC_VER
+#define STBI_HAS_LROTL
+#endif
+
+#ifdef STBI_HAS_LROTL
+#define stbi_lrot(x, y) _lrotl(x, y)
+#else
+#define stbi_lrot(x, y) (((x) << (y)) | ((x) >> (-(y)&31)))
+#endif
+
+#if defined(STBI_MALLOC) && defined(STBI_FREE) && (defined(STBI_REALLOC) || defined(STBI_REALLOC_SIZED))
+// ok
+#elif !defined(STBI_MALLOC) && !defined(STBI_FREE) && !defined(STBI_REALLOC) && !defined(STBI_REALLOC_SIZED)
+// ok
+#else
+#error "Must define all or none of STBI_MALLOC, STBI_FREE, and STBI_REALLOC (or STBI_REALLOC_SIZED)."
+#endif
+
+#ifndef STBI_MALLOC
+#define STBI_MALLOC(sz) malloc(sz)
+#define STBI_REALLOC(p, newsz) realloc(p, newsz)
+#define STBI_FREE(p) free(p)
+#endif
+
+#ifndef STBI_REALLOC_SIZED
+#define STBI_REALLOC_SIZED(p, oldsz, newsz) STBI_REALLOC(p, newsz)
+#endif
+
+// x86/x64 detection
+#if defined(__x86_64__) || defined(_M_X64)
+#define STBI__X64_TARGET
+#elif defined(__i386) || defined(_M_IX86)
+#define STBI__X86_TARGET
+#endif
+
+#if defined(__GNUC__) && defined(STBI__X86_TARGET) && !defined(__SSE2__) && !defined(STBI_NO_SIMD)
+// gcc doesn't support sse2 intrinsics unless you compile with -msse2,
+// which in turn means it gets to use SSE2 everywhere. This is unfortunate,
+// but previous attempts to provide the SSE2 functions with runtime
+// detection caused numerous issues. The way architecture extensions are
+// exposed in GCC/Clang is, sadly, not really suited for one-file libs.
+// New behavior: if compiled with -msse2, we use SSE2 without any
+// detection; if not, we don't use it at all.
+#define STBI_NO_SIMD
+#endif
+
+#if defined(__MINGW32__) && defined(STBI__X86_TARGET) && !defined(STBI_MINGW_ENABLE_SSE2) && !defined(STBI_NO_SIMD)
+// Note that __MINGW32__ doesn't actually mean 32-bit, so we have to avoid STBI__X64_TARGET
+//
+// 32-bit MinGW wants ESP to be 16-byte aligned, but this is not in the
+// Windows ABI and VC++ as well as Windows DLLs don't maintain that invariant.
+// As a result, enabling SSE2 on 32-bit MinGW is dangerous when not
+// simultaneously enabling "-mstackrealign".
+//
+// See https://github.com/nothings/stb/issues/81 for more information.
+//
+// So default to no SSE2 on 32-bit MinGW. If you've read this far and added
+// -mstackrealign to your build settings, feel free to #define STBI_MINGW_ENABLE_SSE2.
+#define STBI_NO_SIMD
+#endif
+
+#if !defined(STBI_NO_SIMD) && (defined(STBI__X86_TARGET) || defined(STBI__X64_TARGET))
+#define STBI_SSE2
+#include <emmintrin.h>
+
+#ifdef _MSC_VER
+
+#if _MSC_VER >= 1400 // not VC6
+#include <intrin.h>  // __cpuid
+static int stbi__cpuid3(void)
+{
+    int info[4];
+    __cpuid(info, 1);
+    return info[3];
+}
+#else
+static int stbi__cpuid3(void)
+{
+    int res;
+    __asm {
+      mov  eax,1
+      cpuid
+      mov  res,edx
+    }
+    return res;
+}
+#endif
+
+#define STBI_SIMD_ALIGN(type, name) __declspec(align(16)) type name
+
+#if !defined(STBI_NO_JPEG) && defined(STBI_SSE2)
+static int stbi__sse2_available(void)
+{
+    int info3 = stbi__cpuid3();
+    return ((info3 >> 26) & 1) != 0;
+}
+#endif
+
+#else // assume GCC-style if not VC++
+#define STBI_SIMD_ALIGN(type, name) type name __attribute__((aligned(16)))
+
+#if !defined(STBI_NO_JPEG) && defined(STBI_SSE2)
+static int stbi__sse2_available(void)
+{
+    // If we're even attempting to compile this on GCC/Clang, that means
+    // -msse2 is on, which means the compiler is allowed to use SSE2
+    // instructions at will, and so are we.
+    return 1;
+}
+#endif
+
+#endif
+#endif
+
+// ARM NEON
+#if defined(STBI_NO_SIMD) && defined(STBI_NEON)
+#undef STBI_NEON
+#endif
+
+#ifdef STBI_NEON
+#include <arm_neon.h>
+#ifdef _MSC_VER
+#define STBI_SIMD_ALIGN(type, name) __declspec(align(16)) type name
+#else
+#define STBI_SIMD_ALIGN(type, name) type name __attribute__((aligned(16)))
+#endif
+#endif
+
+#ifndef STBI_SIMD_ALIGN
+#define STBI_SIMD_ALIGN(type, name) type name
+#endif
+
+#ifndef STBI_MAX_DIMENSIONS
+#define STBI_MAX_DIMENSIONS (1 << 24)
+#endif
+
+///////////////////////////////////////////////
+//
+//  stbi__context struct and start_xxx functions
+
+// stbi__context structure is our basic context used by all images, so it
+// contains all the IO context, plus some basic image information
+typedef struct
+{
+    stbi__uint32 img_x, img_y;
+    int img_n, img_out_n;
+
+    stbi_io_callbacks io;
+    void *io_user_data;
+
+    int read_from_callbacks;
+    int buflen;
+    stbi_uc buffer_start[128];
+    int callback_already_read;
+
+    stbi_uc *img_buffer, *img_buffer_end;
+    stbi_uc *img_buffer_original, *img_buffer_original_end;
+} stbi__context;
+
+static void stbi__refill_buffer(stbi__context *s);
+
+// initialize a memory-decode context
+static void stbi__start_mem(stbi__context *s, stbi_uc const *buffer, int len)
+{
+    s->io.read = NULL;
+    s->read_from_callbacks = 0;
+    s->callback_already_read = 0;
+    s->img_buffer = s->img_buffer_original = (stbi_uc *)buffer;
+    s->img_buffer_end = s->img_buffer_original_end = (stbi_uc *)buffer + len;
+}
+
+// initialize a callback-based context
+static void stbi__start_callbacks(stbi__context *s, stbi_io_callbacks *c, void *user)
+{
+    s->io = *c;
+    s->io_user_data = user;
+    s->buflen = sizeof(s->buffer_start);
+    s->read_from_callbacks = 1;
+    s->callback_already_read = 0;
+    s->img_buffer = s->img_buffer_original = s->buffer_start;
+    stbi__refill_buffer(s);
+    s->img_buffer_original_end = s->img_buffer_end;
+}
+
+#ifndef STBI_NO_STDIO
+
+static int stbi__stdio_read(void *user, char *data, int size)
+{
+    return (int)fread(data, 1, size, (FILE *)user);
+}
+
+static void stbi__stdio_skip(void *user, int n)
+{
+    int ch;
+    fseek((FILE *)user, n, SEEK_CUR);
+    ch = fgetc((FILE *)user); /* have to read a byte to reset feof()'s flag */
+    if (ch != EOF)
+    {
+        ungetc(ch, (FILE *)user); /* push byte back onto stream if valid. */
+    }
+}
+
+static int stbi__stdio_eof(void *user)
+{
+    return feof((FILE *)user) || ferror((FILE *)user);
+}
+
+static stbi_io_callbacks stbi__stdio_callbacks =
+    {
+        stbi__stdio_read,
+        stbi__stdio_skip,
+        stbi__stdio_eof,
+};
+
+static void stbi__start_file(stbi__context *s, FILE *f)
+{
+    stbi__start_callbacks(s, &stbi__stdio_callbacks, (void *)f);
+}
+
+// static void stop_file(stbi__context *s) { }
+
+#endif // !STBI_NO_STDIO
+
+static void stbi__rewind(stbi__context *s)
+{
+    // conceptually rewind SHOULD rewind to the beginning of the stream,
+    // but we just rewind to the beginning of the initial buffer, because
+    // we only use it after doing 'test', which only ever looks at at most 92 bytes
+    s->img_buffer = s->img_buffer_original;
+    s->img_buffer_end = s->img_buffer_original_end;
+}
+
+enum
+{
+    STBI_ORDER_RGB,
+    STBI_ORDER_BGR
+};
+
+typedef struct
+{
+    int bits_per_channel;
+    int num_channels;
+    int channel_order;
+} stbi__result_info;
+
+#ifndef STBI_NO_JPEG
+static int stbi__jpeg_test(stbi__context *s);
+static void *stbi__jpeg_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__jpeg_info(stbi__context *s, int *x, int *y, int *comp);
+#endif
+
+#ifndef STBI_NO_PNG
+static int stbi__png_test(stbi__context *s);
+static void *stbi__png_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__png_info(stbi__context *s, int *x, int *y, int *comp);
+static int stbi__png_is16(stbi__context *s);
+#endif
+
+#ifndef STBI_NO_BMP
+static int stbi__bmp_test(stbi__context *s);
+static void *stbi__bmp_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__bmp_info(stbi__context *s, int *x, int *y, int *comp);
+#endif
+
+#ifndef STBI_NO_TGA
+static int stbi__tga_test(stbi__context *s);
+static void *stbi__tga_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__tga_info(stbi__context *s, int *x, int *y, int *comp);
+#endif
+
+#ifndef STBI_NO_PSD
+static int stbi__psd_test(stbi__context *s);
+static void *stbi__psd_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri, int bpc);
+static int stbi__psd_info(stbi__context *s, int *x, int *y, int *comp);
+static int stbi__psd_is16(stbi__context *s);
+#endif
+
+#ifndef STBI_NO_HDR
+static int stbi__hdr_test(stbi__context *s);
+static float *stbi__hdr_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__hdr_info(stbi__context *s, int *x, int *y, int *comp);
+#endif
+
+#ifndef STBI_NO_PIC
+static int stbi__pic_test(stbi__context *s);
+static void *stbi__pic_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__pic_info(stbi__context *s, int *x, int *y, int *comp);
+#endif
+
+#ifndef STBI_NO_GIF
+static int stbi__gif_test(stbi__context *s);
+static void *stbi__gif_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static void *stbi__load_gif_main(stbi__context *s, int **delays, int *x, int *y, int *z, int *comp, int req_comp);
+static int stbi__gif_info(stbi__context *s, int *x, int *y, int *comp);
+#endif
+
+#ifndef STBI_NO_PNM
+static int stbi__pnm_test(stbi__context *s);
+static void *stbi__pnm_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri);
+static int stbi__pnm_info(stbi__context *s, int *x, int *y, int *comp);
+static int stbi__pnm_is16(stbi__context *s);
+#endif
+
+static
+#ifdef STBI_THREAD_LOCAL
+    STBI_THREAD_LOCAL
+#endif
+    const char *stbi__g_failure_reason;
+
+STBIDEF const char *stbi_failure_reason(void)
+{
+    return stbi__g_failure_reason;
+}
+
+#ifndef STBI_NO_FAILURE_STRINGS
+static int stbi__err(const char *str)
+{
+    stbi__g_failure_reason = str;
+    return 0;
+}
+#endif
+
+static void *stbi__malloc(size_t size)
+{
+    return STBI_MALLOC(size);
+}
+
+// stb_image uses ints pervasively, including for offset calculations.
+// therefore the largest decoded image size we can support with the
+// current code, even on 64-bit targets, is INT_MAX. this is not a
+// significant limitation for the intended use case.
+//
+// we do, however, need to make sure our size calculations don't
+// overflow. hence a few helper functions for size calculations that
+// multiply integers together, making sure that they're non-negative
+// and no overflow occurs.
+
+// return 1 if the sum is valid, 0 on overflow.
+// negative terms are considered invalid.
+static int stbi__addsizes_valid(int a, int b)
+{
+    if (b < 0)
+        return 0;
+    // now 0 <= b <= INT_MAX, hence also
+    // 0 <= INT_MAX - b <= INTMAX.
+    // And "a + b <= INT_MAX" (which might overflow) is the
+    // same as a <= INT_MAX - b (no overflow)
+    return a <= INT_MAX - b;
+}
+
+// returns 1 if the product is valid, 0 on overflow.
+// negative factors are considered invalid.
+static int stbi__mul2sizes_valid(int a, int b)
+{
+    if (a < 0 || b < 0)
+        return 0;
+    if (b == 0)
+        return 1; // mul-by-0 is always safe
+    // portable way to check for no overflows in a*b
+    return a <= INT_MAX / b;
+}
+
+#if !defined(STBI_NO_JPEG) || !defined(STBI_NO_PNG) || !defined(STBI_NO_TGA) || !defined(STBI_NO_HDR)
+// returns 1 if "a*b + add" has no negative terms/factors and doesn't overflow
+static int stbi__mad2sizes_valid(int a, int b, int add)
+{
+    return stbi__mul2sizes_valid(a, b) && stbi__addsizes_valid(a * b, add);
+}
+#endif
+
+// returns 1 if "a*b*c + add" has no negative terms/factors and doesn't overflow
+static int stbi__mad3sizes_valid(int a, int b, int c, int add)
+{
+    return stbi__mul2sizes_valid(a, b) && stbi__mul2sizes_valid(a * b, c) &&
+           stbi__addsizes_valid(a * b * c, add);
+}
+
+// returns 1 if "a*b*c*d + add" has no negative terms/factors and doesn't overflow
+#if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR) || !defined(STBI_NO_PNM)
+static int stbi__mad4sizes_valid(int a, int b, int c, int d, int add)
+{
+    return stbi__mul2sizes_valid(a, b) && stbi__mul2sizes_valid(a * b, c) &&
+           stbi__mul2sizes_valid(a * b * c, d) && stbi__addsizes_valid(a * b * c * d, add);
+}
+#endif
+
+#if !defined(STBI_NO_JPEG) || !defined(STBI_NO_PNG) || !defined(STBI_NO_TGA) || !defined(STBI_NO_HDR)
+// mallocs with size overflow checking
+static void *stbi__malloc_mad2(int a, int b, int add)
+{
+    if (!stbi__mad2sizes_valid(a, b, add))
+        return NULL;
+    return stbi__malloc(a * b + add);
+}
+#endif
+
+static void *stbi__malloc_mad3(int a, int b, int c, int add)
+{
+    if (!stbi__mad3sizes_valid(a, b, c, add))
+        return NULL;
+    return stbi__malloc(a * b * c + add);
+}
+
+#if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR) || !defined(STBI_NO_PNM)
+static void *stbi__malloc_mad4(int a, int b, int c, int d, int add)
+{
+    if (!stbi__mad4sizes_valid(a, b, c, d, add))
+        return NULL;
+    return stbi__malloc(a * b * c * d + add);
+}
+#endif
+
+// returns 1 if the sum of two signed ints is valid (between -2^31 and 2^31-1 inclusive), 0 on overflow.
+static int stbi__addints_valid(int a, int b)
+{
+    if ((a >= 0) != (b >= 0))
+        return 1; // a and b have different signs, so no overflow
+    if (a < 0 && b < 0)
+        return a >= INT_MIN - b; // same as a + b >= INT_MIN; INT_MIN - b cannot overflow since b < 0.
+    return a <= INT_MAX - b;
+}
+
+// returns 1 if the product of two signed shorts is valid, 0 on overflow.
+static int stbi__mul2shorts_valid(short a, short b)
+{
+    if (b == 0 || b == -1)
+        return 1; // multiplication by 0 is always 0; check for -1 so SHRT_MIN/b doesn't overflow
+    if ((a >= 0) == (b >= 0))
+        return a <= SHRT_MAX / b; // product is positive, so similar to mul2sizes_valid
+    if (b < 0)
+        return a <= SHRT_MIN / b; // same as a * b >= SHRT_MIN
+    return a >= SHRT_MIN / b;
+}
+
+// stbi__err - error
+// stbi__errpf - error returning pointer to float
+// stbi__errpuc - error returning pointer to unsigned char
+
+#ifdef STBI_NO_FAILURE_STRINGS
+#define stbi__err(x, y) 0
+#elif defined(STBI_FAILURE_USERMSG)
+#define stbi__err(x, y) stbi__err(y)
+#else
+#define stbi__err(x, y) stbi__err(x)
+#endif
+
+#define stbi__errpf(x, y) ((float *)(size_t)(stbi__err(x, y) ? NULL : NULL))
+#define stbi__errpuc(x, y) ((unsigned char *)(size_t)(stbi__err(x, y) ? NULL : NULL))
+
+STBIDEF void stbi_image_free(void *retval_from_stbi_load)
+{
+    STBI_FREE(retval_from_stbi_load);
+}
+
+#ifndef STBI_NO_LINEAR
+static float *stbi__ldr_to_hdr(stbi_uc *data, int x, int y, int comp);
+#endif
+
+#ifndef STBI_NO_HDR
+static stbi_uc *stbi__hdr_to_ldr(float *data, int x, int y, int comp);
+#endif
+
+static int stbi__vertically_flip_on_load_global = 0;
+
+STBIDEF void stbi_set_flip_vertically_on_load(int flag_true_if_should_flip)
+{
+    stbi__vertically_flip_on_load_global = flag_true_if_should_flip;
+}
+
+#ifndef STBI_THREAD_LOCAL
+#define stbi__vertically_flip_on_load stbi__vertically_flip_on_load_global
+#else
+static STBI_THREAD_LOCAL int stbi__vertically_flip_on_load_local, stbi__vertically_flip_on_load_set;
+
+STBIDEF void stbi_set_flip_vertically_on_load_thread(int flag_true_if_should_flip)
+{
+    stbi__vertically_flip_on_load_local = flag_true_if_should_flip;
+    stbi__vertically_flip_on_load_set = 1;
+}
+
+#define stbi__vertically_flip_on_load (stbi__vertically_flip_on_load_set         \
+                                           ? stbi__vertically_flip_on_load_local \
+                                           : stbi__vertically_flip_on_load_global)
+#endif // STBI_THREAD_LOCAL
+
+static void *stbi__load_main(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri, int bpc)
+{
+    memset(ri, 0, sizeof(*ri));         // make sure it's initialized if we add new fields
+    ri->bits_per_channel = 8;           // default is 8 so most paths don't have to be changed
+    ri->channel_order = STBI_ORDER_RGB; // all current input & output are this, but this is here so we can add BGR order
+    ri->num_channels = 0;
+
+// test the formats with a very explicit header first (at least a FOURCC
+// or distinctive magic number first)
+#ifndef STBI_NO_PNG
+    if (stbi__png_test(s))
+        return stbi__png_load(s, x, y, comp, req_comp, ri);
+#endif
+#ifndef STBI_NO_BMP
+    if (stbi__bmp_test(s))
+        return stbi__bmp_load(s, x, y, comp, req_comp, ri);
+#endif
+#ifndef STBI_NO_GIF
+    if (stbi__gif_test(s))
+        return stbi__gif_load(s, x, y, comp, req_comp, ri);
+#endif
+#ifndef STBI_NO_PSD
+    if (stbi__psd_test(s))
+        return stbi__psd_load(s, x, y, comp, req_comp, ri, bpc);
+#else
+    STBI_NOTUSED(bpc);
+#endif
+#ifndef STBI_NO_PIC
+    if (stbi__pic_test(s))
+        return stbi__pic_load(s, x, y, comp, req_comp, ri);
+#endif
+
+// then the formats that can end up attempting to load with just 1 or 2
+// bytes matching expectations; these are prone to false positives, so
+// try them later
+#ifndef STBI_NO_JPEG
+    if (stbi__jpeg_test(s))
+        return stbi__jpeg_load(s, x, y, comp, req_comp, ri);
+#endif
+#ifndef STBI_NO_PNM
+    if (stbi__pnm_test(s))
+        return stbi__pnm_load(s, x, y, comp, req_comp, ri);
+#endif
+
+#ifndef STBI_NO_HDR
+    if (stbi__hdr_test(s))
+    {
+        float *hdr = stbi__hdr_load(s, x, y, comp, req_comp, ri);
+        return stbi__hdr_to_ldr(hdr, *x, *y, req_comp ? req_comp : *comp);
+    }
+#endif
+
+#ifndef STBI_NO_TGA
+    // test tga last because it's a crappy test!
+    if (stbi__tga_test(s))
+        return stbi__tga_load(s, x, y, comp, req_comp, ri);
+#endif
+
+    return stbi__errpuc("unknown image type", "Image not of any known type, or corrupt");
+}
+
+static stbi_uc *stbi__convert_16_to_8(stbi__uint16 *orig, int w, int h, int channels)
+{
+    int i;
+    int img_len = w * h * channels;
+    stbi_uc *reduced;
+
+    reduced = (stbi_uc *)stbi__malloc(img_len);
+    if (reduced == NULL)
+        return stbi__errpuc("outofmem", "Out of memory");
+
+    for (i = 0; i < img_len; ++i)
+        reduced[i] = (stbi_uc)((orig[i] >> 8) & 0xFF); // top half of each byte is sufficient approx of 16->8 bit scaling
+
+    STBI_FREE(orig);
+    return reduced;
+}
+
+static stbi__uint16 *stbi__convert_8_to_16(stbi_uc *orig, int w, int h, int channels)
+{
+    int i;
+    int img_len = w * h * channels;
+    stbi__uint16 *enlarged;
+
+    enlarged = (stbi__uint16 *)stbi__malloc(img_len * 2);
+    if (enlarged == NULL)
+        return (stbi__uint16 *)stbi__errpuc("outofmem", "Out of memory");
+
+    for (i = 0; i < img_len; ++i)
+        enlarged[i] = (stbi__uint16)((orig[i] << 8) + orig[i]); // replicate to high and low byte, maps 0->0, 255->0xffff
+
+    STBI_FREE(orig);
+    return enlarged;
+}
+
+static void stbi__vertical_flip(void *image, int w, int h, int bytes_per_pixel)
+{
+    int row;
+    size_t bytes_per_row = (size_t)w * bytes_per_pixel;
+    stbi_uc temp[2048];
+    stbi_uc *bytes = (stbi_uc *)image;
+
+    for (row = 0; row < (h >> 1); row++)
+    {
+        stbi_uc *row0 = bytes + row * bytes_per_row;
+        stbi_uc *row1 = bytes + (h - row - 1) * bytes_per_row;
+        // swap row0 with row1
+        size_t bytes_left = bytes_per_row;
+        while (bytes_left)
+        {
+            size_t bytes_copy = (bytes_left < sizeof(temp)) ? bytes_left : sizeof(temp);
+            memcpy(temp, row0, bytes_copy);
+            memcpy(row0, row1, bytes_copy);
+            memcpy(row1, temp, bytes_copy);
+            row0 += bytes_copy;
+            row1 += bytes_copy;
+            bytes_left -= bytes_copy;
+        }
+    }
+}
+
+#ifndef STBI_NO_GIF
+static void stbi__vertical_flip_slices(void *image, int w, int h, int z, int bytes_per_pixel)
+{
+    int slice;
+    int slice_size = w * h * bytes_per_pixel;
+
+    stbi_uc *bytes = (stbi_uc *)image;
+    for (slice = 0; slice < z; ++slice)
+    {
+        stbi__vertical_flip(bytes, w, h, bytes_per_pixel);
+        bytes += slice_size;
+    }
+}
+#endif
+
+static unsigned char *stbi__load_and_postprocess_8bit(stbi__context *s, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__result_info ri;
+    void *result = stbi__load_main(s, x, y, comp, req_comp, &ri, 8);
+
+    if (result == NULL)
+        return NULL;
+
+    // it is the responsibility of the loaders to make sure we get either 8 or 16 bit.
+    STBI_ASSERT(ri.bits_per_channel == 8 || ri.bits_per_channel == 16);
+
+    if (ri.bits_per_channel != 8)
+    {
+        result = stbi__convert_16_to_8((stbi__uint16 *)result, *x, *y, req_comp == 0 ? *comp : req_comp);
+        ri.bits_per_channel = 8;
+    }
+
+    // @TODO: move stbi__convert_format to here
+
+    if (stbi__vertically_flip_on_load)
+    {
+        int channels = req_comp ? req_comp : *comp;
+        stbi__vertical_flip(result, *x, *y, channels * sizeof(stbi_uc));
+    }
+
+    return (unsigned char *)result;
+}
+
+static stbi__uint16 *stbi__load_and_postprocess_16bit(stbi__context *s, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__result_info ri;
+    void *result = stbi__load_main(s, x, y, comp, req_comp, &ri, 16);
+
+    if (result == NULL)
+        return NULL;
+
+    // it is the responsibility of the loaders to make sure we get either 8 or 16 bit.
+    STBI_ASSERT(ri.bits_per_channel == 8 || ri.bits_per_channel == 16);
+
+    if (ri.bits_per_channel != 16)
+    {
+        result = stbi__convert_8_to_16((stbi_uc *)result, *x, *y, req_comp == 0 ? *comp : req_comp);
+        ri.bits_per_channel = 16;
+    }
+
+    // @TODO: move stbi__convert_format16 to here
+    // @TODO: special case RGB-to-Y (and RGBA-to-YA) for 8-bit-to-16-bit case to keep more precision
+
+    if (stbi__vertically_flip_on_load)
+    {
+        int channels = req_comp ? req_comp : *comp;
+        stbi__vertical_flip(result, *x, *y, channels * sizeof(stbi__uint16));
+    }
+
+    return (stbi__uint16 *)result;
+}
+
+#if !defined(STBI_NO_HDR) && !defined(STBI_NO_LINEAR)
+static void stbi__float_postprocess(float *result, int *x, int *y, int *comp, int req_comp)
+{
+    if (stbi__vertically_flip_on_load && result != NULL)
+    {
+        int channels = req_comp ? req_comp : *comp;
+        stbi__vertical_flip(result, *x, *y, channels * sizeof(float));
+    }
+}
+#endif
+
+#ifndef STBI_NO_STDIO
+
+#if defined(_WIN32) && defined(STBI_WINDOWS_UTF8)
+STBI_EXTERN __declspec(dllimport) int __stdcall MultiByteToWideChar(unsigned int cp, unsigned long flags, const char *str, int cbmb, wchar_t *widestr, int cchwide);
+STBI_EXTERN __declspec(dllimport) int __stdcall WideCharToMultiByte(unsigned int cp, unsigned long flags, const wchar_t *widestr, int cchwide, char *str, int cbmb, const char *defchar, int *used_default);
+#endif
+
+#if defined(_WIN32) && defined(STBI_WINDOWS_UTF8)
+STBIDEF int stbi_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t *input)
+{
+    return WideCharToMultiByte(65001 /* UTF8 */, 0, input, -1, buffer, (int)bufferlen, NULL, NULL);
+}
+#endif
+
+static FILE *stbi__fopen(char const *filename, char const *mode)
+{
+    FILE *f;
+#if defined(_WIN32) && defined(STBI_WINDOWS_UTF8)
+    wchar_t wMode[64];
+    wchar_t wFilename[1024];
+    if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, filename, -1, wFilename, sizeof(wFilename) / sizeof(*wFilename)))
+        return 0;
+
+    if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, mode, -1, wMode, sizeof(wMode) / sizeof(*wMode)))
+        return 0;
+
+#if defined(_MSC_VER) && _MSC_VER >= 1400
+    if (0 != _wfopen_s(&f, wFilename, wMode))
+        f = 0;
+#else
+    f = _wfopen(wFilename, wMode);
+#endif
+
+#elif defined(_MSC_VER) && _MSC_VER >= 1400
+    if (0 != fopen_s(&f, filename, mode))
+        f = 0;
+#else
+    f = fopen(filename, mode);
+#endif
+    return f;
+}
+
+STBIDEF stbi_uc *stbi_load(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+    FILE *f = stbi__fopen(filename, "rb");
+    unsigned char *result;
+    if (!f)
+        return stbi__errpuc("can't fopen", "Unable to open file");
+    result = stbi_load_from_file(f, x, y, comp, req_comp);
+    fclose(f);
+    return result;
+}
+
+STBIDEF stbi_uc *stbi_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+    unsigned char *result;
+    stbi__context s;
+    stbi__start_file(&s, f);
+    result = stbi__load_and_postprocess_8bit(&s, x, y, comp, req_comp);
+    if (result)
+    {
+        // need to 'unget' all the characters in the IO buffer
+        fseek(f, -(int)(s.img_buffer_end - s.img_buffer), SEEK_CUR);
+    }
+    return result;
+}
+
+STBIDEF stbi__uint16 *stbi_load_from_file_16(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__uint16 *result;
+    stbi__context s;
+    stbi__start_file(&s, f);
+    result = stbi__load_and_postprocess_16bit(&s, x, y, comp, req_comp);
+    if (result)
+    {
+        // need to 'unget' all the characters in the IO buffer
+        fseek(f, -(int)(s.img_buffer_end - s.img_buffer), SEEK_CUR);
+    }
+    return result;
+}
+
+STBIDEF stbi_us *stbi_load_16(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+    FILE *f = stbi__fopen(filename, "rb");
+    stbi__uint16 *result;
+    if (!f)
+        return (stbi_us *)stbi__errpuc("can't fopen", "Unable to open file");
+    result = stbi_load_from_file_16(f, x, y, comp, req_comp);
+    fclose(f);
+    return result;
+}
+
+#endif //! STBI_NO_STDIO
+
+STBIDEF stbi_us *stbi_load_16_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels)
+{
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+    return stbi__load_and_postprocess_16bit(&s, x, y, channels_in_file, desired_channels);
+}
+
+STBIDEF stbi_us *stbi_load_16_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels)
+{
+    stbi__context s;
+    stbi__start_callbacks(&s, (stbi_io_callbacks *)clbk, user);
+    return stbi__load_and_postprocess_16bit(&s, x, y, channels_in_file, desired_channels);
+}
+
+STBIDEF stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+    return stbi__load_and_postprocess_8bit(&s, x, y, comp, req_comp);
+}
+
+STBIDEF stbi_uc *stbi_load_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__context s;
+    stbi__start_callbacks(&s, (stbi_io_callbacks *)clbk, user);
+    return stbi__load_and_postprocess_8bit(&s, x, y, comp, req_comp);
+}
+
+#ifndef STBI_NO_GIF
+STBIDEF stbi_uc *stbi_load_gif_from_memory(stbi_uc const *buffer, int len, int **delays, int *x, int *y, int *z, int *comp, int req_comp)
+{
+    unsigned char *result;
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+
+    result = (unsigned char *)stbi__load_gif_main(&s, delays, x, y, z, comp, req_comp);
+    if (stbi__vertically_flip_on_load)
+    {
+        stbi__vertical_flip_slices(result, *x, *y, *z, *comp);
+    }
+
+    return result;
+}
+#endif
+
+#ifndef STBI_NO_LINEAR
+static float *stbi__loadf_main(stbi__context *s, int *x, int *y, int *comp, int req_comp)
+{
+    unsigned char *data;
+#ifndef STBI_NO_HDR
+    if (stbi__hdr_test(s))
+    {
+        stbi__result_info ri;
+        float *hdr_data = stbi__hdr_load(s, x, y, comp, req_comp, &ri);
+        if (hdr_data)
+            stbi__float_postprocess(hdr_data, x, y, comp, req_comp);
+        return hdr_data;
+    }
+#endif
+    data = stbi__load_and_postprocess_8bit(s, x, y, comp, req_comp);
+    if (data)
+        return stbi__ldr_to_hdr(data, *x, *y, req_comp ? req_comp : *comp);
+    return stbi__errpf("unknown image type", "Image not of any known type, or corrupt");
+}
+
+STBIDEF float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+    return stbi__loadf_main(&s, x, y, comp, req_comp);
+}
+
+STBIDEF float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__context s;
+    stbi__start_callbacks(&s, (stbi_io_callbacks *)clbk, user);
+    return stbi__loadf_main(&s, x, y, comp, req_comp);
+}
+
+#ifndef STBI_NO_STDIO
+STBIDEF float *stbi_loadf(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+    float *result;
+    FILE *f = stbi__fopen(filename, "rb");
+    if (!f)
+        return stbi__errpf("can't fopen", "Unable to open file");
+    result = stbi_loadf_from_file(f, x, y, comp, req_comp);
+    fclose(f);
+    return result;
+}
+
+STBIDEF float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+    stbi__context s;
+    stbi__start_file(&s, f);
+    return stbi__loadf_main(&s, x, y, comp, req_comp);
+}
+#endif // !STBI_NO_STDIO
+
+#endif // !STBI_NO_LINEAR
+
+// these is-hdr-or-not is defined independent of whether STBI_NO_LINEAR is
+// defined, for API simplicity; if STBI_NO_LINEAR is defined, it always
+// reports false!
+
+STBIDEF int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len)
+{
+#ifndef STBI_NO_HDR
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+    return stbi__hdr_test(&s);
+#else
+    STBI_NOTUSED(buffer);
+    STBI_NOTUSED(len);
+    return 0;
+#endif
+}
+
+#ifndef STBI_NO_STDIO
+STBIDEF int stbi_is_hdr(char const *filename)
+{
+    FILE *f = stbi__fopen(filename, "rb");
+    int result = 0;
+    if (f)
+    {
+        result = stbi_is_hdr_from_file(f);
+        fclose(f);
+    }
+    return result;
+}
+
+STBIDEF int stbi_is_hdr_from_file(FILE *f)
+{
+#ifndef STBI_NO_HDR
+    long pos = ftell(f);
+    int res;
+    stbi__context s;
+    stbi__start_file(&s, f);
+    res = stbi__hdr_test(&s);
+    fseek(f, pos, SEEK_SET);
+    return res;
+#else
+    STBI_NOTUSED(f);
+    return 0;
+#endif
+}
+#endif // !STBI_NO_STDIO
+
+STBIDEF int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user)
+{
+#ifndef STBI_NO_HDR
+    stbi__context s;
+    stbi__start_callbacks(&s, (stbi_io_callbacks *)clbk, user);
+    return stbi__hdr_test(&s);
+#else
+    STBI_NOTUSED(clbk);
+    STBI_NOTUSED(user);
+    return 0;
+#endif
+}
+
+#ifndef STBI_NO_LINEAR
+static float stbi__l2h_gamma = 2.2f, stbi__l2h_scale = 1.0f;
+
+STBIDEF void stbi_ldr_to_hdr_gamma(float gamma) { stbi__l2h_gamma = gamma; }
+STBIDEF void stbi_ldr_to_hdr_scale(float scale) { stbi__l2h_scale = scale; }
+#endif
+
+static float stbi__h2l_gamma_i = 1.0f / 2.2f, stbi__h2l_scale_i = 1.0f;
+
+STBIDEF void stbi_hdr_to_ldr_gamma(float gamma) { stbi__h2l_gamma_i = 1 / gamma; }
+STBIDEF void stbi_hdr_to_ldr_scale(float scale) { stbi__h2l_scale_i = 1 / scale; }
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Common code used by all image loaders
+//
+
+enum
+{
+    STBI__SCAN_load = 0,
+    STBI__SCAN_type,
+    STBI__SCAN_header
+};
+
+static void stbi__refill_buffer(stbi__context *s)
+{
+    int n = (s->io.read)(s->io_user_data, (char *)s->buffer_start, s->buflen);
+    s->callback_already_read += (int)(s->img_buffer - s->img_buffer_original);
+    if (n == 0)
+    {
+        // at end of file, treat same as if from memory, but need to handle case
+        // where s->img_buffer isn't pointing to safe memory, e.g. 0-byte file
+        s->read_from_callbacks = 0;
+        s->img_buffer = s->buffer_start;
+        s->img_buffer_end = s->buffer_start + 1;
+        *s->img_buffer = 0;
+    }
+    else
+    {
+        s->img_buffer = s->buffer_start;
+        s->img_buffer_end = s->buffer_start + n;
+    }
+}
+
+stbi_inline static stbi_uc stbi__get8(stbi__context *s)
+{
+    if (s->img_buffer < s->img_buffer_end)
+        return *s->img_buffer++;
+    if (s->read_from_callbacks)
+    {
+        stbi__refill_buffer(s);
+        return *s->img_buffer++;
+    }
+    return 0;
+}
+
+#if defined(STBI_NO_JPEG) && defined(STBI_NO_HDR) && defined(STBI_NO_PIC) && defined(STBI_NO_PNM)
+// nothing
+#else
+stbi_inline static int stbi__at_eof(stbi__context *s)
+{
+    if (s->io.read)
+    {
+        if (!(s->io.eof)(s->io_user_data))
+            return 0;
+        // if feof() is true, check if buffer = end
+        // special case: we've only got the special 0 character at the end
+        if (s->read_from_callbacks == 0)
+            return 1;
+    }
+
+    return s->img_buffer >= s->img_buffer_end;
+}
+#endif
+
+#if defined(STBI_NO_JPEG) && defined(STBI_NO_PNG) && defined(STBI_NO_BMP) && defined(STBI_NO_PSD) && defined(STBI_NO_TGA) && defined(STBI_NO_GIF) && defined(STBI_NO_PIC)
+// nothing
+#else
+static void stbi__skip(stbi__context *s, int n)
+{
+    if (n == 0)
+        return; // already there!
+    if (n < 0)
+    {
+        s->img_buffer = s->img_buffer_end;
+        return;
+    }
+    if (s->io.read)
+    {
+        int blen = (int)(s->img_buffer_end - s->img_buffer);
+        if (blen < n)
+        {
+            s->img_buffer = s->img_buffer_end;
+            (s->io.skip)(s->io_user_data, n - blen);
+            return;
+        }
+    }
+    s->img_buffer += n;
+}
+#endif
+
+#if defined(STBI_NO_PNG) && defined(STBI_NO_TGA) && defined(STBI_NO_HDR) && defined(STBI_NO_PNM)
+// nothing
+#else
+static int stbi__getn(stbi__context *s, stbi_uc *buffer, int n)
+{
+    if (s->io.read)
+    {
+        int blen = (int)(s->img_buffer_end - s->img_buffer);
+        if (blen < n)
+        {
+            int res, count;
+
+            memcpy(buffer, s->img_buffer, blen);
+
+            count = (s->io.read)(s->io_user_data, (char *)buffer + blen, n - blen);
+            res = (count == (n - blen));
+            s->img_buffer = s->img_buffer_end;
+            return res;
+        }
+    }
+
+    if (s->img_buffer + n <= s->img_buffer_end)
+    {
+        memcpy(buffer, s->img_buffer, n);
+        s->img_buffer += n;
+        return 1;
+    }
+    else
+        return 0;
+}
+#endif
+
+#if defined(STBI_NO_JPEG) && defined(STBI_NO_PNG) && defined(STBI_NO_PSD) && defined(STBI_NO_PIC)
+// nothing
+#else
+static int stbi__get16be(stbi__context *s)
+{
+    int z = stbi__get8(s);
+    return (z << 8) + stbi__get8(s);
+}
+#endif
+
+#if defined(STBI_NO_PNG) && defined(STBI_NO_PSD) && defined(STBI_NO_PIC)
+// nothing
+#else
+static stbi__uint32 stbi__get32be(stbi__context *s)
+{
+    stbi__uint32 z = stbi__get16be(s);
+    return (z << 16) + stbi__get16be(s);
+}
+#endif
+
+#if defined(STBI_NO_BMP) && defined(STBI_NO_TGA) && defined(STBI_NO_GIF)
+// nothing
+#else
+static int stbi__get16le(stbi__context *s)
+{
+    int z = stbi__get8(s);
+    return z + (stbi__get8(s) << 8);
+}
+#endif
+
+#ifndef STBI_NO_BMP
+static stbi__uint32 stbi__get32le(stbi__context *s)
+{
+    stbi__uint32 z = stbi__get16le(s);
+    z += (stbi__uint32)stbi__get16le(s) << 16;
+    return z;
+}
+#endif
+
+#define STBI__BYTECAST(x) ((stbi_uc)((x)&255)) // truncate int to byte without warnings
+
+#if defined(STBI_NO_JPEG) && defined(STBI_NO_PNG) && defined(STBI_NO_BMP) && defined(STBI_NO_PSD) && defined(STBI_NO_TGA) && defined(STBI_NO_GIF) && defined(STBI_NO_PIC) && defined(STBI_NO_PNM)
+// nothing
+#else
+//////////////////////////////////////////////////////////////////////////////
+//
+//  generic converter from built-in img_n to req_comp
+//    individual types do this automatically as much as possible (e.g. jpeg
+//    does all cases internally since it needs to colorspace convert anyway,
+//    and it never has alpha, so very few cases ). png can automatically
+//    interleave an alpha=255 channel, but falls back to this for other cases
+//
+//  assume data buffer is malloced, so malloc a new one and free that one
+//  only failure mode is malloc failing
+
+static stbi_uc stbi__compute_y(int r, int g, int b)
+{
+    return (stbi_uc)(((r * 77) + (g * 150) + (29 * b)) >> 8);
+}
+#endif
+
+#if defined(STBI_NO_PNG) && defined(STBI_NO_BMP) && defined(STBI_NO_PSD) && defined(STBI_NO_TGA) && defined(STBI_NO_GIF) && defined(STBI_NO_PIC) && defined(STBI_NO_PNM)
+// nothing
+#else
+static unsigned char *stbi__convert_format(unsigned char *data, int img_n, int req_comp, unsigned int x, unsigned int y)
+{
+    int i, j;
+    unsigned char *good;
+
+    if (req_comp == img_n)
+        return data;
+    STBI_ASSERT(req_comp >= 1 && req_comp <= 4);
+
+    good = (unsigned char *)stbi__malloc_mad3(req_comp, x, y, 0);
+    if (good == NULL)
+    {
+        STBI_FREE(data);
+        return stbi__errpuc("outofmem", "Out of memory");
+    }
+
+    for (j = 0; j < (int)y; ++j)
+    {
+        unsigned char *src = data + j * x * img_n;
+        unsigned char *dest = good + j * x * req_comp;
+
+#define STBI__COMBO(a, b) ((a)*8 + (b))
+#define STBI__CASE(a, b)    \
+    case STBI__COMBO(a, b): \
+        for (i = x - 1; i >= 0; --i, src += a, dest += b)
+        // convert source image with img_n components to one with req_comp components;
+        // avoid switch per pixel, so use switch per scanline and massive macros
+        switch (STBI__COMBO(img_n, req_comp))
+        {
+            STBI__CASE(1, 2)
+            {
+                dest[0] = src[0];
+                dest[1] = 255;
+            }
+            break;
+            STBI__CASE(1, 3) { dest[0] = dest[1] = dest[2] = src[0]; }
+            break;
+            STBI__CASE(1, 4)
+            {
+                dest[0] = dest[1] = dest[2] = src[0];
+                dest[3] = 255;
+            }
+            break;
+            STBI__CASE(2, 1) { dest[0] = src[0]; }
+            break;
+            STBI__CASE(2, 3) { dest[0] = dest[1] = dest[2] = src[0]; }
+            break;
+            STBI__CASE(2, 4)
+            {
+                dest[0] = dest[1] = dest[2] = src[0];
+                dest[3] = src[1];
+            }
+            break;
+            STBI__CASE(3, 4)
+            {
+                dest[0] = src[0];
+                dest[1] = src[1];
+                dest[2] = src[2];
+                dest[3] = 255;
+            }
+            break;
+            STBI__CASE(3, 1) { dest[0] = stbi__compute_y(src[0], src[1], src[2]); }
+            break;
+            STBI__CASE(3, 2)
+            {
+                dest[0] = stbi__compute_y(src[0], src[1], src[2]);
+                dest[1] = 255;
+            }
+            break;
+            STBI__CASE(4, 1) { dest[0] = stbi__compute_y(src[0], src[1], src[2]); }
+            break;
+            STBI__CASE(4, 2)
+            {
+                dest[0] = stbi__compute_y(src[0], src[1], src[2]);
+                dest[1] = src[3];
+            }
+            break;
+            STBI__CASE(4, 3)
+            {
+                dest[0] = src[0];
+                dest[1] = src[1];
+                dest[2] = src[2];
+            }
+            break;
+        default:
+            STBI_ASSERT(0);
+            STBI_FREE(data);
+            STBI_FREE(good);
+            return stbi__errpuc("unsupported", "Unsupported format conversion");
+        }
+#undef STBI__CASE
+    }
+
+    STBI_FREE(data);
+    return good;
+}
+#endif
+
+#if defined(STBI_NO_PNG) && defined(STBI_NO_PSD)
+// nothing
+#else
+static stbi__uint16 stbi__compute_y_16(int r, int g, int b)
+{
+    return (stbi__uint16)(((r * 77) + (g * 150) + (29 * b)) >> 8);
+}
+#endif
+
+#if defined(STBI_NO_PNG) && defined(STBI_NO_PSD)
+// nothing
+#else
+static stbi__uint16 *stbi__convert_format16(stbi__uint16 *data, int img_n, int req_comp, unsigned int x, unsigned int y)
+{
+    int i, j;
+    stbi__uint16 *good;
+
+    if (req_comp == img_n)
+        return data;
+    STBI_ASSERT(req_comp >= 1 && req_comp <= 4);
+
+    good = (stbi__uint16 *)stbi__malloc(req_comp * x * y * 2);
+    if (good == NULL)
+    {
+        STBI_FREE(data);
+        return (stbi__uint16 *)stbi__errpuc("outofmem", "Out of memory");
+    }
+
+    for (j = 0; j < (int)y; ++j)
+    {
+        stbi__uint16 *src = data + j * x * img_n;
+        stbi__uint16 *dest = good + j * x * req_comp;
+
+#define STBI__COMBO(a, b) ((a)*8 + (b))
+#define STBI__CASE(a, b)    \
+    case STBI__COMBO(a, b): \
+        for (i = x - 1; i >= 0; --i, src += a, dest += b)
+        // convert source image with img_n components to one with req_comp components;
+        // avoid switch per pixel, so use switch per scanline and massive macros
+        switch (STBI__COMBO(img_n, req_comp))
+        {
+            STBI__CASE(1, 2)
+            {
+                dest[0] = src[0];
+                dest[1] = 0xffff;
+            }
+            break;
+            STBI__CASE(1, 3) { dest[0] = dest[1] = dest[2] = src[0]; }
+            break;
+            STBI__CASE(1, 4)
+            {
+                dest[0] = dest[1] = dest[2] = src[0];
+                dest[3] = 0xffff;
+            }
+            break;
+            STBI__CASE(2, 1) { dest[0] = src[0]; }
+            break;
+            STBI__CASE(2, 3) { dest[0] = dest[1] = dest[2] = src[0]; }
+            break;
+            STBI__CASE(2, 4)
+            {
+                dest[0] = dest[1] = dest[2] = src[0];
+                dest[3] = src[1];
+            }
+            break;
+            STBI__CASE(3, 4)
+            {
+                dest[0] = src[0];
+                dest[1] = src[1];
+                dest[2] = src[2];
+                dest[3] = 0xffff;
+            }
+            break;
+            STBI__CASE(3, 1) { dest[0] = stbi__compute_y_16(src[0], src[1], src[2]); }
+            break;
+            STBI__CASE(3, 2)
+            {
+                dest[0] = stbi__compute_y_16(src[0], src[1], src[2]);
+                dest[1] = 0xffff;
+            }
+            break;
+            STBI__CASE(4, 1) { dest[0] = stbi__compute_y_16(src[0], src[1], src[2]); }
+            break;
+            STBI__CASE(4, 2)
+            {
+                dest[0] = stbi__compute_y_16(src[0], src[1], src[2]);
+                dest[1] = src[3];
+            }
+            break;
+            STBI__CASE(4, 3)
+            {
+                dest[0] = src[0];
+                dest[1] = src[1];
+                dest[2] = src[2];
+            }
+            break;
+        default:
+            STBI_ASSERT(0);
+            STBI_FREE(data);
+            STBI_FREE(good);
+            return (stbi__uint16 *)stbi__errpuc("unsupported", "Unsupported format conversion");
+        }
+#undef STBI__CASE
+    }
+
+    STBI_FREE(data);
+    return good;
+}
+#endif
+
+#ifndef STBI_NO_LINEAR
+static float *stbi__ldr_to_hdr(stbi_uc *data, int x, int y, int comp)
+{
+    int i, k, n;
+    float *output;
+    if (!data)
+        return NULL;
+    output = (float *)stbi__malloc_mad4(x, y, comp, sizeof(float), 0);
+    if (output == NULL)
+    {
+        STBI_FREE(data);
+        return stbi__errpf("outofmem", "Out of memory");
+    }
+    // compute number of non-alpha components
+    if (comp & 1)
+        n = comp;
+    else
+        n = comp - 1;
+    for (i = 0; i < x * y; ++i)
+    {
+        for (k = 0; k < n; ++k)
+        {
+            output[i * comp + k] = (float)(pow(data[i * comp + k] / 255.0f, stbi__l2h_gamma) * stbi__l2h_scale);
+        }
+    }
+    if (n < comp)
+    {
+        for (i = 0; i < x * y; ++i)
+        {
+            output[i * comp + n] = data[i * comp + n] / 255.0f;
+        }
+    }
+    STBI_FREE(data);
+    return output;
+}
+#endif
+
+#ifndef STBI_NO_HDR
+#define stbi__float2int(x) ((int)(x))
+static stbi_uc *stbi__hdr_to_ldr(float *data, int x, int y, int comp)
+{
+    int i, k, n;
+    stbi_uc *output;
+    if (!data)
+        return NULL;
+    output = (stbi_uc *)stbi__malloc_mad3(x, y, comp, 0);
+    if (output == NULL)
+    {
+        STBI_FREE(data);
+        return stbi__errpuc("outofmem", "Out of memory");
+    }
+    // compute number of non-alpha components
+    if (comp & 1)
+        n = comp;
+    else
+        n = comp - 1;
+    for (i = 0; i < x * y; ++i)
+    {
+        for (k = 0; k < n; ++k)
+        {
+            float z = (float)pow(data[i * comp + k] * stbi__h2l_scale_i, stbi__h2l_gamma_i) * 255 + 0.5f;
+            if (z < 0)
+                z = 0;
+            if (z > 255)
+                z = 255;
+            output[i * comp + k] = (stbi_uc)stbi__float2int(z);
+        }
+        if (k < comp)
+        {
+            float z = data[i * comp + k] * 255 + 0.5f;
+            if (z < 0)
+                z = 0;
+            if (z > 255)
+                z = 255;
+            output[i * comp + k] = (stbi_uc)stbi__float2int(z);
+        }
+    }
+    STBI_FREE(data);
+    return output;
+}
+#endif
+
+//////////////////////////////////////////////////////////////////////////////
+//
+//  "baseline" JPEG/JFIF decoder
+//
+//    simple implementation
+//      - doesn't support delayed output of y-dimension
+//      - simple interface (only one output format: 8-bit interleaved RGB)
+//      - doesn't try to recover corrupt jpegs
+//      - doesn't allow partial loading, loading multiple at once
+//      - still fast on x86 (copying globals into locals doesn't help x86)
+//      - allocates lots of intermediate memory (full size of all components)
+//        - non-interleaved case requires this anyway
+//        - allows good upsampling (see next)
+//    high-quality
+//      - upsampled channels are bilinearly interpolated, even across blocks
+//      - quality integer IDCT derived from IJG's 'slow'
+//    performance
+//      - fast huffman; reasonable integer IDCT
+//      - some SIMD kernels for common paths on targets with SSE2/NEON
+//      - uses a lot of intermediate memory, could cache poorly
+
+#ifndef STBI_NO_JPEG
+
+// huffman decoding acceleration
+#define FAST_BITS 9 // larger handles more cases; smaller stomps less cache
+
+typedef struct
+{
+    stbi_uc fast[1 << FAST_BITS];
+    // weirdly, repacking this into AoS is a 10% speed loss, instead of a win
+    stbi__uint16 code[256];
+    stbi_uc values[256];
+    stbi_uc size[257];
+    unsigned int maxcode[18];
+    int delta[17]; // old 'firstsymbol' - old 'firstcode'
+} stbi__huffman;
+
+typedef struct
+{
+    stbi__context *s;
+    stbi__huffman huff_dc[4];
+    stbi__huffman huff_ac[4];
+    stbi__uint16 dequant[4][64];
+    stbi__int16 fast_ac[4][1 << FAST_BITS];
+
+    // sizes for components, interleaved MCUs
+    int img_h_max, img_v_max;
+    int img_mcu_x, img_mcu_y;
+    int img_mcu_w, img_mcu_h;
+
+    // definition of jpeg image component
+    struct
+    {
+        int id;
+        int h, v;
+        int tq;
+        int hd, ha;
+        int dc_pred;
+
+        int x, y, w2, h2;
+        stbi_uc *data;
+        void *raw_data, *raw_coeff;
+        stbi_uc *linebuf;
+        short *coeff;         // progressive only
+        int coeff_w, coeff_h; // number of 8x8 coefficient blocks
+    } img_comp[4];
+
+    stbi__uint32 code_buffer; // jpeg entropy-coded buffer
+    int code_bits;            // number of valid bits
+    unsigned char marker;     // marker seen while filling entropy buffer
+    int nomore;               // flag if we saw a marker so must stop
+
+    int progressive;
+    int spec_start;
+    int spec_end;
+    int succ_high;
+    int succ_low;
+    int eob_run;
+    int jfif;
+    int app14_color_transform; // Adobe APP14 tag
+    int rgb;
+
+    int scan_n, order[4];
+    int restart_interval, todo;
+
+    // kernels
+    void (*idct_block_kernel)(stbi_uc *out, int out_stride, short data[64]);
+    void (*YCbCr_to_RGB_kernel)(stbi_uc *out, const stbi_uc *y, const stbi_uc *pcb, const stbi_uc *pcr, int count, int step);
+    stbi_uc *(*resample_row_hv_2_kernel)(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs);
+} stbi__jpeg;
+
+static int stbi__build_huffman(stbi__huffman *h, int *count)
+{
+    int i, j, k = 0;
+    unsigned int code;
+    // build size list for each symbol (from JPEG spec)
+    for (i = 0; i < 16; ++i)
+    {
+        for (j = 0; j < count[i]; ++j)
+        {
+            h->size[k++] = (stbi_uc)(i + 1);
+            if (k >= 257)
+                return stbi__err("bad size list", "Corrupt JPEG");
+        }
+    }
+    h->size[k] = 0;
+
+    // compute actual symbols (from jpeg spec)
+    code = 0;
+    k = 0;
+    for (j = 1; j <= 16; ++j)
+    {
+        // compute delta to add to code to compute symbol id
+        h->delta[j] = k - code;
+        if (h->size[k] == j)
+        {
+            while (h->size[k] == j)
+                h->code[k++] = (stbi__uint16)(code++);
+            if (code - 1 >= (1u << j))
+                return stbi__err("bad code lengths", "Corrupt JPEG");
+        }
+        // compute largest code + 1 for this size, preshifted as needed later
+        h->maxcode[j] = code << (16 - j);
+        code <<= 1;
+    }
+    h->maxcode[j] = 0xffffffff;
+
+    // build non-spec acceleration table; 255 is flag for not-accelerated
+    memset(h->fast, 255, 1 << FAST_BITS);
+    for (i = 0; i < k; ++i)
+    {
+        int s = h->size[i];
+        if (s <= FAST_BITS)
+        {
+            int c = h->code[i] << (FAST_BITS - s);
+            int m = 1 << (FAST_BITS - s);
+            for (j = 0; j < m; ++j)
+            {
+                h->fast[c + j] = (stbi_uc)i;
+            }
+        }
+    }
+    return 1;
+}
+
+// build a table that decodes both magnitude and value of small ACs in
+// one go.
+static void stbi__build_fast_ac(stbi__int16 *fast_ac, stbi__huffman *h)
+{
+    int i;
+    for (i = 0; i < (1 << FAST_BITS); ++i)
+    {
+        stbi_uc fast = h->fast[i];
+        fast_ac[i] = 0;
+        if (fast < 255)
+        {
+            int rs = h->values[fast];
+            int run = (rs >> 4) & 15;
+            int magbits = rs & 15;
+            int len = h->size[fast];
+
+            if (magbits && len + magbits <= FAST_BITS)
+            {
+                // magnitude code followed by receive_extend code
+                int k = ((i << len) & ((1 << FAST_BITS) - 1)) >> (FAST_BITS - magbits);
+                int m = 1 << (magbits - 1);
+                if (k < m)
+                    k += (~0U << magbits) + 1;
+                // if the result is small enough, we can fit it in fast_ac table
+                if (k >= -128 && k <= 127)
+                    fast_ac[i] = (stbi__int16)((k * 256) + (run * 16) + (len + magbits));
+            }
+        }
+    }
+}
+
+static void stbi__grow_buffer_unsafe(stbi__jpeg *j)
+{
+    do
+    {
+        unsigned int b = j->nomore ? 0 : stbi__get8(j->s);
+        if (b == 0xff)
+        {
+            int c = stbi__get8(j->s);
+            while (c == 0xff)
+                c = stbi__get8(j->s); // consume fill bytes
+            if (c != 0)
+            {
+                j->marker = (unsigned char)c;
+                j->nomore = 1;
+                return;
+            }
+        }
+        j->code_buffer |= b << (24 - j->code_bits);
+        j->code_bits += 8;
+    } while (j->code_bits <= 24);
+}
+
+// (1 << n) - 1
+static const stbi__uint32 stbi__bmask[17] = {0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535};
+
+// decode a jpeg huffman value from the bitstream
+stbi_inline static int stbi__jpeg_huff_decode(stbi__jpeg *j, stbi__huffman *h)
+{
+    unsigned int temp;
+    int c, k;
+
+    if (j->code_bits < 16)
+        stbi__grow_buffer_unsafe(j);
+
+    // look at the top FAST_BITS and determine what symbol ID it is,
+    // if the code is <= FAST_BITS
+    c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS) - 1);
+    k = h->fast[c];
+    if (k < 255)
+    {
+        int s = h->size[k];
+        if (s > j->code_bits)
+            return -1;
+        j->code_buffer <<= s;
+        j->code_bits -= s;
+        return h->values[k];
+    }
+
+    // naive test is to shift the code_buffer down so k bits are
+    // valid, then test against maxcode. To speed this up, we've
+    // preshifted maxcode left so that it has (16-k) 0s at the
+    // end; in other words, regardless of the number of bits, it
+    // wants to be compared against something shifted to have 16;
+    // that way we don't need to shift inside the loop.
+    temp = j->code_buffer >> 16;
+    for (k = FAST_BITS + 1;; ++k)
+        if (temp < h->maxcode[k])
+            break;
+    if (k == 17)
+    {
+        // error! code not found
+        j->code_bits -= 16;
+        return -1;
+    }
+
+    if (k > j->code_bits)
+        return -1;
+
+    // convert the huffman code to the symbol id
+    c = ((j->code_buffer >> (32 - k)) & stbi__bmask[k]) + h->delta[k];
+    if (c < 0 || c >= 256) // symbol id out of bounds!
+        return -1;
+    STBI_ASSERT((((j->code_buffer) >> (32 - h->size[c])) & stbi__bmask[h->size[c]]) == h->code[c]);
+
+    // convert the id to a symbol
+    j->code_bits -= k;
+    j->code_buffer <<= k;
+    return h->values[c];
+}
+
+// bias[n] = (-1<<n) + 1
+static const int stbi__jbias[16] = {0, -1, -3, -7, -15, -31, -63, -127, -255, -511, -1023, -2047, -4095, -8191, -16383, -32767};
+
+// combined JPEG 'receive' and JPEG 'extend', since baseline
+// always extends everything it receives.
+stbi_inline static int stbi__extend_receive(stbi__jpeg *j, int n)
+{
+    unsigned int k;
+    int sgn;
+    if (j->code_bits < n)
+        stbi__grow_buffer_unsafe(j);
+    if (j->code_bits < n)
+        return 0; // ran out of bits from stream, return 0s intead of continuing
+
+    sgn = j->code_buffer >> 31; // sign bit always in MSB; 0 if MSB clear (positive), 1 if MSB set (negative)
+    k = stbi_lrot(j->code_buffer, n);
+    j->code_buffer = k & ~stbi__bmask[n];
+    k &= stbi__bmask[n];
+    j->code_bits -= n;
+    return k + (stbi__jbias[n] & (sgn - 1));
+}
+
+// get some unsigned bits
+stbi_inline static int stbi__jpeg_get_bits(stbi__jpeg *j, int n)
+{
+    unsigned int k;
+    if (j->code_bits < n)
+        stbi__grow_buffer_unsafe(j);
+    if (j->code_bits < n)
+        return 0; // ran out of bits from stream, return 0s intead of continuing
+    k = stbi_lrot(j->code_buffer, n);
+    j->code_buffer = k & ~stbi__bmask[n];
+    k &= stbi__bmask[n];
+    j->code_bits -= n;
+    return k;
+}
+
+stbi_inline static int stbi__jpeg_get_bit(stbi__jpeg *j)
+{
+    unsigned int k;
+    if (j->code_bits < 1)
+        stbi__grow_buffer_unsafe(j);
+    if (j->code_bits < 1)
+        return 0; // ran out of bits from stream, return 0s intead of continuing
+    k = j->code_buffer;
+    j->code_buffer <<= 1;
+    --j->code_bits;
+    return k & 0x80000000;
+}
+
+// given a value that's at position X in the zigzag stream,
+// where does it appear in the 8x8 matrix coded as row-major?
+static const stbi_uc stbi__jpeg_dezigzag[64 + 15] =
+    {
+        0, 1, 8, 16, 9, 2, 3, 10,
+        17, 24, 32, 25, 18, 11, 4, 5,
+        12, 19, 26, 33, 40, 48, 41, 34,
+        27, 20, 13, 6, 7, 14, 21, 28,
+        35, 42, 49, 56, 57, 50, 43, 36,
+        29, 22, 15, 23, 30, 37, 44, 51,
+        58, 59, 52, 45, 38, 31, 39, 46,
+        53, 60, 61, 54, 47, 55, 62, 63,
+        // let corrupt input sample past end
+        63, 63, 63, 63, 63, 63, 63, 63,
+        63, 63, 63, 63, 63, 63, 63};
+
+// decode one 64-entry block--
+static int stbi__jpeg_decode_block(stbi__jpeg *j, short data[64], stbi__huffman *hdc, stbi__huffman *hac, stbi__int16 *fac, int b, stbi__uint16 *dequant)
+{
+    int diff, dc, k;
+    int t;
+
+    if (j->code_bits < 16)
+        stbi__grow_buffer_unsafe(j);
+    t = stbi__jpeg_huff_decode(j, hdc);
+    if (t < 0 || t > 15)
+        return stbi__err("bad huffman code", "Corrupt JPEG");
+
+    // 0 all the ac values now so we can do it 32-bits at a time
+    memset(data, 0, 64 * sizeof(data[0]));
+
+    diff = t ? stbi__extend_receive(j, t) : 0;
+    if (!stbi__addints_valid(j->img_comp[b].dc_pred, diff))
+        return stbi__err("bad delta", "Corrupt JPEG");
+    dc = j->img_comp[b].dc_pred + diff;
+    j->img_comp[b].dc_pred = dc;
+    if (!stbi__mul2shorts_valid(dc, dequant[0]))
+        return stbi__err("can't merge dc and ac", "Corrupt JPEG");
+    data[0] = (short)(dc * dequant[0]);
+
+    // decode AC components, see JPEG spec
+    k = 1;
+    do
+    {
+        unsigned int zig;
+        int c, r, s;
+        if (j->code_bits < 16)
+            stbi__grow_buffer_unsafe(j);
+        c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS) - 1);
+        r = fac[c];
+        if (r)
+        {                       // fast-AC path
+            k += (r >> 4) & 15; // run
+            s = r & 15;         // combined length
+            if (s > j->code_bits)
+                return stbi__err("bad huffman code", "Combined length longer than code bits available");
+            j->code_buffer <<= s;
+            j->code_bits -= s;
+            // decode into unzigzag'd location
+            zig = stbi__jpeg_dezigzag[k++];
+            data[zig] = (short)((r >> 8) * dequant[zig]);
+        }
+        else
+        {
+            int rs = stbi__jpeg_huff_decode(j, hac);
+            if (rs < 0)
+                return stbi__err("bad huffman code", "Corrupt JPEG");
+            s = rs & 15;
+            r = rs >> 4;
+            if (s == 0)
+            {
+                if (rs != 0xf0)
+                    break; // end block
+                k += 16;
+            }
+            else
+            {
+                k += r;
+                // decode into unzigzag'd location
+                zig = stbi__jpeg_dezigzag[k++];
+                data[zig] = (short)(stbi__extend_receive(j, s) * dequant[zig]);
+            }
+        }
+    } while (k < 64);
+    return 1;
+}
+
+static int stbi__jpeg_decode_block_prog_dc(stbi__jpeg *j, short data[64], stbi__huffman *hdc, int b)
+{
+    int diff, dc;
+    int t;
+    if (j->spec_end != 0)
+        return stbi__err("can't merge dc and ac", "Corrupt JPEG");
+
+    if (j->code_bits < 16)
+        stbi__grow_buffer_unsafe(j);
+
+    if (j->succ_high == 0)
+    {
+        // first scan for DC coefficient, must be first
+        memset(data, 0, 64 * sizeof(data[0])); // 0 all the ac values now
+        t = stbi__jpeg_huff_decode(j, hdc);
+        if (t < 0 || t > 15)
+            return stbi__err("can't merge dc and ac", "Corrupt JPEG");
+        diff = t ? stbi__extend_receive(j, t) : 0;
+
+        if (!stbi__addints_valid(j->img_comp[b].dc_pred, diff))
+            return stbi__err("bad delta", "Corrupt JPEG");
+        dc = j->img_comp[b].dc_pred + diff;
+        j->img_comp[b].dc_pred = dc;
+        if (!stbi__mul2shorts_valid(dc, 1 << j->succ_low))
+            return stbi__err("can't merge dc and ac", "Corrupt JPEG");
+        data[0] = (short)(dc * (1 << j->succ_low));
+    }
+    else
+    {
+        // refinement scan for DC coefficient
+        if (stbi__jpeg_get_bit(j))
+            data[0] += (short)(1 << j->succ_low);
+    }
+    return 1;
+}
+
+// @OPTIMIZE: store non-zigzagged during the decode passes,
+// and only de-zigzag when dequantizing
+static int stbi__jpeg_decode_block_prog_ac(stbi__jpeg *j, short data[64], stbi__huffman *hac, stbi__int16 *fac)
+{
+    int k;
+    if (j->spec_start == 0)
+        return stbi__err("can't merge dc and ac", "Corrupt JPEG");
+
+    if (j->succ_high == 0)
+    {
+        int shift = j->succ_low;
+
+        if (j->eob_run)
+        {
+            --j->eob_run;
+            return 1;
+        }
+
+        k = j->spec_start;
+        do
+        {
+            unsigned int zig;
+            int c, r, s;
+            if (j->code_bits < 16)
+                stbi__grow_buffer_unsafe(j);
+            c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS) - 1);
+            r = fac[c];
+            if (r)
+            {                       // fast-AC path
+                k += (r >> 4) & 15; // run
+                s = r & 15;         // combined length
+                if (s > j->code_bits)
+                    return stbi__err("bad huffman code", "Combined length longer than code bits available");
+                j->code_buffer <<= s;
+                j->code_bits -= s;
+                zig = stbi__jpeg_dezigzag[k++];
+                data[zig] = (short)((r >> 8) * (1 << shift));
+            }
+            else
+            {
+                int rs = stbi__jpeg_huff_decode(j, hac);
+                if (rs < 0)
+                    return stbi__err("bad huffman code", "Corrupt JPEG");
+                s = rs & 15;
+                r = rs >> 4;
+                if (s == 0)
+                {
+                    if (r < 15)
+                    {
+                        j->eob_run = (1 << r);
+                        if (r)
+                            j->eob_run += stbi__jpeg_get_bits(j, r);
+                        --j->eob_run;
+                        break;
+                    }
+                    k += 16;
+                }
+                else
+                {
+                    k += r;
+                    zig = stbi__jpeg_dezigzag[k++];
+                    data[zig] = (short)(stbi__extend_receive(j, s) * (1 << shift));
+                }
+            }
+        } while (k <= j->spec_end);
+    }
+    else
+    {
+        // refinement scan for these AC coefficients
+
+        short bit = (short)(1 << j->succ_low);
+
+        if (j->eob_run)
+        {
+            --j->eob_run;
+            for (k = j->spec_start; k <= j->spec_end; ++k)
+            {
+                short *p = &data[stbi__jpeg_dezigzag[k]];
+                if (*p != 0)
+                    if (stbi__jpeg_get_bit(j))
+                        if ((*p & bit) == 0)
+                        {
+                            if (*p > 0)
+                                *p += bit;
+                            else
+                                *p -= bit;
+                        }
+            }
+        }
+        else
+        {
+            k = j->spec_start;
+            do
+            {
+                int r, s;
+                int rs = stbi__jpeg_huff_decode(j, hac); // @OPTIMIZE see if we can use the fast path here, advance-by-r is so slow, eh
+                if (rs < 0)
+                    return stbi__err("bad huffman code", "Corrupt JPEG");
+                s = rs & 15;
+                r = rs >> 4;
+                if (s == 0)
+                {
+                    if (r < 15)
+                    {
+                        j->eob_run = (1 << r) - 1;
+                        if (r)
+                            j->eob_run += stbi__jpeg_get_bits(j, r);
+                        r = 64; // force end of block
+                    }
+                    else
+                    {
+                        // r=15 s=0 should write 16 0s, so we just do
+                        // a run of 15 0s and then write s (which is 0),
+                        // so we don't have to do anything special here
+                    }
+                }
+                else
+                {
+                    if (s != 1)
+                        return stbi__err("bad huffman code", "Corrupt JPEG");
+                    // sign bit
+                    if (stbi__jpeg_get_bit(j))
+                        s = bit;
+                    else
+                        s = -bit;
+                }
+
+                // advance by r
+                while (k <= j->spec_end)
+                {
+                    short *p = &data[stbi__jpeg_dezigzag[k++]];
+                    if (*p != 0)
+                    {
+                        if (stbi__jpeg_get_bit(j))
+                            if ((*p & bit) == 0)
+                            {
+                                if (*p > 0)
+                                    *p += bit;
+                                else
+                                    *p -= bit;
+                            }
+                    }
+                    else
+                    {
+                        if (r == 0)
+                        {
+                            *p = (short)s;
+                            break;
+                        }
+                        --r;
+                    }
+                }
+            } while (k <= j->spec_end);
+        }
+    }
+    return 1;
+}
+
+// take a -128..127 value and stbi__clamp it and convert to 0..255
+stbi_inline static stbi_uc stbi__clamp(int x)
+{
+    // trick to use a single test to catch both cases
+    if ((unsigned int)x > 255)
+    {
+        if (x < 0)
+            return 0;
+        if (x > 255)
+            return 255;
+    }
+    return (stbi_uc)x;
+}
+
+#define stbi__f2f(x) ((int)(((x)*4096 + 0.5)))
+#define stbi__fsh(x) ((x)*4096)
+
+// derived from jidctint -- DCT_ISLOW
+#define STBI__IDCT_1D(s0, s1, s2, s3, s4, s5, s6, s7)       \
+    int t0, t1, t2, t3, p1, p2, p3, p4, p5, x0, x1, x2, x3; \
+    p2 = s2;                                                \
+    p3 = s6;                                                \
+    p1 = (p2 + p3) * stbi__f2f(0.5411961f);                 \
+    t2 = p1 + p3 * stbi__f2f(-1.847759065f);                \
+    t3 = p1 + p2 * stbi__f2f(0.765366865f);                 \
+    p2 = s0;                                                \
+    p3 = s4;                                                \
+    t0 = stbi__fsh(p2 + p3);                                \
+    t1 = stbi__fsh(p2 - p3);                                \
+    x0 = t0 + t3;                                           \
+    x3 = t0 - t3;                                           \
+    x1 = t1 + t2;                                           \
+    x2 = t1 - t2;                                           \
+    t0 = s7;                                                \
+    t1 = s5;                                                \
+    t2 = s3;                                                \
+    t3 = s1;                                                \
+    p3 = t0 + t2;                                           \
+    p4 = t1 + t3;                                           \
+    p1 = t0 + t3;                                           \
+    p2 = t1 + t2;                                           \
+    p5 = (p3 + p4) * stbi__f2f(1.175875602f);               \
+    t0 = t0 * stbi__f2f(0.298631336f);                      \
+    t1 = t1 * stbi__f2f(2.053119869f);                      \
+    t2 = t2 * stbi__f2f(3.072711026f);                      \
+    t3 = t3 * stbi__f2f(1.501321110f);                      \
+    p1 = p5 + p1 * stbi__f2f(-0.899976223f);                \
+    p2 = p5 + p2 * stbi__f2f(-2.562915447f);                \
+    p3 = p3 * stbi__f2f(-1.961570560f);                     \
+    p4 = p4 * stbi__f2f(-0.390180644f);                     \
+    t3 += p1 + p4;                                          \
+    t2 += p2 + p3;                                          \
+    t1 += p2 + p4;                                          \
+    t0 += p1 + p3;
+
+static void stbi__idct_block(stbi_uc *out, int out_stride, short data[64])
+{
+    int i, val[64], *v = val;
+    stbi_uc *o;
+    short *d = data;
+
+    // columns
+    for (i = 0; i < 8; ++i, ++d, ++v)
+    {
+        // if all zeroes, shortcut -- this avoids dequantizing 0s and IDCTing
+        if (d[8] == 0 && d[16] == 0 && d[24] == 0 && d[32] == 0 && d[40] == 0 && d[48] == 0 && d[56] == 0)
+        {
+            //    no shortcut                 0     seconds
+            //    (1|2|3|4|5|6|7)==0          0     seconds
+            //    all separate               -0.047 seconds
+            //    1 && 2|3 && 4|5 && 6|7:    -0.047 seconds
+            int dcterm = d[0] * 4;
+            v[0] = v[8] = v[16] = v[24] = v[32] = v[40] = v[48] = v[56] = dcterm;
+        }
+        else
+        {
+            STBI__IDCT_1D(d[0], d[8], d[16], d[24], d[32], d[40], d[48], d[56])
+            // constants scaled things up by 1<<12; let's bring them back
+            // down, but keep 2 extra bits of precision
+            x0 += 512;
+            x1 += 512;
+            x2 += 512;
+            x3 += 512;
+            v[0] = (x0 + t3) >> 10;
+            v[56] = (x0 - t3) >> 10;
+            v[8] = (x1 + t2) >> 10;
+            v[48] = (x1 - t2) >> 10;
+            v[16] = (x2 + t1) >> 10;
+            v[40] = (x2 - t1) >> 10;
+            v[24] = (x3 + t0) >> 10;
+            v[32] = (x3 - t0) >> 10;
+        }
+    }
+
+    for (i = 0, v = val, o = out; i < 8; ++i, v += 8, o += out_stride)
+    {
+        // no fast case since the first 1D IDCT spread components out
+        STBI__IDCT_1D(v[0], v[1], v[2], v[3], v[4], v[5], v[6], v[7])
+        // constants scaled things up by 1<<12, plus we had 1<<2 from first
+        // loop, plus horizontal and vertical each scale by sqrt(8) so together
+        // we've got an extra 1<<3, so 1<<17 total we need to remove.
+        // so we want to round that, which means adding 0.5 * 1<<17,
+        // aka 65536. Also, we'll end up with -128 to 127 that we want
+        // to encode as 0..255 by adding 128, so we'll add that before the shift
+        x0 += 65536 + (128 << 17);
+        x1 += 65536 + (128 << 17);
+        x2 += 65536 + (128 << 17);
+        x3 += 65536 + (128 << 17);
+        // tried computing the shifts into temps, or'ing the temps to see
+        // if any were out of range, but that was slower
+        o[0] = stbi__clamp((x0 + t3) >> 17);
+        o[7] = stbi__clamp((x0 - t3) >> 17);
+        o[1] = stbi__clamp((x1 + t2) >> 17);
+        o[6] = stbi__clamp((x1 - t2) >> 17);
+        o[2] = stbi__clamp((x2 + t1) >> 17);
+        o[5] = stbi__clamp((x2 - t1) >> 17);
+        o[3] = stbi__clamp((x3 + t0) >> 17);
+        o[4] = stbi__clamp((x3 - t0) >> 17);
+    }
+}
+
+#ifdef STBI_SSE2
+// sse2 integer IDCT. not the fastest possible implementation but it
+// produces bit-identical results to the generic C version so it's
+// fully "transparent".
+static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64])
+{
+    // This is constructed to match our regular (generic) integer IDCT exactly.
+    __m128i row0, row1, row2, row3, row4, row5, row6, row7;
+    __m128i tmp;
+
+// dot product constant: even elems=x, odd elems=y
+#define dct_const(x, y) _mm_setr_epi16((x), (y), (x), (y), (x), (y), (x), (y))
+
+// out(0) = c0[even]*x + c0[odd]*y   (c0, x, y 16-bit, out 32-bit)
+// out(1) = c1[even]*x + c1[odd]*y
+#define dct_rot(out0, out1, x, y, c0, c1)          \
+    __m128i c0##lo = _mm_unpacklo_epi16((x), (y)); \
+    __m128i c0##hi = _mm_unpackhi_epi16((x), (y)); \
+    __m128i out0##_l = _mm_madd_epi16(c0##lo, c0); \
+    __m128i out0##_h = _mm_madd_epi16(c0##hi, c0); \
+    __m128i out1##_l = _mm_madd_epi16(c0##lo, c1); \
+    __m128i out1##_h = _mm_madd_epi16(c0##hi, c1)
+
+// out = in << 12  (in 16-bit, out 32-bit)
+#define dct_widen(out, in)                                                              \
+    __m128i out##_l = _mm_srai_epi32(_mm_unpacklo_epi16(_mm_setzero_si128(), (in)), 4); \
+    __m128i out##_h = _mm_srai_epi32(_mm_unpackhi_epi16(_mm_setzero_si128(), (in)), 4)
+
+// wide add
+#define dct_wadd(out, a, b)                        \
+    __m128i out##_l = _mm_add_epi32(a##_l, b##_l); \
+    __m128i out##_h = _mm_add_epi32(a##_h, b##_h)
+
+// wide sub
+#define dct_wsub(out, a, b)                        \
+    __m128i out##_l = _mm_sub_epi32(a##_l, b##_l); \
+    __m128i out##_h = _mm_sub_epi32(a##_h, b##_h)
+
+// butterfly a/b, add bias, then shift by "s" and pack
+#define dct_bfly32o(out0, out1, a, b, bias, s)                                      \
+    {                                                                               \
+        __m128i abiased_l = _mm_add_epi32(a##_l, bias);                             \
+        __m128i abiased_h = _mm_add_epi32(a##_h, bias);                             \
+        dct_wadd(sum, abiased, b);                                                  \
+        dct_wsub(dif, abiased, b);                                                  \
+        out0 = _mm_packs_epi32(_mm_srai_epi32(sum_l, s), _mm_srai_epi32(sum_h, s)); \
+        out1 = _mm_packs_epi32(_mm_srai_epi32(dif_l, s), _mm_srai_epi32(dif_h, s)); \
+    }
+
+// 8-bit interleave step (for transposes)
+#define dct_interleave8(a, b)    \
+    tmp = a;                     \
+    a = _mm_unpacklo_epi8(a, b); \
+    b = _mm_unpackhi_epi8(tmp, b)
+
+// 16-bit interleave step (for transposes)
+#define dct_interleave16(a, b)    \
+    tmp = a;                      \
+    a = _mm_unpacklo_epi16(a, b); \
+    b = _mm_unpackhi_epi16(tmp, b)
+
+#define dct_pass(bias, shift)                            \
+    {                                                    \
+        /* even part */                                  \
+        dct_rot(t2e, t3e, row2, row6, rot0_0, rot0_1);   \
+        __m128i sum04 = _mm_add_epi16(row0, row4);       \
+        __m128i dif04 = _mm_sub_epi16(row0, row4);       \
+        dct_widen(t0e, sum04);                           \
+        dct_widen(t1e, dif04);                           \
+        dct_wadd(x0, t0e, t3e);                          \
+        dct_wsub(x3, t0e, t3e);                          \
+        dct_wadd(x1, t1e, t2e);                          \
+        dct_wsub(x2, t1e, t2e);                          \
+        /* odd part */                                   \
+        dct_rot(y0o, y2o, row7, row3, rot2_0, rot2_1);   \
+        dct_rot(y1o, y3o, row5, row1, rot3_0, rot3_1);   \
+        __m128i sum17 = _mm_add_epi16(row1, row7);       \
+        __m128i sum35 = _mm_add_epi16(row3, row5);       \
+        dct_rot(y4o, y5o, sum17, sum35, rot1_0, rot1_1); \
+        dct_wadd(x4, y0o, y4o);                          \
+        dct_wadd(x5, y1o, y5o);                          \
+        dct_wadd(x6, y2o, y5o);                          \
+        dct_wadd(x7, y3o, y4o);                          \
+        dct_bfly32o(row0, row7, x0, x7, bias, shift);    \
+        dct_bfly32o(row1, row6, x1, x6, bias, shift);    \
+        dct_bfly32o(row2, row5, x2, x5, bias, shift);    \
+        dct_bfly32o(row3, row4, x3, x4, bias, shift);    \
+    }
+
+    __m128i rot0_0 = dct_const(stbi__f2f(0.5411961f), stbi__f2f(0.5411961f) + stbi__f2f(-1.847759065f));
+    __m128i rot0_1 = dct_const(stbi__f2f(0.5411961f) + stbi__f2f(0.765366865f), stbi__f2f(0.5411961f));
+    __m128i rot1_0 = dct_const(stbi__f2f(1.175875602f) + stbi__f2f(-0.899976223f), stbi__f2f(1.175875602f));
+    __m128i rot1_1 = dct_const(stbi__f2f(1.175875602f), stbi__f2f(1.175875602f) + stbi__f2f(-2.562915447f));
+    __m128i rot2_0 = dct_const(stbi__f2f(-1.961570560f) + stbi__f2f(0.298631336f), stbi__f2f(-1.961570560f));
+    __m128i rot2_1 = dct_const(stbi__f2f(-1.961570560f), stbi__f2f(-1.961570560f) + stbi__f2f(3.072711026f));
+    __m128i rot3_0 = dct_const(stbi__f2f(-0.390180644f) + stbi__f2f(2.053119869f), stbi__f2f(-0.390180644f));
+    __m128i rot3_1 = dct_const(stbi__f2f(-0.390180644f), stbi__f2f(-0.390180644f) + stbi__f2f(1.501321110f));
+
+    // rounding biases in column/row passes, see stbi__idct_block for explanation.
+    __m128i bias_0 = _mm_set1_epi32(512);
+    __m128i bias_1 = _mm_set1_epi32(65536 + (128 << 17));
+
+    // load
+    row0 = _mm_load_si128((const __m128i *)(data + 0 * 8));
+    row1 = _mm_load_si128((const __m128i *)(data + 1 * 8));
+    row2 = _mm_load_si128((const __m128i *)(data + 2 * 8));
+    row3 = _mm_load_si128((const __m128i *)(data + 3 * 8));
+    row4 = _mm_load_si128((const __m128i *)(data + 4 * 8));
+    row5 = _mm_load_si128((const __m128i *)(data + 5 * 8));
+    row6 = _mm_load_si128((const __m128i *)(data + 6 * 8));
+    row7 = _mm_load_si128((const __m128i *)(data + 7 * 8));
+
+    // column pass
+    dct_pass(bias_0, 10);
+
+    {
+        // 16bit 8x8 transpose pass 1
+        dct_interleave16(row0, row4);
+        dct_interleave16(row1, row5);
+        dct_interleave16(row2, row6);
+        dct_interleave16(row3, row7);
+
+        // transpose pass 2
+        dct_interleave16(row0, row2);
+        dct_interleave16(row1, row3);
+        dct_interleave16(row4, row6);
+        dct_interleave16(row5, row7);
+
+        // transpose pass 3
+        dct_interleave16(row0, row1);
+        dct_interleave16(row2, row3);
+        dct_interleave16(row4, row5);
+        dct_interleave16(row6, row7);
+    }
+
+    // row pass
+    dct_pass(bias_1, 17);
+
+    {
+        // pack
+        __m128i p0 = _mm_packus_epi16(row0, row1); // a0a1a2a3...a7b0b1b2b3...b7
+        __m128i p1 = _mm_packus_epi16(row2, row3);
+        __m128i p2 = _mm_packus_epi16(row4, row5);
+        __m128i p3 = _mm_packus_epi16(row6, row7);
+
+        // 8bit 8x8 transpose pass 1
+        dct_interleave8(p0, p2); // a0e0a1e1...
+        dct_interleave8(p1, p3); // c0g0c1g1...
+
+        // transpose pass 2
+        dct_interleave8(p0, p1); // a0c0e0g0...
+        dct_interleave8(p2, p3); // b0d0f0h0...
+
+        // transpose pass 3
+        dct_interleave8(p0, p2); // a0b0c0d0...
+        dct_interleave8(p1, p3); // a4b4c4d4...
+
+        // store
+        _mm_storel_epi64((__m128i *)out, p0);
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, _mm_shuffle_epi32(p0, 0x4e));
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, p2);
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, _mm_shuffle_epi32(p2, 0x4e));
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, p1);
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, _mm_shuffle_epi32(p1, 0x4e));
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, p3);
+        out += out_stride;
+        _mm_storel_epi64((__m128i *)out, _mm_shuffle_epi32(p3, 0x4e));
+    }
+
+#undef dct_const
+#undef dct_rot
+#undef dct_widen
+#undef dct_wadd
+#undef dct_wsub
+#undef dct_bfly32o
+#undef dct_interleave8
+#undef dct_interleave16
+#undef dct_pass
+}
+
+#endif // STBI_SSE2
+
+#ifdef STBI_NEON
+
+// NEON integer IDCT. should produce bit-identical
+// results to the generic C version.
+static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64])
+{
+    int16x8_t row0, row1, row2, row3, row4, row5, row6, row7;
+
+    int16x4_t rot0_0 = vdup_n_s16(stbi__f2f(0.5411961f));
+    int16x4_t rot0_1 = vdup_n_s16(stbi__f2f(-1.847759065f));
+    int16x4_t rot0_2 = vdup_n_s16(stbi__f2f(0.765366865f));
+    int16x4_t rot1_0 = vdup_n_s16(stbi__f2f(1.175875602f));
+    int16x4_t rot1_1 = vdup_n_s16(stbi__f2f(-0.899976223f));
+    int16x4_t rot1_2 = vdup_n_s16(stbi__f2f(-2.562915447f));
+    int16x4_t rot2_0 = vdup_n_s16(stbi__f2f(-1.961570560f));
+    int16x4_t rot2_1 = vdup_n_s16(stbi__f2f(-0.390180644f));
+    int16x4_t rot3_0 = vdup_n_s16(stbi__f2f(0.298631336f));
+    int16x4_t rot3_1 = vdup_n_s16(stbi__f2f(2.053119869f));
+    int16x4_t rot3_2 = vdup_n_s16(stbi__f2f(3.072711026f));
+    int16x4_t rot3_3 = vdup_n_s16(stbi__f2f(1.501321110f));
+
+#define dct_long_mul(out, inq, coeff)                        \
+    int32x4_t out##_l = vmull_s16(vget_low_s16(inq), coeff); \
+    int32x4_t out##_h = vmull_s16(vget_high_s16(inq), coeff)
+
+#define dct_long_mac(out, acc, inq, coeff)                            \
+    int32x4_t out##_l = vmlal_s16(acc##_l, vget_low_s16(inq), coeff); \
+    int32x4_t out##_h = vmlal_s16(acc##_h, vget_high_s16(inq), coeff)
+
+#define dct_widen(out, inq)                                 \
+    int32x4_t out##_l = vshll_n_s16(vget_low_s16(inq), 12); \
+    int32x4_t out##_h = vshll_n_s16(vget_high_s16(inq), 12)
+
+// wide add
+#define dct_wadd(out, a, b)                      \
+    int32x4_t out##_l = vaddq_s32(a##_l, b##_l); \
+    int32x4_t out##_h = vaddq_s32(a##_h, b##_h)
+
+// wide sub
+#define dct_wsub(out, a, b)                      \
+    int32x4_t out##_l = vsubq_s32(a##_l, b##_l); \
+    int32x4_t out##_h = vsubq_s32(a##_h, b##_h)
+
+// butterfly a/b, then shift using "shiftop" by "s" and pack
+#define dct_bfly32o(out0, out1, a, b, shiftop, s)                  \
+    {                                                              \
+        dct_wadd(sum, a, b);                                       \
+        dct_wsub(dif, a, b);                                       \
+        out0 = vcombine_s16(shiftop(sum_l, s), shiftop(sum_h, s)); \
+        out1 = vcombine_s16(shiftop(dif_l, s), shiftop(dif_h, s)); \
+    }
+
+#define dct_pass(shiftop, shift)                         \
+    {                                                    \
+        /* even part */                                  \
+        int16x8_t sum26 = vaddq_s16(row2, row6);         \
+        dct_long_mul(p1e, sum26, rot0_0);                \
+        dct_long_mac(t2e, p1e, row6, rot0_1);            \
+        dct_long_mac(t3e, p1e, row2, rot0_2);            \
+        int16x8_t sum04 = vaddq_s16(row0, row4);         \
+        int16x8_t dif04 = vsubq_s16(row0, row4);         \
+        dct_widen(t0e, sum04);                           \
+        dct_widen(t1e, dif04);                           \
+        dct_wadd(x0, t0e, t3e);                          \
+        dct_wsub(x3, t0e, t3e);                          \
+        dct_wadd(x1, t1e, t2e);                          \
+        dct_wsub(x2, t1e, t2e);                          \
+        /* odd part */                                   \
+        int16x8_t sum15 = vaddq_s16(row1, row5);         \
+        int16x8_t sum17 = vaddq_s16(row1, row7);         \
+        int16x8_t sum35 = vaddq_s16(row3, row5);         \
+        int16x8_t sum37 = vaddq_s16(row3, row7);         \
+        int16x8_t sumodd = vaddq_s16(sum17, sum35);      \
+        dct_long_mul(p5o, sumodd, rot1_0);               \
+        dct_long_mac(p1o, p5o, sum17, rot1_1);           \
+        dct_long_mac(p2o, p5o, sum35, rot1_2);           \
+        dct_long_mul(p3o, sum37, rot2_0);                \
+        dct_long_mul(p4o, sum15, rot2_1);                \
+        dct_wadd(sump13o, p1o, p3o);                     \
+        dct_wadd(sump24o, p2o, p4o);                     \
+        dct_wadd(sump23o, p2o, p3o);                     \
+        dct_wadd(sump14o, p1o, p4o);                     \
+        dct_long_mac(x4, sump13o, row7, rot3_0);         \
+        dct_long_mac(x5, sump24o, row5, rot3_1);         \
+        dct_long_mac(x6, sump23o, row3, rot3_2);         \
+        dct_long_mac(x7, sump14o, row1, rot3_3);         \
+        dct_bfly32o(row0, row7, x0, x7, shiftop, shift); \
+        dct_bfly32o(row1, row6, x1, x6, shiftop, shift); \
+        dct_bfly32o(row2, row5, x2, x5, shiftop, shift); \
+        dct_bfly32o(row3, row4, x3, x4, shiftop, shift); \
+    }
+
+    // load
+    row0 = vld1q_s16(data + 0 * 8);
+    row1 = vld1q_s16(data + 1 * 8);
+    row2 = vld1q_s16(data + 2 * 8);
+    row3 = vld1q_s16(data + 3 * 8);
+    row4 = vld1q_s16(data + 4 * 8);
+    row5 = vld1q_s16(data + 5 * 8);
+    row6 = vld1q_s16(data + 6 * 8);
+    row7 = vld1q_s16(data + 7 * 8);
+
+    // add DC bias
+    row0 = vaddq_s16(row0, vsetq_lane_s16(1024, vdupq_n_s16(0), 0));
+
+    // column pass
+    dct_pass(vrshrn_n_s32, 10);
+
+    // 16bit 8x8 transpose
+    {
+// these three map to a single VTRN.16, VTRN.32, and VSWP, respectively.
+// whether compilers actually get this is another story, sadly.
+#define dct_trn16(x, y)                  \
+    {                                    \
+        int16x8x2_t t = vtrnq_s16(x, y); \
+        x = t.val[0];                    \
+        y = t.val[1];                    \
+    }
+#define dct_trn32(x, y)                                                                \
+    {                                                                                  \
+        int32x4x2_t t = vtrnq_s32(vreinterpretq_s32_s16(x), vreinterpretq_s32_s16(y)); \
+        x = vreinterpretq_s16_s32(t.val[0]);                                           \
+        y = vreinterpretq_s16_s32(t.val[1]);                                           \
+    }
+#define dct_trn64(x, y)                                         \
+    {                                                           \
+        int16x8_t x0 = x;                                       \
+        int16x8_t y0 = y;                                       \
+        x = vcombine_s16(vget_low_s16(x0), vget_low_s16(y0));   \
+        y = vcombine_s16(vget_high_s16(x0), vget_high_s16(y0)); \
+    }
+
+        // pass 1
+        dct_trn16(row0, row1); // a0b0a2b2a4b4a6b6
+        dct_trn16(row2, row3);
+        dct_trn16(row4, row5);
+        dct_trn16(row6, row7);
+
+        // pass 2
+        dct_trn32(row0, row2); // a0b0c0d0a4b4c4d4
+        dct_trn32(row1, row3);
+        dct_trn32(row4, row6);
+        dct_trn32(row5, row7);
+
+        // pass 3
+        dct_trn64(row0, row4); // a0b0c0d0e0f0g0h0
+        dct_trn64(row1, row5);
+        dct_trn64(row2, row6);
+        dct_trn64(row3, row7);
+
+#undef dct_trn16
+#undef dct_trn32
+#undef dct_trn64
+    }
+
+    // row pass
+    // vrshrn_n_s32 only supports shifts up to 16, we need
+    // 17. so do a non-rounding shift of 16 first then follow
+    // up with a rounding shift by 1.
+    dct_pass(vshrn_n_s32, 16);
+
+    {
+        // pack and round
+        uint8x8_t p0 = vqrshrun_n_s16(row0, 1);
+        uint8x8_t p1 = vqrshrun_n_s16(row1, 1);
+        uint8x8_t p2 = vqrshrun_n_s16(row2, 1);
+        uint8x8_t p3 = vqrshrun_n_s16(row3, 1);
+        uint8x8_t p4 = vqrshrun_n_s16(row4, 1);
+        uint8x8_t p5 = vqrshrun_n_s16(row5, 1);
+        uint8x8_t p6 = vqrshrun_n_s16(row6, 1);
+        uint8x8_t p7 = vqrshrun_n_s16(row7, 1);
+
+        // again, these can translate into one instruction, but often don't.
+#define dct_trn8_8(x, y)               \
+    {                                  \
+        uint8x8x2_t t = vtrn_u8(x, y); \
+        x = t.val[0];                  \
+        y = t.val[1];                  \
+    }
+#define dct_trn8_16(x, y)                                                          \
+    {                                                                              \
+        uint16x4x2_t t = vtrn_u16(vreinterpret_u16_u8(x), vreinterpret_u16_u8(y)); \
+        x = vreinterpret_u8_u16(t.val[0]);                                         \
+        y = vreinterpret_u8_u16(t.val[1]);                                         \
+    }
+#define dct_trn8_32(x, y)                                                          \
+    {                                                                              \
+        uint32x2x2_t t = vtrn_u32(vreinterpret_u32_u8(x), vreinterpret_u32_u8(y)); \
+        x = vreinterpret_u8_u32(t.val[0]);                                         \
+        y = vreinterpret_u8_u32(t.val[1]);                                         \
+    }
+
+        // sadly can't use interleaved stores here since we only write
+        // 8 bytes to each scan line!
+
+        // 8x8 8-bit transpose pass 1
+        dct_trn8_8(p0, p1);
+        dct_trn8_8(p2, p3);
+        dct_trn8_8(p4, p5);
+        dct_trn8_8(p6, p7);
+
+        // pass 2
+        dct_trn8_16(p0, p2);
+        dct_trn8_16(p1, p3);
+        dct_trn8_16(p4, p6);
+        dct_trn8_16(p5, p7);
+
+        // pass 3
+        dct_trn8_32(p0, p4);
+        dct_trn8_32(p1, p5);
+        dct_trn8_32(p2, p6);
+        dct_trn8_32(p3, p7);
+
+        // store
+        vst1_u8(out, p0);
+        out += out_stride;
+        vst1_u8(out, p1);
+        out += out_stride;
+        vst1_u8(out, p2);
+        out += out_stride;
+        vst1_u8(out, p3);
+        out += out_stride;
+        vst1_u8(out, p4);
+        out += out_stride;
+        vst1_u8(out, p5);
+        out += out_stride;
+        vst1_u8(out, p6);
+        out += out_stride;
+        vst1_u8(out, p7);
+
+#undef dct_trn8_8
+#undef dct_trn8_16
+#undef dct_trn8_32
+    }
+
+#undef dct_long_mul
+#undef dct_long_mac
+#undef dct_widen
+#undef dct_wadd
+#undef dct_wsub
+#undef dct_bfly32o
+#undef dct_pass
+}
+
+#endif // STBI_NEON
+
+#define STBI__MARKER_none 0xff
+// if there's a pending marker from the entropy stream, return that
+// otherwise, fetch from the stream and get a marker. if there's no
+// marker, return 0xff, which is never a valid marker value
+static stbi_uc stbi__get_marker(stbi__jpeg *j)
+{
+    stbi_uc x;
+    if (j->marker != STBI__MARKER_none)
+    {
+        x = j->marker;
+        j->marker = STBI__MARKER_none;
+        return x;
+    }
+    x = stbi__get8(j->s);
+    if (x != 0xff)
+        return STBI__MARKER_none;
+    while (x == 0xff)
+        x = stbi__get8(j->s); // consume repeated 0xff fill bytes
+    return x;
+}
+
+// in each scan, we'll have scan_n components, and the order
+// of the components is specified by order[]
+#define STBI__RESTART(x) ((x) >= 0xd0 && (x) <= 0xd7)
+
+// after a restart interval, stbi__jpeg_reset the entropy decoder and
+// the dc prediction
+static void stbi__jpeg_reset(stbi__jpeg *j)
+{
+    j->code_bits = 0;
+    j->code_buffer = 0;
+    j->nomore = 0;
+    j->img_comp[0].dc_pred = j->img_comp[1].dc_pred = j->img_comp[2].dc_pred = j->img_comp[3].dc_pred = 0;
+    j->marker = STBI__MARKER_none;
+    j->todo = j->restart_interval ? j->restart_interval : 0x7fffffff;
+    j->eob_run = 0;
+    // no more than 1<<31 MCUs if no restart_interal? that's plenty safe,
+    // since we don't even allow 1<<30 pixels
+}
+
+static int stbi__parse_entropy_coded_data(stbi__jpeg *z)
+{
+    stbi__jpeg_reset(z);
+    if (!z->progressive)
+    {
+        if (z->scan_n == 1)
+        {
+            int i, j;
+            STBI_SIMD_ALIGN(short, data[64]);
+            int n = z->order[0];
+            // non-interleaved data, we just need to process one block at a time,
+            // in trivial scanline order
+            // number of blocks to do just depends on how many actual "pixels" this
+            // component has, independent of interleaved MCU blocking and such
+            int w = (z->img_comp[n].x + 7) >> 3;
+            int h = (z->img_comp[n].y + 7) >> 3;
+            for (j = 0; j < h; ++j)
+            {
+                for (i = 0; i < w; ++i)
+                {
+                    int ha = z->img_comp[n].ha;
+                    if (!stbi__jpeg_decode_block(z, data, z->huff_dc + z->img_comp[n].hd, z->huff_ac + ha, z->fast_ac[ha], n, z->dequant[z->img_comp[n].tq]))
+                        return 0;
+                    z->idct_block_kernel(z->img_comp[n].data + z->img_comp[n].w2 * j * 8 + i * 8, z->img_comp[n].w2, data);
+                    // every data block is an MCU, so countdown the restart interval
+                    if (--z->todo <= 0)
+                    {
+                        if (z->code_bits < 24)
+                            stbi__grow_buffer_unsafe(z);
+                        // if it's NOT a restart, then just bail, so we get corrupt data
+                        // rather than no data
+                        if (!STBI__RESTART(z->marker))
+                            return 1;
+                        stbi__jpeg_reset(z);
+                    }
+                }
+            }
+            return 1;
+        }
+        else
+        { // interleaved
+            int i, j, k, x, y;
+            STBI_SIMD_ALIGN(short, data[64]);
+            for (j = 0; j < z->img_mcu_y; ++j)
+            {
+                for (i = 0; i < z->img_mcu_x; ++i)
+                {
+                    // scan an interleaved mcu... process scan_n components in order
+                    for (k = 0; k < z->scan_n; ++k)
+                    {
+                        int n = z->order[k];
+                        // scan out an mcu's worth of this component; that's just determined
+                        // by the basic H and V specified for the component
+                        for (y = 0; y < z->img_comp[n].v; ++y)
+                        {
+                            for (x = 0; x < z->img_comp[n].h; ++x)
+                            {
+                                int x2 = (i * z->img_comp[n].h + x) * 8;
+                                int y2 = (j * z->img_comp[n].v + y) * 8;
+                                int ha = z->img_comp[n].ha;
+                                if (!stbi__jpeg_decode_block(z, data, z->huff_dc + z->img_comp[n].hd, z->huff_ac + ha, z->fast_ac[ha], n, z->dequant[z->img_comp[n].tq]))
+                                    return 0;
+                                z->idct_block_kernel(z->img_comp[n].data + z->img_comp[n].w2 * y2 + x2, z->img_comp[n].w2, data);
+                            }
+                        }
+                    }
+                    // after all interleaved components, that's an interleaved MCU,
+                    // so now count down the restart interval
+                    if (--z->todo <= 0)
+                    {
+                        if (z->code_bits < 24)
+                            stbi__grow_buffer_unsafe(z);
+                        if (!STBI__RESTART(z->marker))
+                            return 1;
+                        stbi__jpeg_reset(z);
+                    }
+                }
+            }
+            return 1;
+        }
+    }
+    else
+    {
+        if (z->scan_n == 1)
+        {
+            int i, j;
+            int n = z->order[0];
+            // non-interleaved data, we just need to process one block at a time,
+            // in trivial scanline order
+            // number of blocks to do just depends on how many actual "pixels" this
+            // component has, independent of interleaved MCU blocking and such
+            int w = (z->img_comp[n].x + 7) >> 3;
+            int h = (z->img_comp[n].y + 7) >> 3;
+            for (j = 0; j < h; ++j)
+            {
+                for (i = 0; i < w; ++i)
+                {
+                    short *data = z->img_comp[n].coeff + 64 * (i + j * z->img_comp[n].coeff_w);
+                    if (z->spec_start == 0)
+                    {
+                        if (!stbi__jpeg_decode_block_prog_dc(z, data, &z->huff_dc[z->img_comp[n].hd], n))
+                            return 0;
+                    }
+                    else
+                    {
+                        int ha = z->img_comp[n].ha;
+                        if (!stbi__jpeg_decode_block_prog_ac(z, data, &z->huff_ac[ha], z->fast_ac[ha]))
+                            return 0;
+                    }
+                    // every data block is an MCU, so countdown the restart interval
+                    if (--z->todo <= 0)
+                    {
+                        if (z->code_bits < 24)
+                            stbi__grow_buffer_unsafe(z);
+                        if (!STBI__RESTART(z->marker))
+                            return 1;
+                        stbi__jpeg_reset(z);
+                    }
+                }
+            }
+            return 1;
+        }
+        else
+        { // interleaved
+            int i, j, k, x, y;
+            for (j = 0; j < z->img_mcu_y; ++j)
+            {
+                for (i = 0; i < z->img_mcu_x; ++i)
+                {
+                    // scan an interleaved mcu... process scan_n components in order
+                    for (k = 0; k < z->scan_n; ++k)
+                    {
+                        int n = z->order[k];
+                        // scan out an mcu's worth of this component; that's just determined
+                        // by the basic H and V specified for the component
+                        for (y = 0; y < z->img_comp[n].v; ++y)
+                        {
+                            for (x = 0; x < z->img_comp[n].h; ++x)
+                            {
+                                int x2 = (i * z->img_comp[n].h + x);
+                                int y2 = (j * z->img_comp[n].v + y);
+                                short *data = z->img_comp[n].coeff + 64 * (x2 + y2 * z->img_comp[n].coeff_w);
+                                if (!stbi__jpeg_decode_block_prog_dc(z, data, &z->huff_dc[z->img_comp[n].hd], n))
+                                    return 0;
+                            }
+                        }
+                    }
+                    // after all interleaved components, that's an interleaved MCU,
+                    // so now count down the restart interval
+                    if (--z->todo <= 0)
+                    {
+                        if (z->code_bits < 24)
+                            stbi__grow_buffer_unsafe(z);
+                        if (!STBI__RESTART(z->marker))
+                            return 1;
+                        stbi__jpeg_reset(z);
+                    }
+                }
+            }
+            return 1;
+        }
+    }
+}
+
+static void stbi__jpeg_dequantize(short *data, stbi__uint16 *dequant)
+{
+    int i;
+    for (i = 0; i < 64; ++i)
+        data[i] *= dequant[i];
+}
+
+static void stbi__jpeg_finish(stbi__jpeg *z)
+{
+    if (z->progressive)
+    {
+        // dequantize and idct the data
+        int i, j, n;
+        for (n = 0; n < z->s->img_n; ++n)
+        {
+            int w = (z->img_comp[n].x + 7) >> 3;
+            int h = (z->img_comp[n].y + 7) >> 3;
+            for (j = 0; j < h; ++j)
+            {
+                for (i = 0; i < w; ++i)
+                {
+                    short *data = z->img_comp[n].coeff + 64 * (i + j * z->img_comp[n].coeff_w);
+                    stbi__jpeg_dequantize(data, z->dequant[z->img_comp[n].tq]);
+                    z->idct_block_kernel(z->img_comp[n].data + z->img_comp[n].w2 * j * 8 + i * 8, z->img_comp[n].w2, data);
+                }
+            }
+        }
+    }
+}
+
+static int stbi__process_marker(stbi__jpeg *z, int m)
+{
+    int L;
+    switch (m)
+    {
+    case STBI__MARKER_none: // no marker found
+        return stbi__err("expected marker", "Corrupt JPEG");
+
+    case 0xDD: // DRI - specify restart interval
+        if (stbi__get16be(z->s) != 4)
+            return stbi__err("bad DRI len", "Corrupt JPEG");
+        z->restart_interval = stbi__get16be(z->s);
+        return 1;
+
+    case 0xDB: // DQT - define quantization table
+        L = stbi__get16be(z->s) - 2;
+        while (L > 0)
+        {
+            int q = stbi__get8(z->s);
+            int p = q >> 4, sixteen = (p != 0);
+            int t = q & 15, i;
+            if (p != 0 && p != 1)
+                return stbi__err("bad DQT type", "Corrupt JPEG");
+            if (t > 3)
+                return stbi__err("bad DQT table", "Corrupt JPEG");
+
+            for (i = 0; i < 64; ++i)
+                z->dequant[t][stbi__jpeg_dezigzag[i]] = (stbi__uint16)(sixteen ? stbi__get16be(z->s) : stbi__get8(z->s));
+            L -= (sixteen ? 129 : 65);
+        }
+        return L == 0;
+
+    case 0xC4: // DHT - define huffman table
+        L = stbi__get16be(z->s) - 2;
+        while (L > 0)
+        {
+            stbi_uc *v;
+            int sizes[16], i, n = 0;
+            int q = stbi__get8(z->s);
+            int tc = q >> 4;
+            int th = q & 15;
+            if (tc > 1 || th > 3)
+                return stbi__err("bad DHT header", "Corrupt JPEG");
+            for (i = 0; i < 16; ++i)
+            {
+                sizes[i] = stbi__get8(z->s);
+                n += sizes[i];
+            }
+            if (n > 256)
+                return stbi__err("bad DHT header", "Corrupt JPEG"); // Loop over i < n would write past end of values!
+            L -= 17;
+            if (tc == 0)
+            {
+                if (!stbi__build_huffman(z->huff_dc + th, sizes))
+                    return 0;
+                v = z->huff_dc[th].values;
+            }
+            else
+            {
+                if (!stbi__build_huffman(z->huff_ac + th, sizes))
+                    return 0;
+                v = z->huff_ac[th].values;
+            }
+            for (i = 0; i < n; ++i)
+                v[i] = stbi__get8(z->s);
+            if (tc != 0)
+                stbi__build_fast_ac(z->fast_ac[th], z->huff_ac + th);
+            L -= n;
+        }
+        return L == 0;
+    }
+
+    // check for comment block or APP blocks
+    if ((m >= 0xE0 && m <= 0xEF) || m == 0xFE)
+    {
+        L = stbi__get16be(z->s);
+        if (L < 2)
+        {
+            if (m == 0xFE)
+                return stbi__err("bad COM len", "Corrupt JPEG");
+            else
+                return stbi__err("bad APP len", "Corrupt JPEG");
+        }
+        L -= 2;
+
+        if (m == 0xE0 && L >= 5)
+        { // JFIF APP0 segment
+            static const unsigned char tag[5] = {'J', 'F', 'I', 'F', '\0'};
+            int ok = 1;
+            int i;
+            for (i = 0; i < 5; ++i)
+                if (stbi__get8(z->s) != tag[i])
+                    ok = 0;
+            L -= 5;
+            if (ok)
+                z->jfif = 1;
+        }
+        else if (m == 0xEE && L >= 12)
+        { // Adobe APP14 segment
+            static const unsigned char tag[6] = {'A', 'd', 'o', 'b', 'e', '\0'};
+            int ok = 1;
+            int i;
+            for (i = 0; i < 6; ++i)
+                if (stbi__get8(z->s) != tag[i])
+                    ok = 0;
+            L -= 6;
+            if (ok)
+            {
+                stbi__get8(z->s);                            // version
+                stbi__get16be(z->s);                         // flags0
+                stbi__get16be(z->s);                         // flags1
+                z->app14_color_transform = stbi__get8(z->s); // color transform
+                L -= 6;
+            }
+        }
+
+        stbi__skip(z->s, L);
+        return 1;
+    }
+
+    return stbi__err("unknown marker", "Corrupt JPEG");
+}
+
+// after we see SOS
+static int stbi__process_scan_header(stbi__jpeg *z)
+{
+    int i;
+    int Ls = stbi__get16be(z->s);
+    z->scan_n = stbi__get8(z->s);
+    if (z->scan_n < 1 || z->scan_n > 4 || z->scan_n > (int)z->s->img_n)
+        return stbi__err("bad SOS component count", "Corrupt JPEG");
+    if (Ls != 6 + 2 * z->scan_n)
+        return stbi__err("bad SOS len", "Corrupt JPEG");
+    for (i = 0; i < z->scan_n; ++i)
+    {
+        int id = stbi__get8(z->s), which;
+        int q = stbi__get8(z->s);
+        for (which = 0; which < z->s->img_n; ++which)
+            if (z->img_comp[which].id == id)
+                break;
+        if (which == z->s->img_n)
+            return 0; // no match
+        z->img_comp[which].hd = q >> 4;
+        if (z->img_comp[which].hd > 3)
+            return stbi__err("bad DC huff", "Corrupt JPEG");
+        z->img_comp[which].ha = q & 15;
+        if (z->img_comp[which].ha > 3)
+            return stbi__err("bad AC huff", "Corrupt JPEG");
+        z->order[i] = which;
+    }
+
+    {
+        int aa;
+        z->spec_start = stbi__get8(z->s);
+        z->spec_end = stbi__get8(z->s); // should be 63, but might be 0
+        aa = stbi__get8(z->s);
+        z->succ_high = (aa >> 4);
+        z->succ_low = (aa & 15);
+        if (z->progressive)
+        {
+            if (z->spec_start > 63 || z->spec_end > 63 || z->spec_start > z->spec_end || z->succ_high > 13 || z->succ_low > 13)
+                return stbi__err("bad SOS", "Corrupt JPEG");
+        }
+        else
+        {
+            if (z->spec_start != 0)
+                return stbi__err("bad SOS", "Corrupt JPEG");
+            if (z->succ_high != 0 || z->succ_low != 0)
+                return stbi__err("bad SOS", "Corrupt JPEG");
+            z->spec_end = 63;
+        }
+    }
+
+    return 1;
+}
+
+static int stbi__free_jpeg_components(stbi__jpeg *z, int ncomp, int why)
+{
+    int i;
+    for (i = 0; i < ncomp; ++i)
+    {
+        if (z->img_comp[i].raw_data)
+        {
+            STBI_FREE(z->img_comp[i].raw_data);
+            z->img_comp[i].raw_data = NULL;
+            z->img_comp[i].data = NULL;
+        }
+        if (z->img_comp[i].raw_coeff)
+        {
+            STBI_FREE(z->img_comp[i].raw_coeff);
+            z->img_comp[i].raw_coeff = 0;
+            z->img_comp[i].coeff = 0;
+        }
+        if (z->img_comp[i].linebuf)
+        {
+            STBI_FREE(z->img_comp[i].linebuf);
+            z->img_comp[i].linebuf = NULL;
+        }
+    }
+    return why;
+}
+
+static int stbi__process_frame_header(stbi__jpeg *z, int scan)
+{
+    stbi__context *s = z->s;
+    int Lf, p, i, q, h_max = 1, v_max = 1, c;
+    Lf = stbi__get16be(s);
+    if (Lf < 11)
+        return stbi__err("bad SOF len", "Corrupt JPEG"); // JPEG
+    p = stbi__get8(s);
+    if (p != 8)
+        return stbi__err("only 8-bit", "JPEG format not supported: 8-bit only"); // JPEG baseline
+    s->img_y = stbi__get16be(s);
+    if (s->img_y == 0)
+        return stbi__err("no header height", "JPEG format not supported: delayed height"); // Legal, but we don't handle it--but neither does IJG
+    s->img_x = stbi__get16be(s);
+    if (s->img_x == 0)
+        return stbi__err("0 width", "Corrupt JPEG"); // JPEG requires
+    if (s->img_y > STBI_MAX_DIMENSIONS)
+        return stbi__err("too large", "Very large image (corrupt?)");
+    if (s->img_x > STBI_MAX_DIMENSIONS)
+        return stbi__err("too large", "Very large image (corrupt?)");
+    c = stbi__get8(s);
+    if (c != 3 && c != 1 && c != 4)
+        return stbi__err("bad component count", "Corrupt JPEG");
+    s->img_n = c;
+    for (i = 0; i < c; ++i)
+    {
+        z->img_comp[i].data = NULL;
+        z->img_comp[i].linebuf = NULL;
+    }
+
+    if (Lf != 8 + 3 * s->img_n)
+        return stbi__err("bad SOF len", "Corrupt JPEG");
+
+    z->rgb = 0;
+    for (i = 0; i < s->img_n; ++i)
+    {
+        static const unsigned char rgb[3] = {'R', 'G', 'B'};
+        z->img_comp[i].id = stbi__get8(s);
+        if (s->img_n == 3 && z->img_comp[i].id == rgb[i])
+            ++z->rgb;
+        q = stbi__get8(s);
+        z->img_comp[i].h = (q >> 4);
+        if (!z->img_comp[i].h || z->img_comp[i].h > 4)
+            return stbi__err("bad H", "Corrupt JPEG");
+        z->img_comp[i].v = q & 15;
+        if (!z->img_comp[i].v || z->img_comp[i].v > 4)
+            return stbi__err("bad V", "Corrupt JPEG");
+        z->img_comp[i].tq = stbi__get8(s);
+        if (z->img_comp[i].tq > 3)
+            return stbi__err("bad TQ", "Corrupt JPEG");
+    }
+
+    if (scan != STBI__SCAN_load)
+        return 1;
+
+    if (!stbi__mad3sizes_valid(s->img_x, s->img_y, s->img_n, 0))
+        return stbi__err("too large", "Image too large to decode");
+
+    for (i = 0; i < s->img_n; ++i)
+    {
+        if (z->img_comp[i].h > h_max)
+            h_max = z->img_comp[i].h;
+        if (z->img_comp[i].v > v_max)
+            v_max = z->img_comp[i].v;
+    }
+
+    // check that plane subsampling factors are integer ratios; our resamplers can't deal with fractional ratios
+    // and I've never seen a non-corrupted JPEG file actually use them
+    for (i = 0; i < s->img_n; ++i)
+    {
+        if (h_max % z->img_comp[i].h != 0)
+            return stbi__err("bad H", "Corrupt JPEG");
+        if (v_max % z->img_comp[i].v != 0)
+            return stbi__err("bad V", "Corrupt JPEG");
+    }
+
+    // compute interleaved mcu info
+    z->img_h_max = h_max;
+    z->img_v_max = v_max;
+    z->img_mcu_w = h_max * 8;
+    z->img_mcu_h = v_max * 8;
+    // these sizes can't be more than 17 bits
+    z->img_mcu_x = (s->img_x + z->img_mcu_w - 1) / z->img_mcu_w;
+    z->img_mcu_y = (s->img_y + z->img_mcu_h - 1) / z->img_mcu_h;
+
+    for (i = 0; i < s->img_n; ++i)
+    {
+        // number of effective pixels (e.g. for non-interleaved MCU)
+        z->img_comp[i].x = (s->img_x * z->img_comp[i].h + h_max - 1) / h_max;
+        z->img_comp[i].y = (s->img_y * z->img_comp[i].v + v_max - 1) / v_max;
+        // to simplify generation, we'll allocate enough memory to decode
+        // the bogus oversized data from using interleaved MCUs and their
+        // big blocks (e.g. a 16x16 iMCU on an image of width 33); we won't
+        // discard the extra data until colorspace conversion
+        //
+        // img_mcu_x, img_mcu_y: <=17 bits; comp[i].h and .v are <=4 (checked earlier)
+        // so these muls can't overflow with 32-bit ints (which we require)
+        z->img_comp[i].w2 = z->img_mcu_x * z->img_comp[i].h * 8;
+        z->img_comp[i].h2 = z->img_mcu_y * z->img_comp[i].v * 8;
+        z->img_comp[i].coeff = 0;
+        z->img_comp[i].raw_coeff = 0;
+        z->img_comp[i].linebuf = NULL;
+        z->img_comp[i].raw_data = stbi__malloc_mad2(z->img_comp[i].w2, z->img_comp[i].h2, 15);
+        if (z->img_comp[i].raw_data == NULL)
+            return stbi__free_jpeg_components(z, i + 1, stbi__err("outofmem", "Out of memory"));
+        // align blocks for idct using mmx/sse
+        z->img_comp[i].data = (stbi_uc *)(((size_t)z->img_comp[i].raw_data + 15) & ~15);
+        if (z->progressive)
+        {
+            // w2, h2 are multiples of 8 (see above)
+            z->img_comp[i].coeff_w = z->img_comp[i].w2 / 8;
+            z->img_comp[i].coeff_h = z->img_comp[i].h2 / 8;
+            z->img_comp[i].raw_coeff = stbi__malloc_mad3(z->img_comp[i].w2, z->img_comp[i].h2, sizeof(short), 15);
+            if (z->img_comp[i].raw_coeff == NULL)
+                return stbi__free_jpeg_components(z, i + 1, stbi__err("outofmem", "Out of memory"));
+            z->img_comp[i].coeff = (short *)(((size_t)z->img_comp[i].raw_coeff + 15) & ~15);
+        }
+    }
+
+    return 1;
+}
+
+// use comparisons since in some cases we handle more than one case (e.g. SOF)
+#define stbi__DNL(x) ((x) == 0xdc)
+#define stbi__SOI(x) ((x) == 0xd8)
+#define stbi__EOI(x) ((x) == 0xd9)
+#define stbi__SOF(x) ((x) == 0xc0 || (x) == 0xc1 || (x) == 0xc2)
+#define stbi__SOS(x) ((x) == 0xda)
+
+#define stbi__SOF_progressive(x) ((x) == 0xc2)
+
+static int stbi__decode_jpeg_header(stbi__jpeg *z, int scan)
+{
+    int m;
+    z->jfif = 0;
+    z->app14_color_transform = -1; // valid values are 0,1,2
+    z->marker = STBI__MARKER_none; // initialize cached marker to empty
+    m = stbi__get_marker(z);
+    if (!stbi__SOI(m))
+        return stbi__err("no SOI", "Corrupt JPEG");
+    if (scan == STBI__SCAN_type)
+        return 1;
+    m = stbi__get_marker(z);
+    while (!stbi__SOF(m))
+    {
+        if (!stbi__process_marker(z, m))
+            return 0;
+        m = stbi__get_marker(z);
+        while (m == STBI__MARKER_none)
+        {
+            // some files have extra padding after their blocks, so ok, we'll scan
+            if (stbi__at_eof(z->s))
+                return stbi__err("no SOF", "Corrupt JPEG");
+            m = stbi__get_marker(z);
+        }
+    }
+    z->progressive = stbi__SOF_progressive(m);
+    if (!stbi__process_frame_header(z, scan))
+        return 0;
+    return 1;
+}
+
+static int stbi__skip_jpeg_junk_at_end(stbi__jpeg *j)
+{
+    // some JPEGs have junk at end, skip over it but if we find what looks
+    // like a valid marker, resume there
+    while (!stbi__at_eof(j->s))
+    {
+        int x = stbi__get8(j->s);
+        while (x == 255)
+        { // might be a marker
+            if (stbi__at_eof(j->s))
+                return STBI__MARKER_none;
+            x = stbi__get8(j->s);
+            if (x != 0x00 && x != 0xff)
+            {
+                // not a stuffed zero or lead-in to another marker, looks
+                // like an actual marker, return it
+                return x;
+            }
+            // stuffed zero has x=0 now which ends the loop, meaning we go
+            // back to regular scan loop.
+            // repeated 0xff keeps trying to read the next byte of the marker.
+        }
+    }
+    return STBI__MARKER_none;
+}
+
+// decode image to YCbCr format
+static int stbi__decode_jpeg_image(stbi__jpeg *j)
+{
+    int m;
+    for (m = 0; m < 4; m++)
+    {
+        j->img_comp[m].raw_data = NULL;
+        j->img_comp[m].raw_coeff = NULL;
+    }
+    j->restart_interval = 0;
+    if (!stbi__decode_jpeg_header(j, STBI__SCAN_load))
+        return 0;
+    m = stbi__get_marker(j);
+    while (!stbi__EOI(m))
+    {
+        if (stbi__SOS(m))
+        {
+            if (!stbi__process_scan_header(j))
+                return 0;
+            if (!stbi__parse_entropy_coded_data(j))
+                return 0;
+            if (j->marker == STBI__MARKER_none)
+            {
+                j->marker = stbi__skip_jpeg_junk_at_end(j);
+                // if we reach eof without hitting a marker, stbi__get_marker() below will fail and we'll eventually return 0
+            }
+            m = stbi__get_marker(j);
+            if (STBI__RESTART(m))
+                m = stbi__get_marker(j);
+        }
+        else if (stbi__DNL(m))
+        {
+            int Ld = stbi__get16be(j->s);
+            stbi__uint32 NL = stbi__get16be(j->s);
+            if (Ld != 4)
+                return stbi__err("bad DNL len", "Corrupt JPEG");
+            if (NL != j->s->img_y)
+                return stbi__err("bad DNL height", "Corrupt JPEG");
+            m = stbi__get_marker(j);
+        }
+        else
+        {
+            if (!stbi__process_marker(j, m))
+                return 1;
+            m = stbi__get_marker(j);
+        }
+    }
+    if (j->progressive)
+        stbi__jpeg_finish(j);
+    return 1;
+}
+
+// static jfif-centered resampling (across block boundaries)
+
+typedef stbi_uc *(*resample_row_func)(stbi_uc *out, stbi_uc *in0, stbi_uc *in1,
+                                      int w, int hs);
+
+#define stbi__div4(x) ((stbi_uc)((x) >> 2))
+
+static stbi_uc *resample_row_1(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs)
+{
+    STBI_NOTUSED(out);
+    STBI_NOTUSED(in_far);
+    STBI_NOTUSED(w);
+    STBI_NOTUSED(hs);
+    return in_near;
+}
+
+static stbi_uc *stbi__resample_row_v_2(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs)
+{
+    // need to generate two samples vertically for every one in input
+    int i;
+    STBI_NOTUSED(hs);
+    for (i = 0; i < w; ++i)
+        out[i] = stbi__div4(3 * in_near[i] + in_far[i] + 2);
+    return out;
+}
+
+static stbi_uc *stbi__resample_row_h_2(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs)
+{
+    // need to generate two samples horizontally for every one in input
+    int i;
+    stbi_uc *input = in_near;
+
+    if (w == 1)
+    {
+        // if only one sample, can't do any interpolation
+        out[0] = out[1] = input[0];
+        return out;
+    }
+
+    out[0] = input[0];
+    out[1] = stbi__div4(input[0] * 3 + input[1] + 2);
+    for (i = 1; i < w - 1; ++i)
+    {
+        int n = 3 * input[i] + 2;
+        out[i * 2 + 0] = stbi__div4(n + input[i - 1]);
+        out[i * 2 + 1] = stbi__div4(n + input[i + 1]);
+    }
+    out[i * 2 + 0] = stbi__div4(input[w - 2] * 3 + input[w - 1] + 2);
+    out[i * 2 + 1] = input[w - 1];
+
+    STBI_NOTUSED(in_far);
+    STBI_NOTUSED(hs);
+
+    return out;
+}
+
+#define stbi__div16(x) ((stbi_uc)((x) >> 4))
+
+static stbi_uc *stbi__resample_row_hv_2(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs)
+{
+    // need to generate 2x2 samples for every one in input
+    int i, t0, t1;
+    if (w == 1)
+    {
+        out[0] = out[1] = stbi__div4(3 * in_near[0] + in_far[0] + 2);
+        return out;
+    }
+
+    t1 = 3 * in_near[0] + in_far[0];
+    out[0] = stbi__div4(t1 + 2);
+    for (i = 1; i < w; ++i)
+    {
+        t0 = t1;
+        t1 = 3 * in_near[i] + in_far[i];
+        out[i * 2 - 1] = stbi__div16(3 * t0 + t1 + 8);
+        out[i * 2] = stbi__div16(3 * t1 + t0 + 8);
+    }
+    out[w * 2 - 1] = stbi__div4(t1 + 2);
+
+    STBI_NOTUSED(hs);
+
+    return out;
+}
+
+#if defined(STBI_SSE2) || defined(STBI_NEON)
+static stbi_uc *stbi__resample_row_hv_2_simd(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs)
+{
+    // need to generate 2x2 samples for every one in input
+    int i = 0, t0, t1;
+
+    if (w == 1)
+    {
+        out[0] = out[1] = stbi__div4(3 * in_near[0] + in_far[0] + 2);
+        return out;
+    }
+
+    t1 = 3 * in_near[0] + in_far[0];
+    // process groups of 8 pixels for as long as we can.
+    // note we can't handle the last pixel in a row in this loop
+    // because we need to handle the filter boundary conditions.
+    for (; i < ((w - 1) & ~7); i += 8)
+    {
+#if defined(STBI_SSE2)
+        // load and perform the vertical filtering pass
+        // this uses 3*x + y = 4*x + (y - x)
+        __m128i zero = _mm_setzero_si128();
+        __m128i farb = _mm_loadl_epi64((__m128i *)(in_far + i));
+        __m128i nearb = _mm_loadl_epi64((__m128i *)(in_near + i));
+        __m128i farw = _mm_unpacklo_epi8(farb, zero);
+        __m128i nearw = _mm_unpacklo_epi8(nearb, zero);
+        __m128i diff = _mm_sub_epi16(farw, nearw);
+        __m128i nears = _mm_slli_epi16(nearw, 2);
+        __m128i curr = _mm_add_epi16(nears, diff); // current row
+
+        // horizontal filter works the same based on shifted vers of current
+        // row. "prev" is current row shifted right by 1 pixel; we need to
+        // insert the previous pixel value (from t1).
+        // "next" is current row shifted left by 1 pixel, with first pixel
+        // of next block of 8 pixels added in.
+        __m128i prv0 = _mm_slli_si128(curr, 2);
+        __m128i nxt0 = _mm_srli_si128(curr, 2);
+        __m128i prev = _mm_insert_epi16(prv0, t1, 0);
+        __m128i next = _mm_insert_epi16(nxt0, 3 * in_near[i + 8] + in_far[i + 8], 7);
+
+        // horizontal filter, polyphase implementation since it's convenient:
+        // even pixels = 3*cur + prev = cur*4 + (prev - cur)
+        // odd  pixels = 3*cur + next = cur*4 + (next - cur)
+        // note the shared term.
+        __m128i bias = _mm_set1_epi16(8);
+        __m128i curs = _mm_slli_epi16(curr, 2);
+        __m128i prvd = _mm_sub_epi16(prev, curr);
+        __m128i nxtd = _mm_sub_epi16(next, curr);
+        __m128i curb = _mm_add_epi16(curs, bias);
+        __m128i even = _mm_add_epi16(prvd, curb);
+        __m128i odd = _mm_add_epi16(nxtd, curb);
+
+        // interleave even and odd pixels, then undo scaling.
+        __m128i int0 = _mm_unpacklo_epi16(even, odd);
+        __m128i int1_ = _mm_unpackhi_epi16(even, odd);
+        __m128i de0 = _mm_srli_epi16(int0, 4);
+        __m128i de1 = _mm_srli_epi16(int1_, 4);
+
+        // pack and write output
+        __m128i outv = _mm_packus_epi16(de0, de1);
+        _mm_storeu_si128((__m128i *)(out + i * 2), outv);
+#elif defined(STBI_NEON)
+        // load and perform the vertical filtering pass
+        // this uses 3*x + y = 4*x + (y - x)
+        uint8x8_t farb = vld1_u8(in_far + i);
+        uint8x8_t nearb = vld1_u8(in_near + i);
+        int16x8_t diff = vreinterpretq_s16_u16(vsubl_u8(farb, nearb));
+        int16x8_t nears = vreinterpretq_s16_u16(vshll_n_u8(nearb, 2));
+        int16x8_t curr = vaddq_s16(nears, diff); // current row
+
+        // horizontal filter works the same based on shifted vers of current
+        // row. "prev" is current row shifted right by 1 pixel; we need to
+        // insert the previous pixel value (from t1).
+        // "next" is current row shifted left by 1 pixel, with first pixel
+        // of next block of 8 pixels added in.
+        int16x8_t prv0 = vextq_s16(curr, curr, 7);
+        int16x8_t nxt0 = vextq_s16(curr, curr, 1);
+        int16x8_t prev = vsetq_lane_s16(t1, prv0, 0);
+        int16x8_t next = vsetq_lane_s16(3 * in_near[i + 8] + in_far[i + 8], nxt0, 7);
+
+        // horizontal filter, polyphase implementation since it's convenient:
+        // even pixels = 3*cur + prev = cur*4 + (prev - cur)
+        // odd  pixels = 3*cur + next = cur*4 + (next - cur)
+        // note the shared term.
+        int16x8_t curs = vshlq_n_s16(curr, 2);
+        int16x8_t prvd = vsubq_s16(prev, curr);
+        int16x8_t nxtd = vsubq_s16(next, curr);
+        int16x8_t even = vaddq_s16(curs, prvd);
+        int16x8_t odd = vaddq_s16(curs, nxtd);
+
+        // undo scaling and round, then store with even/odd phases interleaved
+        uint8x8x2_t o;
+        o.val[0] = vqrshrun_n_s16(even, 4);
+        o.val[1] = vqrshrun_n_s16(odd, 4);
+        vst2_u8(out + i * 2, o);
+#endif
+
+        // "previous" value for next iter
+        t1 = 3 * in_near[i + 7] + in_far[i + 7];
+    }
+
+    t0 = t1;
+    t1 = 3 * in_near[i] + in_far[i];
+    out[i * 2] = stbi__div16(3 * t1 + t0 + 8);
+
+    for (++i; i < w; ++i)
+    {
+        t0 = t1;
+        t1 = 3 * in_near[i] + in_far[i];
+        out[i * 2 - 1] = stbi__div16(3 * t0 + t1 + 8);
+        out[i * 2] = stbi__div16(3 * t1 + t0 + 8);
+    }
+    out[w * 2 - 1] = stbi__div4(t1 + 2);
+
+    STBI_NOTUSED(hs);
+
+    return out;
+}
+#endif
+
+static stbi_uc *stbi__resample_row_generic(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs)
+{
+    // resample with nearest-neighbor
+    int i, j;
+    STBI_NOTUSED(in_far);
+    for (i = 0; i < w; ++i)
+        for (j = 0; j < hs; ++j)
+            out[i * hs + j] = in_near[i];
+    return out;
+}
+
+// this is a reduced-precision calculation of YCbCr-to-RGB introduced
+// to make sure the code produces the same results in both SIMD and scalar
+#define stbi__float2fixed(x) (((int)((x)*4096.0f + 0.5f)) << 8)
+static void stbi__YCbCr_to_RGB_row(stbi_uc *out, const stbi_uc *y, const stbi_uc *pcb, const stbi_uc *pcr, int count, int step)
+{
+    int i;
+    for (i = 0; i < count; ++i)
+    {
+        int y_fixed = (y[i] << 20) + (1 << 19); // rounding
+        int r, g, b;
+        int cr = pcr[i] - 128;
+        int cb = pcb[i] - 128;
+        r = y_fixed + cr * stbi__float2fixed(1.40200f);
+        g = y_fixed + (cr * -stbi__float2fixed(0.71414f)) + ((cb * -stbi__float2fixed(0.34414f)) & 0xffff0000);
+        b = y_fixed + cb * stbi__float2fixed(1.77200f);
+        r >>= 20;
+        g >>= 20;
+        b >>= 20;
+        if ((unsigned)r > 255)
+        {
+            if (r < 0)
+                r = 0;
+            else
+                r = 255;
+        }
+        if ((unsigned)g > 255)
+        {
+            if (g < 0)
+                g = 0;
+            else
+                g = 255;
+        }
+        if ((unsigned)b > 255)
+        {
+            if (b < 0)
+                b = 0;
+            else
+                b = 255;
+        }
+        out[0] = (stbi_uc)r;
+        out[1] = (stbi_uc)g;
+        out[2] = (stbi_uc)b;
+        out[3] = 255;
+        out += step;
+    }
+}
+
+#if defined(STBI_SSE2) || defined(STBI_NEON)
+static void stbi__YCbCr_to_RGB_simd(stbi_uc *out, stbi_uc const *y, stbi_uc const *pcb, stbi_uc const *pcr, int count, int step)
+{
+    int i = 0;
+
+#ifdef STBI_SSE2
+    // step == 3 is pretty ugly on the final interleave, and i'm not convinced
+    // it's useful in practice (you wouldn't use it for textures, for example).
+    // so just accelerate step == 4 case.
+    if (step == 4)
+    {
+        // this is a fairly straightforward implementation and not super-optimized.
+        __m128i signflip = _mm_set1_epi8(-0x80);
+        __m128i cr_const0 = _mm_set1_epi16((short)(1.40200f * 4096.0f + 0.5f));
+        __m128i cr_const1 = _mm_set1_epi16(-(short)(0.71414f * 4096.0f + 0.5f));
+        __m128i cb_const0 = _mm_set1_epi16(-(short)(0.34414f * 4096.0f + 0.5f));
+        __m128i cb_const1 = _mm_set1_epi16((short)(1.77200f * 4096.0f + 0.5f));
+        __m128i y_bias = _mm_set1_epi8((char)(unsigned char)128);
+        __m128i xw = _mm_set1_epi16(255); // alpha channel
+
+        for (; i + 7 < count; i += 8)
+        {
+            // load
+            __m128i y_bytes = _mm_loadl_epi64((__m128i *)(y + i));
+            __m128i cr_bytes = _mm_loadl_epi64((__m128i *)(pcr + i));
+            __m128i cb_bytes = _mm_loadl_epi64((__m128i *)(pcb + i));
+            __m128i cr_biased = _mm_xor_si128(cr_bytes, signflip); // -128
+            __m128i cb_biased = _mm_xor_si128(cb_bytes, signflip); // -128
+
+            // unpack to short (and left-shift cr, cb by 8)
+            __m128i yw = _mm_unpacklo_epi8(y_bias, y_bytes);
+            __m128i crw = _mm_unpacklo_epi8(_mm_setzero_si128(), cr_biased);
+            __m128i cbw = _mm_unpacklo_epi8(_mm_setzero_si128(), cb_biased);
+
+            // color transform
+            __m128i yws = _mm_srli_epi16(yw, 4);
+            __m128i cr0 = _mm_mulhi_epi16(cr_const0, crw);
+            __m128i cb0 = _mm_mulhi_epi16(cb_const0, cbw);
+            __m128i cb1 = _mm_mulhi_epi16(cbw, cb_const1);
+            __m128i cr1 = _mm_mulhi_epi16(crw, cr_const1);
+            __m128i rws = _mm_add_epi16(cr0, yws);
+            __m128i gwt = _mm_add_epi16(cb0, yws);
+            __m128i bws = _mm_add_epi16(yws, cb1);
+            __m128i gws = _mm_add_epi16(gwt, cr1);
+
+            // descale
+            __m128i rw = _mm_srai_epi16(rws, 4);
+            __m128i bw = _mm_srai_epi16(bws, 4);
+            __m128i gw = _mm_srai_epi16(gws, 4);
+
+            // back to byte, set up for transpose
+            __m128i brb = _mm_packus_epi16(rw, bw);
+            __m128i gxb = _mm_packus_epi16(gw, xw);
+
+            // transpose to interleave channels
+            __m128i t0 = _mm_unpacklo_epi8(brb, gxb);
+            __m128i t1 = _mm_unpackhi_epi8(brb, gxb);
+            __m128i o0 = _mm_unpacklo_epi16(t0, t1);
+            __m128i o1 = _mm_unpackhi_epi16(t0, t1);
+
+            // store
+            _mm_storeu_si128((__m128i *)(out + 0), o0);
+            _mm_storeu_si128((__m128i *)(out + 16), o1);
+            out += 32;
+        }
+    }
+#endif
+
+#ifdef STBI_NEON
+    // in this version, step=3 support would be easy to add. but is there demand?
+    if (step == 4)
+    {
+        // this is a fairly straightforward implementation and not super-optimized.
+        uint8x8_t signflip = vdup_n_u8(0x80);
+        int16x8_t cr_const0 = vdupq_n_s16((short)(1.40200f * 4096.0f + 0.5f));
+        int16x8_t cr_const1 = vdupq_n_s16(-(short)(0.71414f * 4096.0f + 0.5f));
+        int16x8_t cb_const0 = vdupq_n_s16(-(short)(0.34414f * 4096.0f + 0.5f));
+        int16x8_t cb_const1 = vdupq_n_s16((short)(1.77200f * 4096.0f + 0.5f));
+
+        for (; i + 7 < count; i += 8)
+        {
+            // load
+            uint8x8_t y_bytes = vld1_u8(y + i);
+            uint8x8_t cr_bytes = vld1_u8(pcr + i);
+            uint8x8_t cb_bytes = vld1_u8(pcb + i);
+            int8x8_t cr_biased = vreinterpret_s8_u8(vsub_u8(cr_bytes, signflip));
+            int8x8_t cb_biased = vreinterpret_s8_u8(vsub_u8(cb_bytes, signflip));
+
+            // expand to s16
+            int16x8_t yws = vreinterpretq_s16_u16(vshll_n_u8(y_bytes, 4));
+            int16x8_t crw = vshll_n_s8(cr_biased, 7);
+            int16x8_t cbw = vshll_n_s8(cb_biased, 7);
+
+            // color transform
+            int16x8_t cr0 = vqdmulhq_s16(crw, cr_const0);
+            int16x8_t cb0 = vqdmulhq_s16(cbw, cb_const0);
+            int16x8_t cr1 = vqdmulhq_s16(crw, cr_const1);
+            int16x8_t cb1 = vqdmulhq_s16(cbw, cb_const1);
+            int16x8_t rws = vaddq_s16(yws, cr0);
+            int16x8_t gws = vaddq_s16(vaddq_s16(yws, cb0), cr1);
+            int16x8_t bws = vaddq_s16(yws, cb1);
+
+            // undo scaling, round, convert to byte
+            uint8x8x4_t o;
+            o.val[0] = vqrshrun_n_s16(rws, 4);
+            o.val[1] = vqrshrun_n_s16(gws, 4);
+            o.val[2] = vqrshrun_n_s16(bws, 4);
+            o.val[3] = vdup_n_u8(255);
+
+            // store, interleaving r/g/b/a
+            vst4_u8(out, o);
+            out += 8 * 4;
+        }
+    }
+#endif
+
+    for (; i < count; ++i)
+    {
+        int y_fixed = (y[i] << 20) + (1 << 19); // rounding
+        int r, g, b;
+        int cr = pcr[i] - 128;
+        int cb = pcb[i] - 128;
+        r = y_fixed + cr * stbi__float2fixed(1.40200f);
+        g = y_fixed + cr * -stbi__float2fixed(0.71414f) + ((cb * -stbi__float2fixed(0.34414f)) & 0xffff0000);
+        b = y_fixed + cb * stbi__float2fixed(1.77200f);
+        r >>= 20;
+        g >>= 20;
+        b >>= 20;
+        if ((unsigned)r > 255)
+        {
+            if (r < 0)
+                r = 0;
+            else
+                r = 255;
+        }
+        if ((unsigned)g > 255)
+        {
+            if (g < 0)
+                g = 0;
+            else
+                g = 255;
+        }
+        if ((unsigned)b > 255)
+        {
+            if (b < 0)
+                b = 0;
+            else
+                b = 255;
+        }
+        out[0] = (stbi_uc)r;
+        out[1] = (stbi_uc)g;
+        out[2] = (stbi_uc)b;
+        out[3] = 255;
+        out += step;
+    }
+}
+#endif
+
+// set up the kernels
+static void stbi__setup_jpeg(stbi__jpeg *j)
+{
+    j->idct_block_kernel = stbi__idct_block;
+    j->YCbCr_to_RGB_kernel = stbi__YCbCr_to_RGB_row;
+    j->resample_row_hv_2_kernel = stbi__resample_row_hv_2;
+
+#ifdef STBI_SSE2
+    if (stbi__sse2_available())
+    {
+        j->idct_block_kernel = stbi__idct_simd;
+        j->YCbCr_to_RGB_kernel = stbi__YCbCr_to_RGB_simd;
+        j->resample_row_hv_2_kernel = stbi__resample_row_hv_2_simd;
+    }
+#endif
+
+#ifdef STBI_NEON
+    j->idct_block_kernel = stbi__idct_simd;
+    j->YCbCr_to_RGB_kernel = stbi__YCbCr_to_RGB_simd;
+    j->resample_row_hv_2_kernel = stbi__resample_row_hv_2_simd;
+#endif
+}
+
+// clean up the temporary component buffers
+static void stbi__cleanup_jpeg(stbi__jpeg *j)
+{
+    stbi__free_jpeg_components(j, j->s->img_n, 0);
+}
+
+typedef struct
+{
+    resample_row_func resample;
+    stbi_uc *line0, *line1;
+    int hs, vs;  // expansion factor in each axis
+    int w_lores; // horizontal pixels pre-expansion
+    int ystep;   // how far through vertical expansion we are
+    int ypos;    // which pre-expansion row we're on
+} stbi__resample;
+
+// fast 0..255 * 0..255 => 0..255 rounded multiplication
+static stbi_uc stbi__blinn_8x8(stbi_uc x, stbi_uc y)
+{
+    unsigned int t = x * y + 128;
+    return (stbi_uc)((t + (t >> 8)) >> 8);
+}
+
+static stbi_uc *load_jpeg_image(stbi__jpeg *z, int *out_x, int *out_y, int *comp, int req_comp)
+{
+    int n, decode_n, is_rgb;
+    z->s->img_n = 0; // make stbi__cleanup_jpeg safe
+
+    // validate req_comp
+    if (req_comp < 0 || req_comp > 4)
+        return stbi__errpuc("bad req_comp", "Internal error");
+
+    // load a jpeg image from whichever source, but leave in YCbCr format
+    if (!stbi__decode_jpeg_image(z))
+    {
+        stbi__cleanup_jpeg(z);
+        return NULL;
+    }
+
+    // determine actual number of components to generate
+    n = req_comp ? req_comp : z->s->img_n >= 3 ? 3
+                                               : 1;
+
+    is_rgb = z->s->img_n == 3 && (z->rgb == 3 || (z->app14_color_transform == 0 && !z->jfif));
+
+    if (z->s->img_n == 3 && n < 3 && !is_rgb)
+        decode_n = 1;
+    else
+        decode_n = z->s->img_n;
+
+    // nothing to do if no components requested; check this now to avoid
+    // accessing uninitialized coutput[0] later
+    if (decode_n <= 0)
+    {
+        stbi__cleanup_jpeg(z);
+        return NULL;
+    }
+
+    // resample and color-convert
+    {
+        int k;
+        unsigned int i, j;
+        stbi_uc *output;
+        stbi_uc *coutput[4] = {NULL, NULL, NULL, NULL};
+
+        stbi__resample res_comp[4];
+
+        for (k = 0; k < decode_n; ++k)
+        {
+            stbi__resample *r = &res_comp[k];
+
+            // allocate line buffer big enough for upsampling off the edges
+            // with upsample factor of 4
+            z->img_comp[k].linebuf = (stbi_uc *)stbi__malloc(z->s->img_x + 3);
+            if (!z->img_comp[k].linebuf)
+            {
+                stbi__cleanup_jpeg(z);
+                return stbi__errpuc("outofmem", "Out of memory");
+            }
+
+            r->hs = z->img_h_max / z->img_comp[k].h;
+            r->vs = z->img_v_max / z->img_comp[k].v;
+            r->ystep = r->vs >> 1;
+            r->w_lores = (z->s->img_x + r->hs - 1) / r->hs;
+            r->ypos = 0;
+            r->line0 = r->line1 = z->img_comp[k].data;
+
+            if (r->hs == 1 && r->vs == 1)
+                r->resample = resample_row_1;
+            else if (r->hs == 1 && r->vs == 2)
+                r->resample = stbi__resample_row_v_2;
+            else if (r->hs == 2 && r->vs == 1)
+                r->resample = stbi__resample_row_h_2;
+            else if (r->hs == 2 && r->vs == 2)
+                r->resample = z->resample_row_hv_2_kernel;
+            else
+                r->resample = stbi__resample_row_generic;
+        }
+
+        // can't error after this so, this is safe
+        output = (stbi_uc *)stbi__malloc_mad3(n, z->s->img_x, z->s->img_y, 1);
+        if (!output)
+        {
+            stbi__cleanup_jpeg(z);
+            return stbi__errpuc("outofmem", "Out of memory");
+        }
+
+        // now go ahead and resample
+        for (j = 0; j < z->s->img_y; ++j)
+        {
+            stbi_uc *out = output + n * z->s->img_x * j;
+            for (k = 0; k < decode_n; ++k)
+            {
+                stbi__resample *r = &res_comp[k];
+                int y_bot = r->ystep >= (r->vs >> 1);
+                coutput[k] = r->resample(z->img_comp[k].linebuf,
+                                         y_bot ? r->line1 : r->line0,
+                                         y_bot ? r->line0 : r->line1,
+                                         r->w_lores, r->hs);
+                if (++r->ystep >= r->vs)
+                {
+                    r->ystep = 0;
+                    r->line0 = r->line1;
+                    if (++r->ypos < z->img_comp[k].y)
+                        r->line1 += z->img_comp[k].w2;
+                }
+            }
+            if (n >= 3)
+            {
+                stbi_uc *y = coutput[0];
+                if (z->s->img_n == 3)
+                {
+                    if (is_rgb)
+                    {
+                        for (i = 0; i < z->s->img_x; ++i)
+                        {
+                            out[0] = y[i];
+                            out[1] = coutput[1][i];
+                            out[2] = coutput[2][i];
+                            out[3] = 255;
+                            out += n;
+                        }
+                    }
+                    else
+                    {
+                        z->YCbCr_to_RGB_kernel(out, y, coutput[1], coutput[2], z->s->img_x, n);
+                    }
+                }
+                else if (z->s->img_n == 4)
+                {
+                    if (z->app14_color_transform == 0)
+                    { // CMYK
+                        for (i = 0; i < z->s->img_x; ++i)
+                        {
+                            stbi_uc m = coutput[3][i];
+                            out[0] = stbi__blinn_8x8(coutput[0][i], m);
+                            out[1] = stbi__blinn_8x8(coutput[1][i], m);
+                            out[2] = stbi__blinn_8x8(coutput[2][i], m);
+                            out[3] = 255;
+                            out += n;
+                        }
+                    }
+                    else if (z->app14_color_transform == 2)
+                    { // YCCK
+                        z->YCbCr_to_RGB_kernel(out, y, coutput[1], coutput[2], z->s->img_x, n);
+                        for (i = 0; i < z->s->img_x; ++i)
+                        {
+                            stbi_uc m = coutput[3][i];
+                            out[0] = stbi__blinn_8x8(255 - out[0], m);
+                            out[1] = stbi__blinn_8x8(255 - out[1], m);
+                            out[2] = stbi__blinn_8x8(255 - out[2], m);
+                            out += n;
+                        }
+                    }
+                    else
+                    { // YCbCr + alpha?  Ignore the fourth channel for now
+                        z->YCbCr_to_RGB_kernel(out, y, coutput[1], coutput[2], z->s->img_x, n);
+                    }
+                }
+                else
+                    for (i = 0; i < z->s->img_x; ++i)
+                    {
+                        out[0] = out[1] = out[2] = y[i];
+                        out[3] = 255; // not used if n==3
+                        out += n;
+                    }
+            }
+            else
+            {
+                if (is_rgb)
+                {
+                    if (n == 1)
+                        for (i = 0; i < z->s->img_x; ++i)
+                            *out++ = stbi__compute_y(coutput[0][i], coutput[1][i], coutput[2][i]);
+                    else
+                    {
+                        for (i = 0; i < z->s->img_x; ++i, out += 2)
+                        {
+                            out[0] = stbi__compute_y(coutput[0][i], coutput[1][i], coutput[2][i]);
+                            out[1] = 255;
+                        }
+                    }
+                }
+                else if (z->s->img_n == 4 && z->app14_color_transform == 0)
+                {
+                    for (i = 0; i < z->s->img_x; ++i)
+                    {
+                        stbi_uc m = coutput[3][i];
+                        stbi_uc r = stbi__blinn_8x8(coutput[0][i], m);
+                        stbi_uc g = stbi__blinn_8x8(coutput[1][i], m);
+                        stbi_uc b = stbi__blinn_8x8(coutput[2][i], m);
+                        out[0] = stbi__compute_y(r, g, b);
+                        out[1] = 255;
+                        out += n;
+                    }
+                }
+                else if (z->s->img_n == 4 && z->app14_color_transform == 2)
+                {
+                    for (i = 0; i < z->s->img_x; ++i)
+                    {
+                        out[0] = stbi__blinn_8x8(255 - coutput[0][i], coutput[3][i]);
+                        out[1] = 255;
+                        out += n;
+                    }
+                }
+                else
+                {
+                    stbi_uc *y = coutput[0];
+                    if (n == 1)
+                        for (i = 0; i < z->s->img_x; ++i)
+                            out[i] = y[i];
+                    else
+                        for (i = 0; i < z->s->img_x; ++i)
+                        {
+                            *out++ = y[i];
+                            *out++ = 255;
+                        }
+                }
+            }
+        }
+        stbi__cleanup_jpeg(z);
+        *out_x = z->s->img_x;
+        *out_y = z->s->img_y;
+        if (comp)
+            *comp = z->s->img_n >= 3 ? 3 : 1; // report original components, not output
+        return output;
+    }
+}
+
+static void *stbi__jpeg_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    unsigned char *result;
+    stbi__jpeg *j = (stbi__jpeg *)stbi__malloc(sizeof(stbi__jpeg));
+    if (!j)
+        return stbi__errpuc("outofmem", "Out of memory");
+    memset(j, 0, sizeof(stbi__jpeg));
+    STBI_NOTUSED(ri);
+    j->s = s;
+    stbi__setup_jpeg(j);
+    result = load_jpeg_image(j, x, y, comp, req_comp);
+    STBI_FREE(j);
+    return result;
+}
+
+static int stbi__jpeg_test(stbi__context *s)
+{
+    int r;
+    stbi__jpeg *j = (stbi__jpeg *)stbi__malloc(sizeof(stbi__jpeg));
+    if (!j)
+        return stbi__err("outofmem", "Out of memory");
+    memset(j, 0, sizeof(stbi__jpeg));
+    j->s = s;
+    stbi__setup_jpeg(j);
+    r = stbi__decode_jpeg_header(j, STBI__SCAN_type);
+    stbi__rewind(s);
+    STBI_FREE(j);
+    return r;
+}
+
+static int stbi__jpeg_info_raw(stbi__jpeg *j, int *x, int *y, int *comp)
+{
+    if (!stbi__decode_jpeg_header(j, STBI__SCAN_header))
+    {
+        stbi__rewind(j->s);
+        return 0;
+    }
+    if (x)
+        *x = j->s->img_x;
+    if (y)
+        *y = j->s->img_y;
+    if (comp)
+        *comp = j->s->img_n >= 3 ? 3 : 1;
+    return 1;
+}
+
+static int stbi__jpeg_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    int result;
+    stbi__jpeg *j = (stbi__jpeg *)(stbi__malloc(sizeof(stbi__jpeg)));
+    if (!j)
+        return stbi__err("outofmem", "Out of memory");
+    memset(j, 0, sizeof(stbi__jpeg));
+    j->s = s;
+    result = stbi__jpeg_info_raw(j, x, y, comp);
+    STBI_FREE(j);
+    return result;
+}
+#endif
+
+// public domain zlib decode    v0.2  Sean Barrett 2006-11-18
+//    simple implementation
+//      - all input must be provided in an upfront buffer
+//      - all output is written to a single output buffer (can malloc/realloc)
+//    performance
+//      - fast huffman
+
+#ifndef STBI_NO_ZLIB
+
+// fast-way is faster to check than jpeg huffman, but slow way is slower
+#define STBI__ZFAST_BITS 9 // accelerate all cases in default tables
+#define STBI__ZFAST_MASK ((1 << STBI__ZFAST_BITS) - 1)
+#define STBI__ZNSYMS 288 // number of symbols in literal/length alphabet
+
+// zlib-style huffman encoding
+// (jpegs packs from left, zlib from right, so can't share code)
+typedef struct
+{
+    stbi__uint16 fast[1 << STBI__ZFAST_BITS];
+    stbi__uint16 firstcode[16];
+    int maxcode[17];
+    stbi__uint16 firstsymbol[16];
+    stbi_uc size[STBI__ZNSYMS];
+    stbi__uint16 value[STBI__ZNSYMS];
+} stbi__zhuffman;
+
+stbi_inline static int stbi__bitreverse16(int n)
+{
+    n = ((n & 0xAAAA) >> 1) | ((n & 0x5555) << 1);
+    n = ((n & 0xCCCC) >> 2) | ((n & 0x3333) << 2);
+    n = ((n & 0xF0F0) >> 4) | ((n & 0x0F0F) << 4);
+    n = ((n & 0xFF00) >> 8) | ((n & 0x00FF) << 8);
+    return n;
+}
+
+stbi_inline static int stbi__bit_reverse(int v, int bits)
+{
+    STBI_ASSERT(bits <= 16);
+    // to bit reverse n bits, reverse 16 and shift
+    // e.g. 11 bits, bit reverse and shift away 5
+    return stbi__bitreverse16(v) >> (16 - bits);
+}
+
+static int stbi__zbuild_huffman(stbi__zhuffman *z, const stbi_uc *sizelist, int num)
+{
+    int i, k = 0;
+    int code, next_code[16], sizes[17];
+
+    // DEFLATE spec for generating codes
+    memset(sizes, 0, sizeof(sizes));
+    memset(z->fast, 0, sizeof(z->fast));
+    for (i = 0; i < num; ++i)
+        ++sizes[sizelist[i]];
+    sizes[0] = 0;
+    for (i = 1; i < 16; ++i)
+        if (sizes[i] > (1 << i))
+            return stbi__err("bad sizes", "Corrupt PNG");
+    code = 0;
+    for (i = 1; i < 16; ++i)
+    {
+        next_code[i] = code;
+        z->firstcode[i] = (stbi__uint16)code;
+        z->firstsymbol[i] = (stbi__uint16)k;
+        code = (code + sizes[i]);
+        if (sizes[i])
+            if (code - 1 >= (1 << i))
+                return stbi__err("bad codelengths", "Corrupt PNG");
+        z->maxcode[i] = code << (16 - i); // preshift for inner loop
+        code <<= 1;
+        k += sizes[i];
+    }
+    z->maxcode[16] = 0x10000; // sentinel
+    for (i = 0; i < num; ++i)
+    {
+        int s = sizelist[i];
+        if (s)
+        {
+            int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s];
+            stbi__uint16 fastv = (stbi__uint16)((s << 9) | i);
+            z->size[c] = (stbi_uc)s;
+            z->value[c] = (stbi__uint16)i;
+            if (s <= STBI__ZFAST_BITS)
+            {
+                int j = stbi__bit_reverse(next_code[s], s);
+                while (j < (1 << STBI__ZFAST_BITS))
+                {
+                    z->fast[j] = fastv;
+                    j += (1 << s);
+                }
+            }
+            ++next_code[s];
+        }
+    }
+    return 1;
+}
+
+// zlib-from-memory implementation for PNG reading
+//    because PNG allows splitting the zlib stream arbitrarily,
+//    and it's annoying structurally to have PNG call ZLIB call PNG,
+//    we require PNG read all the IDATs and combine them into a single
+//    memory buffer
+
+typedef struct
+{
+    stbi_uc *zbuffer, *zbuffer_end;
+    int num_bits;
+    stbi__uint32 code_buffer;
+
+    char *zout;
+    char *zout_start;
+    char *zout_end;
+    int z_expandable;
+
+    stbi__zhuffman z_length, z_distance;
+} stbi__zbuf;
+
+stbi_inline static int stbi__zeof(stbi__zbuf *z)
+{
+    return (z->zbuffer >= z->zbuffer_end);
+}
+
+stbi_inline static stbi_uc stbi__zget8(stbi__zbuf *z)
+{
+    return stbi__zeof(z) ? 0 : *z->zbuffer++;
+}
+
+static void stbi__fill_bits(stbi__zbuf *z)
+{
+    do
+    {
+        if (z->code_buffer >= (1U << z->num_bits))
+        {
+            z->zbuffer = z->zbuffer_end; /* treat this as EOF so we fail. */
+            return;
+        }
+        z->code_buffer |= (unsigned int)stbi__zget8(z) << z->num_bits;
+        z->num_bits += 8;
+    } while (z->num_bits <= 24);
+}
+
+stbi_inline static unsigned int stbi__zreceive(stbi__zbuf *z, int n)
+{
+    unsigned int k;
+    if (z->num_bits < n)
+        stbi__fill_bits(z);
+    k = z->code_buffer & ((1 << n) - 1);
+    z->code_buffer >>= n;
+    z->num_bits -= n;
+    return k;
+}
+
+static int stbi__zhuffman_decode_slowpath(stbi__zbuf *a, stbi__zhuffman *z)
+{
+    int b, s, k;
+    // not resolved by fast table, so compute it the slow way
+    // use jpeg approach, which requires MSbits at top
+    k = stbi__bit_reverse(a->code_buffer, 16);
+    for (s = STBI__ZFAST_BITS + 1;; ++s)
+        if (k < z->maxcode[s])
+            break;
+    if (s >= 16)
+        return -1; // invalid code!
+    // code size is s, so:
+    b = (k >> (16 - s)) - z->firstcode[s] + z->firstsymbol[s];
+    if (b >= STBI__ZNSYMS)
+        return -1; // some data was corrupt somewhere!
+    if (z->size[b] != s)
+        return -1; // was originally an assert, but report failure instead.
+    a->code_buffer >>= s;
+    a->num_bits -= s;
+    return z->value[b];
+}
+
+stbi_inline static int stbi__zhuffman_decode(stbi__zbuf *a, stbi__zhuffman *z)
+{
+    int b, s;
+    if (a->num_bits < 16)
+    {
+        if (stbi__zeof(a))
+        {
+            return -1; /* report error for unexpected end of data. */
+        }
+        stbi__fill_bits(a);
+    }
+    b = z->fast[a->code_buffer & STBI__ZFAST_MASK];
+    if (b)
+    {
+        s = b >> 9;
+        a->code_buffer >>= s;
+        a->num_bits -= s;
+        return b & 511;
+    }
+    return stbi__zhuffman_decode_slowpath(a, z);
+}
+
+static int stbi__zexpand(stbi__zbuf *z, char *zout, int n) // need to make room for n bytes
+{
+    char *q;
+    unsigned int cur, limit, old_limit;
+    z->zout = zout;
+    if (!z->z_expandable)
+        return stbi__err("output buffer limit", "Corrupt PNG");
+    cur = (unsigned int)(z->zout - z->zout_start);
+    limit = old_limit = (unsigned)(z->zout_end - z->zout_start);
+    if (UINT_MAX - cur < (unsigned)n)
+        return stbi__err("outofmem", "Out of memory");
+    while (cur + n > limit)
+    {
+        if (limit > UINT_MAX / 2)
+            return stbi__err("outofmem", "Out of memory");
+        limit *= 2;
+    }
+    q = (char *)STBI_REALLOC_SIZED(z->zout_start, old_limit, limit);
+    STBI_NOTUSED(old_limit);
+    if (q == NULL)
+        return stbi__err("outofmem", "Out of memory");
+    z->zout_start = q;
+    z->zout = q + cur;
+    z->zout_end = q + limit;
+    return 1;
+}
+
+static const int stbi__zlength_base[31] = {
+    3, 4, 5, 6, 7, 8, 9, 10, 11, 13,
+    15, 17, 19, 23, 27, 31, 35, 43, 51, 59,
+    67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
+
+static const int stbi__zlength_extra[31] =
+    {0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0};
+
+static const int stbi__zdist_base[32] = {1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+                                         257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0};
+
+static const int stbi__zdist_extra[32] =
+    {0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13};
+
+static int stbi__parse_huffman_block(stbi__zbuf *a)
+{
+    char *zout = a->zout;
+    for (;;)
+    {
+        int z = stbi__zhuffman_decode(a, &a->z_length);
+        if (z < 256)
+        {
+            if (z < 0)
+                return stbi__err("bad huffman code", "Corrupt PNG"); // error in huffman codes
+            if (zout >= a->zout_end)
+            {
+                if (!stbi__zexpand(a, zout, 1))
+                    return 0;
+                zout = a->zout;
+            }
+            *zout++ = (char)z;
+        }
+        else
+        {
+            stbi_uc *p;
+            int len, dist;
+            if (z == 256)
+            {
+                a->zout = zout;
+                return 1;
+            }
+            if (z >= 286)
+                return stbi__err("bad huffman code", "Corrupt PNG"); // per DEFLATE, length codes 286 and 287 must not appear in compressed data
+            z -= 257;
+            len = stbi__zlength_base[z];
+            if (stbi__zlength_extra[z])
+                len += stbi__zreceive(a, stbi__zlength_extra[z]);
+            z = stbi__zhuffman_decode(a, &a->z_distance);
+            if (z < 0 || z >= 30)
+                return stbi__err("bad huffman code", "Corrupt PNG"); // per DEFLATE, distance codes 30 and 31 must not appear in compressed data
+            dist = stbi__zdist_base[z];
+            if (stbi__zdist_extra[z])
+                dist += stbi__zreceive(a, stbi__zdist_extra[z]);
+            if (zout - a->zout_start < dist)
+                return stbi__err("bad dist", "Corrupt PNG");
+            if (zout + len > a->zout_end)
+            {
+                if (!stbi__zexpand(a, zout, len))
+                    return 0;
+                zout = a->zout;
+            }
+            p = (stbi_uc *)(zout - dist);
+            if (dist == 1)
+            { // run of one byte; common in images.
+                stbi_uc v = *p;
+                if (len)
+                {
+                    do
+                        *zout++ = v;
+                    while (--len);
+                }
+            }
+            else
+            {
+                if (len)
+                {
+                    do
+                        *zout++ = *p++;
+                    while (--len);
+                }
+            }
+        }
+    }
+}
+
+static int stbi__compute_huffman_codes(stbi__zbuf *a)
+{
+    static const stbi_uc length_dezigzag[19] = {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+    stbi__zhuffman z_codelength;
+    stbi_uc lencodes[286 + 32 + 137]; // padding for maximum single op
+    stbi_uc codelength_sizes[19];
+    int i, n;
+
+    int hlit = stbi__zreceive(a, 5) + 257;
+    int hdist = stbi__zreceive(a, 5) + 1;
+    int hclen = stbi__zreceive(a, 4) + 4;
+    int ntot = hlit + hdist;
+
+    memset(codelength_sizes, 0, sizeof(codelength_sizes));
+    for (i = 0; i < hclen; ++i)
+    {
+        int s = stbi__zreceive(a, 3);
+        codelength_sizes[length_dezigzag[i]] = (stbi_uc)s;
+    }
+    if (!stbi__zbuild_huffman(&z_codelength, codelength_sizes, 19))
+        return 0;
+
+    n = 0;
+    while (n < ntot)
+    {
+        int c = stbi__zhuffman_decode(a, &z_codelength);
+        if (c < 0 || c >= 19)
+            return stbi__err("bad codelengths", "Corrupt PNG");
+        if (c < 16)
+            lencodes[n++] = (stbi_uc)c;
+        else
+        {
+            stbi_uc fill = 0;
+            if (c == 16)
+            {
+                c = stbi__zreceive(a, 2) + 3;
+                if (n == 0)
+                    return stbi__err("bad codelengths", "Corrupt PNG");
+                fill = lencodes[n - 1];
+            }
+            else if (c == 17)
+            {
+                c = stbi__zreceive(a, 3) + 3;
+            }
+            else if (c == 18)
+            {
+                c = stbi__zreceive(a, 7) + 11;
+            }
+            else
+            {
+                return stbi__err("bad codelengths", "Corrupt PNG");
+            }
+            if (ntot - n < c)
+                return stbi__err("bad codelengths", "Corrupt PNG");
+            memset(lencodes + n, fill, c);
+            n += c;
+        }
+    }
+    if (n != ntot)
+        return stbi__err("bad codelengths", "Corrupt PNG");
+    if (!stbi__zbuild_huffman(&a->z_length, lencodes, hlit))
+        return 0;
+    if (!stbi__zbuild_huffman(&a->z_distance, lencodes + hlit, hdist))
+        return 0;
+    return 1;
+}
+
+static int stbi__parse_uncompressed_block(stbi__zbuf *a)
+{
+    stbi_uc header[4];
+    int len, nlen, k;
+    if (a->num_bits & 7)
+        stbi__zreceive(a, a->num_bits & 7); // discard
+    // drain the bit-packed data into header
+    k = 0;
+    while (a->num_bits > 0)
+    {
+        header[k++] = (stbi_uc)(a->code_buffer & 255); // suppress MSVC run-time check
+        a->code_buffer >>= 8;
+        a->num_bits -= 8;
+    }
+    if (a->num_bits < 0)
+        return stbi__err("zlib corrupt", "Corrupt PNG");
+    // now fill header the normal way
+    while (k < 4)
+        header[k++] = stbi__zget8(a);
+    len = header[1] * 256 + header[0];
+    nlen = header[3] * 256 + header[2];
+    if (nlen != (len ^ 0xffff))
+        return stbi__err("zlib corrupt", "Corrupt PNG");
+    if (a->zbuffer + len > a->zbuffer_end)
+        return stbi__err("read past buffer", "Corrupt PNG");
+    if (a->zout + len > a->zout_end)
+        if (!stbi__zexpand(a, a->zout, len))
+            return 0;
+    memcpy(a->zout, a->zbuffer, len);
+    a->zbuffer += len;
+    a->zout += len;
+    return 1;
+}
+
+static int stbi__parse_zlib_header(stbi__zbuf *a)
+{
+    int cmf = stbi__zget8(a);
+    int cm = cmf & 15;
+    /* int cinfo = cmf >> 4; */
+    int flg = stbi__zget8(a);
+    if (stbi__zeof(a))
+        return stbi__err("bad zlib header", "Corrupt PNG"); // zlib spec
+    if ((cmf * 256 + flg) % 31 != 0)
+        return stbi__err("bad zlib header", "Corrupt PNG"); // zlib spec
+    if (flg & 32)
+        return stbi__err("no preset dict", "Corrupt PNG"); // preset dictionary not allowed in png
+    if (cm != 8)
+        return stbi__err("bad compression", "Corrupt PNG"); // DEFLATE required for png
+    // window = 1 << (8 + cinfo)... but who cares, we fully buffer output
+    return 1;
+}
+
+static const stbi_uc stbi__zdefault_length[STBI__ZNSYMS] =
+    {
+        8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+        8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+        8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+        8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+        8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
+        9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
+        9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
+        9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
+        7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8};
+static const stbi_uc stbi__zdefault_distance[32] =
+    {
+        5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5};
+/*
+Init algorithm:
+{
+   int i;   // use <= to match clearly with spec
+   for (i=0; i <= 143; ++i)     stbi__zdefault_length[i]   = 8;
+   for (   ; i <= 255; ++i)     stbi__zdefault_length[i]   = 9;
+   for (   ; i <= 279; ++i)     stbi__zdefault_length[i]   = 7;
+   for (   ; i <= 287; ++i)     stbi__zdefault_length[i]   = 8;
+
+   for (i=0; i <=  31; ++i)     stbi__zdefault_distance[i] = 5;
+}
+*/
+
+static int stbi__parse_zlib(stbi__zbuf *a, int parse_header)
+{
+    int final, type;
+    if (parse_header)
+        if (!stbi__parse_zlib_header(a))
+            return 0;
+    a->num_bits = 0;
+    a->code_buffer = 0;
+    do
+    {
+        final = stbi__zreceive(a, 1);
+        type = stbi__zreceive(a, 2);
+        if (type == 0)
+        {
+            if (!stbi__parse_uncompressed_block(a))
+                return 0;
+        }
+        else if (type == 3)
+        {
+            return 0;
+        }
+        else
+        {
+            if (type == 1)
+            {
+                // use fixed code lengths
+                if (!stbi__zbuild_huffman(&a->z_length, stbi__zdefault_length, STBI__ZNSYMS))
+                    return 0;
+                if (!stbi__zbuild_huffman(&a->z_distance, stbi__zdefault_distance, 32))
+                    return 0;
+            }
+            else
+            {
+                if (!stbi__compute_huffman_codes(a))
+                    return 0;
+            }
+            if (!stbi__parse_huffman_block(a))
+                return 0;
+        }
+    } while (!final);
+    return 1;
+}
+
+static int stbi__do_zlib(stbi__zbuf *a, char *obuf, int olen, int exp, int parse_header)
+{
+    a->zout_start = obuf;
+    a->zout = obuf;
+    a->zout_end = obuf + olen;
+    a->z_expandable = exp;
+
+    return stbi__parse_zlib(a, parse_header);
+}
+
+STBIDEF char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen)
+{
+    stbi__zbuf a;
+    char *p = (char *)stbi__malloc(initial_size);
+    if (p == NULL)
+        return NULL;
+    a.zbuffer = (stbi_uc *)buffer;
+    a.zbuffer_end = (stbi_uc *)buffer + len;
+    if (stbi__do_zlib(&a, p, initial_size, 1, 1))
+    {
+        if (outlen)
+            *outlen = (int)(a.zout - a.zout_start);
+        return a.zout_start;
+    }
+    else
+    {
+        STBI_FREE(a.zout_start);
+        return NULL;
+    }
+}
+
+STBIDEF char *stbi_zlib_decode_malloc(char const *buffer, int len, int *outlen)
+{
+    return stbi_zlib_decode_malloc_guesssize(buffer, len, 16384, outlen);
+}
+
+STBIDEF char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header)
+{
+    stbi__zbuf a;
+    char *p = (char *)stbi__malloc(initial_size);
+    if (p == NULL)
+        return NULL;
+    a.zbuffer = (stbi_uc *)buffer;
+    a.zbuffer_end = (stbi_uc *)buffer + len;
+    if (stbi__do_zlib(&a, p, initial_size, 1, parse_header))
+    {
+        if (outlen)
+            *outlen = (int)(a.zout - a.zout_start);
+        return a.zout_start;
+    }
+    else
+    {
+        STBI_FREE(a.zout_start);
+        return NULL;
+    }
+}
+
+STBIDEF int stbi_zlib_decode_buffer(char *obuffer, int olen, char const *ibuffer, int ilen)
+{
+    stbi__zbuf a;
+    a.zbuffer = (stbi_uc *)ibuffer;
+    a.zbuffer_end = (stbi_uc *)ibuffer + ilen;
+    if (stbi__do_zlib(&a, obuffer, olen, 0, 1))
+        return (int)(a.zout - a.zout_start);
+    else
+        return -1;
+}
+
+STBIDEF char *stbi_zlib_decode_noheader_malloc(char const *buffer, int len, int *outlen)
+{
+    stbi__zbuf a;
+    char *p = (char *)stbi__malloc(16384);
+    if (p == NULL)
+        return NULL;
+    a.zbuffer = (stbi_uc *)buffer;
+    a.zbuffer_end = (stbi_uc *)buffer + len;
+    if (stbi__do_zlib(&a, p, 16384, 1, 0))
+    {
+        if (outlen)
+            *outlen = (int)(a.zout - a.zout_start);
+        return a.zout_start;
+    }
+    else
+    {
+        STBI_FREE(a.zout_start);
+        return NULL;
+    }
+}
+
+STBIDEF int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen)
+{
+    stbi__zbuf a;
+    a.zbuffer = (stbi_uc *)ibuffer;
+    a.zbuffer_end = (stbi_uc *)ibuffer + ilen;
+    if (stbi__do_zlib(&a, obuffer, olen, 0, 0))
+        return (int)(a.zout - a.zout_start);
+    else
+        return -1;
+}
+#endif
+
+// public domain "baseline" PNG decoder   v0.10  Sean Barrett 2006-11-18
+//    simple implementation
+//      - only 8-bit samples
+//      - no CRC checking
+//      - allocates lots of intermediate memory
+//        - avoids problem of streaming data between subsystems
+//        - avoids explicit window management
+//    performance
+//      - uses stb_zlib, a PD zlib implementation with fast huffman decoding
+
+#ifndef STBI_NO_PNG
+typedef struct
+{
+    stbi__uint32 length;
+    stbi__uint32 type;
+} stbi__pngchunk;
+
+static stbi__pngchunk stbi__get_chunk_header(stbi__context *s)
+{
+    stbi__pngchunk c;
+    c.length = stbi__get32be(s);
+    c.type = stbi__get32be(s);
+    return c;
+}
+
+static int stbi__check_png_header(stbi__context *s)
+{
+    static const stbi_uc png_sig[8] = {137, 80, 78, 71, 13, 10, 26, 10};
+    int i;
+    for (i = 0; i < 8; ++i)
+        if (stbi__get8(s) != png_sig[i])
+            return stbi__err("bad png sig", "Not a PNG");
+    return 1;
+}
+
+typedef struct
+{
+    stbi__context *s;
+    stbi_uc *idata, *expanded, *out;
+    int depth;
+} stbi__png;
+
+enum
+{
+    STBI__F_none = 0,
+    STBI__F_sub = 1,
+    STBI__F_up = 2,
+    STBI__F_avg = 3,
+    STBI__F_paeth = 4,
+    // synthetic filters used for first scanline to avoid needing a dummy row of 0s
+    STBI__F_avg_first,
+    STBI__F_paeth_first
+};
+
+static stbi_uc first_row_filter[5] =
+    {
+        STBI__F_none,
+        STBI__F_sub,
+        STBI__F_none,
+        STBI__F_avg_first,
+        STBI__F_paeth_first};
+
+static int stbi__paeth(int a, int b, int c)
+{
+    int p = a + b - c;
+    int pa = abs(p - a);
+    int pb = abs(p - b);
+    int pc = abs(p - c);
+    if (pa <= pb && pa <= pc)
+        return a;
+    if (pb <= pc)
+        return b;
+    return c;
+}
+
+static const stbi_uc stbi__depth_scale_table[9] = {0, 0xff, 0x55, 0, 0x11, 0, 0, 0, 0x01};
+
+// create the png data from post-deflated data
+static int stbi__create_png_image_raw(stbi__png *a, stbi_uc *raw, stbi__uint32 raw_len, int out_n, stbi__uint32 x, stbi__uint32 y, int depth, int color)
+{
+    int bytes = (depth == 16 ? 2 : 1);
+    stbi__context *s = a->s;
+    stbi__uint32 i, j, stride = x * out_n * bytes;
+    stbi__uint32 img_len, img_width_bytes;
+    int k;
+    int img_n = s->img_n; // copy it into a local for later
+
+    int output_bytes = out_n * bytes;
+    int filter_bytes = img_n * bytes;
+    int width = x;
+
+    STBI_ASSERT(out_n == s->img_n || out_n == s->img_n + 1);
+    a->out = (stbi_uc *)stbi__malloc_mad3(x, y, output_bytes, 0); // extra bytes to write off the end into
+    if (!a->out)
+        return stbi__err("outofmem", "Out of memory");
+
+    if (!stbi__mad3sizes_valid(img_n, x, depth, 7))
+        return stbi__err("too large", "Corrupt PNG");
+    img_width_bytes = (((img_n * x * depth) + 7) >> 3);
+    img_len = (img_width_bytes + 1) * y;
+
+    // we used to check for exact match between raw_len and img_len on non-interlaced PNGs,
+    // but issue #276 reported a PNG in the wild that had extra data at the end (all zeros),
+    // so just check for raw_len < img_len always.
+    if (raw_len < img_len)
+        return stbi__err("not enough pixels", "Corrupt PNG");
+
+    for (j = 0; j < y; ++j)
+    {
+        stbi_uc *cur = a->out + stride * j;
+        stbi_uc *prior;
+        int filter = *raw++;
+
+        if (filter > 4)
+            return stbi__err("invalid filter", "Corrupt PNG");
+
+        if (depth < 8)
+        {
+            if (img_width_bytes > x)
+                return stbi__err("invalid width", "Corrupt PNG");
+            cur += x * out_n - img_width_bytes; // store output to the rightmost img_len bytes, so we can decode in place
+            filter_bytes = 1;
+            width = img_width_bytes;
+        }
+        prior = cur - stride; // bugfix: need to compute this after 'cur +=' computation above
+
+        // if first row, use special filter that doesn't sample previous row
+        if (j == 0)
+            filter = first_row_filter[filter];
+
+        // handle first byte explicitly
+        for (k = 0; k < filter_bytes; ++k)
+        {
+            switch (filter)
+            {
+            case STBI__F_none:
+                cur[k] = raw[k];
+                break;
+            case STBI__F_sub:
+                cur[k] = raw[k];
+                break;
+            case STBI__F_up:
+                cur[k] = STBI__BYTECAST(raw[k] + prior[k]);
+                break;
+            case STBI__F_avg:
+                cur[k] = STBI__BYTECAST(raw[k] + (prior[k] >> 1));
+                break;
+            case STBI__F_paeth:
+                cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(0, prior[k], 0));
+                break;
+            case STBI__F_avg_first:
+                cur[k] = raw[k];
+                break;
+            case STBI__F_paeth_first:
+                cur[k] = raw[k];
+                break;
+            }
+        }
+
+        if (depth == 8)
+        {
+            if (img_n != out_n)
+                cur[img_n] = 255; // first pixel
+            raw += img_n;
+            cur += out_n;
+            prior += out_n;
+        }
+        else if (depth == 16)
+        {
+            if (img_n != out_n)
+            {
+                cur[filter_bytes] = 255;     // first pixel top byte
+                cur[filter_bytes + 1] = 255; // first pixel bottom byte
+            }
+            raw += filter_bytes;
+            cur += output_bytes;
+            prior += output_bytes;
+        }
+        else
+        {
+            raw += 1;
+            cur += 1;
+            prior += 1;
+        }
+
+        // this is a little gross, so that we don't switch per-pixel or per-component
+        if (depth < 8 || img_n == out_n)
+        {
+            int nk = (width - 1) * filter_bytes;
+#define STBI__CASE(f) \
+    case f:           \
+        for (k = 0; k < nk; ++k)
+            switch (filter)
+            {
+            // "none" filter turns into a memcpy here; make that explicit.
+            case STBI__F_none:
+                memcpy(cur, raw, nk);
+                break;
+                STBI__CASE(STBI__F_sub) { cur[k] = STBI__BYTECAST(raw[k] + cur[k - filter_bytes]); }
+                break;
+                STBI__CASE(STBI__F_up) { cur[k] = STBI__BYTECAST(raw[k] + prior[k]); }
+                break;
+                STBI__CASE(STBI__F_avg) { cur[k] = STBI__BYTECAST(raw[k] + ((prior[k] + cur[k - filter_bytes]) >> 1)); }
+                break;
+                STBI__CASE(STBI__F_paeth) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k - filter_bytes], prior[k], prior[k - filter_bytes])); }
+                break;
+                STBI__CASE(STBI__F_avg_first) { cur[k] = STBI__BYTECAST(raw[k] + (cur[k - filter_bytes] >> 1)); }
+                break;
+                STBI__CASE(STBI__F_paeth_first) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k - filter_bytes], 0, 0)); }
+                break;
+            }
+#undef STBI__CASE
+            raw += nk;
+        }
+        else
+        {
+            STBI_ASSERT(img_n + 1 == out_n);
+#define STBI__CASE(f)                                                                                                          \
+    case f:                                                                                                                    \
+        for (i = x - 1; i >= 1; --i, cur[filter_bytes] = 255, raw += filter_bytes, cur += output_bytes, prior += output_bytes) \
+            for (k = 0; k < filter_bytes; ++k)
+            switch (filter)
+            {
+                STBI__CASE(STBI__F_none) { cur[k] = raw[k]; }
+                break;
+                STBI__CASE(STBI__F_sub) { cur[k] = STBI__BYTECAST(raw[k] + cur[k - output_bytes]); }
+                break;
+                STBI__CASE(STBI__F_up) { cur[k] = STBI__BYTECAST(raw[k] + prior[k]); }
+                break;
+                STBI__CASE(STBI__F_avg) { cur[k] = STBI__BYTECAST(raw[k] + ((prior[k] + cur[k - output_bytes]) >> 1)); }
+                break;
+                STBI__CASE(STBI__F_paeth) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k - output_bytes], prior[k], prior[k - output_bytes])); }
+                break;
+                STBI__CASE(STBI__F_avg_first) { cur[k] = STBI__BYTECAST(raw[k] + (cur[k - output_bytes] >> 1)); }
+                break;
+                STBI__CASE(STBI__F_paeth_first) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k - output_bytes], 0, 0)); }
+                break;
+            }
+#undef STBI__CASE
+
+            // the loop above sets the high byte of the pixels' alpha, but for
+            // 16 bit png files we also need the low byte set. we'll do that here.
+            if (depth == 16)
+            {
+                cur = a->out + stride * j; // start at the beginning of the row again
+                for (i = 0; i < x; ++i, cur += output_bytes)
+                {
+                    cur[filter_bytes + 1] = 255;
+                }
+            }
+        }
+    }
+
+    // we make a separate pass to expand bits to pixels; for performance,
+    // this could run two scanlines behind the above code, so it won't
+    // intefere with filtering but will still be in the cache.
+    if (depth < 8)
+    {
+        for (j = 0; j < y; ++j)
+        {
+            stbi_uc *cur = a->out + stride * j;
+            stbi_uc *in_ = a->out + stride * j + x * out_n - img_width_bytes;
+            // unpack 1/2/4-bit into a 8-bit buffer. allows us to keep the common 8-bit path optimal at minimal cost for 1/2/4-bit
+            // png guarante byte alignment, if width is not multiple of 8/4/2 we'll decode dummy trailing data that will be skipped in the later loop
+            stbi_uc scale = (color == 0) ? stbi__depth_scale_table[depth] : 1; // scale grayscale values to 0..255 range
+
+            // note that the final byte might overshoot and write more data than desired.
+            // we can allocate enough data that this never writes out of memory, but it
+            // could also overwrite the next scanline. can it overwrite non-empty data
+            // on the next scanline? yes, consider 1-pixel-wide scanlines with 1-bit-per-pixel.
+            // so we need to explicitly clamp the final ones
+
+            if (depth == 4)
+            {
+                for (k = x * img_n; k >= 2; k -= 2, ++in_)
+                {
+                    *cur++ = scale * ((*in_ >> 4));
+                    *cur++ = scale * ((*in_) & 0x0f);
+                }
+                if (k > 0)
+                    *cur++ = scale * ((*in_ >> 4));
+            }
+            else if (depth == 2)
+            {
+                for (k = x * img_n; k >= 4; k -= 4, ++in_)
+                {
+                    *cur++ = scale * ((*in_ >> 6));
+                    *cur++ = scale * ((*in_ >> 4) & 0x03);
+                    *cur++ = scale * ((*in_ >> 2) & 0x03);
+                    *cur++ = scale * ((*in_) & 0x03);
+                }
+                if (k > 0)
+                    *cur++ = scale * ((*in_ >> 6));
+                if (k > 1)
+                    *cur++ = scale * ((*in_ >> 4) & 0x03);
+                if (k > 2)
+                    *cur++ = scale * ((*in_ >> 2) & 0x03);
+            }
+            else if (depth == 1)
+            {
+                for (k = x * img_n; k >= 8; k -= 8, ++in_)
+                {
+                    *cur++ = scale * ((*in_ >> 7));
+                    *cur++ = scale * ((*in_ >> 6) & 0x01);
+                    *cur++ = scale * ((*in_ >> 5) & 0x01);
+                    *cur++ = scale * ((*in_ >> 4) & 0x01);
+                    *cur++ = scale * ((*in_ >> 3) & 0x01);
+                    *cur++ = scale * ((*in_ >> 2) & 0x01);
+                    *cur++ = scale * ((*in_ >> 1) & 0x01);
+                    *cur++ = scale * ((*in_) & 0x01);
+                }
+                if (k > 0)
+                    *cur++ = scale * ((*in_ >> 7));
+                if (k > 1)
+                    *cur++ = scale * ((*in_ >> 6) & 0x01);
+                if (k > 2)
+                    *cur++ = scale * ((*in_ >> 5) & 0x01);
+                if (k > 3)
+                    *cur++ = scale * ((*in_ >> 4) & 0x01);
+                if (k > 4)
+                    *cur++ = scale * ((*in_ >> 3) & 0x01);
+                if (k > 5)
+                    *cur++ = scale * ((*in_ >> 2) & 0x01);
+                if (k > 6)
+                    *cur++ = scale * ((*in_ >> 1) & 0x01);
+            }
+            if (img_n != out_n)
+            {
+                int q;
+                // insert alpha = 255
+                cur = a->out + stride * j;
+                if (img_n == 1)
+                {
+                    for (q = x - 1; q >= 0; --q)
+                    {
+                        cur[q * 2 + 1] = 255;
+                        cur[q * 2 + 0] = cur[q];
+                    }
+                }
+                else
+                {
+                    STBI_ASSERT(img_n == 3);
+                    for (q = x - 1; q >= 0; --q)
+                    {
+                        cur[q * 4 + 3] = 255;
+                        cur[q * 4 + 2] = cur[q * 3 + 2];
+                        cur[q * 4 + 1] = cur[q * 3 + 1];
+                        cur[q * 4 + 0] = cur[q * 3 + 0];
+                    }
+                }
+            }
+        }
+    }
+    else if (depth == 16)
+    {
+        // force the image data from big-endian to platform-native.
+        // this is done in a separate pass due to the decoding relying
+        // on the data being untouched, but could probably be done
+        // per-line during decode if care is taken.
+        stbi_uc *cur = a->out;
+        stbi__uint16 *cur16 = (stbi__uint16 *)cur;
+
+        for (i = 0; i < x * y * out_n; ++i, cur16++, cur += 2)
+        {
+            *cur16 = (cur[0] << 8) | cur[1];
+        }
+    }
+
+    return 1;
+}
+
+static int stbi__create_png_image(stbi__png *a, stbi_uc *image_data, stbi__uint32 image_data_len, int out_n, int depth, int color, int interlaced)
+{
+    int bytes = (depth == 16 ? 2 : 1);
+    int out_bytes = out_n * bytes;
+    stbi_uc *final;
+    int p;
+    if (!interlaced)
+        return stbi__create_png_image_raw(a, image_data, image_data_len, out_n, a->s->img_x, a->s->img_y, depth, color);
+
+    // de-interlacing
+    final = (stbi_uc *)stbi__malloc_mad3(a->s->img_x, a->s->img_y, out_bytes, 0);
+    if (!final)
+        return stbi__err("outofmem", "Out of memory");
+    for (p = 0; p < 7; ++p)
+    {
+        int xorig[] = {0, 4, 0, 2, 0, 1, 0};
+        int yorig[] = {0, 0, 4, 0, 2, 0, 1};
+        int xspc[] = {8, 8, 4, 4, 2, 2, 1};
+        int yspc[] = {8, 8, 8, 4, 4, 2, 2};
+        int i, j, x, y;
+        // pass1_x[4] = 0, pass1_x[5] = 1, pass1_x[12] = 1
+        x = (a->s->img_x - xorig[p] + xspc[p] - 1) / xspc[p];
+        y = (a->s->img_y - yorig[p] + yspc[p] - 1) / yspc[p];
+        if (x && y)
+        {
+            stbi__uint32 img_len = ((((a->s->img_n * x * depth) + 7) >> 3) + 1) * y;
+            if (!stbi__create_png_image_raw(a, image_data, image_data_len, out_n, x, y, depth, color))
+            {
+                STBI_FREE(final);
+                return 0;
+            }
+            for (j = 0; j < y; ++j)
+            {
+                for (i = 0; i < x; ++i)
+                {
+                    int out_y = j * yspc[p] + yorig[p];
+                    int out_x = i * xspc[p] + xorig[p];
+                    memcpy(final + out_y * a->s->img_x * out_bytes + out_x * out_bytes,
+                           a->out + (j * x + i) * out_bytes, out_bytes);
+                }
+            }
+            STBI_FREE(a->out);
+            image_data += img_len;
+            image_data_len -= img_len;
+        }
+    }
+    a->out = final;
+
+    return 1;
+}
+
+static int stbi__compute_transparency(stbi__png *z, stbi_uc tc[3], int out_n)
+{
+    stbi__context *s = z->s;
+    stbi__uint32 i, pixel_count = s->img_x * s->img_y;
+    stbi_uc *p = z->out;
+
+    // compute color-based transparency, assuming we've
+    // already got 255 as the alpha value in the output
+    STBI_ASSERT(out_n == 2 || out_n == 4);
+
+    if (out_n == 2)
+    {
+        for (i = 0; i < pixel_count; ++i)
+        {
+            p[1] = (p[0] == tc[0] ? 0 : 255);
+            p += 2;
+        }
+    }
+    else
+    {
+        for (i = 0; i < pixel_count; ++i)
+        {
+            if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2])
+                p[3] = 0;
+            p += 4;
+        }
+    }
+    return 1;
+}
+
+static int stbi__compute_transparency16(stbi__png *z, stbi__uint16 tc[3], int out_n)
+{
+    stbi__context *s = z->s;
+    stbi__uint32 i, pixel_count = s->img_x * s->img_y;
+    stbi__uint16 *p = (stbi__uint16 *)z->out;
+
+    // compute color-based transparency, assuming we've
+    // already got 65535 as the alpha value in the output
+    STBI_ASSERT(out_n == 2 || out_n == 4);
+
+    if (out_n == 2)
+    {
+        for (i = 0; i < pixel_count; ++i)
+        {
+            p[1] = (p[0] == tc[0] ? 0 : 65535);
+            p += 2;
+        }
+    }
+    else
+    {
+        for (i = 0; i < pixel_count; ++i)
+        {
+            if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2])
+                p[3] = 0;
+            p += 4;
+        }
+    }
+    return 1;
+}
+
+static int stbi__expand_png_palette(stbi__png *a, stbi_uc *palette, int len, int pal_img_n)
+{
+    stbi__uint32 i, pixel_count = a->s->img_x * a->s->img_y;
+    stbi_uc *p, *temp_out, *orig = a->out;
+
+    p = (stbi_uc *)stbi__malloc_mad2(pixel_count, pal_img_n, 0);
+    if (p == NULL)
+        return stbi__err("outofmem", "Out of memory");
+
+    // between here and free(out) below, exitting would leak
+    temp_out = p;
+
+    if (pal_img_n == 3)
+    {
+        for (i = 0; i < pixel_count; ++i)
+        {
+            int n = orig[i] * 4;
+            p[0] = palette[n];
+            p[1] = palette[n + 1];
+            p[2] = palette[n + 2];
+            p += 3;
+        }
+    }
+    else
+    {
+        for (i = 0; i < pixel_count; ++i)
+        {
+            int n = orig[i] * 4;
+            p[0] = palette[n];
+            p[1] = palette[n + 1];
+            p[2] = palette[n + 2];
+            p[3] = palette[n + 3];
+            p += 4;
+        }
+    }
+    STBI_FREE(a->out);
+    a->out = temp_out;
+
+    STBI_NOTUSED(len);
+
+    return 1;
+}
+
+static int stbi__unpremultiply_on_load_global = 0;
+static int stbi__de_iphone_flag_global = 0;
+
+STBIDEF void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply)
+{
+    stbi__unpremultiply_on_load_global = flag_true_if_should_unpremultiply;
+}
+
+STBIDEF void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert)
+{
+    stbi__de_iphone_flag_global = flag_true_if_should_convert;
+}
+
+#ifndef STBI_THREAD_LOCAL
+#define stbi__unpremultiply_on_load stbi__unpremultiply_on_load_global
+#define stbi__de_iphone_flag stbi__de_iphone_flag_global
+#else
+static STBI_THREAD_LOCAL int stbi__unpremultiply_on_load_local, stbi__unpremultiply_on_load_set;
+static STBI_THREAD_LOCAL int stbi__de_iphone_flag_local, stbi__de_iphone_flag_set;
+
+STBIDEF void stbi_set_unpremultiply_on_load_thread(int flag_true_if_should_unpremultiply)
+{
+    stbi__unpremultiply_on_load_local = flag_true_if_should_unpremultiply;
+    stbi__unpremultiply_on_load_set = 1;
+}
+
+STBIDEF void stbi_convert_iphone_png_to_rgb_thread(int flag_true_if_should_convert)
+{
+    stbi__de_iphone_flag_local = flag_true_if_should_convert;
+    stbi__de_iphone_flag_set = 1;
+}
+
+#define stbi__unpremultiply_on_load (stbi__unpremultiply_on_load_set         \
+                                         ? stbi__unpremultiply_on_load_local \
+                                         : stbi__unpremultiply_on_load_global)
+#define stbi__de_iphone_flag (stbi__de_iphone_flag_set         \
+                                  ? stbi__de_iphone_flag_local \
+                                  : stbi__de_iphone_flag_global)
+#endif // STBI_THREAD_LOCAL
+
+static void stbi__de_iphone(stbi__png *z)
+{
+    stbi__context *s = z->s;
+    stbi__uint32 i, pixel_count = s->img_x * s->img_y;
+    stbi_uc *p = z->out;
+
+    if (s->img_out_n == 3)
+    { // convert bgr to rgb
+        for (i = 0; i < pixel_count; ++i)
+        {
+            stbi_uc t = p[0];
+            p[0] = p[2];
+            p[2] = t;
+            p += 3;
+        }
+    }
+    else
+    {
+        STBI_ASSERT(s->img_out_n == 4);
+        if (stbi__unpremultiply_on_load)
+        {
+            // convert bgr to rgb and unpremultiply
+            for (i = 0; i < pixel_count; ++i)
+            {
+                stbi_uc a = p[3];
+                stbi_uc t = p[0];
+                if (a)
+                {
+                    stbi_uc half = a / 2;
+                    p[0] = (p[2] * 255 + half) / a;
+                    p[1] = (p[1] * 255 + half) / a;
+                    p[2] = (t * 255 + half) / a;
+                }
+                else
+                {
+                    p[0] = p[2];
+                    p[2] = t;
+                }
+                p += 4;
+            }
+        }
+        else
+        {
+            // convert bgr to rgb
+            for (i = 0; i < pixel_count; ++i)
+            {
+                stbi_uc t = p[0];
+                p[0] = p[2];
+                p[2] = t;
+                p += 4;
+            }
+        }
+    }
+}
+
+#define STBI__PNG_TYPE(a, b, c, d) (((unsigned)(a) << 24) + ((unsigned)(b) << 16) + ((unsigned)(c) << 8) + (unsigned)(d))
+
+static int stbi__parse_png_file(stbi__png *z, int scan, int req_comp)
+{
+    stbi_uc palette[1024], pal_img_n = 0;
+    stbi_uc has_trans = 0, tc[3] = {0};
+    stbi__uint16 tc16[3];
+    stbi__uint32 ioff = 0, idata_limit = 0, i, pal_len = 0;
+    int first = 1, k, interlace = 0, color = 0, is_iphone = 0;
+    stbi__context *s = z->s;
+
+    z->expanded = NULL;
+    z->idata = NULL;
+    z->out = NULL;
+
+    if (!stbi__check_png_header(s))
+        return 0;
+
+    if (scan == STBI__SCAN_type)
+        return 1;
+
+    for (;;)
+    {
+        stbi__pngchunk c = stbi__get_chunk_header(s);
+        switch (c.type)
+        {
+        case STBI__PNG_TYPE('C', 'g', 'B', 'I'):
+            is_iphone = 1;
+            stbi__skip(s, c.length);
+            break;
+        case STBI__PNG_TYPE('I', 'H', 'D', 'R'):
+        {
+            int comp, filter;
+            if (!first)
+                return stbi__err("multiple IHDR", "Corrupt PNG");
+            first = 0;
+            if (c.length != 13)
+                return stbi__err("bad IHDR len", "Corrupt PNG");
+            s->img_x = stbi__get32be(s);
+            s->img_y = stbi__get32be(s);
+            if (s->img_y > STBI_MAX_DIMENSIONS)
+                return stbi__err("too large", "Very large image (corrupt?)");
+            if (s->img_x > STBI_MAX_DIMENSIONS)
+                return stbi__err("too large", "Very large image (corrupt?)");
+            z->depth = stbi__get8(s);
+            if (z->depth != 1 && z->depth != 2 && z->depth != 4 && z->depth != 8 && z->depth != 16)
+                return stbi__err("1/2/4/8/16-bit only", "PNG not supported: 1/2/4/8/16-bit only");
+            color = stbi__get8(s);
+            if (color > 6)
+                return stbi__err("bad ctype", "Corrupt PNG");
+            if (color == 3 && z->depth == 16)
+                return stbi__err("bad ctype", "Corrupt PNG");
+            if (color == 3)
+                pal_img_n = 3;
+            else if (color & 1)
+                return stbi__err("bad ctype", "Corrupt PNG");
+            comp = stbi__get8(s);
+            if (comp)
+                return stbi__err("bad comp method", "Corrupt PNG");
+            filter = stbi__get8(s);
+            if (filter)
+                return stbi__err("bad filter method", "Corrupt PNG");
+            interlace = stbi__get8(s);
+            if (interlace > 1)
+                return stbi__err("bad interlace method", "Corrupt PNG");
+            if (!s->img_x || !s->img_y)
+                return stbi__err("0-pixel image", "Corrupt PNG");
+            if (!pal_img_n)
+            {
+                s->img_n = (color & 2 ? 3 : 1) + (color & 4 ? 1 : 0);
+                if ((1 << 30) / s->img_x / s->img_n < s->img_y)
+                    return stbi__err("too large", "Image too large to decode");
+            }
+            else
+            {
+                // if paletted, then pal_n is our final components, and
+                // img_n is # components to decompress/filter.
+                s->img_n = 1;
+                if ((1 << 30) / s->img_x / 4 < s->img_y)
+                    return stbi__err("too large", "Corrupt PNG");
+            }
+            // even with SCAN_header, have to scan to see if we have a tRNS
+            break;
+        }
+
+        case STBI__PNG_TYPE('P', 'L', 'T', 'E'):
+        {
+            if (first)
+                return stbi__err("first not IHDR", "Corrupt PNG");
+            if (c.length > 256 * 3)
+                return stbi__err("invalid PLTE", "Corrupt PNG");
+            pal_len = c.length / 3;
+            if (pal_len * 3 != c.length)
+                return stbi__err("invalid PLTE", "Corrupt PNG");
+            for (i = 0; i < pal_len; ++i)
+            {
+                palette[i * 4 + 0] = stbi__get8(s);
+                palette[i * 4 + 1] = stbi__get8(s);
+                palette[i * 4 + 2] = stbi__get8(s);
+                palette[i * 4 + 3] = 255;
+            }
+            break;
+        }
+
+        case STBI__PNG_TYPE('t', 'R', 'N', 'S'):
+        {
+            if (first)
+                return stbi__err("first not IHDR", "Corrupt PNG");
+            if (z->idata)
+                return stbi__err("tRNS after IDAT", "Corrupt PNG");
+            if (pal_img_n)
+            {
+                if (scan == STBI__SCAN_header)
+                {
+                    s->img_n = 4;
+                    return 1;
+                }
+                if (pal_len == 0)
+                    return stbi__err("tRNS before PLTE", "Corrupt PNG");
+                if (c.length > pal_len)
+                    return stbi__err("bad tRNS len", "Corrupt PNG");
+                pal_img_n = 4;
+                for (i = 0; i < c.length; ++i)
+                    palette[i * 4 + 3] = stbi__get8(s);
+            }
+            else
+            {
+                if (!(s->img_n & 1))
+                    return stbi__err("tRNS with alpha", "Corrupt PNG");
+                if (c.length != (stbi__uint32)s->img_n * 2)
+                    return stbi__err("bad tRNS len", "Corrupt PNG");
+                has_trans = 1;
+                // non-paletted with tRNS = constant alpha. if header-scanning, we can stop now.
+                if (scan == STBI__SCAN_header)
+                {
+                    ++s->img_n;
+                    return 1;
+                }
+                if (z->depth == 16)
+                {
+                    for (k = 0; k < s->img_n; ++k)
+                        tc16[k] = (stbi__uint16)stbi__get16be(s); // copy the values as-is
+                }
+                else
+                {
+                    for (k = 0; k < s->img_n; ++k)
+                        tc[k] = (stbi_uc)(stbi__get16be(s) & 255) * stbi__depth_scale_table[z->depth]; // non 8-bit images will be larger
+                }
+            }
+            break;
+        }
+
+        case STBI__PNG_TYPE('I', 'D', 'A', 'T'):
+        {
+            if (first)
+                return stbi__err("first not IHDR", "Corrupt PNG");
+            if (pal_img_n && !pal_len)
+                return stbi__err("no PLTE", "Corrupt PNG");
+            if (scan == STBI__SCAN_header)
+            {
+                // header scan definitely stops at first IDAT
+                if (pal_img_n)
+                    s->img_n = pal_img_n;
+                return 1;
+            }
+            if (c.length > (1u << 30))
+                return stbi__err("IDAT size limit", "IDAT section larger than 2^30 bytes");
+            if ((int)(ioff + c.length) < (int)ioff)
+                return 0;
+            if (ioff + c.length > idata_limit)
+            {
+                stbi__uint32 idata_limit_old = idata_limit;
+                stbi_uc *p;
+                if (idata_limit == 0)
+                    idata_limit = c.length > 4096 ? c.length : 4096;
+                while (ioff + c.length > idata_limit)
+                    idata_limit *= 2;
+                STBI_NOTUSED(idata_limit_old);
+                p = (stbi_uc *)STBI_REALLOC_SIZED(z->idata, idata_limit_old, idata_limit);
+                if (p == NULL)
+                    return stbi__err("outofmem", "Out of memory");
+                z->idata = p;
+            }
+            if (!stbi__getn(s, z->idata + ioff, c.length))
+                return stbi__err("outofdata", "Corrupt PNG");
+            ioff += c.length;
+            break;
+        }
+
+        case STBI__PNG_TYPE('I', 'E', 'N', 'D'):
+        {
+            stbi__uint32 raw_len, bpl;
+            if (first)
+                return stbi__err("first not IHDR", "Corrupt PNG");
+            if (scan != STBI__SCAN_load)
+                return 1;
+            if (z->idata == NULL)
+                return stbi__err("no IDAT", "Corrupt PNG");
+            // initial guess for decoded data size to avoid unnecessary reallocs
+            bpl = (s->img_x * z->depth + 7) / 8; // bytes per line, per component
+            raw_len = bpl * s->img_y * s->img_n /* pixels */ + s->img_y /* filter mode per row */;
+            z->expanded = (stbi_uc *)stbi_zlib_decode_malloc_guesssize_headerflag((char *)z->idata, ioff, raw_len, (int *)&raw_len, !is_iphone);
+            if (z->expanded == NULL)
+                return 0; // zlib should set error
+            STBI_FREE(z->idata);
+            z->idata = NULL;
+            if ((req_comp == s->img_n + 1 && req_comp != 3 && !pal_img_n) || has_trans)
+                s->img_out_n = s->img_n + 1;
+            else
+                s->img_out_n = s->img_n;
+            if (!stbi__create_png_image(z, z->expanded, raw_len, s->img_out_n, z->depth, color, interlace))
+                return 0;
+            if (has_trans)
+            {
+                if (z->depth == 16)
+                {
+                    if (!stbi__compute_transparency16(z, tc16, s->img_out_n))
+                        return 0;
+                }
+                else
+                {
+                    if (!stbi__compute_transparency(z, tc, s->img_out_n))
+                        return 0;
+                }
+            }
+            if (is_iphone && stbi__de_iphone_flag && s->img_out_n > 2)
+                stbi__de_iphone(z);
+            if (pal_img_n)
+            {
+                // pal_img_n == 3 or 4
+                s->img_n = pal_img_n; // record the actual colors we had
+                s->img_out_n = pal_img_n;
+                if (req_comp >= 3)
+                    s->img_out_n = req_comp;
+                if (!stbi__expand_png_palette(z, palette, pal_len, s->img_out_n))
+                    return 0;
+            }
+            else if (has_trans)
+            {
+                // non-paletted image with tRNS -> source image has (constant) alpha
+                ++s->img_n;
+            }
+            STBI_FREE(z->expanded);
+            z->expanded = NULL;
+            // end of PNG chunk, read and skip CRC
+            stbi__get32be(s);
+            return 1;
+        }
+
+        default:
+            // if critical, fail
+            if (first)
+                return stbi__err("first not IHDR", "Corrupt PNG");
+            if ((c.type & (1 << 29)) == 0)
+            {
+#ifndef STBI_NO_FAILURE_STRINGS
+                // not threadsafe
+                static char invalid_chunk[] = "XXXX PNG chunk not known";
+                invalid_chunk[0] = STBI__BYTECAST(c.type >> 24);
+                invalid_chunk[1] = STBI__BYTECAST(c.type >> 16);
+                invalid_chunk[2] = STBI__BYTECAST(c.type >> 8);
+                invalid_chunk[3] = STBI__BYTECAST(c.type >> 0);
+#endif
+                return stbi__err(invalid_chunk, "PNG not supported: unknown PNG chunk type");
+            }
+            stbi__skip(s, c.length);
+            break;
+        }
+        // end of PNG chunk, read and skip CRC
+        stbi__get32be(s);
+    }
+}
+
+static void *stbi__do_png(stbi__png *p, int *x, int *y, int *n, int req_comp, stbi__result_info *ri)
+{
+    void *result = NULL;
+    if (req_comp < 0 || req_comp > 4)
+        return stbi__errpuc("bad req_comp", "Internal error");
+    if (stbi__parse_png_file(p, STBI__SCAN_load, req_comp))
+    {
+        if (p->depth <= 8)
+            ri->bits_per_channel = 8;
+        else if (p->depth == 16)
+            ri->bits_per_channel = 16;
+        else
+            return stbi__errpuc("bad bits_per_channel", "PNG not supported: unsupported color depth");
+        result = p->out;
+        p->out = NULL;
+        if (req_comp && req_comp != p->s->img_out_n)
+        {
+            if (ri->bits_per_channel == 8)
+                result = stbi__convert_format((unsigned char *)result, p->s->img_out_n, req_comp, p->s->img_x, p->s->img_y);
+            else
+                result = stbi__convert_format16((stbi__uint16 *)result, p->s->img_out_n, req_comp, p->s->img_x, p->s->img_y);
+            p->s->img_out_n = req_comp;
+            if (result == NULL)
+                return result;
+        }
+        *x = p->s->img_x;
+        *y = p->s->img_y;
+        if (n)
+            *n = p->s->img_n;
+    }
+    STBI_FREE(p->out);
+    p->out = NULL;
+    STBI_FREE(p->expanded);
+    p->expanded = NULL;
+    STBI_FREE(p->idata);
+    p->idata = NULL;
+
+    return result;
+}
+
+static void *stbi__png_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    stbi__png p;
+    p.s = s;
+    return stbi__do_png(&p, x, y, comp, req_comp, ri);
+}
+
+static int stbi__png_test(stbi__context *s)
+{
+    int r;
+    r = stbi__check_png_header(s);
+    stbi__rewind(s);
+    return r;
+}
+
+static int stbi__png_info_raw(stbi__png *p, int *x, int *y, int *comp)
+{
+    if (!stbi__parse_png_file(p, STBI__SCAN_header, 0))
+    {
+        stbi__rewind(p->s);
+        return 0;
+    }
+    if (x)
+        *x = p->s->img_x;
+    if (y)
+        *y = p->s->img_y;
+    if (comp)
+        *comp = p->s->img_n;
+    return 1;
+}
+
+static int stbi__png_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    stbi__png p;
+    p.s = s;
+    return stbi__png_info_raw(&p, x, y, comp);
+}
+
+static int stbi__png_is16(stbi__context *s)
+{
+    stbi__png p;
+    p.s = s;
+    if (!stbi__png_info_raw(&p, NULL, NULL, NULL))
+        return 0;
+    if (p.depth != 16)
+    {
+        stbi__rewind(p.s);
+        return 0;
+    }
+    return 1;
+}
+#endif
+
+// Microsoft/Windows BMP image
+
+#ifndef STBI_NO_BMP
+static int stbi__bmp_test_raw(stbi__context *s)
+{
+    int r;
+    int sz;
+    if (stbi__get8(s) != 'B')
+        return 0;
+    if (stbi__get8(s) != 'M')
+        return 0;
+    stbi__get32le(s); // discard filesize
+    stbi__get16le(s); // discard reserved
+    stbi__get16le(s); // discard reserved
+    stbi__get32le(s); // discard data offset
+    sz = stbi__get32le(s);
+    r = (sz == 12 || sz == 40 || sz == 56 || sz == 108 || sz == 124);
+    return r;
+}
+
+static int stbi__bmp_test(stbi__context *s)
+{
+    int r = stbi__bmp_test_raw(s);
+    stbi__rewind(s);
+    return r;
+}
+
+// returns 0..31 for the highest set bit
+static int stbi__high_bit(unsigned int z)
+{
+    int n = 0;
+    if (z == 0)
+        return -1;
+    if (z >= 0x10000)
+    {
+        n += 16;
+        z >>= 16;
+    }
+    if (z >= 0x00100)
+    {
+        n += 8;
+        z >>= 8;
+    }
+    if (z >= 0x00010)
+    {
+        n += 4;
+        z >>= 4;
+    }
+    if (z >= 0x00004)
+    {
+        n += 2;
+        z >>= 2;
+    }
+    if (z >= 0x00002)
+    {
+        n += 1; /* >>=  1;*/
+    }
+    return n;
+}
+
+static int stbi__bitcount(unsigned int a)
+{
+    a = (a & 0x55555555) + ((a >> 1) & 0x55555555); // max 2
+    a = (a & 0x33333333) + ((a >> 2) & 0x33333333); // max 4
+    a = (a + (a >> 4)) & 0x0f0f0f0f;                // max 8 per 4, now 8 bits
+    a = (a + (a >> 8));                             // max 16 per 8 bits
+    a = (a + (a >> 16));                            // max 32 per 8 bits
+    return a & 0xff;
+}
+
+// extract an arbitrarily-aligned N-bit value (N=bits)
+// from v, and then make it 8-bits long and fractionally
+// extend it to full full range.
+static int stbi__shiftsigned(unsigned int v, int shift, int bits)
+{
+    static unsigned int mul_table[9] = {
+        0,
+        0xff /*0b11111111*/,
+        0x55 /*0b01010101*/,
+        0x49 /*0b01001001*/,
+        0x11 /*0b00010001*/,
+        0x21 /*0b00100001*/,
+        0x41 /*0b01000001*/,
+        0x81 /*0b10000001*/,
+        0x01 /*0b00000001*/,
+    };
+    static unsigned int shift_table[9] = {
+        0,
+        0,
+        0,
+        1,
+        0,
+        2,
+        4,
+        6,
+        0,
+    };
+    if (shift < 0)
+        v <<= -shift;
+    else
+        v >>= shift;
+    STBI_ASSERT(v < 256);
+    v >>= (8 - bits);
+    STBI_ASSERT(bits >= 0 && bits <= 8);
+    return (int)((unsigned)v * mul_table[bits]) >> shift_table[bits];
+}
+
+typedef struct
+{
+    int bpp, offset, hsz;
+    unsigned int mr, mg, mb, ma, all_a;
+    int extra_read;
+} stbi__bmp_data;
+
+static int stbi__bmp_set_mask_defaults(stbi__bmp_data *info, int compress)
+{
+    // BI_BITFIELDS specifies masks explicitly, don't override
+    if (compress == 3)
+        return 1;
+
+    if (compress == 0)
+    {
+        if (info->bpp == 16)
+        {
+            info->mr = 31u << 10;
+            info->mg = 31u << 5;
+            info->mb = 31u << 0;
+        }
+        else if (info->bpp == 32)
+        {
+            info->mr = 0xffu << 16;
+            info->mg = 0xffu << 8;
+            info->mb = 0xffu << 0;
+            info->ma = 0xffu << 24;
+            info->all_a = 0; // if all_a is 0 at end, then we loaded alpha channel but it was all 0
+        }
+        else
+        {
+            // otherwise, use defaults, which is all-0
+            info->mr = info->mg = info->mb = info->ma = 0;
+        }
+        return 1;
+    }
+    return 0; // error
+}
+
+static void *stbi__bmp_parse_header(stbi__context *s, stbi__bmp_data *info)
+{
+    int hsz;
+    if (stbi__get8(s) != 'B' || stbi__get8(s) != 'M')
+        return stbi__errpuc("not BMP", "Corrupt BMP");
+    stbi__get32le(s); // discard filesize
+    stbi__get16le(s); // discard reserved
+    stbi__get16le(s); // discard reserved
+    info->offset = stbi__get32le(s);
+    info->hsz = hsz = stbi__get32le(s);
+    info->mr = info->mg = info->mb = info->ma = 0;
+    info->extra_read = 14;
+
+    if (info->offset < 0)
+        return stbi__errpuc("bad BMP", "bad BMP");
+
+    if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108 && hsz != 124)
+        return stbi__errpuc("unknown BMP", "BMP type not supported: unknown");
+    if (hsz == 12)
+    {
+        s->img_x = stbi__get16le(s);
+        s->img_y = stbi__get16le(s);
+    }
+    else
+    {
+        s->img_x = stbi__get32le(s);
+        s->img_y = stbi__get32le(s);
+    }
+    if (stbi__get16le(s) != 1)
+        return stbi__errpuc("bad BMP", "bad BMP");
+    info->bpp = stbi__get16le(s);
+    if (hsz != 12)
+    {
+        int compress = stbi__get32le(s);
+        if (compress == 1 || compress == 2)
+            return stbi__errpuc("BMP RLE", "BMP type not supported: RLE");
+        if (compress >= 4)
+            return stbi__errpuc("BMP JPEG/PNG", "BMP type not supported: unsupported compression"); // this includes PNG/JPEG modes
+        if (compress == 3 && info->bpp != 16 && info->bpp != 32)
+            return stbi__errpuc("bad BMP", "bad BMP"); // bitfields requires 16 or 32 bits/pixel
+        stbi__get32le(s);                              // discard sizeof
+        stbi__get32le(s);                              // discard hres
+        stbi__get32le(s);                              // discard vres
+        stbi__get32le(s);                              // discard colorsused
+        stbi__get32le(s);                              // discard max important
+        if (hsz == 40 || hsz == 56)
+        {
+            if (hsz == 56)
+            {
+                stbi__get32le(s);
+                stbi__get32le(s);
+                stbi__get32le(s);
+                stbi__get32le(s);
+            }
+            if (info->bpp == 16 || info->bpp == 32)
+            {
+                if (compress == 0)
+                {
+                    stbi__bmp_set_mask_defaults(info, compress);
+                }
+                else if (compress == 3)
+                {
+                    info->mr = stbi__get32le(s);
+                    info->mg = stbi__get32le(s);
+                    info->mb = stbi__get32le(s);
+                    info->extra_read += 12;
+                    // not documented, but generated by photoshop and handled by mspaint
+                    if (info->mr == info->mg && info->mg == info->mb)
+                    {
+                        // ?!?!?
+                        return stbi__errpuc("bad BMP", "bad BMP");
+                    }
+                }
+                else
+                    return stbi__errpuc("bad BMP", "bad BMP");
+            }
+        }
+        else
+        {
+            // V4/V5 header
+            int i;
+            if (hsz != 108 && hsz != 124)
+                return stbi__errpuc("bad BMP", "bad BMP");
+            info->mr = stbi__get32le(s);
+            info->mg = stbi__get32le(s);
+            info->mb = stbi__get32le(s);
+            info->ma = stbi__get32le(s);
+            if (compress != 3) // override mr/mg/mb unless in BI_BITFIELDS mode, as per docs
+                stbi__bmp_set_mask_defaults(info, compress);
+            stbi__get32le(s); // discard color space
+            for (i = 0; i < 12; ++i)
+                stbi__get32le(s); // discard color space parameters
+            if (hsz == 124)
+            {
+                stbi__get32le(s); // discard rendering intent
+                stbi__get32le(s); // discard offset of profile data
+                stbi__get32le(s); // discard size of profile data
+                stbi__get32le(s); // discard reserved
+            }
+        }
+    }
+    return (void *)1;
+}
+
+static void *stbi__bmp_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    stbi_uc *out;
+    unsigned int mr = 0, mg = 0, mb = 0, ma = 0, all_a;
+    stbi_uc pal[256][4];
+    int psize = 0, i, j, width;
+    int flip_vertically, pad, target;
+    stbi__bmp_data info;
+    STBI_NOTUSED(ri);
+
+    info.all_a = 255;
+    if (stbi__bmp_parse_header(s, &info) == NULL)
+        return NULL; // error code already set
+
+    flip_vertically = ((int)s->img_y) > 0;
+    s->img_y = abs((int)s->img_y);
+
+    if (s->img_y > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+    if (s->img_x > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+
+    mr = info.mr;
+    mg = info.mg;
+    mb = info.mb;
+    ma = info.ma;
+    all_a = info.all_a;
+
+    if (info.hsz == 12)
+    {
+        if (info.bpp < 24)
+            psize = (info.offset - info.extra_read - 24) / 3;
+    }
+    else
+    {
+        if (info.bpp < 16)
+            psize = (info.offset - info.extra_read - info.hsz) >> 2;
+    }
+    if (psize == 0)
+    {
+        // accept some number of extra bytes after the header, but if the offset points either to before
+        // the header ends or implies a large amount of extra data, reject the file as malformed
+        int bytes_read_so_far = s->callback_already_read + (int)(s->img_buffer - s->img_buffer_original);
+        int header_limit = 1024;        // max we actually read is below 256 bytes currently.
+        int extra_data_limit = 256 * 4; // what ordinarily goes here is a palette; 256 entries*4 bytes is its max size.
+        if (bytes_read_so_far <= 0 || bytes_read_so_far > header_limit)
+        {
+            return stbi__errpuc("bad header", "Corrupt BMP");
+        }
+        // we established that bytes_read_so_far is positive and sensible.
+        // the first half of this test rejects offsets that are either too small positives, or
+        // negative, and guarantees that info.offset >= bytes_read_so_far > 0. this in turn
+        // ensures the number computed in the second half of the test can't overflow.
+        if (info.offset < bytes_read_so_far || info.offset - bytes_read_so_far > extra_data_limit)
+        {
+            return stbi__errpuc("bad offset", "Corrupt BMP");
+        }
+        else
+        {
+            stbi__skip(s, info.offset - bytes_read_so_far);
+        }
+    }
+
+    if (info.bpp == 24 && ma == 0xff000000)
+        s->img_n = 3;
+    else
+        s->img_n = ma ? 4 : 3;
+    if (req_comp && req_comp >= 3) // we can directly decode 3 or 4
+        target = req_comp;
+    else
+        target = s->img_n; // if they want monochrome, we'll post-convert
+
+    // sanity-check size
+    if (!stbi__mad3sizes_valid(target, s->img_x, s->img_y, 0))
+        return stbi__errpuc("too large", "Corrupt BMP");
+
+    out = (stbi_uc *)stbi__malloc_mad3(target, s->img_x, s->img_y, 0);
+    if (!out)
+        return stbi__errpuc("outofmem", "Out of memory");
+    if (info.bpp < 16)
+    {
+        int z = 0;
+        if (psize == 0 || psize > 256)
+        {
+            STBI_FREE(out);
+            return stbi__errpuc("invalid", "Corrupt BMP");
+        }
+        for (i = 0; i < psize; ++i)
+        {
+            pal[i][2] = stbi__get8(s);
+            pal[i][1] = stbi__get8(s);
+            pal[i][0] = stbi__get8(s);
+            if (info.hsz != 12)
+                stbi__get8(s);
+            pal[i][3] = 255;
+        }
+        stbi__skip(s, info.offset - info.extra_read - info.hsz - psize * (info.hsz == 12 ? 3 : 4));
+        if (info.bpp == 1)
+            width = (s->img_x + 7) >> 3;
+        else if (info.bpp == 4)
+            width = (s->img_x + 1) >> 1;
+        else if (info.bpp == 8)
+            width = s->img_x;
+        else
+        {
+            STBI_FREE(out);
+            return stbi__errpuc("bad bpp", "Corrupt BMP");
+        }
+        pad = (-width) & 3;
+        if (info.bpp == 1)
+        {
+            for (j = 0; j < (int)s->img_y; ++j)
+            {
+                int bit_offset = 7, v = stbi__get8(s);
+                for (i = 0; i < (int)s->img_x; ++i)
+                {
+                    int color = (v >> bit_offset) & 0x1;
+                    out[z++] = pal[color][0];
+                    out[z++] = pal[color][1];
+                    out[z++] = pal[color][2];
+                    if (target == 4)
+                        out[z++] = 255;
+                    if (i + 1 == (int)s->img_x)
+                        break;
+                    if ((--bit_offset) < 0)
+                    {
+                        bit_offset = 7;
+                        v = stbi__get8(s);
+                    }
+                }
+                stbi__skip(s, pad);
+            }
+        }
+        else
+        {
+            for (j = 0; j < (int)s->img_y; ++j)
+            {
+                for (i = 0; i < (int)s->img_x; i += 2)
+                {
+                    int v = stbi__get8(s), v2 = 0;
+                    if (info.bpp == 4)
+                    {
+                        v2 = v & 15;
+                        v >>= 4;
+                    }
+                    out[z++] = pal[v][0];
+                    out[z++] = pal[v][1];
+                    out[z++] = pal[v][2];
+                    if (target == 4)
+                        out[z++] = 255;
+                    if (i + 1 == (int)s->img_x)
+                        break;
+                    v = (info.bpp == 8) ? stbi__get8(s) : v2;
+                    out[z++] = pal[v][0];
+                    out[z++] = pal[v][1];
+                    out[z++] = pal[v][2];
+                    if (target == 4)
+                        out[z++] = 255;
+                }
+                stbi__skip(s, pad);
+            }
+        }
+    }
+    else
+    {
+        int rshift = 0, gshift = 0, bshift = 0, ashift = 0, rcount = 0, gcount = 0, bcount = 0, acount = 0;
+        int z = 0;
+        int easy = 0;
+        stbi__skip(s, info.offset - info.extra_read - info.hsz);
+        if (info.bpp == 24)
+            width = 3 * s->img_x;
+        else if (info.bpp == 16)
+            width = 2 * s->img_x;
+        else /* bpp = 32 and pad = 0 */
+            width = 0;
+        pad = (-width) & 3;
+        if (info.bpp == 24)
+        {
+            easy = 1;
+        }
+        else if (info.bpp == 32)
+        {
+            if (mb == 0xff && mg == 0xff00 && mr == 0x00ff0000 && ma == 0xff000000)
+                easy = 2;
+        }
+        if (!easy)
+        {
+            if (!mr || !mg || !mb)
+            {
+                STBI_FREE(out);
+                return stbi__errpuc("bad masks", "Corrupt BMP");
+            }
+            // right shift amt to put high bit in position #7
+            rshift = stbi__high_bit(mr) - 7;
+            rcount = stbi__bitcount(mr);
+            gshift = stbi__high_bit(mg) - 7;
+            gcount = stbi__bitcount(mg);
+            bshift = stbi__high_bit(mb) - 7;
+            bcount = stbi__bitcount(mb);
+            ashift = stbi__high_bit(ma) - 7;
+            acount = stbi__bitcount(ma);
+            if (rcount > 8 || gcount > 8 || bcount > 8 || acount > 8)
+            {
+                STBI_FREE(out);
+                return stbi__errpuc("bad masks", "Corrupt BMP");
+            }
+        }
+        for (j = 0; j < (int)s->img_y; ++j)
+        {
+            if (easy)
+            {
+                for (i = 0; i < (int)s->img_x; ++i)
+                {
+                    unsigned char a;
+                    out[z + 2] = stbi__get8(s);
+                    out[z + 1] = stbi__get8(s);
+                    out[z + 0] = stbi__get8(s);
+                    z += 3;
+                    a = (easy == 2 ? stbi__get8(s) : 255);
+                    all_a |= a;
+                    if (target == 4)
+                        out[z++] = a;
+                }
+            }
+            else
+            {
+                int bpp = info.bpp;
+                for (i = 0; i < (int)s->img_x; ++i)
+                {
+                    stbi__uint32 v = (bpp == 16 ? (stbi__uint32)stbi__get16le(s) : stbi__get32le(s));
+                    unsigned int a;
+                    out[z++] = STBI__BYTECAST(stbi__shiftsigned(v & mr, rshift, rcount));
+                    out[z++] = STBI__BYTECAST(stbi__shiftsigned(v & mg, gshift, gcount));
+                    out[z++] = STBI__BYTECAST(stbi__shiftsigned(v & mb, bshift, bcount));
+                    a = (ma ? stbi__shiftsigned(v & ma, ashift, acount) : 255);
+                    all_a |= a;
+                    if (target == 4)
+                        out[z++] = STBI__BYTECAST(a);
+                }
+            }
+            stbi__skip(s, pad);
+        }
+    }
+
+    // if alpha channel is all 0s, replace with all 255s
+    if (target == 4 && all_a == 0)
+        for (i = 4 * s->img_x * s->img_y - 1; i >= 0; i -= 4)
+            out[i] = 255;
+
+    if (flip_vertically)
+    {
+        stbi_uc t;
+        for (j = 0; j < (int)s->img_y >> 1; ++j)
+        {
+            stbi_uc *p1 = out + j * s->img_x * target;
+            stbi_uc *p2 = out + (s->img_y - 1 - j) * s->img_x * target;
+            for (i = 0; i < (int)s->img_x * target; ++i)
+            {
+                t = p1[i];
+                p1[i] = p2[i];
+                p2[i] = t;
+            }
+        }
+    }
+
+    if (req_comp && req_comp != target)
+    {
+        out = stbi__convert_format(out, target, req_comp, s->img_x, s->img_y);
+        if (out == NULL)
+            return out; // stbi__convert_format frees input on failure
+    }
+
+    *x = s->img_x;
+    *y = s->img_y;
+    if (comp)
+        *comp = s->img_n;
+    return out;
+}
+#endif
+
+// Targa Truevision - TGA
+// by Jonathan Dummer
+#ifndef STBI_NO_TGA
+// returns STBI_rgb or whatever, 0 on error
+static int stbi__tga_get_comp(int bits_per_pixel, int is_grey, int *is_rgb16)
+{
+    // only RGB or RGBA (incl. 16bit) or grey allowed
+    if (is_rgb16)
+        *is_rgb16 = 0;
+    switch (bits_per_pixel)
+    {
+    case 8:
+        return STBI_grey;
+    case 16:
+        if (is_grey)
+            return STBI_grey_alpha;
+        // fallthrough
+    case 15:
+        if (is_rgb16)
+            *is_rgb16 = 1;
+        return STBI_rgb;
+    case 24: // fallthrough
+    case 32:
+        return bits_per_pixel / 8;
+    default:
+        return 0;
+    }
+}
+
+static int stbi__tga_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    int tga_w, tga_h, tga_comp, tga_image_type, tga_bits_per_pixel, tga_colormap_bpp;
+    int sz, tga_colormap_type;
+    stbi__get8(s);                     // discard Offset
+    tga_colormap_type = stbi__get8(s); // colormap type
+    if (tga_colormap_type > 1)
+    {
+        stbi__rewind(s);
+        return 0; // only RGB or indexed allowed
+    }
+    tga_image_type = stbi__get8(s); // image type
+    if (tga_colormap_type == 1)
+    { // colormapped (paletted) image
+        if (tga_image_type != 1 && tga_image_type != 9)
+        {
+            stbi__rewind(s);
+            return 0;
+        }
+        stbi__skip(s, 4);   // skip index of first colormap entry and number of entries
+        sz = stbi__get8(s); //   check bits per palette color entry
+        if ((sz != 8) && (sz != 15) && (sz != 16) && (sz != 24) && (sz != 32))
+        {
+            stbi__rewind(s);
+            return 0;
+        }
+        stbi__skip(s, 4); // skip image x and y origin
+        tga_colormap_bpp = sz;
+    }
+    else
+    { // "normal" image w/o colormap - only RGB or grey allowed, +/- RLE
+        if ((tga_image_type != 2) && (tga_image_type != 3) && (tga_image_type != 10) && (tga_image_type != 11))
+        {
+            stbi__rewind(s);
+            return 0; // only RGB or grey allowed, +/- RLE
+        }
+        stbi__skip(s, 9); // skip colormap specification and image x/y origin
+        tga_colormap_bpp = 0;
+    }
+    tga_w = stbi__get16le(s);
+    if (tga_w < 1)
+    {
+        stbi__rewind(s);
+        return 0; // test width
+    }
+    tga_h = stbi__get16le(s);
+    if (tga_h < 1)
+    {
+        stbi__rewind(s);
+        return 0; // test height
+    }
+    tga_bits_per_pixel = stbi__get8(s); // bits per pixel
+    stbi__get8(s);                      // ignore alpha bits
+    if (tga_colormap_bpp != 0)
+    {
+        if ((tga_bits_per_pixel != 8) && (tga_bits_per_pixel != 16))
+        {
+            // when using a colormap, tga_bits_per_pixel is the size of the indexes
+            // I don't think anything but 8 or 16bit indexes makes sense
+            stbi__rewind(s);
+            return 0;
+        }
+        tga_comp = stbi__tga_get_comp(tga_colormap_bpp, 0, NULL);
+    }
+    else
+    {
+        tga_comp = stbi__tga_get_comp(tga_bits_per_pixel, (tga_image_type == 3) || (tga_image_type == 11), NULL);
+    }
+    if (!tga_comp)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    if (x)
+        *x = tga_w;
+    if (y)
+        *y = tga_h;
+    if (comp)
+        *comp = tga_comp;
+    return 1; // seems to have passed everything
+}
+
+static int stbi__tga_test(stbi__context *s)
+{
+    int res = 0;
+    int sz, tga_color_type;
+    stbi__get8(s);                  //   discard Offset
+    tga_color_type = stbi__get8(s); //   color type
+    if (tga_color_type > 1)
+        goto errorEnd;  //   only RGB or indexed allowed
+    sz = stbi__get8(s); //   image type
+    if (tga_color_type == 1)
+    { // colormapped (paletted) image
+        if (sz != 1 && sz != 9)
+            goto errorEnd;  // colortype 1 demands image type 1 or 9
+        stbi__skip(s, 4);   // skip index of first colormap entry and number of entries
+        sz = stbi__get8(s); //   check bits per palette color entry
+        if ((sz != 8) && (sz != 15) && (sz != 16) && (sz != 24) && (sz != 32))
+            goto errorEnd;
+        stbi__skip(s, 4); // skip image x and y origin
+    }
+    else
+    { // "normal" image w/o colormap
+        if ((sz != 2) && (sz != 3) && (sz != 10) && (sz != 11))
+            goto errorEnd; // only RGB or grey allowed, +/- RLE
+        stbi__skip(s, 9);  // skip colormap specification and image x/y origin
+    }
+    if (stbi__get16le(s) < 1)
+        goto errorEnd; //   test width
+    if (stbi__get16le(s) < 1)
+        goto errorEnd;  //   test height
+    sz = stbi__get8(s); //   bits per pixel
+    if ((tga_color_type == 1) && (sz != 8) && (sz != 16))
+        goto errorEnd; // for colormapped images, bpp is size of an index
+    if ((sz != 8) && (sz != 15) && (sz != 16) && (sz != 24) && (sz != 32))
+        goto errorEnd;
+
+    res = 1; // if we got this far, everything's good and we can return 1 instead of 0
+
+errorEnd:
+    stbi__rewind(s);
+    return res;
+}
+
+// read 16bit value and convert to 24bit RGB
+static void stbi__tga_read_rgb16(stbi__context *s, stbi_uc *out)
+{
+    stbi__uint16 px = (stbi__uint16)stbi__get16le(s);
+    stbi__uint16 fiveBitMask = 31;
+    // we have 3 channels with 5bits each
+    int r = (px >> 10) & fiveBitMask;
+    int g = (px >> 5) & fiveBitMask;
+    int b = px & fiveBitMask;
+    // Note that this saves the data in RGB(A) order, so it doesn't need to be swapped later
+    out[0] = (stbi_uc)((r * 255) / 31);
+    out[1] = (stbi_uc)((g * 255) / 31);
+    out[2] = (stbi_uc)((b * 255) / 31);
+
+    // some people claim that the most significant bit might be used for alpha
+    // (possibly if an alpha-bit is set in the "image descriptor byte")
+    // but that only made 16bit test images completely translucent..
+    // so let's treat all 15 and 16bit TGAs as RGB with no alpha.
+}
+
+static void *stbi__tga_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    //   read in the TGA header stuff
+    int tga_offset = stbi__get8(s);
+    int tga_indexed = stbi__get8(s);
+    int tga_image_type = stbi__get8(s);
+    int tga_is_RLE = 0;
+    int tga_palette_start = stbi__get16le(s);
+    int tga_palette_len = stbi__get16le(s);
+    int tga_palette_bits = stbi__get8(s);
+    int tga_x_origin = stbi__get16le(s);
+    int tga_y_origin = stbi__get16le(s);
+    int tga_width = stbi__get16le(s);
+    int tga_height = stbi__get16le(s);
+    int tga_bits_per_pixel = stbi__get8(s);
+    int tga_comp, tga_rgb16 = 0;
+    int tga_inverted = stbi__get8(s);
+    // int tga_alpha_bits = tga_inverted & 15; // the 4 lowest bits - unused (useless?)
+    //   image data
+    unsigned char *tga_data;
+    unsigned char *tga_palette = NULL;
+    int i, j;
+    unsigned char raw_data[4] = {0};
+    int RLE_count = 0;
+    int RLE_repeating = 0;
+    int read_next_pixel = 1;
+    STBI_NOTUSED(ri);
+    STBI_NOTUSED(tga_x_origin); // @TODO
+    STBI_NOTUSED(tga_y_origin); // @TODO
+
+    if (tga_height > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+    if (tga_width > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+
+    //   do a tiny bit of precessing
+    if (tga_image_type >= 8)
+    {
+        tga_image_type -= 8;
+        tga_is_RLE = 1;
+    }
+    tga_inverted = 1 - ((tga_inverted >> 5) & 1);
+
+    //   If I'm paletted, then I'll use the number of bits from the palette
+    if (tga_indexed)
+        tga_comp = stbi__tga_get_comp(tga_palette_bits, 0, &tga_rgb16);
+    else
+        tga_comp = stbi__tga_get_comp(tga_bits_per_pixel, (tga_image_type == 3), &tga_rgb16);
+
+    if (!tga_comp) // shouldn't really happen, stbi__tga_test() should have ensured basic consistency
+        return stbi__errpuc("bad format", "Can't find out TGA pixelformat");
+
+    //   tga info
+    *x = tga_width;
+    *y = tga_height;
+    if (comp)
+        *comp = tga_comp;
+
+    if (!stbi__mad3sizes_valid(tga_width, tga_height, tga_comp, 0))
+        return stbi__errpuc("too large", "Corrupt TGA");
+
+    tga_data = (unsigned char *)stbi__malloc_mad3(tga_width, tga_height, tga_comp, 0);
+    if (!tga_data)
+        return stbi__errpuc("outofmem", "Out of memory");
+
+    // skip to the data's starting position (offset usually = 0)
+    stbi__skip(s, tga_offset);
+
+    if (!tga_indexed && !tga_is_RLE && !tga_rgb16)
+    {
+        for (i = 0; i < tga_height; ++i)
+        {
+            int row = tga_inverted ? tga_height - i - 1 : i;
+            stbi_uc *tga_row = tga_data + row * tga_width * tga_comp;
+            stbi__getn(s, tga_row, tga_width * tga_comp);
+        }
+    }
+    else
+    {
+        //   do I need to load a palette?
+        if (tga_indexed)
+        {
+            if (tga_palette_len == 0)
+            { /* you have to have at least one entry! */
+                STBI_FREE(tga_data);
+                return stbi__errpuc("bad palette", "Corrupt TGA");
+            }
+
+            //   any data to skip? (offset usually = 0)
+            stbi__skip(s, tga_palette_start);
+            //   load the palette
+            tga_palette = (unsigned char *)stbi__malloc_mad2(tga_palette_len, tga_comp, 0);
+            if (!tga_palette)
+            {
+                STBI_FREE(tga_data);
+                return stbi__errpuc("outofmem", "Out of memory");
+            }
+            if (tga_rgb16)
+            {
+                stbi_uc *pal_entry = tga_palette;
+                STBI_ASSERT(tga_comp == STBI_rgb);
+                for (i = 0; i < tga_palette_len; ++i)
+                {
+                    stbi__tga_read_rgb16(s, pal_entry);
+                    pal_entry += tga_comp;
+                }
+            }
+            else if (!stbi__getn(s, tga_palette, tga_palette_len * tga_comp))
+            {
+                STBI_FREE(tga_data);
+                STBI_FREE(tga_palette);
+                return stbi__errpuc("bad palette", "Corrupt TGA");
+            }
+        }
+        //   load the data
+        for (i = 0; i < tga_width * tga_height; ++i)
+        {
+            //   if I'm in RLE mode, do I need to get a RLE stbi__pngchunk?
+            if (tga_is_RLE)
+            {
+                if (RLE_count == 0)
+                {
+                    //   yep, get the next byte as a RLE command
+                    int RLE_cmd = stbi__get8(s);
+                    RLE_count = 1 + (RLE_cmd & 127);
+                    RLE_repeating = RLE_cmd >> 7;
+                    read_next_pixel = 1;
+                }
+                else if (!RLE_repeating)
+                {
+                    read_next_pixel = 1;
+                }
+            }
+            else
+            {
+                read_next_pixel = 1;
+            }
+            //   OK, if I need to read a pixel, do it now
+            if (read_next_pixel)
+            {
+                //   load however much data we did have
+                if (tga_indexed)
+                {
+                    // read in index, then perform the lookup
+                    int pal_idx = (tga_bits_per_pixel == 8) ? stbi__get8(s) : stbi__get16le(s);
+                    if (pal_idx >= tga_palette_len)
+                    {
+                        // invalid index
+                        pal_idx = 0;
+                    }
+                    pal_idx *= tga_comp;
+                    for (j = 0; j < tga_comp; ++j)
+                    {
+                        raw_data[j] = tga_palette[pal_idx + j];
+                    }
+                }
+                else if (tga_rgb16)
+                {
+                    STBI_ASSERT(tga_comp == STBI_rgb);
+                    stbi__tga_read_rgb16(s, raw_data);
+                }
+                else
+                {
+                    //   read in the data raw
+                    for (j = 0; j < tga_comp; ++j)
+                    {
+                        raw_data[j] = stbi__get8(s);
+                    }
+                }
+                //   clear the reading flag for the next pixel
+                read_next_pixel = 0;
+            } // end of reading a pixel
+
+            // copy data
+            for (j = 0; j < tga_comp; ++j)
+                tga_data[i * tga_comp + j] = raw_data[j];
+
+            //   in case we're in RLE mode, keep counting down
+            --RLE_count;
+        }
+        //   do I need to invert the image?
+        if (tga_inverted)
+        {
+            for (j = 0; j * 2 < tga_height; ++j)
+            {
+                int index1 = j * tga_width * tga_comp;
+                int index2 = (tga_height - 1 - j) * tga_width * tga_comp;
+                for (i = tga_width * tga_comp; i > 0; --i)
+                {
+                    unsigned char temp = tga_data[index1];
+                    tga_data[index1] = tga_data[index2];
+                    tga_data[index2] = temp;
+                    ++index1;
+                    ++index2;
+                }
+            }
+        }
+        //   clear my palette, if I had one
+        if (tga_palette != NULL)
+        {
+            STBI_FREE(tga_palette);
+        }
+    }
+
+    // swap RGB - if the source data was RGB16, it already is in the right order
+    if (tga_comp >= 3 && !tga_rgb16)
+    {
+        unsigned char *tga_pixel = tga_data;
+        for (i = 0; i < tga_width * tga_height; ++i)
+        {
+            unsigned char temp = tga_pixel[0];
+            tga_pixel[0] = tga_pixel[2];
+            tga_pixel[2] = temp;
+            tga_pixel += tga_comp;
+        }
+    }
+
+    // convert to target component count
+    if (req_comp && req_comp != tga_comp)
+        tga_data = stbi__convert_format(tga_data, tga_comp, req_comp, tga_width, tga_height);
+
+    //   the things I do to get rid of an error message, and yet keep
+    //   Microsoft's C compilers happy... [8^(
+    tga_palette_start = tga_palette_len = tga_palette_bits =
+        tga_x_origin = tga_y_origin = 0;
+    STBI_NOTUSED(tga_palette_start);
+    //   OK, done
+    return tga_data;
+}
+#endif
+
+// *************************************************************************************************
+// Photoshop PSD loader -- PD by Thatcher Ulrich, integration by Nicolas Schulz, tweaked by STB
+
+#ifndef STBI_NO_PSD
+static int stbi__psd_test(stbi__context *s)
+{
+    int r = (stbi__get32be(s) == 0x38425053);
+    stbi__rewind(s);
+    return r;
+}
+
+static int stbi__psd_decode_rle(stbi__context *s, stbi_uc *p, int pixelCount)
+{
+    int count, nleft, len;
+
+    count = 0;
+    while ((nleft = pixelCount - count) > 0)
+    {
+        len = stbi__get8(s);
+        if (len == 128)
+        {
+            // No-op.
+        }
+        else if (len < 128)
+        {
+            // Copy next len+1 bytes literally.
+            len++;
+            if (len > nleft)
+                return 0; // corrupt data
+            count += len;
+            while (len)
+            {
+                *p = stbi__get8(s);
+                p += 4;
+                len--;
+            }
+        }
+        else if (len > 128)
+        {
+            stbi_uc val;
+            // Next -len+1 bytes in the dest are replicated from next source byte.
+            // (Interpret len as a negative 8-bit int.)
+            len = 257 - len;
+            if (len > nleft)
+                return 0; // corrupt data
+            val = stbi__get8(s);
+            count += len;
+            while (len)
+            {
+                *p = val;
+                p += 4;
+                len--;
+            }
+        }
+    }
+
+    return 1;
+}
+
+static void *stbi__psd_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri, int bpc)
+{
+    int pixelCount;
+    int channelCount, compression;
+    int channel, i;
+    int bitdepth;
+    int w, h;
+    stbi_uc *out;
+    STBI_NOTUSED(ri);
+
+    // Check identifier
+    if (stbi__get32be(s) != 0x38425053) // "8BPS"
+        return stbi__errpuc("not PSD", "Corrupt PSD image");
+
+    // Check file type version.
+    if (stbi__get16be(s) != 1)
+        return stbi__errpuc("wrong version", "Unsupported version of PSD image");
+
+    // Skip 6 reserved bytes.
+    stbi__skip(s, 6);
+
+    // Read the number of channels (R, G, B, A, etc).
+    channelCount = stbi__get16be(s);
+    if (channelCount < 0 || channelCount > 16)
+        return stbi__errpuc("wrong channel count", "Unsupported number of channels in PSD image");
+
+    // Read the rows and columns of the image.
+    h = stbi__get32be(s);
+    w = stbi__get32be(s);
+
+    if (h > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+    if (w > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+
+    // Make sure the depth is 8 bits.
+    bitdepth = stbi__get16be(s);
+    if (bitdepth != 8 && bitdepth != 16)
+        return stbi__errpuc("unsupported bit depth", "PSD bit depth is not 8 or 16 bit");
+
+    // Make sure the color mode is RGB.
+    // Valid options are:
+    //   0: Bitmap
+    //   1: Grayscale
+    //   2: Indexed color
+    //   3: RGB color
+    //   4: CMYK color
+    //   7: Multichannel
+    //   8: Duotone
+    //   9: Lab color
+    if (stbi__get16be(s) != 3)
+        return stbi__errpuc("wrong color format", "PSD is not in RGB color format");
+
+    // Skip the Mode Data.  (It's the palette for indexed color; other info for other modes.)
+    stbi__skip(s, stbi__get32be(s));
+
+    // Skip the image resources.  (resolution, pen tool paths, etc)
+    stbi__skip(s, stbi__get32be(s));
+
+    // Skip the reserved data.
+    stbi__skip(s, stbi__get32be(s));
+
+    // Find out if the data is compressed.
+    // Known values:
+    //   0: no compression
+    //   1: RLE compressed
+    compression = stbi__get16be(s);
+    if (compression > 1)
+        return stbi__errpuc("bad compression", "PSD has an unknown compression format");
+
+    // Check size
+    if (!stbi__mad3sizes_valid(4, w, h, 0))
+        return stbi__errpuc("too large", "Corrupt PSD");
+
+    // Create the destination image.
+
+    if (!compression && bitdepth == 16 && bpc == 16)
+    {
+        out = (stbi_uc *)stbi__malloc_mad3(8, w, h, 0);
+        ri->bits_per_channel = 16;
+    }
+    else
+        out = (stbi_uc *)stbi__malloc(4 * w * h);
+
+    if (!out)
+        return stbi__errpuc("outofmem", "Out of memory");
+    pixelCount = w * h;
+
+    // Initialize the data to zero.
+    // memset( out, 0, pixelCount * 4 );
+
+    // Finally, the image data.
+    if (compression)
+    {
+        // RLE as used by .PSD and .TIFF
+        // Loop until you get the number of unpacked bytes you are expecting:
+        //     Read the next source byte into n.
+        //     If n is between 0 and 127 inclusive, copy the next n+1 bytes literally.
+        //     Else if n is between -127 and -1 inclusive, copy the next byte -n+1 times.
+        //     Else if n is 128, noop.
+        // Endloop
+
+        // The RLE-compressed data is preceded by a 2-byte data count for each row in the data,
+        // which we're going to just skip.
+        stbi__skip(s, h * channelCount * 2);
+
+        // Read the RLE data by channel.
+        for (channel = 0; channel < 4; channel++)
+        {
+            stbi_uc *p;
+
+            p = out + channel;
+            if (channel >= channelCount)
+            {
+                // Fill this channel with default data.
+                for (i = 0; i < pixelCount; i++, p += 4)
+                    *p = (channel == 3 ? 255 : 0);
+            }
+            else
+            {
+                // Read the RLE data.
+                if (!stbi__psd_decode_rle(s, p, pixelCount))
+                {
+                    STBI_FREE(out);
+                    return stbi__errpuc("corrupt", "bad RLE data");
+                }
+            }
+        }
+    }
+    else
+    {
+        // We're at the raw image data.  It's each channel in order (Red, Green, Blue, Alpha, ...)
+        // where each channel consists of an 8-bit (or 16-bit) value for each pixel in the image.
+
+        // Read the data by channel.
+        for (channel = 0; channel < 4; channel++)
+        {
+            if (channel >= channelCount)
+            {
+                // Fill this channel with default data.
+                if (bitdepth == 16 && bpc == 16)
+                {
+                    stbi__uint16 *q = ((stbi__uint16 *)out) + channel;
+                    stbi__uint16 val = channel == 3 ? 65535 : 0;
+                    for (i = 0; i < pixelCount; i++, q += 4)
+                        *q = val;
+                }
+                else
+                {
+                    stbi_uc *p = out + channel;
+                    stbi_uc val = channel == 3 ? 255 : 0;
+                    for (i = 0; i < pixelCount; i++, p += 4)
+                        *p = val;
+                }
+            }
+            else
+            {
+                if (ri->bits_per_channel == 16)
+                { // output bpc
+                    stbi__uint16 *q = ((stbi__uint16 *)out) + channel;
+                    for (i = 0; i < pixelCount; i++, q += 4)
+                        *q = (stbi__uint16)stbi__get16be(s);
+                }
+                else
+                {
+                    stbi_uc *p = out + channel;
+                    if (bitdepth == 16)
+                    { // input bpc
+                        for (i = 0; i < pixelCount; i++, p += 4)
+                            *p = (stbi_uc)(stbi__get16be(s) >> 8);
+                    }
+                    else
+                    {
+                        for (i = 0; i < pixelCount; i++, p += 4)
+                            *p = stbi__get8(s);
+                    }
+                }
+            }
+        }
+    }
+
+    // remove weird white matte from PSD
+    if (channelCount >= 4)
+    {
+        if (ri->bits_per_channel == 16)
+        {
+            for (i = 0; i < w * h; ++i)
+            {
+                stbi__uint16 *pixel = (stbi__uint16 *)out + 4 * i;
+                if (pixel[3] != 0 && pixel[3] != 65535)
+                {
+                    float a = pixel[3] / 65535.0f;
+                    float ra = 1.0f / a;
+                    float inv_a = 65535.0f * (1 - ra);
+                    pixel[0] = (stbi__uint16)(pixel[0] * ra + inv_a);
+                    pixel[1] = (stbi__uint16)(pixel[1] * ra + inv_a);
+                    pixel[2] = (stbi__uint16)(pixel[2] * ra + inv_a);
+                }
+            }
+        }
+        else
+        {
+            for (i = 0; i < w * h; ++i)
+            {
+                unsigned char *pixel = out + 4 * i;
+                if (pixel[3] != 0 && pixel[3] != 255)
+                {
+                    float a = pixel[3] / 255.0f;
+                    float ra = 1.0f / a;
+                    float inv_a = 255.0f * (1 - ra);
+                    pixel[0] = (unsigned char)(pixel[0] * ra + inv_a);
+                    pixel[1] = (unsigned char)(pixel[1] * ra + inv_a);
+                    pixel[2] = (unsigned char)(pixel[2] * ra + inv_a);
+                }
+            }
+        }
+    }
+
+    // convert to desired output format
+    if (req_comp && req_comp != 4)
+    {
+        if (ri->bits_per_channel == 16)
+            out = (stbi_uc *)stbi__convert_format16((stbi__uint16 *)out, 4, req_comp, w, h);
+        else
+            out = stbi__convert_format(out, 4, req_comp, w, h);
+        if (out == NULL)
+            return out; // stbi__convert_format frees input on failure
+    }
+
+    if (comp)
+        *comp = 4;
+    *y = h;
+    *x = w;
+
+    return out;
+}
+#endif
+
+// *************************************************************************************************
+// Softimage PIC loader
+// by Tom Seddon
+//
+// See http://softimage.wiki.softimage.com/index.php/INFO:_PIC_file_format
+// See http://ozviz.wasp.uwa.edu.au/~pbourke/dataformats/softimagepic/
+
+#ifndef STBI_NO_PIC
+static int stbi__pic_is4(stbi__context *s, const char *str)
+{
+    int i;
+    for (i = 0; i < 4; ++i)
+        if (stbi__get8(s) != (stbi_uc)str[i])
+            return 0;
+
+    return 1;
+}
+
+static int stbi__pic_test_core(stbi__context *s)
+{
+    int i;
+
+    if (!stbi__pic_is4(s, "\x53\x80\xF6\x34"))
+        return 0;
+
+    for (i = 0; i < 84; ++i)
+        stbi__get8(s);
+
+    if (!stbi__pic_is4(s, "PICT"))
+        return 0;
+
+    return 1;
+}
+
+typedef struct
+{
+    stbi_uc size, type, channel;
+} stbi__pic_packet;
+
+static stbi_uc *stbi__readval(stbi__context *s, int channel, stbi_uc *dest)
+{
+    int mask = 0x80, i;
+
+    for (i = 0; i < 4; ++i, mask >>= 1)
+    {
+        if (channel & mask)
+        {
+            if (stbi__at_eof(s))
+                return stbi__errpuc("bad file", "PIC file too short");
+            dest[i] = stbi__get8(s);
+        }
+    }
+
+    return dest;
+}
+
+static void stbi__copyval(int channel, stbi_uc *dest, const stbi_uc *src)
+{
+    int mask = 0x80, i;
+
+    for (i = 0; i < 4; ++i, mask >>= 1)
+        if (channel & mask)
+            dest[i] = src[i];
+}
+
+static stbi_uc *stbi__pic_load_core(stbi__context *s, int width, int height, int *comp, stbi_uc *result)
+{
+    int act_comp = 0, num_packets = 0, y, chained;
+    stbi__pic_packet packets[10];
+
+    // this will (should...) cater for even some bizarre stuff like having data
+    // for the same channel in multiple packets.
+    do
+    {
+        stbi__pic_packet *packet;
+
+        if (num_packets == sizeof(packets) / sizeof(packets[0]))
+            return stbi__errpuc("bad format", "too many packets");
+
+        packet = &packets[num_packets++];
+
+        chained = stbi__get8(s);
+        packet->size = stbi__get8(s);
+        packet->type = stbi__get8(s);
+        packet->channel = stbi__get8(s);
+
+        act_comp |= packet->channel;
+
+        if (stbi__at_eof(s))
+            return stbi__errpuc("bad file", "file too short (reading packets)");
+        if (packet->size != 8)
+            return stbi__errpuc("bad format", "packet isn't 8bpp");
+    } while (chained);
+
+    *comp = (act_comp & 0x10 ? 4 : 3); // has alpha channel?
+
+    for (y = 0; y < height; ++y)
+    {
+        int packet_idx;
+
+        for (packet_idx = 0; packet_idx < num_packets; ++packet_idx)
+        {
+            stbi__pic_packet *packet = &packets[packet_idx];
+            stbi_uc *dest = result + y * width * 4;
+
+            switch (packet->type)
+            {
+            default:
+                return stbi__errpuc("bad format", "packet has bad compression type");
+
+            case 0:
+            { // uncompressed
+                int x;
+
+                for (x = 0; x < width; ++x, dest += 4)
+                    if (!stbi__readval(s, packet->channel, dest))
+                        return 0;
+                break;
+            }
+
+            case 1: // Pure RLE
+            {
+                int left = width, i;
+
+                while (left > 0)
+                {
+                    stbi_uc count, value[4];
+
+                    count = stbi__get8(s);
+                    if (stbi__at_eof(s))
+                        return stbi__errpuc("bad file", "file too short (pure read count)");
+
+                    if (count > left)
+                        count = (stbi_uc)left;
+
+                    if (!stbi__readval(s, packet->channel, value))
+                        return 0;
+
+                    for (i = 0; i < count; ++i, dest += 4)
+                        stbi__copyval(packet->channel, dest, value);
+                    left -= count;
+                }
+            }
+            break;
+
+            case 2:
+            { // Mixed RLE
+                int left = width;
+                while (left > 0)
+                {
+                    int count = stbi__get8(s), i;
+                    if (stbi__at_eof(s))
+                        return stbi__errpuc("bad file", "file too short (mixed read count)");
+
+                    if (count >= 128)
+                    { // Repeated
+                        stbi_uc value[4];
+
+                        if (count == 128)
+                            count = stbi__get16be(s);
+                        else
+                            count -= 127;
+                        if (count > left)
+                            return stbi__errpuc("bad file", "scanline overrun");
+
+                        if (!stbi__readval(s, packet->channel, value))
+                            return 0;
+
+                        for (i = 0; i < count; ++i, dest += 4)
+                            stbi__copyval(packet->channel, dest, value);
+                    }
+                    else
+                    { // Raw
+                        ++count;
+                        if (count > left)
+                            return stbi__errpuc("bad file", "scanline overrun");
+
+                        for (i = 0; i < count; ++i, dest += 4)
+                            if (!stbi__readval(s, packet->channel, dest))
+                                return 0;
+                    }
+                    left -= count;
+                }
+                break;
+            }
+            }
+        }
+    }
+
+    return result;
+}
+
+static void *stbi__pic_load(stbi__context *s, int *px, int *py, int *comp, int req_comp, stbi__result_info *ri)
+{
+    stbi_uc *result;
+    int i, x, y, internal_comp;
+    STBI_NOTUSED(ri);
+
+    if (!comp)
+        comp = &internal_comp;
+
+    for (i = 0; i < 92; ++i)
+        stbi__get8(s);
+
+    x = stbi__get16be(s);
+    y = stbi__get16be(s);
+
+    if (y > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+    if (x > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+
+    if (stbi__at_eof(s))
+        return stbi__errpuc("bad file", "file too short (pic header)");
+    if (!stbi__mad3sizes_valid(x, y, 4, 0))
+        return stbi__errpuc("too large", "PIC image too large to decode");
+
+    stbi__get32be(s); // skip `ratio'
+    stbi__get16be(s); // skip `fields'
+    stbi__get16be(s); // skip `pad'
+
+    // intermediate buffer is RGBA
+    result = (stbi_uc *)stbi__malloc_mad3(x, y, 4, 0);
+    if (!result)
+        return stbi__errpuc("outofmem", "Out of memory");
+    memset(result, 0xff, x * y * 4);
+
+    if (!stbi__pic_load_core(s, x, y, comp, result))
+    {
+        STBI_FREE(result);
+        result = 0;
+    }
+    *px = x;
+    *py = y;
+    if (req_comp == 0)
+        req_comp = *comp;
+    result = stbi__convert_format(result, 4, req_comp, x, y);
+
+    return result;
+}
+
+static int stbi__pic_test(stbi__context *s)
+{
+    int r = stbi__pic_test_core(s);
+    stbi__rewind(s);
+    return r;
+}
+#endif
+
+// *************************************************************************************************
+// GIF loader -- public domain by Jean-Marc Lienher -- simplified/shrunk by stb
+
+#ifndef STBI_NO_GIF
+typedef struct
+{
+    stbi__int16 prefix;
+    stbi_uc first;
+    stbi_uc suffix;
+} stbi__gif_lzw;
+
+typedef struct
+{
+    int w, h;
+    stbi_uc *out;        // output buffer (always 4 components)
+    stbi_uc *background; // The current "background" as far as a gif is concerned
+    stbi_uc *history;
+    int flags, bgindex, ratio, transparent, eflags;
+    stbi_uc pal[256][4];
+    stbi_uc lpal[256][4];
+    stbi__gif_lzw codes[8192];
+    stbi_uc *color_table;
+    int parse, step;
+    int lflags;
+    int start_x, start_y;
+    int max_x, max_y;
+    int cur_x, cur_y;
+    int line_size;
+    int delay;
+} stbi__gif;
+
+static int stbi__gif_test_raw(stbi__context *s)
+{
+    int sz;
+    if (stbi__get8(s) != 'G' || stbi__get8(s) != 'I' || stbi__get8(s) != 'F' || stbi__get8(s) != '8')
+        return 0;
+    sz = stbi__get8(s);
+    if (sz != '9' && sz != '7')
+        return 0;
+    if (stbi__get8(s) != 'a')
+        return 0;
+    return 1;
+}
+
+static int stbi__gif_test(stbi__context *s)
+{
+    int r = stbi__gif_test_raw(s);
+    stbi__rewind(s);
+    return r;
+}
+
+static void stbi__gif_parse_colortable(stbi__context *s, stbi_uc pal[256][4], int num_entries, int transp)
+{
+    int i;
+    for (i = 0; i < num_entries; ++i)
+    {
+        pal[i][2] = stbi__get8(s);
+        pal[i][1] = stbi__get8(s);
+        pal[i][0] = stbi__get8(s);
+        pal[i][3] = transp == i ? 0 : 255;
+    }
+}
+
+static int stbi__gif_header(stbi__context *s, stbi__gif *g, int *comp, int is_info)
+{
+    stbi_uc version;
+    if (stbi__get8(s) != 'G' || stbi__get8(s) != 'I' || stbi__get8(s) != 'F' || stbi__get8(s) != '8')
+        return stbi__err("not GIF", "Corrupt GIF");
+
+    version = stbi__get8(s);
+    if (version != '7' && version != '9')
+        return stbi__err("not GIF", "Corrupt GIF");
+    if (stbi__get8(s) != 'a')
+        return stbi__err("not GIF", "Corrupt GIF");
+
+    stbi__g_failure_reason = "";
+    g->w = stbi__get16le(s);
+    g->h = stbi__get16le(s);
+    g->flags = stbi__get8(s);
+    g->bgindex = stbi__get8(s);
+    g->ratio = stbi__get8(s);
+    g->transparent = -1;
+
+    if (g->w > STBI_MAX_DIMENSIONS)
+        return stbi__err("too large", "Very large image (corrupt?)");
+    if (g->h > STBI_MAX_DIMENSIONS)
+        return stbi__err("too large", "Very large image (corrupt?)");
+
+    if (comp != 0)
+        *comp = 4; // can't actually tell whether it's 3 or 4 until we parse the comments
+
+    if (is_info)
+        return 1;
+
+    if (g->flags & 0x80)
+        stbi__gif_parse_colortable(s, g->pal, 2 << (g->flags & 7), -1);
+
+    return 1;
+}
+
+static int stbi__gif_info_raw(stbi__context *s, int *x, int *y, int *comp)
+{
+    stbi__gif *g = (stbi__gif *)stbi__malloc(sizeof(stbi__gif));
+    if (!g)
+        return stbi__err("outofmem", "Out of memory");
+    if (!stbi__gif_header(s, g, comp, 1))
+    {
+        STBI_FREE(g);
+        stbi__rewind(s);
+        return 0;
+    }
+    if (x)
+        *x = g->w;
+    if (y)
+        *y = g->h;
+    STBI_FREE(g);
+    return 1;
+}
+
+static void stbi__out_gif_code(stbi__gif *g, stbi__uint16 code)
+{
+    stbi_uc *p, *c;
+    int idx;
+
+    // recurse to decode the prefixes, since the linked-list is backwards,
+    // and working backwards through an interleaved image would be nasty
+    if (g->codes[code].prefix >= 0)
+        stbi__out_gif_code(g, g->codes[code].prefix);
+
+    if (g->cur_y >= g->max_y)
+        return;
+
+    idx = g->cur_x + g->cur_y;
+    p = &g->out[idx];
+    g->history[idx / 4] = 1;
+
+    c = &g->color_table[g->codes[code].suffix * 4];
+    if (c[3] > 128)
+    { // don't render transparent pixels;
+        p[0] = c[2];
+        p[1] = c[1];
+        p[2] = c[0];
+        p[3] = c[3];
+    }
+    g->cur_x += 4;
+
+    if (g->cur_x >= g->max_x)
+    {
+        g->cur_x = g->start_x;
+        g->cur_y += g->step;
+
+        while (g->cur_y >= g->max_y && g->parse > 0)
+        {
+            g->step = (1 << g->parse) * g->line_size;
+            g->cur_y = g->start_y + (g->step >> 1);
+            --g->parse;
+        }
+    }
+}
+
+static stbi_uc *stbi__process_gif_raster(stbi__context *s, stbi__gif *g)
+{
+    stbi_uc lzw_cs;
+    stbi__int32 len, init_code;
+    stbi__uint32 first;
+    stbi__int32 codesize, codemask, avail, oldcode, bits, valid_bits, clear;
+    stbi__gif_lzw *p;
+
+    lzw_cs = stbi__get8(s);
+    if (lzw_cs > 12)
+        return NULL;
+    clear = 1 << lzw_cs;
+    first = 1;
+    codesize = lzw_cs + 1;
+    codemask = (1 << codesize) - 1;
+    bits = 0;
+    valid_bits = 0;
+    for (init_code = 0; init_code < clear; init_code++)
+    {
+        g->codes[init_code].prefix = -1;
+        g->codes[init_code].first = (stbi_uc)init_code;
+        g->codes[init_code].suffix = (stbi_uc)init_code;
+    }
+
+    // support no starting clear code
+    avail = clear + 2;
+    oldcode = -1;
+
+    len = 0;
+    for (;;)
+    {
+        if (valid_bits < codesize)
+        {
+            if (len == 0)
+            {
+                len = stbi__get8(s); // start new block
+                if (len == 0)
+                    return g->out;
+            }
+            --len;
+            bits |= (stbi__int32)stbi__get8(s) << valid_bits;
+            valid_bits += 8;
+        }
+        else
+        {
+            stbi__int32 code = bits & codemask;
+            bits >>= codesize;
+            valid_bits -= codesize;
+            // @OPTIMIZE: is there some way we can accelerate the non-clear path?
+            if (code == clear)
+            { // clear code
+                codesize = lzw_cs + 1;
+                codemask = (1 << codesize) - 1;
+                avail = clear + 2;
+                oldcode = -1;
+                first = 0;
+            }
+            else if (code == clear + 1)
+            { // end of stream code
+                stbi__skip(s, len);
+                while ((len = stbi__get8(s)) > 0)
+                    stbi__skip(s, len);
+                return g->out;
+            }
+            else if (code <= avail)
+            {
+                if (first)
+                {
+                    return stbi__errpuc("no clear code", "Corrupt GIF");
+                }
+
+                if (oldcode >= 0)
+                {
+                    p = &g->codes[avail++];
+                    if (avail > 8192)
+                    {
+                        return stbi__errpuc("too many codes", "Corrupt GIF");
+                    }
+
+                    p->prefix = (stbi__int16)oldcode;
+                    p->first = g->codes[oldcode].first;
+                    p->suffix = (code == avail) ? p->first : g->codes[code].first;
+                }
+                else if (code == avail)
+                    return stbi__errpuc("illegal code in raster", "Corrupt GIF");
+
+                stbi__out_gif_code(g, (stbi__uint16)code);
+
+                if ((avail & codemask) == 0 && avail <= 0x0FFF)
+                {
+                    codesize++;
+                    codemask = (1 << codesize) - 1;
+                }
+
+                oldcode = code;
+            }
+            else
+            {
+                return stbi__errpuc("illegal code in raster", "Corrupt GIF");
+            }
+        }
+    }
+}
+
+// this function is designed to support animated gifs, although stb_image doesn't support it
+// two back is the image from two frames ago, used for a very specific disposal format
+static stbi_uc *stbi__gif_load_next(stbi__context *s, stbi__gif *g, int *comp, int req_comp, stbi_uc *two_back)
+{
+    int dispose;
+    int first_frame;
+    int pi;
+    int pcount;
+    STBI_NOTUSED(req_comp);
+
+    // on first frame, any non-written pixels get the background colour (non-transparent)
+    first_frame = 0;
+    if (g->out == 0)
+    {
+        if (!stbi__gif_header(s, g, comp, 0))
+            return 0; // stbi__g_failure_reason set by stbi__gif_header
+        if (!stbi__mad3sizes_valid(4, g->w, g->h, 0))
+            return stbi__errpuc("too large", "GIF image is too large");
+        pcount = g->w * g->h;
+        g->out = (stbi_uc *)stbi__malloc(4 * pcount);
+        g->background = (stbi_uc *)stbi__malloc(4 * pcount);
+        g->history = (stbi_uc *)stbi__malloc(pcount);
+        if (!g->out || !g->background || !g->history)
+            return stbi__errpuc("outofmem", "Out of memory");
+
+        // image is treated as "transparent" at the start - ie, nothing overwrites the current background;
+        // background colour is only used for pixels that are not rendered first frame, after that "background"
+        // color refers to the color that was there the previous frame.
+        memset(g->out, 0x00, 4 * pcount);
+        memset(g->background, 0x00, 4 * pcount); // state of the background (starts transparent)
+        memset(g->history, 0x00, pcount);        // pixels that were affected previous frame
+        first_frame = 1;
+    }
+    else
+    {
+        // second frame - how do we dispose of the previous one?
+        dispose = (g->eflags & 0x1C) >> 2;
+        pcount = g->w * g->h;
+
+        if ((dispose == 3) && (two_back == 0))
+        {
+            dispose = 2; // if I don't have an image to revert back to, default to the old background
+        }
+
+        if (dispose == 3)
+        { // use previous graphic
+            for (pi = 0; pi < pcount; ++pi)
+            {
+                if (g->history[pi])
+                {
+                    memcpy(&g->out[pi * 4], &two_back[pi * 4], 4);
+                }
+            }
+        }
+        else if (dispose == 2)
+        {
+            // restore what was changed last frame to background before that frame;
+            for (pi = 0; pi < pcount; ++pi)
+            {
+                if (g->history[pi])
+                {
+                    memcpy(&g->out[pi * 4], &g->background[pi * 4], 4);
+                }
+            }
+        }
+        else
+        {
+            // This is a non-disposal case eithe way, so just
+            // leave the pixels as is, and they will become the new background
+            // 1: do not dispose
+            // 0:  not specified.
+        }
+
+        // background is what out is after the undoing of the previou frame;
+        memcpy(g->background, g->out, 4 * g->w * g->h);
+    }
+
+    // clear my history;
+    memset(g->history, 0x00, g->w * g->h); // pixels that were affected previous frame
+
+    for (;;)
+    {
+        int tag = stbi__get8(s);
+        switch (tag)
+        {
+        case 0x2C: /* Image Descriptor */
+        {
+            stbi__int32 x, y, w, h;
+            stbi_uc *o;
+
+            x = stbi__get16le(s);
+            y = stbi__get16le(s);
+            w = stbi__get16le(s);
+            h = stbi__get16le(s);
+            if (((x + w) > (g->w)) || ((y + h) > (g->h)))
+                return stbi__errpuc("bad Image Descriptor", "Corrupt GIF");
+
+            g->line_size = g->w * 4;
+            g->start_x = x * 4;
+            g->start_y = y * g->line_size;
+            g->max_x = g->start_x + w * 4;
+            g->max_y = g->start_y + h * g->line_size;
+            g->cur_x = g->start_x;
+            g->cur_y = g->start_y;
+
+            // if the width of the specified rectangle is 0, that means
+            // we may not see *any* pixels or the image is malformed;
+            // to make sure this is caught, move the current y down to
+            // max_y (which is what out_gif_code checks).
+            if (w == 0)
+                g->cur_y = g->max_y;
+
+            g->lflags = stbi__get8(s);
+
+            if (g->lflags & 0x40)
+            {
+                g->step = 8 * g->line_size; // first interlaced spacing
+                g->parse = 3;
+            }
+            else
+            {
+                g->step = g->line_size;
+                g->parse = 0;
+            }
+
+            if (g->lflags & 0x80)
+            {
+                stbi__gif_parse_colortable(s, g->lpal, 2 << (g->lflags & 7), g->eflags & 0x01 ? g->transparent : -1);
+                g->color_table = (stbi_uc *)g->lpal;
+            }
+            else if (g->flags & 0x80)
+            {
+                g->color_table = (stbi_uc *)g->pal;
+            }
+            else
+                return stbi__errpuc("missing color table", "Corrupt GIF");
+
+            o = stbi__process_gif_raster(s, g);
+            if (!o)
+                return NULL;
+
+            // if this was the first frame,
+            pcount = g->w * g->h;
+            if (first_frame && (g->bgindex > 0))
+            {
+                // if first frame, any pixel not drawn to gets the background color
+                for (pi = 0; pi < pcount; ++pi)
+                {
+                    if (g->history[pi] == 0)
+                    {
+                        g->pal[g->bgindex][3] = 255; // just in case it was made transparent, undo that; It will be reset next frame if need be;
+                        memcpy(&g->out[pi * 4], &g->pal[g->bgindex], 4);
+                    }
+                }
+            }
+
+            return o;
+        }
+
+        case 0x21: // Comment Extension.
+        {
+            int len;
+            int ext = stbi__get8(s);
+            if (ext == 0xF9)
+            { // Graphic Control Extension.
+                len = stbi__get8(s);
+                if (len == 4)
+                {
+                    g->eflags = stbi__get8(s);
+                    g->delay = 10 * stbi__get16le(s); // delay - 1/100th of a second, saving as 1/1000ths.
+
+                    // unset old transparent
+                    if (g->transparent >= 0)
+                    {
+                        g->pal[g->transparent][3] = 255;
+                    }
+                    if (g->eflags & 0x01)
+                    {
+                        g->transparent = stbi__get8(s);
+                        if (g->transparent >= 0)
+                        {
+                            g->pal[g->transparent][3] = 0;
+                        }
+                    }
+                    else
+                    {
+                        // don't need transparent
+                        stbi__skip(s, 1);
+                        g->transparent = -1;
+                    }
+                }
+                else
+                {
+                    stbi__skip(s, len);
+                    break;
+                }
+            }
+            while ((len = stbi__get8(s)) != 0)
+            {
+                stbi__skip(s, len);
+            }
+            break;
+        }
+
+        case 0x3B:               // gif stream termination code
+            return (stbi_uc *)s; // using '1' causes warning on some compilers
+
+        default:
+            return stbi__errpuc("unknown code", "Corrupt GIF");
+        }
+    }
+}
+
+static void *stbi__load_gif_main_outofmem(stbi__gif *g, stbi_uc *out, int **delays)
+{
+    STBI_FREE(g->out);
+    STBI_FREE(g->history);
+    STBI_FREE(g->background);
+
+    if (out)
+        STBI_FREE(out);
+    if (delays && *delays)
+        STBI_FREE(*delays);
+    return stbi__errpuc("outofmem", "Out of memory");
+}
+
+static void *stbi__load_gif_main(stbi__context *s, int **delays, int *x, int *y, int *z, int *comp, int req_comp)
+{
+    if (stbi__gif_test(s))
+    {
+        int layers = 0;
+        stbi_uc *u = 0;
+        stbi_uc *out = 0;
+        stbi_uc *two_back = 0;
+        stbi__gif g;
+        int stride;
+        int out_size = 0;
+        int delays_size = 0;
+
+        STBI_NOTUSED(out_size);
+        STBI_NOTUSED(delays_size);
+
+        memset(&g, 0, sizeof(g));
+        if (delays)
+        {
+            *delays = 0;
+        }
+
+        do
+        {
+            u = stbi__gif_load_next(s, &g, comp, req_comp, two_back);
+            if (u == (stbi_uc *)s)
+                u = 0; // end of animated gif marker
+
+            if (u)
+            {
+                *x = g.w;
+                *y = g.h;
+                ++layers;
+                stride = g.w * g.h * 4;
+
+                if (out)
+                {
+                    void *tmp = (stbi_uc *)STBI_REALLOC_SIZED(out, out_size, layers * stride);
+                    if (!tmp)
+                        return stbi__load_gif_main_outofmem(&g, out, delays);
+                    else
+                    {
+                        out = (stbi_uc *)tmp;
+                        out_size = layers * stride;
+                    }
+
+                    if (delays)
+                    {
+                        int *new_delays = (int *)STBI_REALLOC_SIZED(*delays, delays_size, sizeof(int) * layers);
+                        if (!new_delays)
+                            return stbi__load_gif_main_outofmem(&g, out, delays);
+                        *delays = new_delays;
+                        delays_size = layers * sizeof(int);
+                    }
+                }
+                else
+                {
+                    out = (stbi_uc *)stbi__malloc(layers * stride);
+                    if (!out)
+                        return stbi__load_gif_main_outofmem(&g, out, delays);
+                    out_size = layers * stride;
+                    if (delays)
+                    {
+                        *delays = (int *)stbi__malloc(layers * sizeof(int));
+                        if (!*delays)
+                            return stbi__load_gif_main_outofmem(&g, out, delays);
+                        delays_size = layers * sizeof(int);
+                    }
+                }
+                memcpy(out + ((layers - 1) * stride), u, stride);
+                if (layers >= 2)
+                {
+                    two_back = out - 2 * stride;
+                }
+
+                if (delays)
+                {
+                    (*delays)[layers - 1U] = g.delay;
+                }
+            }
+        } while (u != 0);
+
+        // free temp buffer;
+        STBI_FREE(g.out);
+        STBI_FREE(g.history);
+        STBI_FREE(g.background);
+
+        // do the final conversion after loading everything;
+        if (req_comp && req_comp != 4)
+            out = stbi__convert_format(out, 4, req_comp, layers * g.w, g.h);
+
+        *z = layers;
+        return out;
+    }
+    else
+    {
+        return stbi__errpuc("not GIF", "Image was not as a gif type.");
+    }
+}
+
+static void *stbi__gif_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    stbi_uc *u = 0;
+    stbi__gif g;
+    memset(&g, 0, sizeof(g));
+    STBI_NOTUSED(ri);
+
+    u = stbi__gif_load_next(s, &g, comp, req_comp, 0);
+    if (u == (stbi_uc *)s)
+        u = 0; // end of animated gif marker
+    if (u)
+    {
+        *x = g.w;
+        *y = g.h;
+
+        // moved conversion to after successful load so that the same
+        // can be done for multiple frames.
+        if (req_comp && req_comp != 4)
+            u = stbi__convert_format(u, 4, req_comp, g.w, g.h);
+    }
+    else if (g.out)
+    {
+        // if there was an error and we allocated an image buffer, free it!
+        STBI_FREE(g.out);
+    }
+
+    // free buffers needed for multiple frame loading;
+    STBI_FREE(g.history);
+    STBI_FREE(g.background);
+
+    return u;
+}
+
+static int stbi__gif_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    return stbi__gif_info_raw(s, x, y, comp);
+}
+#endif
+
+// *************************************************************************************************
+// Radiance RGBE HDR loader
+// originally by Nicolas Schulz
+#ifndef STBI_NO_HDR
+static int stbi__hdr_test_core(stbi__context *s, const char *signature)
+{
+    int i;
+    for (i = 0; signature[i]; ++i)
+        if (stbi__get8(s) != signature[i])
+            return 0;
+    stbi__rewind(s);
+    return 1;
+}
+
+static int stbi__hdr_test(stbi__context *s)
+{
+    int r = stbi__hdr_test_core(s, "#?RADIANCE\n");
+    stbi__rewind(s);
+    if (!r)
+    {
+        r = stbi__hdr_test_core(s, "#?RGBE\n");
+        stbi__rewind(s);
+    }
+    return r;
+}
+
+#define STBI__HDR_BUFLEN 1024
+static char *stbi__hdr_gettoken(stbi__context *z, char *buffer)
+{
+    int len = 0;
+    char c = '\0';
+
+    c = (char)stbi__get8(z);
+
+    while (!stbi__at_eof(z) && c != '\n')
+    {
+        buffer[len++] = c;
+        if (len == STBI__HDR_BUFLEN - 1)
+        {
+            // flush to end of line
+            while (!stbi__at_eof(z) && stbi__get8(z) != '\n')
+                ;
+            break;
+        }
+        c = (char)stbi__get8(z);
+    }
+
+    buffer[len] = 0;
+    return buffer;
+}
+
+static void stbi__hdr_convert(float *output, stbi_uc *input, int req_comp)
+{
+    if (input[3] != 0)
+    {
+        float f1;
+        // Exponent
+        f1 = (float)ldexp(1.0f, input[3] - (int)(128 + 8));
+        if (req_comp <= 2)
+            output[0] = (input[0] + input[1] + input[2]) * f1 / 3;
+        else
+        {
+            output[0] = input[0] * f1;
+            output[1] = input[1] * f1;
+            output[2] = input[2] * f1;
+        }
+        if (req_comp == 2)
+            output[1] = 1;
+        if (req_comp == 4)
+            output[3] = 1;
+    }
+    else
+    {
+        switch (req_comp)
+        {
+        case 4:
+            output[3] = 1; /* fallthrough */
+        case 3:
+            output[0] = output[1] = output[2] = 0;
+            break;
+        case 2:
+            output[1] = 1; /* fallthrough */
+        case 1:
+            output[0] = 0;
+            break;
+        }
+    }
+}
+
+static float *stbi__hdr_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    char buffer[STBI__HDR_BUFLEN];
+    char *token;
+    int valid = 0;
+    int width, height;
+    stbi_uc *scanline;
+    float *hdr_data;
+    int len;
+    unsigned char count, value;
+    int i, j, k, c1, c2, z;
+    const char *headerToken;
+    STBI_NOTUSED(ri);
+
+    // Check identifier
+    headerToken = stbi__hdr_gettoken(s, buffer);
+    if (strcmp(headerToken, "#?RADIANCE") != 0 && strcmp(headerToken, "#?RGBE") != 0)
+        return stbi__errpf("not HDR", "Corrupt HDR image");
+
+    // Parse header
+    for (;;)
+    {
+        token = stbi__hdr_gettoken(s, buffer);
+        if (token[0] == 0)
+            break;
+        if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0)
+            valid = 1;
+    }
+
+    if (!valid)
+        return stbi__errpf("unsupported format", "Unsupported HDR format");
+
+    // Parse width and height
+    // can't use sscanf() if we're not using stdio!
+    token = stbi__hdr_gettoken(s, buffer);
+    if (strncmp(token, "-Y ", 3))
+        return stbi__errpf("unsupported data layout", "Unsupported HDR format");
+    token += 3;
+    height = (int)strtol(token, &token, 10);
+    while (*token == ' ')
+        ++token;
+    if (strncmp(token, "+X ", 3))
+        return stbi__errpf("unsupported data layout", "Unsupported HDR format");
+    token += 3;
+    width = (int)strtol(token, NULL, 10);
+
+    if (height > STBI_MAX_DIMENSIONS)
+        return stbi__errpf("too large", "Very large image (corrupt?)");
+    if (width > STBI_MAX_DIMENSIONS)
+        return stbi__errpf("too large", "Very large image (corrupt?)");
+
+    *x = width;
+    *y = height;
+
+    if (comp)
+        *comp = 3;
+    if (req_comp == 0)
+        req_comp = 3;
+
+    if (!stbi__mad4sizes_valid(width, height, req_comp, sizeof(float), 0))
+        return stbi__errpf("too large", "HDR image is too large");
+
+    // Read data
+    hdr_data = (float *)stbi__malloc_mad4(width, height, req_comp, sizeof(float), 0);
+    if (!hdr_data)
+        return stbi__errpf("outofmem", "Out of memory");
+
+    // Load image data
+    // image data is stored as some number of sca
+    if (width < 8 || width >= 32768)
+    {
+        // Read flat data
+        for (j = 0; j < height; ++j)
+        {
+            for (i = 0; i < width; ++i)
+            {
+                stbi_uc rgbe[4];
+            main_decode_loop:
+                stbi__getn(s, rgbe, 4);
+                stbi__hdr_convert(hdr_data + j * width * req_comp + i * req_comp, rgbe, req_comp);
+            }
+        }
+    }
+    else
+    {
+        // Read RLE-encoded data
+        scanline = NULL;
+
+        for (j = 0; j < height; ++j)
+        {
+            c1 = stbi__get8(s);
+            c2 = stbi__get8(s);
+            len = stbi__get8(s);
+            if (c1 != 2 || c2 != 2 || (len & 0x80))
+            {
+                // not run-length encoded, so we have to actually use THIS data as a decoded
+                // pixel (note this can't be a valid pixel--one of RGB must be >= 128)
+                stbi_uc rgbe[4];
+                rgbe[0] = (stbi_uc)c1;
+                rgbe[1] = (stbi_uc)c2;
+                rgbe[2] = (stbi_uc)len;
+                rgbe[3] = (stbi_uc)stbi__get8(s);
+                stbi__hdr_convert(hdr_data, rgbe, req_comp);
+                i = 1;
+                j = 0;
+                STBI_FREE(scanline);
+                goto main_decode_loop; // yes, this makes no sense
+            }
+            len <<= 8;
+            len |= stbi__get8(s);
+            if (len != width)
+            {
+                STBI_FREE(hdr_data);
+                STBI_FREE(scanline);
+                return stbi__errpf("invalid decoded scanline length", "corrupt HDR");
+            }
+            if (scanline == NULL)
+            {
+                scanline = (stbi_uc *)stbi__malloc_mad2(width, 4, 0);
+                if (!scanline)
+                {
+                    STBI_FREE(hdr_data);
+                    return stbi__errpf("outofmem", "Out of memory");
+                }
+            }
+
+            for (k = 0; k < 4; ++k)
+            {
+                int nleft;
+                i = 0;
+                while ((nleft = width - i) > 0)
+                {
+                    count = stbi__get8(s);
+                    if (count > 128)
+                    {
+                        // Run
+                        value = stbi__get8(s);
+                        count -= 128;
+                        if ((count == 0) || (count > nleft))
+                        {
+                            STBI_FREE(hdr_data);
+                            STBI_FREE(scanline);
+                            return stbi__errpf("corrupt", "bad RLE data in HDR");
+                        }
+                        for (z = 0; z < count; ++z)
+                            scanline[i++ * 4 + k] = value;
+                    }
+                    else
+                    {
+                        // Dump
+                        if ((count == 0) || (count > nleft))
+                        {
+                            STBI_FREE(hdr_data);
+                            STBI_FREE(scanline);
+                            return stbi__errpf("corrupt", "bad RLE data in HDR");
+                        }
+                        for (z = 0; z < count; ++z)
+                            scanline[i++ * 4 + k] = stbi__get8(s);
+                    }
+                }
+            }
+            for (i = 0; i < width; ++i)
+                stbi__hdr_convert(hdr_data + (j * width + i) * req_comp, scanline + i * 4, req_comp);
+        }
+        if (scanline)
+            STBI_FREE(scanline);
+    }
+
+    return hdr_data;
+}
+
+static int stbi__hdr_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    char buffer[STBI__HDR_BUFLEN];
+    char *token;
+    int valid = 0;
+    int dummy;
+
+    if (!x)
+        x = &dummy;
+    if (!y)
+        y = &dummy;
+    if (!comp)
+        comp = &dummy;
+
+    if (stbi__hdr_test(s) == 0)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+
+    for (;;)
+    {
+        token = stbi__hdr_gettoken(s, buffer);
+        if (token[0] == 0)
+            break;
+        if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0)
+            valid = 1;
+    }
+
+    if (!valid)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    token = stbi__hdr_gettoken(s, buffer);
+    if (strncmp(token, "-Y ", 3))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    token += 3;
+    *y = (int)strtol(token, &token, 10);
+    while (*token == ' ')
+        ++token;
+    if (strncmp(token, "+X ", 3))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    token += 3;
+    *x = (int)strtol(token, NULL, 10);
+    *comp = 3;
+    return 1;
+}
+#endif // STBI_NO_HDR
+
+#ifndef STBI_NO_BMP
+static int stbi__bmp_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    void *p;
+    stbi__bmp_data info;
+
+    info.all_a = 255;
+    p = stbi__bmp_parse_header(s, &info);
+    if (p == NULL)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    if (x)
+        *x = s->img_x;
+    if (y)
+        *y = s->img_y;
+    if (comp)
+    {
+        if (info.bpp == 24 && info.ma == 0xff000000)
+            *comp = 3;
+        else
+            *comp = info.ma ? 4 : 3;
+    }
+    return 1;
+}
+#endif
+
+#ifndef STBI_NO_PSD
+static int stbi__psd_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    int channelCount, dummy, depth;
+    if (!x)
+        x = &dummy;
+    if (!y)
+        y = &dummy;
+    if (!comp)
+        comp = &dummy;
+    if (stbi__get32be(s) != 0x38425053)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    if (stbi__get16be(s) != 1)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    stbi__skip(s, 6);
+    channelCount = stbi__get16be(s);
+    if (channelCount < 0 || channelCount > 16)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    *y = stbi__get32be(s);
+    *x = stbi__get32be(s);
+    depth = stbi__get16be(s);
+    if (depth != 8 && depth != 16)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    if (stbi__get16be(s) != 3)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    *comp = 4;
+    return 1;
+}
+
+static int stbi__psd_is16(stbi__context *s)
+{
+    int channelCount, depth;
+    if (stbi__get32be(s) != 0x38425053)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    if (stbi__get16be(s) != 1)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    stbi__skip(s, 6);
+    channelCount = stbi__get16be(s);
+    if (channelCount < 0 || channelCount > 16)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    STBI_NOTUSED(stbi__get32be(s));
+    STBI_NOTUSED(stbi__get32be(s));
+    depth = stbi__get16be(s);
+    if (depth != 16)
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    return 1;
+}
+#endif
+
+#ifndef STBI_NO_PIC
+static int stbi__pic_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    int act_comp = 0, num_packets = 0, chained, dummy;
+    stbi__pic_packet packets[10];
+
+    if (!x)
+        x = &dummy;
+    if (!y)
+        y = &dummy;
+    if (!comp)
+        comp = &dummy;
+
+    if (!stbi__pic_is4(s, "\x53\x80\xF6\x34"))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+
+    stbi__skip(s, 88);
+
+    *x = stbi__get16be(s);
+    *y = stbi__get16be(s);
+    if (stbi__at_eof(s))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    if ((*x) != 0 && (1 << 28) / (*x) < (*y))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+
+    stbi__skip(s, 8);
+
+    do
+    {
+        stbi__pic_packet *packet;
+
+        if (num_packets == sizeof(packets) / sizeof(packets[0]))
+            return 0;
+
+        packet = &packets[num_packets++];
+        chained = stbi__get8(s);
+        packet->size = stbi__get8(s);
+        packet->type = stbi__get8(s);
+        packet->channel = stbi__get8(s);
+        act_comp |= packet->channel;
+
+        if (stbi__at_eof(s))
+        {
+            stbi__rewind(s);
+            return 0;
+        }
+        if (packet->size != 8)
+        {
+            stbi__rewind(s);
+            return 0;
+        }
+    } while (chained);
+
+    *comp = (act_comp & 0x10 ? 4 : 3);
+
+    return 1;
+}
+#endif
+
+// *************************************************************************************************
+// Portable Gray Map and Portable Pixel Map loader
+// by Ken Miller
+//
+// PGM: http://netpbm.sourceforge.net/doc/pgm.html
+// PPM: http://netpbm.sourceforge.net/doc/ppm.html
+//
+// Known limitations:
+//    Does not support comments in the header section
+//    Does not support ASCII image data (formats P2 and P3)
+
+#ifndef STBI_NO_PNM
+
+static int stbi__pnm_test(stbi__context *s)
+{
+    char p, t;
+    p = (char)stbi__get8(s);
+    t = (char)stbi__get8(s);
+    if (p != 'P' || (t != '5' && t != '6'))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+    return 1;
+}
+
+static void *stbi__pnm_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri)
+{
+    stbi_uc *out;
+    STBI_NOTUSED(ri);
+
+    ri->bits_per_channel = stbi__pnm_info(s, (int *)&s->img_x, (int *)&s->img_y, (int *)&s->img_n);
+    if (ri->bits_per_channel == 0)
+        return 0;
+
+    if (s->img_y > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+    if (s->img_x > STBI_MAX_DIMENSIONS)
+        return stbi__errpuc("too large", "Very large image (corrupt?)");
+
+    *x = s->img_x;
+    *y = s->img_y;
+    if (comp)
+        *comp = s->img_n;
+
+    if (!stbi__mad4sizes_valid(s->img_n, s->img_x, s->img_y, ri->bits_per_channel / 8, 0))
+        return stbi__errpuc("too large", "PNM too large");
+
+    out = (stbi_uc *)stbi__malloc_mad4(s->img_n, s->img_x, s->img_y, ri->bits_per_channel / 8, 0);
+    if (!out)
+        return stbi__errpuc("outofmem", "Out of memory");
+    if (!stbi__getn(s, out, s->img_n * s->img_x * s->img_y * (ri->bits_per_channel / 8)))
+    {
+        STBI_FREE(out);
+        return stbi__errpuc("bad PNM", "PNM file truncated");
+    }
+
+    if (req_comp && req_comp != s->img_n)
+    {
+        if (ri->bits_per_channel == 16)
+        {
+            out = (stbi_uc *)stbi__convert_format16((stbi__uint16 *)out, s->img_n, req_comp, s->img_x, s->img_y);
+        }
+        else
+        {
+            out = stbi__convert_format(out, s->img_n, req_comp, s->img_x, s->img_y);
+        }
+        if (out == NULL)
+            return out; // stbi__convert_format frees input on failure
+    }
+    return out;
+}
+
+static int stbi__pnm_isspace(char c)
+{
+    return c == ' ' || c == '\t' || c == '\n' || c == '\v' || c == '\f' || c == '\r';
+}
+
+static void stbi__pnm_skip_whitespace(stbi__context *s, char *c)
+{
+    for (;;)
+    {
+        while (!stbi__at_eof(s) && stbi__pnm_isspace(*c))
+            *c = (char)stbi__get8(s);
+
+        if (stbi__at_eof(s) || *c != '#')
+            break;
+
+        while (!stbi__at_eof(s) && *c != '\n' && *c != '\r')
+            *c = (char)stbi__get8(s);
+    }
+}
+
+static int stbi__pnm_isdigit(char c)
+{
+    return c >= '0' && c <= '9';
+}
+
+static int stbi__pnm_getinteger(stbi__context *s, char *c)
+{
+    int value = 0;
+
+    while (!stbi__at_eof(s) && stbi__pnm_isdigit(*c))
+    {
+        value = value * 10 + (*c - '0');
+        *c = (char)stbi__get8(s);
+        if ((value > 214748364) || (value == 214748364 && *c > '7'))
+            return stbi__err("integer parse overflow", "Parsing an integer in the PPM header overflowed a 32-bit int");
+    }
+
+    return value;
+}
+
+static int stbi__pnm_info(stbi__context *s, int *x, int *y, int *comp)
+{
+    int maxv, dummy;
+    char c, p, t;
+
+    if (!x)
+        x = &dummy;
+    if (!y)
+        y = &dummy;
+    if (!comp)
+        comp = &dummy;
+
+    stbi__rewind(s);
+
+    // Get identifier
+    p = (char)stbi__get8(s);
+    t = (char)stbi__get8(s);
+    if (p != 'P' || (t != '5' && t != '6'))
+    {
+        stbi__rewind(s);
+        return 0;
+    }
+
+    *comp = (t == '6') ? 3 : 1; // '5' is 1-component .pgm; '6' is 3-component .ppm
+
+    c = (char)stbi__get8(s);
+    stbi__pnm_skip_whitespace(s, &c);
+
+    *x = stbi__pnm_getinteger(s, &c); // read width
+    if (*x == 0)
+        return stbi__err("invalid width", "PPM image header had zero or overflowing width");
+    stbi__pnm_skip_whitespace(s, &c);
+
+    *y = stbi__pnm_getinteger(s, &c); // read height
+    if (*y == 0)
+        return stbi__err("invalid width", "PPM image header had zero or overflowing width");
+    stbi__pnm_skip_whitespace(s, &c);
+
+    maxv = stbi__pnm_getinteger(s, &c); // read max value
+    if (maxv > 65535)
+        return stbi__err("max value > 65535", "PPM image supports only 8-bit and 16-bit images");
+    else if (maxv > 255)
+        return 16;
+    else
+        return 8;
+}
+
+static int stbi__pnm_is16(stbi__context *s)
+{
+    if (stbi__pnm_info(s, NULL, NULL, NULL) == 16)
+        return 1;
+    return 0;
+}
+#endif
+
+static int stbi__info_main(stbi__context *s, int *x, int *y, int *comp)
+{
+#ifndef STBI_NO_JPEG
+    if (stbi__jpeg_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_PNG
+    if (stbi__png_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_GIF
+    if (stbi__gif_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_BMP
+    if (stbi__bmp_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_PSD
+    if (stbi__psd_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_PIC
+    if (stbi__pic_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_PNM
+    if (stbi__pnm_info(s, x, y, comp))
+        return 1;
+#endif
+
+#ifndef STBI_NO_HDR
+    if (stbi__hdr_info(s, x, y, comp))
+        return 1;
+#endif
+
+// test tga last because it's a crappy test!
+#ifndef STBI_NO_TGA
+    if (stbi__tga_info(s, x, y, comp))
+        return 1;
+#endif
+    return stbi__err("unknown image type", "Image not of any known type, or corrupt");
+}
+
+static int stbi__is_16_main(stbi__context *s)
+{
+#ifndef STBI_NO_PNG
+    if (stbi__png_is16(s))
+        return 1;
+#endif
+
+#ifndef STBI_NO_PSD
+    if (stbi__psd_is16(s))
+        return 1;
+#endif
+
+#ifndef STBI_NO_PNM
+    if (stbi__pnm_is16(s))
+        return 1;
+#endif
+    return 0;
+}
+
+#ifndef STBI_NO_STDIO
+STBIDEF int stbi_info(char const *filename, int *x, int *y, int *comp)
+{
+    FILE *f = stbi__fopen(filename, "rb");
+    int result;
+    if (!f)
+        return stbi__err("can't fopen", "Unable to open file");
+    result = stbi_info_from_file(f, x, y, comp);
+    fclose(f);
+    return result;
+}
+
+STBIDEF int stbi_info_from_file(FILE *f, int *x, int *y, int *comp)
+{
+    int r;
+    stbi__context s;
+    long pos = ftell(f);
+    stbi__start_file(&s, f);
+    r = stbi__info_main(&s, x, y, comp);
+    fseek(f, pos, SEEK_SET);
+    return r;
+}
+
+STBIDEF int stbi_is_16_bit(char const *filename)
+{
+    FILE *f = stbi__fopen(filename, "rb");
+    int result;
+    if (!f)
+        return stbi__err("can't fopen", "Unable to open file");
+    result = stbi_is_16_bit_from_file(f);
+    fclose(f);
+    return result;
+}
+
+STBIDEF int stbi_is_16_bit_from_file(FILE *f)
+{
+    int r;
+    stbi__context s;
+    long pos = ftell(f);
+    stbi__start_file(&s, f);
+    r = stbi__is_16_main(&s);
+    fseek(f, pos, SEEK_SET);
+    return r;
+}
+#endif // !STBI_NO_STDIO
+
+STBIDEF int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp)
+{
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+    return stbi__info_main(&s, x, y, comp);
+}
+
+STBIDEF int stbi_info_from_callbacks(stbi_io_callbacks const *c, void *user, int *x, int *y, int *comp)
+{
+    stbi__context s;
+    stbi__start_callbacks(&s, (stbi_io_callbacks *)c, user);
+    return stbi__info_main(&s, x, y, comp);
+}
+
+STBIDEF int stbi_is_16_bit_from_memory(stbi_uc const *buffer, int len)
+{
+    stbi__context s;
+    stbi__start_mem(&s, buffer, len);
+    return stbi__is_16_main(&s);
+}
+
+STBIDEF int stbi_is_16_bit_from_callbacks(stbi_io_callbacks const *c, void *user)
+{
+    stbi__context s;
+    stbi__start_callbacks(&s, (stbi_io_callbacks *)c, user);
+    return stbi__is_16_main(&s);
+}
+
+#endif // STB_IMAGE_IMPLEMENTATION
+
+/*
+   revision history:
+      2.20  (2019-02-07) support utf8 filenames in Windows; fix warnings and platform ifdefs
+      2.19  (2018-02-11) fix warning
+      2.18  (2018-01-30) fix warnings
+      2.17  (2018-01-29) change sbti__shiftsigned to avoid clang -O2 bug
+                         1-bit BMP
+                         *_is_16_bit api
+                         avoid warnings
+      2.16  (2017-07-23) all functions have 16-bit variants;
+                         STBI_NO_STDIO works again;
+                         compilation fixes;
+                         fix rounding in unpremultiply;
+                         optimize vertical flip;
+                         disable raw_len validation;
+                         documentation fixes
+      2.15  (2017-03-18) fix png-1,2,4 bug; now all Imagenet JPGs decode;
+                         warning fixes; disable run-time SSE detection on gcc;
+                         uniform handling of optional "return" values;
+                         thread-safe initialization of zlib tables
+      2.14  (2017-03-03) remove deprecated STBI_JPEG_OLD; fixes for Imagenet JPGs
+      2.13  (2016-11-29) add 16-bit API, only supported for PNG right now
+      2.12  (2016-04-02) fix typo in 2.11 PSD fix that caused crashes
+      2.11  (2016-04-02) allocate large structures on the stack
+                         remove white matting for transparent PSD
+                         fix reported channel count for PNG & BMP
+                         re-enable SSE2 in non-gcc 64-bit
+                         support RGB-formatted JPEG
+                         read 16-bit PNGs (only as 8-bit)
+      2.10  (2016-01-22) avoid warning introduced in 2.09 by STBI_REALLOC_SIZED
+      2.09  (2016-01-16) allow comments in PNM files
+                         16-bit-per-pixel TGA (not bit-per-component)
+                         info() for TGA could break due to .hdr handling
+                         info() for BMP to shares code instead of sloppy parse
+                         can use STBI_REALLOC_SIZED if allocator doesn't support realloc
+                         code cleanup
+      2.08  (2015-09-13) fix to 2.07 cleanup, reading RGB PSD as RGBA
+      2.07  (2015-09-13) fix compiler warnings
+                         partial animated GIF support
+                         limited 16-bpc PSD support
+                         #ifdef unused functions
+                         bug with < 92 byte PIC,PNM,HDR,TGA
+      2.06  (2015-04-19) fix bug where PSD returns wrong '*comp' value
+      2.05  (2015-04-19) fix bug in progressive JPEG handling, fix warning
+      2.04  (2015-04-15) try to re-enable SIMD on MinGW 64-bit
+      2.03  (2015-04-12) extra corruption checking (mmozeiko)
+                         stbi_set_flip_vertically_on_load (nguillemot)
+                         fix NEON support; fix mingw support
+      2.02  (2015-01-19) fix incorrect assert, fix warning
+      2.01  (2015-01-17) fix various warnings; suppress SIMD on gcc 32-bit without -msse2
+      2.00b (2014-12-25) fix STBI_MALLOC in progressive JPEG
+      2.00  (2014-12-25) optimize JPG, including x86 SSE2 & NEON SIMD (ryg)
+                         progressive JPEG (stb)
+                         PGM/PPM support (Ken Miller)
+                         STBI_MALLOC,STBI_REALLOC,STBI_FREE
+                         GIF bugfix -- seemingly never worked
+                         STBI_NO_*, STBI_ONLY_*
+      1.48  (2014-12-14) fix incorrectly-named assert()
+      1.47  (2014-12-14) 1/2/4-bit PNG support, both direct and paletted (Omar Cornut & stb)
+                         optimize PNG (ryg)
+                         fix bug in interlaced PNG with user-specified channel count (stb)
+      1.46  (2014-08-26)
+              fix broken tRNS chunk (colorkey-style transparency) in non-paletted PNG
+      1.45  (2014-08-16)
+              fix MSVC-ARM internal compiler error by wrapping malloc
+      1.44  (2014-08-07)
+              various warning fixes from Ronny Chevalier
+      1.43  (2014-07-15)
+              fix MSVC-only compiler problem in code changed in 1.42
+      1.42  (2014-07-09)
+              don't define _CRT_SECURE_NO_WARNINGS (affects user code)
+              fixes to stbi__cleanup_jpeg path
+              added STBI_ASSERT to avoid requiring assert.h
+      1.41  (2014-06-25)
+              fix search&replace from 1.36 that messed up comments/error messages
+      1.40  (2014-06-22)
+              fix gcc struct-initialization warning
+      1.39  (2014-06-15)
+              fix to TGA optimization when req_comp != number of components in TGA;
+              fix to GIF loading because BMP wasn't rewinding (whoops, no GIFs in my test suite)
+              add support for BMP version 5 (more ignored fields)
+      1.38  (2014-06-06)
+              suppress MSVC warnings on integer casts truncating values
+              fix accidental rename of 'skip' field of I/O
+      1.37  (2014-06-04)
+              remove duplicate typedef
+      1.36  (2014-06-03)
+              convert to header file single-file library
+              if de-iphone isn't set, load iphone images color-swapped instead of returning NULL
+      1.35  (2014-05-27)
+              various warnings
+              fix broken STBI_SIMD path
+              fix bug where stbi_load_from_file no longer left file pointer in correct place
+              fix broken non-easy path for 32-bit BMP (possibly never used)
+              TGA optimization by Arseny Kapoulkine
+      1.34  (unknown)
+              use STBI_NOTUSED in stbi__resample_row_generic(), fix one more leak in tga failure case
+      1.33  (2011-07-14)
+              make stbi_is_hdr work in STBI_NO_HDR (as specified), minor compiler-friendly improvements
+      1.32  (2011-07-13)
+              support for "info" function for all supported filetypes (SpartanJ)
+      1.31  (2011-06-20)
+              a few more leak fixes, bug in PNG handling (SpartanJ)
+      1.30  (2011-06-11)
+              added ability to load files via callbacks to accomidate custom input streams (Ben Wenger)
+              removed deprecated format-specific test/load functions
+              removed support for installable file formats (stbi_loader) -- would have been broken for IO callbacks anyway
+              error cases in bmp and tga give messages and don't leak (Raymond Barbiero, grisha)
+              fix inefficiency in decoding 32-bit BMP (David Woo)
+      1.29  (2010-08-16)
+              various warning fixes from Aurelien Pocheville
+      1.28  (2010-08-01)
+              fix bug in GIF palette transparency (SpartanJ)
+      1.27  (2010-08-01)
+              cast-to-stbi_uc to fix warnings
+      1.26  (2010-07-24)
+              fix bug in file buffering for PNG reported by SpartanJ
+      1.25  (2010-07-17)
+              refix trans_data warning (Won Chun)
+      1.24  (2010-07-12)
+              perf improvements reading from files on platforms with lock-heavy fgetc()
+              minor perf improvements for jpeg
+              deprecated type-specific functions so we'll get feedback if they're needed
+              attempt to fix trans_data warning (Won Chun)
+      1.23    fixed bug in iPhone support
+      1.22  (2010-07-10)
+              removed image *writing* support
+              stbi_info support from Jetro Lauha
+              GIF support from Jean-Marc Lienher
+              iPhone PNG-extensions from James Brown
+              warning-fixes from Nicolas Schulz and Janez Zemva (i.stbi__err. Janez (U+017D)emva)
+      1.21    fix use of 'stbi_uc' in header (reported by jon blow)
+      1.20    added support for Softimage PIC, by Tom Seddon
+      1.19    bug in interlaced PNG corruption check (found by ryg)
+      1.18  (2008-08-02)
+              fix a threading bug (local mutable static)
+      1.17    support interlaced PNG
+      1.16    major bugfix - stbi__convert_format converted one too many pixels
+      1.15    initialize some fields for thread safety
+      1.14    fix threadsafe conversion bug
+              header-file-only version (#define STBI_HEADER_FILE_ONLY before including)
+      1.13    threadsafe
+      1.12    const qualifiers in the API
+      1.11    Support installable IDCT, colorspace conversion routines
+      1.10    Fixes for 64-bit (don't use "unsigned long")
+              optimized upsampling by Fabian "ryg" Giesen
+      1.09    Fix format-conversion for PSD code (bad global variables!)
+      1.08    Thatcher Ulrich's PSD code integrated by Nicolas Schulz
+      1.07    attempt to fix C++ warning/errors again
+      1.06    attempt to fix C++ warning/errors again
+      1.05    fix TGA loading to return correct *comp and use good luminance calc
+      1.04    default float alpha is 1, not 255; use 'void *' for stbi_image_free
+      1.03    bugfixes to STBI_NO_STDIO, STBI_NO_HDR
+      1.02    support for (subset of) HDR files, float interface for preferred access to them
+      1.01    fix bug: possible bug in handling right-side up bmps... not sure
+              fix bug: the stbi__bmp_load() and stbi__tga_load() functions didn't work at all
+      1.00    interface to zlib that skips zlib header
+      0.99    correct handling of alpha in palette
+      0.98    TGA loader by lonesock; dynamically add loaders (untested)
+      0.97    jpeg errors on too large a file; also catch another malloc failure
+      0.96    fix detection of invalid v value - particleman@mollyrocket forum
+      0.95    during header scan, seek to markers in case of padding
+      0.94    STBI_NO_STDIO to disable stdio usage; rename all #defines the same
+      0.93    handle jpegtran output; verbose errors
+      0.92    read 4,8,16,24,32-bit BMP files of several formats
+      0.91    output 24-bit Windows 3.0 BMP files
+      0.90    fix a few more warnings; bump version number to approach 1.0
+      0.61    bugfixes due to Marc LeBlanc, Christopher Lloyd
+      0.60    fix compiling as c++
+      0.59    fix warnings: merge Dave Moore's -Wall fixes
+      0.58    fix bug: zlib uncompressed mode len/nlen was wrong endian
+      0.57    fix bug: jpg last huffman symbol before marker was >9 bits but less than 16 available
+      0.56    fix bug: zlib uncompressed mode len vs. nlen
+      0.55    fix bug: restart_interval not initialized to 0
+      0.54    allow NULL for 'int *comp'
+      0.53    fix bug in png 3->4; speedup png decoding
+      0.52    png handles req_comp=3,4 directly; minor cleanup; jpeg comments
+      0.51    obey req_comp requests, 1-component jpegs return as 1-component,
+              on 'test' only check type, not whether we support this variant
+      0.50  (2006-11-19)
+              first released version
+*/
+
+/*
+------------------------------------------------------------------------------
+This software is available under 2 licenses -- choose whichever you prefer.
+------------------------------------------------------------------------------
+ALTERNATIVE A - MIT License
+Copyright (c) 2017 Sean Barrett
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+------------------------------------------------------------------------------
+ALTERNATIVE B - Public Domain (www.unlicense.org)
+This is free and unencumbered software released into the public domain.
+Anyone is free to copy, modify, publish, use, compile, sell, or distribute this
+software, either in source code form or as a compiled binary, for any purpose,
+commercial or non-commercial, and by any means.
+In jurisdictions that recognize copyright laws, the author or authors of this
+software dedicate any and all copyright interest in the software to the public
+domain. We make this dedication for the benefit of the public at large and to
+the detriment of our heirs and successors. We intend this dedication to be an
+overt act of relinquishment in perpetuity of all present and future rights to
+this software under copyright law.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+------------------------------------------------------------------------------
+*/
diff --git a/Kernel/include/stb/image_resize.h b/Kernel/include/stb/image_resize.h
new file mode 100644
index 00000000..46c7c897
--- /dev/null
+++ b/Kernel/include/stb/image_resize.h
@@ -0,0 +1,2946 @@
+/* stb_image_resize - v0.97 - public domain image resizing
+   by Jorge L Rodriguez (@VinoBS) - 2014
+   http://github.com/nothings/stb
+
+   Written with emphasis on usability, portability, and efficiency. (No
+   SIMD or threads, so it be easily outperformed by libs that use those.)
+   Only scaling and translation is supported, no rotations or shears.
+   Easy API downsamples w/Mitchell filter, upsamples w/cubic interpolation.
+
+   COMPILING & LINKING
+      In one C/C++ file that #includes this file, do this:
+         #define STB_IMAGE_RESIZE_IMPLEMENTATION
+      before the #include. That will create the implementation in that file.
+
+   QUICKSTART
+      stbir_resize_uint8(      input_pixels , in_w , in_h , 0,
+                               output_pixels, out_w, out_h, 0, num_channels)
+      stbir_resize_float(...)
+      stbir_resize_uint8_srgb( input_pixels , in_w , in_h , 0,
+                               output_pixels, out_w, out_h, 0,
+                               num_channels , alpha_chan  , 0)
+      stbir_resize_uint8_srgb_edgemode(
+                               input_pixels , in_w , in_h , 0,
+                               output_pixels, out_w, out_h, 0,
+                               num_channels , alpha_chan  , 0, STBIR_EDGE_CLAMP)
+                                                            // WRAP/REFLECT/ZERO
+
+   FULL API
+      See the "header file" section of the source for API documentation.
+
+   ADDITIONAL DOCUMENTATION
+
+      SRGB & FLOATING POINT REPRESENTATION
+         The sRGB functions presume IEEE floating point. If you do not have
+         IEEE floating point, define STBIR_NON_IEEE_FLOAT. This will use
+         a slower implementation.
+
+      MEMORY ALLOCATION
+         The resize functions here perform a single memory allocation using
+         malloc. To control the memory allocation, before the #include that
+         triggers the implementation, do:
+
+            #define STBIR_MALLOC(size,context) ...
+            #define STBIR_FREE(ptr,context)   ...
+
+         Each resize function makes exactly one call to malloc/free, so to use
+         temp memory, store the temp memory in the context and return that.
+
+      ASSERT
+         Define STBIR_ASSERT(boolval) to override assert() and not use assert.h
+
+      OPTIMIZATION
+         Define STBIR_SATURATE_INT to compute clamp values in-range using
+         integer operations instead of float operations. This may be faster
+         on some platforms.
+
+      DEFAULT FILTERS
+         For functions which don't provide explicit control over what filters
+         to use, you can change the compile-time defaults with
+
+            #define STBIR_DEFAULT_FILTER_UPSAMPLE     STBIR_FILTER_something
+            #define STBIR_DEFAULT_FILTER_DOWNSAMPLE   STBIR_FILTER_something
+
+         See stbir_filter in the header-file section for the list of filters.
+
+      NEW FILTERS
+         A number of 1D filter kernels are used. For a list of
+         supported filters see the stbir_filter enum. To add a new filter,
+         write a filter function and add it to stbir__filter_info_table.
+
+      PROGRESS
+         For interactive use with slow resize operations, you can install
+         a progress-report callback:
+
+            #define STBIR_PROGRESS_REPORT(val)   some_func(val)
+
+         The parameter val is a float which goes from 0 to 1 as progress is made.
+
+         For example:
+
+            static void my_progress_report(float progress);
+            #define STBIR_PROGRESS_REPORT(val) my_progress_report(val)
+
+            #define STB_IMAGE_RESIZE_IMPLEMENTATION
+            #include "stb_image_resize.h"
+
+            static void my_progress_report(float progress)
+            {
+               printf("Progress: %f%%\n", progress*100);
+            }
+
+      MAX CHANNELS
+         If your image has more than 64 channels, define STBIR_MAX_CHANNELS
+         to the max you'll have.
+
+      ALPHA CHANNEL
+         Most of the resizing functions provide the ability to control how
+         the alpha channel of an image is processed. The important things
+         to know about this:
+
+         1. The best mathematically-behaved version of alpha to use is
+         called "premultiplied alpha", in which the other color channels
+         have had the alpha value multiplied in. If you use premultiplied
+         alpha, linear filtering (such as image resampling done by this
+         library, or performed in texture units on GPUs) does the "right
+         thing". While premultiplied alpha is standard in the movie CGI
+         industry, it is still uncommon in the videogame/real-time world.
+
+         If you linearly filter non-premultiplied alpha, strange effects
+         occur. (For example, the 50/50 average of 99% transparent bright green
+         and 1% transparent black produces 50% transparent dark green when
+         non-premultiplied, whereas premultiplied it produces 50%
+         transparent near-black. The former introduces green energy
+         that doesn't exist in the source image.)
+
+         2. Artists should not edit premultiplied-alpha images; artists
+         want non-premultiplied alpha images. Thus, art tools generally output
+         non-premultiplied alpha images.
+
+         3. You will get best results in most cases by converting images
+         to premultiplied alpha before processing them mathematically.
+
+         4. If you pass the flag STBIR_FLAG_ALPHA_PREMULTIPLIED, the
+         resizer does not do anything special for the alpha channel;
+         it is resampled identically to other channels. This produces
+         the correct results for premultiplied-alpha images, but produces
+         less-than-ideal results for non-premultiplied-alpha images.
+
+         5. If you do not pass the flag STBIR_FLAG_ALPHA_PREMULTIPLIED,
+         then the resizer weights the contribution of input pixels
+         based on their alpha values, or, equivalently, it multiplies
+         the alpha value into the color channels, resamples, then divides
+         by the resultant alpha value. Input pixels which have alpha=0 do
+         not contribute at all to output pixels unless _all_ of the input
+         pixels affecting that output pixel have alpha=0, in which case
+         the result for that pixel is the same as it would be without
+         STBIR_FLAG_ALPHA_PREMULTIPLIED. However, this is only true for
+         input images in integer formats. For input images in float format,
+         input pixels with alpha=0 have no effect, and output pixels
+         which have alpha=0 will be 0 in all channels. (For float images,
+         you can manually achieve the same result by adding a tiny epsilon
+         value to the alpha channel of every image, and then subtracting
+         or clamping it at the end.)
+
+         6. You can suppress the behavior described in #5 and make
+         all-0-alpha pixels have 0 in all channels by #defining
+         STBIR_NO_ALPHA_EPSILON.
+
+         7. You can separately control whether the alpha channel is
+         interpreted as linear or affected by the colorspace. By default
+         it is linear; you almost never want to apply the colorspace.
+         (For example, graphics hardware does not apply sRGB conversion
+         to the alpha channel.)
+
+   CONTRIBUTORS
+      Jorge L Rodriguez: Implementation
+      Sean Barrett: API design, optimizations
+      Aras Pranckevicius: bugfix
+      Nathan Reed: warning fixes
+
+   REVISIONS
+      0.97 (2020-02-02) fixed warning
+      0.96 (2019-03-04) fixed warnings
+      0.95 (2017-07-23) fixed warnings
+      0.94 (2017-03-18) fixed warnings
+      0.93 (2017-03-03) fixed bug with certain combinations of heights
+      0.92 (2017-01-02) fix integer overflow on large (>2GB) images
+      0.91 (2016-04-02) fix warnings; fix handling of subpixel regions
+      0.90 (2014-09-17) first released version
+
+   LICENSE
+     See end of file for license information.
+
+   TODO
+      Don't decode all of the image data when only processing a partial tile
+      Don't use full-width decode buffers when only processing a partial tile
+      When processing wide images, break processing into tiles so data fits in L1 cache
+      Installable filters?
+      Resize that respects alpha test coverage
+         (Reference code: FloatImage::alphaTestCoverage and FloatImage::scaleAlphaToCoverage:
+         https://code.google.com/p/nvidia-texture-tools/source/browse/trunk/src/nvimage/FloatImage.cpp )
+*/
+
+#ifndef STBIR_INCLUDE_STB_IMAGE_RESIZE_H
+#define STBIR_INCLUDE_STB_IMAGE_RESIZE_H
+
+#ifdef _MSC_VER
+typedef unsigned char stbir_uint8;
+typedef unsigned short stbir_uint16;
+typedef unsigned int stbir_uint32;
+#else
+#include <stdint.h>
+typedef uint8_t stbir_uint8;
+typedef uint16_t stbir_uint16;
+typedef uint32_t stbir_uint32;
+#endif
+
+#ifndef STBIRDEF
+#ifdef STB_IMAGE_RESIZE_STATIC
+#define STBIRDEF static
+#else
+#ifdef __cplusplus
+#define STBIRDEF extern "C"
+#else
+#define STBIRDEF extern
+#endif
+#endif
+#endif
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Easy-to-use API:
+//
+//     * "input pixels" points to an array of image data with 'num_channels' channels (e.g. RGB=3, RGBA=4)
+//     * input_w is input image width (x-axis), input_h is input image height (y-axis)
+//     * stride is the offset between successive rows of image data in memory, in bytes. you can
+//       specify 0 to mean packed continuously in memory
+//     * alpha channel is treated identically to other channels.
+//     * colorspace is linear or sRGB as specified by function name
+//     * returned result is 1 for success or 0 in case of an error.
+//       #define STBIR_ASSERT() to trigger an assert on parameter validation errors.
+//     * Memory required grows approximately linearly with input and output size, but with
+//       discontinuities at input_w == output_w and input_h == output_h.
+//     * These functions use a "default" resampling filter defined at compile time. To change the filter,
+//       you can change the compile-time defaults by #defining STBIR_DEFAULT_FILTER_UPSAMPLE
+//       and STBIR_DEFAULT_FILTER_DOWNSAMPLE, or you can use the medium-complexity API.
+
+STBIRDEF int stbir_resize_uint8(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                int num_channels);
+
+STBIRDEF int stbir_resize_float(const float *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                float *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                int num_channels);
+
+// The following functions interpret image data as gamma-corrected sRGB.
+// Specify STBIR_ALPHA_CHANNEL_NONE if you have no alpha channel,
+// or otherwise provide the index of the alpha channel. Flags value
+// of 0 will probably do the right thing if you're not sure what
+// the flags mean.
+
+#define STBIR_ALPHA_CHANNEL_NONE -1
+
+// Set this flag if your texture has premultiplied alpha. Otherwise, stbir will
+// use alpha-weighted resampling (effectively premultiplying, resampling,
+// then unpremultiplying).
+#define STBIR_FLAG_ALPHA_PREMULTIPLIED (1 << 0)
+// The specified alpha channel should be handled as gamma-corrected value even
+// when doing sRGB operations.
+#define STBIR_FLAG_ALPHA_USES_COLORSPACE (1 << 1)
+
+STBIRDEF int stbir_resize_uint8_srgb(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                     unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                     int num_channels, int alpha_channel, int flags);
+
+typedef enum
+{
+    STBIR_EDGE_CLAMP = 1,
+    STBIR_EDGE_REFLECT = 2,
+    STBIR_EDGE_WRAP = 3,
+    STBIR_EDGE_ZERO = 4,
+} stbir_edge;
+
+// This function adds the ability to specify how requests to sample off the edge of the image are handled.
+STBIRDEF int stbir_resize_uint8_srgb_edgemode(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                              unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                              int num_channels, int alpha_channel, int flags,
+                                              stbir_edge edge_wrap_mode);
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Medium-complexity API
+//
+// This extends the easy-to-use API as follows:
+//
+//     * Alpha-channel can be processed separately
+//       * If alpha_channel is not STBIR_ALPHA_CHANNEL_NONE
+//         * Alpha channel will not be gamma corrected (unless flags&STBIR_FLAG_GAMMA_CORRECT)
+//         * Filters will be weighted by alpha channel (unless flags&STBIR_FLAG_ALPHA_PREMULTIPLIED)
+//     * Filter can be selected explicitly
+//     * uint16 image type
+//     * sRGB colorspace available for all types
+//     * context parameter for passing to STBIR_MALLOC
+
+typedef enum
+{
+    STBIR_FILTER_DEFAULT = 0,      // use same filter type that easy-to-use API chooses
+    STBIR_FILTER_BOX = 1,          // A trapezoid w/1-pixel wide ramps, same result as box for integer scale ratios
+    STBIR_FILTER_TRIANGLE = 2,     // On upsampling, produces same results as bilinear texture filtering
+    STBIR_FILTER_CUBICBSPLINE = 3, // The cubic b-spline (aka Mitchell-Netrevalli with B=1,C=0), gaussian-esque
+    STBIR_FILTER_CATMULLROM = 4,   // An interpolating cubic spline
+    STBIR_FILTER_MITCHELL = 5,     // Mitchell-Netrevalli filter with B=1/3, C=1/3
+} stbir_filter;
+
+typedef enum
+{
+    STBIR_COLORSPACE_LINEAR,
+    STBIR_COLORSPACE_SRGB,
+
+    STBIR_MAX_COLORSPACES,
+} stbir_colorspace;
+
+// The following functions are all identical except for the type of the image data
+
+STBIRDEF int stbir_resize_uint8_generic(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                        unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                        int num_channels, int alpha_channel, int flags,
+                                        stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space,
+                                        void *alloc_context);
+
+STBIRDEF int stbir_resize_uint16_generic(const stbir_uint16 *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                         stbir_uint16 *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                         int num_channels, int alpha_channel, int flags,
+                                         stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space,
+                                         void *alloc_context);
+
+STBIRDEF int stbir_resize_float_generic(const float *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                        float *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                        int num_channels, int alpha_channel, int flags,
+                                        stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space,
+                                        void *alloc_context);
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Full-complexity API
+//
+// This extends the medium API as follows:
+//
+//       * uint32 image type
+//     * not typesafe
+//     * separate filter types for each axis
+//     * separate edge modes for each axis
+//     * can specify scale explicitly for subpixel correctness
+//     * can specify image source tile using texture coordinates
+
+typedef enum
+{
+    STBIR_TYPE_UINT8,
+    STBIR_TYPE_UINT16,
+    STBIR_TYPE_UINT32,
+    STBIR_TYPE_FLOAT,
+
+    STBIR_MAX_TYPES
+} stbir_datatype;
+
+STBIRDEF int stbir_resize(const void *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                          void *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                          stbir_datatype datatype,
+                          int num_channels, int alpha_channel, int flags,
+                          stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical,
+                          stbir_filter filter_horizontal, stbir_filter filter_vertical,
+                          stbir_colorspace space, void *alloc_context);
+
+STBIRDEF int stbir_resize_subpixel(const void *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                   void *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                   stbir_datatype datatype,
+                                   int num_channels, int alpha_channel, int flags,
+                                   stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical,
+                                   stbir_filter filter_horizontal, stbir_filter filter_vertical,
+                                   stbir_colorspace space, void *alloc_context,
+                                   float x_scale, float y_scale,
+                                   float x_offset, float y_offset);
+
+STBIRDEF int stbir_resize_region(const void *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                 void *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                 stbir_datatype datatype,
+                                 int num_channels, int alpha_channel, int flags,
+                                 stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical,
+                                 stbir_filter filter_horizontal, stbir_filter filter_vertical,
+                                 stbir_colorspace space, void *alloc_context,
+                                 float s0, float t0, float s1, float t1);
+// (s0, t0) & (s1, t1) are the top-left and bottom right corner (uv addressing style: [0, 1]x[0, 1]) of a region of the input image to use.
+
+//
+//
+////   end header file   /////////////////////////////////////////////////////
+#endif // STBIR_INCLUDE_STB_IMAGE_RESIZE_H
+
+#ifdef STB_IMAGE_RESIZE_IMPLEMENTATION
+
+#ifndef STBIR_ASSERT
+#include <assert.h>
+#define STBIR_ASSERT(x) assert(x)
+#endif
+
+// For memset
+#include <string.h>
+
+#include <math.h>
+
+#ifndef STBIR_MALLOC
+#include <stdlib.h>
+// use comma operator to evaluate c, to avoid "unused parameter" warnings
+#define STBIR_MALLOC(size, c) ((void)(c), malloc(size))
+#define STBIR_FREE(ptr, c) ((void)(c), free(ptr))
+#endif
+
+#ifndef _MSC_VER
+#ifdef __cplusplus
+#define stbir__inline inline
+#else
+#define stbir__inline
+#endif
+#else
+#define stbir__inline __forceinline
+#endif
+
+// should produce compiler error if size is wrong
+typedef unsigned char stbir__validate_uint32[sizeof(stbir_uint32) == 4 ? 1 : -1];
+
+#ifdef _MSC_VER
+#define STBIR__NOTUSED(v) (void)(v)
+#else
+#define STBIR__NOTUSED(v) (void)sizeof(v)
+#endif
+
+#define STBIR__ARRAY_SIZE(a) (sizeof((a)) / sizeof((a)[0]))
+
+#ifndef STBIR_DEFAULT_FILTER_UPSAMPLE
+#define STBIR_DEFAULT_FILTER_UPSAMPLE STBIR_FILTER_CATMULLROM
+#endif
+
+#ifndef STBIR_DEFAULT_FILTER_DOWNSAMPLE
+#define STBIR_DEFAULT_FILTER_DOWNSAMPLE STBIR_FILTER_MITCHELL
+#endif
+
+#ifndef STBIR_PROGRESS_REPORT
+#define STBIR_PROGRESS_REPORT(float_0_to_1)
+#endif
+
+#ifndef STBIR_MAX_CHANNELS
+#define STBIR_MAX_CHANNELS 64
+#endif
+
+#if STBIR_MAX_CHANNELS > 65536
+#error "Too many channels; STBIR_MAX_CHANNELS must be no more than 65536."
+// because we store the indices in 16-bit variables
+#endif
+
+// This value is added to alpha just before premultiplication to avoid
+// zeroing out color values. It is equivalent to 2^-80. If you don't want
+// that behavior (it may interfere if you have floating point images with
+// very small alpha values) then you can define STBIR_NO_ALPHA_EPSILON to
+// disable it.
+#ifndef STBIR_ALPHA_EPSILON
+#define STBIR_ALPHA_EPSILON ((float)1 / (1 << 20) / (1 << 20) / (1 << 20) / (1 << 20))
+#endif
+
+#ifdef _MSC_VER
+#define STBIR__UNUSED_PARAM(v) (void)(v)
+#else
+#define STBIR__UNUSED_PARAM(v) (void)sizeof(v)
+#endif
+
+// must match stbir_datatype
+static unsigned char stbir__type_size[] = {
+    1, // STBIR_TYPE_UINT8
+    2, // STBIR_TYPE_UINT16
+    4, // STBIR_TYPE_UINT32
+    4, // STBIR_TYPE_FLOAT
+};
+
+// Kernel function centered at 0
+typedef float(stbir__kernel_fn)(float x, float scale);
+typedef float(stbir__support_fn)(float scale);
+
+typedef struct
+{
+    stbir__kernel_fn *kernel;
+    stbir__support_fn *support;
+} stbir__filter_info;
+
+// When upsampling, the contributors are which source pixels contribute.
+// When downsampling, the contributors are which destination pixels are contributed to.
+typedef struct
+{
+    int n0; // First contributing pixel
+    int n1; // Last contributing pixel
+} stbir__contributors;
+
+typedef struct
+{
+    const void *input_data;
+    int input_w;
+    int input_h;
+    int input_stride_bytes;
+
+    void *output_data;
+    int output_w;
+    int output_h;
+    int output_stride_bytes;
+
+    float s0, t0, s1, t1;
+
+    float horizontal_shift; // Units: output pixels
+    float vertical_shift;   // Units: output pixels
+    float horizontal_scale;
+    float vertical_scale;
+
+    int channels;
+    int alpha_channel;
+    stbir_uint32 flags;
+    stbir_datatype type;
+    stbir_filter horizontal_filter;
+    stbir_filter vertical_filter;
+    stbir_edge edge_horizontal;
+    stbir_edge edge_vertical;
+    stbir_colorspace colorspace;
+
+    stbir__contributors *horizontal_contributors;
+    float *horizontal_coefficients;
+
+    stbir__contributors *vertical_contributors;
+    float *vertical_coefficients;
+
+    int decode_buffer_pixels;
+    float *decode_buffer;
+
+    float *horizontal_buffer;
+
+    // cache these because ceil/floor are inexplicably showing up in profile
+    int horizontal_coefficient_width;
+    int vertical_coefficient_width;
+    int horizontal_filter_pixel_width;
+    int vertical_filter_pixel_width;
+    int horizontal_filter_pixel_margin;
+    int vertical_filter_pixel_margin;
+    int horizontal_num_contributors;
+    int vertical_num_contributors;
+
+    int ring_buffer_length_bytes; // The length of an individual entry in the ring buffer. The total number of ring buffers is stbir__get_filter_pixel_width(filter)
+    int ring_buffer_num_entries;  // Total number of entries in the ring buffer.
+    int ring_buffer_first_scanline;
+    int ring_buffer_last_scanline;
+    int ring_buffer_begin_index; // first_scanline is at this index in the ring buffer
+    float *ring_buffer;
+
+    float *encode_buffer; // A temporary buffer to store floats so we don't lose precision while we do multiply-adds.
+
+    int horizontal_contributors_size;
+    int horizontal_coefficients_size;
+    int vertical_contributors_size;
+    int vertical_coefficients_size;
+    int decode_buffer_size;
+    int horizontal_buffer_size;
+    int ring_buffer_size;
+    int encode_buffer_size;
+} stbir__info;
+
+static const float stbir__max_uint8_as_float = 255.0f;
+static const float stbir__max_uint16_as_float = 65535.0f;
+static const double stbir__max_uint32_as_float = 4294967295.0;
+
+static stbir__inline int stbir__min(int a, int b)
+{
+    return a < b ? a : b;
+}
+
+static stbir__inline float stbir__saturate(float x)
+{
+    if (x < 0)
+        return 0;
+
+    if (x > 1)
+        return 1;
+
+    return x;
+}
+
+#ifdef STBIR_SATURATE_INT
+static stbir__inline stbir_uint8 stbir__saturate8(int x)
+{
+    if ((unsigned int)x <= 255)
+        return x;
+
+    if (x < 0)
+        return 0;
+
+    return 255;
+}
+
+static stbir__inline stbir_uint16 stbir__saturate16(int x)
+{
+    if ((unsigned int)x <= 65535)
+        return x;
+
+    if (x < 0)
+        return 0;
+
+    return 65535;
+}
+#endif
+
+static float stbir__srgb_uchar_to_linear_float[256] = {
+    0.000000f, 0.000304f, 0.000607f, 0.000911f, 0.001214f, 0.001518f, 0.001821f, 0.002125f, 0.002428f, 0.002732f, 0.003035f,
+    0.003347f, 0.003677f, 0.004025f, 0.004391f, 0.004777f, 0.005182f, 0.005605f, 0.006049f, 0.006512f, 0.006995f, 0.007499f,
+    0.008023f, 0.008568f, 0.009134f, 0.009721f, 0.010330f, 0.010960f, 0.011612f, 0.012286f, 0.012983f, 0.013702f, 0.014444f,
+    0.015209f, 0.015996f, 0.016807f, 0.017642f, 0.018500f, 0.019382f, 0.020289f, 0.021219f, 0.022174f, 0.023153f, 0.024158f,
+    0.025187f, 0.026241f, 0.027321f, 0.028426f, 0.029557f, 0.030713f, 0.031896f, 0.033105f, 0.034340f, 0.035601f, 0.036889f,
+    0.038204f, 0.039546f, 0.040915f, 0.042311f, 0.043735f, 0.045186f, 0.046665f, 0.048172f, 0.049707f, 0.051269f, 0.052861f,
+    0.054480f, 0.056128f, 0.057805f, 0.059511f, 0.061246f, 0.063010f, 0.064803f, 0.066626f, 0.068478f, 0.070360f, 0.072272f,
+    0.074214f, 0.076185f, 0.078187f, 0.080220f, 0.082283f, 0.084376f, 0.086500f, 0.088656f, 0.090842f, 0.093059f, 0.095307f,
+    0.097587f, 0.099899f, 0.102242f, 0.104616f, 0.107023f, 0.109462f, 0.111932f, 0.114435f, 0.116971f, 0.119538f, 0.122139f,
+    0.124772f, 0.127438f, 0.130136f, 0.132868f, 0.135633f, 0.138432f, 0.141263f, 0.144128f, 0.147027f, 0.149960f, 0.152926f,
+    0.155926f, 0.158961f, 0.162029f, 0.165132f, 0.168269f, 0.171441f, 0.174647f, 0.177888f, 0.181164f, 0.184475f, 0.187821f,
+    0.191202f, 0.194618f, 0.198069f, 0.201556f, 0.205079f, 0.208637f, 0.212231f, 0.215861f, 0.219526f, 0.223228f, 0.226966f,
+    0.230740f, 0.234551f, 0.238398f, 0.242281f, 0.246201f, 0.250158f, 0.254152f, 0.258183f, 0.262251f, 0.266356f, 0.270498f,
+    0.274677f, 0.278894f, 0.283149f, 0.287441f, 0.291771f, 0.296138f, 0.300544f, 0.304987f, 0.309469f, 0.313989f, 0.318547f,
+    0.323143f, 0.327778f, 0.332452f, 0.337164f, 0.341914f, 0.346704f, 0.351533f, 0.356400f, 0.361307f, 0.366253f, 0.371238f,
+    0.376262f, 0.381326f, 0.386430f, 0.391573f, 0.396755f, 0.401978f, 0.407240f, 0.412543f, 0.417885f, 0.423268f, 0.428691f,
+    0.434154f, 0.439657f, 0.445201f, 0.450786f, 0.456411f, 0.462077f, 0.467784f, 0.473532f, 0.479320f, 0.485150f, 0.491021f,
+    0.496933f, 0.502887f, 0.508881f, 0.514918f, 0.520996f, 0.527115f, 0.533276f, 0.539480f, 0.545725f, 0.552011f, 0.558340f,
+    0.564712f, 0.571125f, 0.577581f, 0.584078f, 0.590619f, 0.597202f, 0.603827f, 0.610496f, 0.617207f, 0.623960f, 0.630757f,
+    0.637597f, 0.644480f, 0.651406f, 0.658375f, 0.665387f, 0.672443f, 0.679543f, 0.686685f, 0.693872f, 0.701102f, 0.708376f,
+    0.715694f, 0.723055f, 0.730461f, 0.737911f, 0.745404f, 0.752942f, 0.760525f, 0.768151f, 0.775822f, 0.783538f, 0.791298f,
+    0.799103f, 0.806952f, 0.814847f, 0.822786f, 0.830770f, 0.838799f, 0.846873f, 0.854993f, 0.863157f, 0.871367f, 0.879622f,
+    0.887923f, 0.896269f, 0.904661f, 0.913099f, 0.921582f, 0.930111f, 0.938686f, 0.947307f, 0.955974f, 0.964686f, 0.973445f,
+    0.982251f, 0.991102f, 1.0f};
+
+static float stbir__srgb_to_linear(float f)
+{
+    if (f <= 0.04045f)
+        return f / 12.92f;
+    else
+        return (float)pow((f + 0.055f) / 1.055f, 2.4f);
+}
+
+static float stbir__linear_to_srgb(float f)
+{
+    if (f <= 0.0031308f)
+        return f * 12.92f;
+    else
+        return 1.055f * (float)pow(f, 1 / 2.4f) - 0.055f;
+}
+
+#ifndef STBIR_NON_IEEE_FLOAT
+// From https://gist.github.com/rygorous/2203834
+
+typedef union
+{
+    stbir_uint32 u;
+    float f;
+} stbir__FP32;
+
+static const stbir_uint32 fp32_to_srgb8_tab4[104] = {
+    0x0073000d,
+    0x007a000d,
+    0x0080000d,
+    0x0087000d,
+    0x008d000d,
+    0x0094000d,
+    0x009a000d,
+    0x00a1000d,
+    0x00a7001a,
+    0x00b4001a,
+    0x00c1001a,
+    0x00ce001a,
+    0x00da001a,
+    0x00e7001a,
+    0x00f4001a,
+    0x0101001a,
+    0x010e0033,
+    0x01280033,
+    0x01410033,
+    0x015b0033,
+    0x01750033,
+    0x018f0033,
+    0x01a80033,
+    0x01c20033,
+    0x01dc0067,
+    0x020f0067,
+    0x02430067,
+    0x02760067,
+    0x02aa0067,
+    0x02dd0067,
+    0x03110067,
+    0x03440067,
+    0x037800ce,
+    0x03df00ce,
+    0x044600ce,
+    0x04ad00ce,
+    0x051400ce,
+    0x057b00c5,
+    0x05dd00bc,
+    0x063b00b5,
+    0x06970158,
+    0x07420142,
+    0x07e30130,
+    0x087b0120,
+    0x090b0112,
+    0x09940106,
+    0x0a1700fc,
+    0x0a9500f2,
+    0x0b0f01cb,
+    0x0bf401ae,
+    0x0ccb0195,
+    0x0d950180,
+    0x0e56016e,
+    0x0f0d015e,
+    0x0fbc0150,
+    0x10630143,
+    0x11070264,
+    0x1238023e,
+    0x1357021d,
+    0x14660201,
+    0x156601e9,
+    0x165a01d3,
+    0x174401c0,
+    0x182401af,
+    0x18fe0331,
+    0x1a9602fe,
+    0x1c1502d2,
+    0x1d7e02ad,
+    0x1ed4028d,
+    0x201a0270,
+    0x21520256,
+    0x227d0240,
+    0x239f0443,
+    0x25c003fe,
+    0x27bf03c4,
+    0x29a10392,
+    0x2b6a0367,
+    0x2d1d0341,
+    0x2ebe031f,
+    0x304d0300,
+    0x31d105b0,
+    0x34a80555,
+    0x37520507,
+    0x39d504c5,
+    0x3c37048b,
+    0x3e7c0458,
+    0x40a8042a,
+    0x42bd0401,
+    0x44c20798,
+    0x488e071e,
+    0x4c1c06b6,
+    0x4f76065d,
+    0x52a50610,
+    0x55ac05cc,
+    0x5892058f,
+    0x5b590559,
+    0x5e0c0a23,
+    0x631c0980,
+    0x67db08f6,
+    0x6c55087f,
+    0x70940818,
+    0x74a007bd,
+    0x787d076c,
+    0x7c330723,
+};
+
+static stbir_uint8 stbir__linear_to_srgb_uchar(float in_)
+{
+    static const stbir__FP32 almostone = {0x3f7fffff}; // 1-eps
+    static const stbir__FP32 minval = {(127 - 13) << 23};
+    stbir_uint32 tab, bias, scale, t;
+    stbir__FP32 f;
+
+    // Clamp to [2^(-13), 1-eps]; these two values map to 0 and 1, respectively.
+    // The tests are carefully written so that NaNs map to 0, same as in the reference
+    // implementation.
+    if (!(in_ > minval.f)) // written this way to catch NaNs
+        in_ = minval.f;
+    if (in_ > almostone.f)
+        in_ = almostone.f;
+
+    // Do the table lookup and unpack bias, scale
+    f.f = in_;
+    tab = fp32_to_srgb8_tab4[(f.u - minval.u) >> 20];
+    bias = (tab >> 16) << 9;
+    scale = tab & 0xffff;
+
+    // Grab next-highest mantissa bits and perform linear interpolation
+    t = (f.u >> 12) & 0xff;
+    return (unsigned char)((bias + scale * t) >> 16);
+}
+
+#else
+// sRGB transition values, scaled by 1<<28
+static int stbir__srgb_offset_to_linear_scaled[256] =
+    {
+        0,
+        40738,
+        122216,
+        203693,
+        285170,
+        366648,
+        448125,
+        529603,
+        611080,
+        692557,
+        774035,
+        855852,
+        942009,
+        1033024,
+        1128971,
+        1229926,
+        1335959,
+        1447142,
+        1563542,
+        1685229,
+        1812268,
+        1944725,
+        2082664,
+        2226148,
+        2375238,
+        2529996,
+        2690481,
+        2856753,
+        3028870,
+        3206888,
+        3390865,
+        3580856,
+        3776916,
+        3979100,
+        4187460,
+        4402049,
+        4622919,
+        4850123,
+        5083710,
+        5323731,
+        5570236,
+        5823273,
+        6082892,
+        6349140,
+        6622065,
+        6901714,
+        7188133,
+        7481369,
+        7781466,
+        8088471,
+        8402427,
+        8723380,
+        9051372,
+        9386448,
+        9728650,
+        10078021,
+        10434603,
+        10798439,
+        11169569,
+        11548036,
+        11933879,
+        12327139,
+        12727857,
+        13136073,
+        13551826,
+        13975156,
+        14406100,
+        14844697,
+        15290987,
+        15745007,
+        16206795,
+        16676389,
+        17153826,
+        17639142,
+        18132374,
+        18633560,
+        19142734,
+        19659934,
+        20185196,
+        20718552,
+        21260042,
+        21809696,
+        22367554,
+        22933648,
+        23508010,
+        24090680,
+        24681686,
+        25281066,
+        25888850,
+        26505076,
+        27129772,
+        27762974,
+        28404716,
+        29055026,
+        29713942,
+        30381490,
+        31057708,
+        31742624,
+        32436272,
+        33138682,
+        33849884,
+        34569912,
+        35298800,
+        36036568,
+        36783260,
+        37538896,
+        38303512,
+        39077136,
+        39859796,
+        40651528,
+        41452360,
+        42262316,
+        43081432,
+        43909732,
+        44747252,
+        45594016,
+        46450052,
+        47315392,
+        48190064,
+        49074096,
+        49967516,
+        50870356,
+        51782636,
+        52704392,
+        53635648,
+        54576432,
+        55526772,
+        56486700,
+        57456236,
+        58435408,
+        59424248,
+        60422780,
+        61431036,
+        62449032,
+        63476804,
+        64514376,
+        65561776,
+        66619028,
+        67686160,
+        68763192,
+        69850160,
+        70947088,
+        72053992,
+        73170912,
+        74297864,
+        75434880,
+        76581976,
+        77739184,
+        78906536,
+        80084040,
+        81271736,
+        82469648,
+        83677792,
+        84896192,
+        86124888,
+        87363888,
+        88613232,
+        89872928,
+        91143016,
+        92423512,
+        93714432,
+        95015816,
+        96327688,
+        97650056,
+        98982952,
+        100326408,
+        101680440,
+        103045072,
+        104420320,
+        105806224,
+        107202800,
+        108610064,
+        110028048,
+        111456776,
+        112896264,
+        114346544,
+        115807632,
+        117279552,
+        118762328,
+        120255976,
+        121760536,
+        123276016,
+        124802440,
+        126339832,
+        127888216,
+        129447616,
+        131018048,
+        132599544,
+        134192112,
+        135795792,
+        137410592,
+        139036528,
+        140673648,
+        142321952,
+        143981456,
+        145652208,
+        147334208,
+        149027488,
+        150732064,
+        152447968,
+        154175200,
+        155913792,
+        157663776,
+        159425168,
+        161197984,
+        162982240,
+        164777968,
+        166585184,
+        168403904,
+        170234160,
+        172075968,
+        173929344,
+        175794320,
+        177670896,
+        179559120,
+        181458992,
+        183370528,
+        185293776,
+        187228736,
+        189175424,
+        191133888,
+        193104112,
+        195086128,
+        197079968,
+        199085648,
+        201103184,
+        203132592,
+        205173888,
+        207227120,
+        209292272,
+        211369392,
+        213458480,
+        215559568,
+        217672656,
+        219797792,
+        221934976,
+        224084240,
+        226245600,
+        228419056,
+        230604656,
+        232802400,
+        235012320,
+        237234432,
+        239468736,
+        241715280,
+        243974080,
+        246245120,
+        248528464,
+        250824112,
+        253132064,
+        255452368,
+        257785040,
+        260130080,
+        262487520,
+        264857376,
+        267239664,
+};
+
+static stbir_uint8 stbir__linear_to_srgb_uchar(float f)
+{
+    int x = (int)(f * (1 << 28)); // has headroom so you don't need to clamp
+    int v = 0;
+    int i;
+
+    // Refine the guess with a short binary search.
+    i = v + 128;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 64;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 32;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 16;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 8;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 4;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 2;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+    i = v + 1;
+    if (x >= stbir__srgb_offset_to_linear_scaled[i])
+        v = i;
+
+    return (stbir_uint8)v;
+}
+#endif
+
+static float stbir__filter_trapezoid(float x, float scale)
+{
+    float halfscale = scale / 2;
+    float t = 0.5f + halfscale;
+    STBIR_ASSERT(scale <= 1);
+
+    x = (float)fabs(x);
+
+    if (x >= t)
+        return 0;
+    else
+    {
+        float r = 0.5f - halfscale;
+        if (x <= r)
+            return 1;
+        else
+            return (t - x) / scale;
+    }
+}
+
+static float stbir__support_trapezoid(float scale)
+{
+    STBIR_ASSERT(scale <= 1);
+    return 0.5f + scale / 2;
+}
+
+static float stbir__filter_triangle(float x, float s)
+{
+    STBIR__UNUSED_PARAM(s);
+
+    x = (float)fabs(x);
+
+    if (x <= 1.0f)
+        return 1 - x;
+    else
+        return 0;
+}
+
+static float stbir__filter_cubic(float x, float s)
+{
+    STBIR__UNUSED_PARAM(s);
+
+    x = (float)fabs(x);
+
+    if (x < 1.0f)
+        return (4 + x * x * (3 * x - 6)) / 6;
+    else if (x < 2.0f)
+        return (8 + x * (-12 + x * (6 - x))) / 6;
+
+    return (0.0f);
+}
+
+static float stbir__filter_catmullrom(float x, float s)
+{
+    STBIR__UNUSED_PARAM(s);
+
+    x = (float)fabs(x);
+
+    if (x < 1.0f)
+        return 1 - x * x * (2.5f - 1.5f * x);
+    else if (x < 2.0f)
+        return 2 - x * (4 + x * (0.5f * x - 2.5f));
+
+    return (0.0f);
+}
+
+static float stbir__filter_mitchell(float x, float s)
+{
+    STBIR__UNUSED_PARAM(s);
+
+    x = (float)fabs(x);
+
+    if (x < 1.0f)
+        return (16 + x * x * (21 * x - 36)) / 18;
+    else if (x < 2.0f)
+        return (32 + x * (-60 + x * (36 - 7 * x))) / 18;
+
+    return (0.0f);
+}
+
+static float stbir__support_zero(float s)
+{
+    STBIR__UNUSED_PARAM(s);
+    return 0;
+}
+
+static float stbir__support_one(float s)
+{
+    STBIR__UNUSED_PARAM(s);
+    return 1;
+}
+
+static float stbir__support_two(float s)
+{
+    STBIR__UNUSED_PARAM(s);
+    return 2;
+}
+
+static stbir__filter_info stbir__filter_info_table[] = {
+    {NULL, stbir__support_zero},
+    {stbir__filter_trapezoid, stbir__support_trapezoid},
+    {stbir__filter_triangle, stbir__support_one},
+    {stbir__filter_cubic, stbir__support_two},
+    {stbir__filter_catmullrom, stbir__support_two},
+    {stbir__filter_mitchell, stbir__support_two},
+};
+
+stbir__inline static int stbir__use_upsampling(float ratio)
+{
+    return ratio > 1;
+}
+
+stbir__inline static int stbir__use_width_upsampling(stbir__info *stbir_info)
+{
+    return stbir__use_upsampling(stbir_info->horizontal_scale);
+}
+
+stbir__inline static int stbir__use_height_upsampling(stbir__info *stbir_info)
+{
+    return stbir__use_upsampling(stbir_info->vertical_scale);
+}
+
+// This is the maximum number of input samples that can affect an output sample
+// with the given filter
+static int stbir__get_filter_pixel_width(stbir_filter filter, float scale)
+{
+    STBIR_ASSERT(filter != 0);
+    STBIR_ASSERT(filter < STBIR__ARRAY_SIZE(stbir__filter_info_table));
+
+    if (stbir__use_upsampling(scale))
+        return (int)ceil(stbir__filter_info_table[filter].support(1 / scale) * 2);
+    else
+        return (int)ceil(stbir__filter_info_table[filter].support(scale) * 2 / scale);
+}
+
+// This is how much to expand buffers to account for filters seeking outside
+// the image boundaries.
+static int stbir__get_filter_pixel_margin(stbir_filter filter, float scale)
+{
+    return stbir__get_filter_pixel_width(filter, scale) / 2;
+}
+
+static int stbir__get_coefficient_width(stbir_filter filter, float scale)
+{
+    if (stbir__use_upsampling(scale))
+        return (int)ceil(stbir__filter_info_table[filter].support(1 / scale) * 2);
+    else
+        return (int)ceil(stbir__filter_info_table[filter].support(scale) * 2);
+}
+
+static int stbir__get_contributors(float scale, stbir_filter filter, int input_size, int output_size)
+{
+    if (stbir__use_upsampling(scale))
+        return output_size;
+    else
+        return (input_size + stbir__get_filter_pixel_margin(filter, scale) * 2);
+}
+
+static int stbir__get_total_horizontal_coefficients(stbir__info *info)
+{
+    return info->horizontal_num_contributors * stbir__get_coefficient_width(info->horizontal_filter, info->horizontal_scale);
+}
+
+static int stbir__get_total_vertical_coefficients(stbir__info *info)
+{
+    return info->vertical_num_contributors * stbir__get_coefficient_width(info->vertical_filter, info->vertical_scale);
+}
+
+static stbir__contributors *stbir__get_contributor(stbir__contributors *contributors, int n)
+{
+    return &contributors[n];
+}
+
+// For perf reasons this code is duplicated in stbir__resample_horizontal_upsample/downsample,
+// if you change it here change it there too.
+static float *stbir__get_coefficient(float *coefficients, stbir_filter filter, float scale, int n, int c)
+{
+    int width = stbir__get_coefficient_width(filter, scale);
+    return &coefficients[width * n + c];
+}
+
+static int stbir__edge_wrap_slow(stbir_edge edge, int n, int max)
+{
+    switch (edge)
+    {
+    case STBIR_EDGE_ZERO:
+        return 0; // we'll decode the wrong pixel here, and then overwrite with 0s later
+
+    case STBIR_EDGE_CLAMP:
+        if (n < 0)
+            return 0;
+
+        if (n >= max)
+            return max - 1;
+
+        return n; // NOTREACHED
+
+    case STBIR_EDGE_REFLECT:
+    {
+        if (n < 0)
+        {
+            if (n < max)
+                return -n;
+            else
+                return max - 1;
+        }
+
+        if (n >= max)
+        {
+            int max2 = max * 2;
+            if (n >= max2)
+                return 0;
+            else
+                return max2 - n - 1;
+        }
+
+        return n; // NOTREACHED
+    }
+
+    case STBIR_EDGE_WRAP:
+        if (n >= 0)
+            return (n % max);
+        else
+        {
+            int m = (-n) % max;
+
+            if (m != 0)
+                m = max - m;
+
+            return (m);
+        }
+        // NOTREACHED
+
+    default:
+        STBIR_ASSERT(!"Unimplemented edge type");
+        return 0;
+    }
+}
+
+stbir__inline static int stbir__edge_wrap(stbir_edge edge, int n, int max)
+{
+    // avoid per-pixel switch
+    if (n >= 0 && n < max)
+        return n;
+    return stbir__edge_wrap_slow(edge, n, max);
+}
+
+// What input pixels contribute to this output pixel?
+static void stbir__calculate_sample_range_upsample(int n, float out_filter_radius, float scale_ratio, float out_shift, int *in_first_pixel, int *in_last_pixel, float *in_center_of_out)
+{
+    float out_pixel_center = (float)n + 0.5f;
+    float out_pixel_influence_lowerbound = out_pixel_center - out_filter_radius;
+    float out_pixel_influence_upperbound = out_pixel_center + out_filter_radius;
+
+    float in_pixel_influence_lowerbound = (out_pixel_influence_lowerbound + out_shift) / scale_ratio;
+    float in_pixel_influence_upperbound = (out_pixel_influence_upperbound + out_shift) / scale_ratio;
+
+    *in_center_of_out = (out_pixel_center + out_shift) / scale_ratio;
+    *in_first_pixel = (int)(floor(in_pixel_influence_lowerbound + 0.5));
+    *in_last_pixel = (int)(floor(in_pixel_influence_upperbound - 0.5));
+}
+
+// What output pixels does this input pixel contribute to?
+static void stbir__calculate_sample_range_downsample(int n, float in_pixels_radius, float scale_ratio, float out_shift, int *out_first_pixel, int *out_last_pixel, float *out_center_of_in)
+{
+    float in_pixel_center = (float)n + 0.5f;
+    float in_pixel_influence_lowerbound = in_pixel_center - in_pixels_radius;
+    float in_pixel_influence_upperbound = in_pixel_center + in_pixels_radius;
+
+    float out_pixel_influence_lowerbound = in_pixel_influence_lowerbound * scale_ratio - out_shift;
+    float out_pixel_influence_upperbound = in_pixel_influence_upperbound * scale_ratio - out_shift;
+
+    *out_center_of_in = in_pixel_center * scale_ratio - out_shift;
+    *out_first_pixel = (int)(floor(out_pixel_influence_lowerbound + 0.5));
+    *out_last_pixel = (int)(floor(out_pixel_influence_upperbound - 0.5));
+}
+
+static void stbir__calculate_coefficients_upsample(stbir_filter filter, float scale, int in_first_pixel, int in_last_pixel, float in_center_of_out, stbir__contributors *contributor, float *coefficient_group)
+{
+    int i;
+    float total_filter = 0;
+    float filter_scale;
+
+    STBIR_ASSERT(in_last_pixel - in_first_pixel <= (int)ceil(stbir__filter_info_table[filter].support(1 / scale) * 2)); // Taken directly from stbir__get_coefficient_width() which we can't call because we don't know if we're horizontal or vertical.
+
+    contributor->n0 = in_first_pixel;
+    contributor->n1 = in_last_pixel;
+
+    STBIR_ASSERT(contributor->n1 >= contributor->n0);
+
+    for (i = 0; i <= in_last_pixel - in_first_pixel; i++)
+    {
+        float in_pixel_center = (float)(i + in_first_pixel) + 0.5f;
+        coefficient_group[i] = stbir__filter_info_table[filter].kernel(in_center_of_out - in_pixel_center, 1 / scale);
+
+        // If the coefficient is zero, skip it. (Don't do the <0 check here, we want the influence of those outside pixels.)
+        if (i == 0 && !coefficient_group[i])
+        {
+            contributor->n0 = ++in_first_pixel;
+            i--;
+            continue;
+        }
+
+        total_filter += coefficient_group[i];
+    }
+
+    // NOTE(fg): Not actually true in general, nor is there any reason to expect it should be.
+    // It would be true in exact math but is at best approximately true in floating-point math,
+    // and it would not make sense to try and put actual bounds on this here because it depends
+    // on the image aspect ratio which can get pretty extreme.
+    // STBIR_ASSERT(stbir__filter_info_table[filter].kernel((float)(in_last_pixel + 1) + 0.5f - in_center_of_out, 1/scale) == 0);
+
+    STBIR_ASSERT(total_filter > 0.9);
+    STBIR_ASSERT(total_filter < 1.1f); // Make sure it's not way off.
+
+    // Make sure the sum of all coefficients is 1.
+    filter_scale = 1 / total_filter;
+
+    for (i = 0; i <= in_last_pixel - in_first_pixel; i++)
+        coefficient_group[i] *= filter_scale;
+
+    for (i = in_last_pixel - in_first_pixel; i >= 0; i--)
+    {
+        if (coefficient_group[i])
+            break;
+
+        // This line has no weight. We can skip it.
+        contributor->n1 = contributor->n0 + i - 1;
+    }
+}
+
+static void stbir__calculate_coefficients_downsample(stbir_filter filter, float scale_ratio, int out_first_pixel, int out_last_pixel, float out_center_of_in, stbir__contributors *contributor, float *coefficient_group)
+{
+    int i;
+
+    STBIR_ASSERT(out_last_pixel - out_first_pixel <= (int)ceil(stbir__filter_info_table[filter].support(scale_ratio) * 2)); // Taken directly from stbir__get_coefficient_width() which we can't call because we don't know if we're horizontal or vertical.
+
+    contributor->n0 = out_first_pixel;
+    contributor->n1 = out_last_pixel;
+
+    STBIR_ASSERT(contributor->n1 >= contributor->n0);
+
+    for (i = 0; i <= out_last_pixel - out_first_pixel; i++)
+    {
+        float out_pixel_center = (float)(i + out_first_pixel) + 0.5f;
+        float x = out_pixel_center - out_center_of_in;
+        coefficient_group[i] = stbir__filter_info_table[filter].kernel(x, scale_ratio) * scale_ratio;
+    }
+
+    // NOTE(fg): Not actually true in general, nor is there any reason to expect it should be.
+    // It would be true in exact math but is at best approximately true in floating-point math,
+    // and it would not make sense to try and put actual bounds on this here because it depends
+    // on the image aspect ratio which can get pretty extreme.
+    // STBIR_ASSERT(stbir__filter_info_table[filter].kernel((float)(out_last_pixel + 1) + 0.5f - out_center_of_in, scale_ratio) == 0);
+
+    for (i = out_last_pixel - out_first_pixel; i >= 0; i--)
+    {
+        if (coefficient_group[i])
+            break;
+
+        // This line has no weight. We can skip it.
+        contributor->n1 = contributor->n0 + i - 1;
+    }
+}
+
+static void stbir__normalize_downsample_coefficients(stbir__contributors *contributors, float *coefficients, stbir_filter filter, float scale_ratio, int input_size, int output_size)
+{
+    int num_contributors = stbir__get_contributors(scale_ratio, filter, input_size, output_size);
+    int num_coefficients = stbir__get_coefficient_width(filter, scale_ratio);
+    int i, j;
+    int skip;
+
+    for (i = 0; i < output_size; i++)
+    {
+        float scale;
+        float total = 0;
+
+        for (j = 0; j < num_contributors; j++)
+        {
+            if (i >= contributors[j].n0 && i <= contributors[j].n1)
+            {
+                float coefficient = *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i - contributors[j].n0);
+                total += coefficient;
+            }
+            else if (i < contributors[j].n0)
+                break;
+        }
+
+        STBIR_ASSERT(total > 0.9f);
+        STBIR_ASSERT(total < 1.1f);
+
+        scale = 1 / total;
+
+        for (j = 0; j < num_contributors; j++)
+        {
+            if (i >= contributors[j].n0 && i <= contributors[j].n1)
+                *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i - contributors[j].n0) *= scale;
+            else if (i < contributors[j].n0)
+                break;
+        }
+    }
+
+    // Optimize: Skip zero coefficients and contributions outside of image bounds.
+    // Do this after normalizing because normalization depends on the n0/n1 values.
+    for (j = 0; j < num_contributors; j++)
+    {
+        int range, max, width;
+
+        skip = 0;
+        while (*stbir__get_coefficient(coefficients, filter, scale_ratio, j, skip) == 0)
+            skip++;
+
+        contributors[j].n0 += skip;
+
+        while (contributors[j].n0 < 0)
+        {
+            contributors[j].n0++;
+            skip++;
+        }
+
+        range = contributors[j].n1 - contributors[j].n0 + 1;
+        max = stbir__min(num_coefficients, range);
+
+        width = stbir__get_coefficient_width(filter, scale_ratio);
+        for (i = 0; i < max; i++)
+        {
+            if (i + skip >= width)
+                break;
+
+            *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i) = *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i + skip);
+        }
+
+        continue;
+    }
+
+    // Using min to avoid writing into invalid pixels.
+    for (i = 0; i < num_contributors; i++)
+        contributors[i].n1 = stbir__min(contributors[i].n1, output_size - 1);
+}
+
+// Each scan line uses the same kernel values so we should calculate the kernel
+// values once and then we can use them for every scan line.
+static void stbir__calculate_filters(stbir__contributors *contributors, float *coefficients, stbir_filter filter, float scale_ratio, float shift, int input_size, int output_size)
+{
+    int n;
+    int total_contributors = stbir__get_contributors(scale_ratio, filter, input_size, output_size);
+
+    if (stbir__use_upsampling(scale_ratio))
+    {
+        float out_pixels_radius = stbir__filter_info_table[filter].support(1 / scale_ratio) * scale_ratio;
+
+        // Looping through out pixels
+        for (n = 0; n < total_contributors; n++)
+        {
+            float in_center_of_out; // Center of the current out pixel in the in pixel space
+            int in_first_pixel, in_last_pixel;
+
+            stbir__calculate_sample_range_upsample(n, out_pixels_radius, scale_ratio, shift, &in_first_pixel, &in_last_pixel, &in_center_of_out);
+
+            stbir__calculate_coefficients_upsample(filter, scale_ratio, in_first_pixel, in_last_pixel, in_center_of_out, stbir__get_contributor(contributors, n), stbir__get_coefficient(coefficients, filter, scale_ratio, n, 0));
+        }
+    }
+    else
+    {
+        float in_pixels_radius = stbir__filter_info_table[filter].support(scale_ratio) / scale_ratio;
+
+        // Looping through in pixels
+        for (n = 0; n < total_contributors; n++)
+        {
+            float out_center_of_in; // Center of the current out pixel in the in pixel space
+            int out_first_pixel, out_last_pixel;
+            int n_adjusted = n - stbir__get_filter_pixel_margin(filter, scale_ratio);
+
+            stbir__calculate_sample_range_downsample(n_adjusted, in_pixels_radius, scale_ratio, shift, &out_first_pixel, &out_last_pixel, &out_center_of_in);
+
+            stbir__calculate_coefficients_downsample(filter, scale_ratio, out_first_pixel, out_last_pixel, out_center_of_in, stbir__get_contributor(contributors, n), stbir__get_coefficient(coefficients, filter, scale_ratio, n, 0));
+        }
+
+        stbir__normalize_downsample_coefficients(contributors, coefficients, filter, scale_ratio, input_size, output_size);
+    }
+}
+
+static float *stbir__get_decode_buffer(stbir__info *stbir_info)
+{
+    // The 0 index of the decode buffer starts after the margin. This makes
+    // it okay to use negative indexes on the decode buffer.
+    return &stbir_info->decode_buffer[stbir_info->horizontal_filter_pixel_margin * stbir_info->channels];
+}
+
+#define STBIR__DECODE(type, colorspace) ((int)(type) * (STBIR_MAX_COLORSPACES) + (int)(colorspace))
+
+static void stbir__decode_scanline(stbir__info *stbir_info, int n)
+{
+    int c;
+    int channels = stbir_info->channels;
+    int alpha_channel = stbir_info->alpha_channel;
+    int type = stbir_info->type;
+    int colorspace = stbir_info->colorspace;
+    int input_w = stbir_info->input_w;
+    size_t input_stride_bytes = stbir_info->input_stride_bytes;
+    float *decode_buffer = stbir__get_decode_buffer(stbir_info);
+    stbir_edge edge_horizontal = stbir_info->edge_horizontal;
+    stbir_edge edge_vertical = stbir_info->edge_vertical;
+    size_t in_buffer_row_offset = stbir__edge_wrap(edge_vertical, n, stbir_info->input_h) * input_stride_bytes;
+    const void *input_data = (char *)stbir_info->input_data + in_buffer_row_offset;
+    int max_x = input_w + stbir_info->horizontal_filter_pixel_margin;
+    int decode = STBIR__DECODE(type, colorspace);
+
+    int x = -stbir_info->horizontal_filter_pixel_margin;
+
+    // special handling for STBIR_EDGE_ZERO because it needs to return an item that doesn't appear in the input,
+    // and we want to avoid paying overhead on every pixel if not STBIR_EDGE_ZERO
+    if (edge_vertical == STBIR_EDGE_ZERO && (n < 0 || n >= stbir_info->input_h))
+    {
+        for (; x < max_x; x++)
+            for (c = 0; c < channels; c++)
+                decode_buffer[x * channels + c] = 0;
+        return;
+    }
+
+    switch (decode)
+    {
+    case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_LINEAR):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = ((float)((const unsigned char *)input_data)[input_pixel_index + c]) / stbir__max_uint8_as_float;
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_SRGB):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = stbir__srgb_uchar_to_linear_float[((const unsigned char *)input_data)[input_pixel_index + c]];
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                decode_buffer[decode_pixel_index + alpha_channel] = ((float)((const unsigned char *)input_data)[input_pixel_index + alpha_channel]) / stbir__max_uint8_as_float;
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_LINEAR):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = ((float)((const unsigned short *)input_data)[input_pixel_index + c]) / stbir__max_uint16_as_float;
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_SRGB):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = stbir__srgb_to_linear(((float)((const unsigned short *)input_data)[input_pixel_index + c]) / stbir__max_uint16_as_float);
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                decode_buffer[decode_pixel_index + alpha_channel] = ((float)((const unsigned short *)input_data)[input_pixel_index + alpha_channel]) / stbir__max_uint16_as_float;
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_LINEAR):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = (float)(((double)((const unsigned int *)input_data)[input_pixel_index + c]) / stbir__max_uint32_as_float);
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_SRGB):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = stbir__srgb_to_linear((float)(((double)((const unsigned int *)input_data)[input_pixel_index + c]) / stbir__max_uint32_as_float));
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                decode_buffer[decode_pixel_index + alpha_channel] = (float)(((double)((const unsigned int *)input_data)[input_pixel_index + alpha_channel]) / stbir__max_uint32_as_float);
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_LINEAR):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = ((const float *)input_data)[input_pixel_index + c];
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_SRGB):
+        for (; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+            int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels;
+            for (c = 0; c < channels; c++)
+                decode_buffer[decode_pixel_index + c] = stbir__srgb_to_linear(((const float *)input_data)[input_pixel_index + c]);
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                decode_buffer[decode_pixel_index + alpha_channel] = ((const float *)input_data)[input_pixel_index + alpha_channel];
+        }
+
+        break;
+
+    default:
+        STBIR_ASSERT(!"Unknown type/colorspace/channels combination.");
+        break;
+    }
+
+    if (!(stbir_info->flags & STBIR_FLAG_ALPHA_PREMULTIPLIED))
+    {
+        for (x = -stbir_info->horizontal_filter_pixel_margin; x < max_x; x++)
+        {
+            int decode_pixel_index = x * channels;
+
+            // If the alpha value is 0 it will clobber the color values. Make sure it's not.
+            float alpha = decode_buffer[decode_pixel_index + alpha_channel];
+#ifndef STBIR_NO_ALPHA_EPSILON
+            if (stbir_info->type != STBIR_TYPE_FLOAT)
+            {
+                alpha += STBIR_ALPHA_EPSILON;
+                decode_buffer[decode_pixel_index + alpha_channel] = alpha;
+            }
+#endif
+            for (c = 0; c < channels; c++)
+            {
+                if (c == alpha_channel)
+                    continue;
+
+                decode_buffer[decode_pixel_index + c] *= alpha;
+            }
+        }
+    }
+
+    if (edge_horizontal == STBIR_EDGE_ZERO)
+    {
+        for (x = -stbir_info->horizontal_filter_pixel_margin; x < 0; x++)
+        {
+            for (c = 0; c < channels; c++)
+                decode_buffer[x * channels + c] = 0;
+        }
+        for (x = input_w; x < max_x; x++)
+        {
+            for (c = 0; c < channels; c++)
+                decode_buffer[x * channels + c] = 0;
+        }
+    }
+}
+
+static float *stbir__get_ring_buffer_entry(float *ring_buffer, int index, int ring_buffer_length)
+{
+    return &ring_buffer[index * ring_buffer_length];
+}
+
+static float *stbir__add_empty_ring_buffer_entry(stbir__info *stbir_info, int n)
+{
+    int ring_buffer_index;
+    float *ring_buffer;
+
+    stbir_info->ring_buffer_last_scanline = n;
+
+    if (stbir_info->ring_buffer_begin_index < 0)
+    {
+        ring_buffer_index = stbir_info->ring_buffer_begin_index = 0;
+        stbir_info->ring_buffer_first_scanline = n;
+    }
+    else
+    {
+        ring_buffer_index = (stbir_info->ring_buffer_begin_index + (stbir_info->ring_buffer_last_scanline - stbir_info->ring_buffer_first_scanline)) % stbir_info->ring_buffer_num_entries;
+        STBIR_ASSERT(ring_buffer_index != stbir_info->ring_buffer_begin_index);
+    }
+
+    ring_buffer = stbir__get_ring_buffer_entry(stbir_info->ring_buffer, ring_buffer_index, stbir_info->ring_buffer_length_bytes / sizeof(float));
+    memset(ring_buffer, 0, stbir_info->ring_buffer_length_bytes);
+
+    return ring_buffer;
+}
+
+static void stbir__resample_horizontal_upsample(stbir__info *stbir_info, float *output_buffer)
+{
+    int x, k;
+    int output_w = stbir_info->output_w;
+    int channels = stbir_info->channels;
+    float *decode_buffer = stbir__get_decode_buffer(stbir_info);
+    stbir__contributors *horizontal_contributors = stbir_info->horizontal_contributors;
+    float *horizontal_coefficients = stbir_info->horizontal_coefficients;
+    int coefficient_width = stbir_info->horizontal_coefficient_width;
+
+    for (x = 0; x < output_w; x++)
+    {
+        int n0 = horizontal_contributors[x].n0;
+        int n1 = horizontal_contributors[x].n1;
+
+        int out_pixel_index = x * channels;
+        int coefficient_group = coefficient_width * x;
+        int coefficient_counter = 0;
+
+        STBIR_ASSERT(n1 >= n0);
+        STBIR_ASSERT(n0 >= -stbir_info->horizontal_filter_pixel_margin);
+        STBIR_ASSERT(n1 >= -stbir_info->horizontal_filter_pixel_margin);
+        STBIR_ASSERT(n0 < stbir_info->input_w + stbir_info->horizontal_filter_pixel_margin);
+        STBIR_ASSERT(n1 < stbir_info->input_w + stbir_info->horizontal_filter_pixel_margin);
+
+        switch (channels)
+        {
+        case 1:
+            for (k = n0; k <= n1; k++)
+            {
+                int in_pixel_index = k * 1;
+                float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++];
+                STBIR_ASSERT(coefficient != 0);
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+            }
+            break;
+        case 2:
+            for (k = n0; k <= n1; k++)
+            {
+                int in_pixel_index = k * 2;
+                float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++];
+                STBIR_ASSERT(coefficient != 0);
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+                output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient;
+            }
+            break;
+        case 3:
+            for (k = n0; k <= n1; k++)
+            {
+                int in_pixel_index = k * 3;
+                float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++];
+                STBIR_ASSERT(coefficient != 0);
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+                output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient;
+                output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient;
+            }
+            break;
+        case 4:
+            for (k = n0; k <= n1; k++)
+            {
+                int in_pixel_index = k * 4;
+                float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++];
+                STBIR_ASSERT(coefficient != 0);
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+                output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient;
+                output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient;
+                output_buffer[out_pixel_index + 3] += decode_buffer[in_pixel_index + 3] * coefficient;
+            }
+            break;
+        default:
+            for (k = n0; k <= n1; k++)
+            {
+                int in_pixel_index = k * channels;
+                float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++];
+                int c;
+                STBIR_ASSERT(coefficient != 0);
+                for (c = 0; c < channels; c++)
+                    output_buffer[out_pixel_index + c] += decode_buffer[in_pixel_index + c] * coefficient;
+            }
+            break;
+        }
+    }
+}
+
+static void stbir__resample_horizontal_downsample(stbir__info *stbir_info, float *output_buffer)
+{
+    int x, k;
+    int input_w = stbir_info->input_w;
+    int channels = stbir_info->channels;
+    float *decode_buffer = stbir__get_decode_buffer(stbir_info);
+    stbir__contributors *horizontal_contributors = stbir_info->horizontal_contributors;
+    float *horizontal_coefficients = stbir_info->horizontal_coefficients;
+    int coefficient_width = stbir_info->horizontal_coefficient_width;
+    int filter_pixel_margin = stbir_info->horizontal_filter_pixel_margin;
+    int max_x = input_w + filter_pixel_margin * 2;
+
+    STBIR_ASSERT(!stbir__use_width_upsampling(stbir_info));
+
+    switch (channels)
+    {
+    case 1:
+        for (x = 0; x < max_x; x++)
+        {
+            int n0 = horizontal_contributors[x].n0;
+            int n1 = horizontal_contributors[x].n1;
+
+            int in_x = x - filter_pixel_margin;
+            int in_pixel_index = in_x * 1;
+            int max_n = n1;
+            int coefficient_group = coefficient_width * x;
+
+            for (k = n0; k <= max_n; k++)
+            {
+                int out_pixel_index = k * 1;
+                float coefficient = horizontal_coefficients[coefficient_group + k - n0];
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+            }
+        }
+        break;
+
+    case 2:
+        for (x = 0; x < max_x; x++)
+        {
+            int n0 = horizontal_contributors[x].n0;
+            int n1 = horizontal_contributors[x].n1;
+
+            int in_x = x - filter_pixel_margin;
+            int in_pixel_index = in_x * 2;
+            int max_n = n1;
+            int coefficient_group = coefficient_width * x;
+
+            for (k = n0; k <= max_n; k++)
+            {
+                int out_pixel_index = k * 2;
+                float coefficient = horizontal_coefficients[coefficient_group + k - n0];
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+                output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient;
+            }
+        }
+        break;
+
+    case 3:
+        for (x = 0; x < max_x; x++)
+        {
+            int n0 = horizontal_contributors[x].n0;
+            int n1 = horizontal_contributors[x].n1;
+
+            int in_x = x - filter_pixel_margin;
+            int in_pixel_index = in_x * 3;
+            int max_n = n1;
+            int coefficient_group = coefficient_width * x;
+
+            for (k = n0; k <= max_n; k++)
+            {
+                int out_pixel_index = k * 3;
+                float coefficient = horizontal_coefficients[coefficient_group + k - n0];
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+                output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient;
+                output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient;
+            }
+        }
+        break;
+
+    case 4:
+        for (x = 0; x < max_x; x++)
+        {
+            int n0 = horizontal_contributors[x].n0;
+            int n1 = horizontal_contributors[x].n1;
+
+            int in_x = x - filter_pixel_margin;
+            int in_pixel_index = in_x * 4;
+            int max_n = n1;
+            int coefficient_group = coefficient_width * x;
+
+            for (k = n0; k <= max_n; k++)
+            {
+                int out_pixel_index = k * 4;
+                float coefficient = horizontal_coefficients[coefficient_group + k - n0];
+                output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient;
+                output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient;
+                output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient;
+                output_buffer[out_pixel_index + 3] += decode_buffer[in_pixel_index + 3] * coefficient;
+            }
+        }
+        break;
+
+    default:
+        for (x = 0; x < max_x; x++)
+        {
+            int n0 = horizontal_contributors[x].n0;
+            int n1 = horizontal_contributors[x].n1;
+
+            int in_x = x - filter_pixel_margin;
+            int in_pixel_index = in_x * channels;
+            int max_n = n1;
+            int coefficient_group = coefficient_width * x;
+
+            for (k = n0; k <= max_n; k++)
+            {
+                int c;
+                int out_pixel_index = k * channels;
+                float coefficient = horizontal_coefficients[coefficient_group + k - n0];
+                for (c = 0; c < channels; c++)
+                    output_buffer[out_pixel_index + c] += decode_buffer[in_pixel_index + c] * coefficient;
+            }
+        }
+        break;
+    }
+}
+
+static void stbir__decode_and_resample_upsample(stbir__info *stbir_info, int n)
+{
+    // Decode the nth scanline from the source image into the decode buffer.
+    stbir__decode_scanline(stbir_info, n);
+
+    // Now resample it into the ring buffer.
+    if (stbir__use_width_upsampling(stbir_info))
+        stbir__resample_horizontal_upsample(stbir_info, stbir__add_empty_ring_buffer_entry(stbir_info, n));
+    else
+        stbir__resample_horizontal_downsample(stbir_info, stbir__add_empty_ring_buffer_entry(stbir_info, n));
+
+    // Now it's sitting in the ring buffer ready to be used as source for the vertical sampling.
+}
+
+static void stbir__decode_and_resample_downsample(stbir__info *stbir_info, int n)
+{
+    // Decode the nth scanline from the source image into the decode buffer.
+    stbir__decode_scanline(stbir_info, n);
+
+    memset(stbir_info->horizontal_buffer, 0, stbir_info->output_w * stbir_info->channels * sizeof(float));
+
+    // Now resample it into the horizontal buffer.
+    if (stbir__use_width_upsampling(stbir_info))
+        stbir__resample_horizontal_upsample(stbir_info, stbir_info->horizontal_buffer);
+    else
+        stbir__resample_horizontal_downsample(stbir_info, stbir_info->horizontal_buffer);
+
+    // Now it's sitting in the horizontal buffer ready to be distributed into the ring buffers.
+}
+
+// Get the specified scan line from the ring buffer.
+static float *stbir__get_ring_buffer_scanline(int get_scanline, float *ring_buffer, int begin_index, int first_scanline, int ring_buffer_num_entries, int ring_buffer_length)
+{
+    int ring_buffer_index = (begin_index + (get_scanline - first_scanline)) % ring_buffer_num_entries;
+    return stbir__get_ring_buffer_entry(ring_buffer, ring_buffer_index, ring_buffer_length);
+}
+
+static void stbir__encode_scanline(stbir__info *stbir_info, int num_pixels, void *output_buffer, float *encode_buffer, int channels, int alpha_channel, int decode)
+{
+    int x;
+    int n;
+    int num_nonalpha;
+    stbir_uint16 nonalpha[STBIR_MAX_CHANNELS];
+
+    if (!(stbir_info->flags & STBIR_FLAG_ALPHA_PREMULTIPLIED))
+    {
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            float alpha = encode_buffer[pixel_index + alpha_channel];
+            float reciprocal_alpha = alpha ? 1.0f / alpha : 0;
+
+            // unrolling this produced a 1% slowdown upscaling a large RGBA linear-space image on my machine - stb
+            for (n = 0; n < channels; n++)
+                if (n != alpha_channel)
+                    encode_buffer[pixel_index + n] *= reciprocal_alpha;
+
+            // We added in a small epsilon to prevent the color channel from being deleted with zero alpha.
+            // Because we only add it for integer types, it will automatically be discarded on integer
+            // conversion, so we don't need to subtract it back out (which would be problematic for
+            // numeric precision reasons).
+        }
+    }
+
+    // build a table of all channels that need colorspace correction, so
+    // we don't perform colorspace correction on channels that don't need it.
+    for (x = 0, num_nonalpha = 0; x < channels; ++x)
+    {
+        if (x != alpha_channel || (stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+        {
+            nonalpha[num_nonalpha++] = (stbir_uint16)x;
+        }
+    }
+
+#define STBIR__ROUND_INT(f) ((int)((f) + 0.5))
+#define STBIR__ROUND_UINT(f) ((stbir_uint32)((f) + 0.5))
+
+#ifdef STBIR__SATURATE_INT
+#define STBIR__ENCODE_LINEAR8(f) stbir__saturate8(STBIR__ROUND_INT((f)*stbir__max_uint8_as_float))
+#define STBIR__ENCODE_LINEAR16(f) stbir__saturate16(STBIR__ROUND_INT((f)*stbir__max_uint16_as_float))
+#else
+#define STBIR__ENCODE_LINEAR8(f) (unsigned char)STBIR__ROUND_INT(stbir__saturate(f) * stbir__max_uint8_as_float)
+#define STBIR__ENCODE_LINEAR16(f) (unsigned short)STBIR__ROUND_INT(stbir__saturate(f) * stbir__max_uint16_as_float)
+#endif
+
+    switch (decode)
+    {
+    case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_LINEAR):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < channels; n++)
+            {
+                int index = pixel_index + n;
+                ((unsigned char *)output_buffer)[index] = STBIR__ENCODE_LINEAR8(encode_buffer[index]);
+            }
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_SRGB):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < num_nonalpha; n++)
+            {
+                int index = pixel_index + nonalpha[n];
+                ((unsigned char *)output_buffer)[index] = stbir__linear_to_srgb_uchar(encode_buffer[index]);
+            }
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                ((unsigned char *)output_buffer)[pixel_index + alpha_channel] = STBIR__ENCODE_LINEAR8(encode_buffer[pixel_index + alpha_channel]);
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_LINEAR):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < channels; n++)
+            {
+                int index = pixel_index + n;
+                ((unsigned short *)output_buffer)[index] = STBIR__ENCODE_LINEAR16(encode_buffer[index]);
+            }
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_SRGB):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < num_nonalpha; n++)
+            {
+                int index = pixel_index + nonalpha[n];
+                ((unsigned short *)output_buffer)[index] = (unsigned short)STBIR__ROUND_INT(stbir__linear_to_srgb(stbir__saturate(encode_buffer[index])) * stbir__max_uint16_as_float);
+            }
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                ((unsigned short *)output_buffer)[pixel_index + alpha_channel] = STBIR__ENCODE_LINEAR16(encode_buffer[pixel_index + alpha_channel]);
+        }
+
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_LINEAR):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < channels; n++)
+            {
+                int index = pixel_index + n;
+                ((unsigned int *)output_buffer)[index] = (unsigned int)STBIR__ROUND_UINT(((double)stbir__saturate(encode_buffer[index])) * stbir__max_uint32_as_float);
+            }
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_SRGB):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < num_nonalpha; n++)
+            {
+                int index = pixel_index + nonalpha[n];
+                ((unsigned int *)output_buffer)[index] = (unsigned int)STBIR__ROUND_UINT(((double)stbir__linear_to_srgb(stbir__saturate(encode_buffer[index]))) * stbir__max_uint32_as_float);
+            }
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                ((unsigned int *)output_buffer)[pixel_index + alpha_channel] = (unsigned int)STBIR__ROUND_INT(((double)stbir__saturate(encode_buffer[pixel_index + alpha_channel])) * stbir__max_uint32_as_float);
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_LINEAR):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < channels; n++)
+            {
+                int index = pixel_index + n;
+                ((float *)output_buffer)[index] = encode_buffer[index];
+            }
+        }
+        break;
+
+    case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_SRGB):
+        for (x = 0; x < num_pixels; ++x)
+        {
+            int pixel_index = x * channels;
+
+            for (n = 0; n < num_nonalpha; n++)
+            {
+                int index = pixel_index + nonalpha[n];
+                ((float *)output_buffer)[index] = stbir__linear_to_srgb(encode_buffer[index]);
+            }
+
+            if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE))
+                ((float *)output_buffer)[pixel_index + alpha_channel] = encode_buffer[pixel_index + alpha_channel];
+        }
+        break;
+
+    default:
+        STBIR_ASSERT(!"Unknown type/colorspace/channels combination.");
+        break;
+    }
+}
+
+static void stbir__resample_vertical_upsample(stbir__info *stbir_info, int n)
+{
+    int x, k;
+    int output_w = stbir_info->output_w;
+    stbir__contributors *vertical_contributors = stbir_info->vertical_contributors;
+    float *vertical_coefficients = stbir_info->vertical_coefficients;
+    int channels = stbir_info->channels;
+    int alpha_channel = stbir_info->alpha_channel;
+    int type = stbir_info->type;
+    int colorspace = stbir_info->colorspace;
+    int ring_buffer_entries = stbir_info->ring_buffer_num_entries;
+    void *output_data = stbir_info->output_data;
+    float *encode_buffer = stbir_info->encode_buffer;
+    int decode = STBIR__DECODE(type, colorspace);
+    int coefficient_width = stbir_info->vertical_coefficient_width;
+    int coefficient_counter;
+    int contributor = n;
+
+    float *ring_buffer = stbir_info->ring_buffer;
+    int ring_buffer_begin_index = stbir_info->ring_buffer_begin_index;
+    int ring_buffer_first_scanline = stbir_info->ring_buffer_first_scanline;
+    int ring_buffer_length = stbir_info->ring_buffer_length_bytes / sizeof(float);
+
+    int n0, n1, output_row_start;
+    int coefficient_group = coefficient_width * contributor;
+
+    n0 = vertical_contributors[contributor].n0;
+    n1 = vertical_contributors[contributor].n1;
+
+    output_row_start = n * stbir_info->output_stride_bytes;
+
+    STBIR_ASSERT(stbir__use_height_upsampling(stbir_info));
+
+    memset(encode_buffer, 0, output_w * sizeof(float) * channels);
+
+    // I tried reblocking this for better cache usage of encode_buffer
+    // (using x_outer, k, x_inner), but it lost speed. -- stb
+
+    coefficient_counter = 0;
+    switch (channels)
+    {
+    case 1:
+        for (k = n0; k <= n1; k++)
+        {
+            int coefficient_index = coefficient_counter++;
+            float *ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length);
+            float coefficient = vertical_coefficients[coefficient_group + coefficient_index];
+            for (x = 0; x < output_w; ++x)
+            {
+                int in_pixel_index = x * 1;
+                encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient;
+            }
+        }
+        break;
+    case 2:
+        for (k = n0; k <= n1; k++)
+        {
+            int coefficient_index = coefficient_counter++;
+            float *ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length);
+            float coefficient = vertical_coefficients[coefficient_group + coefficient_index];
+            for (x = 0; x < output_w; ++x)
+            {
+                int in_pixel_index = x * 2;
+                encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient;
+                encode_buffer[in_pixel_index + 1] += ring_buffer_entry[in_pixel_index + 1] * coefficient;
+            }
+        }
+        break;
+    case 3:
+        for (k = n0; k <= n1; k++)
+        {
+            int coefficient_index = coefficient_counter++;
+            float *ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length);
+            float coefficient = vertical_coefficients[coefficient_group + coefficient_index];
+            for (x = 0; x < output_w; ++x)
+            {
+                int in_pixel_index = x * 3;
+                encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient;
+                encode_buffer[in_pixel_index + 1] += ring_buffer_entry[in_pixel_index + 1] * coefficient;
+                encode_buffer[in_pixel_index + 2] += ring_buffer_entry[in_pixel_index + 2] * coefficient;
+            }
+        }
+        break;
+    case 4:
+        for (k = n0; k <= n1; k++)
+        {
+            int coefficient_index = coefficient_counter++;
+            float *ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length);
+            float coefficient = vertical_coefficients[coefficient_group + coefficient_index];
+            for (x = 0; x < output_w; ++x)
+            {
+                int in_pixel_index = x * 4;
+                encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient;
+                encode_buffer[in_pixel_index + 1] += ring_buffer_entry[in_pixel_index + 1] * coefficient;
+                encode_buffer[in_pixel_index + 2] += ring_buffer_entry[in_pixel_index + 2] * coefficient;
+                encode_buffer[in_pixel_index + 3] += ring_buffer_entry[in_pixel_index + 3] * coefficient;
+            }
+        }
+        break;
+    default:
+        for (k = n0; k <= n1; k++)
+        {
+            int coefficient_index = coefficient_counter++;
+            float *ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length);
+            float coefficient = vertical_coefficients[coefficient_group + coefficient_index];
+            for (x = 0; x < output_w; ++x)
+            {
+                int in_pixel_index = x * channels;
+                int c;
+                for (c = 0; c < channels; c++)
+                    encode_buffer[in_pixel_index + c] += ring_buffer_entry[in_pixel_index + c] * coefficient;
+            }
+        }
+        break;
+    }
+    stbir__encode_scanline(stbir_info, output_w, (char *)output_data + output_row_start, encode_buffer, channels, alpha_channel, decode);
+}
+
+static void stbir__resample_vertical_downsample(stbir__info *stbir_info, int n)
+{
+    int x, k;
+    int output_w = stbir_info->output_w;
+    stbir__contributors *vertical_contributors = stbir_info->vertical_contributors;
+    float *vertical_coefficients = stbir_info->vertical_coefficients;
+    int channels = stbir_info->channels;
+    int ring_buffer_entries = stbir_info->ring_buffer_num_entries;
+    float *horizontal_buffer = stbir_info->horizontal_buffer;
+    int coefficient_width = stbir_info->vertical_coefficient_width;
+    int contributor = n + stbir_info->vertical_filter_pixel_margin;
+
+    float *ring_buffer = stbir_info->ring_buffer;
+    int ring_buffer_begin_index = stbir_info->ring_buffer_begin_index;
+    int ring_buffer_first_scanline = stbir_info->ring_buffer_first_scanline;
+    int ring_buffer_length = stbir_info->ring_buffer_length_bytes / sizeof(float);
+    int n0, n1;
+
+    n0 = vertical_contributors[contributor].n0;
+    n1 = vertical_contributors[contributor].n1;
+
+    STBIR_ASSERT(!stbir__use_height_upsampling(stbir_info));
+
+    for (k = n0; k <= n1; k++)
+    {
+        int coefficient_index = k - n0;
+        int coefficient_group = coefficient_width * contributor;
+        float coefficient = vertical_coefficients[coefficient_group + coefficient_index];
+
+        float *ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length);
+
+        switch (channels)
+        {
+        case 1:
+            for (x = 0; x < output_w; x++)
+            {
+                int in_pixel_index = x * 1;
+                ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient;
+            }
+            break;
+        case 2:
+            for (x = 0; x < output_w; x++)
+            {
+                int in_pixel_index = x * 2;
+                ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient;
+                ring_buffer_entry[in_pixel_index + 1] += horizontal_buffer[in_pixel_index + 1] * coefficient;
+            }
+            break;
+        case 3:
+            for (x = 0; x < output_w; x++)
+            {
+                int in_pixel_index = x * 3;
+                ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient;
+                ring_buffer_entry[in_pixel_index + 1] += horizontal_buffer[in_pixel_index + 1] * coefficient;
+                ring_buffer_entry[in_pixel_index + 2] += horizontal_buffer[in_pixel_index + 2] * coefficient;
+            }
+            break;
+        case 4:
+            for (x = 0; x < output_w; x++)
+            {
+                int in_pixel_index = x * 4;
+                ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient;
+                ring_buffer_entry[in_pixel_index + 1] += horizontal_buffer[in_pixel_index + 1] * coefficient;
+                ring_buffer_entry[in_pixel_index + 2] += horizontal_buffer[in_pixel_index + 2] * coefficient;
+                ring_buffer_entry[in_pixel_index + 3] += horizontal_buffer[in_pixel_index + 3] * coefficient;
+            }
+            break;
+        default:
+            for (x = 0; x < output_w; x++)
+            {
+                int in_pixel_index = x * channels;
+
+                int c;
+                for (c = 0; c < channels; c++)
+                    ring_buffer_entry[in_pixel_index + c] += horizontal_buffer[in_pixel_index + c] * coefficient;
+            }
+            break;
+        }
+    }
+}
+
+static void stbir__buffer_loop_upsample(stbir__info *stbir_info)
+{
+    int y;
+    float scale_ratio = stbir_info->vertical_scale;
+    float out_scanlines_radius = stbir__filter_info_table[stbir_info->vertical_filter].support(1 / scale_ratio) * scale_ratio;
+
+    STBIR_ASSERT(stbir__use_height_upsampling(stbir_info));
+
+    for (y = 0; y < stbir_info->output_h; y++)
+    {
+        float in_center_of_out = 0; // Center of the current out scanline in the in scanline space
+        int in_first_scanline = 0, in_last_scanline = 0;
+
+        stbir__calculate_sample_range_upsample(y, out_scanlines_radius, scale_ratio, stbir_info->vertical_shift, &in_first_scanline, &in_last_scanline, &in_center_of_out);
+
+        STBIR_ASSERT(in_last_scanline - in_first_scanline + 1 <= stbir_info->ring_buffer_num_entries);
+
+        if (stbir_info->ring_buffer_begin_index >= 0)
+        {
+            // Get rid of whatever we don't need anymore.
+            while (in_first_scanline > stbir_info->ring_buffer_first_scanline)
+            {
+                if (stbir_info->ring_buffer_first_scanline == stbir_info->ring_buffer_last_scanline)
+                {
+                    // We just popped the last scanline off the ring buffer.
+                    // Reset it to the empty state.
+                    stbir_info->ring_buffer_begin_index = -1;
+                    stbir_info->ring_buffer_first_scanline = 0;
+                    stbir_info->ring_buffer_last_scanline = 0;
+                    break;
+                }
+                else
+                {
+                    stbir_info->ring_buffer_first_scanline++;
+                    stbir_info->ring_buffer_begin_index = (stbir_info->ring_buffer_begin_index + 1) % stbir_info->ring_buffer_num_entries;
+                }
+            }
+        }
+
+        // Load in new ones.
+        if (stbir_info->ring_buffer_begin_index < 0)
+            stbir__decode_and_resample_upsample(stbir_info, in_first_scanline);
+
+        while (in_last_scanline > stbir_info->ring_buffer_last_scanline)
+            stbir__decode_and_resample_upsample(stbir_info, stbir_info->ring_buffer_last_scanline + 1);
+
+        // Now all buffers should be ready to write a row of vertical sampling.
+        stbir__resample_vertical_upsample(stbir_info, y);
+
+        STBIR_PROGRESS_REPORT((float)y / stbir_info->output_h);
+    }
+}
+
+static void stbir__empty_ring_buffer(stbir__info *stbir_info, int first_necessary_scanline)
+{
+    int output_stride_bytes = stbir_info->output_stride_bytes;
+    int channels = stbir_info->channels;
+    int alpha_channel = stbir_info->alpha_channel;
+    int type = stbir_info->type;
+    int colorspace = stbir_info->colorspace;
+    int output_w = stbir_info->output_w;
+    void *output_data = stbir_info->output_data;
+    int decode = STBIR__DECODE(type, colorspace);
+
+    float *ring_buffer = stbir_info->ring_buffer;
+    int ring_buffer_length = stbir_info->ring_buffer_length_bytes / sizeof(float);
+
+    if (stbir_info->ring_buffer_begin_index >= 0)
+    {
+        // Get rid of whatever we don't need anymore.
+        while (first_necessary_scanline > stbir_info->ring_buffer_first_scanline)
+        {
+            if (stbir_info->ring_buffer_first_scanline >= 0 && stbir_info->ring_buffer_first_scanline < stbir_info->output_h)
+            {
+                int output_row_start = stbir_info->ring_buffer_first_scanline * output_stride_bytes;
+                float *ring_buffer_entry = stbir__get_ring_buffer_entry(ring_buffer, stbir_info->ring_buffer_begin_index, ring_buffer_length);
+                stbir__encode_scanline(stbir_info, output_w, (char *)output_data + output_row_start, ring_buffer_entry, channels, alpha_channel, decode);
+                STBIR_PROGRESS_REPORT((float)stbir_info->ring_buffer_first_scanline / stbir_info->output_h);
+            }
+
+            if (stbir_info->ring_buffer_first_scanline == stbir_info->ring_buffer_last_scanline)
+            {
+                // We just popped the last scanline off the ring buffer.
+                // Reset it to the empty state.
+                stbir_info->ring_buffer_begin_index = -1;
+                stbir_info->ring_buffer_first_scanline = 0;
+                stbir_info->ring_buffer_last_scanline = 0;
+                break;
+            }
+            else
+            {
+                stbir_info->ring_buffer_first_scanline++;
+                stbir_info->ring_buffer_begin_index = (stbir_info->ring_buffer_begin_index + 1) % stbir_info->ring_buffer_num_entries;
+            }
+        }
+    }
+}
+
+static void stbir__buffer_loop_downsample(stbir__info *stbir_info)
+{
+    int y;
+    float scale_ratio = stbir_info->vertical_scale;
+    int output_h = stbir_info->output_h;
+    float in_pixels_radius = stbir__filter_info_table[stbir_info->vertical_filter].support(scale_ratio) / scale_ratio;
+    int pixel_margin = stbir_info->vertical_filter_pixel_margin;
+    int max_y = stbir_info->input_h + pixel_margin;
+
+    STBIR_ASSERT(!stbir__use_height_upsampling(stbir_info));
+
+    for (y = -pixel_margin; y < max_y; y++)
+    {
+        float out_center_of_in; // Center of the current out scanline in the in scanline space
+        int out_first_scanline, out_last_scanline;
+
+        stbir__calculate_sample_range_downsample(y, in_pixels_radius, scale_ratio, stbir_info->vertical_shift, &out_first_scanline, &out_last_scanline, &out_center_of_in);
+
+        STBIR_ASSERT(out_last_scanline - out_first_scanline + 1 <= stbir_info->ring_buffer_num_entries);
+
+        if (out_last_scanline < 0 || out_first_scanline >= output_h)
+            continue;
+
+        stbir__empty_ring_buffer(stbir_info, out_first_scanline);
+
+        stbir__decode_and_resample_downsample(stbir_info, y);
+
+        // Load in new ones.
+        if (stbir_info->ring_buffer_begin_index < 0)
+            stbir__add_empty_ring_buffer_entry(stbir_info, out_first_scanline);
+
+        while (out_last_scanline > stbir_info->ring_buffer_last_scanline)
+            stbir__add_empty_ring_buffer_entry(stbir_info, stbir_info->ring_buffer_last_scanline + 1);
+
+        // Now the horizontal buffer is ready to write to all ring buffer rows.
+        stbir__resample_vertical_downsample(stbir_info, y);
+    }
+
+    stbir__empty_ring_buffer(stbir_info, stbir_info->output_h);
+}
+
+static void stbir__setup(stbir__info *info, int input_w, int input_h, int output_w, int output_h, int channels)
+{
+    info->input_w = input_w;
+    info->input_h = input_h;
+    info->output_w = output_w;
+    info->output_h = output_h;
+    info->channels = channels;
+}
+
+static void stbir__calculate_transform(stbir__info *info, float s0, float t0, float s1, float t1, float *transform)
+{
+    info->s0 = s0;
+    info->t0 = t0;
+    info->s1 = s1;
+    info->t1 = t1;
+
+    if (transform)
+    {
+        info->horizontal_scale = transform[0];
+        info->vertical_scale = transform[1];
+        info->horizontal_shift = transform[2];
+        info->vertical_shift = transform[3];
+    }
+    else
+    {
+        info->horizontal_scale = ((float)info->output_w / info->input_w) / (s1 - s0);
+        info->vertical_scale = ((float)info->output_h / info->input_h) / (t1 - t0);
+
+        info->horizontal_shift = s0 * info->output_w / (s1 - s0);
+        info->vertical_shift = t0 * info->output_h / (t1 - t0);
+    }
+}
+
+static void stbir__choose_filter(stbir__info *info, stbir_filter h_filter, stbir_filter v_filter)
+{
+    if (h_filter == 0)
+        h_filter = stbir__use_upsampling(info->horizontal_scale) ? STBIR_DEFAULT_FILTER_UPSAMPLE : STBIR_DEFAULT_FILTER_DOWNSAMPLE;
+    if (v_filter == 0)
+        v_filter = stbir__use_upsampling(info->vertical_scale) ? STBIR_DEFAULT_FILTER_UPSAMPLE : STBIR_DEFAULT_FILTER_DOWNSAMPLE;
+    info->horizontal_filter = h_filter;
+    info->vertical_filter = v_filter;
+}
+
+static stbir_uint32 stbir__calculate_memory(stbir__info *info)
+{
+    int pixel_margin = stbir__get_filter_pixel_margin(info->horizontal_filter, info->horizontal_scale);
+    int filter_height = stbir__get_filter_pixel_width(info->vertical_filter, info->vertical_scale);
+
+    info->horizontal_num_contributors = stbir__get_contributors(info->horizontal_scale, info->horizontal_filter, info->input_w, info->output_w);
+    info->vertical_num_contributors = stbir__get_contributors(info->vertical_scale, info->vertical_filter, info->input_h, info->output_h);
+
+    // One extra entry because floating point precision problems sometimes cause an extra to be necessary.
+    info->ring_buffer_num_entries = filter_height + 1;
+
+    info->horizontal_contributors_size = info->horizontal_num_contributors * sizeof(stbir__contributors);
+    info->horizontal_coefficients_size = stbir__get_total_horizontal_coefficients(info) * sizeof(float);
+    info->vertical_contributors_size = info->vertical_num_contributors * sizeof(stbir__contributors);
+    info->vertical_coefficients_size = stbir__get_total_vertical_coefficients(info) * sizeof(float);
+    info->decode_buffer_size = (info->input_w + pixel_margin * 2) * info->channels * sizeof(float);
+    info->horizontal_buffer_size = info->output_w * info->channels * sizeof(float);
+    info->ring_buffer_size = info->output_w * info->channels * info->ring_buffer_num_entries * sizeof(float);
+    info->encode_buffer_size = info->output_w * info->channels * sizeof(float);
+
+    STBIR_ASSERT(info->horizontal_filter != 0);
+    STBIR_ASSERT(info->horizontal_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); // this now happens too late
+    STBIR_ASSERT(info->vertical_filter != 0);
+    STBIR_ASSERT(info->vertical_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); // this now happens too late
+
+    if (stbir__use_height_upsampling(info))
+        // The horizontal buffer is for when we're downsampling the height and we
+        // can't output the result of sampling the decode buffer directly into the
+        // ring buffers.
+        info->horizontal_buffer_size = 0;
+    else
+        // The encode buffer is to retain precision in the height upsampling method
+        // and isn't used when height downsampling.
+        info->encode_buffer_size = 0;
+
+    return info->horizontal_contributors_size + info->horizontal_coefficients_size + info->vertical_contributors_size + info->vertical_coefficients_size + info->decode_buffer_size + info->horizontal_buffer_size + info->ring_buffer_size + info->encode_buffer_size;
+}
+
+static int stbir__resize_allocated(stbir__info *info,
+                                   const void *input_data, int input_stride_in_bytes,
+                                   void *output_data, int output_stride_in_bytes,
+                                   int alpha_channel, stbir_uint32 flags, stbir_datatype type,
+                                   stbir_edge edge_horizontal, stbir_edge edge_vertical, stbir_colorspace colorspace,
+                                   void *tempmem, size_t tempmem_size_in_bytes)
+{
+    size_t memory_required = stbir__calculate_memory(info);
+
+    int width_stride_input = input_stride_in_bytes ? input_stride_in_bytes : info->channels * info->input_w * stbir__type_size[type];
+    int width_stride_output = output_stride_in_bytes ? output_stride_in_bytes : info->channels * info->output_w * stbir__type_size[type];
+
+#ifdef STBIR_DEBUG_OVERWRITE_TEST
+#define OVERWRITE_ARRAY_SIZE 8
+    unsigned char overwrite_output_before_pre[OVERWRITE_ARRAY_SIZE];
+    unsigned char overwrite_tempmem_before_pre[OVERWRITE_ARRAY_SIZE];
+    unsigned char overwrite_output_after_pre[OVERWRITE_ARRAY_SIZE];
+    unsigned char overwrite_tempmem_after_pre[OVERWRITE_ARRAY_SIZE];
+
+    size_t begin_forbidden = width_stride_output * (info->output_h - 1) + info->output_w * info->channels * stbir__type_size[type];
+    memcpy(overwrite_output_before_pre, &((unsigned char *)output_data)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE);
+    memcpy(overwrite_output_after_pre, &((unsigned char *)output_data)[begin_forbidden], OVERWRITE_ARRAY_SIZE);
+    memcpy(overwrite_tempmem_before_pre, &((unsigned char *)tempmem)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE);
+    memcpy(overwrite_tempmem_after_pre, &((unsigned char *)tempmem)[tempmem_size_in_bytes], OVERWRITE_ARRAY_SIZE);
+#endif
+
+    STBIR_ASSERT(info->channels >= 0);
+    STBIR_ASSERT(info->channels <= STBIR_MAX_CHANNELS);
+
+    if (info->channels < 0 || info->channels > STBIR_MAX_CHANNELS)
+        return 0;
+
+    STBIR_ASSERT(info->horizontal_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table));
+    STBIR_ASSERT(info->vertical_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table));
+
+    if (info->horizontal_filter >= STBIR__ARRAY_SIZE(stbir__filter_info_table))
+        return 0;
+    if (info->vertical_filter >= STBIR__ARRAY_SIZE(stbir__filter_info_table))
+        return 0;
+
+    if (alpha_channel < 0)
+        flags |= STBIR_FLAG_ALPHA_USES_COLORSPACE | STBIR_FLAG_ALPHA_PREMULTIPLIED;
+
+    if (!(flags & STBIR_FLAG_ALPHA_USES_COLORSPACE) || !(flags & STBIR_FLAG_ALPHA_PREMULTIPLIED))
+    {
+        STBIR_ASSERT(alpha_channel >= 0 && alpha_channel < info->channels);
+    }
+
+    if (alpha_channel >= info->channels)
+        return 0;
+
+    STBIR_ASSERT(tempmem);
+
+    if (!tempmem)
+        return 0;
+
+    STBIR_ASSERT(tempmem_size_in_bytes >= memory_required);
+
+    if (tempmem_size_in_bytes < memory_required)
+        return 0;
+
+    memset(tempmem, 0, tempmem_size_in_bytes);
+
+    info->input_data = input_data;
+    info->input_stride_bytes = width_stride_input;
+
+    info->output_data = output_data;
+    info->output_stride_bytes = width_stride_output;
+
+    info->alpha_channel = alpha_channel;
+    info->flags = flags;
+    info->type = type;
+    info->edge_horizontal = edge_horizontal;
+    info->edge_vertical = edge_vertical;
+    info->colorspace = colorspace;
+
+    info->horizontal_coefficient_width = stbir__get_coefficient_width(info->horizontal_filter, info->horizontal_scale);
+    info->vertical_coefficient_width = stbir__get_coefficient_width(info->vertical_filter, info->vertical_scale);
+    info->horizontal_filter_pixel_width = stbir__get_filter_pixel_width(info->horizontal_filter, info->horizontal_scale);
+    info->vertical_filter_pixel_width = stbir__get_filter_pixel_width(info->vertical_filter, info->vertical_scale);
+    info->horizontal_filter_pixel_margin = stbir__get_filter_pixel_margin(info->horizontal_filter, info->horizontal_scale);
+    info->vertical_filter_pixel_margin = stbir__get_filter_pixel_margin(info->vertical_filter, info->vertical_scale);
+
+    info->ring_buffer_length_bytes = info->output_w * info->channels * sizeof(float);
+    info->decode_buffer_pixels = info->input_w + info->horizontal_filter_pixel_margin * 2;
+
+#define STBIR__NEXT_MEMPTR(current, newtype) (newtype *)(((unsigned char *)current) + current##_size)
+
+    info->horizontal_contributors = (stbir__contributors *)tempmem;
+    info->horizontal_coefficients = STBIR__NEXT_MEMPTR(info->horizontal_contributors, float);
+    info->vertical_contributors = STBIR__NEXT_MEMPTR(info->horizontal_coefficients, stbir__contributors);
+    info->vertical_coefficients = STBIR__NEXT_MEMPTR(info->vertical_contributors, float);
+    info->decode_buffer = STBIR__NEXT_MEMPTR(info->vertical_coefficients, float);
+
+    if (stbir__use_height_upsampling(info))
+    {
+        info->horizontal_buffer = NULL;
+        info->ring_buffer = STBIR__NEXT_MEMPTR(info->decode_buffer, float);
+        info->encode_buffer = STBIR__NEXT_MEMPTR(info->ring_buffer, float);
+
+        STBIR_ASSERT((size_t)STBIR__NEXT_MEMPTR(info->encode_buffer, unsigned char) == (size_t)tempmem + tempmem_size_in_bytes);
+    }
+    else
+    {
+        info->horizontal_buffer = STBIR__NEXT_MEMPTR(info->decode_buffer, float);
+        info->ring_buffer = STBIR__NEXT_MEMPTR(info->horizontal_buffer, float);
+        info->encode_buffer = NULL;
+
+        STBIR_ASSERT((size_t)STBIR__NEXT_MEMPTR(info->ring_buffer, unsigned char) == (size_t)tempmem + tempmem_size_in_bytes);
+    }
+
+#undef STBIR__NEXT_MEMPTR
+
+    // This signals that the ring buffer is empty
+    info->ring_buffer_begin_index = -1;
+
+    stbir__calculate_filters(info->horizontal_contributors, info->horizontal_coefficients, info->horizontal_filter, info->horizontal_scale, info->horizontal_shift, info->input_w, info->output_w);
+    stbir__calculate_filters(info->vertical_contributors, info->vertical_coefficients, info->vertical_filter, info->vertical_scale, info->vertical_shift, info->input_h, info->output_h);
+
+    STBIR_PROGRESS_REPORT(0);
+
+    if (stbir__use_height_upsampling(info))
+        stbir__buffer_loop_upsample(info);
+    else
+        stbir__buffer_loop_downsample(info);
+
+    STBIR_PROGRESS_REPORT(1);
+
+#ifdef STBIR_DEBUG_OVERWRITE_TEST
+    STBIR_ASSERT(memcmp(overwrite_output_before_pre, &((unsigned char *)output_data)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE) == 0);
+    STBIR_ASSERT(memcmp(overwrite_output_after_pre, &((unsigned char *)output_data)[begin_forbidden], OVERWRITE_ARRAY_SIZE) == 0);
+    STBIR_ASSERT(memcmp(overwrite_tempmem_before_pre, &((unsigned char *)tempmem)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE) == 0);
+    STBIR_ASSERT(memcmp(overwrite_tempmem_after_pre, &((unsigned char *)tempmem)[tempmem_size_in_bytes], OVERWRITE_ARRAY_SIZE) == 0);
+#endif
+
+    return 1;
+}
+
+static int stbir__resize_arbitrary(
+    void *alloc_context,
+    const void *input_data, int input_w, int input_h, int input_stride_in_bytes,
+    void *output_data, int output_w, int output_h, int output_stride_in_bytes,
+    float s0, float t0, float s1, float t1, float *transform,
+    int channels, int alpha_channel, stbir_uint32 flags, stbir_datatype type,
+    stbir_filter h_filter, stbir_filter v_filter,
+    stbir_edge edge_horizontal, stbir_edge edge_vertical, stbir_colorspace colorspace)
+{
+    stbir__info info;
+    int result;
+    size_t memory_required;
+    void *extra_memory;
+
+    stbir__setup(&info, input_w, input_h, output_w, output_h, channels);
+    stbir__calculate_transform(&info, s0, t0, s1, t1, transform);
+    stbir__choose_filter(&info, h_filter, v_filter);
+    memory_required = stbir__calculate_memory(&info);
+    extra_memory = STBIR_MALLOC(memory_required, alloc_context);
+
+    if (!extra_memory)
+        return 0;
+
+    result = stbir__resize_allocated(&info, input_data, input_stride_in_bytes,
+                                     output_data, output_stride_in_bytes,
+                                     alpha_channel, flags, type,
+                                     edge_horizontal, edge_vertical,
+                                     colorspace, extra_memory, memory_required);
+
+    STBIR_FREE(extra_memory, alloc_context);
+
+    return result;
+}
+
+STBIRDEF int stbir_resize_uint8(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                int num_channels)
+{
+    return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, -1, 0, STBIR_TYPE_UINT8, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT,
+                                   STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR);
+}
+
+STBIRDEF int stbir_resize_float(const float *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                float *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                int num_channels)
+{
+    return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, -1, 0, STBIR_TYPE_FLOAT, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT,
+                                   STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR);
+}
+
+STBIRDEF int stbir_resize_uint8_srgb(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                     unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                     int num_channels, int alpha_channel, int flags)
+{
+    return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, alpha_channel, flags, STBIR_TYPE_UINT8, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT,
+                                   STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB);
+}
+
+STBIRDEF int stbir_resize_uint8_srgb_edgemode(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                              unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                              int num_channels, int alpha_channel, int flags,
+                                              stbir_edge edge_wrap_mode)
+{
+    return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, alpha_channel, flags, STBIR_TYPE_UINT8, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT,
+                                   edge_wrap_mode, edge_wrap_mode, STBIR_COLORSPACE_SRGB);
+}
+
+STBIRDEF int stbir_resize_uint8_generic(const unsigned char *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                        unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                        int num_channels, int alpha_channel, int flags,
+                                        stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space,
+                                        void *alloc_context)
+{
+    return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, alpha_channel, flags, STBIR_TYPE_UINT8, filter, filter,
+                                   edge_wrap_mode, edge_wrap_mode, space);
+}
+
+STBIRDEF int stbir_resize_uint16_generic(const stbir_uint16 *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                         stbir_uint16 *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                         int num_channels, int alpha_channel, int flags,
+                                         stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space,
+                                         void *alloc_context)
+{
+    return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, alpha_channel, flags, STBIR_TYPE_UINT16, filter, filter,
+                                   edge_wrap_mode, edge_wrap_mode, space);
+}
+
+STBIRDEF int stbir_resize_float_generic(const float *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                        float *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                        int num_channels, int alpha_channel, int flags,
+                                        stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space,
+                                        void *alloc_context)
+{
+    return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, alpha_channel, flags, STBIR_TYPE_FLOAT, filter, filter,
+                                   edge_wrap_mode, edge_wrap_mode, space);
+}
+
+STBIRDEF int stbir_resize(const void *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                          void *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                          stbir_datatype datatype,
+                          int num_channels, int alpha_channel, int flags,
+                          stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical,
+                          stbir_filter filter_horizontal, stbir_filter filter_vertical,
+                          stbir_colorspace space, void *alloc_context)
+{
+    return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, NULL, num_channels, alpha_channel, flags, datatype, filter_horizontal, filter_vertical,
+                                   edge_mode_horizontal, edge_mode_vertical, space);
+}
+
+STBIRDEF int stbir_resize_subpixel(const void *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                   void *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                   stbir_datatype datatype,
+                                   int num_channels, int alpha_channel, int flags,
+                                   stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical,
+                                   stbir_filter filter_horizontal, stbir_filter filter_vertical,
+                                   stbir_colorspace space, void *alloc_context,
+                                   float x_scale, float y_scale,
+                                   float x_offset, float y_offset)
+{
+    float transform[4];
+    transform[0] = x_scale;
+    transform[1] = y_scale;
+    transform[2] = x_offset;
+    transform[3] = y_offset;
+    return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   0, 0, 1, 1, transform, num_channels, alpha_channel, flags, datatype, filter_horizontal, filter_vertical,
+                                   edge_mode_horizontal, edge_mode_vertical, space);
+}
+
+STBIRDEF int stbir_resize_region(const void *input_pixels, int input_w, int input_h, int input_stride_in_bytes,
+                                 void *output_pixels, int output_w, int output_h, int output_stride_in_bytes,
+                                 stbir_datatype datatype,
+                                 int num_channels, int alpha_channel, int flags,
+                                 stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical,
+                                 stbir_filter filter_horizontal, stbir_filter filter_vertical,
+                                 stbir_colorspace space, void *alloc_context,
+                                 float s0, float t0, float s1, float t1)
+{
+    return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes,
+                                   output_pixels, output_w, output_h, output_stride_in_bytes,
+                                   s0, t0, s1, t1, NULL, num_channels, alpha_channel, flags, datatype, filter_horizontal, filter_vertical,
+                                   edge_mode_horizontal, edge_mode_vertical, space);
+}
+
+#endif // STB_IMAGE_RESIZE_IMPLEMENTATION
+
+/*
+------------------------------------------------------------------------------
+This software is available under 2 licenses -- choose whichever you prefer.
+------------------------------------------------------------------------------
+ALTERNATIVE A - MIT License
+Copyright (c) 2017 Sean Barrett
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+------------------------------------------------------------------------------
+ALTERNATIVE B - Public Domain (www.unlicense.org)
+This is free and unencumbered software released into the public domain.
+Anyone is free to copy, modify, publish, use, compile, sell, or distribute this
+software, either in source code form or as a compiled binary, for any purpose,
+commercial or non-commercial, and by any means.
+In jurisdictions that recognize copyright laws, the author or authors of this
+software dedicate any and all copyright interest in the software to the public
+domain. We make this dedication for the benefit of the public at large and to
+the detriment of our heirs and successors. We intend this dedication to be an
+overt act of relinquishment in perpetuity of all present and future rights to
+this software under copyright law.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+------------------------------------------------------------------------------
+*/
diff --git a/Kernel/include/symbols.hpp b/Kernel/include/symbols.hpp
new file mode 100644
index 00000000..78699b81
--- /dev/null
+++ b/Kernel/include/symbols.hpp
@@ -0,0 +1,43 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <types.h>
+
+namespace SymbolResolver
+{
+    class Symbols
+    {
+    private:
+        struct SymbolTable
+        {
+            uintptr_t Address;
+            char *FunctionName;
+        };
+
+        SymbolTable SymTable[0x10000];
+        uintptr_t TotalEntries = 0;
+
+    public:
+        Symbols(uintptr_t ImageAddress);
+        ~Symbols();
+        const char *GetSymbolFromAddress(uintptr_t Address);
+        void AddSymbol(uintptr_t Address, const char *Name);
+    };
+}
+
+extern SymbolResolver::Symbols *SymTbl;
diff --git a/Kernel/include/syscalls.hpp b/Kernel/include/syscalls.hpp
new file mode 100644
index 00000000..74b773e2
--- /dev/null
+++ b/Kernel/include/syscalls.hpp
@@ -0,0 +1,44 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_SYSCALLS_H__
+#define __FENNIX_KERNEL_SYSCALLS_H__
+
+#include <types.h>
+
+typedef struct SyscallsFrame
+{
+#if defined(a64)
+    uint64_t r15, r14, r13, r12, r11, r10, r9, r8;
+    uint64_t rbp, rdi, rsi, rdx, rcx, rbx, rax;
+    uint64_t InterruptNumber, ErrorCode, rip, cs, rflags, rsp, ss;
+#elif defined(a32)
+    uint32_t ebp, edi, esi, edx, ecx, ebx, eax;
+    uint32_t InterruptNumber, ErrorCode, eip, cs, eflags, esp, ss;
+#elif defined(aa64)
+#endif
+} SyscallsFrame;
+
+uintptr_t HandleNativeSyscalls(SyscallsFrame *Frame);
+uintptr_t HandleLinuxSyscalls(SyscallsFrame *Frame);
+
+/**
+ * @brief Initialize syscalls for the current CPU. (Function is available on x32, x64 & aarch64)
+ */
+void InitializeSystemCalls();
+
+#endif // !__FENNIX_KERNEL_SYSCALLS_H__
diff --git a/Kernel/include/targp.h b/Kernel/include/targp.h
new file mode 100644
index 00000000..4f5a395d
--- /dev/null
+++ b/Kernel/include/targp.h
@@ -0,0 +1,32 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef TinyArgumentParser_H__
+#define TinyArgumentParser_H__
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+    void targp_parse(const char *cmd, char **argv, int *argc);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // !TinyArgumentParser_H__
diff --git a/Kernel/include/task.hpp b/Kernel/include/task.hpp
new file mode 100644
index 00000000..95e828b4
--- /dev/null
+++ b/Kernel/include/task.hpp
@@ -0,0 +1,356 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_TASKING_H__
+#define __FENNIX_KERNEL_TASKING_H__
+
+#include <types.h>
+
+#include <filesystem.hpp>
+#include <symbols.hpp>
+#include <memory.hpp>
+#include <ints.hpp>
+#include <ipc.hpp>
+#include <debug.h>
+#include <vector>
+#include <atomic>
+#include <abi.h>
+
+namespace Tasking
+{
+    typedef unsigned long IP;
+    typedef __UINTPTR_TYPE__ IPOffset;
+    typedef unsigned long UPID;
+    typedef unsigned long UTID;
+    typedef __UINTPTR_TYPE__ Token;
+
+    enum TaskArchitecture
+    {
+        UnknownArchitecture,
+        x32,
+        x64,
+        ARM32,
+        ARM64
+    };
+
+    enum TaskCompatibility
+    {
+        UnknownPlatform,
+        Native,
+        Linux,
+        Windows
+    };
+
+    enum TaskTrustLevel
+    {
+        UnknownElevation,
+        Kernel,
+        System,
+        User
+    };
+
+    enum TaskStatus
+    {
+        UnknownStatus,
+        Ready,
+        Running,
+        Sleeping,
+        Waiting,
+        Stopped,
+        Terminated
+    };
+
+    enum TaskPriority
+    {
+        UnknownPriority = 0,
+        Idle = 1,
+        Low = 2,
+        Normal = 5,
+        High = 8,
+        Critical = 10
+    };
+
+    struct TaskSecurity
+    {
+        TaskTrustLevel TrustLevel;
+        Token UniqueToken;
+        bool IsCritical;
+        bool IsDebugEnabled;
+        bool IsKernelDebugEnabled;
+    };
+
+    struct TaskInfo
+    {
+        uint64_t OldUserTime = 0;
+        uint64_t OldKernelTime = 0;
+
+        uint64_t SleepUntil = 0;
+        uint64_t KernelTime = 0, UserTime = 0, SpawnTime = 0, LastUpdateTime = 0;
+        uint64_t Year, Month, Day, Hour, Minute, Second;
+        bool Affinity[256];  // MAX_CPU
+        TaskPriority Priority;
+        TaskArchitecture Architecture;
+        TaskCompatibility Compatibility;
+    };
+
+    struct TCB
+    {
+        UTID ID;
+        char Name[256];
+        struct PCB *Parent;
+        IP EntryPoint;
+        IPOffset Offset;
+        int ExitCode;
+        Memory::StackGuard *Stack;
+        Memory::MemMgr *Memory;
+        TaskStatus Status;
+#if defined(a64)
+        CPU::x64::TrapFrame Registers;
+        uint64_t GSBase, FSBase;
+#elif defined(a32)
+        CPU::x32::TrapFrame Registers; // TODO
+        uint64_t GSBase, FSBase;
+#elif defined(aa64)
+        uint64_t Registers; // TODO
+#endif
+        uintptr_t IPHistory[128];
+        TaskSecurity Security;
+        TaskInfo Info;
+        CPU::x64::FXState *FPU;
+
+        void Rename(const char *name)
+        {
+            CriticalSection cs;
+            if (strlen(name) > 256 || strlen(name) == 0)
+            {
+                debug("Invalid thread name");
+                return;
+            }
+
+            trace("Renaming thread %s to %s", Name, name);
+            strncpy(Name, name, 256);
+        }
+
+        void SetPriority(TaskPriority priority)
+        {
+            CriticalSection cs;
+            trace("Setting priority of thread %s to %d", Name, priority);
+            Info.Priority = priority;
+        }
+
+        int GetExitCode() { return ExitCode; }
+
+        void SetCritical(bool Critical)
+        {
+            CriticalSection cs;
+            trace("Setting criticality of thread %s to %s", Name, Critical ? "true" : "false");
+            Security.IsCritical = Critical;
+        }
+
+        void SetDebugMode(bool Enable)
+        {
+            CriticalSection cs;
+            trace("Setting debug mode of thread %s to %s", Name, Enable ? "true" : "false");
+            Security.IsDebugEnabled = Enable;
+        }
+
+        void SetKernelDebugMode(bool Enable)
+        {
+            CriticalSection cs;
+            trace("Setting kernel debug mode of thread %s to %s", Name, Enable ? "true" : "false");
+            Security.IsKernelDebugEnabled = Enable;
+        }
+    };
+
+    struct PCB
+    {
+        UPID ID;
+        char Name[256];
+        PCB *Parent;
+        int ExitCode;
+        TaskStatus Status;
+        TaskSecurity Security;
+        TaskInfo Info;
+        std::vector<TCB *> Threads;
+        std::vector<PCB *> Children;
+        InterProcessCommunication::IPC *IPC;
+        Memory::PageTable4 *PageTable;
+        SymbolResolver::Symbols *ELFSymbolTable;
+        VirtualFileSystem::Node *ProcessDirectory;
+        VirtualFileSystem::Node *memDirectory;
+    };
+
+    /** @brief Token Trust Level */
+    enum TTL
+    {
+        UnknownTrustLevel = 0b0001,
+        Untrusted = 0b0010,
+        Trusted = 0b0100,
+        TrustedByKernel = 0b1000,
+        FullTrust = Trusted | TrustedByKernel
+    };
+
+    class Security
+    {
+    private:
+        struct TokenData
+        {
+            Token token;
+            int TrustLevel;
+            uint64_t OwnerID;
+            bool Process;
+        };
+
+        std::vector<TokenData> Tokens;
+
+    public:
+        Token CreateToken();
+        bool TrustToken(Token token, TTL TrustLevel);
+        bool AddTrustLevel(Token token, TTL TrustLevel);
+        bool RemoveTrustLevel(Token token, TTL TrustLevel);
+        bool UntrustToken(Token token);
+        bool DestroyToken(Token token);
+        bool IsTokenTrusted(Token token, TTL TrustLevel);
+        bool IsTokenTrusted(Token token, int TrustLevel);
+        int GetTokenTrustLevel(Token token);
+        Security();
+        ~Security();
+    };
+
+    class Task : public Interrupts::Handler
+    {
+    private:
+        Security SecurityManager;
+        UPID NextPID = 0;
+        UTID NextTID = 0;
+
+        std::vector<PCB *> ProcessList;
+        PCB *IdleProcess = nullptr;
+        TCB *IdleThread = nullptr;
+        TCB *CleanupThread = nullptr;
+        std::atomic_uint64_t SchedulerTicks = 0;
+        std::atomic_uint64_t LastTaskTicks = 0;
+        bool StopScheduler = false;
+        bool InvalidPCB(PCB *pcb);
+        bool InvalidTCB(TCB *tcb);
+
+        void RemoveThread(TCB *tcb);
+        void RemoveProcess(PCB *pcb);
+
+        void UpdateUsage(TaskInfo *Info, TaskSecurity *Security, int Core);
+
+        bool FindNewProcess(void *CPUDataPointer);
+        bool GetNextAvailableThread(void *CPUDataPointer);
+        bool GetNextAvailableProcess(void *CPUDataPointer);
+        bool SchedulerSearchProcessThread(void *CPUDataPointer);
+        void UpdateProcessStatus();
+        void WakeUpThreads();
+
+#if defined(a64)
+        void Schedule(CPU::x64::TrapFrame *Frame);
+        void OnInterruptReceived(CPU::x64::TrapFrame *Frame);
+#elif defined(a32)
+        void Schedule(void *Frame);
+        void OnInterruptReceived(CPU::x32::TrapFrame *Frame);
+#elif defined(aa64)
+        void Schedule(CPU::aarch64::TrapFrame *Frame);
+        void OnInterruptReceived(CPU::aarch64::TrapFrame *Frame);
+#endif
+
+    public:
+        void SetCleanupThread(TCB *Thread) { CleanupThread = Thread; }
+        uint64_t GetSchedulerTicks() { return SchedulerTicks.load(); }
+        uint64_t GetLastTaskTicks() { return LastTaskTicks.load(); }
+        std::vector<PCB *> GetProcessList() { return ProcessList; }
+        Security *GetSecurityManager() { return &SecurityManager; }
+        void CleanupProcessesThread();
+        void Panic() { StopScheduler = true; }
+        void Schedule();
+        void SignalShutdown();
+        void RevertProcessCreation(PCB *Process);
+        void RevertThreadCreation(TCB *Thread);
+
+        void KillThread(TCB *tcb, int Code)
+        {
+            tcb->Status = TaskStatus::Terminated;
+            tcb->ExitCode = Code;
+        }
+
+        void KillProcess(PCB *pcb, int Code)
+        {
+            pcb->Status = TaskStatus::Terminated;
+            pcb->ExitCode = Code;
+        }
+
+        /**
+         * @brief Get the Current Process object
+         * @return PCB*
+         */
+        PCB *GetCurrentProcess();
+
+        /**
+         * @brief Get the Current Thread object
+         * @return TCB*
+         */
+        TCB *GetCurrentThread();
+
+        PCB *GetProcessByID(UPID ID);
+
+        TCB *GetThreadByID(UTID ID);
+
+        /** @brief Wait for process to terminate */
+        void WaitForProcess(PCB *pcb);
+
+        /** @brief Wait for thread to terminate */
+        void WaitForThread(TCB *tcb);
+
+        void WaitForProcessStatus(PCB *pcb, TaskStatus Status);
+        void WaitForThreadStatus(TCB *tcb, TaskStatus Status);
+
+        /**
+         * @brief Sleep for a given amount of milliseconds
+         *
+         * @param Milliseconds Amount of milliseconds to sleep
+         */
+        void Sleep(uint64_t Milliseconds);
+
+        PCB *CreateProcess(PCB *Parent,
+                           const char *Name,
+                           TaskTrustLevel TrustLevel,
+                           void *Image = nullptr,
+                           bool DoNotCreatePageTable = false);
+
+        TCB *CreateThread(PCB *Parent,
+                          IP EntryPoint,
+                          const char **argv = nullptr,
+                          const char **envp = nullptr,
+                          const std::vector<AuxiliaryVector> &auxv = std::vector<AuxiliaryVector>(),
+                          IPOffset Offset = 0,
+                          TaskArchitecture Architecture = TaskArchitecture::x64,
+                          TaskCompatibility Compatibility = TaskCompatibility::Native);
+
+        Task(const IP EntryPoint);
+        ~Task();
+    };
+}
+
+#define PEXIT(Code) TaskManager->GetCurrentProcess()->ExitCode = Code
+#define TEXIT(Code) TaskManager->GetCurrentThread()->ExitCode = Code
+
+extern "C" void TaskingScheduler_OneShot(int TimeSlice);
+
+#endif // !__FENNIX_KERNEL_TASKING_H__
diff --git a/Kernel/include/time.hpp b/Kernel/include/time.hpp
new file mode 100644
index 00000000..da06ee55
--- /dev/null
+++ b/Kernel/include/time.hpp
@@ -0,0 +1,202 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_TIME_H__
+#define __FENNIX_KERNEL_TIME_H__
+
+#include <types.h>
+#include <debug.h>
+
+namespace Time
+{
+    struct Clock
+    {
+        int Year, Month, Day, Hour, Minute, Second;
+        uint64_t Counter;
+    };
+
+    Clock ReadClock();
+    Clock ConvertFromUnix(int Timestamp);
+
+    enum Units
+    {
+        Femtoseconds,
+        Picoseconds,
+        Nanoseconds,
+        Microseconds,
+        Milliseconds,
+        Seconds,
+        Minutes,
+        Hours,
+        Days,
+        Months,
+        Years
+    };
+
+    class HighPrecisionEventTimer
+    {
+    private:
+        struct HPET
+        {
+            uint64_t GeneralCapabilities;
+            uint64_t Reserved0;
+            uint64_t GeneralConfiguration;
+            uint64_t Reserved1;
+            uint64_t GeneralIntStatus;
+            uint64_t Reserved2;
+            uint64_t Reserved3[24];
+            uint64_t MainCounterValue;
+            uint64_t Reserved4;
+        };
+
+        uint32_t clk = 0;
+        HPET *hpet = nullptr;
+        uint64_t ClassCreationTime = 0;
+
+        inline uint64_t ConvertUnit(Units Unit)
+        {
+            switch (Unit)
+            {
+            case Femtoseconds:
+                return 1;
+            case Picoseconds:
+                return 1000;
+            case Nanoseconds:
+                return 1000000;
+            case Microseconds:
+                return 1000000000;
+            case Milliseconds:
+                return 1000000000000;
+            case Seconds:
+                return 1000000000000000;
+            case Minutes:
+                return 1000000000000000000;
+            // case Hours:
+            //     return 1000000000000000000000;
+            // case Days:
+            //     return 1000000000000000000000000;
+            // case Months:
+            //     return 1000000000000000000000000000;
+            // case Years:
+            //     return 1000000000000000000000000000000;
+            default:
+                error("Invalid time unit %d", Unit);
+                return 1;
+            }
+        }
+
+    public:
+        bool Sleep(uint64_t Duration, Units Unit);
+        uint64_t GetCounter();
+        uint64_t CalculateTarget(uint64_t Target, Units Unit);
+        uint64_t GetNanosecondsSinceClassCreation();
+
+        HighPrecisionEventTimer(void *hpet);
+        ~HighPrecisionEventTimer();
+    };
+
+    class TimeStampCounter
+    {
+    private:
+        uint64_t clk = 0;
+        uint64_t ClassCreationTime = 0;
+
+        inline uint64_t ConvertUnit(Units Unit)
+        {
+            switch (Unit)
+            {
+            case Femtoseconds:
+                return 1;
+            case Picoseconds:
+                return 1000;
+            case Nanoseconds:
+                return 1000000;
+            case Microseconds:
+                return 1000000000;
+            case Milliseconds:
+                return 1000000000000;
+            case Seconds:
+                return 1000000000000000;
+            case Minutes:
+                return 1000000000000000000;
+            // case Hours:
+            //     return 1000000000000000000000;
+            // case Days:
+            //     return 1000000000000000000000000;
+            // case Months:
+            //     return 1000000000000000000000000000;
+            // case Years:
+            //     return 1000000000000000000000000000000;
+            default:
+                error("Invalid time unit %d", Unit);
+                return 1;
+            }
+        }
+
+    public:
+        bool Sleep(uint64_t Duration, Units Unit);
+        uint64_t GetCounter();
+        uint64_t CalculateTarget(uint64_t Target, Units Unit);
+        uint64_t GetNanosecondsSinceClassCreation();
+
+        TimeStampCounter();
+        ~TimeStampCounter();
+    };
+
+    class time
+    {
+    public:
+        enum TimeActiveTimer
+        {
+            NONE = 0b0,
+            RTC = 0b1,
+            PIT = 0b10,
+            HPET = 0b100,
+            ACPI = 0b1000,
+            APIC = 0b10000,
+            TSC = 0b100000
+        };
+
+    private:
+        int SupportedTimers = 0;
+        TimeActiveTimer ActiveTimer = NONE;
+
+        HighPrecisionEventTimer *hpet;
+        TimeStampCounter *tsc;
+
+    public:
+        int GetSupportedTimers() { return SupportedTimers; }
+        TimeActiveTimer GetActiveTimer() { return ActiveTimer; }
+        bool ChangeActiveTimer(TimeActiveTimer Timer)
+        {
+            if (!(SupportedTimers & Timer))
+                return false;
+            ActiveTimer = Timer;
+            return true;
+        }
+
+        bool Sleep(uint64_t Duration, Units Unit);
+        uint64_t GetCounter();
+        uint64_t CalculateTarget(uint64_t Target, Units Unit);
+        uint64_t GetNanosecondsSinceClassCreation();
+        void FindTimers(void *acpi);
+        time();
+        ~time();
+    };
+}
+ 
+#endif // !__FENNIX_KERNEL_TIME_H__
diff --git a/Kernel/include/types.h b/Kernel/include/types.h
new file mode 100644
index 00000000..2ef2f124
--- /dev/null
+++ b/Kernel/include/types.h
@@ -0,0 +1,372 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_TYPES_H__
+#define __FENNIX_KERNEL_TYPES_H__
+
+#ifdef __cplusplus
+#define EXTERNC extern "C"
+#define START_EXTERNC \
+    EXTERNC           \
+    {
+#define END_EXTERNC \
+    }
+#else // __cplusplus
+#define EXTERNC
+#define START_EXTERNC
+#define END_EXTERNC
+#endif // __cplusplus
+
+#ifdef __cplusplus
+#define NULL 0
+#else // __cplusplus
+#define NULL ((void *)0)
+#define bool _Bool
+#endif // __cplusplus
+
+#define asm __asm__
+#define asmv __asm__ volatile
+
+#define true 1
+#define false 0
+
+#define inf_loop while (1)
+#define ilp inf_loop; /* Used for debugging */
+
+#ifdef __cplusplus
+#define foreach for
+#define in :
+
+#define r_cst(t, v) reinterpret_cast<t>(v)
+#define c_cst(t, v) const_cast<t>(v)
+#define s_cst(t, v) static_cast<t>(v)
+#define d_cst(t, v) dynamic_cast<t>(v)
+#endif // __cplusplus
+
+#define UNUSED(x) (void)(x)
+#define CONCAT(x, y) x##y
+
+#ifndef __cplusplus /* This conflicts with std */
+#define toupper(c) ((c)-0x20 * (((c) >= 'a') && ((c) <= 'z')))
+#define tolower(c) ((c) + 0x20 * (((c) >= 'A') && ((c) <= 'Z')))
+#endif
+
+#ifndef __va_list__
+typedef __builtin_va_list va_list;
+#endif
+
+#define va_start(v, l) __builtin_va_start(v, l)
+#define va_end(v) __builtin_va_end(v)
+#define va_arg(v, l) __builtin_va_arg(v, l)
+
+#define ALIGN_UP(x, align) ((__typeof__(x))(((uintptr_t)(x) + ((align)-1)) & (~((align)-1))))
+#define ALIGN_DOWN(x, align) ((__typeof__(x))((x) & (~((align)-1))))
+
+#define offsetof(type, member) __builtin_offsetof(type, member)
+
+#define MIN(a, b) (((a) < (b)) ? (a) : (b))
+#define MAX(a, b) (((a) > (b)) ? (a) : (b))
+
+#define VPOKE(type, address) (*((volatile type *)(address)))
+#define POKE(type, address) (*((type *)(address)))
+
+#ifndef __cplusplus
+
+#ifdef __STDC__
+#ifdef __STDC_VERSION__
+#if (__STDC_VERSION__ >= 201710L)
+#define C_LANGUAGE_STANDARD 2018
+#elif (__STDC_VERSION__ >= 201112L)
+#define C_LANGUAGE_STANDARD 2011
+#elif (__STDC_VERSION__ >= 199901L)
+#define C_LANGUAGE_STANDARD 1999
+#elif (__STDC_VERSION__ >= 199409L)
+#define C_LANGUAGE_STANDARD 1995
+#endif
+#else
+#define C_LANGUAGE_STANDARD 1990
+#endif
+#else
+#define C_LANGUAGE_STANDARD 1972
+#endif
+
+#else
+
+#ifdef __STDC__
+#ifdef __cplusplus
+#if (__cplusplus >= 202100L)
+#define CPP_LANGUAGE_STANDARD 2023
+#elif (__cplusplus >= 202002L)
+#define CPP_LANGUAGE_STANDARD 2020
+#elif (__cplusplus >= 201703L)
+#define CPP_LANGUAGE_STANDARD 2017
+#elif (__cplusplus >= 201402L)
+#define CPP_LANGUAGE_STANDARD 2014
+#elif (__cplusplus >= 201103L)
+#define CPP_LANGUAGE_STANDARD 2011
+#elif (__cplusplus >= 199711L)
+#define CPP_LANGUAGE_STANDARD 1998
+#endif
+#else
+#define CPP_LANGUAGE_STANDARD __cplusplus
+#endif
+#else
+#define CPP_LANGUAGE_STANDARD __cplusplus
+#endif
+
+#endif // __cplusplus
+
+#ifndef __SIG_ATOMIC_TYPE__
+#define __SIG_ATOMIC_TYPE__ int
+#endif
+
+typedef __INT8_TYPE__ int8_t;
+typedef __INT16_TYPE__ int16_t;
+typedef __INT32_TYPE__ int32_t;
+typedef __INT64_TYPE__ int64_t;
+
+typedef __UINT8_TYPE__ uint8_t;
+typedef __UINT16_TYPE__ uint16_t;
+typedef __UINT32_TYPE__ uint32_t;
+typedef __UINT64_TYPE__ uint64_t;
+
+typedef __INT_LEAST8_TYPE__ int_least8_t;
+typedef __INT_LEAST16_TYPE__ int_least16_t;
+typedef __INT_LEAST32_TYPE__ int_least32_t;
+typedef __INT_LEAST64_TYPE__ int_least64_t;
+
+typedef __UINT_LEAST8_TYPE__ uint_least8_t;
+typedef __UINT_LEAST16_TYPE__ uint_least16_t;
+typedef __UINT_LEAST32_TYPE__ uint_least32_t;
+typedef __UINT_LEAST64_TYPE__ uint_least64_t;
+
+typedef __INT_FAST8_TYPE__ int_fast8_t;
+typedef __INT_FAST16_TYPE__ int_fast16_t;
+typedef __INT_FAST32_TYPE__ int_fast32_t;
+typedef __INT_FAST64_TYPE__ int_fast64_t;
+
+typedef __UINT_FAST8_TYPE__ uint_fast8_t;
+typedef __UINT_FAST16_TYPE__ uint_fast16_t;
+typedef __UINT_FAST32_TYPE__ uint_fast32_t;
+typedef __UINT_FAST64_TYPE__ uint_fast64_t;
+
+typedef __INTPTR_TYPE__ intptr_t;
+typedef __UINTPTR_TYPE__ uintptr_t;
+
+typedef __INTMAX_TYPE__ intmax_t;
+typedef __UINTMAX_TYPE__ uintmax_t;
+
+typedef __PTRDIFF_TYPE__ ptrdiff_t;
+typedef __SIZE_TYPE__ size_t;
+#ifndef __cplusplus
+typedef __WCHAR_TYPE__ wchar_t;
+#endif
+typedef __WINT_TYPE__ wint_t;
+typedef __SIG_ATOMIC_TYPE__ sig_atomic_t;
+// TODO: ssize_t
+typedef intptr_t ssize_t;
+
+#define INT8_MAX __INT8_MAX__
+#define INT8_MIN (-INT8_MAX - 1)
+#define UINT8_MAX __UINT8_MAX__
+#define INT16_MAX __INT16_MAX__
+#define INT16_MIN (-INT16_MAX - 1)
+#define UINT16_MAX __UINT16_MAX__
+#define INT32_MAX __INT32_MAX__
+#define INT32_MIN (-INT32_MAX - 1)
+#define UINT32_MAX __UINT32_MAX__
+#define INT64_MAX __INT64_MAX__
+#define INT64_MIN (-INT64_MAX - 1)
+#define UINT64_MAX __UINT64_MAX__
+
+#define INT_LEAST8_MAX __INT_LEAST8_MAX__
+#define INT_LEAST8_MIN (-INT_LEAST8_MAX - 1)
+#define UINT_LEAST8_MAX __UINT_LEAST8_MAX__
+#define INT_LEAST16_MAX __INT_LEAST16_MAX__
+#define INT_LEAST16_MIN (-INT_LEAST16_MAX - 1)
+#define UINT_LEAST16_MAX __UINT_LEAST16_MAX__
+#define INT_LEAST32_MAX __INT_LEAST32_MAX__
+#define INT_LEAST32_MIN (-INT_LEAST32_MAX - 1)
+#define UINT_LEAST32_MAX __UINT_LEAST32_MAX__
+#define INT_LEAST64_MAX __INT_LEAST64_MAX__
+#define INT_LEAST64_MIN (-INT_LEAST64_MAX - 1)
+#define UINT_LEAST64_MAX __UINT_LEAST64_MAX__
+
+#define INT_FAST8_MAX __INT_FAST8_MAX__
+#define INT_FAST8_MIN (-INT_FAST8_MAX - 1)
+#define UINT_FAST8_MAX __UINT_FAST8_MAX__
+#define INT_FAST16_MAX __INT_FAST16_MAX__
+#define INT_FAST16_MIN (-INT_FAST16_MAX - 1)
+#define UINT_FAST16_MAX __UINT_FAST16_MAX__
+#define INT_FAST32_MAX __INT_FAST32_MAX__
+#define INT_FAST32_MIN (-INT_FAST32_MAX - 1)
+#define UINT_FAST32_MAX __UINT_FAST32_MAX__
+#define INT_FAST64_MAX __INT_FAST64_MAX__
+#define INT_FAST64_MIN (-INT_FAST64_MAX - 1)
+#define UINT_FAST64_MAX __UINT_FAST64_MAX__
+
+#define INTPTR_MAX __INTPTR_MAX__
+#define INTPTR_MIN (-INTPTR_MAX - 1)
+#define UINTPTR_MAX __UINTPTR_MAX__
+
+#define INTMAX_MAX __INTMAX_MAX__
+#define INTMAX_MIN (-INTMAX_MAX - 1)
+#define UINTMAX_MAX __UINTMAX_MAX__
+
+#define PTRDIFF_MAX __PTRDIFF_MAX__
+#define PTRDIFF_MIN (-PTRDIFF_MAX - 1)
+
+#define SIG_ATOMIC_MAX __SIG_ATOMIC_MAX__
+#define SIG_ATOMIC_MIN __SIG_ATOMIC_MIN__
+
+#define SIZE_MAX __SIZE_MAX__
+
+#define WCHAR_MAX __WCHAR_MAX__
+#define WCHAR_MIN __WCHAR_MIN__
+
+#define WINT_MAX __WINT_MAX__
+#define WINT_MIN __WINT_MIN__
+
+#if defined(a64)
+#define BREAK __asm__ __volatile__("int $0x3" \
+                                   :          \
+                                   :          \
+                                   : "memory");
+#elif defined(a32)
+#define BREAK __asm__ __volatile__("int $0x3" \
+                                   :          \
+                                   :          \
+                                   : "memory");
+#elif defined(aa64)
+#define BREAK __asm__ __volatile__("brk #0" \
+                                   :        \
+                                   :        \
+                                   : "memory");
+#endif
+
+#ifdef __INT48_TYPE__
+typedef __INT48_TYPE__ int48_t;
+typedef __UINT48_TYPE__ uint48_t;
+typedef int48_t int_least48_t;
+typedef uint48_t uint_least48_t;
+typedef int48_t int_fast48_t;
+typedef uint48_t uint_fast48_t;
+#else  // __INT48_TYPE__
+typedef __INT64_TYPE__ int48_t;
+typedef __UINT64_TYPE__ uint48_t;
+typedef int48_t int_least48_t;
+typedef uint48_t uint_least48_t;
+typedef int48_t int_fast48_t;
+typedef uint48_t uint_fast48_t;
+#endif // __INT48_TYPE__
+
+#define b4(x) ((x & 0x0F) << 4 | (x & 0xF0) >> 4)
+#define b8(x) ((x)&0xFF)
+#define b16(x) __builtin_bswap16(x)
+#define b32(x) __builtin_bswap32(x)
+#define b48(x) (((((x)&0x0000000000ff) << 40) | \
+                 (((x)&0x00000000ff00) << 24) | \
+                 (((x)&0x000000ff0000) << 8) |  \
+                 (((x)&0x0000ff000000) >> 8) |  \
+                 (((x)&0x00ff00000000) >> 24) | \
+                 (((x)&0xff0000000000) >> 40)))
+#define b64(x) __builtin_bswap64(x)
+
+/* https://gcc.gnu.org/onlinedocs/gcc-9.5.0/gnat_ugn/Optimization-Levels.html */
+
+/** @brief No optimization (the default); generates unoptimized code but has the fastest compilation time. */
+#define O0 __attribute__((optimize("O0")))
+/** @brief Moderate optimization; optimizes reasonably well but does not degrade compilation time significantly. */
+#define O1 __attribute__((optimize("O1")))
+/** @brief Full optimization; generates highly optimized code and has the slowest compilation time. */
+#define O2 __attribute__((optimize("O2")))
+/** @brief Full optimization as in -O2; also uses more aggressive automatic inlining of subprograms within a unit (Inlining of Subprograms) and attempts to vectorize loops. */
+#define O3 __attribute__((optimize("O3")))
+/** @brief Optimize space usage (code and data) of resulting program. */
+#define Os __attribute__((optimize("Os")))
+/** @brief Disregard strict standards compliance. -Ofast enables all -O3 optimizations. It also enables optimizations that are not valid for all standard-compliant programs. */
+#define Ofast __attribute__((optimize("Ofast")))
+
+#define __unused __attribute__((unused))
+#define __packed __attribute__((packed))
+#define __naked __attribute__((naked))
+#define __aligned(x) __attribute__((aligned(x)))
+#define __section(x) __attribute__((section(x)))
+#define __noreturn __attribute__((noreturn))
+#define __weak __attribute__((weak))
+#define __alias(x) __attribute__((alias(x)))
+#define __always_inline __attribute__((always_inline))
+#define __noinline __attribute__((noinline))
+#define __pure __attribute__((pure))
+#define __const __attribute__((const))
+#define __malloc __attribute__((malloc))
+#define __returns_twice __attribute__((returns_twice))
+#define __used __attribute__((used))
+#define __deprecated __attribute__((deprecated))
+#define __deprecated_msg(x) __attribute__((deprecated(x)))
+#define __weakref(x) __attribute__((weakref(x)))
+#define __weakrefalias(x) __attribute__((weakref(#x)))
+#define __visibility(x) __attribute__((visibility(x)))
+#define __constructor __attribute__((constructor))
+#define __destructor __attribute__((destructor))
+#define __cleanup(x) __attribute__((cleanup(x)))
+#define __fallthrough __attribute__((fallthrough))
+#define __nonnull(x) __attribute__((nonnull x))
+#define __nonnull_all __attribute__((nonnull))
+#define __returns_nonnull __attribute__((returns_nonnull))
+#define __sentinel __attribute__((sentinel))
+#define __sentinel_all __attribute__((sentinel(0)))
+#define __format(x, y, z) __attribute__((format(x, y, z)))
+#define __format_arg(x) __attribute__((format_arg(x)))
+#define __nonnull_params(x) __attribute__((nonnull x))
+#define __nonnull_all __attribute__((nonnull))
+#define __warn_unused_result __attribute__((warn_unused_result))
+#define __no_stack_protector __attribute__((no_stack_protector))
+#define __no_instrument_function __attribute__((no_instrument_function))
+#define __no_debug __attribute__((no_debug))
+#define __target(x) __attribute__((target(x)))
+#define __min_vector_width(x) __attribute__((min_vector_width(x)))
+
+// sanitizer
+#define __no_sanitize_address __attribute__((no_sanitize_address))
+#define __no_sanitize_undefined __attribute__((no_sanitize_undefined))
+#define __no_address_safety_analysis __attribute__((no_address_safety_analysis))
+#define __no_sanitize_thread __attribute__((no_sanitize_thread))
+
+#define __synchronize __sync_synchronize()
+#define __sync __synchronize
+
+#define likely(x) __builtin_expect(!!(x), 1)
+#define unlikely(x) __builtin_expect(!!(x), 0)
+
+#define SafeFunction __no_stack_protector __no_sanitize_address __no_sanitize_undefined __no_address_safety_analysis __no_sanitize_thread
+
+#define NIF __no_instrument_function
+
+#define int1                        \
+    __asm__ __volatile__("int $0x1" \
+                         :          \
+                         :          \
+                         : "memory")
+
+#define int3                    \
+    __asm__ __volatile__("int3" \
+                         :      \
+                         :      \
+                         : "memory")
+
+#endif // !__FENNIX_KERNEL_TYPES_H__
diff --git a/Kernel/include/uart.hpp b/Kernel/include/uart.hpp
new file mode 100644
index 00000000..5648c516
--- /dev/null
+++ b/Kernel/include/uart.hpp
@@ -0,0 +1,88 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_UART_H__
+#define __FENNIX_KERNEL_UART_H__
+
+#include <types.h>
+
+namespace UniversalAsynchronousReceiverTransmitter
+{
+    /**
+     * @brief Serial ports. (if available)
+     */
+    enum SerialPorts
+    {
+        COMNULL = 0,
+        COM1 = 0x3F8,
+        COM2 = 0x2F8,
+        COM3 = 0x3E8,
+        COM4 = 0x2E8,
+        COM5 = 0x5F8,
+        COM6 = 0x4F8,
+        COM7 = 0x5E8,
+        COM8 = 0x4E8
+    };
+
+    class UART
+    {
+    private:
+        SerialPorts Port;
+
+    public:
+        UART(SerialPorts Port = COMNULL);
+        ~UART();
+        void Write(uint8_t Char);
+        uint8_t Read();
+    };
+
+    class Events
+    {
+    private:
+        SerialPorts Port;
+
+    protected:
+        /**
+         * @brief UART events.
+         * @param Port if none, all ports are registered for events.
+         */
+        Events(SerialPorts Port = COMNULL);
+        ~Events();
+
+    public:
+        /**
+         * @brief Get the Registered Port object
+         * @return SerialPorts
+         */
+        SafeFunction NIF SerialPorts GetRegisteredPort() { return this->Port; }
+
+        /**
+         * @brief Called when a character is sent.
+         * @param Char the sent character.
+         */
+
+        virtual void OnSent(uint8_t Char) { UNUSED(Char); }
+        /**
+         * @brief Called when a character is received.
+         * @param Char the received character.
+         */
+        virtual void OnReceived(uint8_t Char) { UNUSED(Char); }
+    };
+
+}
+
+#endif // !__FENNIX_KERNEL_UART_H__
diff --git a/Kernel/include_std/assert.h b/Kernel/include_std/assert.h
new file mode 100644
index 00000000..e5c2ecc3
--- /dev/null
+++ b/Kernel/include_std/assert.h
@@ -0,0 +1,50 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_ASSERT_H__
+#define __FENNIX_KERNEL_ASSERT_H__
+
+#include <debug.h>
+
+#define assert(x)                                                                                                    \
+    do                                                                                                               \
+    {                                                                                                                \
+        if (!(x))                                                                                                    \
+        {                                                                                                            \
+            void *CallerAddress = __builtin_extract_return_addr(__builtin_return_address(0));                        \
+            error("Assertion failed! [%s] [%#lx => %s:%s:%d]", #x, CallerAddress, __FILE__, __FUNCTION__, __LINE__); \
+            while (1)                                                                                                \
+                ;                                                                                                    \
+        }                                                                                                            \
+    } while (0)
+
+#define assert_allow_continue(x)                                                                                     \
+    do                                                                                                               \
+    {                                                                                                                \
+        if (!(x))                                                                                                    \
+        {                                                                                                            \
+            void *CallerAddress = __builtin_extract_return_addr(__builtin_return_address(0));                        \
+            error("Assertion failed! [%s] [%#lx => %s:%s:%d]", #x, CallerAddress, __FILE__, __FUNCTION__, __LINE__); \
+        }                                                                                                            \
+    } while (0)
+
+#define static_assert(x) \
+    switch (x)           \
+    case 0:              \
+    case (x):
+
+#endif // !__FENNIX_KERNEL_ASSERT_H__
diff --git a/Kernel/include_std/atomic b/Kernel/include_std/atomic
new file mode 100644
index 00000000..47ebc290
--- /dev/null
+++ b/Kernel/include_std/atomic
@@ -0,0 +1,19 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <std/atomic.hpp>
diff --git a/Kernel/include_std/cstddef b/Kernel/include_std/cstddef
new file mode 100644
index 00000000..bbfa92b3
--- /dev/null
+++ b/Kernel/include_std/cstddef
@@ -0,0 +1,24 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+
+namespace std
+{
+    typedef unsigned long size_t;
+    typedef long ptrdiff_t;
+}
diff --git a/Kernel/include_std/cstring b/Kernel/include_std/cstring
new file mode 100644
index 00000000..b1a7f207
--- /dev/null
+++ b/Kernel/include_std/cstring
@@ -0,0 +1,19 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <convert.h>
diff --git a/Kernel/include_std/dlfcn.h b/Kernel/include_std/dlfcn.h
new file mode 100644
index 00000000..3c5095c7
--- /dev/null
+++ b/Kernel/include_std/dlfcn.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _DLFCN_H
+#define _DLFCN_H
+
+#endif // !_DLFCN_H
diff --git a/Kernel/include_std/errno.h b/Kernel/include_std/errno.h
new file mode 100644
index 00000000..17e1aad5
--- /dev/null
+++ b/Kernel/include_std/errno.h
@@ -0,0 +1,59 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _ERRNO_H
+#define _ERRNO_H
+
+#define EPERM 1    /* Operation not permitted */
+#define ENOENT 2   /* No such file or directory */
+#define ESRCH 3    /* No such process */
+#define EINTR 4    /* Interrupted system call */
+#define EIO 5      /* I/O error */
+#define ENXIO 6    /* No such device or address */
+#define E2BIG 7    /* Argument list too long */
+#define ENOEXEC 8  /* Exec format error */
+#define EBADF 9    /* Bad file number */
+#define ECHILD 10  /* No child processes */
+#define EAGAIN 11  /* Try again */
+#define ENOMEM 12  /* Out of memory */
+#define EACCES 13  /* Permission denied */
+#define EFAULT 14  /* Bad address */
+#define ENOTBLK 15 /* Block device required */
+#define EBUSY 16   /* Device or resource busy */
+#define EEXIST 17  /* File exists */
+#define EXDEV 18   /* Cross-device link */
+#define ENODEV 19  /* No such device */
+#define ENOTDIR 20 /* Not a directory */
+#define EISDIR 21  /* Is a directory */
+#define EINVAL 22  /* Invalid argument */
+#define ENFILE 23  /* File table overflow */
+#define EMFILE 24  /* Too many open files */
+#define ENOTTY 25  /* Not a typewriter */
+#define ETXTBSY 26 /* Text file busy */
+#define EFBIG 27   /* File too large */
+#define ENOSPC 28  /* No space left on device */
+#define ESPIPE 29  /* Illegal seek */
+#define EROFS 30   /* Read-only file system */
+#define EMLINK 31  /* Too many links */
+#define EPIPE 32   /* Broken pipe */
+#define EDOM 33    /* Math argument out of domain of func */
+#define ERANGE 34  /* Math result not representable */
+
+extern int *__errno_location(void) __attribute__((const));
+#define errno (*__errno_location())
+
+#endif // !_ERRNO_H
diff --git a/Kernel/include_std/limits.h b/Kernel/include_std/limits.h
new file mode 100644
index 00000000..7d61f6af
--- /dev/null
+++ b/Kernel/include_std/limits.h
@@ -0,0 +1,136 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_LIMITS_H__
+#define __FENNIX_KERNEL_LIMITS_H__
+
+#undef CHAR_BIT
+#define CHAR_BIT __CHAR_BIT__
+
+#ifndef MB_LEN_MAX
+#define MB_LEN_MAX 1
+#endif
+
+#undef SCHAR_MIN
+#define SCHAR_MIN (-SCHAR_MAX - 1)
+#undef SCHAR_MAX
+#define SCHAR_MAX __SCHAR_MAX__
+
+#undef UCHAR_MAX
+#if __SCHAR_MAX__ == __INT_MAX__
+#define UCHAR_MAX (SCHAR_MAX * 2U + 1U)
+#else
+#define UCHAR_MAX (SCHAR_MAX * 2 + 1)
+#endif
+
+#ifdef __CHAR_UNSIGNED__
+#undef CHAR_MIN
+#if __SCHAR_MAX__ == __INT_MAX__
+#define CHAR_MIN 0U
+#else
+#define CHAR_MIN 0
+#endif
+#undef CHAR_MAX
+#define CHAR_MAX UCHAR_MAX
+#else
+#undef CHAR_MIN
+#define CHAR_MIN SCHAR_MIN
+#undef CHAR_MAX
+#define CHAR_MAX SCHAR_MAX
+#endif
+
+#undef SHRT_MIN
+#define SHRT_MIN (-SHRT_MAX - 1)
+#undef SHRT_MAX
+#define SHRT_MAX __SHRT_MAX__
+
+#undef USHRT_MAX
+#if __SHRT_MAX__ == __INT_MAX__
+#define USHRT_MAX (SHRT_MAX * 2U + 1U)
+#else
+#define USHRT_MAX (SHRT_MAX * 2 + 1)
+#endif
+
+#undef INT_MIN
+#define INT_MIN (-INT_MAX - 1)
+#undef INT_MAX
+#define INT_MAX __INT_MAX__
+
+#undef UINT_MAX
+#define UINT_MAX (INT_MAX * 2U + 1U)
+
+#undef LONG_MIN
+#define LONG_MIN (-LONG_MAX - 1L)
+#undef LONG_MAX
+#define LONG_MAX __LONG_MAX__
+
+#undef ULONG_MAX
+#define ULONG_MAX (LONG_MAX * 2UL + 1UL)
+
+#if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+#undef LLONG_MIN
+#define LLONG_MIN (-LLONG_MAX - 1LL)
+#undef LLONG_MAX
+#define LLONG_MAX __LONG_LONG_MAX__
+
+#undef ULLONG_MAX
+#define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
+#endif
+
+#if defined(__GNU_LIBRARY__) ? defined(__USE_GNU) : !defined(__STRICT_ANSI__)
+#undef LONG_LONG_MIN
+#define LONG_LONG_MIN (-LONG_LONG_MAX - 1LL)
+#undef LONG_LONG_MAX
+#define LONG_LONG_MAX __LONG_LONG_MAX__
+
+#undef ULONG_LONG_MAX
+#define ULONG_LONG_MAX (LONG_LONG_MAX * 2ULL + 1ULL)
+#endif
+
+#if (defined __STDC_WANT_IEC_60559_BFP_EXT__ || (defined(__STDC_VERSION__) && __STDC_VERSION__ > 201710L))
+#undef CHAR_WIDTH
+#define CHAR_WIDTH __SCHAR_WIDTH__
+#undef SCHAR_WIDTH
+#define SCHAR_WIDTH __SCHAR_WIDTH__
+#undef UCHAR_WIDTH
+#define UCHAR_WIDTH __SCHAR_WIDTH__
+#undef SHRT_WIDTH
+#define SHRT_WIDTH __SHRT_WIDTH__
+#undef USHRT_WIDTH
+#define USHRT_WIDTH __SHRT_WIDTH__
+#undef INT_WIDTH
+#define INT_WIDTH __INT_WIDTH__
+#undef UINT_WIDTH
+#define UINT_WIDTH __INT_WIDTH__
+#undef LONG_WIDTH
+#define LONG_WIDTH __LONG_WIDTH__
+#undef ULONG_WIDTH
+#define ULONG_WIDTH __LONG_WIDTH__
+#undef LLONG_WIDTH
+#define LLONG_WIDTH __LONG_LONG_WIDTH__
+#undef ULLONG_WIDTH
+#define ULLONG_WIDTH __LONG_LONG_WIDTH__
+#endif
+
+#if defined(__STDC_VERSION__) && __STDC_VERSION__ > 201710L
+#undef BOOL_MAX
+#define BOOL_MAX 1
+#undef BOOL_WIDTH
+#define BOOL_WIDTH 1
+#endif
+
+#endif // !__FENNIX_KERNEL_LIMITS_H__
diff --git a/Kernel/include_std/math.h b/Kernel/include_std/math.h
new file mode 100644
index 00000000..18252dfc
--- /dev/null
+++ b/Kernel/include_std/math.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _MATH_H
+#define _MATH_H
+
+#endif // !_MATH_H
diff --git a/Kernel/include_std/pthread.h b/Kernel/include_std/pthread.h
new file mode 100644
index 00000000..aec2bc32
--- /dev/null
+++ b/Kernel/include_std/pthread.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _PTHREAD_H
+#define _PTHREAD_H
+
+#endif // !_PTHREAD_H
diff --git a/Kernel/include_std/sched.h b/Kernel/include_std/sched.h
new file mode 100644
index 00000000..56bc215b
--- /dev/null
+++ b/Kernel/include_std/sched.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _SCHED_H
+#define _SCHED_H
+
+#endif // !_SCHED_H
diff --git a/Kernel/include_std/std.hpp b/Kernel/include_std/std.hpp
new file mode 100644
index 00000000..1b016081
--- /dev/null
+++ b/Kernel/include_std/std.hpp
@@ -0,0 +1,77 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+/* This function includes all the standard headers and defines some useful macros.
+ * Note: This std implementation is not complete.
+ */
+#ifndef __FENNIX_KERNEL_STD_H__
+#define __FENNIX_KERNEL_STD_H__
+
+#include <types.h>
+#include <std/atomic.hpp>
+#include <std/functional.hpp>
+#include <std/list.hpp>
+#include <std/smart_ptr.hpp>
+#include <std/stdexcept.hpp>
+#include <std/string.hpp>
+#include <std/unordered_map.hpp>
+#include <std/utility.hpp>
+#include <std/vector.hpp>
+
+/**
+ * @brief // stub namespace for std::align_val_t and new operator
+ * @note // Found on https://gcc.gnu.org/legacy-ml/gcc-patches/2016-09/msg00628.html for "_ZnwmSt11align_val_t" compiler error
+ */
+namespace std
+{
+    typedef __SIZE_TYPE__ size_t;
+    static const size_t npos = -1;
+
+    enum class align_val_t : std::size_t
+    {
+    };
+
+    template <typename InputIt, typename OutputIt, typename UnaryOperation>
+    OutputIt transform(InputIt first, InputIt last, OutputIt result, UnaryOperation op)
+    {
+        while (first != last)
+        {
+            *result = op(*first);
+            ++first;
+            ++result;
+        }
+        return result;
+    };
+
+    inline __always_inline int tolower(int c)
+    {
+        if (c >= 'A' && c <= 'Z')
+            return c + ('a' - 'A');
+        else
+            return c;
+    }
+
+    inline __always_inline int toupper(int c)
+    {
+        if (c >= 'a' && c <= 'z')
+            return c - ('a' - 'A');
+        else
+            return c;
+    }
+}
+
+#endif // !__FENNIX_KERNEL_STD_H__
diff --git a/Kernel/include_std/std/atomic.hpp b/Kernel/include_std/std/atomic.hpp
new file mode 100644
index 00000000..bee5b496
--- /dev/null
+++ b/Kernel/include_std/std/atomic.hpp
@@ -0,0 +1,521 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_ATOMIC_H__
+#define __FENNIX_KERNEL_STD_ATOMIC_H__
+
+#include <types.h>
+#include <cstddef>
+#include <debug.h>
+
+namespace std
+{
+#define _atomic(T) T
+#define builtin_atomic_n(name) __atomic_##name##_n
+#define builtin_atomic(name) __atomic_##name
+
+    /**
+     * @brief Specifies the memory ordering constraints for atomic operations.
+     *
+     * This enum specifies the possible values for the memory order parameter of atomic operations.
+     *
+     * Possible values are:
+     *
+     * - memory_order_relaxed: There are no synchronization
+     * or ordering constraints imposed on other reads or writes,
+     * only this operation's atomicity is guaranteed.
+     *
+     * - memory_order_consume: A load operation with this
+     * memory order performs a consume operation on the
+     * affected memory location: no reads or writes in the
+     * current thread dependent on the value currently loaded
+     * can be reordered before this load.
+     *
+     * - memory_order_acquire: A load operation with this
+     * memory order performs the acquire operation on the
+     * affected memory location: no reads or writes in the
+     * current thread can be reordered before this load.
+     *
+     * - memory_order_release: A store operation with this
+     * memory order performs the release operation: no reads
+     * or writes in the current thread can be reordered after
+     * this store.
+     *
+     * - memory_order_acq_rel: A read-modify-write operation
+     * with this memory order is both an acquire operation
+     * and a release operation.
+     *
+     * - memory_order_seq_cst: A load operation with this
+     * memory order performs an acquire operation, a store
+     * performs a release operation, and read-modify-write
+     * performs both an acquire operation and a release
+     * operation, plus a single total order exists in which
+     * all threads observe all modifications in the same order.
+     */
+    enum class memory_order : int
+    {
+        relaxed,
+        consume,
+        acquire,
+        release,
+        acq_rel,
+        seq_cst
+    };
+
+    inline constexpr memory_order memory_order_relaxed = memory_order::relaxed;
+    inline constexpr memory_order memory_order_consume = memory_order::consume;
+    inline constexpr memory_order memory_order_acquire = memory_order::acquire;
+    inline constexpr memory_order memory_order_release = memory_order::release;
+    inline constexpr memory_order memory_order_acq_rel = memory_order::acq_rel;
+    inline constexpr memory_order memory_order_seq_cst = memory_order::seq_cst;
+
+    template <typename T>
+    class atomic
+    {
+        _atomic(T) value;
+
+    public:
+        atomic() noexcept : value(0) {}
+        atomic(T desired) noexcept : value(desired) {}
+        // atomic(const atomic &) = delete;
+
+        /**
+         * @brief Load the value of the atomic variable
+         *
+         * @note Order must be one of memory_order::relaxed, memory_order::consume, memory_order::acquire or memory_order::seq_cst
+         *
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable
+         */
+        T load(memory_order order = memory_order::seq_cst) const noexcept
+        {
+            return builtin_atomic_n(load)(&this->value, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc load()
+         */
+        T load(memory_order order = memory_order::seq_cst) const volatile noexcept
+        {
+            return builtin_atomic_n(load)(&this->value, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Store the value of the atomic variable
+         *
+         * @note Order must be one of memory_order::relaxed, memory_order::release or memory_order::seq_cst
+         *
+         * @param desired The value to store
+         * @param order Memory order constraint to use
+         */
+        void store(T desired, memory_order order = memory_order::seq_cst) noexcept
+        {
+            builtin_atomic_n(store)(&this->value, desired, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc store()
+         */
+        void store(T desired, memory_order order = memory_order::seq_cst) volatile noexcept
+        {
+            builtin_atomic_n(store)(&this->value, desired, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Exchange the value of the atomic variable
+         *
+         * @param desired The value to exchange
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the exchange
+         */
+        T exchange(T desired, memory_order order = memory_order::seq_cst) noexcept
+        {
+            return builtin_atomic_n(exchange)(&this->value, desired, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc exchange()
+         */
+        T exchange(T desired, memory_order order = memory_order::seq_cst) volatile noexcept
+        {
+            return builtin_atomic_n(exchange)(&this->value, desired, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Compare and exchange the value of the atomic variable
+         *
+         * @param expected The expected value
+         * @param desired The desired value
+         * @param success Memory order constraint to use if the exchange succeeds
+         * @param failure Memory order constraint to use if the exchange fails
+         * @return True if the exchange succeeded, false otherwise
+         */
+        bool compare_exchange_weak(T &expected, T desired, std::memory_order success, std::memory_order failure) noexcept
+        {
+            return builtin_atomic(compare_exchange_weak)(&this->value, &expected, desired, false, success, failure);
+        }
+
+        /**
+         * @copydoc compare_exchange_weak()
+         */
+        bool compare_exchange_weak(T &expected, T desired, std::memory_order success, std::memory_order failure) volatile noexcept
+        {
+            return builtin_atomic(compare_exchange_weak)(&this->value, &expected, desired, false, success, failure);
+        }
+
+        /**
+         * @brief Compare and exchange the value of the atomic variable
+         *
+         * @param expected The expected value
+         * @param desired The desired value
+         * @param order Memory order constraint to use
+         * @return True if the exchange succeeded, false otherwise
+         */
+        bool compare_exchange_weak(T &expected, T desired, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(compare_exchange_weak)(&this->value, &expected, desired, false, order, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc compare_exchange_weak()
+         */
+        bool compare_exchange_weak(T &expected, T desired, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(compare_exchange_weak)(&this->value, &expected, desired, false, order, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Compare and exchange the value of the atomic variable
+         *
+         * @param expected The expected value
+         * @param desired The desired value
+         * @param success Memory order constraint to use if the exchange succeeds
+         * @param failure Memory order constraint to use if the exchange fails
+         * @return True if the exchange succeeded, false otherwise
+         */
+        bool compare_exchange_strong(T &expected, T desired, std::memory_order success, std::memory_order failure) noexcept
+        {
+            return builtin_atomic(compare_exchange_strong)(&this->value, &expected, desired, true, success, failure);
+        }
+
+        /**
+         * @copydoc compare_exchange_strong()
+         */
+        bool compare_exchange_strong(T &expected, T desired, std::memory_order success, std::memory_order failure) volatile noexcept
+        {
+            return builtin_atomic(compare_exchange_strong)(&this->value, &expected, desired, true, success, failure);
+        }
+
+        /**
+         * @brief Compare and exchange the value of the atomic variable
+         *
+         * @param expected The expected value
+         * @param desired The desired value
+         * @param order Memory order constraint to use
+         * @return True if the exchange succeeded, false otherwise
+         */
+        bool compare_exchange_strong(T &expected, T desired, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(compare_exchange_strong)(&this->value, &expected, desired, true, order, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc compare_exchange_strong()
+         */
+        bool compare_exchange_strong(T &expected, T desired, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(compare_exchange_strong)(&this->value, &expected, desired, true, order, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Fetch and add the value of the atomic variable
+         *
+         * @param arg The value to add
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the addition
+         */
+        T fetch_add(T arg, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(fetch_add)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc fetch_add()
+         */
+        T fetch_add(T arg, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(fetch_add)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Fetch and subtract the value of the atomic variable
+         *
+         * @param arg The value to subtract
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the subtraction
+         */
+        T fetch_sub(T arg, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(fetch_sub)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc fetch_sub()
+         */
+        T fetch_sub(T arg, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(fetch_sub)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Fetch and bitwise AND the value of the atomic variable
+         *
+         * @param arg The value to AND
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the AND
+         */
+        T fetch_and(T arg, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(fetch_and)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc fetch_and()
+         */
+        T fetch_and(T arg, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(fetch_and)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Fetch and bitwise OR the value of the atomic variable
+         *
+         * @param arg The value to OR
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the OR
+         */
+        T fetch_or(T arg, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(fetch_or)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc fetch_or()
+         */
+        T fetch_or(T arg, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(fetch_or)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Fetch and bitwise XOR the value of the atomic variable
+         *
+         * @param arg The value to XOR
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the XOR
+         */
+        T fetch_xor(T arg, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(fetch_xor)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc fetch_xor()
+         */
+        T fetch_xor(T arg, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(fetch_xor)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Fetch and bitwise NAND the value of the atomic variable
+         *
+         * @param arg The value to NAND
+         * @param order Memory order constraint to use
+         * @return The value of the atomic variable before the NAND
+         */
+        T fetch_nand(T arg, std::memory_order order = std::memory_order_seq_cst) noexcept
+        {
+            return builtin_atomic(fetch_nand)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @copydoc fetch_nand()
+         */
+        T fetch_nand(T arg, std::memory_order order = std::memory_order_seq_cst) volatile noexcept
+        {
+            return builtin_atomic(fetch_nand)(&this->value, arg, static_cast<int>(order));
+        }
+
+        /**
+         * @brief Notify all threads waiting on this atomic variable
+         */
+        void notify_all() noexcept
+        {
+            fixme("not implemented");
+        }
+
+        /**
+         * @copydoc notify_all()
+         */
+        void notify_all() volatile noexcept
+        {
+            fixme("not implemented");
+        }
+
+        /**
+         * @brief Notify one thread waiting on this atomic variable
+         */
+        void notify_one() noexcept
+        {
+            fixme("not implemented");
+        }
+
+        /**
+         * @copydoc notify_one()
+         */
+        void notify_one() volatile noexcept
+        {
+            fixme("not implemented");
+        }
+
+        /**
+         * @brief Wait for the atomic variable to change
+         *
+         * @param old The value to wait for
+         * @param order Memory order constraint to use
+         */
+        void wait(T old, std::memory_order order = std::memory_order::seq_cst) const noexcept
+        {
+            fixme("not implemented");
+        }
+
+        /**
+         * @copydoc wait()
+         */
+        void wait(T old, std::memory_order order = std::memory_order::seq_cst) const volatile noexcept
+        {
+            fixme("not implemented");
+        }
+
+        /**
+         * @brief Check whether this atomic type is lock-free
+         * @return True if this atomic type is lock-free
+         */
+        bool is_lock_free() const noexcept
+        {
+            fixme("not implemented");
+            return true;
+        }
+
+        /**
+         * @copydoc is_lock_free()
+         */
+        bool is_lock_free() const volatile noexcept
+        {
+            fixme("not implemented");
+            return true;
+        }
+
+        /**
+         * @brief Equals true if this atomic type is always lock-free
+         */
+        static constexpr bool is_always_lock_free = true;
+
+        T operator++() noexcept { return this->fetch_add(1) + 1; }
+        T operator--() noexcept { return this->fetch_sub(1) - 1; }
+        T operator++(int) noexcept { return this->fetch_add(1); }
+        T operator--(int) noexcept { return this->fetch_sub(1); }
+
+        T operator+=(T desired) noexcept { return this->fetch_add(desired) + desired; }
+        T operator-=(T desired) noexcept { return this->fetch_sub(desired) - desired; }
+        // T operator+=(std::ptrdiff_t desired) noexcept { return this->fetch_add(desired) + desired; }
+        // T operator-=(std::ptrdiff_t desired) noexcept { return this->fetch_sub(desired) - desired; }
+
+        T operator&=(T desired) noexcept { return this->fetch_and(desired) & desired; }
+        T operator|=(T desired) noexcept { return this->fetch_or(desired) | desired; }
+        T operator^=(T desired) noexcept { return this->fetch_xor(desired) ^ desired; }
+
+        T operator->() noexcept { return this->load(); }
+        T operator~() noexcept { return this->fetch_nand(-1); }
+
+        bool operator==(const atomic &other) const noexcept { return this->load() == other.load(); }
+        bool operator==(T other) const noexcept { return this->load() == other; }
+
+        atomic &operator=(const atomic &) = delete;
+        T operator=(T desired) noexcept
+        {
+            this->store(desired);
+            return desired;
+        }
+
+        operator bool() noexcept { return this->load() != 0; }
+        // operator T() noexcept { return this->load(); }
+        operator T() const noexcept { return this->load(); }
+    };
+
+    typedef atomic<bool> atomic_bool;
+    typedef atomic<char> atomic_char;
+    typedef atomic<signed char> atomic_schar;
+    typedef atomic<unsigned char> atomic_uchar;
+    typedef atomic<short> atomic_short;
+    typedef atomic<unsigned short> atomic_ushort;
+    typedef atomic<int> atomic_int;
+    typedef atomic<unsigned int> atomic_uint;
+    typedef atomic<long> atomic_long;
+    typedef atomic<unsigned long> atomic_ulong;
+    typedef atomic<long long> atomic_llong;
+    typedef atomic<unsigned long long> atomic_ullong;
+    typedef atomic<char16_t> atomic_char16_t;
+    typedef atomic<char32_t> atomic_char32_t;
+    typedef atomic<wchar_t> atomic_wchar_t;
+    typedef atomic<int8_t> atomic_int8_t;
+    typedef atomic<uint8_t> atomic_uint8_t;
+    typedef atomic<int16_t> atomic_int16_t;
+    typedef atomic<uint16_t> atomic_uint16_t;
+    typedef atomic<int32_t> atomic_int32_t;
+    typedef atomic<uint32_t> atomic_uint32_t;
+    typedef atomic<int64_t> atomic_int64_t;
+    typedef atomic<uint64_t> atomic_uint64_t;
+    typedef atomic<int_least8_t> atomic_int_least8_t;
+    typedef atomic<uint_least8_t> atomic_uint_least8_t;
+    typedef atomic<int_least16_t> atomic_int_least16_t;
+    typedef atomic<uint_least16_t> atomic_uint_least16_t;
+    typedef atomic<int_least32_t> atomic_int_least32_t;
+    typedef atomic<uint_least32_t> atomic_uint_least32_t;
+    typedef atomic<int_least64_t> atomic_int_least64_t;
+    typedef atomic<uint_least64_t> atomic_uint_least64_t;
+    typedef atomic<int_fast8_t> atomic_int_fast8_t;
+    typedef atomic<uint_fast8_t> atomic_uint_fast8_t;
+    typedef atomic<int_fast16_t> atomic_int_fast16_t;
+    typedef atomic<uint_fast16_t> atomic_uint_fast16_t;
+    typedef atomic<int_fast32_t> atomic_int_fast32_t;
+    typedef atomic<uint_fast32_t> atomic_uint_fast32_t;
+    typedef atomic<int_fast64_t> atomic_int_fast64_t;
+    typedef atomic<uint_fast64_t> atomic_uint_fast64_t;
+    typedef atomic<intptr_t> atomic_intptr_t;
+    typedef atomic<uintptr_t> atomic_uintptr_t;
+    typedef atomic<size_t> atomic_size_t;
+    typedef atomic<ptrdiff_t> atomic_ptrdiff_t;
+    typedef atomic<intmax_t> atomic_intmax_t;
+    typedef atomic<uintmax_t> atomic_uintmax_t;
+}
+
+#undef builtin_atomic_n
+#undef builtin_atomic
+
+#endif // !__FENNIX_KERNEL_STD_ATOMIC_H__
diff --git a/Kernel/include_std/std/functional.hpp b/Kernel/include_std/std/functional.hpp
new file mode 100644
index 00000000..eadf39e5
--- /dev/null
+++ b/Kernel/include_std/std/functional.hpp
@@ -0,0 +1,50 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_FUNCTIONAL_H__
+#define __FENNIX_KERNEL_STD_FUNCTIONAL_H__
+
+#include <types.h>
+#include <assert.h>
+
+namespace std
+{
+    template <typename Key>
+    struct hash
+    {
+        size_t operator()(const Key &key) const
+        {
+            static_assert(sizeof(size_t) == sizeof(uint64_t)); // size_t and uint64_t must have the same size
+            const uint64_t fnv_offset_basis = 14695981039346656037ull;
+            const uint64_t fnv_prime = 1099511628211ull;
+
+            const uint8_t *data = reinterpret_cast<const uint8_t *>(&key);
+            const size_t size = sizeof(Key);
+            uint64_t ret = fnv_offset_basis;
+
+            for (size_t i = 0; i < size; ++i)
+            {
+                ret ^= static_cast<uint64_t>(data[i]);
+                ret *= fnv_prime;
+            }
+
+            return static_cast<size_t>(ret);
+        }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_FUNCTIONAL_H__
diff --git a/Kernel/include_std/std/list.hpp b/Kernel/include_std/std/list.hpp
new file mode 100644
index 00000000..2de7557f
--- /dev/null
+++ b/Kernel/include_std/std/list.hpp
@@ -0,0 +1,224 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_LIST_H__
+#define __FENNIX_KERNEL_STD_LIST_H__
+
+#include <types.h>
+#include <std/stdexcept.hpp>
+
+namespace std
+{
+    template <typename T>
+    class list
+    {
+    private:
+        struct Node
+        {
+            T value;
+            Node *prev;
+            Node *next;
+
+            Node(const T &v, Node *p = nullptr, Node *n = nullptr)
+                : value(v), prev(p), next(n) {}
+        };
+
+        Node *head;
+        Node *tail;
+        size_t size;
+
+    public:
+        list() : head(nullptr), tail(nullptr), size(0) {}
+        ~list() { clear(); }
+        list(const list &other) : head(nullptr), tail(nullptr), size(0) { *this = other; }
+
+        void push_back(const T &value)
+        {
+            Node *new_node = new Node(value, tail, nullptr);
+            if (empty())
+            {
+                head = tail = new_node;
+            }
+            else
+            {
+                tail->next = new_node;
+                tail = new_node;
+            }
+            ++size;
+        }
+
+        void pop_back()
+        {
+            if (empty())
+            {
+                throw std::runtime_error("list is empty");
+            }
+            else if (head == tail)
+            {
+                delete tail;
+                head = tail = nullptr;
+                --size;
+            }
+            else
+            {
+                Node *old_tail = tail;
+                tail = tail->prev;
+                tail->next = nullptr;
+                delete old_tail;
+                --size;
+            }
+        }
+
+        void push_front(const T &value)
+        {
+            Node *new_node = new Node(value, nullptr, head);
+            if (empty())
+            {
+                head = tail = new_node;
+            }
+            else
+            {
+                head->prev = new_node;
+                head = new_node;
+            }
+            ++size;
+        }
+
+        void pop_front()
+        {
+            if (empty())
+            {
+                throw std::runtime_error("list is empty");
+            }
+            else if (head == tail)
+            {
+                delete head;
+                head = tail = nullptr;
+                --size;
+            }
+            else
+            {
+                Node *old_head = head;
+                head = head->next;
+                head->prev = nullptr;
+                delete old_head;
+                --size;
+            }
+        }
+
+        bool empty() const { return size == 0; }
+
+        void clear()
+        {
+            while (!empty())
+                pop_back();
+        }
+
+        list &operator=(const list &other)
+        {
+            if (this != &other)
+            {
+                clear();
+                for (const T &value : other)
+                {
+                    push_back(value);
+                }
+            }
+            return *this;
+        }
+
+        class iterator
+        {
+        private:
+            Node *node;
+            friend class list;
+
+        public:
+            iterator(Node *p = nullptr) : node(p) {}
+            T &operator*() const { return node->value; }
+            T *operator->() const { return &node->value; }
+
+            iterator &operator++()
+            {
+                node = node->next;
+                return *this;
+            }
+
+            iterator &operator--()
+            {
+                node = node->prev;
+                return *this;
+            }
+
+            iterator operator++(int)
+            {
+                iterator tmp = *this;
+                ++*this;
+                return tmp;
+            }
+
+            iterator operator--(int)
+            {
+                iterator tmp = *this;
+                --*this;
+                return tmp;
+            }
+
+            bool operator==(const iterator &rhs) const { return node == rhs.node; }
+            bool operator!=(const iterator &rhs) const { return node != rhs.node; }
+        };
+
+        iterator begin() { return iterator(head); }
+        iterator end() { return iterator(nullptr); }
+
+        iterator insert(iterator pos, const T &value)
+        {
+            if (pos == end())
+            {
+                push_back(value);
+                return iterator(tail);
+            }
+            else if (pos == begin())
+            {
+                push_front(value);
+                return iterator(head);
+            }
+            else
+            {
+                Node *p = pos.node;
+                Node *new_node = new Node(value, p->prev, p);
+                p->prev->next = new_node;
+                p->prev = new_node;
+                ++size;
+                return iterator(new_node);
+            }
+        }
+
+        iterator erase(iterator pos)
+        {
+            Node *p = pos.node;
+            iterator next(p->next);
+            p->prev->next = p->next;
+            p->next->prev = p->prev;
+            delete p;
+            --size;
+            return next;
+        }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_LIST_H__
diff --git a/Kernel/include_std/std/smart_ptr.hpp b/Kernel/include_std/std/smart_ptr.hpp
new file mode 100644
index 00000000..31b27a82
--- /dev/null
+++ b/Kernel/include_std/std/smart_ptr.hpp
@@ -0,0 +1,292 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_SMART_POINTER_H__
+#define __FENNIX_KERNEL_STD_SMART_POINTER_H__
+
+#include <types.h>
+
+#include <debug.h>
+
+// show debug messages
+// #define DEBUG_SMARTPOINTERS 1
+
+#ifdef DEBUG_SMARTPOINTERS
+#define spdbg(m, ...) debug(m, ##__VA_ARGS__)
+#else
+#define spdbg(m, ...)
+#endif
+
+namespace std
+{
+    /**
+     * @brief A smart pointer class
+     *
+     * This class is a smart pointer class. It is used to manage the lifetime of
+     * objects. It is a reference counted pointer, so when the last reference to
+     * the object is removed, the object is deleted.
+     *
+     * Basic Usage:
+     * smart_ptr<char> pointer(new char());
+     * *pointer = 'a';
+     * printf("%c", *pointer); // Prints "a"
+     */
+    template <class T>
+    class smart_ptr
+    {
+        T *RealPointer;
+
+    public:
+        explicit smart_ptr(T *Pointer = nullptr)
+        {
+            spdbg("Smart pointer created (%#lx)", this->RealPointer);
+            this->RealPointer = Pointer;
+        }
+
+        ~smart_ptr()
+        {
+            spdbg("Smart pointer deleted (%#lx)", this->RealPointer);
+            delete this->RealPointer, this->RealPointer = nullptr;
+        }
+
+        T &operator*()
+        {
+            spdbg("Smart pointer dereferenced (%#lx)", this->RealPointer);
+            return *this->RealPointer;
+        }
+
+        T *operator->()
+        {
+            spdbg("Smart pointer dereferenced (%#lx)", this->RealPointer);
+            return this->RealPointer;
+        }
+
+        T *get()
+        {
+            spdbg("Smart pointer returned (%#lx)", this->RealPointer);
+            return this->RealPointer;
+        }
+    };
+
+    template <class T>
+    class auto_ptr
+    {
+    };
+
+    template <class T>
+    class unique_ptr
+    {
+    };
+
+    template <class T>
+    class weak_ptr
+    {
+    };
+
+    template <typename T>
+    class shared_ptr
+    {
+    private:
+        class counter
+        {
+        private:
+            unsigned int RefCount{};
+
+        public:
+            counter() : RefCount(0) { spdbg("Counter %#lx created", this); };
+            counter(const counter &) = delete;
+            counter &operator=(const counter &) = delete;
+            ~counter() { spdbg("Counter %#lx deleted", this); }
+            void reset()
+            {
+                this->RefCount = 0;
+                spdbg("reset");
+            }
+
+            unsigned int get()
+            {
+                return this->RefCount;
+                spdbg("return");
+            }
+
+            void operator++()
+            {
+                this->RefCount++;
+                spdbg("increment");
+            }
+
+            void operator++(int)
+            {
+                this->RefCount++;
+                spdbg("increment");
+            }
+
+            void operator--()
+            {
+                this->RefCount--;
+                spdbg("decrement");
+            }
+
+            void operator--(int)
+            {
+                this->RefCount--;
+                spdbg("decrement");
+            }
+        };
+
+        counter *ReferenceCounter;
+        T *RealPointer;
+
+    public:
+        explicit shared_ptr(T *Pointer = nullptr)
+        {
+            this->RealPointer = Pointer;
+            this->ReferenceCounter = new counter();
+            spdbg("[%#lx] Shared pointer created (ptr=%#lx, ref=%#lx)", this, Pointer, this->ReferenceCounter);
+            if (Pointer)
+                (*this->ReferenceCounter)++;
+        }
+
+        shared_ptr(shared_ptr<T> &SPtr)
+        {
+            spdbg("[%#lx] Shared pointer copied (ptr=%#lx, ref=%#lx)", this, SPtr.RealPointer, SPtr.ReferenceCounter);
+            this->RealPointer = SPtr.RealPointer;
+            this->ReferenceCounter = SPtr.ReferenceCounter;
+            (*this->ReferenceCounter)++;
+        }
+
+        ~shared_ptr()
+        {
+            spdbg("[%#lx] Shared pointer destructor called", this);
+            (*this->ReferenceCounter)--;
+            if (this->ReferenceCounter->get() == 0)
+            {
+                spdbg("[%#lx] Shared pointer deleted (ptr=%#lx, ref=%#lx)", this, this->RealPointer, this->ReferenceCounter);
+                delete this->ReferenceCounter, this->ReferenceCounter = nullptr;
+                delete this->RealPointer, this->RealPointer = nullptr;
+            }
+        }
+
+        unsigned int get_count()
+        {
+            spdbg("[%#lx] Shared pointer count (%d)", this, this->ReferenceCounter->get());
+            return this->ReferenceCounter->get();
+        }
+
+        T *get()
+        {
+            spdbg("[%#lx] Shared pointer get (%#lx)", this, this->RealPointer);
+            return this->RealPointer;
+        }
+
+        T &operator*()
+        {
+            spdbg("[%#lx] Shared pointer dereference (ptr*=%#lx)", this, *this->RealPointer);
+            return *this->RealPointer;
+        }
+
+        T *operator->()
+        {
+            spdbg("[%#lx] Shared pointer dereference (ptr->%#lx)", this, this->RealPointer);
+            return this->RealPointer;
+        }
+
+        void reset(T *Pointer = nullptr)
+        {
+            if (this->RealPointer == Pointer)
+                return;
+            spdbg("[%#lx] Shared pointer reset (ptr=%#lx, ref=%#lx)", this, Pointer, this->ReferenceCounter);
+            (*this->ReferenceCounter)--;
+            if (this->ReferenceCounter->get() == 0)
+            {
+                delete this->RealPointer;
+                delete this->ReferenceCounter;
+            }
+            this->RealPointer = Pointer;
+            this->ReferenceCounter = new counter();
+            if (Pointer)
+                (*this->ReferenceCounter)++;
+        }
+
+        void reset()
+        {
+            spdbg("[%#lx] Shared pointer reset (ptr=%#lx, ref=%#lx)", this, this->RealPointer, this->ReferenceCounter);
+            if (this->ReferenceCounter->get() == 1)
+            {
+                delete this->RealPointer, this->RealPointer = nullptr;
+                delete this->ReferenceCounter, this->ReferenceCounter = nullptr;
+            }
+            else
+            {
+                (*this->ReferenceCounter)--;
+            }
+        }
+
+        void swap(shared_ptr<T> &Other)
+        {
+            spdbg("[%#lx] Shared pointer swap (ptr=%#lx, ref=%#lx <=> ptr=%#lx, ref=%#lx)",
+                  this, this->RealPointer, this->ReferenceCounter, Other.RealPointer, Other.ReferenceCounter);
+            T *tempRealPointer = this->RealPointer;
+            counter *tempReferenceCounter = this->ReferenceCounter;
+            this->RealPointer = Other.RealPointer;
+            this->ReferenceCounter = Other.ReferenceCounter;
+            Other.RealPointer = tempRealPointer;
+            Other.ReferenceCounter = tempReferenceCounter;
+        }
+    };
+
+    template <typename T>
+    struct remove_reference
+    {
+        typedef T type;
+    };
+
+    template <typename T>
+    struct remove_reference<T &>
+    {
+        typedef T type;
+    };
+
+    template <typename T>
+    struct remove_reference<T &&>
+    {
+        typedef T type;
+    };
+
+    template <typename T>
+    using remove_reference_t = typename remove_reference<T>::type;
+
+    template <typename T>
+    T &&forward(remove_reference_t<T> &t) { return static_cast<T &&>(t); };
+
+    template <typename T>
+    T &&forward(remove_reference_t<T> &&t) { return static_cast<T &&>(t); };
+
+    template <typename T, typename... Args>
+    shared_ptr<T> make_shared(Args &&...args)
+    {
+        return shared_ptr<T>(new T(forward<Args>(args)...));
+    };
+
+    template <typename T, typename... Args>
+    smart_ptr<T> make_smart(Args &&...args)
+    {
+        return smart_ptr<T>(new T(forward<Args>(args)...));
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_SMART_POINTER_H__
diff --git a/Kernel/include_std/std/stdexcept.hpp b/Kernel/include_std/std/stdexcept.hpp
new file mode 100644
index 00000000..b243c38c
--- /dev/null
+++ b/Kernel/include_std/std/stdexcept.hpp
@@ -0,0 +1,36 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_STDEXCEPT_H__
+#define __FENNIX_KERNEL_STD_STDEXCEPT_H__
+
+#include <types.h>
+
+namespace std
+{
+    class runtime_error
+    {
+    private:
+        const char *m_what;
+
+    public:
+        runtime_error(const char *what_arg) : m_what(what_arg) {}
+        const char *what() const { return this->m_what; }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_STDEXCEPT_H__
diff --git a/Kernel/include_std/std/string.hpp b/Kernel/include_std/std/string.hpp
new file mode 100644
index 00000000..45ee05a0
--- /dev/null
+++ b/Kernel/include_std/std/string.hpp
@@ -0,0 +1,553 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_STRING_H__
+#define __FENNIX_KERNEL_STD_STRING_H__
+
+#include <types.h>
+#include <convert.h>
+#include <debug.h>
+
+// show debug messages
+// #define DEBUG_CPP_STRING 1
+
+#ifdef DEBUG_CPP_STRING
+#define strdbg(m, ...) debug(m, ##__VA_ARGS__)
+#else
+#define strdbg(m, ...)
+#endif
+
+// TODO: Somewhere the delete is called twice, causing a double free error.
+
+namespace std
+{
+    /**
+     * @brief String class
+     * String class that can be used to store strings.
+     */
+    class string
+    {
+    private:
+        char *Data;
+        size_t Length;
+        size_t Capacity;
+
+    public:
+        static const size_t npos = -1;
+
+        string(const char *Str = "")
+        {
+            this->Length = strlen(Str);
+            this->Capacity = this->Length + 1;
+            this->Data = new char[this->Capacity];
+            strcpy(this->Data, Str);
+            strdbg("New string created: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        }
+
+        ~string()
+        {
+            strdbg("String deleted: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+            delete[] this->Data, this->Data = nullptr;
+        }
+
+        size_t length() const
+        {
+            strdbg("String length: %d", this->Length);
+            return this->Length;
+        }
+
+        size_t capacity() const
+        {
+            strdbg("String capacity: %d", this->Capacity);
+            return this->Capacity;
+        }
+
+        const char *c_str() const
+        {
+            strdbg("String data: \"%s\"", this->Data);
+            return this->Data;
+        }
+
+        void resize(size_t NewLength)
+        {
+            strdbg("String resize: %d", NewLength);
+            if (NewLength > this->Capacity)
+            {
+                size_t newCapacity = NewLength + 1;
+                char *newData = new char[newCapacity];
+
+                strcpy(newData, this->Data);
+
+                strdbg("old: %#lx, new: %#lx", this->Data, newData);
+                delete[] this->Data;
+                this->Data = newData;
+                this->Capacity = newCapacity;
+            }
+            this->Length = NewLength;
+            this->Data[this->Length] = '\0';
+            strdbg("String resized: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        }
+
+        void concat(const string &Other)
+        {
+            size_t NewLength = this->Length + Other.Length;
+            this->resize(NewLength);
+
+            strcat(this->Data, Other.Data);
+            strdbg("String concatenated: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        }
+
+        bool empty() const
+        {
+            strdbg("String empty: %d", this->Length == 0);
+            return this->Length == 0;
+        }
+
+        size_t size() const
+        {
+            strdbg("String size: %d", this->Length);
+            return this->Length;
+        }
+
+        void clear()
+        {
+            strdbg("String clear");
+            this->resize(0);
+        }
+
+        size_t find(const char *Str, size_t Pos = 0) const
+        {
+            strdbg("String find: \"%s\", %d", Str, Pos);
+            if (Pos >= this->Length)
+                return npos;
+
+            for (size_t i = Pos; i < this->Length; i++)
+            {
+                bool found = true;
+                for (size_t j = 0; Str[j] != '\0'; j++)
+                {
+                    if (this->Data[i + j] != Str[j])
+                    {
+                        found = false;
+                        break;
+                    }
+                }
+                if (found)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t find(const string &Str, size_t Pos = 0) const
+        {
+            strdbg("String find: \"%s\", %d", Str.c_str(), Pos);
+            return this->find(Str.c_str(), Pos);
+        }
+
+        void erase(int Index, int Count = 1)
+        {
+            strdbg("String erase: %d, %d", Index, Count);
+            if (Index < 0 || (size_t)Index >= this->Length)
+                return;
+
+            if (Count < 0)
+                return;
+
+            if ((size_t)(Index + Count) > this->Length)
+                Count = (int)this->Length - Index;
+
+            for (size_t i = Index; i < this->Length - Count; i++)
+                this->Data[i] = this->Data[i + Count];
+
+            this->Length -= Count;
+            this->Data[this->Length] = '\0';
+            strdbg("String erased: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        }
+
+        size_t find_last_not_of(const char *Str, size_t Pos = npos) const
+        {
+            strdbg("String find_last_not_of: \"%s\", %d", Str, Pos);
+            if (Pos == npos)
+                Pos = this->Length - 1;
+
+            for (int i = (int)Pos; i >= 0; i--)
+            {
+                bool found = false;
+                for (size_t j = 0; Str[j] != '\0'; j++)
+                {
+                    if (this->Data[i] == Str[j])
+                    {
+                        found = true;
+                        break;
+                    }
+                }
+                if (!found)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t find_first_not_of(const char *Str, size_t Pos = 0) const
+        {
+            strdbg("String find_first_not_of: \"%s\", %d", Str, Pos);
+            if (Pos >= this->Length)
+                return npos;
+
+            for (size_t i = Pos; i < this->Length; i++)
+            {
+                bool found = false;
+                for (size_t j = 0; Str[j] != '\0'; j++)
+                {
+                    if (this->Data[i] == Str[j])
+                    {
+                        found = true;
+                        break;
+                    }
+                }
+                if (!found)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t find_first_of(const char *Str, size_t Pos = 0) const
+        {
+            strdbg("String find_first_of: \"%s\", %d", Str, Pos);
+            if (Pos >= this->Length)
+                return npos;
+
+            for (size_t i = Pos; i < this->Length; i++)
+            {
+                bool found = false;
+                for (size_t j = 0; Str[j] != '\0'; j++)
+                {
+                    if (this->Data[i] == Str[j])
+                    {
+                        found = true;
+                        break;
+                    }
+                }
+                if (found)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t find_last_of(const char *Str, size_t Pos = npos) const
+        {
+            strdbg("String find_last_of: \"%s\", %d", Str, Pos);
+            if (Pos == npos)
+                Pos = this->Length - 1;
+
+            for (int i = (int)Pos; i >= 0; i--)
+            {
+                bool found = false;
+                for (int j = 0; Str[j] != '\0'; j++)
+                {
+                    if (this->Data[i] == Str[j])
+                    {
+                        found = true;
+                        break;
+                    }
+                }
+                if (found)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t find_first_of(char C, size_t Pos = 0) const
+        {
+            strdbg("String find_first_of: '%c', %d", C, Pos);
+            if (Pos >= this->Length)
+                return npos;
+
+            for (size_t i = Pos; i < this->Length; i++)
+            {
+                if (this->Data[i] == C)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t find_last_of(char C, size_t Pos = npos) const
+        {
+            strdbg("String find_last_of: '%c', %d", C, Pos);
+            if (Pos == npos)
+                Pos = this->Length - 1;
+
+            for (int i = (int)Pos; i >= 0; i--)
+            {
+                if (this->Data[i] == C)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t substr(const char *Str, size_t Pos = 0) const
+        {
+            strdbg("String substr: \"%s\", %d", Str, Pos);
+            if (Pos >= this->Length)
+                return npos;
+
+            for (size_t i = Pos; i < this->Length; i++)
+            {
+                bool found = true;
+                for (size_t j = 0; Str[j] != '\0'; j++)
+                {
+                    if (this->Data[i + j] != Str[j])
+                    {
+                        found = false;
+                        break;
+                    }
+                }
+                if (found)
+                    return i;
+            }
+            return npos;
+        }
+
+        size_t substr(const string &Str, size_t Pos = 0) const
+        {
+            strdbg("String substr: \"%s\", %d", Str.c_str(), Pos);
+            return this->substr(Str.c_str(), Pos);
+        }
+
+        string substr(size_t Pos = 0, size_t Count = npos) const
+        {
+            strdbg("String substr: %d, %d", Pos, Count);
+            if (Pos >= this->Length)
+                return string();
+
+            if (Count == npos)
+                Count = this->Length - Pos;
+
+            if (Pos + Count > this->Length)
+                Count = this->Length - Pos;
+
+            string ret;
+            ret.resize(Count);
+            for (size_t i = 0; i < Count; i++)
+                ret.Data[i] = this->Data[Pos + i];
+            ret.Data[Count] = '\0';
+            return ret;
+        }
+
+        void replace(size_t Pos, size_t Count, const char *Str)
+        {
+            strdbg("String replace: %d, %d, \"%s\"", Pos, Count, Str);
+            if (Pos >= this->Length)
+                return;
+
+            if ((int64_t)Count < 0)
+                return;
+
+            if (Pos + Count > this->Length)
+                Count = this->Length - Pos;
+
+            size_t NewLength = this->Length - Count + strlen(Str);
+            this->resize(NewLength);
+
+            for (size_t i = this->Length - 1; i >= Pos + strlen(Str); i--)
+                this->Data[i] = this->Data[i - strlen(Str) + Count];
+
+            for (unsigned long i = 0; i < strlen(Str); i++)
+                this->Data[Pos + i] = Str[i];
+
+            strdbg("String replaced: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        }
+
+        void replace(size_t Pos, size_t Count, const string &Str)
+        {
+            strdbg("String replace: %d, %d, \"%s\"", Pos, Count, Str.Data);
+            if (Pos >= this->Length)
+                return;
+
+            if ((int64_t)Count < 0)
+                return;
+
+            if (Pos + Count > this->Length)
+                Count = this->Length - Pos;
+
+            size_t NewLength = this->Length - Count + Str.Length;
+            this->resize(NewLength);
+
+            for (size_t i = this->Length - 1; i >= Pos + Str.Length; i--)
+                this->Data[i] = this->Data[i - Str.Length + Count];
+
+            for (size_t i = 0; i < Str.Length; i++)
+                this->Data[Pos + i] = Str.Data[i];
+
+            strdbg("String replaced: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        }
+
+        string operator+(const string &Other) const
+        {
+            string result = *this;
+            result.concat(Other);
+            strdbg("String added: \"%s\" (data: %#lx, length: %d, capacity: %d)", result.Data, result.Data, result.Length, result.Capacity);
+            return result;
+        }
+
+        string operator+(const char *Other) const
+        {
+            string result = *this;
+            result.concat(Other);
+            strdbg("String added: \"%s\" (data: %#lx, length: %d, capacity: %d)", result.Data, result.Data, result.Length, result.Capacity);
+            return result;
+        }
+
+        string &operator+=(const string &Other)
+        {
+            this->concat(Other);
+            strdbg("String appended: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+            return *this;
+        }
+
+        string &operator+=(const char *Other)
+        {
+            this->concat(Other);
+            strdbg("String appended: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+            return *this;
+        }
+
+        /* warning: implicitly-declared ‘constexpr String::String(const String&)’ is deprecated [-Wdeprecated-copy] */
+        string &operator=(const string &Other) = default;
+
+        // string &operator=(const string &Other)
+        // {
+        //     if (this != &Other)
+        //     {
+        //         delete[] this->Data;
+        //         this->Data = Other.Data;
+        //         this->Length = Other.Length;
+        //         this->Capacity = Other.Capacity;
+        //         strdbg("String assigned: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+        //     }
+        //     return *this;
+        // }
+
+        string &operator=(const char *Other)
+        {
+            this->Length = strlen(Other);
+            this->Capacity = this->Length + 1;
+            delete[] this->Data;
+            this->Data = new char[this->Capacity];
+            strcpy(this->Data, Other);
+            strdbg("String assigned: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+            return *this;
+        }
+
+        string &operator<<(const string &Other)
+        {
+            this->concat(Other);
+            strdbg("String appended: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+            return *this;
+        }
+
+        string &operator<<(const char *Other)
+        {
+            this->concat(Other);
+            strdbg("String appended: \"%s\" (data: %#lx, length: %d, capacity: %d)", this->Data, this->Data, this->Length, this->Capacity);
+            return *this;
+        }
+
+        char &operator[](int Index)
+        {
+            strdbg("String index: %d", Index);
+            return this->Data[Index];
+        }
+
+        const char &operator[](int Index) const
+        {
+            strdbg("String index: %d", Index);
+            return this->Data[Index];
+        }
+
+        bool operator==(const string &Other) const
+        {
+            strdbg("String compared: \"%s\" == \"%s\"", this->Data, Other.Data);
+            return strcmp(this->Data, Other.Data) == 0;
+        }
+
+        bool operator!=(const char *Other) const
+        {
+            strdbg("String compared: \"%s\" != \"%s\"", this->Data, Other);
+            return strcmp(this->Data, Other) != 0;
+        }
+
+        bool operator!=(const string &Other) const
+        {
+            strdbg("String compared: \"%s\" != \"%s\"", this->Data, Other.Data);
+            return strcmp(this->Data, Other.Data) != 0;
+        }
+
+        bool operator==(const char *Other) const
+        {
+            strdbg("String compared: \"%s\" == \"%s\"", this->Data, Other);
+            return strcmp(this->Data, Other) == 0;
+        }
+
+        class iterator
+        {
+        private:
+            char *Pointer;
+
+        public:
+            iterator(char *Pointer) : Pointer(Pointer) {}
+
+            iterator &operator++()
+            {
+                ++this->Pointer;
+                strdbg("String iterator incremented: %#lx", this->Pointer);
+                return *this;
+            }
+
+            char &operator*()
+            {
+                strdbg("String iterator dereferenced: %#lx", this->Pointer);
+                return *this->Pointer;
+            }
+
+            bool operator!=(const iterator &Other) const
+            {
+                strdbg("String iterator compared: %#lx != %#lx", this->Pointer, Other.Pointer);
+                return this->Pointer != Other.Pointer;
+            }
+
+            bool operator==(const iterator &Other) const
+            {
+                strdbg("String iterator compared: %#lx == %#lx", this->Pointer, Other.Pointer);
+                return this->Pointer == Other.Pointer;
+            }
+        };
+
+        iterator begin()
+        {
+            strdbg("String iterator begin: %#lx", this->Data);
+            return iterator(this->Data);
+        }
+
+        iterator end()
+        {
+            strdbg("String iterator end: %#lx", this->Data + this->Length);
+            return iterator(this->Data + this->Length);
+        }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_STRING_H__
diff --git a/Kernel/include_std/std/unordered_map.hpp b/Kernel/include_std/std/unordered_map.hpp
new file mode 100644
index 00000000..9e956f3c
--- /dev/null
+++ b/Kernel/include_std/std/unordered_map.hpp
@@ -0,0 +1,131 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_UNORDERED_MAP_H__
+#define __FENNIX_KERNEL_STD_UNORDERED_MAP_H__
+
+#include <types.h>
+#include <std/functional.hpp>
+#include <std/utility.hpp>
+#include <std/vector.hpp>
+#include <std/list.hpp>
+
+namespace std
+{
+    template <typename key_type, typename value_type>
+    class unordered_map
+    {
+    public:
+        typedef std::pair<key_type, value_type> key_value_pair;
+        typedef std::list<key_value_pair> bucket;
+        typedef typename std::vector<bucket>::iterator iterator;
+        typedef typename std::vector<bucket>::const_iterator const_iterator;
+
+    private:
+        static const size_t DEFAULT_NUM_BUCKETS = 10;
+        std::vector<bucket> bkts;
+
+        size_t hash(const key_type &key) const
+        {
+            std::hash<key_type> hash_function;
+            return hash_function(key) % this->bkts.size();
+        }
+
+    public:
+        unordered_map() : bkts(DEFAULT_NUM_BUCKETS) {}
+        unordered_map(size_t num_buckets) : bkts(num_buckets) {}
+
+        void insert(const key_value_pair &pair)
+        {
+            size_t bucket_index = hash(pair.first);
+            bucket &bkt = this->bkts[bucket_index];
+            for (auto it = bkt.begin(); it != bkt.end(); ++it)
+            {
+                if (it->first == pair.first)
+                {
+                    it->second = pair.second;
+                    return;
+                }
+            }
+            bkt.push_back(pair);
+        }
+
+        bool contains(const key_type &key) const
+        {
+            size_t bucket_index = hash(key);
+            const bucket &bkt = this->bkts[bucket_index];
+            for (auto it = bkt.begin(); it != bkt.end(); ++it)
+            {
+                if (it->first == key)
+                {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        iterator find(const key_type &k)
+        {
+            size_t bucket_index = hash(k);
+            bucket &bkt = this->bkts[bucket_index];
+            for (auto it = bkt.begin(); it != bkt.end(); ++it)
+            {
+                if (it->first == k)
+                    return it;
+            }
+            return bkt.end();
+        }
+
+        const_iterator find(const key_type &k) const
+        {
+            size_t bucket_index = hash(k);
+            const bucket &bkt = this->bkts[bucket_index];
+            for (auto it = bkt.begin(); it != bkt.end(); ++it)
+            {
+                if (it->first == k)
+                    return it;
+            }
+            return bkt.end();
+        }
+
+        iterator end() noexcept { return this->bkts.end(); }
+
+        size_t size() const
+        {
+            size_t count = 0;
+            foreach (const auto &bkt in this->bkts)
+                count += bkt.size();
+
+            return count;
+        }
+
+        value_type &operator[](const key_type &key)
+        {
+            size_t bucket_index = hash(key);
+            bucket &bkt = this->bkts[bucket_index];
+            for (auto it = bkt.begin(); it != bkt.end(); ++it)
+            {
+                if (it->first == key)
+                    return it->second;
+            }
+            bkt.emplace_back(key, value_type());
+            return bkt.back().second;
+        }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_UNORDERED_MAP_H__
diff --git a/Kernel/include_std/std/utility.hpp b/Kernel/include_std/std/utility.hpp
new file mode 100644
index 00000000..12814c47
--- /dev/null
+++ b/Kernel/include_std/std/utility.hpp
@@ -0,0 +1,39 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_UTILITY_H__
+#define __FENNIX_KERNEL_STD_UTILITY_H__
+
+#include <types.h>
+
+namespace std
+{
+    template <typename T1, typename T2>
+    struct pair
+    {
+        typedef T1 first_type;
+        typedef T2 second_type;
+
+        T1 first;
+        T2 second;
+
+        pair() : first(T1()), second(T2()) {}
+        pair(const T1 &x, const T2 &y) : first(x), second(y) {}
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_UTILITY_H__
diff --git a/Kernel/include_std/std/vector.hpp b/Kernel/include_std/std/vector.hpp
new file mode 100644
index 00000000..ecb81e09
--- /dev/null
+++ b/Kernel/include_std/std/vector.hpp
@@ -0,0 +1,284 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STD_VECTOR_H__
+#define __FENNIX_KERNEL_STD_VECTOR_H__
+
+#include <types.h>
+#include <assert.h>
+#include <cstring>
+
+namespace std
+{
+    template <class T>
+    class vector
+    {
+    private:
+        size_t VectorSize = 0;
+        size_t VectorCapacity = 0;
+        T *VectorBuffer = nullptr;
+
+    public:
+        typedef T *iterator;
+        typedef const T *const_iterator;
+
+        NIF vector()
+        {
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR INIT: vector( )");
+#endif
+            VectorCapacity = 0;
+            VectorSize = 0;
+            VectorBuffer = 0;
+        }
+
+        NIF vector(size_t Size)
+        {
+            VectorCapacity = Size;
+            VectorSize = Size;
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR INIT: vector( %lld )", Size);
+#endif
+            VectorBuffer = new T[Size];
+        }
+
+        NIF vector(size_t Size, const T &Initial)
+        {
+            VectorSize = Size;
+            VectorCapacity = Size;
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR INIT: vector( %lld %llx )", Size, Initial);
+#endif
+            assert(Size > 0);
+            VectorBuffer = new T[Size];
+            for (size_t i = 0; i < Size; i++)
+                VectorBuffer[i] = Initial;
+        }
+
+        NIF vector(const vector<T> &v)
+        {
+            VectorSize = v.VectorSize;
+            VectorCapacity = v.VectorCapacity;
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR INIT: vector( <vector> )->Size: %lld", VectorSize);
+#endif
+            assert(VectorSize > 0);
+            VectorBuffer = new T[VectorSize];
+            for (size_t i = 0; i < VectorSize; i++)
+                VectorBuffer[i] = v.VectorBuffer[i];
+        }
+
+        NIF ~vector()
+        {
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR INIT: ~vector( ~%lx )", VectorBuffer);
+#endif
+            VectorSize = 0;
+            VectorCapacity = 0;
+            if (VectorBuffer != nullptr)
+            {
+                delete[] VectorBuffer, VectorBuffer = nullptr;
+            }
+        }
+
+        NIF void remove(size_t Position)
+        {
+            if (Position >= VectorSize)
+                return;
+            memset(&*(VectorBuffer + Position), 0, sizeof(T));
+            for (size_t i = 0; i < VectorSize - 1; i++)
+            {
+                *(VectorBuffer + Position + i) = *(VectorBuffer + Position + i + 1);
+            }
+            VectorSize--;
+        }
+
+        NIF void remove(const T &Value)
+        {
+            for (size_t i = 0; i < VectorSize; i++)
+            {
+                if (VectorBuffer[i] == Value)
+                {
+                    remove(i);
+                    return;
+                }
+            }
+        }
+
+        NIF T &null_elem()
+        {
+            static T null_elem;
+            return null_elem;
+        }
+
+        NIF bool null_elem(size_t Index)
+        {
+            if (!reinterpret_cast<uintptr_t>(&VectorBuffer[Index]))
+                return false;
+            return true;
+        }
+
+        NIF T &next(size_t Position)
+        {
+            if (Position + 1 < VectorSize && reinterpret_cast<uintptr_t>(&VectorBuffer[Position + 1]))
+                return VectorBuffer[Position + 1];
+            warn("next( %lld ) is null (requested by %#lx)", Position, __builtin_return_address(0));
+            return this->null_elem();
+        }
+
+        NIF T &prev(size_t Position)
+        {
+            if (Position > 0 && reinterpret_cast<uintptr_t>(&VectorBuffer[Position - 1]))
+                return VectorBuffer[Position - 1];
+            warn("prev( %lld ) is null (requested by %#lx)", Position, __builtin_return_address(0));
+            return this->null_elem();
+        }
+
+        NIF T &next(const T &Value)
+        {
+            for (size_t i = 0; i < VectorSize; i++)
+            {
+                if (VectorBuffer[i] == Value)
+                {
+                    if (i + 1 < VectorSize && reinterpret_cast<uintptr_t>(&VectorBuffer[i + 1]))
+                        return VectorBuffer[i + 1];
+                    else
+                        break;
+                }
+            }
+            warn("next( %#lx ) is null (requested by %#lx)", Value, __builtin_return_address(0));
+            return this->null_elem();
+        }
+
+        NIF T &prev(const T &Value)
+        {
+            for (size_t i = 0; i < VectorSize; i++)
+            {
+                if (VectorBuffer[i] == Value)
+                {
+                    if (i > 0 && reinterpret_cast<uintptr_t>(&VectorBuffer[i - 1]))
+                        return VectorBuffer[i - 1];
+                    else
+                        break;
+                }
+            }
+            warn("prev( %#lx ) is null (requested by %#lx)", Value, __builtin_return_address(0));
+            return this->null_elem();
+        }
+
+        NIF size_t capacity() const { return VectorCapacity; }
+
+        NIF size_t size() const { return VectorSize; }
+
+        NIF bool empty() const;
+
+        NIF iterator begin() { return VectorBuffer; }
+
+        NIF iterator end() { return VectorBuffer + size(); }
+
+        NIF T &front() { return VectorBuffer[0]; }
+
+        NIF T &back() { return VectorBuffer[VectorSize - 1]; }
+
+        NIF void push_back(const T &Value)
+        {
+            if (VectorSize >= VectorCapacity)
+                reserve(VectorCapacity + 5);
+            VectorBuffer[VectorSize++] = Value;
+        }
+
+        NIF void pop_back() { VectorSize--; }
+
+        NIF void reverse()
+        {
+            if (VectorSize <= 1)
+                return;
+            for (size_t i = 0, j = VectorSize - 1; i < j; i++, j--)
+            {
+                T c = *(VectorBuffer + i);
+                *(VectorBuffer + i) = *(VectorBuffer + j);
+                *(VectorBuffer + j) = c;
+            }
+        }
+
+        NIF void reserve(size_t Capacity)
+        {
+            if (VectorBuffer == 0)
+            {
+                VectorSize = 0;
+                VectorCapacity = 0;
+            }
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR ALLOCATION: reverse( %lld )", Capacity);
+#endif
+            T *NewBuffer = new T[Capacity];
+            size_t _Size = Capacity < VectorSize ? Capacity : VectorSize;
+            for (size_t i = 0; i < _Size; i++)
+                NewBuffer[i] = VectorBuffer[i];
+            VectorCapacity = Capacity;
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR ALLOCATION: reverse( <Capacity> )->Buffer:~%lld", VectorBuffer);
+#endif
+            delete[] VectorBuffer;
+            VectorBuffer = NewBuffer;
+        }
+
+        NIF void resize(size_t Size)
+        {
+            reserve(Size);
+            VectorSize = Size;
+        }
+
+        NIF void clear()
+        {
+            VectorCapacity = 0;
+            VectorSize = 0;
+            if (VectorBuffer != nullptr)
+            {
+                delete[] VectorBuffer, VectorBuffer = nullptr;
+            }
+        }
+
+        NIF T *data() { return VectorBuffer; }
+
+        NIF T &operator[](size_t Index)
+        {
+            if (!reinterpret_cast<uintptr_t>(&VectorBuffer[Index]))
+            {
+                warn("operator[]( %lld ) is null (requested by %#lx)", Index, __builtin_return_address(0));
+                return this->null_elem();
+            }
+            return VectorBuffer[Index];
+        }
+
+        NIF vector<T> &operator=(const vector<T> &v)
+        {
+            delete[] VectorBuffer;
+            VectorSize = v.VectorSize;
+            VectorCapacity = v.VectorCapacity;
+#ifdef DEBUG_MEM_ALLOCATION
+            debug("VECTOR ALLOCATION: operator=( <vector> )->Size:%lld", VectorSize);
+#endif
+            VectorBuffer = new T[VectorSize];
+            for (size_t i = 0; i < VectorSize; i++)
+                VectorBuffer[i] = v.VectorBuffer[i];
+            return *this;
+        }
+    };
+}
+
+#endif // !__FENNIX_KERNEL_STD_VECTOR_H__
diff --git a/Kernel/include_std/stddef.h b/Kernel/include_std/stddef.h
new file mode 100644
index 00000000..f346b21e
--- /dev/null
+++ b/Kernel/include_std/stddef.h
@@ -0,0 +1,23 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_STDDEF_STUB_H__
+#define __FENNIX_KERNEL_STDDEF_STUB_H__
+
+#include <types.h>
+
+#endif // !__FENNIX_KERNEL_STDDEF_STUB_H__
diff --git a/Kernel/include_std/stdint.h b/Kernel/include_std/stdint.h
new file mode 100644
index 00000000..e03e3bec
--- /dev/null
+++ b/Kernel/include_std/stdint.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _STDINT_H
+#define _STDINT_H
+
+#endif // !_STDINT_H
diff --git a/Kernel/include_std/stdio.h b/Kernel/include_std/stdio.h
new file mode 100644
index 00000000..732ac6dc
--- /dev/null
+++ b/Kernel/include_std/stdio.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _STDIO_H
+#define _STDIO_H
+
+#endif // !_STDIO_H
diff --git a/Kernel/include_std/stdlib.h b/Kernel/include_std/stdlib.h
new file mode 100644
index 00000000..3d95cab2
--- /dev/null
+++ b/Kernel/include_std/stdlib.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _STDLIB_H
+#define _STDLIB_H
+
+#endif // !_STDLIB_H
diff --git a/Kernel/include_std/string.h b/Kernel/include_std/string.h
new file mode 100644
index 00000000..2834743f
--- /dev/null
+++ b/Kernel/include_std/string.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _STRING_H
+#define _STRING_H
+
+#endif // !_STRING_H
diff --git a/Kernel/include_std/string.hpp b/Kernel/include_std/string.hpp
new file mode 100644
index 00000000..771861fb
--- /dev/null
+++ b/Kernel/include_std/string.hpp
@@ -0,0 +1,19 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <std/string.hpp>
diff --git a/Kernel/include_std/strings.h b/Kernel/include_std/strings.h
new file mode 100644
index 00000000..ecb4e583
--- /dev/null
+++ b/Kernel/include_std/strings.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _STRINGS_H
+#define _STRINGS_H
+
+#endif // !_STRINGS_H
diff --git a/Kernel/include_std/sys/stat.h b/Kernel/include_std/sys/stat.h
new file mode 100644
index 00000000..2ff2d38c
--- /dev/null
+++ b/Kernel/include_std/sys/stat.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _SYS_STAT_H
+#define _SYS_STAT_H
+
+#endif // !_SYS_STAT_H
diff --git a/Kernel/include_std/sys/time.h b/Kernel/include_std/sys/time.h
new file mode 100644
index 00000000..eb48b447
--- /dev/null
+++ b/Kernel/include_std/sys/time.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _SYS_TIME_H
+#define _SYS_TIME_H
+
+#endif // !_SYS_TIME_H
diff --git a/Kernel/include_std/sys/types.h b/Kernel/include_std/sys/types.h
new file mode 100644
index 00000000..447b6e11
--- /dev/null
+++ b/Kernel/include_std/sys/types.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _SYS_TYPES_H
+#define _SYS_TYPES_H
+
+#endif // !_SYS_TYPES_H
diff --git a/Kernel/include_std/unistd.h b/Kernel/include_std/unistd.h
new file mode 100644
index 00000000..fd50c1ec
--- /dev/null
+++ b/Kernel/include_std/unistd.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _UNISTD_H
+#define _UNISTD_H
+
+#endif // !_UNISTD_H
diff --git a/Kernel/include_std/vector b/Kernel/include_std/vector
new file mode 100644
index 00000000..fceebaa8
--- /dev/null
+++ b/Kernel/include_std/vector
@@ -0,0 +1,19 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+#include <std/vector.hpp>
diff --git a/Kernel/include_std/wchar.h b/Kernel/include_std/wchar.h
new file mode 100644
index 00000000..9fb14d0e
--- /dev/null
+++ b/Kernel/include_std/wchar.h
@@ -0,0 +1,21 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef _WCHAR_H
+#define _WCHAR_H
+
+#endif // !_WCHAR_H
diff --git a/Kernel/ipc.h b/Kernel/ipc.h
new file mode 100644
index 00000000..74b3328a
--- /dev/null
+++ b/Kernel/ipc.h
@@ -0,0 +1,109 @@
+/*
+   BSD 3-Clause License
+
+   Copyright (c) 2023, EnderIce2
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are met:
+
+   1. Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+   3. Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+   FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+   SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+   CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+   OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef __FENNIX_KERNEL_IPC_SYSCALLS_H__
+#define __FENNIX_KERNEL_IPC_SYSCALLS_H__
+
+enum IPCCommand
+{
+    IPC_NULL,
+
+    /**
+     * @brief Create a new IPC
+     * Creating a new IPC will return a new ID for the IPC.
+     *
+     * @return The ID of the new IPC.
+     */
+    IPC_CREATE,
+
+    /**
+     * @brief Read from IPC
+     * This will read from an IPC.
+     */
+    IPC_READ,
+
+    /**
+     * @brief Write to IPC
+     * This will write to an IPC.
+     * @see Flags is used as process ID.
+     */
+    IPC_WRITE,
+
+    IPC_DELETE,
+
+    /**
+     * @brief Wait for an IPC to be ready
+     * This will wait for an IPC to be ready to read/write.
+     * If it's message passing, it will wait for a message to be received.
+     */
+    IPC_WAIT,
+
+    /**
+     * @brief Listen to a IPC
+     * @see Flags is used as a boolean
+     */
+    IPC_LISTEN,
+};
+
+/* This must be a clone of IPCType inside ipc.hpp */
+enum IPCType
+{
+    IPC_TYPE_None,
+
+    /**
+     * @brief Message Passing
+     * Message passing is a way to send messages between processes.
+     *
+     */
+    IPC_TYPE_MessagePassing,
+    IPC_TYPE_Port,
+    IPC_TYPE_SharedMemory,
+    IPC_TYPE_Pipe,
+    IPC_TYPE_Socket
+};
+
+/* This must be a clone of IPCErrorCode inside ipc.hpp */
+enum IPCErrorCode
+{
+    IPC_E_CODE_Error = -1,
+    IPC_E_CODE_Success,
+    IPC_E_CODE_NotListening,
+    IPC_E_CODE_Timeout,
+    IPC_E_CODE_InvalidCommand,
+    IPC_E_CODE_AlreadyAllocated,
+    IPC_E_CODE_NotAllocated,
+    IPC_E_CODE_IDInUse,
+    IPC_E_CODE_IDNotRegistered,
+    IPC_E_CODE_IDNotFound,
+};
+
+#endif // !__FENNIX_KERNEL_IPC_SYSCALLS_H__
diff --git a/Kernel/kernel.h b/Kernel/kernel.h
new file mode 100644
index 00000000..77edfc15
--- /dev/null
+++ b/Kernel/kernel.h
@@ -0,0 +1,80 @@
+/*
+   This file is part of Fennix Kernel.
+
+   Fennix Kernel is free software: you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation, either version 3 of
+   the License, or (at your option) any later version.
+
+   Fennix Kernel is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef __FENNIX_KERNEL_KERNEL_H__
+#define __FENNIX_KERNEL_KERNEL_H__
+
+#include <types.h>
+
+#include <boot/binfo.h>
+#ifdef __cplusplus
+#include <filesystem.hpp>
+#include <recovery.hpp>
+#include <display.hpp>
+#include <symbols.hpp>
+#include <kconfig.hpp>
+#include <net/nc.hpp>
+#include <driver.hpp>
+#include <power.hpp>
+#include <task.hpp>
+#include <time.hpp>
+#include <disk.hpp>
+#include <pci.hpp>
+#endif
+
+extern struct BootInfo bInfo;
+extern bool DebuggerIsAttached;
+#ifdef __cplusplus
+
+#ifdef DEBUG
+#define MEM_TRK_MAX_SIZE 0x100
+extern bool EnableExternalMemoryTracer;
+extern char mExtTrkLog[];
+extern LockClass mExtTrkLock;
+#endif
+
+extern Video::Display *Display;
+extern SymbolResolver::Symbols *KernelSymbolTable;
+extern Power::Power *PowerManager;
+extern PCI::PCI *PCIManager;
+extern KernelConfig Config;
+extern Tasking::Task *TaskManager;
+extern Time::time *TimeManager;
+extern VirtualFileSystem::Virtual *vfs;
+extern VirtualFileSystem::Virtual *bootanim_vfs;
+extern Driver::Driver *DriverManager;
+extern Disk::Manager *DiskManager;
+extern NetworkInterfaceManager::NetworkInterface *NIManager;
+extern Recovery::KernelRecovery *RecoveryScreen;
+extern VirtualFileSystem::Node *DevFS;
+extern VirtualFileSystem::Node *MntFS;
+extern VirtualFileSystem::Node *ProcFS;
+
+#endif // __cplusplus
+
+EXTERNC void putchar(char c);
+EXTERNC void KPrint(const char *format, ...);
+EXTERNC void Entry(struct BootInfo *Info);
+EXTERNC void BeforeShutdown(bool Reboot);
+EXTERNC void TaskingPanic();
+
+EXTERNC void KernelMainThread();
+EXTERNC void KernelShutdownThread(bool Reboot);
+EXTERNC void KST_Reboot();
+EXTERNC void KST_Shutdown();
+
+#endif // !__FENNIX_KERNEL_KERNEL_H__
diff --git a/Kernel/syscalls.h b/Kernel/syscalls.h
new file mode 100644
index 00000000..7034aba5
--- /dev/null
+++ b/Kernel/syscalls.h
@@ -0,0 +1,326 @@
+/*
+   BSD 3-Clause License
+
+   Copyright (c) 2023, EnderIce2
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions are met:
+
+   1. Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+   3. Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+   FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+   SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+   CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+   OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef __FENNIX_KERNEL_SYSCALLS_LIST_H__
+#define __FENNIX_KERNEL_SYSCALLS_LIST_H__
+
+#include <stddef.h>
+
+/**
+ * @enum NativeSyscalls
+ * Enumeration of all the native syscalls available in the kernel
+ */
+enum NativeSyscalls
+{
+    /** @brief Exit the process.
+     * @fn int Exit(int Code)
+     * This syscall is used to exit the current process with the provided exit code.
+     */
+    _Exit = 0,
+
+    /** @brief Print a message to the kernel console
+     * @fn int Print(char Char, int Index)
+     * This syscall is used to print a message to the kernel console.
+     */
+    _Print,
+
+    /** @brief Request pages of memory
+     * @fn uintptr_t RequestPages(size_t Count)
+     * This syscall is used to request a specific number of pages of memory from the kernel.
+     */
+    _RequestPages,
+
+    /** @brief Free pages of memory
+     * @fn int FreePages(uintptr_t Address, size_t Count)
+     * This syscall is used to free a specific number of pages of memory that were previously requested.
+     */
+    _FreePages,
+
+    /** @brief Detach memory address
+     * @fn int DetachAddress(uintptr_t Address)
+     * This syscall is used to detach a specific memory address from the current process.
+     */
+    _DetachAddress,
+
+    /** @brief Kernel Control
+     * @fn uintptr_t KernelCTL(enum KCtl Command, uint64_t Arg1, uint64_t Arg2, uint64_t Arg3, uint64_t Arg4)
+     * This syscall is used to control certain aspects of the kernel or get information about it.
+     */
+    _KernelCTL,
+
+    /**
+     * @brief Creates/Reads/Writes/Deletes an IPC Pipe/Shared Memory/Message Queue/etc.
+     * @fn int IPC(enum IPCCommand Command, enum IPCType Type, int ID, int Flags, void *Buffer, size_t Size)
+     * This syscall is used to create, read, write or delete an IPC Pipe/Shared Memory/Message Queue/etc.
+     */
+    _IPC,
+
+    /** @brief Open a file
+     * @fn void *FileOpen(const char *Path, uint64_t Flags)
+     * This syscall is used to open a file with the provided path and flags.
+     */
+    _FileOpen,
+
+    /** @brief Close a file
+     * @fn int FileClose(void *KernelPrivate)
+     * This syscall is used to close a file that was previously opened.
+     */
+    _FileClose,
+
+    /** @brief Read from a file
+     * @fn uint64_t FileRead(void *KernelPrivate, uint64_t Offset, uint8_t *Buffer, uint64_t Size)
+     * This syscall is used to read a specific number of bytes from a file at a specific offset.
+     */
+    _FileRead,
+
+    /** @brief Write to a file
+     * @fn uint64_t FileWrite(void *KernelPrivate, uint64_t Offset, uint8_t *Buffer, uint64_t Size)
+     * This syscall is used to write a specific number of bytes to a file at a specific offset.
+     */
+    _FileWrite,
+
+    /** @brief Seek in a file
+     * @fn
+     * This syscall is used to change the current offset in a file.
+     */
+    _FileSeek,
+
+    /** @brief Get file status
+     * @fn
+     * This syscall is used to retrieve information about a file such as its size, permissions, etc.
+     */
+    _FileStatus,
+
+    /** @brief Sleep for a specific amount of time
+     * @fn int Sleep(uint64_t Milliseconds)
+     * This syscall is used to sleep the current thread for a specific amount of time.
+     */
+    _Sleep,
+
+    /** @brief Wait for a process or a thread
+     * @fn
+     * This syscall is used to wait for a specific process or thread to terminate. It returns the exit code of the process or thread.
+     */
+    _Wait,
+
+    /** @brief Kill a process or a thread
+     * @fn
+     * This syscall is used to send a termination signal to a specific process or thread
+     */
+    _Kill,
+
+    /** @brief Spawn a new process
+     * @fn
+     * This syscall is used to create a new process with the provided path and arguments.
+     */
+    _Spawn,
+
+    /** @brief Spawn a new thread
+     * @fn
+     * This syscall is used to create a new thread within the current process with the provided function and arguments.
+     */
+    _SpawnThread,
+
+    /** @brief Get thread list of a process
+     * @fn
+     * This syscall is used to retrieve a list of all the threads within a specific process.
+     */
+    _GetThreadListOfProcess,
+
+    /** @brief Get current process
+     * @fn
+     * This syscall is used to retrieve information about the current process.
+     */
+    _GetCurrentProcess,
+
+    /** @brief Get current thread
+     * @fn
+     * This syscall is used to retrieve information about the current thread.
+     */
+    _GetCurrentThread,
+
+    /** @brief Get process by PID
+     * @fn
+     * This syscall is used to retrieve information about a specific process by its PID.
+     */
+    _GetProcessByPID,
+
+    /** @brief Get thread by TID
+     * @fn
+     * This syscall is used to retrieve information about a specific thread by its TID.
+     */
+    _GetThreadByTID,
+
+    /** @brief Kill a process
+     * @fn
+     * This syscall is used to send a termination signal to a specific process.
+     */
+    _KillProcess,
+
+    /** @brief Kill a thread
+     * @fn
+     * This syscall is used to send a termination signal to a specific thread.
+     */
+    _KillThread,
+
+    /** @brief Reserved syscall */
+    _SysReservedCreateProcess,
+
+    /** @brief Reserved syscall */
+    _SysReservedCreateThread,
+};
+
+/**
+ * @enum SyscallsErrorCodes
+ * Enumeration of all the error codes that can be returned by a syscall
+ */
+enum SyscallsErrorCodes
+{
+    /**
+     * @brief Access denied
+     * This error code is returned when the current thread does not have the required permissions to perform the requested operation.
+     */
+    SYSCALL_ACCESS_DENIED = -0xDEADACC,
+    /**
+     * @brief Invalid argument
+     * This error code is returned when an invalid argument is passed to a syscall.
+     */
+    SYSCALL_INVALID_ARGUMENT = -0xBADAEE,
+    /**
+     * @brief Invalid syscall
+     * This error code is returned when an invalid syscall number is passed to the syscall handler.
+     */
+    SYSCALL_INVALID_SYSCALL = -0xBAD55CA,
+    /**
+     * @brief Internal error
+     * This error code is returned when an internal error occurs in the syscall handler.
+     */
+    SYSCALL_INTERNAL_ERROR = -0xBADBAD5,
+    /**
+     * @brief Not implemented
+     * This error code is returned when a syscall is not implemented.
+     */
+    SYSCALL_NOT_IMPLEMENTED = -0xBAD5EED,
+    /**
+     * @brief Generic error
+     * This error code is returned when a syscall fails for an unknown reason.
+     */
+    SYSCALL_ERROR = -1,
+    /**
+     * @brief Success
+     * This error code is returned when a syscall succeeds.
+     */
+    SYSCALL_OK = 0,
+};
+
+static inline bool IsSyscallError(long ret)
+{
+    return ret < 0;
+}
+
+static inline long syscall0(long syscall)
+{
+    unsigned long ret;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+static inline long syscall1(long syscall, long arg1)
+{
+    unsigned long ret;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall), "D"(arg1)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+static inline long syscall2(long syscall, long arg1, long arg2)
+{
+    unsigned long ret;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall), "D"(arg1), "S"(arg2)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+static inline long syscall3(long syscall, long arg1, long arg2, long arg3)
+{
+    unsigned long ret;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall), "D"(arg1), "S"(arg2), "d"(arg3)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+static inline long syscall4(long syscall, long arg1, long arg2, long arg3, long arg4)
+{
+    unsigned long ret;
+    register long r10 __asm__("r10") = arg4;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall), "D"(arg1), "S"(arg2), "d"(arg3), "r"(r10)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+static inline long syscall5(long syscall, long arg1, long arg2, long arg3, long arg4, long arg5)
+{
+    unsigned long ret;
+    register long r10 __asm__("r10") = arg4;
+    register long r8 __asm__("r8") = arg5;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall), "D"(arg1), "S"(arg2), "d"(arg3), "r"(r10), "r"(r8)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+static inline long syscall6(long syscall, long arg1, long arg2, long arg3, long arg4, long arg5, long arg6)
+{
+    unsigned long ret;
+    register long r10 __asm__("r10") = arg4;
+    register long r8 __asm__("r8") = arg5;
+    register long r9 __asm__("r9") = arg6;
+    __asm__ __volatile__("syscall"
+                         : "=a"(ret)
+                         : "a"(syscall), "D"(arg1), "S"(arg2), "d"(arg3), "r"(r10), "r"(r8), "r"(r9)
+                         : "rcx", "r11", "memory");
+    return ret;
+}
+
+#endif // !__FENNIX_KERNEL_SYSCALLS_LIST_H__