Skip to content
View JoRios1006's full-sized avatar
🐧
Using Linux
🐧
Using Linux

Block or report JoRios1006

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
JoRios1006/README.md

JORIOS1006

SYSTEMS PROGRAMMER | FREE SOFTWARE | MINIMALIST

“Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away.”

― Antoine de Saint-Exupéry, Airman's Odyssey

CURRENTLY WORKING ON:

TTCC: Tiny Tiny C Compiler (Fork of TCC making it work with tiny.header)

PROJECTS

TINY.H

No-libc x86-64 Linux toolkit. Single-header. Direct syscall syscall interface. Inline assembly. German-style SSO strings. Hard error on non-Linux/non-x86-64 platforms. Eliminates standard library bloat.

UMORIA-M

Legacy Roguelike Refactor. Porting UMoria to C23. Data-oriented design. Bitmask spell logic. Branchless math. Performance engineering applied to legacy state machines.

OSAKA-EMACS

Personal Tooling. My environment. Every line of configuration is owned by the user. Integrated workflow for low-level development.

INTERESTS & DOMAINS

  • EMBEDDED & OSDEV: Writing software that owns the hardware. Bare-metal execution. Minimalist kernels.
  • PERFORMANCE ENGINEERING: Cache-line awareness. Branchless logic. Data-oriented architecture.
  • DEMOSCENE: Extreme optimization. Squeezing utility out of every byte.
  • HPC & UNIKERNELS: Single-address space efficiency. High-throughput, low-latency systems.
  • DOMAIN SPECIFIC LANGUAGES: Designing syntax that maps 1:1 to machine intent.

PHILOSOPHY

I build software that communicates with the kernel directly. No middleman. No mystery.

  • DATA IS TRUTH: Code is pointer arithmetic applied to that truth.
  • BRANCHES ARE SHAME: If a bitmask solves it, a jump is a failure.
  • STACK IS SCRATCHPAD: Explicit frame layouts over opaque allocations.
  • SOFTWARE MUST BE DONE: Refactor until there is nothing left to remove.
  • SAFE STATES: Recovery is mapping failure modes to dedicated degraded states.
  • INVARIANTS: Encode failure as an invariant to ensure deterministic state-machine behavior.
  • SIMPLICITY: Complexity is a debt. The compiler cannot pay it for you.

STACK

  • PRIMARY: C, x86-64 Assembly, Raylib, Emacs Lisp
  • SECONDARY: (I can work without complaining much) Python, Java/C#, React/Js, Node/Js
  • OS: Linux (Gentoo)

CONTACT

EMAIL: agustinrios1006@gmail.com STATUS: Writing software. Avoiding undefined behavior. "Bugs present. Report useful. Fixes not guaranteed."

Pinned Loading

  1. tiny.header tiny.header Public

    No-libc single-header runtime. Linux x86-64. Direct syscalls. SSE-backed f64 ops. Macro-driven design. Branchless control flow. Manual memory (brk, bump). SSO strings. Functional primitives. Termin…

    C 1

  2. umoria-m umoria-m Public

    Legacy roguelike refactor. Moria -> C23. Bitmask spell logic. Branchless math. goto Data-oriented. Mechanical sympathy. High-performance maintenance

    C

  3. Osaka-emacs Osaka-emacs Public

    Forked from snackon/Witchmacs

    My emacs configuration files

    Emacs Lisp 1

  4. BeatCube BeatCube Public

    endless runner

    C