aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Find pure-serve's owner by its thread, and sort its samples as 106 doeseunhhu2026-09-301-45/+74
* Let a list make its next nodes of those no snapshot reads any moreeunhhu2026-09-304-47/+150
* Compare TPC-C on the SD card with SQLite committing in groups, not each trans...eunhhu2026-09-303-5/+11
* Say what TPC-C costs when SQLite commits in groups too, and with four warehou...eunhhu2026-09-3020-2/+547
* Read TPC-C's table dumps from Pure a page at a timeeunhhu2026-09-301-4/+10
* Checkpoint TPC-C's SQLite each 40 MB of WAL, as tuning on both devices choseeunhhu2026-09-301-6/+11
* Say what the TPC-C comparison decides, before running it (106)eunhhu2026-09-301-0/+44
* Let TPC-C's SQLite commit in groups as pure-serve does, and say what each run...eunhhu2026-09-302-50/+276
* Name the owner's thread and the checkpoint's, so their CPU is seen aparteunhhu2026-09-301-0/+2
* Say where the shared board now lives, and what is left (105)eunhhu2026-09-301-1/+9
* Say that sends and applies now spread their fields (105)eunhhu2026-09-301-4/+8
* Say what laying a record out anew costs (014)eunhhu2026-09-302-2/+2
* Say how growing a board two nodes share went (105)eunhhu2026-09-302-1/+120
* Say a node's name when pure-serve startseunhhu2026-09-301-2/+7
* Take a delivery's fields by name, dropping noneeunhhu2026-09-3011-47/+629
* Balance the snapshot register's count, and free the runtime lists in ordereunhhu2026-09-303-7/+17
* Recast waiting sends by field name when an output's fields changeeunhhu2026-09-307-66/+616
* Try a refused stream again when its try is goneeunhhu2026-09-302-0/+69
* Say what the windows and checkpoints cost (013 steps 2 and 3, 104)eunhhu2026-09-305-15/+79
* Hold a window of each output's sends in its transport, not the outboxeunhhu2026-09-3010-60/+196
* Say where a node's memory goes, and the budget it now keeps (104, 013)eunhhu2026-09-3010-1/+473
* Wait on the monotonic clock everywhere a deadline is waited foreunhhu2026-09-306-30/+146
* Count only the states the memory budget countseunhhu2026-09-302-5/+12
* Bound what an app holds (--memory): refuse what would grow past iteunhhu2026-09-307-59/+512
* Let a receiver whose app is full keep what came, and say soeunhhu2026-09-307-34/+86
* Let a held snapshot keep the states of its time, not all that came aftereunhhu2026-09-304-37/+174
* Say how review 004's seven defects went (103)eunhhu2026-09-291-0/+61
* Say what adopting the link took, and how it fares against ngtcp2 (102)eunhhu2026-09-295-18/+411
* Size a receiver's credit by what it holds, not 1,024 recordseunhhu2026-09-292-9/+22
* Lead pure-serve's usage with pure:// between nodes, and count refusalseunhhu2026-09-292-8/+12
* Serve documents when a module keeps a collection, not by its inputs' nameseunhhu2026-09-292-2/+35
* Tick a stateless app's timers, and wait for them on the monotonic clockeunhhu2026-09-294-13/+74
* Refuse a module whose output names its fields otherwise while sends waiteunhhu2026-09-293-21/+86
* Hold an app uncertain whatever its save changed, not only a listeunhhu2026-09-292-6/+42
* Keep a walk's range only when its body moves no state its bound readseunhhu2026-09-294-4/+188
* Let ngtcp2's handshake through a path that reorderseunhhu2026-09-291-1/+8
* Put ngtcp2 beside quinn in M6, as it is in M5eunhhu2026-09-292-66/+210
* Remember the epoch of each of a peer's runs that send, not oneeunhhu2026-09-294-55/+158
* Specify the link (012) and make it the default between nodes (011)eunhhu2026-09-295-6/+354
* Link a node to a receiver written from the spec aloneeunhhu2026-09-291-0/+224
* Say why a stream is refused (REFUSED), and try it again seldomeunhhu2026-09-296-25/+289
* Give each of a peer's runs a place, however many send at onceeunhhu2026-09-292-12/+122
* Take no send larger than a receiver holds: 16 MiB, not 64eunhhu2026-09-293-5/+69
* Say how the four limits left went: three solved, one measured away (101)eunhhu2026-09-293-1/+153
* Put ngtcp2 beside quinn in M5, as the design plannedeunhhu2026-09-294-0/+505
* Put records that come in order straight onto the line, a frame at onceeunhhu2026-09-291-1/+13
* Say LOST when a run's epoch is not known, and let its sender begin again at onceeunhhu2026-09-294-34/+154
* See a path that stops carrying larger datagrams, and go back to the first sizeeunhhu2026-09-293-16/+54
* Say what a small record costs a link now, beside quinn in the same rounds (09...eunhhu2026-09-292-2/+10
* Cut what a small record costs a link: no division a record, no walk a deliveryeunhhu2026-09-292-20/+36
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 16:07:23 +0000