legal: Usage policy V2.0

Note: versions >= x.x.1 require users to comply with POLICY.md.

.github/workflows/nightly.yml

@@ -0,0 +1,62 @@
+name: Nightly Build
+
+on:
+  schedule:
+    - cron: "0 0 * * *"
+  workflow_dispatch:
+
+permissions:
+  contents: write
+
+jobs:
+  build-and-release:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout repository
+        uses: actions/checkout@v4
+
+      - name: Install build dependencies
+        run: |
+          sudo apt-get update
+          sudo apt-get install -y --no-install-recommends \
+            make \
+            gcc-x86-64-linux-gnu \
+            binutils-x86-64-linux-gnu \
+            nasm \
+            xorriso
+          sudo ln -sf /usr/bin/x86_64-linux-gnu-gcc /usr/local/bin/x86_64-elf-gcc
+          sudo ln -sf /usr/bin/x86_64-linux-gnu-ld /usr/local/bin/x86_64-elf-ld
+
+      - name: Build ISO
+        run: make -j4
+
+      - name: Update nightly tag
+        run: |
+          git config user.name "github-actions[bot]"
+          git config user.email "41898282+github-actions[bot]@users.noreply.github.com"
+          git tag -fa nightly -m "Nightly build ${GITHUB_SHA}" "${GITHUB_SHA}"
+          git push origin refs/tags/nightly --force
+
+      - name: Prepare release metadata
+        id: metadata
+        run: |
+          echo "short_sha=${GITHUB_SHA::7}" >> "$GITHUB_OUTPUT"
+
+      - name: Publish nightly release asset
+        uses: softprops/action-gh-release@v2
+        with:
+          tag_name: nightly
+          name: Nightly Build (${{ steps.metadata.outputs.short_sha }})
+          body: |
+            This is an automated nightly build of BoredOS, this is not a final release and may be unstable.
+            
+            Built from commit:
+            - Full hash: `${{ github.sha }}`
+            - Short hash: `${{ steps.metadata.outputs.short_sha }}`
+          prerelease: true
+          make_latest: false
+          files: |
+            boredos.iso
+          overwrite_files: true
+        env:
+          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}

Makefile

@@ -17,35 +17,59 @@ ISO_DIR = iso_root
 KERNEL_ELF = $(BUILD_DIR)/boredos.elf
 ISO_IMAGE = boredos.iso
 
