Packages

hackney

2.0.1
4.7.2 4.7.1 4.7.0 4.6.1 4.6.0 4.5.2 4.5.1 4.5.0 4.4.5 4.4.3 4.4.2 4.4.1 4.4.0 4.3.0 4.2.3 4.2.2 4.2.1 4.2.0 4.1.0 4.0.3 4.0.2 4.0.1 4.0.0 3.2.1 3.2.0 3.1.2 3.1.1 3.1.0 3.0.3 3.0.2 3.0.1 3.0.0 retired 2.0.1 2.0.0 2.0.0-beta.1 1.25.0 1.24.1 1.24.0 1.23.0 1.22.0 1.21.0 1.20.1 1.20.0 1.19.1 1.19.0 1.18.2 1.18.1 1.18.0 1.17.4 1.17.3 1.17.2 1.17.1 1.17.0 1.16.0 1.15.2 1.15.1 1.15.0 1.14.3 1.14.2 1.14.0 1.13.0 1.12.1 1.12.0 1.11.0 1.10.1 1.10.0 1.9.0 1.8.6 1.8.5 1.8.4 1.8.3 1.8.2 1.8.0 1.7.1 1.7.0 1.6.6 retired 1.6.5 1.6.4 retired 1.6.3 1.6.2 1.6.1 1.6.0 1.5.7 1.5.6 1.5.5 1.5.4 1.5.3 1.5.2 1.5.1 1.5.0 1.4.10 1.4.8 1.4.7 1.4.6 1.4.5 1.4.4 1.4.3 1.4.2 1.4.1 1.4.0 1.3.2 1.3.1 1.3.0 1.2.0 1.1.0 1.0.6 1.0.5 1.0.2 1.0.1 0.15.2 0.15.0 0.14.3 0.14.2 0.14.1 0.14.0 0.13.1

Simple HTTP client with HTTP/1.1, HTTP/2, and HTTP/3 support

Security advisory: This version has known vulnerabilities. View advisories
HexDocs

Current section

Files

Jump to
Readme
116 Versions
6 Dependencies
Dependants
12 Advisories
Files
Activity
hackney c_src lsquic src liblsquic lsquic_packet_gquic.c
Raw

c_src/lsquic/src/liblsquic/lsquic_packet_gquic.c 

/* Copyright (c) 2017 - 2022 LiteSpeed Technologies Inc.  See LICENSE. */

#include <stdint.h>

#include <stdlib.h>



#include "lsquic_packet_common.h"

#include "lsquic_packet_gquic.h"







lsquic_packno_t

lsquic_restore_packno (lsquic_packno_t cur_packno,

                unsigned len,

                lsquic_packno_t max_packno)

{

    lsquic_packno_t candidates[3], epoch_delta;

    int64_t diffs[3];

    unsigned min;



    epoch_delta = 1ULL << (len << 3);

    candidates[1] = (max_packno & ~(epoch_delta - 1)) + cur_packno;

    candidates[0] = candidates[1] - epoch_delta;

    candidates[2] = candidates[1] + epoch_delta;



    diffs[0] = llabs((int64_t) candidates[0] - (int64_t) max_packno);

    diffs[1] = llabs((int64_t) candidates[1] - (int64_t) max_packno);

    diffs[2] = llabs((int64_t) candidates[2] - (int64_t) max_packno);



    min = diffs[1] < diffs[0];

    if (diffs[2] < diffs[min])

        min = 2;



    return candidates[min];

}