mirror of
https://github.com/curl/curl.git
synced 2026-01-18 17:21:26 +01:00
d11b8593a2
- curl_range: replace `sendf.h` with direct header dependency `curl_trc.h`. - drop `curl/curl.h` includes from internal sourcees in favor of the include made from `curl_setup.h`. Replace it with the latter where it's the only include. - include `curl_setup.h` before using macros, where missing. - drop redundant `stdlib.h`, `string.h` includes, in favor of `curl_setup_once.h` including them. - drop redundant `limits.h` in favor of `curl_setup.h` including it. - fake_addrinfo.h: fix typo in comment. - curl_setup_once.h: drop `stdio.h` in favor of earlier include in `curl_setup.h`. - drop stray, unused, `stddef.h` includes. - memdebug.h: add missing `stddef.h` include. (relying on accidental includes via other headers before this patch.) - stddef.h: document why it's included. - strerr: drop `curl/mprintf.h` in favor of `curl/curl.h` including it via `curl_setup.h`. Closes #20027
113 lines
4.2 KiB
C
113 lines
4.2 KiB
C
#ifndef HEADER_CURL_UINT_BSET_H
|
|
#define HEADER_CURL_UINT_BSET_H
|
|
/***************************************************************************
|
|
* _ _ ____ _
|
|
* Project ___| | | | _ \| |
|
|
* / __| | | | |_) | |
|
|
* | (__| |_| | _ <| |___
|
|
* \___|\___/|_| \_\_____|
|
|
*
|
|
* Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
|
|
*
|
|
* This software is licensed as described in the file COPYING, which
|
|
* you should have received as part of this distribution. The terms
|
|
* are also available at https://curl.se/docs/copyright.html.
|
|
*
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
* copies of the Software, and permit persons to whom the Software is
|
|
* furnished to do so, under the terms of the COPYING file.
|
|
*
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
* KIND, either express or implied.
|
|
*
|
|
* SPDX-License-Identifier: curl
|
|
*
|
|
***************************************************************************/
|
|
#include "curl_setup.h"
|
|
|
|
/* A bitset for unsigned int values.
|
|
* It can hold the numbers from 0 - (nmax - 1),
|
|
* rounded to the next 64 multiple.
|
|
*
|
|
* Optimized for high efficiency in adding/removing numbers.
|
|
* Efficient storage when the set is (often) relatively full.
|
|
*
|
|
* If the set's cardinality is only expected to be a fraction of nmax,
|
|
* uint_spbset offers a "sparse" variant with more memory efficiency at
|
|
* the price of slightly slower operations.
|
|
*/
|
|
|
|
struct uint32_bset {
|
|
uint64_t *slots;
|
|
uint32_t nslots;
|
|
uint32_t first_slot_used;
|
|
#ifdef DEBUGBUILD
|
|
int init;
|
|
#endif
|
|
};
|
|
|
|
/* Initialize the bitset with capacity 0. */
|
|
void Curl_uint32_bset_init(struct uint32_bset *bset);
|
|
|
|
/* Resize the bitset capacity to hold numbers from 0 to `nmax`,
|
|
* which rounds up `nmax` to the next multiple of 64. */
|
|
CURLcode Curl_uint32_bset_resize(struct uint32_bset *bset, uint32_t nmax);
|
|
|
|
/* Destroy the bitset, freeing all resources. */
|
|
void Curl_uint32_bset_destroy(struct uint32_bset *bset);
|
|
|
|
/* Get the bitset capacity, e.g. can hold numbers from 0 to capacity - 1. */
|
|
uint32_t Curl_uint32_bset_capacity(struct uint32_bset *bset);
|
|
|
|
/* Get the cardinality of the bitset, e.g. numbers present in the set. */
|
|
uint32_t Curl_uint32_bset_count(struct uint32_bset *bset);
|
|
|
|
/* TRUE of bitset is empty */
|
|
bool Curl_uint32_bset_empty(struct uint32_bset *bset);
|
|
|
|
/* Clear the bitset, making it empty. */
|
|
void Curl_uint32_bset_clear(struct uint32_bset *bset);
|
|
|
|
/* Add the number `i` to the bitset. Return FALSE if the number is
|
|
* outside the set's capacity.
|
|
* Numbers can be added more than once, without making a difference. */
|
|
bool Curl_uint32_bset_add(struct uint32_bset *bset, uint32_t i);
|
|
|
|
/* Remove the number `i` from the bitset. */
|
|
void Curl_uint32_bset_remove(struct uint32_bset *bset, uint32_t i);
|
|
|
|
/* Return TRUE if the bitset contains number `i`. */
|
|
bool Curl_uint32_bset_contains(struct uint32_bset *bset, uint32_t i);
|
|
|
|
/* Get the first number in the bitset, e.g. the smallest.
|
|
* Returns FALSE when the bitset is empty. */
|
|
bool Curl_uint32_bset_first(struct uint32_bset *bset, uint32_t *pfirst);
|
|
|
|
/* Get the next number in the bitset, following `last` in natural order.
|
|
* Put another way, this is the smallest number greater than `last` in
|
|
* the bitset. `last` does not have to be present in the set.
|
|
*
|
|
* Returns FALSE when no such number is in the set.
|
|
*
|
|
* This allows to iterate the set while being modified:
|
|
* - added numbers higher than 'last' will be picked up by the iteration.
|
|
* - added numbers lower than 'last' will not show up.
|
|
* - removed numbers lower or equal to 'last' will not show up.
|
|
* - removed numbers higher than 'last' will not be visited. */
|
|
bool Curl_uint32_bset_next(struct uint32_bset *bset, uint32_t last,
|
|
uint32_t *pnext);
|
|
|
|
#ifndef CURL_POPCOUNT64
|
|
#define CURL_POPCOUNT64(x) Curl_popcount64(x)
|
|
#define CURL_POPCOUNT64_IMPLEMENT
|
|
uint32_t Curl_popcount64(uint64_t x);
|
|
#endif /* !CURL_POPCOUNT64 */
|
|
|
|
#ifndef CURL_CTZ64
|
|
#define CURL_CTZ64(x) Curl_ctz64(x)
|
|
#define CURL_CTZ64_IMPLEMENT
|
|
uint32_t Curl_ctz64(uint64_t x);
|
|
#endif /* !CURL_CTZ64 */
|
|
|
|
#endif /* HEADER_CURL_UINT_BSET_H */
|