+BLUE  = \033[1;34m
+GREEN = \033[1;32m
+YELLOW= \033[1;33m
+RESET = \033[0m
+
+define PRINT_STEP
+	@printf ""
+	@printf "\n$(BLUE)============================================================$(RESET)\n"
+	@printf "$(BLUE)== %s$(RESET)\n" "$(1)"
+	@printf "$(BLUE)============================================================$(RESET)\n"
+endef
+
+DOCK_COLLOID_ICONS = $(shell sed -n 's/^[[:space:]]*{"\([^"]*\.png\)",[[:space:]]*DOCK_ICON_UNTRIED.*/\1/p' $(SRC_DIR)/wm/wm.c)
+USERLAND_COLLOID_ICONS = $(shell { \
+	find $(SRC_DIR)/userland -type f -name '*.c' ! -path '*/third_party/*' -exec grep -hoE '"[^"]+\.png"' {} + 2>/dev/null; \
+	find $(SRC_DIR)/userland -type f -name '*.h' ! -path '*/third_party/*' ! -name 'stb_image.h' -exec grep -hoE '"[^"]+\.png"' {} + 2>/dev/null; \
+} | sed 's/"//g' | sed 's@.*/@@' | sort -u)
+USERLAND_METADATA_ICONS = $(shell { \
+	find $(SRC_DIR)/userland -type f -name '*.c' -exec sed -n 's@^[[:space:]]*//[[:space:]]*BOREDOS_APP_ICONS:[[:space:]]*@@p' {} + 2>/dev/null; \
+} | tr ';' '\n' | sed 's@.*/@@' | sed '/^[[:space:]]*$$/d' | sort -u)
+COLLOID_ICONS = $(sort $(DOCK_COLLOID_ICONS) $(USERLAND_COLLOID_ICONS) $(USERLAND_METADATA_ICONS) xterm.png)
+
 C_SOURCES = $(wildcard $(SRC_DIR)/core/*.c) \
             $(wildcard $(SRC_DIR)/sys/*.c) \
             $(wildcard $(SRC_DIR)/mem/*.c) \
             $(wildcard $(SRC_DIR)/dev/*.c) \
+            $(wildcard $(SRC_DIR)/input/*.c) \
             $(wildcard $(SRC_DIR)/net/*.c) \
             $(wildcard $(SRC_DIR)/net/nic/*.c) \
             $(wildcard $(SRC_DIR)/fs/*.c) \
             $(wildcard $(SRC_DIR)/wm/*.c) \
-            $(wildcard $(SRC_DIR)/net/lwip/core/*.c) \
-            $(wildcard $(SRC_DIR)/net/lwip/core/ipv4/*.c) \
-			$(SRC_DIR)/net/lwip/netif/ethernet.c \
-			$(SRC_DIR)/net/lwip/netif/bridgeif.c
+			$(wildcard $(SRC_DIR)/net/third_party/lwip/core/*.c) \
+			$(wildcard $(SRC_DIR)/net/third_party/lwip/core/ipv4/*.c) \
+			$(SRC_DIR)/net/third_party/lwip/netif/ethernet.c \
+			$(SRC_DIR)/net/third_party/lwip/netif/bridgeif.c
 
 ASM_SOURCES = $(wildcard $(SRC_DIR)/arch/*.asm)
 OBJ_FILES = $(patsubst $(SRC_DIR)/core/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/core/*.c)) \
             $(patsubst $(SRC_DIR)/sys/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/sys/*.c)) \
             $(patsubst $(SRC_DIR)/mem/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/mem/*.c)) \
             $(patsubst $(SRC_DIR)/dev/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/dev/*.c)) \
+            $(patsubst $(SRC_DIR)/input/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/input/*.c)) \
             $(patsubst $(SRC_DIR)/net/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/net/*.c)) \
             $(patsubst $(SRC_DIR)/net/nic/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/net/nic/*.c)) \
             $(patsubst $(SRC_DIR)/fs/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/fs/*.c)) \
             $(patsubst $(SRC_DIR)/wm/%.c, $(BUILD_DIR)/%.o, $(wildcard $(SRC_DIR)/wm/*.c)) \
-            $(patsubst $(SRC_DIR)/net/lwip/%.c, $(BUILD_DIR)/lwip/%.o, $(filter $(SRC_DIR)/net/lwip/%.c, $(C_SOURCES))) \
+			$(patsubst $(SRC_DIR)/net/third_party/lwip/%.c, $(BUILD_DIR)/lwip/%.o, $(filter $(SRC_DIR)/net/third_party/lwip/%.c, $(C_SOURCES))) \
             $(patsubst $(SRC_DIR)/arch/%.asm, $(BUILD_DIR)/%.o, $(ASM_SOURCES))
 
 CFLAGS = -g -O2 -pipe -Wall -Wextra -std=gnu11 -ffreestanding \
          -fno-stack-protector -fno-stack-check -fno-lto -fPIE \
          -m64 -march=x86-64 -msse -msse2 -mstackrealign -mno-red-zone \
-         -I$(SRC_DIR) -I$(SRC_DIR)/net/lwip -I$(SRC_DIR)/core -I$(SRC_DIR)/sys -I$(SRC_DIR)/mem -I$(SRC_DIR)/dev -I$(SRC_DIR)/net -I$(SRC_DIR)/net/nic -I$(SRC_DIR)/fs -I$(SRC_DIR)/wm
+		 -I$(SRC_DIR) -I$(SRC_DIR)/net/third_party/lwip -I$(SRC_DIR)/core -I$(SRC_DIR)/sys -I$(SRC_DIR)/mem -I$(SRC_DIR)/dev -I$(SRC_DIR)/net -I$(SRC_DIR)/net/nic -I$(SRC_DIR)/fs -I$(SRC_DIR)/wm  -I$(SRC_DIR)/input
 
 LDFLAGS = -m elf_x86_64 -nostdlib -static -pie --no-dynamic-linker \
           -z text -z max-page-size=0x1000 -T linker.ld
@@ -55,164 +79,268 @@ NASMFLAGS = -f elf64
 LIMINE_VERSION = 10.8.2
 LIMINE_URL_BASE = https://github.com/limine-bootloader/limine/raw/v$(LIMINE_VERSION)
 
-.PHONY: all clean run limine-setup
+.PHONY: all clean run limine-setup run-windows run-mac run-linux
 
-all: $(ISO_IMAGE)
+all:
+	$(call PRINT_STEP,STARTING BOREDOS BUILD)
+	$(MAKE) $(ISO_IMAGE)
+	$(call PRINT_STEP,BUILD COMPLETE)
 
 $(BUILD_DIR):
+	$(call PRINT_STEP,CREATING BUILD DIRECTORY)
 	mkdir -p $(BUILD_DIR)
 	mkdir -p $(BUILD_DIR)
 
 limine-setup:
+	$(call PRINT_STEP,SETTING UP LIMINE)
 	@if [ ! -f limine/limine-bios.sys ]; then \
-		echo "Limine binaries missing or invalid. Cloning v$(LIMINE_VERSION)-binary..."; \
+		printf "$(YELLOW)[LIMINE] Limine binaries missing or invalid. Cloning v$(LIMINE_VERSION)-binary...$(RESET)"; \
 		rm -rf limine; \
 		git clone https://github.com/limine-bootloader/limine.git --branch=v$(LIMINE_VERSION)-binary --depth=1 limine; \
+	else \
+		printf "$(YELLOW)[LIMINE] Existing Limine binaries found.$(RESET)"; \
 	fi
 	@if [ ! -f $(SRC_DIR)/core/limine.h ]; then \
-		echo "Copying limine.h..."; \
+		printf "$(YELLOW)[LIMINE] Copying limine.h...$(RESET)"; \
 		cp limine/limine.h $(SRC_DIR)/core/limine.h; \
+	else \
+		printf "$(YELLOW)[LIMINE] limine.h already present.$(RESET)"; \
 	fi
-	@echo "Building Limine host utility..."; \
+	@printf "$(YELLOW)[LIMINE] Building Limine host utility...$(RESET)"
 	$(MAKE) -C limine
+	@printf "$(GREEN)[OK] Limine setup complete.$(RESET)"
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET) $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/core/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[core] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/sys/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[sys] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/mem/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[mem] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/dev/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[dev] $< -> $@"
+	mkdir -p $(dir $@)
+	$(CC) $(CFLAGS) -c $< -o $@
+	
+$(BUILD_DIR)/%.o: $(SRC_DIR)/input/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[input] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/net/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[net] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/net/nic/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[net/nic] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/fs/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[fs] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/wm/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[wm] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
-$(BUILD_DIR)/lwip/%.o: $(SRC_DIR)/net/lwip/%.c | $(BUILD_DIR) limine-setup
+$(BUILD_DIR)/lwip/%.o: $(SRC_DIR)/net/third_party/lwip/%.c | $(BUILD_DIR) limine-setup
+	@printf "$(YELLOW)[CC]$(RESET)[lwIP] $< -> $@"
 	mkdir -p $(dir $@)
 	$(CC) $(CFLAGS) -c $< -o $@
 
 $(BUILD_DIR)/%.o: $(SRC_DIR)/arch/%.asm | $(BUILD_DIR)
+	@printf "$(YELLOW)[ASM]$(RESET) $< -> $@"
 	$(NASM) $(NASMFLAGS) $< -o $@
 
 $(BUILD_DIR)/test_syscall.o: $(SRC_DIR)/arch/test_syscall.asm | $(BUILD_DIR)
+	@printf "$(YELLOW)[ASM][test_syscall]$(RESET) $< -> $@"
 	$(NASM) $(NASMFLAGS) $< -o $@
 
 $(BUILD_DIR)/user_test.o: $(SRC_DIR)/arch/user_test.asm | $(BUILD_DIR)
+	@printf "$(YELLOW)[ASM][user_test]$(RESET) $< -> $@"
 	$(NASM) $(NASMFLAGS) $< -o $@
 
 $(BUILD_DIR)/process_asm.o: $(SRC_DIR)/arch/process_asm.asm | $(BUILD_DIR)
+	@printf "$(YELLOW)[ASM][process]$(RESET) $< -> $@"
 	$(NASM) $(NASMFLAGS) $< -o $@
 
 $(KERNEL_ELF): $(OBJ_FILES)
+	$(call PRINT_STEP,LINKING KERNEL)
+	@printf "$(YELLOW)[LD]$(RESET) Linking kernel ELF: $@"
 	$(LD) $(LDFLAGS) -o $@ $(OBJ_FILES)
+	@printf "$(GREEN)[OK]$(RESET) Kernel ELF built: $@"
+	$(call PRINT_STEP,BUILDING USERLAND)
 	$(MAKE) -C $(SRC_DIR)/userland
+	@printf "$(GREEN)[OK]$(RESET) Userland build complete."
 
 $(BUILD_DIR)/initrd.tar: $(KERNEL_ELF)
+	$(call PRINT_STEP,BUILDING INITRD)
+	@printf "$(YELLOW)[INITRD]$(RESET) Cleaning previous initrd directory..."
 	rm -rf $(BUILD_DIR)/initrd
+
+	@printf "$(YELLOW)[INITRD]$(RESET) Creating directory structure..."
 	mkdir -p $(BUILD_DIR)/initrd/bin
 	mkdir -p $(BUILD_DIR)/initrd/Library/images/Wallpapers
 	mkdir -p $(BUILD_DIR)/initrd/Library/images/gif
+	mkdir -p $(BUILD_DIR)/initrd/Library/images/icons/colloid
 	mkdir -p $(BUILD_DIR)/initrd/Library/Fonts/Emoji
 	mkdir -p $(BUILD_DIR)/initrd/Library/DOOM
 	mkdir -p $(BUILD_DIR)/initrd/Library/bsh
 	mkdir -p $(BUILD_DIR)/initrd/docs
 
+	@printf "$(YELLOW)[COPY]$(RESET) Userland binaries..."
 	@for f in $(SRC_DIR)/userland/bin/*.elf; do \
-		if [ -f "$$f" ]; then cp "$$f" $(BUILD_DIR)/initrd/bin/; fi \
+		if [ -f "$$f" ]; then \
+			printf "  -> $$f"; \
+			cp "$$f" $(BUILD_DIR)/initrd/bin/; \
+		fi \
 	done
+
+	@printf "$(YELLOW)[COPY]$(RESET) Wallpapers..."
 	@for f in $(SRC_DIR)/images/wallpapers/*; do \
-		if [ -f "$$f" ]; then cp "$$f" $(BUILD_DIR)/initrd/Library/images/Wallpapers/; fi \
+		if [ -f "$$f" ]; then \
+			printf "  -> $$f"; \
+			cp "$$f" $(BUILD_DIR)/initrd/Library/images/Wallpapers/; \
+		fi \
 	done
+
+	@printf "$(YELLOW)[COPY]$(RESET) GIF assets..."
 	@for f in $(SRC_DIR)/images/gif/*.gif; do \
-		if [ -f "$$f" ]; then cp "$$f" $(BUILD_DIR)/initrd/Library/images/gif/; fi \
+		if [ -f "$$f" ]; then \
+			printf "  -> $$f"; \
+			cp "$$f" $(BUILD_DIR)/initrd/Library/images/gif/; \
+		fi \
 	done
+
+	@printf "$(YELLOW)[COPY]$(RESET) Colloid icons..."
+	@for f in $(COLLOID_ICONS); do \
+		src="$(SRC_DIR)/images/icons/colloid/$$f"; \
+		if [ -f "$$src" ]; then \
+			printf "  -> $$src"; \
+			cp "$$src" $(BUILD_DIR)/initrd/Library/images/icons/colloid/; \
+		fi \
+	done
+
+	@printf "$(YELLOW)[COPY]$(RESET) Fonts..."
 	@for f in $(SRC_DIR)/fonts/*.ttf; do \
-		if [ -f "$$f" ]; then cp "$$f" $(BUILD_DIR)/initrd/Library/Fonts/; fi \
+		if [ -f "$$f" ]; then \
+			printf "  -> $$f"; \
+			cp "$$f" $(BUILD_DIR)/initrd/Library/Fonts/; \
+		fi \
 	done
+
+	@printf "$(YELLOW)[COPY]$(RESET) Emoji fonts..."
 	@for f in $(SRC_DIR)/fonts/Emoji/*.ttf; do \
-		if [ -f "$$f" ]; then cp "$$f" $(BUILD_DIR)/initrd/Library/Fonts/Emoji/; fi \
+		if [ -f "$$f" ]; then \
+			printf "  -> $$f"; \
+			cp "$$f" $(BUILD_DIR)/initrd/Library/Fonts/Emoji/; \
+		fi \
 	done
-	@if [ -f $(SRC_DIR)/library/bsh/bshrc ]; then cp $(SRC_DIR)/library/bsh/bshrc $(BUILD_DIR)/initrd/Library/bsh/; fi
-	@if [ -f $(SRC_DIR)/library/bsh/startup.bsh ]; then cp $(SRC_DIR)/library/bsh/startup.bsh $(BUILD_DIR)/initrd/Library/bsh/; fi
-	@if [ -f $(SRC_DIR)/library/bsh/boot.bsh ]; then cp $(SRC_DIR)/library/bsh/boot.bsh $(BUILD_DIR)/initrd/Library/bsh/; fi
-	@if [ -f $(SRC_DIR)/userland/games/doom/doom1.wad ]; then cp $(SRC_DIR)/userland/games/doom/doom1.wad $(BUILD_DIR)/initrd/Library/DOOM/; fi
+
+	@printf "$(YELLOW)[COPY]$(RESET) bsh configuration..."
+	@if [ -f $(SRC_DIR)/library/bsh/bshrc ]; then printf "  -> bshrc"; cp $(SRC_DIR)/library/bsh/bshrc $(BUILD_DIR)/initrd/Library/bsh/; fi
+	@if [ -f $(SRC_DIR)/library/bsh/startup.bsh ]; then printf "  -> startup.bsh"; cp $(SRC_DIR)/library/bsh/startup.bsh $(BUILD_DIR)/initrd/Library/bsh/; fi
+	@if [ -f $(SRC_DIR)/library/bsh/boot.bsh ]; then printf "  -> boot.bsh"; cp $(SRC_DIR)/library/bsh/boot.bsh $(BUILD_DIR)/initrd/Library/bsh/; fi
+
+	@printf "$(YELLOW)[COPY]$(RESET) DOOM assets..."
+	@if [ -f $(SRC_DIR)/userland/games/doom/doom1.wad ]; then printf "  -> doom1.wad"; cp $(SRC_DIR)/userland/games/doom/doom1.wad $(BUILD_DIR)/initrd/Library/DOOM/; fi
+
+	@printf "$(YELLOW)[COPY]$(RESET) Documentation..."
 	@for f in $$(find docs -name '*.md' 2>/dev/null); do \
 		if [ -f "$$f" ]; then \
+			printf "  -> $$f"; \
 			dir=$$(dirname "$$f"); \
 			mkdir -p $(BUILD_DIR)/initrd/"$$dir"; \
 			cp "$$f" $(BUILD_DIR)/initrd/"$$dir"/; \
 		fi \
 	done
-	@if [ -f README.md ]; then cp README.md $(BUILD_DIR)/initrd/; fi
-	@if [ -f LICENSE ]; then cp LICENSE $(BUILD_DIR)/initrd/; fi
-	@if [ -f limine.conf ]; then cp limine.conf $(BUILD_DIR)/initrd/; fi
 
+	@printf "$(YELLOW)[COPY]$(RESET) Root files..."
+	@if [ -f README.md ]; then printf "  -> README.md"; cp README.md $(BUILD_DIR)/initrd/; fi
+	@if [ -f LICENSE ]; then printf "  -> LICENSE"; cp LICENSE $(BUILD_DIR)/initrd/; fi
+	@if [ -f limine.conf ]; then printf "  -> limine.conf"; cp limine.conf $(BUILD_DIR)/initrd/; fi
+	
+	@printf "$(YELLOW)[TAR]$(RESET) Creating initrd.tar..."
 	cd $(BUILD_DIR)/initrd && COPYFILE_DISABLE=1 tar --exclude="._*" -cf ../initrd.tar *
+	@printf "$(GREEN)[OK]$(RESET) Initrd created: $(BUILD_DIR)/initrd.tar"
 
 $(ISO_IMAGE): $(KERNEL_ELF) $(BUILD_DIR)/initrd.tar limine.conf limine-setup
+	$(call PRINT_STEP,CREATING ISO IMAGE)
+	@printf "$(YELLOW)[ISO]$(RESET) Cleaning previous ISO root..."
 	rm -rf $(ISO_DIR)
+
+	@printf "$(YELLOW)[ISO]$(RESET) Creating ISO directory structure..."
 	mkdir -p $(ISO_DIR)
 	mkdir -p $(ISO_DIR)/EFI/BOOT
 	
+	@printf "$(YELLOW)[COPY]$(RESET) Kernel ELF..."
 	cp $(KERNEL_ELF) $(ISO_DIR)/
+
+	@printf "$(YELLOW)[COPY]$(RESET) Limine config..."
 	cp limine.conf $(ISO_DIR)/
 	
+	@printf "$(YELLOW)[COPY]$(RESET) Initrd..."
 	cp $(BUILD_DIR)/initrd.tar $(ISO_DIR)/
-	echo "    module_path: boot():/initrd.tar" >> $(ISO_DIR)/limine.conf
 
-	@if [ -f splash.jpg ]; then cp splash.jpg $(ISO_DIR)/; fi
+	@printf "$(YELLOW)[CONFIG]$(RESET) Adding initrd module path..."
+	printf "    module_path: boot():/initrd.tar" >> $(ISO_DIR)/limine.conf
 	
+	@printf "$(YELLOW)[COPY]$(RESET) Optional splash image..."
+	@if [ -f splash.jpg ]; then printf "  -> splash.jpg"; cp splash.jpg $(ISO_DIR)/; else printf "  -> no splash.jpg found"; fi
+	
+	@printf "$(YELLOW)[COPY]$(RESET) Limine boot files..."
 	cp limine/limine-bios.sys $(ISO_DIR)/
 	cp limine/limine-bios-cd.bin $(ISO_DIR)/
 	cp limine/limine-uefi-cd.bin $(ISO_DIR)/
 	
+	@printf "$(YELLOW)[COPY]$(RESET) EFI bootloaders..."
 	cp limine/BOOTX64.EFI $(ISO_DIR)/EFI/BOOT/
 	cp limine/BOOTIA32.EFI $(ISO_DIR)/EFI/BOOT/
 
+	$(call PRINT_STEP,GENERATING BOOTABLE ISO)
 	$(XORRISO) -as mkisofs -R -J -b limine-bios-cd.bin \
 		-no-emul-boot -boot-load-size 4 -boot-info-table \
 		--efi-boot limine-uefi-cd.bin \
 		-efi-boot-part --efi-boot-image --protective-msdos-label \
 		$(ISO_DIR) -o $(ISO_IMAGE)
 	
+	@printf "$(YELLOW)[LIMINE]$(RESET) Installing BIOS bootloader..."
 	./limine/limine bios-install $(ISO_IMAGE)
+	@printf "$(GREEN)[OK]$(RESET) ISO image ready: $(ISO_IMAGE)"
 
 clean:
+	$(call PRINT_STEP,CLEANING BUILD OUTPUT)
 	rm -rf $(BUILD_DIR) $(ISO_DIR) $(ISO_IMAGE)
 	$(MAKE) -C $(SRC_DIR)/userland clean
+	@printf "$(GREEN)[OK]$(RESET) Clean complete."
 
 run-windows: $(ISO_IMAGE)
+	$(call PRINT_STEP,RUNNING BOREDOS IN QEMU ON WINDOWS)
 	qemu-system-x86_64 -m 4G -serial stdio -cdrom $< -boot d \
 	    -smp 4 \
-		-audiodev coreaudio,id=audio0 -machine pcspk-audiodev=audio0 \
+		-audiodev dsound,id=audio0 -machine pcspk-audiodev=audio0 \
 		-vga std -global VGA.xres=1920 -global VGA.yres=1080 \
 		-drive file=disk.img,format=raw,file.locking=off 
+
 run-mac: $(ISO_IMAGE)
+	$(call PRINT_STEP,RUNNING BOREDOS IN QEMU ON MACOS)
 	qemu-system-x86_64 -m 4G -serial stdio -cdrom $< -boot d \
 	    -smp 4 \
 		-audiodev coreaudio,id=audio0 -machine pcspk-audiodev=audio0 \
@@ -220,7 +348,9 @@ run-mac: $(ISO_IMAGE)
 		-display cocoa,show-cursor=off \
 		-drive file=disk.img,format=raw,file.locking=off \
 		-cpu max
+
 run-linux: $(ISO_IMAGE)
+	$(call PRINT_STEP,RUNNING BOREDOS IN QEMU ON LINUX)
 	qemu-system-x86_64 -m 4G -serial stdio -cdrom $< -boot d \
 	    -smp 4 \
 		-audiodev pa,id=audio0 -machine pcspk-audiodev=audio0 \
@@ -228,4 +358,3 @@ run-linux: $(ISO_IMAGE)
 		-display gtk,show-cursor=off \
 		-drive file=disk.img,format=raw,file.locking=off \
 		-cpu max
-

POLICY.md

@@ -0,0 +1,154 @@
+# BoredOS — Usage Policy & Legal Notice
+
+Version 2.0 | Last updated: May 2026
+
+---
+
+## 1. Purpose of This Document
+
+This document provides additional context about the intended use of BoredOS and outlines important legal and practical considerations.
+
+**It is not a software license.**  
+BoredOS is licensed exclusively under the GNU General Public License v3.0 (GPLv3), which governs your rights to use, modify, and distribute the software.
+
+In the event of any conflict, the GPLv3 takes full precedence.
+
+---
+
+## 2. License
+
+BoredOS is free software released under the **GNU General Public License v3.0 (GPLv3)**.
+
+You are free to:
+- Use the software for any purpose
+- Study and modify the source code
+- Redistribute original or modified versions
+
+A copy of the GPLv3 is provided in the [`LICENSE`](./LICENSE) file.
+
+---
+
+## 3. No Age Verification or Regulatory Features
+
+BoredOS is designed as a **local operating system** and:
+
+- Does not implement **age verification**
+- Does not implement **age-gating**
+- Does not perform **identity checks**
+- Does not collect or process **personal data**
+
+There are currently no plans to introduce such features.
+
+---
+
+## 4. Responsibility for Legal Compliance
+
+Laws and regulations vary between jurisdictions and may apply differently depending on how software is used or distributed.
+
+**You are solely responsible for ensuring that your use, distribution, or deployment of BoredOS complies with applicable laws and regulations in your jurisdiction.**
+
+This includes, but is not limited to, laws relating to:
+
+- Child safety and age-appropriate design  
+- Data protection and privacy  
+- Software distribution and platform obligations  
+
+If your use case requires features that BoredOS does not provide (such as age verification), you are responsible for implementing those features yourself or choosing alternative software.
+
+---
+
+## 5. No Representation of Legal Compliance
+
+The author makes **no representation or warranty** that BoredOS complies with any specific legal or regulatory framework, including but not limited to:
+
+- The California Age-Appropriate Design Code Act (AB 2273)  
+- The Children’s Online Privacy Protection Act (COPPA)  
+- The UK Age Appropriate Design Code (Children’s Code)  
+- Any similar laws in other jurisdictions  
+
+BoredOS is general-purpose software and is not designed or certified for compliance with regulatory regimes.
+
+---
+
+## 6. No Monitoring or Enforcement
+
+BoredOS:
+
+- Does not track users  
+- Does not verify location or identity  
+- Does not enforce jurisdiction-specific restrictions  
+
+The author has no technical ability to monitor or control how the software is used.
+
+---
+
+## 7. Privacy
+
+**BoredOS collects no data.**
+
+- No telemetry  
+- No analytics  
+- No crash reporting  
+- No accounts  
+- No background network communication  
+
+All operation is local to the user’s device.
+
+The source code is hosted on GitHub, which is operated by GitHub, Inc. Their data practices are governed by their own privacy policy.
+
+---
+
+## 8. Disclaimer of Warranty
+
+BoredOS is provided **"as is"**, without warranty of any kind, express or implied, including:
+
+- Merchantability  
+- Fitness for a particular purpose  
+- Non-infringement  
+
+The author does not guarantee that:
+
+- The software is free of bugs or vulnerabilities  
+- The software will work on any specific hardware  
+- The software is suitable for any particular use case  
+
+---
+
+## 9. Limitation of Liability
+
+To the maximum extent permitted by applicable law, the author shall not be liable for:
+
+- Data loss  
+- Hardware damage  
+- Loss of profits  
+- Business interruption  
+- Any indirect or consequential damages  
+
+Nothing in this section excludes liability where such exclusion is not permitted by law.
+
+---
+
+## 10. Trademarks and Attribution
+
+"BoredOS" and associated branding may not be used to endorse or promote derived products without prior permission.
+
+This does not limit your rights under the GPLv3, but applies to branding and representation.
+
+---
+
+## 11. Changes to This Document
+
+This document may be updated to reflect changes in legal context or project direction.
+
+The latest version will always be available in the repository.  
+Previous versions will remain accessible via version history.
+
+---
+
+## 12. Contact
+
+For questions or concerns, open an issue on the GitHub repository or contact the author via email at chris@boreddev.nl. 
+
+---
+
+*BoredOS Usage Policy v2.0 — May 2026*

README.md

@@ -7,6 +7,7 @@
   [![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](https://www.gnu.org/licenses/gpl-3.0)
   ![Platform: x86_64](https://img.shields.io/badge/Platform-x86_64-lightgrey)
   ![Status: Active](https://img.shields.io/badge/Status-Active-brightgreen)
+  ![GitHub all releases](https://img.shields.io/github/downloads/boreddevnl/BoredOS/total?color=brightgreen)
 </div>
 
 ---
@@ -34,7 +35,7 @@ BoredOS is a x86_64 operating system featuring a custom Desktop Environment (DE)
 ### Graphical User Interface
 * **BoredWM:** A custom Window Manager with drag-and-drop, mouse-centered interaction.
 * **Customization:** Adjustable UI to suit your aesthetic.
-* **Media Support:** Built-in image decoding.
+* **Media Support:** Built-in image decoding. (PNG, GIF, JPEG, TGA, BMP)
 
 ### Included Applications
 * **Productivity:** GUI Text Editor calculator, Markdown Viewer, a simple browser and BoredWord.
@@ -66,9 +67,9 @@ If you find this project interesting or helpful, consider fueling the developmen
 
 ---
 
-## ⚠️ Project Disclaimer & Heritage
+## Project Disclaimer & Heritage
 
-**BoredOS** is the successor to **BrewKernel**, a project initiated in 2023. 
+**BoredOS** is the successor to **[BrewKernel](https://github.com/boreddevnl/brewkernel)**, a project initiated in 2023. 
 
 While BrewKernel served as the foundational learning ground for this OS, it has been officially **deprecated and archived**. It no longer receives updates, bug fixes, or pull request reviews. BoredOS represents a complete architectural reboot, applying years of lessons learned to create a cleaner, more modular, and more capable system.
 
@@ -77,9 +78,14 @@ While BrewKernel served as the foundational learning ground for this OS, it has
 
 ---
 
+## Contributors
+
+- **BoredDevNL** — Project creator and lead maintainer.
+- **Lluciocc** — Contributor.
+
 ## License
 
-**Copyright (C) 2024-2026 boreddevnl**
+**Copyright (C) 2023-2026 boreddevnl**
 
 Distributed under the **GNU General Public License v3**. See the `LICENSE` file for details. 
 

docs/README.md

@@ -7,28 +7,55 @@
 
 Welcome to the documentation for BoredOS! This directory contains detailed guides on how the OS functions, how to build it, and how to develop applications for it.
 
-## 📚 Table of Contents
+## Table of Contents
 
 The documentation is organized into three main categories:
 
-### 1. 🏗️ [Architecture](architecture/)
+### 1. [Architecture](architecture/)
 Explains the logical layout of the kernel and internal components.
--   [`Core`](architecture/core.md): Kernel source layout and the boot process (Limine, Multiboot2).
--   [`Memory`](architecture/memory.md): Physical Memory Management (PMM) and Virtual Memory Management (VMM).
--   [`Filesystem`](architecture/filesystem.md): Virtual File System (VFS) and the RAM-based FAT32 simulation.
--   [`Window Manager`](architecture/window_manager.md): How the built-in Window Manager natively handles graphics, events, and compositing.
 
-### 2. 🔨 [Building and Deployment](build/)
+#### System
+-   [`Core`](architecture/system/core.md): Kernel source layout and the boot process (Limine, Multiboot2).
+-   [`Processes & Scheduling`](architecture/system/processes.md): Multitasking, context switching, and ELF loading.
+-   [`Interrupts & Exceptions`](architecture/system/interrupts.md): IDT, GDT, and exception handling.
+
+#### Memory
+-   [`Memory (PMM/VMM)`](architecture/memory/memory.md): Physical Memory Management and Virtual Memory Management.
+-   [`Memory Manager`](architecture/memory/memory_manager.md): Slab allocator and block allocator for kernel heap.
+
+#### Storage & Filesystems
+-   [`Filesystem`](architecture/storage/filesystem.md): Virtual File System (VFS) and the RAM-based FAT32 simulation.
+-   [`AHCI Drivers`](architecture/storage/ahci_drivers.md): Hardware communication for block storage devices.
+
+#### Network
+-   [`Network Stack`](architecture/network/network_stack.md): TCP/IP implementation and socket APIs.
+-   [`Network Drivers`](architecture/network/network_drivers.md): Hardware interaction for network cards (e.g. e1000).
+
+#### Graphics
+-   [`Window Manager`](architecture/graphics/window_manager.md): Compositor, events, and overlapping windows.
+-   [`Rendering`](architecture/graphics/rendering.md): Framebuffer, font rendering, and image loading.
+
+#### Hardware
+-   [`PCI`](architecture/hardware/pci.md): PCI bus enumeration and device binding.
+-   [`Input`](architecture/hardware/input.md): PS/2 Keyboard and Mouse input handling.
+
+#### Misc
+-   [`Versioning`](architecture/versioning.md): The OS date-based version scheme (`YY.M[.x]`) and kernel semantic versioning (`MAJOR.MINOR.PATCH`).
+
+### 2. [Building and Deployment](build/)
 Instructions for compiling the OS from source.
 -   [`Toolchain`](build/toolchain.md): Prerequisites and cross-compiler setup (`x86_64-elf-gcc`, `nasm`, `xorriso`).
 -   [`Usage`](build/usage.md): Understanding the Makefile targets, QEMU emulation, and flashing to bare metal hardware.
 
-### 3. 🚀 [Application Development](appdev/)
+### 3. [Application Development](appdev/)
 The SDK and toolchain guides for creating your own `.elf` userland binaries.
--   [`SDK Reference`](appdev/sdk_reference.md): Explanation of the custom `libc` wrappers (`stdlib.h`, `string.h`) and system calls.
+-   [`SDK Reference`](appdev/sdk_reference.md): Overview hub for SDK layout, includes, and links to detailed libc/syscall docs.
+-   [`Syscalls`](appdev/syscalls.md): Current syscall numbers, FS/SYSTEM command IDs, and wrapper guidance.
+-   [`libc Reference`](appdev/libc_reference.md): Current libc headers, implemented APIs, and behavior notes.
 -   [`UI API`](appdev/ui_api.md): Drawing on the screen, creating windows, and polling the event loop using `libui.h`.
 -   [`Widget API`](appdev/widget_api.md): High-level UI components like buttons, textboxes, and scrollbars using `libwidget.h`.
 -   [`Custom Apps`](appdev/custom_apps.md): A step-by-step tutorial on writing a new graphical C application, editing the Makefile, and bundling it into the ISO.
+-   [`ELF App Metadata`](appdev/elf_metadata.md): How to declare app icons and descriptions using source annotations, how the build system embeds them into `.note.boredos.app` ELF sections, and how the kernel reads them at runtime.
 -   [`Example Apps`](appdev/examples/README.md): A collection of sample C applications ranging from basic terminal output to advanced TCP networking.
 -   [`Grapher`](appdev/grapher.md): Full reference for the built-in mathematical graphing application — equation syntax, keyboard controls, architecture, and configuration.
 

docs/appdev/elf_metadata.md

@@ -0,0 +1,307 @@
+<div align="center">
+  <h1>ELF App Metadata</h1>
+  <p><em>How BoredOS embeds and reads application identity and icon data from <code>.elf</code> binaries.</em></p>
+</div>
+
+---
+
+BoredOS supports embedding **application metadata** including a display name, short description, and icon paths directly inside `.elf` executables using a standard ELF NOTE section. The kernel reads this metadata at runtime to display correct icons in the file explorer and on the desktop, without requiring any external sidecar files.
+
+## Overview
+
+When an ELF binary is compiled for BoredOS, the build system automatically injects a special ELF NOTE entry into a dedicated section called `.note.boredos.app`. This note holds a packed C struct (`boredos_app_metadata_t`) containing the app's metadata.
+
+At runtime, the Window Manager (`wm.c`) and File Explorer (`explorer.c`) call `app_metadata_get_primary_image()` to extract the primary icon path from any `.elf` file before rendering its icon. This allows each app to display its own distinct icon instead of the generic binary icon.
+
+---
+
+## The `boredos_app_metadata_t` Structure
+
+Defined in [`src/sys/elf.h`](../../src/sys/elf.h):
+
+```c
+typedef struct __attribute__((packed)) {
+    uint32_t magic;                                                      // Must be BOREDOS_APP_METADATA_MAGIC (0x414d4431)
+    uint16_t version;                                                    // Must be BOREDOS_APP_METADATA_VERSION (1)
+    uint16_t image_count;                                                // Number of valid icon paths (0–4)
+    uint16_t reserved;                                                   // Padding, set to 0
+    char app_name[BOREDOS_APP_METADATA_MAX_APP_NAME];                    // Up to 63 chars + NUL
+    char description[BOREDOS_APP_METADATA_MAX_DESCRIPTION];             // Up to 191 chars + NUL
+    char images[BOREDOS_APP_METADATA_MAX_IMAGES][BOREDOS_APP_METADATA_MAX_IMAGE_PATH]; // Up to 4 icon paths
+} boredos_app_metadata_t;
+```
+
+### Field Reference
+
+| Field | Size | Description |
+|---|---|---|
+| `magic` | 4 bytes | Magic number `0x414D4431` — validates the struct is a real metadata blob. |
+| `version` | 2 bytes | Schema version. Currently always `1`. |
+| `image_count` | 2 bytes | How many entries in `images[]` are valid (0–4). |
+| `reserved` | 2 bytes | Must be 0. Reserved for future use. |
+| `app_name` | 64 bytes | Null-terminated display name of the app (e.g., `"Terminal"`). |
+| `description` | 192 bytes | Null-terminated short description (e.g., `"Terminal shell and command runner."`). |
+| `images[4][160]` | 640 bytes | Up to 4 absolute VFS paths to PNG icons. First entry is the primary icon. |
+
+### Limits
+
+| Constant | Value | Meaning |
+|---|---|---|
+| `BOREDOS_APP_METADATA_MAX_APP_NAME` | 64 | Max bytes for `app_name` including NUL |
+| `BOREDOS_APP_METADATA_MAX_DESCRIPTION` | 192 | Max bytes for `description` including NUL |
+| `BOREDOS_APP_METADATA_MAX_IMAGES` | 4 | Max number of icon paths |
+| `BOREDOS_APP_METADATA_MAX_IMAGE_PATH` | 160 | Max bytes per icon path including NUL |
+
+---
+
+## The ELF NOTE Format
+
+The metadata is stored inside a standard ELF NOTE entry (defined by `Elf64_Nhdr` in `elf.h`) within the `.note.boredos.app` section.
+
+```
++------------------+
+| Elf64_Nhdr       |  namesz, descsz, type
++------------------+
+| name: "BOREDOS\0"|  8 bytes (sizeof BOREDOS_APP_NOTE_NAME)
++------------------+
+| boredos_app_     |  sizeof(boredos_app_metadata_t)
+|   metadata_t     |
++------------------+
+```
+
+### Note Constants
+
+| Constant | Value | Description |
+|---|---|---|
+| `BOREDOS_APP_NOTE_OWNER` | `"BOREDOS"` | The note owner/name string |
+| `BOREDOS_APP_NOTE_SECTION` | `".note.boredos.app"` | ELF section name |
+| `BOREDOS_APP_NOTE_TYPE` | `0x41505031` | Note type identifier (`"APP1"` in ASCII) |
+| `BOREDOS_APP_METADATA_MAGIC` | `0x414D4431` | Metadata struct magic (`"AMD1"`) |
+| `BOREDOS_APP_METADATA_VERSION` | `1` | Current schema version |
+
+---
+
+## Embedding Metadata into your applications
+
+Developers declare metadata using **special comment annotations** at the top of their C source file. The build system reads these automatically during compilation.
+
+```c
+// BOREDOS_APP_DESC: My application's short description.
+// BOREDOS_APP_ICONS: /Library/images/icons/colloid/my-icon.png
+```
+
+### `BOREDOS_APP_DESC`
+
+A single-line description of the application. Truncated to 191 characters.
+
+### `BOREDOS_APP_ICONS`
+
+A semicolon-separated list of absolute VFS paths to PNG icons. Up to 4 icons are supported. The **first** entry is used as the primary icon displayed in the File Explorer and on the Desktop.
+
+```c
+// BOREDOS_APP_ICONS: /Library/images/icons/colloid/primary.png;/Library/images/icons/colloid/alternate.png
+```
+
+> [!TIP]
+> If no `BOREDOS_APP_ICONS` annotation is provided, the build tool falls back to `/Library/images/icons/colloid/xterm.png`.
+> If no `BOREDOS_APP_DESC` annotation is provided, the build tool uses `"BoredOS userspace application."`.
+
+---
+
+## Build System Integration
+
+### The `gen_userland_note.sh` Tool
+
+Located at [`tools/gen_userland_note.sh`](../../tools/gen_userland_note.sh), this script is invoked automatically by the `src/userland/Makefile` for every compiled application.
+
+**Usage:**
+```sh
+gen_userland_note.sh <app-name> <source-file> <icon-source-dir> <output.note.c>
+```
+
+| Argument | Description |
+|---|---|
+| `<app-name>` | The base name of the application (e.g., `terminal`) |
+| `<source-file>` | Path to the main `.c` source to extract annotations from |
+| `<icon-source-dir>` | Directory where icon files are expected to exist on the *host* (build-time validation) |
+| `<output.note.c>` | Path for the generated C source file |
+
+The script:
+1. Reads `BOREDOS_APP_DESC` and `BOREDOS_APP_ICONS` from the source file.
+2. Validates that each declared icon file exists in `<icon-source-dir>` at build time.
+3. Generates a C file (e.g., `bin/terminal.note.c`) that defines a `__attribute__((section(".note.boredos.app")))` constant struct containing all metadata.
+
+### Makefile Rules
+
+In `src/userland/Makefile`, the following rules handle metadata generation and linking:
+
+```make
+# Generate the .note.c for each app from its source annotations
+$(BIN_DIR)/%.note.c: $(APP_METADATA_TOOL) | $(BIN_DIR)
+    src="$(call app_source_for,$*)"; \
+    sh $(APP_METADATA_TOOL) "$*" "$$src" "$(APP_ICON_SOURCE_DIR)" "$@"
+
+# Compile the generated note C file
+$(BIN_DIR)/%.note.o: $(BIN_DIR)/%.note.c
+    $(CC) $(CFLAGS) -c $< -o $@
+
+# Link note object into each ELF (generic rule)
+$(BIN_DIR)/%.elf: $(LIBC_OBJS) $(BIN_DIR)/%.o $(BIN_DIR)/%.note.o
+    $(LD) $(LDFLAGS) $^ -o $@
+```
+
+Special-cased apps (`doom`, `lua`, `viewer`, `settings`, `browser`, `screenshot`) also link in their own `.note.o` explicitly.
+
+> [!IMPORTANT]
+> The `-I../sys` flag is added to `CFLAGS` so that generated `.note.c` files can `#include "elf.h"` when referencing the metadata constants.
+
+---
+
+## Runtime Parsing: `app_metadata.c`
+
+At runtime, `src/sys/app_metadata.c` provides two public functions:
+
+```c
+bool app_metadata_read(const char *path, boredos_app_metadata_t *out_metadata);
+bool app_metadata_get_primary_image(const char *path, char *out_path, size_t out_path_size);
+```
+
+### `app_metadata_read`
+
+Opens the ELF at `path` via VFS and searches for the `.note.boredos.app` section. It uses a **two-pass strategy**:
+
+1. **Raw scan** (`am_scan_raw_notes`): For files up to 16 MiB, loads the entire binary into memory and byte-scans for a NOTE header matching the `BOREDOS` owner and `BOREDOS_APP_NOTE_TYPE`. This handles cases where the section header table is missing or unreadable.
+2. **Section-based scan** (`am_parse_note_section`): Reads the ELF section header table, locates the `.note.boredos.app` section by name, then parses NOTE entries within it.
+
+After a successful parse, the struct is validated via `am_validate_metadata` (checks magic and version fields) and sanitized via `am_sanitize_metadata` (null-terminates all strings).
+
+### `app_metadata_get_primary_image`
+
+A convenience wrapper around `app_metadata_read` that returns just the first icon path:
+
+```c
+bool app_metadata_get_primary_image(const char *path, char *out_path, size_t out_path_size);
+```
+
+Returns `true` and populates `out_path` if the binary has at least one valid icon declared.
+
+### Metadata Cache
+
+To avoid re-reading ELF files on every frame redraw, results are stored in a **simple FIFO cache** of up to 64 entries:
+
+```c
+#define APP_METADATA_CACHE_SIZE 64
+```
+
+Both positive (metadata found) and negative (no metadata) results are cached. The cache uses a round-robin eviction strategy — no LRU, no invalidation. This is intentional for a kernel context where metadata does not change while the OS is running.
+
+---
+
+
+---
+
+## Userspace API
+
+Userspace applications can query the ELF metadata of any `.elf` binary on the VFS through two wrapper functions declared in [`src/userland/libc/syscall.h`](../../src/userland/libc/syscall.h).
+
+### The `boredos_app_metadata_t` struct (userland)
+
+The struct is redefined verbatim in the userland header so that apps do **not** need to include any kernel header:
+
+```c
+#define BOREDOS_APP_METADATA_MAX_APP_NAME    64
+#define BOREDOS_APP_METADATA_MAX_DESCRIPTION 192
+#define BOREDOS_APP_METADATA_MAX_IMAGES      4
+#define BOREDOS_APP_METADATA_MAX_IMAGE_PATH  160
+
+typedef struct __attribute__((packed)) {
+    uint32_t magic;
+    uint16_t version;
+    uint16_t image_count;
+    uint16_t reserved;
+    char app_name[BOREDOS_APP_METADATA_MAX_APP_NAME];
+    char description[BOREDOS_APP_METADATA_MAX_DESCRIPTION];
+    char images[BOREDOS_APP_METADATA_MAX_IMAGES][BOREDOS_APP_METADATA_MAX_IMAGE_PATH];
+} boredos_app_metadata_t;
+```
+
+### Functions
+
+#### `sys_get_elf_metadata`
+
+```c
+int sys_get_elf_metadata(const char *path, boredos_app_metadata_t *out_metadata);
+```
+
+Reads the full metadata blob from the `.note.boredos.app` section of the ELF at `path` and writes it into `*out_metadata`.
+
+Returns `1` on success, `0` on failure (file not found, no metadata note, or validation failure).
+
+#### `sys_get_elf_primary_image`
+
+```c
+int sys_get_elf_primary_image(const char *path, char *out_path, size_t out_path_size);
+```
+
+Convenience wrapper that returns only the first icon path from the metadata. Useful when you just need to display an application icon without allocating a full `boredos_app_metadata_t`.
+
+Returns `1` and writes a null-terminated VFS path into `out_path` if at least one icon was declared. Returns `0` otherwise.
+
+### Syscall IDs
+
+Both functions route through `SYS_SYSTEM` using dedicated command IDs:
+
+| ID | Macro | Function |
+|---|---|---|
+| 76 | `SYSTEM_CMD_GET_ELF_METADATA` | `sys_get_elf_metadata` |
+| 77 | `SYSTEM_CMD_GET_ELF_PRIMARY_IMAGE` | `sys_get_elf_primary_image` |
+
+### Caching
+
+Both calls share the same kernel-side **64-entry FIFO metadata cache** used by the Window Manager and File Explorer. If the metadata for a path has already been read, the result is returned from cache without re-reading the file. Negative results (no metadata) are also cached.
+
+### Example: reading full metadata
+
+```c
+#include "syscall.h"
+#include "stdio.h"
+
+void print_app_info(const char *elf_path) {
+    boredos_app_metadata_t meta;
+    if (!sys_get_elf_metadata(elf_path, &meta)) {
+        printf("%s: no metadata\n", elf_path);
+        return;
+    }
+    printf("Name:        %s\n", meta.app_name);
+    printf("Description: %s\n", meta.description);
+    printf("Icons (%u):\n", meta.image_count);
+    for (int i = 0; i < (int)meta.image_count; i++) {
+        printf("  [%d] %s\n", i, meta.images[i]);
+    }
+}
+```
+
+### Example: fetching just the icon path
+
+```c
+#include "syscall.h"
+
+void load_icon_for(const char *elf_path, Image *out_icon) {
+    char icon_path[BOREDOS_APP_METADATA_MAX_IMAGE_PATH];
+    if (sys_get_elf_primary_image(elf_path, icon_path, sizeof(icon_path))) {
+        *out_icon = image_load(icon_path);
+    } else {
+        *out_icon = image_load("/Library/images/icons/colloid/xterm.png"); // fallback
+    }
+}
+```
+
+> [!NOTE]
+> The metadata is read **from the VFS**, so the ELF must already be present as a file. The kernel does **not** read metadata from an already-running process image in memory — it re-opens the file via the filesystem.
+
+---
+
+
+
+
+*See also: [`custom_apps.md`](custom_apps.md) for a full tutorial on building and bundling a new application, [`sdk_reference.md`](sdk_reference.md) for an overview of the SDK, and [`syscalls.md`](syscalls.md) for the complete SYSTEM command ID table.*

docs/appdev/examples/01_hello_cli.md

@@ -7,16 +7,18 @@
 
 This example demonstrates the bare minimum structure of a BoredOS application that outputs text to the standard output (usually the Terminal executing the binary).
 
-## 📝 Concepts Introduced
+## Concepts Introduced
 * Including `stdlib.h` for basic IO.
 * The `main()` entry point.
 * Using `printf()` for formatted output.
+* Declaring app metadata via source annotations.
 
 ---
 
-## 💻 The Code (`src/userland/cli/hello_world.c`)
+## The Code (`src/userland/cli/hello_world.c`)
 
 ```c
+// BOREDOS_APP_DESC: Hello World — a minimal CLI demo.
 #include <stdlib.h>
 
 int main(int argc, char **argv) {
@@ -34,14 +36,15 @@ int main(int argc, char **argv) {
 }
 ```
 
-## 🛠️ How it Works
+## How it Works
 
 1.  **`#include <stdlib.h>`**: We include the SDK's standard library header which gives us access to `printf`.
 2.  **`int main(...)`**: Every process begins execution here (managed transparently by `crt0.asm`).
 3.  **`printf(...)`**: The SDK routes this call internally directly to the `SYS_WRITE` system call, making it available on the terminal.
 4.  **`return 0`**: A successful exit code.
+5.  **`BOREDOS_APP_DESC` / `BOREDOS_APP_ICONS`**: These comment annotations are read by the build system (`gen_userland_note.sh`) and embedded as a `boredos_app_metadata_t` NOTE entry inside the compiled `.elf`. The File Explorer and Desktop use this to display the correct icon. See [`elf_metadata.md`](../elf_metadata.md) for full details.
 
-## 🚀 Running It
+## Running It
 
 If you build the project, you can open the Terminal and type:
 ```sh

docs/appdev/examples/02_basic_window.md

@@ -7,17 +7,19 @@
 
 This example demonstrates how to create an empty window that stays active on the screen until the user explicitly closes it by clicking the 'X' button.
 
-## 📝 Concepts Introduced
+## Concepts Introduced
 * Including `libui.h` and the event structure.
 * Creating a `ui_window_t` handle.
 * Creating an infinite event loop using `ui_get_event()`.
 * Yielding CPU time to the kernel via `sys_yield()`.
+* Declaring app metadata via source annotations.
 
 ---
 
-## 💻 The Code (`src/userland/gui/basic_window.c`)
+## The Code (`src/userland/gui/basic_window.c`)
 
 ```c
+// BOREDOS_APP_DESC: Basic Window — a minimal graphical window demo.
 #include <stdlib.h>
 #include <libui.h>
 #include <syscall.h>
@@ -65,7 +67,8 @@ int main(void) {
 2.  **The Event Loop**: Graphical programs run forever until closed. The `while (1)` loop serves this purpose.
 3.  **Polling**: `ui_get_event` asks the kernel, "Hey, did the user click my window or press a key since the last time I asked?". It is non-blocking, so it immediately returns `false` if nothing happened.
 4.  **CPU Yielding**: Since we are constantly polling in a tight loop, we call `sys_yield()` at the end of the loop frame. This politely tells the OS scheduler, "I'm done checking for events, go ahead and let another program run for a bit."
+5.  **`BOREDOS_APP_DESC` / `BOREDOS_APP_ICONS`**: Embedded into the `.elf` by the build system as a BoredOS NOTE section. The Window Manager reads this at runtime to render the app's icon on the Desktop and in the File Explorer. See [`elf_metadata.md`](../elf_metadata.md) for full details.
 
-## 🚀 Running It
+## Running It
 
 Launch the Terminal and type `basic_window`. You'll see an empty window appear that you can move around the screen!

docs/appdev/examples/03_bouncing_ball.md

@@ -7,17 +7,20 @@
 
 This example builds upon the `02_basic_window` guide. It demonstrates how to constantly update the screen to simulate a bouncing square moving freely inside the window bounds.
 
-## 📝 Concepts Introduced
+## Concepts Introduced
 * Maintaining application state across frames (Velocity/Position).
 * Drawing primitives (`ui_fill_rect`, `ui_draw_string`).
 * The importance of clearing the screen on a new frame.
 * Explicitly forcing standard visual updates via `ui_mark_dirty()`.
+* Declaring app metadata via source annotations.
 
 ---
 
-## 💻 The Code (`src/userland/gui/bounce.c`)
+## The Code (`src/userland/gui/bounce.c`)
 
 ```c
+// BOREDOS_APP_DESC: Bouncing ball animation demo.
+// BOREDOS_APP_ICONS: /Library/images/icons/colloid/applications-games.png
 #include <stdlib.h>
 #include <libui.h>
 #include <syscall.h>
@@ -81,12 +84,13 @@ int main(void) {
 }
 ```
 
-## 🛠️ How it Works
+## How it Works
 
 1.  **State Management**: We store `pos_x`, `pos_y`, `vel_x`, and `vel_y`. These variables represent the "physics" of our system. Notice that they update *outside* the event-checking logic so that the animation runs even if the user isn't clicking the mouse.
 2.  **Screen Clearing**: We *must* fill the screen with black (`ui_draw_rect(wid, 0, 0, W_WIDTH, W_HEIGHT, ...)`). If we don't clear the screen, the red square will leave a permanent trailing smear everywhere it goes!
 3.  **The Double Buffer**: `ui_draw_rect` and `ui_draw_string` do not immediately appear on your monitor. They just color a hidden buffer within the kernel.
 4.  **`ui_mark_dirty`**: This is the crucial command that tells the kernel Window Manager, "I'm done drawing my frame. Can you quickly copy my hidden buffer over to the real screen now?"
+5.  **`BOREDOS_APP_DESC` / `BOREDOS_APP_ICONS`**: Embedded into the compiled `.elf` as a BoredOS NOTE section. The Desktop and File Explorer read this to show the game's icon instead of the generic binary icon. See [`elf_metadata.md`](../elf_metadata.md) for full details.
 
 > [!WARNING]
 > Because `sys_yield()`'s pause duration depends heavily on CPU load and how many other processes are running (or QEMU emulation speed), tying physics/movement strictly to loops can make the game run faster on faster computers. Advanced developers will want to calculate delta time (time elapsed since the last frame) for smooth motion.

docs/appdev/examples/04_tcp_client.md

@@ -12,12 +12,15 @@ This advanced example demonstrates the steps required to use the raw network sys
 * Performing DNS lookups manually via `sys_dns_lookup`.
 * Managing strict TCP flow logic (`sys_tcp_connect`, send, block for receive).
 * Using the terminal `SYS_WRITE` output for debugging.
+* Declaring app metadata via source annotations.
 
 ---
 
-## 💻 The Code (`src/userland/cli/http_get.c`)
+## The Code (`src/userland/cli/http_get.c`)
 
 ```c
+// BOREDOS_APP_DESC: HTTP GET client — fetches a webpage over TCP.
+// BOREDOS_APP_ICONS: /Library/images/icons/colloid/network-wired.png
 #include <stdlib.h>
 #include <string.h>
 #include <syscall.h>
@@ -79,14 +82,15 @@ int main(void) {
 }
 ```
 
-## 🛠️ How it Works
+## How it Works
 
 1.  **Network Setup**: First, we must ensure the host machine or QEMU environment gave BoredOS a valid IP address via DHCP. The `sys_network_has_ip()` check prevents our app from hanging trying to route data to nowhere.
 2.  **DNS (`sys_dns_lookup`)**: Since we want to connect to a domain name, not a raw IP, we query the DNS server configured by the OS (which it received via DHCP).
 3.  **Connection (`sys_tcp_connect`)**: We block the application thread while the OS performs the 3-way TCP handshake over port 80.
 4.  **Payload (`sys_tcp_send`)**: We format a compliant HTTP/1.1 payload representing a simple GET request for the root directory `/`.
 5.  **Chunked Receiving (`sys_tcp_recv`)**: The server's response might be larger than our `recv_buf` (512 bytes). Therefore, we loop. `sys_tcp_recv` blocks execution until data arrives. If it returns `0`, the remote server cleanly closed the connection (which happens automatically because we specified `Connection: close` in our request payload!).
+6.  **`BOREDOS_APP_DESC` / `BOREDOS_APP_ICONS`**: Embedded into the compiled `.elf` as a BoredOS NOTE section. The Desktop and File Explorer read this to display the app's icon. See [`elf_metadata.md`](../elf_metadata.md) for full details.
 
-## 🚀 Running It
+## Running It
 
 Make sure QEMU is running with networking enabled. Launch the terminal and type `http_get`. You will see the raw headers and HTML source of the target webpage scroll down the CLI interface!

docs/appdev/inputs_api_(utf8).md

@@ -0,0 +1,251 @@
+# UTF-8 Library — Application Development Guide
+
+## Overview
+
+The userland libc provides a lightweight UTF-8 utility module located in:
+
+- src/userland/libc/utf-8.c
+- src/userland/libc/utf-8.h
+
+This module is designed for **direct use in applications** requiring UTF-8 handling. It provides basic primitives for decoding, encoding, and traversing UTF-8 strings safely.
+
+It is intended for:
+
+- text rendering
+- terminal input/output
+- cursor movement
+- string processing at the character level
+
+---
+
+## Synopsis
+
+```c
+#include "utf-8.h"
+
+uint32_t text_decode_utf8(const char *s, int *advance);
+int text_encode_utf8(uint32_t cp, char *out);
+
+const char* text_next_utf8(const char *s);
+const char* text_prev_utf8(const char *start, const char *s);
+
+int text_strlen_utf8(const char *s);
+```
+
+---
+
+## API Reference
+
+### text_decode_utf8
+
+```c
+uint32_t text_decode_utf8(const char *s, int *advance);
+```
+
+Decodes a UTF-8 sequence into a Unicode code point.
+
+- `s`: pointer to current position in a UTF-8 string
+- `advance`: receives number of bytes consumed
+
+Returns:
+
+- decoded Unicode code point (`uint32_t`)
+- `0` if input is null or empty
+- `0xFFFD` for invalid sequences
+
+---
+
+### text_encode_utf8
+
+```c
+int text_encode_utf8(uint32_t cp, char *out);
+```
+
+Encodes a Unicode code point into UTF-8.
+
+- `cp`: Unicode code point
+- `out`: buffer receiving encoded bytes
+
+Returns:
+
+- number of bytes written (1–4)
+- writes replacement character if `cp` is invalid
+
+---
+
+### text_next_utf8
+
+```c
+const char* text_next_utf8(const char *s);
+```
+
+Advances to the next UTF-8 character.
+
+Returns a pointer to the next character boundary.
+
+---
+
+### text_prev_utf8
+
+```c
+const char* text_prev_utf8(const char *start, const char *s);
+```
+
+Moves backward to the previous UTF-8 character.
+
+- `start`: beginning of the buffer
+- `s`: current position
+
+Used for reverse traversal and cursor movement.
+
+---
+
+### text_strlen_utf8
+
+```c
+int text_strlen_utf8(const char *s);
+```
+
+Counts UTF-8 characters (code points), not bytes.
+
+---
+
+## Usage Examples
+
+### Iterating over UTF-8 characters
+
+```c
+const char *p = text;
+
+while (*p) {
+    int adv;
+    uint32_t cp = text_decode_utf8(p, &adv);
+
+    /* process cp */
+
+    p += adv;
+}
+```
+
+---
+
+### Cursor movement
+
+```c
+cursor = text_next_utf8(cursor);
+cursor = text_prev_utf8(buffer_start, cursor);
+```
+
+---
+
+### Encoding a character
+
+```c
+char out[4];
+int len = text_encode_utf8(0x20AC, out);
+```
+
+---
+
+### Backspace handling
+
+```c
+char *prev = (char*)text_prev_utf8(buffer, cursor);
+cursor = prev;
+```
+
+---
+
+## Implementation Notes
+
+### UTF-8 Encoding
+
+The implementation supports:
+
+- 1 byte: `0x00 – 0x7F`
+- 2 bytes: `0x80 – 0x7FF`
+- 3 bytes: `0x800 – 0xFFFF`
+- 4 bytes: `0x10000 – 0x10FFFF`
+
+---
+
+### Replacement Character
+
+Invalid sequences are replaced with:
+
+- code point: `0xFFFD`
+- UTF-8 encoding: `0xEF 0xBF 0xBD`
+
+---
+### UTF-8 Byte Structure
+
+The following diagram illustrates how UTF-8 bytes are structured, including
+ASCII, continuation bytes, and multi-byte sequence headers:
+
+<img width="815" height="1003" alt="image" src="https://github.com/user-attachments/assets/0d289a94-6037-4039-87a3-125c0c0e83d0" />
+<sub>Source: <a href="https://www.youtube.com/watch?v=vpSkBV5vydg">Nic Barker — "UTF-8, Explained Simply"</a> (YouTube)</sub>
+
+---
+
+### Control Signals
+
+Some decoded code points correspond to control signals instead of printable characters.
+
+ASCII control range:
+
+- `0x00 – 0x1F`
+
+Examples:
+
+- `0x08` → Backspace
+- `0x09` → Tab
+- `0x0A` → Line Feed
+- `0x0D` → Carriage Return
+- `0x1B` → Escape
+
+These are typically interpreted by:
+
+- terminal logic
+- shell input handling
+- system interfaces
+
+---
+
+### Non-ASCII Characters
+
+Characters outside the ASCII range (`0x00 – 0x7F`) are encoded using multi-byte UTF-8 sequences.
+
+Examples:
+
+- 'é' → `0xC3 0xA9`
+- '€' → `0xE2 0x82 0xAC`
+
+Decoded values:
+
+- 'é' → `U+00E9`
+- '€' → `U+20AC`
+
+---
+
+### Modifiers and Layout
+
+Character output depends on:
+
+- keyboard layout
+- modifier keys (Shift, Ctrl, AltGr)
+
+Example:
+
+- `KEY_E` → 'e'
+- `KEY_E + SHIFT` → 'E'
+- `KEY_E + AltGr` → '€'
+
+---
+
+## Also worth watching
+
+If you want to dive deeper or simply get a better intuitive understanding of UTF-8, the video below is highly recommended:
+
+[Nic Barker — "UTF-8, Explained Simply"](https://www.youtube.com/watch?v=vpSkBV5vydg)
+
+

docs/appdev/libc_reference.md

@@ -0,0 +1,184 @@
+# libc Reference
+
+This page documents the current BoredOS userland libc surface from `src/userland/libc/`.
+
+BoredOS libc is a compact implementation focused on the APIs used by in-tree apps. It is not a full glibc replacement.
+
+## Header Overview
+
+| Header | Focus |
+|---|---|
+| `stdlib.h` | allocation, conversion, process helpers |
+| `string.h` | memory/string primitives |
+| `stdio.h` | `FILE*` and formatted I/O |
+| `unistd.h` | POSIX-like fd/process calls |
+| `fcntl.h` | open/fcntl flags, `dup`, `pipe` |
+| `input.h` | keyboard keycode constants |
+| `signal.h` | signal handlers and masks |
+| `sys/stat.h` | `stat`/`fstat` and file mode bits |
+| `sys/types.h` | core typedefs (`pid_t`, `ssize_t`, ...) |
+| `sys/wait.h` | `waitpid` and wait macros |
+| `errno.h` | errno values |
+| `time.h` | time/date utilities |
+| `math.h` | floating-point math helpers |
+| `libui.h` | GUI/window drawing API |
+
+## stdlib.h
+
+Implemented core functions:
+- Memory: `malloc`, `free`, `calloc`, `realloc`
+- Memory aliases: `memset`, `memcpy`
+- Conversions: `atoi`, `itoa`, `strtod`, `abs`
+- Output: `puts`, `printf`
+- Process/environment: `exit`, `_exit`, `sleep`, `chdir`, `getcwd`, `access`, `system`, `getenv`, `abort`
+
+Notes:
+- `sleep` is millisecond-based and maps to kernel sleep command.
+- `system` is a stub-style helper in this libc, not a full shell launcher equivalent.
+
+## string.h
+
+Implemented C string/memory set includes:
+- Memory: `memmove`, `memcmp`, `memcpy`, `memset`, `memchr`
+- Search: `strchr`, `strrchr`, `strpbrk`, `strstr`
+- Span: `strspn`, `strcspn`
+- Compare: `strcmp`, `strncmp`, `strcasecmp`, `strncasecmp`, `strcoll`
+- Build/copy: `strlen`, `strcpy`, `strcat`, `strdup`
+- Errors: `strerror`
+
+## stdio.h
+
+Provided API includes:
+- Stream open/close: `fopen`, `freopen`, `fclose`
+- Read/write: `fread`, `fwrite`, `fgets`, `fputs`, `getc`, `fputc`, `putchar`
+- Positioning: `fseek`, `ftell`, `filelength`
+- Formatting: `fprintf`, `vfprintf`, `snprintf`, `vsnprintf`, `sprintf`, `sscanf`
+- Stream state: `feof`, `ferror`, `clearerr`, `fflush`, `ungetc`
+- Temp/filesystem helpers: `remove`, `rename`, `tmpfile`, `tmpnam`
+
+## unistd.h
+
+Provided POSIX-like interfaces:
+- FD I/O: `read`, `write`, `close`, `lseek`, `isatty`
+- Filesystem: `unlink`
+- Exec family: `execv`, `execve`, `execvp`, `execl`, `execlp`, `execle`
+- Process wait: `waitpid`
+
+Also defines:
+- `SEEK_SET`, `SEEK_CUR`, `SEEK_END`
+- `F_OK`, `X_OK`, `W_OK`, `R_OK`
+
+## fcntl.h
+
+Flags and fd control:
+- Open flags: `O_RDONLY`, `O_WRONLY`, `O_RDWR`, `O_CREAT`, `O_EXCL`, `O_TRUNC`, `O_APPEND`, `O_NONBLOCK`, `O_ACCMODE`
+- fcntl ops: `F_GETFL`, `F_SETFL`
+- FD flag: `FD_CLOEXEC` (declared)
+
+Functions:
+- `open`
+- `fcntl`
+- `dup`
+- `dup2`
+- `pipe`
+
+## input.h
+
+Defines keyboard/control keycode constants used by apps that process
+
+Current constants include:
+- Arrow keys: `KEY_UP`, `KEY_DOWN`, `KEY_LEFT`, `KEY_RIGHT`
+- Controls: `KEY_ENTER`, `KEY_BACKSPACE`, `KEY_ESCAPE`, `KEY_SPACE`, `KEY_ALT`, `KEY_CTRL_L`, `KEY_TAB`
+
+## signal.h
+
+Current signal surface:
+- Basic handler API: `signal`, `raise`, `kill`
+- POSIX-style API: `sigaction`, `sigprocmask`, `sigpending`
+- Types: `sighandler_t`, `sigset_t`, `struct sigaction`
+- Constants: `SIGINT`, `SIGTERM`, `SIGKILL`, `SIG_DFL`, `SIG_IGN`, `SIG_ERR`
+- Mask ops: `SIG_BLOCK`, `SIG_UNBLOCK`, `SIG_SETMASK`
+- Action flags: `SA_RESTART`, `SA_NODEFER`, `SA_RESETHAND`
+
+## ctype.h
+
+Character classification and case conversion:
+- `isdigit`, `isalpha`, `isalnum`, `isspace`
+- `isupper`, `islower`, `isxdigit`
+- `iscntrl`, `ispunct`, `isprint`, `isgraph`
+- `tolower`, `toupper`
+
+## locale.h
+
+Locale stubs and conventions:
+- `struct lconv`
+- `setlocale`
+- `localeconv`
+- `LC_ALL`
+
+## limits.h
+
+Integer and floating-point limit macros:
+- `CHAR_BIT`, `INT_MIN`, `INT_MAX`, `UINT_MAX`
+- `LONG_MIN`, `LONG_MAX`, `ULONG_MAX`
+- `LLONG_MIN`, `LLONG_MAX`, `ULLONG_MAX`
+- `DBL_MAX`
+
+## setjmp.h
+
+Non-local jump support:
+- `jmp_buf`
+- `setjmp`
+- `longjmp`
+
+## time.h
+
+Time/date APIs and types:
+- Types: `time_t`, `clock_t`, `struct tm`
+- Constants: `CLOCKS_PER_SEC`
+- Functions: `time`, `clock`, `localtime`, `gmtime`, `strftime`, `mktime`
+
+## libui.h
+
+Windowing and drawing API used by GUI apps:
+- Window/event: `ui_window_create`, `ui_get_event`, `ui_mark_dirty`, `ui_window_set_title`, `ui_window_set_resizable`
+- Drawing: `ui_draw_rect`, `ui_draw_rounded_rect_filled`, `ui_draw_string`, `ui_draw_string_bitmap`, `ui_draw_image`
+- Text metrics/scaled text: `ui_get_string_width`, `ui_get_font_height`, `ui_draw_string_scaled`, `ui_draw_string_scaled_sloped`, `ui_get_string_width_scaled`, `ui_get_font_height_scaled`
+- System UI helpers: `ui_get_screen_size`, `ui_set_font`
+
+## sys/stat.h and sys/types.h
+
+`sys/stat.h` provides:
+- `struct stat`
+- `stat`, `fstat`, `mkdir`
+- mode/type macros (`S_IFREG`, `S_IFDIR`, `S_ISREG`, `S_ISDIR`, permission bits)
+
+Note:
+- `access` is declared in `stdlib.h` in this libc.
+
+`sys/types.h` provides:
+- `ssize_t`, `off_t`, `mode_t`, `pid_t`, `uid_t`, `gid_t`
+
+## sys/wait.h
+
+- `waitpid`
+- `WNOHANG`
+- status macros: `WEXITSTATUS`, `WIFEXITED`, `WTERMSIG`, `WIFSIGNALED`
+
+## errno.h
+
+Defined errno values include:
+- Generic/input: `EINVAL`, `EDOM`, `ERANGE`, `E2BIG`
+- File/path: `ENOENT`, `EEXIST`, `EISDIR`, `ENOTDIR`, `EBADF`
+- Runtime/state: `ENOMEM`, `EACCES`, `EIO`, `EAGAIN`, `EINTR`, `ECHILD`, `EBUSY`, `EPIPE`, `ESPIPE`, `ENOSYS`, `ENOTSUP`
+
+## Relationship to raw syscalls
+
+- libc high-level I/O and process APIs are backed by wrappers in `src/userland/libc/syscall.c`.
+- Full syscall command IDs and multiplexer details are documented in `docs/appdev/syscalls.md`.
+
+## Practical Guidance
+
+- Prefer libc APIs (`open`, `read`, `write`, `waitpid`, `sigaction`) for portability inside BoredOS userland.
+- Use raw wrapper calls from `syscall.h` only for capabilities that do not yet have higher-level libc wrappers.
+- Avoid numeric `sys_system(...)` command literals in app code; use `SYSTEM_CMD_*` macros.

docs/appdev/sdk_reference.md

@@ -1,214 +1,52 @@
 <div align="center">
   <h1>Userland SDK Reference</h1>
-  <p><em>Comprehensive manual for custom libc and system calls in BoredOS.</em></p>
+    <p><em>Overview and entry point for BoredOS userland development.</em></p>
 </div>
 
 ---
 
-BoredOS provides a custom `libc` implementation necessary for writing userland applications (`.elf` binaries). By avoiding a full-blown standard library like `glibc`, the OS ensures a minimal executable footprint tailored strictly to the existing kernel features.
+BoredOS provides a compact userland SDK for building `.elf` applications.
+This page is the high-level map; detailed API references now live in dedicated pages.
 
-All headers are located in `src/userland/libc/` (standard functions) and `src/wm/` (UI and widgets).
--   `stdlib.h`: Memory, strings, and basic I/O.
--   `math.h`: Freestanding floating-point math library.
--   `libui.h`: Core window and drawing API.
--   `libwidget.h`: High-level UI components.
+## SDK Structure
 
-## Standard Library (`stdlib.h` & `string.h`)
+Primary headers are in `src/userland/libc/` and UI helpers are in `src/wm/`.
 
-The standard library wrappers provide memory management, string manipulation, and basic IO formatting without needing direct syscalls.
+- `stdlib.h`, `string.h`, `stdio.h`, `unistd.h`: core libc surface
+- `syscall.h`: raw syscall wrappers and command constants
+- `libui.h`: window creation, drawing, and event polling
+- `libwidget.h`: higher-level reusable widgets
+- `math.h`: freestanding math helpers
 
-### Memory Allocation
-*   `void* malloc(size_t size);` - Allocate a block of memory on the heap.
-*   `void free(void* ptr);` - Free a previously allocated memory block.
-*   `void* calloc(size_t nmemb, size_t size);` - Allocate and zero-out a block of memory for an array.
-*   `void* realloc(void* ptr, size_t size);` - Resize an existing memory block.
+## Detailed References
 
-### Memory Manipulation (`string.h`)
-*   `void* memset(void *s, int c, size_t n);` - Fill a block of memory with a specific byte.
-*   `void* memcpy(void *dest, const void *src, size_t n);` - Copy memory from source to destination.
-*   `void* memmove(void *dest, const void *src, size_t n);` - Safely copy overlapping memory blocks.
-*   `int memcmp(const void *s1, const void *s2, size_t n);` - Compare two memory blocks.
+- [`libc Reference`](libc_reference.md): current libc headers and implemented APIs
+- [`Syscalls`](syscalls.md): syscall numbers, FS/SYSTEM command IDs, and wrappers
+- [`UI API`](ui_api.md): drawing and event APIs
+- [`Widget API`](widget_api.md): common widgets and interaction helpers
 
-### String Utilities
-*   `size_t strlen(const char *s);` - Get the length of a string.
-*   `int strcmp(const char *s1, const char *s2);` - Compare two strings lexicographically.
-*   `char* strcpy(char *dest, const char *src);` - Copy a string to a destination buffer.
-*   `char* strcat(char *dest, const char *src);` - Concatenate two strings.
-
-### Conversion and Formatting
-*   `int atoi(const char *nptr);` - String to integer conversion.
-*   `void itoa(int n, char *buf);` - Integer to string conversion.
-
-### Input / Output
-*   `void puts(const char *s);` - Print a string followed by a newline to the standard output.
-*   `void printf(const char *fmt, ...);` - Formatted print to standard output (supports `%d`, `%s`, `%x`, etc.).
-
-### Process Control
-*   `void exit(int status);` - Terminate the current process.
-*   `void sleep(int ms);` - Pause execution for a specified number of milliseconds.
-
----
-
-## Math Library (`math.h`)
-
-BoredOS ships a freestanding floating-point math library in `libc/math.h`. It uses pure arithmetic — Taylor series, Newton-Raphson, and range-reduction — with no dependency on a host `libm` or hardware math intrinsics. It is automatically linked into every userland ELF.
+## Typical Include Set
 
 ```c
-#include "math.h"
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include <unistd.h>
+#include <syscall.h>
 ```
 
-### Constants
+For GUI apps:
 
-| Constant | Value | Description |
-|---|---|---|
-| `M_PI` | 3.14159… | π |
-| `M_E` | 2.71828… | Euler's number |
-| `M_LN2` | 0.69315… | Natural log of 2 |
-| `M_SQRT2` | 1.41421… | √2 |
-| `HUGE_VAL` | ~+∞ | Overflow sentinel |
-
-### Functions
-
-#### Absolute value & remainder
-*   `double fabs(double x);` — Absolute value.
-*   `double fmod(double x, double y);` — Floating-point remainder. Returns `0` when `y == 0`.
-
-#### Rounding
-*   `double floor(double x);` — Largest integer ≤ x.
-*   `double ceil(double x);` — Smallest integer ≥ x.
-
-#### Trigonometry *(arguments in radians)*
-*   `double sin(double x);` — Sine. Range-reduced to `[-π, π]` then computed via 8-term Taylor series.
-*   `double cos(double x);` — Cosine. Computed via `sin(x + π/2)`.
-*   `double tan(double x);` — Tangent. Returns sentinel `1e15` near poles.
-
-#### Exponential & logarithm
-*   `double sqrt(double x);` — Square root via Newton-Raphson (25 iterations). Returns `0` for `x ≤ 0`.
-*   `double log(double x);` — Natural logarithm (ln). Returns `-1e30` for `x ≤ 0`.
-*   `double log2(double x);` — Base-2 logarithm.
-*   `double log10(double x);` — Base-10 logarithm.
-*   `double exp(double x);` — e^x. Saturates to `1e300` for `x > 700`, `0` for `x < -700`.
-*   `double pow(double base, double exponent);` — General power. Integer exponents use fast binary exponentiation; fractional exponents use `exp(e * log(b))`.
-
-#### Hyperbolic
-*   `double sinh(double x);` — Hyperbolic sine.
-*   `double cosh(double x);` — Hyperbolic cosine.
-*   `double tanh(double x);` — Hyperbolic tangent.
-
-#### Utility
-*   `double hypot(double x, double y);` — `sqrt(x² + y²)` without intermediate overflow.
-*   `double fmin(double a, double b);` — Minimum of two values.
-*   `double fmax(double a, double b);` — Maximum of two values.
-*   `double fclamp(double x, double lo, double hi);` — Clamps `x` into `[lo, hi]`.
-
-> [!NOTE]
-> The implementation file is named `libc/libmath.c` (not `libc/math.c`) to avoid a name collision with the `math` CLI calculator app in userland. The public header is still included as `#include "math.h"`.
-
-For advanced operations, `syscall.h` provides direct wrappers into the kernel.
-
-### Process & System Info
-*   `void sys_exit(int status);` - Raw exit syscall.
-*   `int sys_write(int fd, const char *buf, int len);` - Write to a file descriptor (usually fd 1 for stdout).
-*   `void* sys_sbrk(int incr);` - Expand or shrink the process data segment (used internally by `malloc`).
-*   `void sys_kill(int pid);` - Send a kill signal to a process.
-*   `void sys_yield(void);` - Yield the remainder of the process's timeslice to the scheduler.
-*   `int sys_system(int cmd, uint64_t arg1, uint64_t arg2, uint64_t arg3, uint64_t arg4);` - Execute a privileged system command (e.g., reboot, shutdown, beep).
-*   `int sys_get_os_info(os_info_t *info);` - Populate an `os_info_t` struct with version and environment details.
-*   `uint64_t sys_get_shell_config(const char *key);` - Retrieve internal shell configuration values.
-*   `void sys_set_text_color(uint32_t color);` - Set the raw CLI text output color.
-
-### File System API (VFS)
-Interacting with files and directories using the Virtual File System.
-*   `int sys_open(const char *path, const char *mode);` - Open a file, returning a file descriptor.
-*   `int sys_read(int fd, void *buf, uint32_t len);` - Read from an open file.
-*   `int sys_write_fs(int fd, const void *buf, uint32_t len);` - Write to an open file.
-*   `void sys_close(int fd);` - Close an open file descriptor.
-*   `int sys_seek(int fd, int offset, int whence);` - Reposition the file offset.
-*   `uint32_t sys_tell(int fd);` - Get the current file offset.
-*   `uint32_t sys_size(int fd);` - Get the total file size.
-*   `int sys_delete(const char *path);` - Delete a file.
-*   `int sys_mkdir(const char *path);` - Create a new directory.
-*   `int sys_exists(const char *path);` - Check if a path exists on the filesystem.
-*   `int sys_getcwd(char *buf, int size);` - Get the current working directory string.
-*   `int sys_chdir(const char *path);` - Change the current working directory.
-*   `int sys_list(const char *path, FAT32_FileInfo *entries, int max_entries);` - List directory contents into an array of `FAT32_FileInfo` structs.
-*   `int sys_get_file_info(const char *path, FAT32_FileInfo *info);` - Retrieve metadata for a specific file.
-
-### Networking Stack API
-BoredOS includes lwIP for hardware TCP/UDP networking.
-
-#### Configuration and Status
-*   `int sys_network_init(void);` - Initialize the network stack.
-*   `int sys_network_is_initialized(void);` - Check stack status.
-*   `int sys_network_dhcp_acquire(void);` - Request an IP configuration from a DHCP server.
-*   `int sys_network_has_ip(void);` - Check if the system has a valid IP address.
-*   `int sys_network_get_mac(net_mac_address_t *mac);` - Get the physical MAC address of the NIC.
-*   `int sys_network_get_nic_name(char *name_out);` - Get the name of the active network interface card.
-*   `int sys_network_get_ip(net_ipv4_address_t *ip);` - Get current local IPv4 address.
-*   `int sys_network_set_ip(const net_ipv4_address_t *ip);` - Manually assign a static IP.
-*   `int sys_network_get_gateway(net_ipv4_address_t *ip);` - Get the default gateway IP.
-*   `int sys_network_get_dns(net_ipv4_address_t *ip);` - Get the primary DNS server IP.
-*   `int sys_set_dns_server(const net_ipv4_address_t *ip);` - Set the primary DNS server.
-*   `int sys_get_dns_server(net_ipv4_address_t *ip);` - Retrieve configured DNS server.
-*   `int sys_network_get_stat(int stat_type);` - Get network statistics (packets in/out, drops, etc.).
-*   `void sys_network_force_unlock(void);` - Force release of network stack locks (use with caution).
-
-#### Communication
-*   `int sys_icmp_ping(const net_ipv4_address_t *dest_ip);` - Send an ICMP echo request.
-*   `int sys_udp_send(const net_ipv4_address_t *dest_ip, uint16_t dest_port, uint16_t src_port, const void *data, size_t data_len);` - Send a raw UDP datagram.
-*   `int sys_dns_lookup(const char *name, net_ipv4_address_t *out_ip);` - Resolve a hostname to an IPv4 address.
-*   `int sys_tcp_connect(const net_ipv4_address_t *ip, uint16_t port);` - Establish a TCP connection to a remote host.
-*   `int sys_tcp_send(const void *data, size_t len);` - Send data over an active TCP socket.
-*   `int sys_tcp_recv(void *buf, size_t max_len);` - Receive data from a TCP socket (blocking).
-*   `int sys_tcp_recv_nb(void *buf, size_t max_len);` - Receive data from a TCP socket (non-blocking).
-*   `int sys_tcp_close(void);` - Close the active TCP socket.
-
----
-
-## Core Data Structures
-
-### `os_info_t`
-Contains detailed build and version information about the OS.
 ```c
-typedef struct {
-    char os_name[64];
-    char os_version[64];
-    char os_codename[64];
-    char kernel_name[64];
-    char kernel_version[64];
-    char build_date[64];
-    char build_time[64];
-    char build_arch[64];
-} os_info_t;
+#include <libui.h>
+#include <libwidget.h>
 ```
 
-### `FAT32_FileInfo`
-Represents a filesystem entry.
-```c
-typedef struct {
-    char name[256];
-    uint32_t size;
-    uint8_t is_directory;
-    uint32_t start_cluster;
-    uint16_t write_date;
-    uint16_t write_time;
-} FAT32_FileInfo;
-```
+## Build and Packaging
+
+- Add app source under `src/userland/` (CLI, GUI, or games subfolder).
+- Ensure it is included in the userland build rules/targets.
+- Build from repo root with `make`.
+- Built binaries are copied into initrd under `/bin` by the top-level `Makefile`.
 
-### `ProcessInfo`
-Provides status information for an active process.
-```c
-typedef struct {
-    uint32_t pid;
-    char name[64];
-    uint64_t ticks;
-    size_t used_memory;
-} ProcessInfo;
-```
 
-### IP / MAC Addresses
-Wrappers for raw byte arrays.
-```c
-typedef struct { uint8_t bytes[6]; } net_mac_address_t;
-typedef struct { uint8_t bytes[4]; } net_ipv4_address_t;
-```

docs/appdev/syscalls.md

@@ -0,0 +1,154 @@
+# Syscall Reference
+
+This page documents the current syscall surface in BoredOS as implemented in:
+- `src/sys/syscall.h` (kernel command IDs)
+- `src/userland/libc/syscall.h` (userland wrappers)
+
+Use libc wrappers when possible instead of calling raw syscall numbers directly.
+
+## Top-Level Syscall Numbers
+
+| Number | Name | Purpose |
+|---|---|---|
+| 0 | `SYS_EXIT` (userland header) | Terminate current process |
+| 1 | `SYS_WRITE` | Write to stdout/tty path |
+| 3 | `SYS_GUI` | Window manager and drawing commands |
+| 4 | `SYS_FS` | Filesystem and fd commands |
+| 5 | `SYS_SYSTEM` | System-wide command multiplexer |
+| 9 | `SYS_SBRK` (userland header) | Heap break management |
+| 10 | `SYS_KILL` (userland header) | Kill process by PID |
+| 60 | `SYS_EXIT` (kernel header) | Internal kernel syscall number map |
+
+Notes:
+- Some numbers differ between kernel and userland headers for historical reasons. For app code, rely on wrapper functions in `src/userland/libc/syscall.c`.
+- `SYS_GUI`, `SYS_FS`, and `SYS_SYSTEM` are command multiplexers.
+
+## FS Command IDs (`SYS_FS`)
+
+| ID | Macro | Meaning |
+|---|---|---|
+| 1 | `FS_CMD_OPEN` | Open file |
+| 2 | `FS_CMD_READ` | Read from fd |
+| 3 | `FS_CMD_WRITE` | Write to fd |
+| 4 | `FS_CMD_CLOSE` | Close fd |
+| 5 | `FS_CMD_SEEK` | Seek in file |
+| 6 | `FS_CMD_TELL` | Current offset |
+| 7 | `FS_CMD_LIST` | Directory listing |
+| 8 | `FS_CMD_DELETE` | Delete file |
+| 9 | `FS_CMD_SIZE` | File size |
+| 10 | `FS_CMD_MKDIR` | Create directory |
+| 11 | `FS_CMD_EXISTS` | Path exists check |
+| 12 | `FS_CMD_GETCWD` | Get cwd |
+| 13 | `FS_CMD_CHDIR` | Change cwd |
+| 14 | `FS_CMD_GET_INFO` | File metadata |
+| 15 | `FS_CMD_DUP` | `dup` fd |
+| 16 | `FS_CMD_DUP2` | `dup2` fd |
+| 17 | `FS_CMD_PIPE` | Create pipe |
+| 18 | `FS_CMD_FCNTL` | `fcntl` flags ops |
+
+## SYSTEM Command IDs (`SYS_SYSTEM`)
+
+### Desktop and display
+
+| ID | Macro | Meaning |
+|---|---|---|
+| 1 | `SYSTEM_CMD_SET_BG_COLOR` | Set desktop background color |
+| 2 | `SYSTEM_CMD_SET_BG_PATTERN` | Set desktop background pattern |
+| 3 | `SYSTEM_CMD_SET_WALLPAPER` | Legacy wallpaper command slot |
+| 4 | `SYSTEM_CMD_SET_DESKTOP_PROP` | Set desktop behavior property |
+| 5 | `SYSTEM_CMD_SET_MOUSE_SPEED` | Set mouse speed |
+| 7 | `SYSTEM_CMD_GET_DESKTOP_PROP` | Get desktop property |
+| 8 | `SYSTEM_CMD_GET_MOUSE_SPEED` | Get mouse speed |
+| 9 | `SYSTEM_CMD_GET_WALLPAPER_THUMB` | Legacy wallpaper thumb slot |
+| 10 | `SYSTEM_CMD_CLEAR_SCREEN` | Clear text console |
+| 29 | `SYSTEM_CMD_SET_TEXT_COLOR` | Set console text color |
+| 31 | `SYSTEM_CMD_SET_WALLPAPER_PATH` | Set wallpaper from path |
+| 40 | `SYSTEM_CMD_SET_FONT` | Set active font |
+| 47 | `SYSTEM_CMD_SET_RESOLUTION` | Set display mode |
+
+### Time, power, and system state
+
+| ID | Macro | Meaning |
+|---|---|---|
+| 11 | `SYSTEM_CMD_RTC_GET` | Read RTC datetime |
+| 12 | `SYSTEM_CMD_REBOOT` | Reboot machine |
+| 13 | `SYSTEM_CMD_SHUTDOWN` | Power off machine |
+| 14 | `SYSTEM_CMD_BEEP` | PC speaker beep |
+| 15 | `SYSTEM_CMD_GET_MEM_INFO` | Return total/used memory |
+| 16 | `SYSTEM_CMD_GET_TICKS` | Return scheduler/WM tick count |
+| 28 | `SYSTEM_CMD_GET_SHELL_CONFIG` | Read shell config value |
+| 32 | `SYSTEM_CMD_RTC_SET` | Set RTC datetime |
+| 41 | `SYSTEM_CMD_SET_RAW_MODE` | Terminal raw-mode control |
+| 43 | `SYSTEM_CMD_YIELD` | Yield scheduler timeslice |
+| 46 | `SYSTEM_CMD_SLEEP` | Sleep current process |
+
+### Network
+
+| ID | Macro | Meaning |
+|---|---|---|
+| 6 | `SYSTEM_CMD_NETWORK_INIT` | Init networking |
+| 17 | `SYSTEM_CMD_PCI_LIST` | PCI device list access |
+| 18 | `SYSTEM_CMD_NETWORK_DHCP` | DHCP acquire |
+| 19 | `SYSTEM_CMD_NETWORK_GET_MAC` | Read NIC MAC |
+| 20 | `SYSTEM_CMD_NETWORK_GET_IP` | Read IPv4 |
+| 21 | `SYSTEM_CMD_NETWORK_SET_IP` | Set static IPv4 |
+| 22 | `SYSTEM_CMD_UDP_SEND` | Send UDP packet |
+| 23 | `SYSTEM_CMD_NETWORK_GET_STATS` | Network stats |
+| 24 | `SYSTEM_CMD_NETWORK_GET_GATEWAY` | Read gateway |
+| 25 | `SYSTEM_CMD_NETWORK_GET_DNS` | Read DNS server |
+| 26 | `SYSTEM_CMD_ICMP_PING` | ICMP ping |
+| 27 | `SYSTEM_CMD_NETWORK_IS_INIT` | Network initialized flag |
+| 30 | `SYSTEM_CMD_NETWORK_HAS_IP` | Has IPv4 address flag |
+| 33 | `SYSTEM_CMD_TCP_CONNECT` | TCP connect |
+| 34 | `SYSTEM_CMD_TCP_SEND` | TCP send |
+| 35 | `SYSTEM_CMD_TCP_RECV` | TCP recv (blocking) |
+| 36 | `SYSTEM_CMD_TCP_CLOSE` | TCP close |
+| 37 | `SYSTEM_CMD_DNS_LOOKUP` | DNS lookup |
+| 38 | `SYSTEM_CMD_SET_DNS` | Set DNS server |
+| 39 | `SYSTEM_CMD_NET_UNLOCK` | Force net lock release |
+| 42 | `SYSTEM_CMD_TCP_RECV_NB` | TCP recv (non-blocking) |
+| 48 | `SYSTEM_CMD_NETWORK_GET_NIC_NAME` | NIC name |
+
+### Process, tty, signals
+
+| ID | Macro | Meaning |
+|---|---|---|
+| 50 | `SYSTEM_CMD_PARALLEL_RUN` | Dispatch parallel job |
+| 60 | `SYSTEM_CMD_TTY_CREATE` | Create tty |
+| 61 | `SYSTEM_CMD_TTY_READ_OUT` | Read tty output buffer |
+| 62 | `SYSTEM_CMD_TTY_WRITE_IN` | Write tty input buffer |
+| 63 | `SYSTEM_CMD_TTY_READ_IN` | Read input for current tty |
+| 64 | `SYSTEM_CMD_SPAWN` | Spawn process |
+| 65 | `SYSTEM_CMD_TTY_SET_FG` | Set tty foreground PID |
+| 66 | `SYSTEM_CMD_TTY_GET_FG` | Get tty foreground PID |
+| 67 | `SYSTEM_CMD_TTY_KILL_FG` | Kill tty foreground PID |
+| 68 | `SYSTEM_CMD_TTY_KILL_ALL` | Kill tty process group |
+| 69 | `SYSTEM_CMD_TTY_DESTROY` | Destroy tty |
+| 70 | `SYSTEM_CMD_EXEC` | Exec replace current process |
+| 71 | `SYSTEM_CMD_WAITPID` | Wait/reap child |
+| 72 | `SYSTEM_CMD_KILL_SIGNAL` | Send signal |
+| 73 | `SYSTEM_CMD_SIGACTION` | Set/get handler |
+| 74 | `SYSTEM_CMD_SIGPROCMASK` | Signal mask ops |
+| 75 | `SYSTEM_CMD_SIGPENDING` | Get pending signals |
+
+### ELF app metadata
+
+| ID | Macro | Meaning |
+|---|---|---|
+| 76 | `SYSTEM_CMD_GET_ELF_METADATA` | Read full app metadata from an ELF |
+| 77 | `SYSTEM_CMD_GET_ELF_PRIMARY_IMAGE` | Read primary icon path from an ELF |
+
+## Common Wrapper API (`src/userland/libc/syscall.h`)
+
+Typical wrappers used by apps:
+- Process/system: `sys_exit`, `sys_yield`, `sys_spawn`, `sys_exec`, `sys_waitpid`, `sys_kill_signal`
+- Filesystem: `sys_open`, `sys_read`, `sys_write_fs`, `sys_close`, `sys_seek`, `sys_tell`, `sys_size`, `sys_list`
+- Network: `sys_network_init`, `sys_network_dhcp_acquire`, `sys_udp_send`, `sys_tcp_connect`, `sys_tcp_recv_nb`, `sys_dns_lookup`
+- TTY: `sys_tty_create`, `sys_tty_read_out`, `sys_tty_write_in`, `sys_tty_set_fg`
+- ELF metadata: `sys_get_elf_metadata`, `sys_get_elf_primary_image` — see [`elf_metadata.md`](elf_metadata.md) for full usage
+
+## Best Practices
+
+- Do not hardcode numeric command IDs in app code.
+- Prefer high-level libc calls (`open`, `read`, `waitpid`, `sigaction`) where available.
+- Use `syscall.h` macros when a raw `sys_system` call is still needed.

docs/architecture/graphics/window_manager.md

@@ -16,7 +16,7 @@ BoredOS features a fully custom, graphical Window Manager built directly into th
 > [!TIP]
 > The performance of the window manager heavily depends on minimizing the "dirty regions" drawn in the compositing loop rather than sweeping the whole screen.
 
-## 🪟 Window System (`wm.c`)
+## Window System (`wm.c`)
 
 The windowing system is built around a linked list of `Window` structures.
 
@@ -34,7 +34,7 @@ The WM acts as the central hub for input routing.
 
 - **Event Polling**: The UI loop inside an app continuously calls `ui_poll_event()` to respond to mouse clicks and window movement dispatched by the kernel WM.
 
-## 🧵 Multi-Core Safety & Performance
+## Multi-Core Safety & Performance
 
 With the introduction of Symmetric Multi-Processing (SMP), the Window Manager (WM) was redesigned to ensure stability and high performance across multiple cores.
 

docs/architecture/hardware/pci.md

@@ -0,0 +1,41 @@
+# PCI Bus Subsystem
+
+The Peripheral Component Interconnect (PCI) subsystem in BoredOS is responsible for discovering, enumerating, and configuring hardware devices connected to the motherboard. It provides the foundation for the OS to load specific device drivers (like Network Interface Cards or AHCI controllers).
+
+## 1. Configuration Space Access
+
+BoredOS interacts with the PCI bus via the legacy x86 I/O ports:
+- **`0xCF8`**: Address Port (used to select a specific bus, device, function, and register offset).
+- **`0xCFC`**: Data Port (used to read or write the 32-bit value at the selected address).
+
+These are abstracted in `src/dev/pci.c` by the `pci_read_config()` and `pci_write_config()` functions. By writing a formatted 32-bit address to `0xCF8`, the CPU signals the PCI bridge to route the subsequent data read/write on `0xCFC` to the correct hardware device.
+
+## 2. Device Enumeration
+
+During boot, BoredOS recursively scans the PCI buses. The PCI bus topology is hierarchical:
+- Up to **256 buses**.
+- Each bus has up to **32 devices**.
+- Each device has up to **8 functions** (for multi-function devices).
+
+The enumeration process (`pci_enumerate_devices`):
+1. Iterates through Bus 0 to 255.
+2. For each bus, iterates through Devices 0 to 31.
+3. For each device, it reads the `Vendor ID` at offset 0. If the value is `0xFFFF`, no device is present at that slot.
+4. If a valid Vendor ID is found, it populates a `pci_device_t` structure containing the:
+   - `Vendor ID` and `Device ID` (used to uniquely identify the hardware model).
+   - `Class Code`, `Subclass`, and `Prog IF` (used to identify the generic type of the device, e.g., Network Controller, Mass Storage Controller).
+
+## 3. Base Address Registers (BARs)
+
+PCI devices expose memory-mapped I/O (MMIO) regions or I/O port ranges via Base Address Registers (BARs). 
+BoredOS provides the `pci_get_bar(dev, bar_num)` function to extract these base addresses.
+
+Drivers use BARs to talk directly to the hardware. For example:
+- The AHCI driver reads BAR5 to find the base address of the AHCI memory registers (ABAR).
+- The E1000 driver uses a BAR to map the NIC's control registers into the kernel's virtual memory space.
+
+## 4. Hardware Configuration
+
+Once a device is found, drivers can call helper functions to enable specific PCI features:
+- **`pci_enable_bus_mastering(dev)`**: Sets the Bus Master bit in the PCI Command Register. This is critical for drivers that use DMA (Direct Memory Access), allowing the hardware to read/write system RAM independently of the CPU (used heavily by AHCI and Network drivers).
+- **`pci_enable_mmio(dev)`**: Sets the Memory Space Enable bit, allowing the CPU to access the device's MMIO regions.

docs/architecture/input/keyboard.md

@@ -0,0 +1,273 @@
+# Input Subsystem
+
+## Overview
+The input subsystem is responsible for handling user input, primarily from the keyboard.
+
+It provides a structured pipeline that transforms low-level hardware signals into usable data for the kernel and higher-level components. This subsystem abstracts hardware-specific behavior and exposes a consistent interface to the rest of the operating system.
+
+---
+
+## Scope
+The `/input` directory focuses on keyboard input. It includes:
+
+- A keyboard driver responsible for handling hardware events
+- A keycode layer used as an intermediate representation
+- A keymap system that translates keycodes into characters
+
+---
+
+## Design Principles
+
+- **Hardware abstraction**  
+  Hardware-specific logic is isolated from higher-level components.
+
+- **Simplicity**  
+  The input path is kept minimal and efficient, especially in interrupt context.
+
+- **Modularity**  
+  Each stage of input processing is handled by a dedicated component.
+
+- **Extensibility**  
+  The system is designed to support additional input devices and layouts in the future.
+
+---
+
+## Directory Structure
+```
+input/
+├── keyboard.c
+├── keyboard.h
+├── keycodes.h
+├── keymap.c
+├── keymap.h
+```
+
+---
+
+## Input Processing Model
+
+Keyboard input is processed in three distinct stages:
+
+1. Raw scancodes are received from the hardware
+2. Scancodes are converted into keycodes
+3. Keycodes are translated into characters or control signals
+
+Each stage is handled independently to ensure clarity and maintainability.
+
+---
+
+## Components
+
+### Keyboard Driver
+
+#### Overview
+The keyboard driver interfaces directly with the keyboard hardware. It handles interrupts and processes raw input data from the controller.
+
+#### Responsibilities
+
+- Handle keyboard interrupts
+- Read scancodes from the PS/2 controller
+- Convert scancodes into keycodes
+- Forward processed data to higher layers
+
+#### Behavior
+
+The driver operates in an interrupt-driven context. When a key event occurs, the hardware triggers an interrupt. The driver reads the corresponding scancode and processes it immediately.
+
+Because this code runs at a low level, it must be fast, predictable, and minimal.
+
+#### Integration
+
+The keyboard driver depends on:
+
+- The PS/2 controller driver for hardware communication
+- The interrupt subsystem for event handling
+
+It provides output to:
+
+- The keycode system
+- The keymap system
+
+#### Constraints
+
+- Must not block execution
+- Must minimize processing time per interrupt
+- Must correctly handle key press and key release events
+
+---
+
+### Keycodes
+
+#### Overview
+Keycodes define a hardware-independent representation of keyboard keys.
+
+They serve as an abstraction layer between raw scancodes and higher-level logic.
+
+#### Purpose
+
+The keycode system standardizes keyboard input by mapping all physical key events to a consistent set of identifiers.
+
+This allows the system to:
+
+- Remain independent from specific hardware implementations
+- Simplify input handling logic
+- Support multiple layouts and configurations
+
+#### Design
+
+Each key is represented by a unique constant, such as:
+
+- KEY_A
+- KEY_ENTER
+- KEY_SHIFT
+
+#### Role in the System
+
+Keycodes act as the intermediate layer between:
+
+- Hardware-level scancodes
+- Character-level or command-level input
+
+#### Usage
+
+- Generated by the keyboard driver
+- Consumed by the keymap system
+
+#### Extensibility
+
+The keycode system can be extended to support:
+
+- Additional keys (function keys, multimedia keys)
+- Non-standard input devices
+- Custom mappings
+
+---
+
+### Keymap
+
+#### Overview
+The keymap system translates keycodes into characters or control signals.
+
+It defines how physical key presses are interpreted based on layout and modifier state.
+
+#### Responsibilities
+
+- Convert keycodes into ASCII or equivalent representations
+- Apply modifier logic such as Shift and Control
+- Provide consistent character output
+
+#### Behavior
+
+The keymap takes a keycode as input and produces an output depending on:
+
+- The current keyboard layout
+- Active modifier keys
+
+The same keycode may produce different results depending on modifier state.
+
+
+#### Integration
+
+- Receives keycodes from the keyboard driver
+- Outputs characters to the kernel or userland
+
+---
+
+## Control Signals
+
+In addition to character generation, the input subsystem produces **control signals** representing non-printable keys and command-oriented input.
+
+These signals are derived from keycodes that do not map directly to ASCII characters.
+
+---
+
+### Definition
+
+A control signal is an abstract representation of a key event used to trigger system-level behavior rather than text output.
+
+Typical control signals include:
+
+- Enter
+- Backspace
+- Escape
+- Tab
+- Arrow keys
+- Function keys
+
+---
+
+### Encoding
+
+Control signals may be represented in different ways depending on the layer:
+
+#### ASCII Control Characters (when applicable)
+
+Some keys map to standard ASCII control codes:
+
+- `ENTER` → `0x0A` (Line Feed) or `0x0D` (Carriage Return)
+- `BACKSPACE` → `0x08`
+- `TAB` → `0x09`
+- `ESC` → `0x1B`
+
+These values are part of the ASCII control range (`0x00`–`0x1F`).
+
+---
+
+#### Non-ASCII Keys
+
+Keys that do not belong to the ASCII set are typically handled as **extended keycodes** or **internal constants**:
+
+Examples:
+
+- Arrow keys
+- Insert / Delete
+- Home / End
+- Function keys (F1–F12)
+
+------
+## Non-ASCII Characters
+
+Non-ASCII characters include any character outside the standard 7-bit ASCII range (`0x00`–`0x7F`).
+
+Examples:
+
+- Accented characters: `é`, `à`, `ç`
+- Symbols: `€`, `£`
+- Unicode characters from non-Latin scripts
+
+---
+
+### Encoding Considerations
+
+The current system typically assumes ASCII output. However, supporting non-ASCII characters requires:
+
+- A wider character encoding (e.g. UTF-8)
+- Extended keymaps capable of mapping key combinations to multi-byte sequences
+
+Example:
+
+- `'é'` in UTF-8 → `0xC3 0xA9`
+
+---
+
+### Modifier and Layout Impact
+
+Non-ASCII characters are often produced through:
+
+- Keyboard layout differences (AZERTY vs QWERTY)
+- Modifier combinations (Shift, AltGr)
+
+Example:
+
+- `AltGr + E` → `'€'` (depending on layout)
+- `KEY_E` → `'e'`
+- `KEY_E + SHIFT` → `'E'`
+
+---
+
+### Usage
+
+- Control signals are used for command handling and system interaction
+- Non-ASCII characters are used for text input and require proper encoding support
+
+

docs/architecture/memory/memory_manager.md

@@ -0,0 +1,71 @@
+# Kernel Memory Manager Architecture
+
+BoredOS utilizes a highly optimized, two-tier kernel memory manager (`memory_manager.c`) designed for performance, concurrency safety, and long-term stability. The API provides the standard POSIX-like `kmalloc`, `krealloc`, and `kfree` functions used universally throughout the kernel.
+
+## 1. High-Level Design
+
+The memory manager delegates allocation requests to one of two internal sub-systems based on the requested size and alignment parameters:
+
+1. **Slab Allocator**: Optimally handles all small allocations (<= 512 bytes) with an alignment restriction of <= 8 bytes.
+2. **Block-List Allocator**: Handles large allocations (> 512 bytes) and any request requiring aggressive alignment (such as page-aligned buffers).
+
+All operations within the memory manager are secured by a global interrupt-safe spinlock (`mm_lock`), rendering the memory subsystem completely atomic and safe to use from any CPU or interrupt handler without triggering a race condition.
+
+---
+
+## 2. The Slab Allocator (Small Objects)
+
+For frequent, small data structures, the overhead of standard heap fragmentation is unacceptable. The Slab Allocator addresses this by pre-allocating blocks of identical size.
+
+### Classes & Geometry
+There are 7 active slab classes defined by `slab_sizes[]`: `8, 16, 32, 64, 128, 256, 512` bytes. 
+Whenever an allocation requests a size within these bounds, it is rounded up to the nearest valid class.
+
+Each active slab page maps precisely to one standard system `PAGE_SIZE` (4096 bytes). 
+- The page header (`SlabPage`) is embedded at the very top (byte offset 0).
+- The rest of the page is sliced seamlessly into perfectly sized object slots.
+
+### Intrusive LIFO Free-List
+To minimize metadata overhead, the Slab Allocator uses an *intrusive* LIFO (Last-In-First-Out) free-list to track empty object slots. The first 8 bytes of any unallocated slot act as a `next` pointer to the next free slot in that page. When a pointer is freed, it is immediately pushed back to the head of this list, making it the most likely candidate for the *next* allocation. This maximizes CPU cache locality.
+
+### Guardrails & Safety
+The Slab Allocator implements highly restrictive checks to guard against fatal kernel errors:
+- **Canonical Address Checks:** The allocator verifies that the freelist head remains in the higher-half address space (`0xFFFF000000000000` or above), proactively detecting structural corruption.
+- **Strict Pointer Admittance:** Before freeing a pointer to a slab, the allocator validates a dual magic-number footprint, limits the pointer's bounds to verify it belongs geographically to the page, and executes a linked-list walk. 
+- **Double-Free Detection:** When a slab is freed, the allocator walks the internal free-list. If the freed pointer is already in the free-list, the allocator intercepts the double-free attempt before the internal state can be damaged.
+
+---
+
+## 3. The Block-List Allocator (Large Objects)
+
+If an allocation is larger than 512 bytes, the memory manager falls back to the Block-List allocator. 
+
+### First-Fit Search & Splitting
+The Block Allocator tracks all system memory chunks using an array of `MemBlock` structs ordered dynamically by address.
+- It iterates through the array utilizing a **First-Fit Search**. The first contiguous, unallocated block that satisfies the `size` requirement is immediately claimed.
+- If the requested alignment dictates it, the allocator splits the parent block. It yields up to three new fragments: `[head padding | exact requested allocation | tail remainder]`.
+
+### Bootstrapping & Heap Migration
+To avoid infinite recursion when allocating memory to track new memory blocks, the block list is initially statically allocated in a `.bss` array (`_bootstrap_blocks`) with an initial capacity of 64 `MemBlocks`.
+
+When the system runs out of capacity to track new blocks, the block list calls `grow_block_list()`, which reallocates the array space into the primary heap. It utilizes a `growing` lock-flag to prevent recursive faults while performing this relocation.
+
+### Coalescing
+Upon `kfree()`, the chunk is marked as unallocated. The allocator inspects its immediate left and right address neighbors. If they are also free, the adjacent blocks are merged (coalesced) into one continuous block to reduce overall memory fragmentation. 
+
+---
+
+## 4. API Caveats & Contracts
+
+### Alignment guarantees
+`kmalloc` inherently returns a naturally aligned pointer (minimum 8-byte boundary) sufficient to satisfy scalar types natively on x86-64 without fetching faults. `kmalloc_aligned` can be utilized for strict power-of-two alignment boundaries (e.g., page directories that demand 4096 alignment).
+
+### Resizing limits
+`krealloc` accepts an existing allocated pointer and transforms it to meet a new size requirement. To prevent memory starvation over long lifetimes, `krealloc` employs aggressive optimization strategies depending on the allocator layer:
+- **Block Allocator (Shrink-in-Place):** Large blocks actively support shrink-in-place maneuvers. If the reduction saves at least 32 bytes, the unused trailing memory is sliced off, injected into the free pool, and physically coalesced with adjacent free neighbors. The original pointer remains identical.
+- **Slab Allocator (Down-Migration):** Since slab slots have rigid geometries, true shrink-in-place is impossible. However, if a pointer shrinks enough to cleanly fall into a smaller slab class, `krealloc` triggers an internal copy-migration. This instantly relinquishes the highly-contested larger slab slot back to the system.
+
+---
+
+## 5. Telemetry & Metrics
+The `memory_get_stats()` API exports complete transparency over the current topological state of the system memory map. It calculates variables such as peak memory, overall fragmentation % (the ratio of stranded memory outside the largest single block), and explicit slab efficiency counters.

docs/architecture/network/network_stack.md

@@ -0,0 +1,52 @@
+# Networking Stack
+
+BoredOS features a robust networking stack capable of handling Ethernet, IPv4, TCP, UDP, ICMP, DHCP, and DNS. The stack is built on top of the **lwIP (Lightweight IP)** library, which is integrated with a custom hardware driver layer.
+
+## 1. Architecture Overview
+
+The network stack is split into three main layers:
+1. **Hardware/Driver Layer (`src/net/nic/`)**: Communicates with physical and virtual Network Interface Cards (NICs), handling raw Ethernet frame transmission and reception. Supported drivers include the Intel E1000 (`e1000.c`), Realtek RTL8139 (`rtl8139.c`), Realtek RTL8111 (`rtl8111.c`), and VirtIO network devices (`virtio_net.c`). A generic interface is provided via `nic.c`.
+2. **Protocol Layer (lwIP)**: Processes Ethernet frames, handles ARP resolution, routes IPv4 packets, and manages TCP state machines.
+3. **OS Interface Layer (`src/net/network.c`)**: Wraps the asynchronous lwIP API into a synchronous, easy-to-use API for BoredOS applications and the kernel.
+
+## 2. Initialization & Polling
+
+### `network_init()`
+When the kernel boots, it initializes the network subsystem by:
+1. Probing the PCI bus for supported NICs (e.g., the Intel E1000).
+2. Initializing the lwIP core (`lwip_init()`) and DNS subsystem.
+3. Binding the hardware NIC to lwIP using `netif_add`.
+4. Automatically attempting to acquire an IP address via DHCP (`network_dhcp_acquire()`).
+
+### The Polling Mechanism (`network_process_frames`)
+Unlike some operating systems that process network packets entirely inside hardware interrupt handlers, BoredOS uses a **polled approach** to avoid re-entrancy issues in the TCP/IP stack. 
+
+The `network_process_frames()` function is called periodically (e.g., from the Window Manager loop or during blocking network calls). It calls:
+- `nic_netif_poll()`: Pulls raw packets from the NIC ring buffer and feeds them to lwIP (`ethernet_input`).
+- `sys_check_timeouts()`: Fires lwIP internal timers for TCP retransmissions, ARP cache expiration, and DHCP lease renewals.
+
+A `network_processing` flag acts as a lightweight spinlock to prevent nested execution of the network poll loop.
+
+## 3. TCP Implementation & Application API
+
+While lwIP provides a callback-based raw API, BoredOS wraps this into a sequential API for userland applications.
+
+Currently, the OS supports **one active TCP connection globally across the entire system**. The connection state is managed via a global Protocol Control Block (`current_tcp_pcb`). To prevent unauthorized cleanup, the OS tracks which process initiated the connection (`tcp_owner_pid`). If a new process attempts to connect while a connection is active, the existing connection is forcefully aborted.
+
+### `network_tcp_connect(ip, port)`
+1. Allocates a new Protocol Control Block (`tcp_new()`).
+2. Registers callbacks for receive (`tcp_recv_callback`), error, and connection success.
+3. Blocks (while polling the network) until the connection succeeds or times out after 15 seconds.
+
+### `network_tcp_recv(buf, max_len)`
+When packets arrive, `tcp_recv_callback` chains them into a `tcp_recv_queue` (`struct pbuf`). 
+The `network_tcp_recv` function blocks until data is available in this queue, then copies it into the application's buffer and frees the `pbuf`. A non-blocking variant (`network_tcp_recv_nb`) is also provided.
+
+### Process Cleanup (`network_cleanup`)
+If an application crashes or exits without closing its socket, the kernel's process manager calls `network_cleanup()`. This checks if the exiting process owns the current TCP PCB (`tcp_owner_pid`) and forcibly aborts the connection to prevent resource leaks.
+
+## 4. Helper Protocols
+
+- **DHCP:** Managed entirely by lwIP. BoredOS simply waits up to 10 seconds during boot for a lease.
+- **DNS (`network_dns_lookup`):** Uses lwIP's `dns_gethostbyname`. It blocks and polls until the callback is triggered with the resolved IP address.
+- **ICMP (Ping):** The kernel provides a `network_icmp_single_ping` function using an lwIP raw socket (`raw_pcb`) to construct, checksum, and transmit an ICMP Echo Request, blocking until a reply is received to calculate the Round-Trip Time (RTT).

docs/architecture/storage/ahci_drivers.md

@@ -0,0 +1,40 @@
+# AHCI Storage Driver
+
+BoredOS implements an Advanced Host Controller Interface (AHCI) driver to interface with Serial ATA (SATA) mass storage devices. The driver is located in `src/dev/ahci.c` and allows the OS to read and write sectors directly to physical hard drives or solid-state drives using DMA (Direct Memory Access).
+
+## 1. Discovery and Initialization
+
+The AHCI initialization process (`ahci_init`) starts by querying the PCI subsystem:
+1. It searches for a PCI device with Class `0x01` (Mass Storage) and Subclass `0x06` (SATA).
+2. It calls `pci_enable_bus_mastering` and `pci_enable_mmio` to ensure the controller can perform DMA and its registers are accessible.
+3. It retrieves the **ABAR** (AHCI Base Address Register) from PCI BAR5.
+4. The ABAR points to the `HBA_MEM` structure (Host Bus Adapter Memory Registers). The kernel iterates through the `pi` (Ports Implemented) bitmask to find active SATA ports.
+
+## 2. Port Configuration
+
+For every active SATA port found, the driver must allocate memory structures that the hardware will use to process commands:
+1. **Command List Base (`clb`)**: A 1KB memory region holding 32 Command Headers.
+2. **FIS Base (`fb`)**: A 256-byte memory region where the HBA writes incoming Frame Information Structures (FIS) from the drive.
+3. **Command Tables (`ctba`)**: A larger memory region allocated for each Command Header, containing the actual SATA command bytes and the scatter/gather lists (PRDT).
+
+*Note:* All AHCI data structures must be allocated in physically contiguous memory and properly aligned (e.g., 1KB or 256-byte boundaries) because the HBA reads them directly from physical RAM via DMA.
+
+## 3. Physical Region Descriptor Tables (PRDT)
+
+When reading or writing data, BoredOS must tell the AHCI controller where in RAM the data should be stored or fetched. This is done using PRDT entries.
+
+Each `HBA_PRDT_ENTRY` specifies:
+- A physical Data Base Address (`dba`).
+- A Byte Count (`dbc`), limited to a maximum of 4MB per entry.
+
+If a read/write request spans multiple fragmented pages or exceeds 4MB, the driver constructs multiple PRDT entries within the Command Table to form a scatter/gather list. The AHCI hardware seamlessly processes these entries as a single contiguous disk operation.
+
+## 4. Reading and Writing Sectors
+
+To execute a command (e.g., `ahci_read_sectors` or `ahci_write_sectors`):
+1. The driver finds a free slot in the Command List.
+2. It populates the Command Header, setting the `cfl` (Command FIS Length) and `w` (Write) bit.
+3. It builds a Host-to-Device Register FIS (`FIS_REG_H2D`) in the Command Table, issuing the `ATA_CMD_READ_DMA_EX` or `ATA_CMD_WRITE_DMA_EX` command and specifying the starting LBA (Logical Block Address) and sector count.
+4. It sets up the PRDT entries pointing to the physical memory of the provided buffer.
+5. It sets the corresponding bit in the Port's Command Issue register (`ci`).
+6. The driver then polls the `ci` register (or waits for an interrupt) until the bit clears, indicating the hardware has completed the DMA transfer.

docs/architecture/system/core.md

@@ -34,7 +34,7 @@ BoredOS uses **Limine** as its primary bootloader.
 5.  **Driver Initialization**: PCI buses are scanned, finding the network card or disk controllers. The filesystem is mounted.
 6.  **Window Manager**: The UI is drawn on top of the Limine-provided framebuffer.
 
-## 🧵 Multi-Core & Scheduling
+## Multi-Core & Scheduling
 
 BoredOS utilizes Symmetric Multi-Processing (SMP) to distribute workloads across all available CPU cores.
 

docs/architecture/system/processes.md

@@ -0,0 +1,66 @@
+# Process Management & Scheduling
+
+BoredOS implements a lightweight, symmetric multiprocessing (SMP) capable multitasking environment. This document outlines the architecture of the scheduler, process structures, context switching, and ELF binary loading.
+
+## 1. Process Structure (`process_t`)
+
+The core of the process management system is the `process_t` structure, defined in `src/sys/process.h`. Due to kernel memory constraints, BoredOS supports a maximum of 16 concurrent processes (`MAX_PROCESSES`), stored in a statically allocated array.
+
+Key fields include:
+- **Identification:** `pid`, `parent_pid`, `pgid` (Process Group ID), and `name`.
+- **Memory & Context:**
+  - `rsp`: The saved stack pointer during a context switch.
+  - `pml4_phys`: The physical address of the Page Map Level 4 table (VMM root) for this process.
+  - `kernel_stack` & `user_stack_alloc`: Pointers to allocated stack memory.
+- **Scheduler State:** `ticks`, `sleep_until`, `is_idle`, `cpu_affinity`.
+- **Resources:**
+  - `fds`: File descriptor table tracking open files, pipes, and sockets (up to `MAX_PROCESS_FDS` = 16).
+  - `gui_events`: A circular queue for Window Manager events (keyboard, mouse).
+- **Signals:** POSIX-like signal tracking via `signal_mask` and `signal_pending`.
+
+## 2. The Scheduler
+
+BoredOS uses a **Preemptive Round-Robin** scheduler implemented as a circular linked list. 
+
+### Symmetric Multiprocessing (SMP)
+Each CPU core maintains its own `current_process` pointer (`current_process[my_cpu]`). When a new user process is spawned via `process_create_elf`, the kernel assigns it to an Application Processor (AP) core using a simple round-robin assignment policy (`next_cpu_assign`), avoiding Core 0 (BSP) which is typically reserved for kernel tasks and driver interrupts.
+
+### The `process_schedule` Loop
+When the timer interrupt fires, it calls `process_schedule(current_rsp)`:
+1. It saves the `current_rsp` into the current process's structure.
+2. It handles cleanup of killed processes (`kill_pending`).
+3. It traverses the circular linked list (`cur->next`) looking for a process where `cpu_affinity == my_cpu`.
+4. It checks if the process is sleeping (`sleep_until > now`).
+5. It switches the hardware context:
+   - Updates the Task State Segment (TSS) ring 0 stack pointer.
+   - Switches the page directory by writing the new `pml4_phys` to `CR3`.
+   - Returns the new process's `rsp`, which the interrupt handler then pops into registers.
+
+## 3. Context Switching
+
+Context switching is achieved by manually constructing an interrupt stack frame (IRETQ frame). 
+
+When a process is created, the kernel sets up the top of its kernel stack with:
+- `SS` (Stack Segment: `0x1B` for user, `0x10` for kernel)
+- `RSP` (The process's stack pointer)
+- `RFLAGS` (`0x202` to ensure interrupts are enabled)
+- `CS` (Code Segment: `0x23` for user, `0x08` for kernel)
+- `RIP` (The entry point of the binary or function)
+- Zeroed space for General Purpose Registers and a 512-byte `fxsave` region for FPU/SSE state.
+
+When `process_schedule` returns the new `rsp`, the assembly interrupt stub uses `pop` instructions to restore the general-purpose registers, and finally executes `iretq`, transitioning execution to the new process seamlessly.
+
+## 4. ELF Loading
+
+Userland applications in BoredOS are standard 64-bit ELF binaries. 
+
+The function `process_create_elf` orchestrates this:
+1. **Memory Allocation:** Creates a new PML4 page table for the user process.
+2. **Parsing:** Calls `elf_load(filepath, pml4, &size)` to parse the ELF headers, allocate required physical memory, and copy the executable segments (text, data, bss) into the process's virtual address space at the locations specified by the ELF program headers.
+3. **Stack Setup:** Allocates a 256KB user stack mapped at `0x800000`. 
+4. **Argument Passing:** Parses the `args_str` passed to the executable and pushes an `argv` array onto the newly allocated user stack.
+5. **Execution:** Sets the stack frame's `RIP` to the ELF entry point and links the process into the scheduler's run queue.
+
+## 5. Process Termination
+
+When a process exits (or is killed), it is not immediately freed. The scheduler sets `kill_pending = true`. The actual destruction of the PML4 table and stack allocations is deferred to the next tick inside `process_schedule` to avoid freeing the memory of the code currently executing the cleanup.

docs/architecture/versioning.md

@@ -0,0 +1,110 @@
+# BoredOS Versioning
+
+BoredOS uses two independent version numbers: one for the **OS release** and one for the **kernel**. They evolve at different rates and follow different conventions.
+
+---
+
+## OS Version
+
+The OS version follows a **date-based** scheme:
+
+```
+YY.M[.x]
+```
+
+| Component | Meaning |
+|-----------|---------|
+| `YY`      | Two-digit year (e.g. `26` for 2026) |
+| `M`       | Month number, no leading zero (e.g. `4` for April, `12` for December) |
+| `.x`      | Optional patch identifier — a small sequential integer that has **no relation to a specific day** |
+
+### Examples
+
+| Version  | Meaning |
+|----------|---------|
+| `26.4`   | Base release for April 2026 |
+| `26.5`   | Base release for May 2026 |
+| `26.5.1` | First patch on top of the May 2026 release |
+| `26.5.2` | Second patch on top of the May 2026 release |
+| `26.12`  | Base release for December 2026 |
+
+### Rules
+
+- The **base release** (`YY.M`) is cut once per month when a milestone is ready.
+- Patch releases (`YY.M.x`) are issued for fixes or smaller additions that land between two monthly milestones. The `.x` counter starts at `1` and increments sequentially — it is **not** tied to a calendar day.
+- A `-dev` or `-rc` suffix may be appended to any version string during active development (e.g. `26.5-dev`, `26.5.1-rc1`).
+- The version string is defined in [`src/core/version.c`](../../src/core/version.c) as `os_version`.
+
+---
+
+## Kernel Version
+
+The kernel version follows **Semantic Versioning**:
+
+```
+MAJOR.MINOR.PATCH
+```
+
+| Component | When to increment |
+|-----------|------------------|
+| `MAJOR`   | A breaking or fundamentally large architectural change (e.g. rewriting the syscall layer, introducing a new memory model) |
+| `MINOR`   | A meaningful new feature or a notable internal improvement that does not break existing interfaces |
+| `PATCH`   | A small fix, refactor, or incremental improvement |
+
+### Examples
+
+| Transition          | Reason |
+|---------------------|--------|
+| `4.2.0` → `5.0.0`  | Major kernel rework (e.g. full syscall dispatch-table refactor, new scheduler) |
+| `4.2.0` → `4.3.0`  | New subsystem or feature addition (e.g. adding Lua runtime, new VFS driver) |
+| `4.2.0` → `4.2.1`  | Small fix or minor tweak (e.g. PIT calibration fix, terminal newline correction) |
+
+### Rules
+
+- When `MAJOR` is bumped, `MINOR` and `PATCH` reset to `0`.
+- When `MINOR` is bumped, `PATCH` resets to `0`.
+- A `-dev` suffix may be appended during active development (e.g. `5.0.0-dev`).
+- The version string is defined in [`src/core/version.c`](../../src/core/version.c) as `kernel_version`.
+
+---
+
+## Where Versions Are Declared
+
+Both version strings live in a single file:
+
+```c
+// src/core/version.c
+
+const char *os_version     = "26.5-dev";
+const char *kernel_version = "4.2.0-dev";
+```
+
+When cutting a release, update both strings, remove the `-dev` suffix, tag the commit (`git tag v26.5`), and then immediately bump to the next `-dev` version.
+
+---
+
+## Codename
+
+Each release may carry an informal **codename**. A single word that gives the release a human-friendly identity. Codenames are stored in [`src/core/version.c`](../../src/core/version.c) as `os_codename` and exposed to userspace via the `get_os_info` syscall.
+
+### Convention
+
+- Codenames **generally change with each monthly base release** (`YY.M`), but this is not a hard rule. A codename may carry over into the next month if the release feels like a natural continuation of the previous one.
+- Patch releases (`YY.M.x`) **always keep the same codename** as the base release they belong to.
+- There is no enforced theme, but names tend to be short, memorable single words.
+
+### Examples
+
+| OS Version | Codename  
+|------------|-----------|
+| `26.4`     | Voyager   
+| `26.5`     | Genesis
+
+### Where It Is Declared
+
+```c
+// src/core/version.c
+
+const char *os_codename = "Genesis";
+```
+

docs/build/toolchain.md

@@ -18,35 +18,4 @@ To build BoredOS, you need the following tools:
     -   *Why?* `xorriso` packages the compiled kernel, Limine bootloader, and asset files (fonts, images, userland binaries) into the final bootable `boredos.iso` CD-ROM image.
 
 4.  **QEMU** (Optional but highly recommended for testing):
-    -   `qemu-system-x86_64` is used for rapid emulation and testing.
-
-## Installation (macOS)
-
-You can easily install the complete toolchain using Homebrew:
-
-```sh
-brew install x86_64-elf-binutils x86_64-elf-gcc nasm xorriso qemu
-```
-
-## Installation (Linux)
-
-Depending on your distribution, the installation commands vary. Note that some distributions may require you to build the `x86_64-elf` cross-compiler from source if it isn't available in their default repositories.
-
-### Debian / Ubuntu
-```sh
-sudo apt update
-sudo apt install build-essential bison flex libgmp3-dev libmpc-dev libmpfr-dev texinfo nasm xorriso qemu-system-x86
-```
-*(Note: You will need to build the `x86_64-elf` cross-compiler from source or find a compatible PPA, as it is not in the default Debian/Ubuntu repositories.)*
-
-### Arch Linux
-Arch Linux provides the regular tools in its standard repositories and the cross-compiler via the AUR:
-```sh
-sudo pacman -S nasm xorriso qemu-full
-yay -S x86_64-elf-gcc x86_64-elf-binutils
-```
-
-### Fedora
-```sh
-sudo dnf install make gcc gcc-c++ bison flex gmp-devel mpfr-devel libmpc-devel texinfo nasm xorriso qemu
-```
+    -   `qemu-system-x86_64` is used to virtualize the OS for testing or to mess around.

docs/build/usage.md

@@ -33,14 +33,21 @@ To run BoredOS successfully (either in emulation or on bare metal), your target
 
 To test the generated ISO quickly without real hardware, use the QEMU emulator:
 
+For MacOS:
 ```sh
-make run
+make run-mac
+```
+For Linux:
+```sh
+make run-linux
+```
+For Windows:
+```sh
+make run-windows
 ```
-
 This command invokes QEMU with specific arguments:
 -   `-m 4G`: Allocates 4 Gigabytes of RAM.
 -   `-cdrom boredos.iso`: Mounts the built OS image as a CD-ROM.
--   `-netdev user...`: Sets up a basic NAT network interface for the OS's networking stack.
 -   `-smp 4`: Enables 4 CPU cores.
 -   `-drive file=disk.img...`: Attaches a raw disk image included in this release of BoredOS.
 

docs/usage/terminal.md

@@ -19,7 +19,7 @@ Bsh loads its configuration from:
 
 `/Library/bsh/bshrc`
 
-This file is similar to `.zshrc` and can define:
+This file is similar to `.zshrc` or `.bashrc` and can define:
 - `PATH` for command lookup
 - `STARTUP` for interactive shell startup scripts
 - `BOOT_SCRIPT` for a once-per-boot script

src/arch/syscalls.asm

@@ -7,12 +7,13 @@ extern syscall_handler_c
 section .text
 
 ; Syscall ABI:
-; RDI = syscall_num
-; RSI = arg1
-; RDX = arg2
-; R10 = arg3
-; R8  = arg4
-; R9  = arg5
+; RAX = syscall_num
+; RDI = arg1
+; RSI = arg2
+; RDX = arg3
+; R10 = arg4
+; R8  = arg5
+; R9  = arg6
 
 syscall_entry:
     swapgs 

src/arch/test_syscall.asm

@@ -1,19 +0,0 @@
-; Copyright (c) 2023-2026 Chris (boreddevnl)
-; This software is released under the GNU General Public License v3.0. See LICENSE file for details.
-; This header needs to maintain in any file it is present in, as per the GPL license terms.
-global test_syscall
-section .text
-
-test_syscall:
-    ; syscall number in RDI
-    mov rdi, 1
-    ; string pointer in RSI
-    lea rsi, [rel test_msg]
-    
-    ; The SYSCALL instruction
-    syscall
-    
-    ret
-
-section .rodata
-test_msg: db "Hello from Syscall!", 10, 0

src/arch/user_test.asm

@@ -1,25 +0,0 @@
-; Copyright (c) 2023-2026 Chris (boreddevnl)
-; This software is released under the GNU General Public License v3.0. See LICENSE file for details.
-; This header needs to maintain in any file it is present in, as per the GPL license terms.
-global user_test_function
-
-section .text
-user_test_function:
-    ; Syscall convention
-.loop:
-    ; Invoke SYS_WRITE (Syscall #1)
-    mov rdi, 1      ; arg1: fd = 1 (stdout)
-    lea rsi, [rel msg] ; arg2: buffer (RIP-relative)
-    mov rdx, 15     ; arg3: length
-    mov eax, 1      ; syscall_num = 1 (SYS_WRITE)
-    syscall
-
-    ; Some delay loop
-    mov rcx, 100000000
-.delay:
-    dec rcx
-    jnz .delay
-
-    jmp .loop
-
-msg: db "Hello syscall!", 10

src/core/kconsole.c

@@ -85,11 +85,16 @@ void kconsole_write(const char *s) {
     if (!s) return;
     
     uint64_t flags = spinlock_acquire_irqsave(&console_lock);
+    if (!kconsole_active) {
+        spinlock_release_irqrestore(&console_lock, flags);
+        return;
+    }
+
     while (*s) {
         kconsole_putc_nolock(*s++);
     }
     
-    // Flip buffer after a write batch during boot
+    // Flip once after a write batch to keep console updates coherent.
     graphics_flip_buffer();
     spinlock_release_irqrestore(&console_lock, flags);
 }

src/core/main.c

@@ -32,6 +32,8 @@
 #include "sys/kernel_subsystem.h"
 #include "sys/module_manager.h"
 #include "sys/bootfs_state.h"
+#include "input/keymap.h"
+#include "input/keyboard.h"
 
 extern void sysfs_init_subsystems(void);
 
@@ -172,6 +174,39 @@ void log_fail(const char *msg) {
     serial_write("\n");
 }
 
+static void print_verbose_boot_banner(void) {
+    kconsole_set_color(0xFFB589D6);
+    serial_write("==================== ");
+    kconsole_set_color(0xFFFFFFFF);
+    serial_write("__    ____  ____ \n");
+
+    kconsole_set_color(0xFFB589D6);
+    serial_write("=================== ");
+    kconsole_set_color(0xFFFFFFFF);
+    serial_write("/ /_  / __ \\/ ___\\\n");
+
+    kconsole_set_color(0xFF569CD6);
+    serial_write("================== ");
+    kconsole_set_color(0xFFFFFFFF);
+    serial_write("/ __ \\/ / / /\\___ \\\n");
+
+    kconsole_set_color(0xFF569CD6);
+    serial_write("================= ");
+    kconsole_set_color(0xFFFFFFFF);
+    serial_write("/ /_/ / /_/ /____/ /\n");
+
+    kconsole_set_color(0xFF4EC9B0);
+    serial_write("================ ");
+    kconsole_set_color(0xFFFFFFFF);
+    serial_write("/_.___/\\____//_____/ \n");
+
+    kconsole_set_color(0xFF4EC9B0);
+    serial_write("===============                       \n");
+
+    kconsole_set_color(0xFFFFFFFF);
+    serial_write("\n");
+}
+
 
 // Kernel Entry Point
 
@@ -200,6 +235,48 @@ static void fat32_mkdir_recursive(const char *path) {
     }
 }
 
+static bool usage_policy_prompt(void) {
+    kconsole_set_active(true);
+    serial_write("BoredOS - Please read the Usage Policy provided with this software before continuing.\n");
+    serial_write("Do you agree to the terms? [y/N]\n");
+
+    while (1) {
+        if ((inb(0x64) & 1) == 0) {
+            asm volatile("pause");
+            continue;
+        }
+
+        uint8_t scancode = inb(0x60);
+        keyboard_event_t ev;
+        if (!keyboard_handle_set1_scancode(scancode, &ev)) {
+            continue;
+        }
+
+        if (!ev.pressed) {
+            continue;
+        }
+
+        if (ev.keycode == KEY_ENTER || ev.keycode == KEY_KP_ENTER) {
+            serial_write("\n");
+            return false;
+        }
+
+        if (!ev.is_text) {
+            continue;
+        }
+
+        if (ev.codepoint == 'y' || ev.codepoint == 'Y') {
+            serial_write("\n");
+            return true;
+        }
+
+        if (ev.codepoint == 'n' || ev.codepoint == 'N') {
+            serial_write("\n");
+            return false;
+        }
+    }
+}
+
 void kmain(void) {
     init_serial();
     vfs_init();
@@ -264,6 +341,10 @@ void kmain(void) {
     idt_register_interrupts();
     idt_load();
     log_ok("IDT ready");
+    print_verbose_boot_banner();
+    kconsole_set_color(0xFFFFFF55);
+    serial_write("Welcome to BoredOS!\n");
+    kconsole_set_color(0xFFFFFFFF);
 
     process_init();
 
@@ -277,8 +358,14 @@ void kmain(void) {
     fat32_mkdir("/Library/images/gif");
     fat32_mkdir("/Library/Fonts");
     fat32_mkdir("/Library/DOOM");
+    fat32_mkdir("/Library/conf");
     fat32_mkdir("/Library/bsh");
     fat32_mkdir("/docs");
+    fat32_mkdir("/root");
+    fat32_mkdir("/root/Desktop");
+    fat32_mkdir("/root/Pictures");
+    fat32_mkdir("/root/Documents");
+    fat32_mkdir("/root/Downloads");
 
     sysfs_init_subsystems();
     vfs_mount("/sys", "sysfs", "sysfs", sysfs_get_ops(), NULL);
@@ -388,6 +475,9 @@ void kmain(void) {
     ps2_init();
     asm("sti");
 
+    keymap_init();
+    serial_write("[INIT] Keymap initialized");
+
     lapic_init();
 
     if (smp_request.response != NULL) {
@@ -398,6 +488,11 @@ void kmain(void) {
         smp_init(NULL);
     }
 
+    if (!usage_policy_prompt()) {
+        log_fail("Usage policy not accepted, halting");
+        hcf();
+    }
+
     wm_init();
 
     asm volatile("sti");

src/core/version.c

@@ -13,10 +13,10 @@ void get_os_info(os_info_t *info) {
     for (size_t i = 0; i < sizeof(os_info_t); i++) p[i] = 0;
 
     const char *os_name = "BoredOS";
-    const char *os_version = "26.4.2";
-    const char *os_codename = "Voyager";
+    const char *os_version = "26.5.1-stable";
+    const char *os_codename = "Genesis";
     const char *kernel_name = "Boredkernel";
-    const char *kernel_version = "4.1.0-stable";
+    const char *kernel_version = "4.2.1-stable";
     const char *build_date = __DATE__;
     const char *build_time = __TIME__;
     const char *build_arch = "x86_64";

src/dev/ps2.c

@@ -8,6 +8,8 @@
 #include "lapic.h"
 #include "smp.h"
 #include <stdbool.h>
+#include "input/keyboard.h"
+#include "input/keymap.h"
 
 extern void serial_print(const char *s);
 extern void serial_print_hex(uint64_t n);
@@ -37,11 +39,6 @@ uint64_t timer_handler(registers_t *regs) {
 }
 
 // --- Keyboard ---
-static bool shift_pressed = false;
-static bool caps_lock_on = false;
-bool ps2_ctrl_pressed = false;
-static bool extended_scancode = false;
-
 static void ps2_kbd_wait_write(void) {
     uint32_t timeout = 100000;
     while (timeout--) {
@@ -51,7 +48,11 @@ static void ps2_kbd_wait_write(void) {
 
 static void ps2_update_leds(void) {
     uint8_t led_status = 0;
-    if (caps_lock_on) led_status |= 4;
+    uint32_t mods = keyboard_get_modifiers();
+
+    if (mods & KB_MOD_CAPS)   led_status |= 4;
+    if (mods & KB_MOD_NUM)    led_status |= 2;
+    if (mods & KB_MOD_SCROLL) led_status |= 1;
 
     ps2_kbd_wait_write();
     outb(0x60, 0xED);
@@ -59,87 +60,17 @@ static void ps2_update_leds(void) {
     outb(0x60, led_status);
 }
 
-static char scancode_map[128] = {
-    0,  27, '1', '2', '3', '4', '5', '6', '7', '8', '9', '0', '-', '=', '\b',
-    '\t', 'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', '[', ']', '\n',
-    21, 'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';', '\'', '`', 0,
-    '\\', 'z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/', 0, '*', 
-    22, ' ', 23, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
-};
-
-static char scancode_map_shift[128] = {
-    0,  27, '!', '@', '#', '$', '%', '^', '&', '*', '(', ')', '_', '+', '\b',
-    '\t', 'Q', 'W', 'E', 'R', 'T', 'Y', 'U', 'I', 'O', 'P', '{', '}', '\n',
-    21, 'A', 'S', 'D', 'F', 'G', 'H', 'J', 'K', 'L', ':', '"', '~', 0,
-    '|', 'Z', 'X', 'C', 'V', 'B', 'N', 'M', '<', '>', '?', 0, '*', 
-    22, ' ', 23, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
-};
-
 uint64_t keyboard_handler(registers_t *regs) {
     uint8_t scancode = inb(0x60);
 
-    if (scancode == 0xE0) {
-        extended_scancode = true;
-        outb(0x20, 0x20);
-        return (uint64_t)regs;
+    keyboard_event_t ev;
+    if (keyboard_handle_set1_scancode(scancode, &ev)) {
+        // Update LEDs if a lock key state changed
+        if (ev.keycode == KEY_CAPS_LOCK || ev.keycode == KEY_NUM_LOCK || ev.keycode == KEY_SCROLL_LOCK) {
+            if (ev.pressed) ps2_update_leds();
         }
 
-    if (scancode == 0x1D) {
-        ps2_ctrl_pressed = true;
-        extended_scancode = false; 
-    } else if (scancode == 0x9D) {
-        ps2_ctrl_pressed = false;
-        extended_scancode = false;
-    }
-
-
-
-    if (scancode == 0x2A || scancode == 0x36) { // Shift Down
-        shift_pressed = true;
-    } else if (scancode == 0xAA || scancode == 0xB6) { // Shift Up
-        shift_pressed = false;
-    } else if (scancode == 0x3A) { // Caps Lock Down
-        caps_lock_on = !caps_lock_on;
-        ps2_update_leds();
-    } else if (!(scancode & 0x80)) { // Key Press
-        if (extended_scancode) {
-            extended_scancode = false;
-            switch (scancode) {
-                case 0x48: wm_handle_key(17, true); break; // Up arrow
-                case 0x50: wm_handle_key(18, true); break; // Down arrow
-                case 0x4B: wm_handle_key(19, true); break; // Left arrow
-                case 0x4D: wm_handle_key(20, true); break; // Right arrow
-            }
-        } else {
-            char c = shift_pressed ? scancode_map_shift[scancode] : scancode_map[scancode];
-            if (c) {
-                if (caps_lock_on) {
-                    if (c >= 'a' && c <= 'z') c -= 32;
-                    else if (c >= 'A' && c <= 'Z') c += 32;
-                }
-                wm_handle_key(c, true);
-            }
-        }
-    } else if (scancode & 0x80) { // Key release
-        if (extended_scancode) {
-            extended_scancode = false;
-            switch (scancode & 0x7F) { // Strip the release bit
-                case 0x48: wm_handle_key(17, false); break; // Up arrow
-                case 0x50: wm_handle_key(18, false); break; // Down arrow
-                case 0x4B: wm_handle_key(19, false); break; // Left arrow
-                case 0x4D: wm_handle_key(20, false); break; // Right arrow
-            }
-        } else {
-            uint8_t base_scancode = scancode & 0x7F;
-            char c = shift_pressed ? scancode_map_shift[base_scancode] : scancode_map[base_scancode];
-            if (c) {
-                if (caps_lock_on) {
-                    if (c >= 'a' && c <= 'z') c -= 32;
-                    else if (c >= 'A' && c <= 'Z') c += 32;
-                }
-                wm_handle_key(c, false);
-            }
-        }
+        wm_handle_key_event(ev.keycode, ev.codepoint, ev.mods, ev.pressed);
     }
 
     outb(0x20, 0x20); // EOI
@@ -257,9 +188,12 @@ uint64_t mouse_handler(registers_t *regs) {
 }
 
 void ps2_init(void) {
+    keymap_init();
+    keyboard_init();
     mouse_init();
+    ps2_update_leds();
 }
 
 bool ps2_shift_pressed(void) {
-    return shift_pressed;
+    return keyboard_shift_pressed();
 }

src/fs/fat32.c

@@ -15,7 +15,6 @@
 static spinlock_t ramfs_lock = SPINLOCK_INIT; // Protects the RAM-based filesystem (/)
 
 
-#define MAX_FILES 256
 #define MAX_CLUSTERS 8192
 #define MAX_OPEN_HANDLES 32
 
@@ -23,8 +22,7 @@ static spinlock_t ramfs_lock = SPINLOCK_INIT; // Protects the RAM-based filesyst
 static uint32_t fat_table[MAX_CLUSTERS];
 static uint8_t cluster_data[MAX_CLUSTERS][FAT32_CLUSTER_SIZE];
 
-// File/Directory tracking
-typedef struct {
+typedef struct FileEntry {
     char full_path[FAT32_MAX_PATH];
     char filename[FAT32_MAX_FILENAME];
     uint32_t start_cluster;
@@ -32,9 +30,10 @@ typedef struct {
     uint32_t attributes;
     bool used;            
     char parent_path[FAT32_MAX_PATH];
+    struct FileEntry *next; 
 } FileEntry;
 
-static FileEntry files[MAX_FILES];
+static FileEntry *file_list_head = NULL; 
 static uint32_t next_cluster = 3;  // Start after reserved clusters 0, 1, 2
 static FAT32_FileHandle open_handles[MAX_OPEN_HANDLES];
 static char current_dir[FAT32_MAX_PATH] = "/";
@@ -234,9 +233,9 @@ static FileEntry* ramfs_find_file(const char *path) {
     if (!normalized) return NULL;
     fat32_normalize_path(path, normalized);
     FileEntry *ret = NULL;
-    for (int i = 0; i < MAX_FILES; i++) {
-        if (files[i].used && fs_strcmp(files[i].full_path, normalized) == 0) {
-            ret = &files[i];
+    for (FileEntry *n = file_list_head; n; n = n->next) {
+        if (fs_strcmp(n->full_path, normalized) == 0) {
+            ret = n;
             break;
         }
     }
@@ -244,11 +243,29 @@ static FileEntry* ramfs_find_file(const char *path) {
     return ret;
 }
 
-static FileEntry* ramfs_find_free_entry(void) {
-    for (int i = 0; i < MAX_FILES; i++) {
-        if (!files[i].used) return &files[i];
+static FileEntry* ramfs_alloc_entry(void) {
+    FileEntry *e = (FileEntry*)kmalloc(sizeof(FileEntry));
+    if (!e) return NULL;
+    for (int i = 0; i < (int)sizeof(FileEntry); i++) ((char*)e)[i] = 0;
+    e->used = true;
+    e->next = file_list_head;
+    file_list_head = e;
+    return e;
 }
-    return NULL;
+
+static void ramfs_free_entry(FileEntry *entry) {
+    if (!entry) return;
+    if (file_list_head == entry) {
+        file_list_head = entry->next;
+    } else {
+        for (FileEntry *n = file_list_head; n && n->next; n = n->next) {
+            if (n->next == entry) {
+                n->next = entry->next;
+                break;
+            }
+        }
+    }
+    kfree(entry);
 }
 
 static FAT32_FileHandle* ramfs_find_free_handle(void) {
@@ -267,10 +284,8 @@ static uint32_t ramfs_allocate_cluster(void) {
 
 static int ramfs_count_files_in_dir(const char *normalized_path) {
     int count = 0;
-    for (int i = 0; i < MAX_FILES; i++) {
-        if (files[i].used && fs_strcmp(files[i].parent_path, normalized_path) == 0) {
-            count++;
-        }
+    for (FileEntry *n = file_list_head; n; n = n->next) {
+        if (fs_strcmp(n->parent_path, normalized_path) == 0) count++;
     }
     return count;
 }
@@ -306,14 +321,13 @@ static FAT32_FileHandle* ramfs_open(const char *normalized_path, const char *mod
     } else if (mode[0] == 'w' || (mode[0] == 'a')) {
         if (!entry) {
             if (!check_desktop_limit(normalized_path)) return NULL;
-            entry = ramfs_find_free_entry();
+            entry = ramfs_alloc_entry();
             if (!entry) return NULL;
-            entry->used = true;
             fs_strcpy(entry->full_path, normalized_path);
             extract_filename(normalized_path, entry->filename);
             extract_parent_path(normalized_path, entry->parent_path);
             entry->start_cluster = ramfs_allocate_cluster();
-            if (!entry->start_cluster) return NULL;
+            if (!entry->start_cluster) { ramfs_free_entry(entry); return NULL; }
             entry->size = 0;
             entry->attributes = 0;
         }
@@ -411,9 +425,9 @@ static int ramfs_write(FAT32_FileHandle *handle, const void *buffer, int size) {
         }
     }
     
-    for (int i = 0; i < MAX_FILES; i++) {
-        if (files[i].used && files[i].start_cluster == handle->start_cluster) {
-            files[i].size = handle->size;
+    for (FileEntry *n = file_list_head; n; n = n->next) {
+        if (n->start_cluster == handle->start_cluster) {
+            n->size = handle->size;
             break;
         }
     }
@@ -1467,27 +1481,26 @@ static int vfs_ramfs_readdir(void *fs_private, const char *rel_path, vfs_dirent_
     vfs_ramfs_get_abs_path(rel_path, abs);
     
     uint64_t rflags = spinlock_acquire_irqsave(&ramfs_lock);
-    for (int i = 0; i < MAX_FILES && count < max; i++) {
+    for (FileEntry *n = file_list_head; n && count < max; n = n->next) {
         bool match = false;
-        if (files[i].used && files[i].filename[0] != '\0') {
-            if (fs_strcmp(files[i].parent_path, abs) == 0) match = true;
+        if (n->filename[0] != '\0') {
+            if (fs_strcmp(n->parent_path, abs) == 0) match = true;
             
-            // Root unification: Treat "", "/", and "A:/" as root parent
             if (!match && abs[0] == '/' && abs[1] == '\0') {
-                if (files[i].parent_path[0] == '\0' || 
-                    fs_strcmp(files[i].parent_path, "/") == 0 ||
-                    fs_strcmp(files[i].parent_path, "A:/") == 0) {
+                if (n->parent_path[0] == '\0' || 
+                    fs_strcmp(n->parent_path, "/") == 0 ||
+                    fs_strcmp(n->parent_path, "A:/") == 0) {
                     match = true;
                 }
             }
         }
         
         if (match) {
-            fs_strcpy(entries[count].name, files[i].filename);
-            entries[count].size = files[i].size;
-            entries[count].is_directory = (files[i].attributes & ATTR_DIRECTORY) ? 1 : 0;
-            entries[count].start_cluster = files[i].start_cluster;
-            entries[count].write_date = 0; // Not tracked in RAMFS for now
+            fs_strcpy(entries[count].name, n->filename);
+            entries[count].size = n->size;
+            entries[count].is_directory = (n->attributes & ATTR_DIRECTORY) ? 1 : 0;
+            entries[count].start_cluster = n->start_cluster;
+            entries[count].write_date = 0;
             entries[count].write_time = 0;
             count++;
         }
@@ -1840,16 +1853,13 @@ void* fat32_mount_volume(void *disk_ptr) {
 // === Public API (Dispatch) ===
 
 void fat32_init(void) {
-    // Explicitly zero out all structures for RAMFS safety
-    for (int i = 0; i < MAX_FILES; i++) {
-        files[i].used = false;
-        files[i].full_path[0] = 0;
-        files[i].filename[0] = 0;
-        files[i].parent_path[0] = 0;
-        files[i].size = 0;
-        files[i].attributes = 0;
-        files[i].start_cluster = 0;
+    FileEntry *node = file_list_head;
+    while (node) {
+        FileEntry *next = node->next;
+        kfree(node);
+        node = next;
     }
+    file_list_head = NULL;
 
     // Initialize FAT table for RAMFS
     for (int i = 0; i < MAX_CLUSTERS; i++) {
@@ -1917,11 +1927,6 @@ FAT32_FileHandle* fat32_open_nolock(const char *path, const char *mode) {
             }
         }
     } else if (path[0] == '/') {
-        // Absolute VFS path - bypass legacy drive letters
-        // This is safe to call WITHOUT the fat32_lock because vfs_open was called formerly
-        // and it will resolve to one of our mounts which will then acquire the lock.
-        // HOWEVER, if we are already inside a fat32_lock call, we SHOULD NOT call vfs_open.
-        // For now, absolute paths starting with / are handled by VFS entry points.
         vfs_file_t *vf = vfs_open(path, mode);
         if (vf && vf->fs_handle) {
              return (FAT32_FileHandle*)vf->fs_handle;
@@ -2223,7 +2228,7 @@ bool fat32_mkdir(const char *path) {
         return false;
     }
     
-    FileEntry *entry = ramfs_find_free_entry();
+    FileEntry *entry = ramfs_alloc_entry();
     if (!entry) {
         kfree(normalized);
         spinlock_release_irqrestore(&ramfs_lock, rflags);
@@ -2263,7 +2268,7 @@ bool fat32_rmdir(const char *path) {
         return false;
     }
     
-    entry->used = false;
+    ramfs_free_entry(entry);
     kfree(normalized);
     wm_notify_fs_change();
     spinlock_release_irqrestore(&ramfs_lock, rflags);
@@ -2287,7 +2292,7 @@ bool fat32_delete(const char *path) {
             
             FileEntry *entry = ramfs_find_file(normalized);
             if (entry && !(entry->attributes & ATTR_DIRECTORY)) {
-                entry->used = false;
+                ramfs_free_entry(entry);
                 result = true;
             }
             kfree(normalized);
@@ -2426,27 +2431,26 @@ bool fat32_rename(const char *old_path, const char *new_path) {
     char *suffix = (char*)kmalloc(FAT32_MAX_PATH);
     if (!suffix) { spinlock_release_irqrestore(&ramfs_lock, rflags); return false; }
 
-    for (int i = 0; i < MAX_FILES; i++) {
-        if (!files[i].used) continue;
-        if (fs_strcmp(files[i].full_path, old_path) == 0) {
-            fs_strcpy(files[i].full_path, new_path);
-            extract_filename(new_path, files[i].filename);
-            extract_parent_path(new_path, files[i].parent_path);
-        } else if (fs_strlen(files[i].full_path) > old_len && 
-                   fs_starts_with(files[i].full_path, old_path) &&
-                   files[i].full_path[old_len] == '/') {
-            fs_strcpy(suffix, files[i].full_path + old_len);
-            fs_strcpy(files[i].full_path, new_path);
-            fs_strcat(files[i].full_path, suffix);
+    for (FileEntry *n = file_list_head; n; n = n->next) {
+        if (fs_strcmp(n->full_path, old_path) == 0) {
+            fs_strcpy(n->full_path, new_path);
+            extract_filename(new_path, n->filename);
+            extract_parent_path(new_path, n->parent_path);
+        } else if (fs_strlen(n->full_path) > old_len &&
+                   fs_starts_with(n->full_path, old_path) &&
+                   n->full_path[old_len] == '/') {
+            fs_strcpy(suffix, n->full_path + old_len);
+            fs_strcpy(n->full_path, new_path);
+            fs_strcat(n->full_path, suffix);
         }
-        if (fs_strcmp(files[i].parent_path, old_path) == 0) {
-            fs_strcpy(files[i].parent_path, new_path);
-        } else if (fs_strlen(files[i].parent_path) > old_len &&
-                   fs_starts_with(files[i].parent_path, old_path) &&
-                   files[i].parent_path[old_len] == '/') {
-            fs_strcpy(suffix, files[i].parent_path + old_len);
-            fs_strcpy(files[i].parent_path, new_path);
-            fs_strcat(files[i].parent_path, suffix);
+        if (fs_strcmp(n->parent_path, old_path) == 0) {
+            fs_strcpy(n->parent_path, new_path);
+        } else if (fs_strlen(n->parent_path) > old_len &&
+                   fs_starts_with(n->parent_path, old_path) &&
+                   n->parent_path[old_len] == '/') {
+            fs_strcpy(suffix, n->parent_path + old_len);
+            fs_strcpy(n->parent_path, new_path);
+            fs_strcat(n->parent_path, suffix);
         }
     }
     kfree(suffix);
@@ -2524,15 +2528,16 @@ int fat32_list_directory(const char *path, FAT32_FileInfo *entries, int max_entr
         if (!normalized) { spinlock_release_irqrestore(&ramfs_lock, rflags); return 0; }
         fat32_normalize_path(p, normalized);
         
-        for (int i = 0; i < MAX_FILES && count < max_entries; i++) {
-            if (files[i].used && fs_strcmp(files[i].parent_path, normalized) == 0) {
-                fs_strcpy(entries[count].name, files[i].filename);
-                entries[count].size = files[i].size;
-                entries[count].is_directory = (files[i].attributes & ATTR_DIRECTORY) != 0;
-                entries[count].start_cluster = files[i].start_cluster;
+        for (FileEntry *_n = file_list_head; _n && count < max_entries; _n = _n->next) {
+                if (fs_strcmp(_n->parent_path, normalized) != 0) continue;
+                fs_strcpy(entries[count].name, _n->filename);
+                entries[count].size = _n->size;
+                entries[count].is_directory = (_n->attributes & ATTR_DIRECTORY) != 0;
+                entries[count].start_cluster = _n->start_cluster;
+                entries[count].write_date = 0;
+                entries[count].write_time = 0;
                 count++;
             }
-        }
         kfree(normalized);
     }
     

src/images/icons/colloid/LICENSE.txt

@@ -0,0 +1,674 @@
+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.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    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:
+
+    <program>  Copyright (C) <year>  <name of author>
+    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>.