aboutsummaryrefslogtreecommitdiffstats
path: root/core
Commit message (Expand)AuthorAgeFilesLines
...
* Batch: a batch's appends made at once (pure_list_add_many, a call a chunk of ...eunhhu2026-10-063-14/+291
* Batch: a walk (EACH) whose block has batch forms runs a batch of its items at...eunhhu2026-10-062-27/+55
* Batch: a sum into a cell, L[k].f = L[k].f + e (k computed twice the same and ...eunhhu2026-10-061-12/+166
* Batch executor stage 5 (024): a recurrence (a local a round reads before it s...eunhhu2026-10-063-14/+206
* JIT: books written back only for lists their nest keeps books of: a nest with...eunhhu2026-10-061-0/+1
* Batch executor stage 4, first part (024): an item of numbers and bools append...eunhhu2026-10-063-17/+89
* JIT: an append to a HASHED list in a nest whose books keep DENSE appends' gro...eunhhu2026-10-061-10/+14
* Batch: numbers' results checked finite as they are made (in integers, in the ...eunhhu2026-10-051-39/+117
* Batch executor stage 2 (024): a loop in the batch's block runs its rounds for...eunhhu2026-10-053-42/+339
* Batch executor stage 1 (024): a count's loop whose block has batch forms (lan...eunhhu2026-10-056-56/+1227
* 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
* 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-051-11/+64
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-052-7/+71
* Text keys (023): a list knows the text field it is keyed by; an event's list ...eunhhu2026-10-055-29/+256
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-053-18/+279
* 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-053-54/+203
* The tier, first (023): a nest of loops as SSA, its stack, locals and states v...eunhhu2026-10-054-8/+2173
* 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
* 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-053-75/+410
* 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-053-7/+347
* 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
* Compile only blocks with a loop, keep no code for a module without one, set a...eunhhu2026-10-052-11/+36
* 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-055-557/+1158
* Share an event's empty list as it is: a snapshot made every event's lists tre...eunhhu2026-10-052-1/+20
* Keep an event's lists in arrays, flat or at their keys, and read a field by k...eunhhu2026-10-055-18/+620
* End a loop's iteration at the block's end check, not a second one per instruc...eunhhu2026-10-041-12/+12
* Keep one finger a thread, as before: four cost the bank's queries instruction...eunhhu2026-10-042-33/+22
* Search an event's keyed lists by a key set and lists by fingers, add by key i...eunhhu2026-10-045-96/+738
* Let a view compute in its body, on a reader's own lists (018 stage 3)eunhhu2026-10-043-29/+201
* Count in loops that nest, break, and keep an event's own lists, every event b...eunhhu2026-10-045-41/+321
* Keep transient states the app's while it runs, never stored (018 stage 1)eunhhu2026-10-044-20/+162
* Build with clang, and the core and store on macOS, againeunhhu2026-10-012-5/+10
* Read a list cell's place after finding its leaf, not beside iteunhhu2026-10-011-1/+2
* Count work only under a budget, and say why a view failed only then (017)eunhhu2026-10-013-21/+32
* Bound what an event or a view may run: a work budget (017)eunhhu2026-10-013-12/+144
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 17:15:24 +0000