aboutsummaryrefslogtreecommitdiffstats
path: root/core/module-jit.c
Commit message (Expand)AuthorAgeFilesLines
* 027's 4f-4: loops nested to any depth: the load counts a module's deepest nes...eunhhu41 hours1-1/+3
* 027's 4f-2: no fixed count of states: the header's u16 alone (PURE_MODULE_STA...eunhhu42 hours1-12/+14
* Module format v7, 027's 4d: every input a message: a module's inputs are mess...eunhhu44 hours1-5/+3
* Module format v7, 027's 4c: cursors and indices one anchor: a module's state ...eunhhu45 hours1-1/+1
* Module format and executor: 027's 4b-1, a record field holding bytes (type 5)...eunhhu46 hours1-1/+1
* Module executor: a kept list's lists through steps of their own (027's stage ...eunhhu48 hours1-1/+1
* Module format and executor: 027's stage 2c, functions and characters: a funct...eunhhu2 days1-1/+3
* Module format and executor: 027's stage 2b, lists in records: a record field ...eunhhu7 days1-1/+2
* JIT: books written back only for lists their nest keeps books of: a nest with...eunhhu2026-10-061-0/+1
* JIT: an append to a HASHED list in a nest whose books keep DENSE appends' gro...eunhhu2026-10-061-10/+14
* The tier checks a number finite in integers (its exponent's bits all ones), o...eunhhu2026-10-051-4/+6
* Pointer induction (023): an inner count's access by a key affine in its round...eunhhu2026-10-051-4/+156
* The tier's numbers' arithmetic in a run, each read by the next alone (constan...eunhhu2026-10-051-11/+64
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-051-4/+65
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-051-6/+80
* 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-051-60/+158
* The tier's keys and positions in range for every round, checked once where th...eunhhu2026-10-051-51/+196
* The tier, first (023): a nest of loops as SSA, its stack, locals and states v...eunhhu2026-10-051-6/+2149
* Research 124's suite: seven kinds of work in one event each (roots, knapsack,...eunhhu2026-10-051-0/+2
* 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-051-54/+132
* 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-051-75/+388
* Compile only blocks whose loops are code throughout: a loop of steps (TPC-C's...eunhhu2026-10-051-9/+39
* Read a slice's bucket and first cell some rounds ahead of the loop that opens...eunhhu2026-10-051-4/+344
* Keep arrays' number columns as narrow as their values (u8, u32, f64; a DENSE ...eunhhu2026-10-051-152/+483
* Compile with the stack's values in registers, comparisons and bits branched o...eunhhu2026-10-051-336/+1133
* Compile only blocks with a loop, keep no code for a module without one, set a...eunhhu2026-10-051-6/+20
* Read a tree's items in compiled code from a run the frame keeps, start a run ...eunhhu2026-10-051-3/+28
* Write the hot instructions as code: constants, states, locals, rows, arithmet...eunhhu2026-10-051-25/+407
* Run a block through a frame and step, and compile blocks to AArch64 that call...eunhhu2026-10-051-0/+418