







This article describes the calling conventions used when programming x86 architecture microprocessors.
Linux System Call Tables by Architecture · syscall.sh
The Linux syscall table for 38 architectures: every system call number, argument and register, with a table per architecture, from Linux 3.3 to 7.3.

x86 and amd64 instruction reference
No longer updated. Visit the official Intel online documentation.
NASM x64 Assembly
Here's the full list of ordinary integer x86 registers. The 64 bit registers are shown in red. "Scratch" registers any function is allowed to overwrite, and use for anything you want without asking anybody. "Preserved" registers have to be put back ("save" the register) if you use them.
FEX-Emu – A fast linux usermode x86 and x86-64 emulator
A fast linux usermode x86 and x86-64 emulator
Integrating Anthropic's Model Hardware Standard (MHS)
In this blog post, we demonstrate the ability of Anthropic’s Model Hardware Standard (MHS) to help us overcome these challenges to contribute to a local citizen science project in Pacifica, California, and run a closed-loop experiment to optimize how our compiler makes decisions around pipetting settings.
Signals and Threads
Stephen Dolan works on Jane Street’s Tools and Compilers team where he focuses on the OCaml compiler. In this episode, Stephen and Ron take a trip down memory lane, discussing how to manage computer memory efficiently and safely. They consider trade-offs between reference counting and garbage collection, the surprising gains achieved by prefetching, and how new language features like local allocation and unboxed types could give OCaml users more control over their memory.

Production Is a Compiler Input - The Phoenix Architecture
p-code
Niklaus Wirth specified a simple p-code machine in the 1976 book Algorithms + Data Structures = Programs. The machine had 3 registers - a program counter p, a base register b, and a top-of-stack register t. There were 8 instructions:
P-code machine
In computer programming, a P-code machine (portable code machine[1]) is a virtual machine designed to execute P-code, the assembly language or machine code of a hypothetical central processing unit (CPU). The term P-code machine is applied generically to all such machines (such as the Java virtual machine (JVM) and MATLAB pre-compiled code), as well as specific implementations using those machines. One of the most notable uses of P-Code machines is the P-Machine of the Pascal-P system. The developers of the UCSD Pascal implementation within this system construed the P in P-code to mean pseudo more often than portable; they adopted a unique label for pseudo-code meaning instructions for a pseudo-machine.
INT32-C. Ensure that operations on signed integers do not result in overflow | CERT Secure Coding
Signed integer overflow is undefined behavior 35 . Consequently, implementations have considerable latitude in how they deal with signed integer overflow. (See MSC15-C. Do not depend on undefined behavior .) An implementation that defines signed integer types as being modulo, for example, need not detect integer overflow. Implementations may also trap on signed arithmetic overflows, or simply assume that overflows will never happen and generate object code accordingly. It is also possible for the same conforming implementation to emit code that exhibits different behavior in different contexts. For example, an implementation may determine that a signed integer loop control variable declared in a local scope cannot overflow and may emit efficient code on the basis of that determination, while the same implementation may determine that a global variable used in a similar context will wrap.
stack-based
Stack machines are arguably the simplest kind of computer architecture. Their LIFO structure is quite suitable for block-oriented languages. The code size for a stack machine can be very compact because most instructions have no operand field.
From bootloader to kernel
If you've read my earlier posts about assembly language for Linux x86_64, you might see that I started to get interested in low-level programming. I've written a set of articles on assembly programming for x86_64 Linux and, in parallel, began exploring the Linux kernel source ...

Moving beyond fork() + exec()
Since the earliest days of Unix, two of the core process-oriented system calls have been fork() [...]
[DSCTF 2019] CPU Adventure – Unknown CPU Reversing
or: reverse-engineering a custom, unknown CPU from a single programtl;dr: We reverse-engineered a program written for a completely custom, unknown CPU architecture, without any documentation for th…

Chip8
CHIP-8 is a virtual machine created by RCA engineer Joe Weisbecker in 1977 for the COSMAC VIP microcomputer. The Chip-8 language is capable of accessing up to 4KB(4096 bytes) of RAM, from location 0x000 to 0xFFF(0-4095). The first 512 bytes, from 0x000 to 0x1FF, are where the original interpreter was located, and should not be used by programs.
RISC-V International
RISC-V is an open standard Instruction Set Architecture (ISA) enabling a new era of processor innovation through open collaboration.
