| [core] | |
| excludesfile = ~/.gitignore | |
| [diff] | |
| [color] | |
| ui = auto | |
| [alias] | |
| st = status | |
| ci = commit | |
| co = checkout | |
| di = diff |
| % ATAN lut-generator for Mesa3D | |
| % Based on polyfitc, http://www.mathworks.com/matlabcentral/fileexchange/47851-constraint-polynomial-fit | |
| X = linspace(0, 1); | |
| Y = atan(X)'; | |
| N = [1, 3, 5, 7, 9, 11]; | |
| lsqM = ones(numel(X), numel(N)); | |
| for n = 1:numel(N) | |
| lsqM(:, n) = X.^N(n); | |
| end |
| /** | |
| * Simple UART module to explore basic HardwareC concepts. | |
| * | |
| * HardwareC is a working name for a new hardware description language. The | |
| * goal is to make FPGAs easier for hobbyists to take advantage of. To achieve | |
| * this goal, some design choices have been made: | |
| * | |
| * 1. Use familiar syntax. C/C++ syntax is borrowed everywhere, no reason to | |
| * reinvent the wheel. Where C/C++ falls short, borrow from Verilog/SystemVerilog. | |
| * 2. Interrop with C/C++. A HardwareC module should be able to be used seamlessly |
| use std::str; | |
| // Store positions in packed (u32) form; this limits us to under 4GB of | |
| // payload but makes the data structures a bit more compact. | |
| struct PackedPos(u32); | |
| impl PackedPos { | |
| fn from(pos: usize) -> PackedPos { | |
| assert!(pos <= std::u32::MAX as usize); | |
| PackedPos(pos as u32) |
There's a nice Xilinx application note from Ken Chapman:
Multiplexer Design Techniques for Datapath Performance with Minimized Routing Resources https://www.xilinx.com/support/documentation/application_notes/xapp522-mux-design-techniques.pdf
The most intriguing part is what he calls a data selector, but which might be more descriptively termed a one-hot mux, since it's a mux where the control signals are one-hot coded:
onehotmux(data, sel) = (data[0] & sel[0]) | ... | (data[n] & sel[n])
When I started to write some pure 68000 I didn't find a nice doc that would cover all the op codes I used which a nice diagram for the cycle counts so I made one. This info has been assembled / hacked up using this tool https://github.com/emoon/68k_documentation_gen with a bunch of manual work and some automation for generating the cycle tables. If you find any errors in this (I'm sure there are plenty but it has been useful for me) please contact me or even better do a PR :)
Operation: Source10 + Destination10 + X → Destination
| //; "Super Keftendo" 256-byte SNES intro source code | |
| //; by Revenant | |
| //; http://www.pouet.net/prod.php?which=70163 | |
| //; This is an attempt at implementing the "Kefrens bars" effect on the SNES, using less than | |
| //; 256 bytes of ROM. The technique used here is to set up a 256-color line buffer using | |
| //; Mode 7, then rendering a few pixels directly to CGRAM every scanline and resetting the | |
| //; Y-scroll position to display the same buffer on every visible scanline as it is repeatedly | |
| //; rendered to. Some more information about specific size optimizations are detailed later. |
| /** | |
| * (c) 2021 FMS_Cat, MIT License | |
| * Original shader: https://www.shadertoy.com/view/MdffD7 | |
| * I dumbass don't know what it says despite it's my own shader | |
| */ | |
| Texture2D shaderTexture; | |
| SamplerState samplerState; | |
| cbuffer PixelShaderSettings { |
I was told by @mmozeiko that Address Sanitizer (ASAN) works on Windows now. I'd tried it a few years ago with no luck, so this was exciting news to hear.
It was a pretty smooth experience, but with a few gotchas I wanted to document.
First, download and run the LLVM installer for Windows: https://llvm.org/builds/
Then download and install the VS extension if you're a Visual Studio 2017 user like I am.
It's now very easy to use Clang to build your existing MSVC projects since there's a cl compatible frontend:
