I have been asked to catalogue certain contents of my machine boneyard which are due to change hands on account of imminent liquidations of two operations in which I took part.
The items pictured below are presently in my possession, and believed to be functional for the uses for which they were made, though I am [...]
Oct. 7 Update: Removed experimental attempt to use “shlex” for support of double-quoted search (it broke parsing of single quotes in search strings.)
Oct. 4 Update: Introduced adjustable detector of bot disconnection. Removed broken Tape knob in reader.
Oct. 3 Update: Bvt’s bot [...]
This article is a continuation of the M series.
The vpatch given below entirely re-implements the TLB (MMU) of M to use SIMD instructions from the AMD64 SSE2 set.
Whereas previously TLB entries were kept in memory and searched iteratively, now we keep the Tags (3 byte each) sliced into three XMM registers, and search them in [...]
This article is a continuation of the M series.
The vpatch given below speeds up the execution of M by approximately 30% (as measured by the Dhrystone benchmark.) It implements separate single-entry TLB caches for reads and writes; a set of fastpath exception handlers; and several other minor optimizations.
You will need:
A Keccak-based [...]
M is a MIPS-III system emulator, written purely in AMD64 assembly to make optimal use of commonplace iron. As discussed previously.
M will run lightly-modified Linux kernels with strict logical isolation vs. the host (and vs. any other instances of itself.) That is, it in fact does exactly what e.g. QEMU fraudulently pretends to do.
To keep [...]
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same [...]