aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Let the M6 simulator queue records at a rate and time each oneeunhhu2026-09-291-5/+33
* Start M6's flows together, each a process, and count their shares from 10 seunhhu2026-09-291-26/+63
* Find how large a packet the path carries: 1,452 bytes once a probe is acknowl...eunhhu2026-09-296-44/+118
* Record M6 with records in parts and no path MTU yet (020)eunhhu2026-09-291-0/+126
* Queue only the way to the receivers behind M6's bottleneckeunhhu2026-09-292-18/+30
* Send a record in parts cut where a packet is full, not 1000-byte pieceseunhhu2026-09-292-129/+246
* Apply a link's records in transport.c as a host doeseunhhu2026-09-291-11/+20
* Measure a link on a path of loss, reordering and a bottleneck (M6 harness)eunhhu2026-09-295-33/+382
* Wait for late packets, undo what they cost, and grow as CUBICeunhhu2026-09-294-13/+311
* Say why the links became a part, and not a repository (009, 011)eunhhu2026-09-292-3/+38
* Make the load generator's devices real link senders, many on one threadeunhhu2026-09-294-384/+170
* Keep a link's two sides as state alone, the sockets and threads aparteunhhu2026-09-298-1555/+2054
* Let links know nothing of the core: the host names inputs and shapeseunhhu2026-09-297-105/+137
* Put the links and the crypto they use in link/, a part of their owneunhhu2026-09-2916-35/+47
* Measure the drains again with the outbox as a list (096)eunhhu2026-09-292-17/+48
* Keep the outbox as a list: a save logs only the sends and trims it madeeunhhu2026-09-297-153/+277
* Measure the CPU a record costs a link, against quinn (096)eunhhu2026-09-296-22/+395
* Send a record whole when it fits a packet, however many pieces it haseunhhu2026-09-293-46/+75
* Keep a link's queued records in one byte ring, taken back as they are storedeunhhu2026-09-281-23/+65
* Keep a stream's records in order on a line, handed over as they areeunhhu2026-09-281-13/+93
* Take a burst whole with UDP GRO; key the listener's AES only when the run cha...eunhhu2026-09-281-11/+63
* Send small records in a RECORDS frame: 1 or 2 bytes of framing each, not 19eunhhu2026-09-282-9/+74
* Wake a link's thread only when it sleeps, onceeunhhu2026-09-282-3/+178
* Drain a link's backlog without scanning it: 370k to 990k records a secondeunhhu2026-09-281-105/+218
* Measure a restart under load and a first contact (095)eunhhu2026-09-289-30/+341
* Name the link threads, so their CPU is seen apart (pure-link, pure-listen)eunhhu2026-09-281-0/+2
* Remember each sender's secret beside the node's key: no X25519 at restarteunhhu2026-09-284-10/+89
* Measure a link at rest: 132 bytes against a QUIC connection's 38,106 (094)eunhhu2026-09-2810-1/+2123
* Keep a run's keys as bytes: one AES-GCM context serves the listenereunhhu2026-09-285-66/+100
* Let a link at rest cost the listener only its allowingeunhhu2026-09-284-172/+433
* Keep the numbers heard as a list: a save logs only the ones it changedeunhhu2026-09-285-123/+290
* Link two nodes without a connection over UDP (093, design 011's first stage)eunhhu2026-09-2813-26/+1890
* Redesign 011: no connections, the transport's state as the app's dataeunhhu2026-09-282-151/+172
* Design the Pure transport: stored records sent straight over UDP (011)eunhhu2026-09-282-0/+202
* Measure TPC-C again with compact log recordseunhhu2026-09-285-34/+39
* Log list changes compact: varint positions and integers, the rest bit for biteunhhu2026-09-284-32/+131
* Check TPC-C's consistency from one snapshot a side, and measure TPC-C on RAM ...eunhhu2026-09-286-24/+235
* Write list images a chunk at a time, and keep the log within the lists' sizeeunhhu2026-09-286-37/+116
* Keep lists as images and a log of their changes, checkpointed off the ownereunhhu2026-09-2810-188/+662
* Log an app's saves in reused segments and write list images whole beside the ...eunhhu2026-09-285-4/+862
* Share the store's digest between its fileseunhhu2026-09-283-71/+81
* Gather returning requests only as long as the last save waited for its deviceeunhhu2026-09-281-3/+18
* Read and write numbers exactly without strtod or printf in the common caseseunhhu2026-09-285-2/+172
* Guide a list's inner nodes: items before each child and its first key, search...eunhhu2026-09-284-44/+197
* Save a list as its items and a journal of its changes sinceeunhhu2026-09-288-186/+358
* Run TPC-C on Pure and on SQLite, and compare the states they leaveeunhhu2026-09-285-0/+1316
* Allow 16 records and 128 record fields a moduleeunhhu2026-09-282-2/+2
* Slice a keyed list: fold and walk over a range of keyseunhhu2026-09-284-29/+87
* Read only the keys a test allows, and count distinct valueseunhhu2026-09-284-35/+410
* Give an event localseunhhu2026-09-285-20/+156
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 17:30:14 +0000