aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* 024: the table with operations apart and interpreted beside the hand-fused fo...eunhhu2026-10-052-35/+37
* 041 join ops: the recurrence interpreted and each round's rest as 11 operatio...eunhhu2026-10-053-19/+172
* Design 024: a batch executor, loops run 256 rounds at a time by operations th...eunhhu2026-10-052-1/+137
* 041 knapsack u32_ops: the batch's operations apart and interpreted over four-...eunhhu2026-10-052-18/+70
* 041 batches: loops run a batch of rounds at a time, each operation a C loop m...eunhhu2026-10-054-0/+707
* 125: forms and newton runs named; BFS's time after the graph's load is the ge...eunhhu2026-10-053-4/+8
* Research 125: the tier's first steps against C (e2e56dd: roots 1.40, knapsack...eunhhu2026-10-054-1/+298
* The tier checks a number finite in integers (its exponent's bits all ones), o...eunhhu2026-10-053-4/+110
* Pointer induction (023): an inner count's access by a key affine in its round...eunhhu2026-10-053-9/+184
* 040 forms.c: matmul's inner loop in the forms the tier may make it (index 20....eunhhu2026-10-053-0/+100
* 040: the suite on 4bedd7f (11 rounds' medians, Pure / C): roots 1.58, knapsac...eunhhu2026-10-052-0/+217
* 040: TPC-C and the bank's queries against 6b45806 (023's criterion for the ap...eunhhu2026-10-0528-1/+136
* A text-keyed list let go at an event's end starts no key set (a number's bits...eunhhu2026-10-052-17/+20
* The tier's numbers' arithmetic in a run, each read by the next alone (constan...eunhhu2026-10-053-15/+92
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-053-9/+73
* Text keys (023): a list knows the text field it is keyed by; an event's list ...eunhhu2026-10-056-30/+264
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-055-26/+298
* The tier's loops tighter: a latch's way out takes the round as the next less ...eunhhu2026-10-051-20/+72
* The tier's inner loops: a count's work paid for every round as it opens (the ...eunhhu2026-10-053-64/+253
* The tier's keys and positions in range for every round, checked once where th...eunhhu2026-10-053-54/+203
* The tier, first (023): a nest of loops as SSA, its stack, locals and states v...eunhhu2026-10-055-8/+2297
* Keep a DENSE list's counted keys last in the list, apart from what is read of...eunhhu2026-10-051-9/+9
* A keyed event list given small whole keys in order becomes DENSE too, and a D...eunhhu2026-10-051-18/+95
* 023: near C is the aim (each within 1.25x, the geometric mean within 1.1x), n...eunhhu2026-10-051-10/+13
* Research 124: 022's BFS past C only by reading ahead (15.7 ms against 9.9 wit...eunhhu2026-10-052-1/+90
* 023: only checks the tier moved know just that they fail (those left in place...eunhhu2026-10-051-4/+8
* Design 023, before building it: a tier that lifts every block to SSA, knows t...eunhhu2026-10-051-0/+178
* Research 124's floors: each workload by hand as Pure could run it (its lists'...eunhhu2026-10-055-186/+987
* Research 124's suite at 6b45806: Pure against C 3.3x (roots), 300x (knapsack)...eunhhu2026-10-052-0/+217
* Research 124's suite: seven kinds of work in one event each (roots, knapsack,...eunhhu2026-10-059-0/+570
* Say what finishing 022's stage 3 found: the books and the work in registers, ...eunhhu2026-10-051-1/+40
* In the integers' code, walk only the slices it opens (the step's go to the ex...eunhhu2026-10-051-26/+72
* Read ahead in integers in the integers' code, and the bucket's last cell as w...eunhhu2026-10-051-12/+103
* Keep the work an event may still do in a register, x30 among what is kept, sm...eunhhu2026-10-052-64/+175
* Keep a nest's books in registers: a FLAT list's count and a DENSE one's items...eunhhu2026-10-051-44/+265
* Compile each nest of loops twice, the second with whole numbers as integers (...eunhhu2026-10-054-75/+472
* Compile only blocks whose loops are code throughout: a loop of steps (TPC-C's...eunhhu2026-10-051-9/+39
* Say what 022 decided while building stages 1-4 and how stage 3 ends: integers...eunhhu2026-10-051-1/+36
* Read a slice's bucket and first cell some rounds ahead of the loop that opens...eunhhu2026-10-054-8/+353
* Keep arrays' number columns as narrow as their values (u8, u32, f64; a DENSE ...eunhhu2026-10-055-204/+735
* Compile with the stack's values in registers, comparisons and bits branched o...eunhhu2026-10-053-339/+1141
* Pack a stored keyed list searched often into arrays and a bucket index fitted...eunhhu2026-10-054-34/+546
* Design 022: stored lists as arrays with a bucket index fitted to the keys sea...eunhhu2026-10-057-7/+434
* Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f...eunhhu2026-10-0575-2/+1243
* Compile only blocks with a loop, keep no code for a module without one, set a...eunhhu2026-10-052-11/+36
* Measure an index for a stored list's slices outside the list: three times a t...eunhhu2026-10-053-3/+121
* Say what a search's floor is with stored lists as trees: 373 ns a node to fin...eunhhu2026-10-054-1/+91
* Read a tree's items in compiled code from a run the frame keeps, start a run ...eunhhu2026-10-055-8/+88
* Write the hot instructions as code: constants, states, locals, rows, arithmet...eunhhu2026-10-054-27/+424
* Run a block through a frame and step, and compile blocks to AArch64 that call...eunhhu2026-10-056-558/+1159
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 16:03:24 +0000