This is a living document. Everything in this document is made in good faith of being accurate, but like I just said; we don't yet know everything about what's going on.
Update: I've disabled comments as of 2025-01-26 to avoid everyone having notifications for something a year on if someone wants to suggest a correction. Folks are free to email to suggest corrections still, of course.
Example of how to capture CPU counters with ETW on Windows, perf on Linux or kperf on Apple.
Using ETW needs somewhat recently updated Windows 10 or 11. Not sure about exact version.
Currently tested on:
| ---------------------------------------------------------------------------------------------------------------- | |
| -- AUTOMAGIC TABLES | |
| ---------------------------------------------------------------------------------------------------------------- | |
| -- There is a well-known "standard" implementation of automagic tables at http://lua-users.org/wiki/AutomagicTables | |
| -- | |
| -- Unfortunately, that implementation behaves weirdly in some situations: | |
| -- local a = AutomagicTable() | |
| -- local x = a.b.c | |
| -- local y = a.b.c | |
| -- assert(x == y) -- assertion fails ! |
| import strutils | |
| import lists | |
| import re | |
| type | |
| Parser[T] = proc(input: string): Maybe[(T, string)] | |
| Maybe*[T] = object | |
| value: T | |
| hasValue: bool |
| // -*- compile-command: "nvcc -m 32 -arch sm_35 -Xptxas=-v,-abi=no -cubin sha256.cu"; -*- | |
| // | |
| // Copyright 2013 Allan MacKinnon <[email protected]> | |
| // | |
| // Permission is hereby granted, free of charge, to any person obtaining | |
| // a copy of this software and associated documentation files (the | |
| // "Software"), to deal in the Software without restriction, including | |
| // without limitation the rights to use, copy, modify, merge, publish, | |
| // distribute, sublicense, and/or sell copies of the Software, and to |
| =============================================================================================== | |
| Load three arrays (x, y and z) in SoA order, repack them and store them in AoS order. | |
| Strategy: each warp permutes its load lane with: | |
| (rowNum + (laneId() * 3)) & 31 | |
| This will convert SoA into AoS but with x/y/z staggered across rows of registers. |
| /* PROG1.C */ | |
| /* Simple Hashing LZ77 Sliding Dictionary Compression Program */ | |
| /* By Rich Geldreich, Jr. October, 1993 */ | |
| /* Originally compiled with QuickC v2.5 in the small model. */ | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <ctype.h> | |
| /* set this to 1 for a greedy encoder */ |
