20#if !(defined(UINT_T) && defined(UINT_C) && defined(UINT_FMT_S) && defined(DECORATE_NAME))
21#ifdef __INTELLISENSE__
22#define UINT_T uint32_t
23#define UINT_C UINT32_C
24#define UINT_FMT_S PRIu32
25#define DECORATE_NAME(Name) Name##_u32
27#error All of UINT_T, UINT_C, UINT_FMT_S, UINT_FMT_ARG, and DECORATE_NAME must be defined before #including this file
31#define BITS (sizeof(UINT_T) * CHAR_BIT)
37#define UINT_FMT_ARG(X) X
42#define UINT_LESSTHAN(A, B) ((A) < (B))
46#define MC_UINT_MAX ~(UINT_C(0))
51#define UINT_ADD(A, B) ((A) + (B))
54#define UINT_SUB(A, B) ((A) - (B))
59static inline UINT_T
DECORATE_NAME(_mc_default_lshift)(UINT_T lhs,
int off) {
67#define UINT_LSHIFT DECORATE_NAME(_mc_default_lshift)
71#define UINT_BITOR(A, B) ((A) | (B))
74static inline int DECORATE_NAME(_mc_compare)(UINT_T lhs, UINT_T rhs) {
75 if (UINT_LESSTHAN(lhs, rhs)) {
77 }
else if (UINT_LESSTHAN(rhs, lhs)) {
84#define UINT_COMPARE DECORATE_NAME(_mc_compare)
102 mc_optional_int32_t opt_trimFactor,
105 BSON_ASSERT_PARAM(status);
107 if (UINT_COMPARE(rangeMin, rangeMax) > 0) {
108 CLIENT_ERR(
"Range min (%" UINT_FMT_S
") must be less than or equal to range max (%" UINT_FMT_S
109 ") for range search",
110 UINT_FMT_ARG(rangeMin),
111 UINT_FMT_ARG(rangeMax));
114 if (UINT_COMPARE(rangeMax, max) > 0) {
115 CLIENT_ERR(
"Range max (%" UINT_FMT_S
") must be less than or equal to max (%" UINT_FMT_S
") for range search",
116 UINT_FMT_ARG(rangeMax),
122 CLIENT_ERR(
"Sparsity must be > 0");
125 size_t maxlen = (size_t)BITS -
DECORATE_NAME(mc_count_leading_zeros)(max);
126 int32_t trimFactor = trimFactorDefault(maxlen, opt_trimFactor, use_range_v2);
127 if (trimFactor != 0 && mc_cmp_greater_equal_su(trimFactor, maxlen)) {
128 CLIENT_ERR(
"Trim factor must be less than the number of bits (%ld) used to represent an element of the domain, "
134 if (trimFactor < 0) {
135 CLIENT_ERR(
"Trim factor must be >= 0, but got (%" PRId32
")", trimFactor);
139 mcg->_rangeMin = rangeMin;
140 mcg->_rangeMax = rangeMax;
141 mcg->_maxlen = (size_t)BITS -
DECORATE_NAME(mc_count_leading_zeros)(max);
142 mcg->_sparsity = sparsity;
143 mcg->_trimFactor = trimFactor;
153static inline UINT_T
DECORATE_NAME(applyMask)(UINT_T value,
size_t maskedBits) {
154 const UINT_T ones = MC_UINT_MAX;
156 BSON_ASSERT(maskedBits <= (
size_t)BITS);
157 BSON_ASSERT(maskedBits >= 0);
159 if (maskedBits == 0) {
163 const size_t shift = ((size_t)BITS - maskedBits);
164 const UINT_T mask = UINT_LSHIFT(ones, -(
int)shift);
165 return UINT_BITOR(value, mask);
170 BSON_ASSERT_PARAM(mcg);
171 size_t level = mcg->_maxlen - maskedBits;
172 BSON_ASSERT(mc_in_range_size_t_signed(mcg->_trimFactor));
173 size_t trimFactor_sz = (size_t)mcg->_trimFactor;
174 return 0 == maskedBits || (level >= trimFactor_sz && 0 == (level % mcg->_sparsity));
179 BSON_ASSERT_PARAM(mcg);
180 BSON_ASSERT(maskedBits <= mcg->_maxlen);
181 BSON_ASSERT(maskedBits <= (
size_t)BITS);
182 BSON_ASSERT(maskedBits >= 0);
184 if (maskedBits == mcg->_maxlen) {
185 return bson_strdup(
"root");
188 UINT_T shifted = UINT_LSHIFT(start, -(
int)maskedBits);
189 mc_bitstring valueBin =
DECORATE_NAME(mc_convert_to_bitstring)(shifted);
190 char *ret = bson_strndup(valueBin.str + ((
size_t)BITS - mcg->_maxlen + maskedBits), mcg->_maxlen + maskedBits);
198 BSON_ASSERT_PARAM(mcg);
199 BSON_ASSERT_PARAM(c);
200 const UINT_T blockEnd =
DECORATE_NAME(applyMask)(blockStart, maskedBits);
202 if (UINT_COMPARE(blockEnd, mcg->_rangeMin) < 0 || UINT_COMPARE(blockStart, mcg->_rangeMax) > 0) {
206 if (UINT_COMPARE(blockStart, mcg->_rangeMin) >= 0 && UINT_COMPARE(blockEnd, mcg->_rangeMax) <= 0
207 &&
DECORATE_NAME(MinCoverGenerator_isLevelStored)(mcg, maskedBits)) {
208 char *edge =
DECORATE_NAME(MinCoverGenerator_toString)(mcg, blockStart, maskedBits);
209 _mc_array_append_val(c, edge);
213 BSON_ASSERT(maskedBits > 0);
215 const size_t newBits = maskedBits - 1u;
216 DECORATE_NAME(MinCoverGenerator_minCoverRec)(mcg, c, blockStart, newBits);
218 (mcg, c, UINT_BITOR(blockStart, UINT_LSHIFT(UINT_C(1), (
int)newBits)), newBits);
222 BSON_ASSERT_PARAM(mcg);
223 mc_mincover_t *mc = mc_mincover_new();
225 (mcg, &mc->mincover, ZERO, mcg->_maxlen);
230 BSON_ASSERT_PARAM(mcg);
231 return mcg->_trimFactor;
239 bool includeLowerBound,
242 bool includeUpperBound,
245 BSON_ASSERT_PARAM(lowerBound);
246 BSON_ASSERT_PARAM(upperBound);
248 if (!includeLowerBound) {
249 if (UINT_COMPARE(*lowerBound, max) >= 0) {
250 CLIENT_ERR(
"Lower bound (%" UINT_FMT_S
") must be less than the range maximum (%" UINT_FMT_S
251 ") if lower bound is excluded from range.",
252 UINT_FMT_ARG(*lowerBound),
256 *lowerBound = UINT_ADD(*lowerBound, UINT_C(1));
258 if (!includeUpperBound) {
259 if (UINT_COMPARE(*upperBound, min) <= 0) {
260 CLIENT_ERR(
"Upper bound (%" UINT_FMT_S
") must be greater than the range minimum (%" UINT_FMT_S
261 ") if upper bound is excluded from range.",
262 UINT_FMT_ARG(*upperBound),
266 *upperBound = UINT_SUB(*upperBound, UINT_C(1));
struct _mongocrypt_status_t mongocrypt_status_t
Definition mongocrypt.h:152
Definition mc-range-mincover-generator.template.h:88