master
1#ifndef HEADER_CURL_UINT_BSET_H
2#define HEADER_CURL_UINT_BSET_H
3/***************************************************************************
4 * _ _ ____ _
5 * Project ___| | | | _ \| |
6 * / __| | | | |_) | |
7 * | (__| |_| | _ <| |___
8 * \___|\___/|_| \_\_____|
9 *
10 * Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
11 *
12 * This software is licensed as described in the file COPYING, which
13 * you should have received as part of this distribution. The terms
14 * are also available at https://curl.se/docs/copyright.html.
15 *
16 * You may opt to use, copy, modify, merge, publish, distribute and/or sell
17 * copies of the Software, and permit persons to whom the Software is
18 * furnished to do so, under the terms of the COPYING file.
19 *
20 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
21 * KIND, either express or implied.
22 *
23 * SPDX-License-Identifier: curl
24 *
25 ***************************************************************************/
26#include "curl_setup.h"
28/* A bitset for unsigned int values.
29 * It can hold the numbers from 0 - (nmax - 1),
30 * rounded to the next 64 multiple.
31 *
32 * Optimized for high efficiency in adding/removing numbers.
33 * Efficient storage when the set is (often) relatively full.
34 *
35 * If the set's cardinality is only expected to be a fraction of nmax,
36 * uint_spbset offers a "sparse" variant with more memory efficiency at
37 * the price of slightly slower operations.
38 */
40struct uint32_bset {
41 uint64_t *slots;
42 uint32_t nslots;
43 uint32_t first_slot_used;
44#ifdef DEBUGBUILD
45 int init;
46#endif
47};
49/* Initialize the bitset with capacity 0. */
50void Curl_uint32_bset_init(struct uint32_bset *bset);
52/* Resize the bitset capacity to hold numbers from 0 to `nmax`,
53 * which rounds up `nmax` to the next multiple of 64. */
54CURLcode Curl_uint32_bset_resize(struct uint32_bset *bset, uint32_t nmax);
56/* Destroy the bitset, freeing all resources. */
57void Curl_uint32_bset_destroy(struct uint32_bset *bset);
59/* Get the cardinality of the bitset, e.g. numbers present in the set. */
60uint32_t Curl_uint32_bset_count(struct uint32_bset *bset);
62/* TRUE of bitset is empty */
63bool Curl_uint32_bset_empty(struct uint32_bset *bset);
65/* Clear the bitset, making it empty. */
66void Curl_uint32_bset_clear(struct uint32_bset *bset);
68/* Add the number `i` to the bitset. Return FALSE if the number is
69 * outside the set's capacity.
70 * Numbers can be added more than once, without making a difference. */
71bool Curl_uint32_bset_add(struct uint32_bset *bset, uint32_t i);
73/* Remove the number `i` from the bitset. */
74void Curl_uint32_bset_remove(struct uint32_bset *bset, uint32_t i);
76/* Return TRUE if the bitset contains number `i`. */
77bool Curl_uint32_bset_contains(struct uint32_bset *bset, uint32_t i);
79/* Get the first number in the bitset, e.g. the smallest.
80 * Returns FALSE when the bitset is empty. */
81bool Curl_uint32_bset_first(struct uint32_bset *bset, uint32_t *pfirst);
83/* Get the next number in the bitset, following `last` in natural order.
84 * Put another way, this is the smallest number greater than `last` in
85 * the bitset. `last` does not have to be present in the set.
86 *
87 * Returns FALSE when no such number is in the set.
88 *
89 * This allows to iterate the set while being modified:
90 * - added numbers higher than 'last' will be picked up by the iteration.
91 * - added numbers lower than 'last' will not show up.
92 * - removed numbers lower or equal to 'last' will not show up.
93 * - removed numbers higher than 'last' will not be visited. */
94bool Curl_uint32_bset_next(struct uint32_bset *bset, uint32_t last,
95 uint32_t *pnext);
97#ifndef CURL_POPCOUNT64
98#define CURL_POPCOUNT64(x) Curl_popcount64(x)
99#define CURL_POPCOUNT64_IMPLEMENT
100uint32_t Curl_popcount64(uint64_t x);
101#endif /* !CURL_POPCOUNT64 */
103#ifndef CURL_CTZ64
104#define CURL_CTZ64(x) Curl_ctz64(x)
105#define CURL_CTZ64_IMPLEMENT
106uint32_t Curl_ctz64(uint64_t x);
107#endif /* !CURL_CTZ64 */
109#endif /* HEADER_CURL_UINT_BSET_H */
Diagnostics4 git calls · 30 ms
CallStatusSizeTime030 ms
discover200152 B3 ms
git.upload-pack discover http.response.status_code=200 git.upstream.cf_ray=- git.upstream.phase=fetch git.upstream.dur_ms=2 git.response.bytes=152 git.server.agent=gitty/1.0 git.server.object_format=sha1 git.server.caps=agent ls-refs fetch object-format git.server.fetch=shallow filter sideband-all git.protocol.version=2 git.pkt.frames=8 git.pkt.data=6 git.pkt.flush=2 git.pkt.delim=0 git.pkt.bytes=152 git.pkt.payload.max=34
ls-refs200149 B · hit3 ms
git.upload-pack ls-refs http.response.status_code=200 git.upstream.cf_ray=- git.upstream.phase=ls-refs git.upstream.dur_ms=3 git.response.bytes=149 git.response.cache=HIT git.response.duration_ms=3 git.protocol.version=2 git.pkt.frames=3 git.pkt.data=2 git.pkt.flush=1 git.pkt.delim=0 git.pkt.bytes=149 git.pkt.payload.max=78 git.ls_refs.count=2 git.ls_refs.head=refs/heads/master
fetchblob:none · deepen 10200287 KiB · hit2 ms
git.upload-pack fetch http.response.status_code=200 git.upstream.cf_ray=- git.upstream.phase=fetch git.upstream.dur_ms=25 git.response.bytes=293470 git.response.cache=HIT git.response.duration_ms=2 git.fetch.filter=blob:none git.fetch.filter.requested=tree:0 git.fetch.filter.fallback=blob:none git.fetch.filter.learned=false git.fetch.wants=31c911efe5652725e930f4d2e60c9060e5f6646d git.fetch.haves.count=0 git.fetch.deepen=10 git.fetch.thin_pack=false git.fetch.ofs_delta=true git.protocol.version=2 git.pkt.frames=10 git.pkt.data=8 git.pkt.flush=1 git.pkt.delim=1 git.pkt.bytes=293470 git.pkt.payload.max=65516 git.sideband.band1.bytes=293354 git.sideband.band2.bytes=0 git.sideband.band3.bytes=0 git.pack.objects=87 git.pack.bytes=293354 git.pack.ofs_delta=0 git.pack.ref_delta=1 git.pack.chain.max=1 git.pack.trailer=6a646bcda6740bab42e321b51998b52ea15146c0 git.pack.full=86Open pack map
fetch2001.6 KiB · hit25 ms
git.upload-pack fetch http.response.status_code=200 git.response.bytes=1644 git.response.cache=HIT git.response.duration_ms=25 git.fetch.wants=ce0450c53ca934385c814caa6df728fb130cd1da git.fetch.haves.count=0 git.fetch.deepen=0 git.fetch.thin_pack=false git.fetch.ofs_delta=true git.protocol.version=2 git.pkt.frames=3 git.pkt.data=2 git.pkt.flush=1 git.pkt.delim=0 git.pkt.bytes=1644 git.pkt.payload.max=1623 git.sideband.band1.bytes=1622 git.sideband.band2.bytes=0 git.sideband.band3.bytes=0
Each row is one HTTP round trip ply made to the git server for this page, on one timeline. discover asks what the server speaks, ls-refs lists branch tips, fetch brings objects by id. A hit was served by Workers Cache. Tap a row for its wire details.
- Remote
- https://5ad2236b39de4c8bd8f6270ea63f3ea9.artifacts.cloudflare.net/git/public-v0/curl.git
- Ref
- refs/heads/master
- Commit
- 31c911efe5652725e930f4d2e60c9060e5f6646d
- cf-ray
- a5e192099867ddf0
- Request
- 7fba65ca…
- Protocol
- v2 · sha1
- Agent
- gitty/1.0
- Filter
- advertised
- Fetch
- shallow filter sideband-all
- Capabilities
- agent ls-refs fetch object-format