CHANGELOG revision 04468d21
12018-05-18
2
3    - [API] Expose useful lsquic_ver2str[] in lsquic.h
4    - [BUGFIX] Do not produce packet sequence gaps due to STREAM frame elision
5    - Improve checks of number of incoming streams limit and associated
6      error reporting.
7    - [BUGFIX] Command-line option `-6` now works correctly.
8
92018-05-16
10
11    - [FEATURE] DNS resolution
12    - [BUGFIX] Frame insertion mis-ID as overlap instead of dup
13    - http_client: fix priority range generated by -E flag
14
152018-05-09
16
17    - [FEATURE] Add support for Q043.
18    - Support for versions Q037, Q038, Q041, and Q042 has been removed.
19    - Fix typo in debug message.
20    - Fix code indentation.
21    - Add /* fallthru */ comment to stop newer gcc from complaining.
22    - Logger: fix compilation of optimized Windows build.
23
242018-05-04
25
26    - [FEATURE] Add support for Q042.
27    - Remove comment: MSPC is obsolete (no code changes)
28    - Prog: use lsquic_str2ver() when processing -o version flag
29    - Remove unused CTIM and SRBF transport parameters
30    - Disable QUIC versions Q037 and Q038 by default
31    - Fix Windows compilation by including compat header file in
32      lshpack.c
33    - Address warnings produced by newer versions of gcc
34    - Future-proof: turn off -Werror
35
362018-05-02
37
38    - [BUGFIX] Make lsquic_conn_quic_version() available
39    - Switch to using ls-hpack 1.1
40    - [BUGFIX] Do not ignore stream resets after receiving FIN
41
422018-04-27
43
44    - HPACK: do not allow header block to end with table size update.
45
462018-04-25
47
48    - [BUGFIX] Do not create gap in sent packnos when squeezing delayed
49      packets.
50    - [BUGFIX] sendctl checks for all unacked bytes, not just retx bytes.
51    - [BUGFIX] connections with blocked scheduled packets are not tickable
52      for sending.
53    - [BUGFIX] Conn is tickable if it wants to send a connection-level
54      frame.
55
562018-04-23
57
58    - Fix busy loop: tickable must make progress.  When connection is
59      self-reporting as tickable, it must make progress when ticked.  There
60      are two issues:
61        1. If there are buffered packets, the connection is only tickable if
62           they can be sent out.
63        2. A connection is tickable if there are streams on the servicing
64           queue.  When the tick occurs, we must service the stream
65           independent of whether any packets are sent.
66    - Fix assertion in pacer which can be incorrect under some
67      conditions.
68    - cmake: do not turn on address sanitizer if in Travis.
69
702018-04-20
71
72    - [BUGFIX] Fix bug in lsquic_engine_connect() exposed by yesterday's
73      changes.
74
752018-04-19
76
77    - [BUGFIX] Add connection to Tickable Queue on stream write
78    - cmake: use MSVC variable instead of trying to detect
79    - engine: improve connection incref/decref logging
80    - stream: don't ignore errors that may occur on triggered flush
81    - connection: remove obsolete method
82    - engine: indicate connection as tickable if previous call went
83      over threshold
84
852018-04-09
86
87    [API Change, OPTIMIZATION] Only process conns that need to be processed
88
89    The API is simplified: do not expose the user code to several
90    queues.  A "connection queue" is now an internal concept.
91    The user processes connections using the single function
92    lsquic_engine_process_conns().  When this function is called,
93    only those connections are processed that need to be processed.
94    A connection needs to be processed when:
95
96        1. New incoming packets have been fed to the connection.
97        2. User wants to read from a stream that is readable.
98        3. User wants to write to a stream that is writeable.
99        4. There are buffered packets that can be sent out.  (This
100           means that the user wrote to a stream outside of the
101           lsquic library callback.)
102        5. A control frame (such as BLOCKED) needs to be sent out.
103        6. A stream needs to be serviced or delayed stream needs to
104           be created.
105        7. An alarm rings.
106        8. Pacer timer expires.
107
108    To achieve this, the library places the connections into two
109    priority queues (min heaps):
110
111        1. Tickable Queue; and
112        2. Advisory Tick Time queue (ATTQ).
113
114    Each time lsquic_engine_process_conns() is called, the Tickable
115    Queue is emptied.  After the connections have been ticked, they are
116    queried again: if a connection is not being closed, it is placed
117    either in the Tickable Queue if it is ready to be ticked again or
118    it is placed in the Advisory Tick Time Queue.  It is assumed that
119    a connection always has at least one timer set (the idle alarm).
120
121    The connections in the Tickable Queue are arranged in the least
122    recently ticked order.  This lets connections that have been quiet
123    longer to get their packets scheduled first.
124
125    This change means that the library no longer needs to be ticked
126    periodically.  The user code can query the library when is the
127    next tick event and schedule it exactly.  When connections are
128    processed, only the tickable connections are processed, not *all*
129    the connections.  When there are no tick events, it means that no
130    timer event is necessary -- only the file descriptor READ event
131    is active.
132
133    The following are improvements and simplifications that have
134    been triggered:
135
136        - Queue of connections with incoming packets is gone.
137        - "Pending Read/Write Events" Queue is gone (along with its
138          history and progress checks).  This queue has become the
139          Tickable Queue.
140        - The connection hash no longer needs to track the connection
141          insertion order.
142
1432018-04-02
144
145    - [FEATURE] Windows support
146
147    - Reduce stack use -- outgoing packet batch is now allocated on the heap.
148
1492018-03-09
150
151    - [OPTIMIZATION] Merge series of ACKs if possible
152
153      Parsed single-range ACK frames (that is the majority of frames) are
154      saved in the connection and their processing is deferred until the
155      connection is ticked.  If several ACKs come in a series between
156      adjacent ticks, we check whether the latest ACK is a strict superset
157      of the saved ACK.  If it is, the older ACK is not processed.
158
159      If ACK frames can be merged, they are merged and only one of them is
160      either processed or saved.
161
162    - [OPTIMIZATION] Speed up ACK verification by simplifying send history.
163
164      Never generate a gap in the sent packet number sequence.  This reduces
165      the send history to a single number instead of potentially a series of
166      packet ranges and thereby speeds up ACK verification.
167
168      By default, detecting a gap in the send history is not fatal: only a
169      single warning is generated per connection.  The connection can continue
170      to operate even if the ACK verification code is not able to detect some
171      inconsistencies.
172
173    - [OPTIMIZATION] Rearrange the lsquic_send_ctl struct
174
175      The first part of struct lsquic_send_ctl now consists of members that
176      are used in lsquic_send_ctl_got_ack() (in the absense of packet loss,
177      which is the normal case).  To speed up reads and writes, we no longer
178      try to save space by using 8- and 16-bit integers.  Use regular integer
179      width for everything.
180
181    - [OPTIMIZATION] Cache size of sent packet.
182
183    - [OPTIMIZATION] Keep track of the largest ACKed in packet_out
184
185      Instead of parsing our own ACK frames when packet has been acked,
186      use the value saved in the packet_out structure when the ACK frame
187      was generated.
188
189    - [OPTIMIZATION] Take RTT sampling conditional out of ACK loop
190
191    - [OPTIMIZATION] ACK processing: only call clock_gettime() if needed
192
193    - [OPTIMIZATION] Several code-level optimizations to ACK processing.
194
195    - Fix: http_client: fix -I flag; switch assert() to abort()
196
1972018-02-26
198    - [API Change] lsquic_engine_connect() returns pointer to the connection
199      object.
200    - [API Change] Add lsquic_conn_get_engine() to get engine object from
201      connection object.
202    - [API Change] Add lsquic_conn_status() to query connection status.
203    - [API Change] Add add lsquic_conn_set_ctx().
204    - [API Change] Add new timestamp format, e.g. 2017-03-21 13:43:46.671345
205    - [OPTIMIZATION] Process handshake STREAM frames as soon as packet
206      arrives.
207    - [OPTIMIZATION] Do not compile expensive send controller sanity check
208      by default.
209    - [OPTIMIZATION] Add fast path to gquic_be_gen_reg_pkt_header.
210    - [OPTIMIZATION] Only make squeeze function call if necessary.
211    - [OPTIMIZATION] Speed up Q039 ACK frame parsing.
212    - [OPTIMIZATION] Fit most used elements of packet_out into first 64 bytes.
213    - [OPTIMIZATION] Keep track of scheduled bytes instead of calculating.
214    - [OPTIMIZATION] Prefetch next unacked packet when processing ACK.
215    - [OPTIMIZATION] Leverage fact that ACK ranges and unacked list are.
216      ordered.
217    - [OPTIMIZATION] Reduce function pointer use for STREAM frame generation
218    - Fix: reset incoming streams that arrive after we send GOAWAY.
219    - Fix: delay client on_new_conn() call until connection is fully set up.
220    - Fixes to buffered packets logic: splitting, STREAM frame elision.
221    - Fix: do not dispatch on_write callback if no packets are available.
222    - Fix WINDOW_UPDATE send and resend logic.
223    - Fix STREAM frame extension code.
224    - Fix: Drop unflushed data when stream is reset.
225    - Switch to tracking CWND using bytes rather than packets.
226    - Fix TCP friendly adjustment in cubic.
227    - Fix: do not generate invalid STOP_WAITING frames during high packet
228      loss.
229    - Pacer fixes.
230
2312017-12-18
232
233    - Fix: better follow cubic curve after idle period
234    - Fix: add missing parts to outgoing packet splitting code
235    - Fix: compilation using gcc 4.8.4
236
2372017-10-31
238
239    - Add APIs.txt -- describes LSQUIC APIs
240
2412017-10-31
242
243    - [API Change] Sendfile-like functionality is gone.  The stream no
244      longer opens files and deals with file descriptors.  (Among other
245      things, this makes the code more portable.)  Three writing functions
246      are provided:
247
248        lsquic_stream_write
249        lsquic_stream_writev
250        lsquic_stream_writef    (NEW)
251
252      lsquic_stream_writef() is given an abstract reader that has function
253      pointers for size() and read() functions which the user can implement.
254      This is the most flexible way.  lsquic_stream_write() and
255      lsquic_stream_writev() are now both implemented as wrappers around
256      lsquic_stream_writef().
257
258    - [OPTIMIZATION] When writing to stream, be it within or without the
259      on_write() callback, place data directly into packet buffer,
260      bypassing auxiliary data structures.  This reduces amount of memory
261      required, for the amount of data that can be written is limited
262      by the congestion window.
263
264      To support writes outside the on_write() callback, we keep N
265      outgoing packet buffers per connection which can be written to
266      by any stream.  One half of these are reserved for the highest
267      priority stream(s), the other half for all other streams.  This way,
268      low-priority streams cannot write instead of high-priority streams
269      and, on the other hand, low-priority streams get a chance to send
270      their packets out.
271
272      The algorithm is as follows:
273
274      - When user writes to stream outside of the callback:
275        - If this is the highest priority stream, place it onto the
276          reserved N/2 queue or fail.
277            (The actual size of this queue is dynamic -- MAX(N/2, CWND) --
278             rather than N/2, allowing high-priority streams to write as
279             much as can be sent.)
280        - If the stream is not the highest priority, try to place the
281          data onto the reserved N/2 queue or fail.
282      - When tick occurs *and* more packets can be scheduled:
283        - Transfer packets from the high N/2 queue to the scheduled
284          queue.
285        - If more scheduling is allowed:
286          - Call on_write callbacks for highest-priority streams,
287            placing resulting packets directly onto the scheduled queue.
288        - If more scheduling is allowed:
289          - Transfer packets from the low N/2 queue to the scheduled
290            queue.
291        - If more scheduling is allowed:
292          - Call on_write callbacks for non-highest-priority streams,
293            placing resulting packets directly onto the scheduled queue
294
295      The number N is currently 20, but it could be varied based on
296      resource usage.
297
298    - If stream is created due to incoming headers, make headers readable
299      from on_new.
300
301    - Outgoing packets are no longer marked non-writeable to prevent placing
302      more than one STREAM frame from the same stream into a single packet.
303      This property is maintained via code flow and an explicit check.
304      Packets for stream data are allocated using a special function.
305
306    - STREAM frame elision is cheaper, as we only perform it if a reset
307      stream has outgoing packets referencing it.
308
309    - lsquic_packet_out_t is smaller, as stream_rec elements are now
310      inside a union.
311
3122017-10-12
313
314    - Do not send RST_STREAM when stream is closed for reading
315    - Raise maximum header size from 4K to 64K
316    - Check header name and value lengths against maximum imposed by HPACK
317    - Fix NULL dereference in stream flow controller
318
3192017-10-09
320
321    - Hide handshake implementation behind a set of function pointers
322    - Use monotonically increasing clock
323    - Make sure that retx delay is not larger than the max of 60 seconds
324
3252017-09-29
326
327    - A few fixes to code and README
328
3292017-09-28
330
331    - Add support for Q041; drop support for Q040
332
3332017-09-27
334
335    - Fix CMakeLists.txt: BoringSSL include and lib was mixed up
336
3372017-09-26
338
339    - Add support for Mac OS
340    - Add support for Raspberry Pi
341    - Fix BoringSSL compilation: include <openssl/hmac.h> explicitly
342
3432017-09-22
344
345    - Initial release
346