LLVMFuzzerTestOneInput: 181| 15.0k|{ 182| 15.0k| const std::string_view input{reinterpret_cast(Data), Size}; 183| | 184| | // Raw bytes: header validation, length arithmetic, and the query/body views it hands out. 185| 15.0k| { 186| 15.0k| const auto buf = exact_buffer(input); 187| 15.0k| drive({buf.data(), buf.size()}); 188| 15.0k| drive_plugin({buf.data(), buf.size()}); 189| 15.0k| } 190| | 191| 15.0k| if (Size < 2) { ------------------ | Branch (191:8): [True: 2, False: 15.0k] ------------------ 192| 2| return 0; 193| 2| } 194| | 195| | // Wrapped: the first byte picks the framing, the second says how much of the rest is the query. 196| | // The query is what the dispatch walks and the body is what the reader parses, so splitting the 197| | // input between them lets a single corpus entry drive both. 198| 15.0k| const uint8_t flags = Data[0]; 199| 15.0k| const std::string_view rest = input.substr(2); 200| 15.0k| const size_t query_size = rest.empty() ? 0 : size_t(Data[1]) % (rest.size() + 1); ------------------ | Branch (200:30): [True: 4, False: 15.0k] ------------------ 201| 15.0k| const std::string_view query = rest.substr(0, query_size); 202| 15.0k| const std::string_view body = rest.substr(query_size); 203| | 204| 15.0k| { 205| 15.0k| const auto framed = framed_message(query, body, flags); 206| 15.0k| const auto buf = exact_buffer(framed); 207| 15.0k| drive({buf.data(), buf.size()}); 208| 15.0k| } 209| | 210| | // The same body against a fixed query that is known to resolve, so the body reader is reached 211| | // even when the fuzzer has not yet learned what a valid JSON pointer looks like. 212| | // "" is the root endpoint, which reads the whole registered object in one document -- every 213| | // nested struct, container, optional and variant at once, and the deepest reader nesting on 214| | // offer. It is the widest single target here, so it must not be left out of the list. 215| 15.0k| for (std::string_view known : {"", "/value", "/name", "/position", "/position/x", "/inner", "/inner/label", ------------------ | Branch (215:32): [True: 315k, False: 15.0k] ------------------ 216| 15.0k| "/series", "/table", "/maybe", "/measure", "/doubled", "/greet", "/midpoint", 217| 315k| "/total", "/reset", "/counter", "/scale", "/bump", "/shift", "/tag"}) { 218| 315k| const auto framed = framed_message(known, body, flags); 219| 315k| const auto buf = exact_buffer(framed); 220| 315k| drive({buf.data(), buf.size()}); 221| 315k| } 222| | 223| 15.0k| return 0; 224| 15.0k|} repe_registry.cpp:_ZN12_GLOBAL__N_112exact_bufferENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 113| 552k| { 114| 552k| std::vector buf(bytes.size()); 115| 552k| if (!bytes.empty()) { ------------------ | Branch (115:11): [True: 552k, False: 0] ------------------ 116| 552k| std::memcpy(buf.data(), bytes.data(), bytes.size()); 117| 552k| } 118| 552k| return buf; 119| 552k| } repe_registry.cpp:_ZN12_GLOBAL__N_15driveENSt3__14spanIKcLm18446744073709551615EEE: 146| 345k| { 147| 345k| glz::registry<> registry; 148| 345k| fuzz_api api{}; 149| 345k| repe_fuzz::member_api members{}; 150| | // members first, so the last registration -- and therefore the root endpoint -- is the wider 151| | // of the two objects. Root reads the whole object in one document, so it should be the one 152| | // with the nested struct, containers, optional and variant in it. 153| 345k| registry.on(members); 154| 345k| registry.on(api); 155| | 156| 345k| std::string response; 157| 345k| registry.call(request, response); 158| 345k| if (!response.empty()) { ------------------ | Branch (158:11): [True: 207k, False: 138k] ------------------ 159| | // The response is a message in its own right, so parsing it back exercises the header 160| | // reader on bytes the registry itself produced. Copy it out at exactly its own size first: 161| | // a std::string keeps an implicit '\0' at data()[size()] and allocator slack behind it, 162| | // which is the very thing this target exists to not have. 163| 207k| const auto buf = exact_buffer(response); 164| 207k| [[maybe_unused]] auto parsed = glz::repe::parse_request({buf.data(), buf.size()}); 165| 207k| } 166| 345k| } _ZNK9repe_fuzz8fuzz_api7doubledMUliE_clEi: 67| 375| std::function doubled = [](int32_t v) { return int32_t(uint32_t(v) * 2u); }; _ZNK9repe_fuzz8fuzz_api5greetMUlRKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE_clESA_: 68| 529| std::function greet = [](const std::string& who) { return "hi " + who; }; _ZNK9repe_fuzz8fuzz_api8midpointMUlRKNS_5pointEE_clES4_: 69| 67| std::function midpoint = [](const point& p) -> point { return {p.x / 2, p.y / 2}; }; _ZNK9repe_fuzz8fuzz_api5totalMUlRNSt3__16vectorIdNS2_9allocatorIdEEEEE_clES7_: 70| 511| std::function&)> total = [](std::vector& v) { 71| 511| double sum{}; 72| 903| for (auto d : v) sum += d; ------------------ | Branch (72:22): [True: 903, False: 511] ------------------ 73| 511| return sum; 74| 511| }; _ZNK9repe_fuzz8fuzz_api5resetMUlvE_clEv: 75| 14.8k| std::function reset = [] {}; _ZN9repe_fuzz10member_api5scaleEi: 90| 495| { 91| 495| counter = int32_t(uint32_t(counter) + uint32_t(v)); 92| 495| return int32_t(uint32_t(v) * 3u); 93| 495| } _ZN9repe_fuzz10member_api4bumpEv: 94| 14.8k| void bump() { counter = int32_t(uint32_t(counter) + 1u); } _ZN9repe_fuzz10member_api5shiftERKNS_5pointE: 95| 190| point shift(const point& p) { return {p.x + 1, p.y + 1}; } _ZN9repe_fuzz10member_api3tagERKNS_6nestedE: 96| 428| std::string tag(const nested& n) { return n.label; } repe_registry.cpp:_ZN12_GLOBAL__N_112drive_pluginENSt3__14spanIKcLm18446744073709551615EEE: 172| 15.0k| { 173| 15.0k| glz::registry<> registry; 174| 15.0k| fuzz_api api{}; 175| 15.0k| registry.on(api); 176| 15.0k| [[maybe_unused]] auto out = glz::repe::plugin_call(registry, request.data(), request.size()); 177| 15.0k| } repe_registry.cpp:_ZN12_GLOBAL__N_114framed_messageENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEES4_h: 122| 330k| { 123| 330k| glz::repe::header hdr{}; 124| 330k| hdr.spec = glz::repe::repe_magic; 125| 330k| hdr.version = 1; 126| 330k| hdr.id = 1; 127| 330k| hdr.notify = (flags & 0x1) ? 1 : 0; ------------------ | Branch (127:20): [True: 138k, False: 192k] ------------------ 128| 330k| hdr.query_length = query.size(); 129| 330k| hdr.body_length = body.size(); 130| 330k| hdr.length = sizeof(glz::repe::header) + query.size() + body.size(); 131| 330k| hdr.query_format = glz::repe::query_format::JSON_POINTER; 132| 330k| hdr.body_format = glz::repe::body_format::JSON; 133| | // The registry echoes a request that already carries an error back to the sender without 134| | // dispatching it. Nothing else in this target sets ec, so without this that branch is dead. 135| 330k| hdr.ec = (flags & 0x2) ? glz::error_code::invalid_query : glz::error_code::none; ------------------ | Branch (135:16): [True: 2.72k, False: 327k] ------------------ 136| | 137| 330k| std::string msg; 138| 330k| msg.resize(hdr.length); 139| 330k| std::memcpy(msg.data(), &hdr, sizeof(hdr)); 140| 330k| std::memcpy(msg.data() + sizeof(hdr), query.data(), query.size()); 141| 330k| std::memcpy(msg.data() + sizeof(hdr) + query.size(), body.data(), body.size()); 142| 330k| return msg; 143| 330k| } _ZN3glz11empty_rangeITkNS_5rangeERNSt3__16vectorIiNS1_9allocatorIiEEEEEEbOT_: 304| 150| { 305| 150|#ifdef __cpp_lib_ranges 306| 150| return std::ranges::empty(rng); 307| |#else 308| | // in lieu of std::ranges::empty 309| | if constexpr (requires() { 310| | { rng.empty() } -> std::convertible_to; 311| | }) { 312| | return rng.empty(); 313| | } 314| | else if constexpr (requires() { 315| | { rng.size() } -> std::same_as; 316| | }) { 317| | return rng.size() == std::size_t{0}; 318| | } 319| | else { 320| | return std::cbegin(rng) == std::cend(rng); 321| | } 322| |#endif 323| 150| } _ZN3glz11empty_rangeITkNS_5rangeERNSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEEEbOT_: 304| 150| { 305| 150|#ifdef __cpp_lib_ranges 306| 150| return std::ranges::empty(rng); 307| |#else 308| | // in lieu of std::ranges::empty 309| | if constexpr (requires() { 310| | { rng.empty() } -> std::convertible_to; 311| | }) { 312| | return rng.empty(); 313| | } 314| | else if constexpr (requires() { 315| | { rng.size() } -> std::same_as; 316| | }) { 317| | return rng.size() == std::size_t{0}; 318| | } 319| | else { 320| | return std::cbegin(rng) == std::cend(rng); 321| | } 322| |#endif 323| 150| } _ZN3glz11grow_bufferINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEvRT_m: 143| 391| { 144| 391| using traits = buffer_traits>; 145| 391| if constexpr (requires { traits::grow(b, required); }) { 146| 391| traits::grow(b, required); 147| | } 148| | else { 149| | // A user specialization written before `grow` existed: keep the growth it used to get. 150| | resize_unfilled(b, 2 * required); 151| | } 152| 391| } _ZN3glz13buffer_traitsINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE4growERS7_mQL_ZNS_13buffer_traits12is_resizableEE: 118| 391| { 119| 391| resize_unfilled(b, 2 * required); 120| 391| } _ZN3glz15resize_unfilledINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEvRT_m: 63| 95.9k| { 64| 95.9k| if constexpr (requires { b.resize_and_overwrite(n, [](auto*, size_t written) { return written; }); }) { 65| 95.9k| b.resize_and_overwrite(n, [](auto*, size_t written) noexcept { return written; }); 66| | } 67| | else { 68| | b.resize(n); 69| | } 70| 95.9k| } _ZZN3glz15resize_unfilledINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEvRT_mENKUlPS8_mE_clIcEEDaSA_m: 65| 95.9k| b.resize_and_overwrite(n, [](auto*, size_t written) noexcept { return written; }); _ZN3glz12ensure_spaceINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEETkNS_10is_contextENS_7contextEEEbRT0_RT_m: 265| 27.1k| { 266| 27.1k| using Buffer = std::remove_cvref_t; 267| | 268| 27.1k| if constexpr (vector_like) { 269| 27.1k| if (required > b.size()) [[unlikely]] { ------------------ | Branch (269:14): [True: 391, False: 26.7k] ------------------ 270| 391| grow_buffer(b, required); 271| 391| } 272| 27.1k| return true; 273| | } 274| | else if constexpr (has_bounded_capacity) { 275| | if (required > buffer_traits::capacity(b)) [[unlikely]] { 276| | ctx.error = error_code::buffer_overflow; 277| | return false; 278| | } 279| | return true; 280| | } 281| | else { 282| | return true; // Raw pointer or other - trust caller 283| | } 284| 27.1k| } _ZN3glz13buffer_traitsINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE8finalizeERS7_m: 124| 24.9k| { 125| 24.9k| if constexpr (is_resizable) { 126| 24.9k| b.resize(written); 127| 24.9k| } 128| | // For fixed buffers: no-op, count is returned in result 129| 24.9k| } _ZN3glz20inert_key_bits_scopeC2IRNS_7contextEEEOT_Pv: 192| 86.6k| constexpr inert_key_bits_scope(auto&&, void*) noexcept {} _ZN3glz10get_memberIRN9repe_fuzz10member_apiERKMS2_iEEDcOT_OT0_: 677| 345k| { 678| 345k| using V = std::decay_t; 679| 345k| if constexpr (std::is_member_object_pointer_v) { 680| 345k| return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| | else { 700| | return element; 701| | } 702| 345k| } _ZN3glz10get_memberIRN9repe_fuzz10member_apiERKMS2_FiiEEEDcOT_OT0_: 677| 345k| { 678| 345k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| 345k| else if constexpr (std::is_member_function_pointer_v) { 683| 345k| return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| | else { 700| | return element; 701| | } 702| 345k| } _ZN3glz10get_memberIRN9repe_fuzz10member_apiERKMS2_FvvEEEDcOT_OT0_: 677| 345k| { 678| 345k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| 345k| else if constexpr (std::is_member_function_pointer_v) { 683| 345k| return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| | else { 700| | return element; 701| | } 702| 345k| } _ZN3glz10get_memberIRN9repe_fuzz10member_apiERKMS2_FNS1_5pointERKS4_EEEDcOT_OT0_: 677| 345k| { 678| 345k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| 345k| else if constexpr (std::is_member_function_pointer_v) { 683| 345k| return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| | else { 700| | return element; 701| | } 702| 345k| } _ZN3glz10get_memberIRN9repe_fuzz5pointERdEEDcOT_OT0_: 677| 758k| { 678| 758k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 758k| else { 700| 758k| return element; 701| 758k| } 702| 758k| } _ZN3glz10get_memberIRN9repe_fuzz10member_apiERKMS2_FNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERKNS1_6nestedEEEEDcOT_OT0_: 677| 345k| { 678| 345k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| 345k| else if constexpr (std::is_member_function_pointer_v) { 683| 345k| return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| | else { 700| | return element; 701| | } 702| 345k| } _ZN3glz10get_memberIRN9repe_fuzz6nestedERiEEDcOT_OT0_: 677| 360k| { 678| 360k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 360k| else { 700| 360k| return element; 701| 360k| } 702| 360k| } _ZN3glz10get_memberIRN9repe_fuzz6nestedERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEDcOT_OT0_: 677| 375k| { 678| 375k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 375k| else { 700| 375k| return element; 701| 375k| } 702| 375k| } _ZN3glz8str_viewINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERS7_EENS1_17basic_string_viewIcS4_EEOT0_: 341| 1.25k| { 342| | if constexpr (std::same_as, std::string_view>) { 343| | return value; // already the answer; rebuilding it from data() and size() costs instructions 344| | } 345| | else if constexpr (!char_array_t && std::is_pointer_v>) { 346| | return value ? std::string_view{value} : std::string_view{}; 347| | } 348| 1.25k| else if constexpr (has_data && has_size) { 349| 1.25k| return std::string_view{value.data(), value.size()}; 350| | } 351| | else { 352| | return std::string_view{value}; 353| | } 354| 1.25k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERiEEDcOT_OT0_: 677| 382k| { 678| 382k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 382k| else { 700| 382k| return element; 701| 382k| } 702| 382k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEDcOT_OT0_: 677| 360k| { 678| 360k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 360k| else { 700| 360k| return element; 701| 360k| } 702| 360k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNS1_5pointEEEDcOT_OT0_: 677| 361k| { 678| 361k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 361k| else { 700| 361k| return element; 701| 361k| } 702| 361k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNS1_6nestedEEEDcOT_OT0_: 677| 361k| { 678| 361k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 361k| else { 700| 361k| return element; 701| 361k| } 702| 361k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__16vectorIiNS4_9allocatorIiEEEEEEDcOT_OT0_: 677| 368k| { 678| 368k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 368k| else { 700| 368k| return element; 701| 368k| } 702| 368k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__13mapINS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEiNS4_4lessISB_EENS9_INS4_4pairIKSB_iEEEEEEEEDcOT_OT0_: 677| 362k| { 678| 362k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 362k| else { 700| 362k| return element; 701| 362k| } 702| 362k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__18optionalIdEEEEDcOT_OT0_: 677| 362k| { 678| 362k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 362k| else { 700| 362k| return element; 701| 362k| } 702| 362k| } _ZN3glz10get_memberIRN9repe_fuzz6amountERdEEDcOT_OT0_: 677| 11.0k| { 678| 11.0k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 11.0k| else { 700| 11.0k| return element; 701| 11.0k| } 702| 11.0k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__17variantIJNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS1_6amountEEEEEEDcOT_OT0_: 677| 365k| { 678| 365k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 365k| else { 700| 365k| return element; 701| 365k| } 702| 365k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__18functionIFiiEEEEEDcOT_OT0_: 677| 360k| { 678| 360k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 360k| else { 700| 360k| return element; 701| 360k| } 702| 360k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__18functionIFNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERKSB_EEEEEDcOT_OT0_: 677| 360k| { 678| 360k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 360k| else { 700| 360k| return element; 701| 360k| } 702| 360k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__18functionIFNS1_5pointERKS6_EEEEEDcOT_OT0_: 677| 361k| { 678| 361k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 361k| else { 700| 361k| return element; 701| 361k| } 702| 361k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__18functionIFdRNS4_6vectorIdNS4_9allocatorIdEEEEEEEEEDcOT_OT0_: 677| 361k| { 678| 361k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 361k| else { 700| 361k| return element; 701| 361k| } 702| 361k| } _ZN3glz10get_memberIRN9repe_fuzz8fuzz_apiERNSt3__18functionIFvvEEEEEDcOT_OT0_: 677| 360k| { 678| 360k| using V = std::decay_t; 679| | if constexpr (std::is_member_object_pointer_v) { 680| | return value.*element; 681| | } 682| | else if constexpr (std::is_member_function_pointer_v) { 683| | return element; 684| | } 685| | else if constexpr (std::invocable && not eigen_t) { 686| | // Eigen places a static_assert inside of the operator()(), so we must target 687| | // matrix types and reject them from the invocable check 688| | // Eigen ought to put the check in the `enable_if` for operator()() 689| | return std::invoke(std::forward(element), std::forward(value)); 690| | } 691| | else if constexpr (std::is_pointer_v && !std::is_reference_v) { 692| | if constexpr (std::invocable) { 693| | return std::invoke(*element, std::forward(value)); 694| | } 695| | else { 696| | return *element; 697| | } 698| | } 699| 360k| else { 700| 360k| return element; 701| 360k| } 702| 360k| } _ZN3glz11enter_depthITkNS_10is_contextENS_7contextEEEbRT_: 344| 99.2k| { 345| 99.2k| if (ctx.depth >= max_recursive_depth_limit) [[unlikely]] { ------------------ | Branch (345:11): [True: 0, False: 99.2k] ------------------ 346| 0| ctx.error = error_code::exceeded_max_recursive_depth; 347| 0| return true; 348| 0| } 349| 99.2k| ++ctx.depth; 350| 99.2k| return false; 351| 99.2k| } _ZN3glz10call_scopeINS_7contextEEC2ERS1_: 272| 24.9k| explicit call_scope(Ctx& c) noexcept : ctx(c), depth(c.depth) 273| 24.9k| { 274| 24.9k| ctx.error = error_code::none; 275| 24.9k| ctx.custom_error_message = {}; 276| 24.9k| } _ZN3glz10call_scopeINS_7contextEED2Ev: 277| 24.9k| ~call_scope() { ctx.depth = depth; } _ZNK3glz9error_ctxcvbEv: 148| 24.9k| operator bool() const noexcept { return ec != error_code::none; } _ZN3glz18charge_speculationITkNS_10is_contextENS_7contextEEEbRT_m: 311| 719| { 312| 719| if constexpr (requires { ctx.speculation_budget; }) { 313| 719| if (ctx.speculation_budget == 0) { ------------------ | Branch (313:14): [True: 719, False: 0] ------------------ 314| 719| return true; 315| 719| } 316| 0| ctx.speculation_budget = consumed >= ctx.speculation_budget ? 1 : ctx.speculation_budget - consumed; ------------------ | Branch (316:35): [True: 0, False: 0] ------------------ 317| 0| return ctx.speculation_budget > 1; 318| | } 319| | else { 320| | return true; 321| | } 322| 719| } _ZN3glz21speculation_exhaustedITkNS_10is_contextENS_7contextEEEbRT_: 328| 91| { 329| 91| if constexpr (requires { ctx.speculation_budget; }) { 330| 91| return ctx.speculation_budget == 1; // the latched floor; 0 means unbudgeted 331| | } 332| | else { 333| | return false; 334| | } 335| 91| } _ZN3glz23finalize_top_level_readITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETkNS_10is_contextERNS_7contextEEEvOT0_PKcS7_S7_: 131| 293k| { 132| 293k| if constexpr (Opts.format == JSON && !check_null_terminated(Opts)) { 133| | // Deliberately not [[unlikely]]: a body that ends with the buffer lands here on every 134| | // successful read, which is the ordinary case for a registry parsing a wire span. 135| | // start < it, not !=, because a streaming origin can be empty or overshoot on an error 136| | // path; neither is an absent value. 137| 293k| if (ctx.error == error_code::end_reached && ctx.depth == 0 && it == end && start < it) { ------------------ | Branch (137:14): [True: 13.0k, False: 280k] | Branch (137:54): [True: 5.75k, False: 7.27k] | Branch (137:72): [True: 5.75k, False: 0] | Branch (137:85): [True: 5.75k, False: 0] ------------------ 138| 5.75k| context ws_ctx{}; // only written to when skip_ws parses a comment; the result is unused 139| 5.75k| const char* consumed = start; 140| 5.75k| skip_ws(ws_ctx, consumed, it); 141| 5.75k| if (consumed == it) { ------------------ | Branch (141:17): [True: 780, False: 4.97k] ------------------ 142| 780| ctx.error = error_code::no_read_input; 143| 780| } 144| 5.75k| } 145| 293k| } 146| 293k| finalize_read_context(ctx); 147| 293k| } _ZN3glz21finalize_read_contextITkNS_10is_contextERNS_7contextEEEvOT_: 109| 293k| { 110| 293k| settle_partial_read_complete(ctx); 111| 293k| settle_end_reached(ctx); 112| 293k| } _ZN3glz28settle_partial_read_completeITkNS_10is_contextERNS_7contextEEEvOT_: 102| 293k| { 103| 293k| if (ctx.error == error_code::partial_read_complete) { ------------------ | Branch (103:11): [True: 0, False: 293k] ------------------ 104| 0| ctx.error = error_code::none; 105| 0| } 106| 293k| } _ZN3glz18settle_end_reachedITkNS_10is_contextERNS_7contextEEEvOT_: 88| 293k| { 89| 293k| if (ctx.error == error_code::end_reached) { ------------------ | Branch (89:11): [True: 12.2k, False: 281k] ------------------ 90| 12.2k| ctx.error = (ctx.depth == 0) ? error_code::none : error_code::unexpected_end; ------------------ | Branch (90:22): [True: 4.97k, False: 7.27k] ------------------ 91| 12.2k| } 92| 293k| } _ZN3glz12format_errorINSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEERKNS_9error_ctxERKT_: 3431| 165k| { 3432| 165k| const auto error_type_str = meta::keys[uint32_t(pe.ec)]; 3433| | 3434| 165k| const auto info = detail::get_source_info(buffer, pe.count); 3435| 165k| auto error_str = detail::generate_error_string(error_type_str, info); 3436| 165k| if (pe.custom_error_message.size()) { ------------------ | Branch (3436:11): [True: 0, False: 165k] ------------------ 3437| 0| error_str.append(" "); 3438| 0| error_str.append(pe.custom_error_message.begin(), pe.custom_error_message.end()); 3439| 0| } 3440| 165k| return error_str; 3441| 165k| } _ZN3glz11decode_hashILj10EN9repe_fuzz5pointEXtlNS_11hash_info_tIS2_Lm256EEELNS_9hash_typeE1EtlNSt3__15arrayIhLm256EEEtlA256_hLh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh0ELh1ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2EEELm1ELm1EEELS5_1EE2opIRPKcSD_EEmOT_T0_: 2584| 61.4k| { 2585| | if constexpr (HashInfo.sized_hash) { 2586| | const auto* c = quote_memchr(it, end); 2587| | if (c) [[likely]] { 2588| | const auto n = size_t(static_cast>(c) - it); 2589| | if (n == 0 || n > HashInfo.max_length || HashInfo.unique_index >= size_t(end - it)) [[unlikely]] { 2590| | return N; // error 2591| | } 2592| | 2593| | const auto h = bitmix(uint16_t(it[HashInfo.unique_index]) | (uint16_t(n) << 8), HashInfo.seed); 2594| | return HashInfo.table[h % bsize]; 2595| | } 2596| | else [[unlikely]] { 2597| | return N; 2598| | } 2599| | } 2600| 61.4k| else { 2601| 61.4k| if constexpr (N == 2) { 2602| | if constexpr (uindex > 0) { 2603| | if (size_t(end - it) <= uindex) [[unlikely]] { 2604| | return N; // error 2605| | } 2606| | } 2607| | // Avoids using a hash table 2608| 61.4k| constexpr auto first_key_char = reflect::keys[0][uindex]; 2609| 61.4k| return size_t(bool(it[uindex] ^ first_key_char)); 2610| | } 2611| | else { 2612| | if constexpr (uindex > 0) { 2613| | if (size_t(end - it) <= uindex) [[unlikely]] { 2614| | return N; // error 2615| | } 2616| | } 2617| | return HashInfo.table[uint8_t(it[uindex])]; 2618| | } 2619| 61.4k| } 2620| 61.4k| } _ZN3glz11decode_hashILj10EN9repe_fuzz6nestedEXtlNS_11hash_info_tIS2_Lm256EEELNS_9hash_typeE1EtlNSt3__15arrayIhLm256EEEtlA256_hLh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh0ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh1ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2ELh2EEELm5ELm5EEELS5_1EE2opIRPKcSD_EEmOT_T0_: 2584| 31.7k| { 2585| | if constexpr (HashInfo.sized_hash) { 2586| | const auto* c = quote_memchr(it, end); 2587| | if (c) [[likely]] { 2588| | const auto n = size_t(static_cast>(c) - it); 2589| | if (n == 0 || n > HashInfo.max_length || HashInfo.unique_index >= size_t(end - it)) [[unlikely]] { 2590| | return N; // error 2591| | } 2592| | 2593| | const auto h = bitmix(uint16_t(it[HashInfo.unique_index]) | (uint16_t(n) << 8), HashInfo.seed); 2594| | return HashInfo.table[h % bsize]; 2595| | } 2596| | else [[unlikely]] { 2597| | return N; 2598| | } 2599| | } 2600| 31.7k| else { 2601| 31.7k| if constexpr (N == 2) { 2602| | if constexpr (uindex > 0) { 2603| | if (size_t(end - it) <= uindex) [[unlikely]] { 2604| | return N; // error 2605| | } 2606| | } 2607| | // Avoids using a hash table 2608| 31.7k| constexpr auto first_key_char = reflect::keys[0][uindex]; 2609| 31.7k| return size_t(bool(it[uindex] ^ first_key_char)); 2610| | } 2611| | else { 2612| | if constexpr (uindex > 0) { 2613| | if (size_t(end - it) <= uindex) [[unlikely]] { 2614| | return N; // error 2615| | } 2616| | } 2617| | return HashInfo.table[uint8_t(it[uindex])]; 2618| | } 2619| 31.7k| } 2620| 31.7k| } _ZN3glz11decode_hashILj10EN9repe_fuzz8fuzz_apiEXtlNS_11hash_info_tIS2_Lm128EEELNS_9hash_typeE2EtlNSt3__15arrayIhLm128EEEtlA128_hLh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh11ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh6ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh9ELh13ELh13ELh13ELh13ELh13ELh12ELh13ELh13ELh13ELh13ELh0ELh13ELh13ELh13ELh13ELh13ELh13ELh5ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh4ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh1ELh13ELh10ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh2ELh3ELh13ELh13ELh13ELh13ELh13ELh13ELh8ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh13ELh7ELh13ELh13ELh13ELh13ELh13ELh13ELh13EEELm4ELm8ELm15149911783463666029ELm18446744073709551615ELb0ELm2EEELS5_2EE2opIRPKcSD_EEmOT_T0_: 2649| 48.5k| { 2650| 48.5k| if constexpr (HashInfo.front_hash_bytes == 2) { 2651| 48.5k| if (size_t(end - it) <= 2) [[unlikely]] { ------------------ | Branch (2651:17): [True: 128, False: 48.3k] ------------------ 2652| 128| return N; // error 2653| 128| } 2654| 48.3k| uint16_t h; 2655| | if consteval { 2656| | h = 0; 2657| | for (size_t i = 0; i < 2; ++i) { 2658| | h |= static_cast(static_cast(it[i])) << (8 * i); 2659| | } 2660| | } 2661| 48.3k| else { 2662| 48.3k| std::memcpy(&h, it, 2); 2663| | if constexpr (std::endian::native == std::endian::big) { 2664| | h = std::byteswap(h); 2665| | } 2666| 48.3k| } 2667| 48.3k| return HashInfo.table[bitmix(h, HashInfo.seed) % bsize]; 2668| | } 2669| | else if constexpr (HashInfo.front_hash_bytes == 4) { 2670| | if (size_t(end - it) <= 4) [[unlikely]] { 2671| | return N; 2672| | } 2673| | uint32_t h; 2674| | if consteval { 2675| | h = 0; 2676| | for (size_t i = 0; i < 4; ++i) { 2677| | h |= static_cast(static_cast(it[i])) << (8 * i); 2678| | } 2679| | } 2680| | else { 2681| | std::memcpy(&h, it, 4); 2682| | if constexpr (std::endian::native == std::endian::big) { 2683| | h = std::byteswap(h); 2684| | } 2685| | } 2686| | return HashInfo.table[bitmix(h, HashInfo.seed) % bsize]; 2687| | } 2688| | else if constexpr (HashInfo.front_hash_bytes == 8) { 2689| | if (size_t(end - it) <= 8) [[unlikely]] { 2690| | return N; 2691| | } 2692| | uint64_t h; 2693| | if consteval { 2694| | h = 0; 2695| | for (size_t i = 0; i < 8; ++i) { 2696| | h |= static_cast(static_cast(it[i])) << (8 * i); 2697| | } 2698| | } 2699| | else { 2700| | std::memcpy(&h, it, 8); 2701| | if constexpr (std::endian::native == std::endian::big) { 2702| | h = std::byteswap(h); 2703| | } 2704| | } 2705| | return HashInfo.table[rich_bitmix(h, HashInfo.seed) % bsize]; 2706| | } 2707| | else { 2708| | static_assert(false_v, "invalid hash algorithm"); 2709| | } 2710| 48.5k| } _ZN3glz6bitmixEmm: 1570| 48.3k| { 1571| 48.3k| h *= seed; 1572| 48.3k| return h ^ std::rotr(h, 49); 1573| 48.3k| }; _ZN3glz3getILm0ETkNS_12tuple_detail9indexableERKNS_5tupleIJMN9repe_fuzz10member_apiEiMS4_FiiEMS4_FvvEMS4_FNS3_5pointERKSA_EMS4_FNSt3__112basic_stringIcNSF_11char_traitsIcEENSF_9allocatorIcEEEERKNS3_6nestedEEEEEEEDcOT0_: 116| 345k| { 117| 345k| using D = std::remove_cvref_t; 118| 345k| if constexpr (tuple_detail::is_tuple) { 119| 345k| static_assert(I < D::N, "glz::get index is out of range"); 120| 345k| using T = typename D::template type_at; 121| 345k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 345k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 345k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 345k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableERKNS_5tupleIJMN9repe_fuzz10member_apiEiMS4_FiiEMS4_FvvEMS4_FNS3_5pointERKSA_EMS4_FNSt3__112basic_stringIcNSF_11char_traitsIcEENSF_9allocatorIcEEEERKNS3_6nestedEEEEEEEDcOT0_: 116| 345k| { 117| 345k| using D = std::remove_cvref_t; 118| 345k| if constexpr (tuple_detail::is_tuple) { 119| 345k| static_assert(I < D::N, "glz::get index is out of range"); 120| 345k| using T = typename D::template type_at; 121| 345k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 345k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 345k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 345k| } _ZN3glz3getILm2ETkNS_12tuple_detail9indexableERKNS_5tupleIJMN9repe_fuzz10member_apiEiMS4_FiiEMS4_FvvEMS4_FNS3_5pointERKSA_EMS4_FNSt3__112basic_stringIcNSF_11char_traitsIcEENSF_9allocatorIcEEEERKNS3_6nestedEEEEEEEDcOT0_: 116| 345k| { 117| 345k| using D = std::remove_cvref_t; 118| 345k| if constexpr (tuple_detail::is_tuple) { 119| 345k| static_assert(I < D::N, "glz::get index is out of range"); 120| 345k| using T = typename D::template type_at; 121| 345k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 345k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 345k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 345k| } _ZN3glz3getILm3ETkNS_12tuple_detail9indexableERKNS_5tupleIJMN9repe_fuzz10member_apiEiMS4_FiiEMS4_FvvEMS4_FNS3_5pointERKSA_EMS4_FNSt3__112basic_stringIcNSF_11char_traitsIcEENSF_9allocatorIcEEEERKNS3_6nestedEEEEEEEDcOT0_: 116| 345k| { 117| 345k| using D = std::remove_cvref_t; 118| 345k| if constexpr (tuple_detail::is_tuple) { 119| 345k| static_assert(I < D::N, "glz::get index is out of range"); 120| 345k| using T = typename D::template type_at; 121| 345k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 345k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 345k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 345k| } _ZN3glz3getILm0ETkNS_12tuple_detail9indexableENS_5tupleIJRdS3_EEEEEDcOT0_: 116| 20.2k| { 117| 20.2k| using D = std::remove_cvref_t; 118| 20.2k| if constexpr (tuple_detail::is_tuple) { 119| 20.2k| static_assert(I < D::N, "glz::get index is out of range"); 120| 20.2k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 20.2k| else { 128| 20.2k| return static_cast(static_cast&>(tup).value); 129| 20.2k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 20.2k| } _ZN3glz3tieIJddEEENS_5tupleIJDpRT_EEES4_: 325| 397k| { 326| 397k| return {{{ts}...}}; 327| 397k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableENS_5tupleIJRdS3_EEEEEDcOT0_: 116| 16.7k| { 117| 16.7k| using D = std::remove_cvref_t; 118| 16.7k| if constexpr (tuple_detail::is_tuple) { 119| 16.7k| static_assert(I < D::N, "glz::get index is out of range"); 120| 16.7k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 16.7k| else { 128| 16.7k| return static_cast(static_cast&>(tup).value); 129| 16.7k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 16.7k| } _ZN3glz3getILm0ETkNS_12tuple_detail9indexableERNS_5tupleIJRdS3_EEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableERNS_5tupleIJRdS3_EEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm4ETkNS_12tuple_detail9indexableERKNS_5tupleIJMN9repe_fuzz10member_apiEiMS4_FiiEMS4_FvvEMS4_FNS3_5pointERKSA_EMS4_FNSt3__112basic_stringIcNSF_11char_traitsIcEENSF_9allocatorIcEEEERKNS3_6nestedEEEEEEEDcOT0_: 116| 345k| { 117| 345k| using D = std::remove_cvref_t; 118| 345k| if constexpr (tuple_detail::is_tuple) { 119| 345k| static_assert(I < D::N, "glz::get index is out of range"); 120| 345k| using T = typename D::template type_at; 121| 345k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 345k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 345k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 345k| } _ZN3glz3tieIJiNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEENS_5tupleIJDpRT_EEESB_: 325| 375k| { 326| 375k| return {{{ts}...}}; 327| 375k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEEEEDcOT0_: 116| 15.2k| { 117| 15.2k| using D = std::remove_cvref_t; 118| 15.2k| if constexpr (tuple_detail::is_tuple) { 119| 15.2k| static_assert(I < D::N, "glz::get index is out of range"); 120| 15.2k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 15.2k| else { 128| 15.2k| return static_cast(static_cast&>(tup).value); 129| 15.2k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 15.2k| } _ZN3glz3getILm0ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 21.8k| { 117| 21.8k| using D = std::remove_cvref_t; 118| 21.8k| if constexpr (tuple_detail::is_tuple) { 119| 21.8k| static_assert(I < D::N, "glz::get index is out of range"); 120| 21.8k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 21.8k| else { 128| 21.8k| return static_cast(static_cast&>(tup).value); 129| 21.8k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 21.8k| } _ZN3glz3tieIJiNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz5pointENS8_6nestedENS1_6vectorIiNS5_IiEEEENS1_3mapIS7_iNS1_4lessIS7_EENS5_INS1_4pairIKS7_iEEEEEENS1_8optionalIdEENS1_7variantIJS7_NS8_6amountEEEENS1_8functionIFiiEEENSR_IFS7_RSI_EEENSR_IFS9_RKS9_EEENSR_IFdRNSB_IdNS5_IdEEEEEEENSR_IFvvEEEEEENS_5tupleIJDpRT_EEES1B_: 325| 402k| { 326| 402k| return {{{ts}...}}; 327| 402k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 362| { 117| 362| using D = std::remove_cvref_t; 118| 362| if constexpr (tuple_detail::is_tuple) { 119| 362| static_assert(I < D::N, "glz::get index is out of range"); 120| 362| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 362| else { 128| 362| return static_cast(static_cast&>(tup).value); 129| 362| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 362| } _ZN3glz3getILm2ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 1.02k| { 117| 1.02k| using D = std::remove_cvref_t; 118| 1.02k| if constexpr (tuple_detail::is_tuple) { 119| 1.02k| static_assert(I < D::N, "glz::get index is out of range"); 120| 1.02k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 1.02k| else { 128| 1.02k| return static_cast(static_cast&>(tup).value); 129| 1.02k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 1.02k| } _ZN3glz3getILm3ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 1.10k| { 117| 1.10k| using D = std::remove_cvref_t; 118| 1.10k| if constexpr (tuple_detail::is_tuple) { 119| 1.10k| static_assert(I < D::N, "glz::get index is out of range"); 120| 1.10k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 1.10k| else { 128| 1.10k| return static_cast(static_cast&>(tup).value); 129| 1.10k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 1.10k| } _ZN3glz3getILm4ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 8.27k| { 117| 8.27k| using D = std::remove_cvref_t; 118| 8.27k| if constexpr (tuple_detail::is_tuple) { 119| 8.27k| static_assert(I < D::N, "glz::get index is out of range"); 120| 8.27k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 8.27k| else { 128| 8.27k| return static_cast(static_cast&>(tup).value); 129| 8.27k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 8.27k| } _ZN3glz3getILm5ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 1.71k| { 117| 1.71k| using D = std::remove_cvref_t; 118| 1.71k| if constexpr (tuple_detail::is_tuple) { 119| 1.71k| static_assert(I < D::N, "glz::get index is out of range"); 120| 1.71k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 1.71k| else { 128| 1.71k| return static_cast(static_cast&>(tup).value); 129| 1.71k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 1.71k| } _ZN3glz3getILm6ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 1.53k| { 117| 1.53k| using D = std::remove_cvref_t; 118| 1.53k| if constexpr (tuple_detail::is_tuple) { 119| 1.53k| static_assert(I < D::N, "glz::get index is out of range"); 120| 1.53k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 1.53k| else { 128| 1.53k| return static_cast(static_cast&>(tup).value); 129| 1.53k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 1.53k| } _ZN3glz3getILm0ETkNS_12tuple_detail9indexableENS_5tupleIJRdEEEEEDcOT0_: 116| 11.0k| { 117| 11.0k| using D = std::remove_cvref_t; 118| 11.0k| if constexpr (tuple_detail::is_tuple) { 119| 11.0k| static_assert(I < D::N, "glz::get index is out of range"); 120| 11.0k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 11.0k| else { 128| 11.0k| return static_cast(static_cast&>(tup).value); 129| 11.0k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 11.0k| } _ZN3glz3tieIJdEEENS_5tupleIJDpRT_EEES4_: 325| 11.0k| { 326| 11.0k| return {{{ts}...}}; 327| 11.0k| } _ZN3glz3getILm7ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 4.68k| { 117| 4.68k| using D = std::remove_cvref_t; 118| 4.68k| if constexpr (tuple_detail::is_tuple) { 119| 4.68k| static_assert(I < D::N, "glz::get index is out of range"); 120| 4.68k| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 4.68k| else { 128| 4.68k| return static_cast(static_cast&>(tup).value); 129| 4.68k| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 4.68k| } _ZN3glz3getILm8ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 198| { 117| 198| using D = std::remove_cvref_t; 118| 198| if constexpr (tuple_detail::is_tuple) { 119| 198| static_assert(I < D::N, "glz::get index is out of range"); 120| 198| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 198| else { 128| 198| return static_cast(static_cast&>(tup).value); 129| 198| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 198| } _ZN3glz3getILm9ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 283| { 117| 283| using D = std::remove_cvref_t; 118| 283| if constexpr (tuple_detail::is_tuple) { 119| 283| static_assert(I < D::N, "glz::get index is out of range"); 120| 283| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 283| else { 128| 283| return static_cast(static_cast&>(tup).value); 129| 283| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 283| } _ZN3glz3getILm10ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 464| { 117| 464| using D = std::remove_cvref_t; 118| 464| if constexpr (tuple_detail::is_tuple) { 119| 464| static_assert(I < D::N, "glz::get index is out of range"); 120| 464| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 464| else { 128| 464| return static_cast(static_cast&>(tup).value); 129| 464| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 464| } _ZN3glz3getILm11ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 451| { 117| 451| using D = std::remove_cvref_t; 118| 451| if constexpr (tuple_detail::is_tuple) { 119| 451| static_assert(I < D::N, "glz::get index is out of range"); 120| 451| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 451| else { 128| 451| return static_cast(static_cast&>(tup).value); 129| 451| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 451| } _ZN3glz3getILm12ETkNS_12tuple_detail9indexableENS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 247| { 117| 247| using D = std::remove_cvref_t; 118| 247| if constexpr (tuple_detail::is_tuple) { 119| 247| static_assert(I < D::N, "glz::get index is out of range"); 120| 247| using T = typename D::template type_at; 121| | if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| | using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| | return (static_cast(tup).value); 126| | } 127| 247| else { 128| 247| return static_cast(static_cast&>(tup).value); 129| 247| } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 247| } _ZN3glz3getILm0ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm2ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm0ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm1ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm3ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm4ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm5ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm6ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm7ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm8ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm9ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm10ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm11ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz3getILm12ETkNS_12tuple_detail9indexableERNS_5tupleIJRiRNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERN9repe_fuzz5pointERNSC_6nestedERNS4_6vectorIiNS8_IiEEEERNS4_3mapISA_iNS4_4lessISA_EENS8_INS4_4pairIKSA_iEEEEEERNS4_8optionalIdEERNS4_7variantIJSA_NSC_6amountEEEERNS4_8functionIFiiEEERNS11_IFSA_RSP_EEERNS11_IFSD_RKSD_EEERNS11_IFdRNSH_IdNS8_IdEEEEEEERNS11_IFvvEEEEEEEEDcOT0_: 116| 360k| { 117| 360k| using D = std::remove_cvref_t; 118| 360k| if constexpr (tuple_detail::is_tuple) { 119| 360k| static_assert(I < D::N, "glz::get index is out of range"); 120| 360k| using T = typename D::template type_at; 121| 360k| if constexpr (std::is_reference_v || std::is_const_v>) { 122| | // An lvalue, or a const tuple of either value category: element access carries the 123| | // constness of the tuple, except for elements that are themselves references. 124| 360k| using leaf = tuple_detail::match_const_t, tuple_detail::elem>; 125| 360k| return (static_cast(tup).value); 126| | } 127| | else { 128| | return static_cast(static_cast&>(tup).value); 129| | } 130| | } 131| | else { 132| | return (static_cast(tup)[I]); 133| | } 134| 360k| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEDnTkNS_13output_bufferENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOS9_RT1_: 93| 21.9k| { 94| 21.9k| context ctx{}; 95| 21.9k| return write(std::forward(value), buffer, ctx); 96| 21.9k| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEDnTkNS_13output_bufferENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSB_RT1_OT2_: 18| 21.9k| { 19| 21.9k| using traits = buffer_traits>; 20| 21.9k| call_scope scope{ctx}; 21| | 22| 21.9k| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 21.9k| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 21.9k, False: 0] ------------------ 25| 21.9k| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 21.9k| } 27| 21.9k| } 28| 21.9k| size_t ix = 0; // overwrite index 29| 21.9k| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 21.9k| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 21.9k] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 21.9k| traits::finalize(buffer, ix); 43| 21.9k| return {ix, error_code::none, ctx.custom_error_message}; 44| 21.9k| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERiTkNS_13output_bufferENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSA_RT1_: 93| 470| { 94| 470| context ctx{}; 95| 470| return write(std::forward(value), buffer, ctx); 96| 470| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERiTkNS_13output_bufferENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_OT2_: 18| 470| { 19| 470| using traits = buffer_traits>; 20| 470| call_scope scope{ctx}; 21| | 22| 470| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 470| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 470, False: 0] ------------------ 25| 470| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 470| } 27| 470| } 28| 470| size_t ix = 0; // overwrite index 29| 470| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 470| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 470] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 470| traits::finalize(buffer, ix); 43| 470| return {ix, error_code::none, ctx.custom_error_message}; 44| 470| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEiTkNS_13output_bufferENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOS9_RT1_: 93| 395| { 94| 395| context ctx{}; 95| 395| return write(std::forward(value), buffer, ctx); 96| 395| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEiTkNS_13output_bufferENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSB_RT1_OT2_: 18| 395| { 19| 395| using traits = buffer_traits>; 20| 395| call_scope scope{ctx}; 21| | 22| 395| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 395| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 395, False: 0] ------------------ 25| 395| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 395| } 27| 395| } 28| 395| size_t ix = 0; // overwrite index 29| 395| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 395| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 395] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 395| traits::finalize(buffer, ix); 43| 395| return {ix, error_code::none, ctx.custom_error_message}; 44| 395| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointETkNS_13output_bufferENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSB_RT1_: 93| 136| { 94| 136| context ctx{}; 95| 136| return write(std::forward(value), buffer, ctx); 96| 136| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointETkNS_13output_bufferENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSD_RT1_OT2_: 18| 136| { 19| 136| using traits = buffer_traits>; 20| 136| call_scope scope{ctx}; 21| | 22| 136| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 136| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 136, False: 0] ------------------ 25| 136| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 136| } 27| 136| } 28| 136| size_t ix = 0; // overwrite index 29| 136| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 136| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 136] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 136| traits::finalize(buffer, ix); 43| 136| return {ix, error_code::none, ctx.custom_error_message}; 44| 136| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_13output_bufferES8_Q15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOS9_RT1_: 93| 370| { 94| 370| context ctx{}; 95| 370| return write(std::forward(value), buffer, ctx); 96| 370| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_13output_bufferES8_TkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSB_RT1_OT2_: 18| 370| { 19| 370| using traits = buffer_traits>; 20| 370| call_scope scope{ctx}; 21| | 22| 370| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 370| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 370, False: 0] ------------------ 25| 370| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 370| } 27| 370| } 28| 370| size_t ix = 0; // overwrite index 29| 370| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 370| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 370] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 370| traits::finalize(buffer, ix); 43| 370| return {ix, error_code::none, ctx.custom_error_message}; 44| 370| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz8fuzz_apiETkNS_13output_bufferENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_: 93| 76| { 94| 76| context ctx{}; 95| 76| return write(std::forward(value), buffer, ctx); 96| 76| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz8fuzz_apiETkNS_13output_bufferENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSE_RT1_OT2_: 18| 76| { 19| 76| using traits = buffer_traits>; 20| 76| call_scope scope{ctx}; 21| | 22| 76| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 76| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 76, False: 0] ------------------ 25| 76| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 76| } 27| 76| } 28| 76| size_t ix = 0; // overwrite index 29| 76| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 76| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 76] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 76| traits::finalize(buffer, ix); 43| 76| return {ix, error_code::none, ctx.custom_error_message}; 44| 76| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_13output_bufferES8_Q15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSA_RT1_: 93| 506| { 94| 506| context ctx{}; 95| 506| return write(std::forward(value), buffer, ctx); 96| 506| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_13output_bufferES8_TkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_OT2_: 18| 506| { 19| 506| using traits = buffer_traits>; 20| 506| call_scope scope{ctx}; 21| | 22| 506| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 506| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 506, False: 0] ------------------ 25| 506| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 506| } 27| 506| } 28| 506| size_t ix = 0; // overwrite index 29| 506| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 506| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 506] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 506| traits::finalize(buffer, ix); 43| 506| return {ix, error_code::none, ctx.custom_error_message}; 44| 506| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERdTkNS_13output_bufferENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSA_RT1_: 93| 578| { 94| 578| context ctx{}; 95| 578| return write(std::forward(value), buffer, ctx); 96| 578| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERdTkNS_13output_bufferENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_OT2_: 18| 578| { 19| 578| using traits = buffer_traits>; 20| 578| call_scope scope{ctx}; 21| | 22| 578| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 578| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 578, False: 0] ------------------ 25| 578| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 578| } 27| 578| } 28| 578| size_t ix = 0; // overwrite index 29| 578| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 578| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 578] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 578| traits::finalize(buffer, ix); 43| 578| return {ix, error_code::none, ctx.custom_error_message}; 44| 578| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz5pointETkNS_13output_bufferENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_: 93| 135| { 94| 135| context ctx{}; 95| 135| return write(std::forward(value), buffer, ctx); 96| 135| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz5pointETkNS_13output_bufferENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSE_RT1_OT2_: 18| 135| { 19| 135| using traits = buffer_traits>; 20| 135| call_scope scope{ctx}; 21| | 22| 135| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 135| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 135, False: 0] ------------------ 25| 135| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 135| } 27| 135| } 28| 135| size_t ix = 0; // overwrite index 29| 135| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 135| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 135] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 135| traits::finalize(buffer, ix); 43| 135| return {ix, error_code::none, ctx.custom_error_message}; 44| 135| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz6nestedETkNS_13output_bufferENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_: 93| 74| { 94| 74| context ctx{}; 95| 74| return write(std::forward(value), buffer, ctx); 96| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz6nestedETkNS_13output_bufferENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSE_RT1_OT2_: 18| 74| { 19| 74| using traits = buffer_traits>; 20| 74| call_scope scope{ctx}; 21| | 22| 74| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 74| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 74, False: 0] ------------------ 25| 74| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 74| } 27| 74| } 28| 74| size_t ix = 0; // overwrite index 29| 74| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 74| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 74] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 74| traits::finalize(buffer, ix); 43| 74| return {ix, error_code::none, ctx.custom_error_message}; 44| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIiNS2_9allocatorIiEEEETkNS_13output_bufferENS2_12basic_stringIcNS2_11char_traitsIcEENS4_IcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSD_RT1_: 93| 74| { 94| 74| context ctx{}; 95| 74| return write(std::forward(value), buffer, ctx); 96| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIiNS2_9allocatorIiEEEETkNS_13output_bufferENS2_12basic_stringIcNS2_11char_traitsIcEENS4_IcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSF_RT1_OT2_: 18| 74| { 19| 74| using traits = buffer_traits>; 20| 74| call_scope scope{ctx}; 21| | 22| 74| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 74| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 74, False: 0] ------------------ 25| 74| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 74| } 27| 74| } 28| 74| size_t ix = 0; // overwrite index 29| 74| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 74| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 74] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 74| traits::finalize(buffer, ix); 43| 74| return {ix, error_code::none, ctx.custom_error_message}; 44| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__13mapINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEiNS2_4lessIS9_EENS7_INS2_4pairIKS9_iEEEEEETkNS_13output_bufferES9_Q15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSI_RT1_: 93| 74| { 94| 74| context ctx{}; 95| 74| return write(std::forward(value), buffer, ctx); 96| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__13mapINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEiNS2_4lessIS9_EENS7_INS2_4pairIKS9_iEEEEEETkNS_13output_bufferES9_TkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSK_RT1_OT2_: 18| 74| { 19| 74| using traits = buffer_traits>; 20| 74| call_scope scope{ctx}; 21| | 22| 74| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 74| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 74, False: 0] ------------------ 25| 74| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 74| } 27| 74| } 28| 74| size_t ix = 0; // overwrite index 29| 74| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 74| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 74] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 74| traits::finalize(buffer, ix); 43| 74| return {ix, error_code::none, ctx.custom_error_message}; 44| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__18optionalIdEETkNS_13output_bufferENS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSC_RT1_: 93| 74| { 94| 74| context ctx{}; 95| 74| return write(std::forward(value), buffer, ctx); 96| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__18optionalIdEETkNS_13output_bufferENS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEETkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSE_RT1_OT2_: 18| 74| { 19| 74| using traits = buffer_traits>; 20| 74| call_scope scope{ctx}; 21| | 22| 74| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 74| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 74, False: 0] ------------------ 25| 74| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 74| } 27| 74| } 28| 74| size_t ix = 0; // overwrite index 29| 74| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 74| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 74] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 74| traits::finalize(buffer, ix); 43| 74| return {ix, error_code::none, ctx.custom_error_message}; 44| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__17variantIJNS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEN9repe_fuzz6amountEEEETkNS_13output_bufferES9_Q15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSE_RT1_: 93| 74| { 94| 74| context ctx{}; 95| 74| return write(std::forward(value), buffer, ctx); 96| 74| } _ZN3glz5writeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__17variantIJNS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEN9repe_fuzz6amountEEEETkNS_13output_bufferES9_TkNS_10is_contextERNS_7contextEQ15write_supportedIT0_XdtT_6formatEEEENS_9error_ctxEOSG_RT1_OT2_: 18| 74| { 19| 74| using traits = buffer_traits>; 20| 74| call_scope scope{ctx}; 21| | 22| 74| if constexpr (traits::is_resizable) { 23| | // A buffer could be size 1, to ensure we have sufficient memory we can't just check `empty()` 24| 74| if (buffer.size() < 2 * write_padding_bytes) { ------------------ | Branch (24:14): [True: 74, False: 0] ------------------ 25| 74| resize_unfilled(buffer, 2 * write_padding_bytes); 26| 74| } 27| 74| } 28| 74| size_t ix = 0; // overwrite index 29| 74| to>::template op(std::forward(value), ctx, buffer, ix); 30| | 31| 74| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (31:11): [True: 0, False: 74] ------------------ 32| | // Truncate on the way out too: the padding above is grown without being filled, so a 33| | // buffer left at its padded length would hand the caller indeterminate bytes. Not 34| | // `finalize`, which for a streaming buffer means flushing -- a failed write must not 35| | // push the partial document downstream on its way out. 36| 0| if constexpr (traits::is_resizable && not traits::is_output_streaming) { 37| 0| buffer.resize(ix); 38| 0| } 39| 0| return {ix, ctx.error, ctx.custom_error_message}; 40| 0| } 41| | 42| 74| traits::finalize(buffer, ix); 43| 74| return {ix, error_code::none, ctx.custom_error_message}; 44| 74| } _ZN3glz11write_chars2opITnDaXtlNS_9opts_sizeEtlNS_4optsELj10ELb1ELb0ELb1ELb1EEEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEETkNS_5num_tERKmTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 206| 323k| { 207| | /*if constexpr (std::same_as, std::string>) { 208| | // more efficient strings in C++23: 209| | https://en.cppreference.com/w/cpp/string/basic_string/resize_and_overwrite 210| | }*/ 211| | 212| | // https://stackoverflow.com/questions/1701055/what-is-the-maximum-length-in-chars-needed-to-represent-any-double-value 213| | // maximum length for a double should be 24 chars, we use 64 to be sufficient for float128_t 214| 323k| if constexpr (resizable && not check_write_unchecked(Opts)) { 215| 323k| if (const auto k = ix + 64; k > b.size()) { ------------------ | Branch (215:41): [True: 0, False: 323k] ------------------ 216| 0| grow_buffer(b, k); 217| 0| } 218| 323k| } 219| | 220| 323k| using V = std::decay_t; 221| | 222| | if constexpr (std::floating_point) { 223| | using opts_type = std::decay_t; 224| | constexpr bool use_float_format = requires { opts_type::float_format; }; 225| | 226| | // User-specified float_format takes priority over all other options 227| | if constexpr (use_float_format && is_any_of) { 228| |#if GLZ_USE_STD_FORMAT_FLOAT 229| | // Use std::format with user-provided format string (e.g., "{:.2f}") 230| | // Format string is validated at compile-time via std::format_string 231| | constexpr auto fmt = std::format_string{opts_type::float_format}; 232| | 233| | if constexpr (check_write_unchecked(Opts)) { 234| | // Caller guarantees buffer has enough space 235| | const auto start = reinterpret_cast(&b[ix]); 236| | auto result = std::format_to(start, fmt, V(value)); 237| | ix += size_t(result - start); 238| | } 239| | else { 240| | // format_to_n writes up to 'available' chars and returns total size needed. 241| | // Common case: output fits in pre-allocated buffer (single pass). 242| | // Rare case: output exceeds buffer (e.g., "{:.100f}"), requires resize. 243| | const auto start = reinterpret_cast(&b[ix]); 244| | const auto available = b.size() - ix; 245| | auto [out, size] = std::format_to_n(start, available, fmt, V(value)); 246| | 247| | if (static_cast(size) > available) { 248| | // Output was truncated - size tells us exactly how much space we need 249| | if constexpr (resizable) { 250| | grow_buffer(b, ix + size); 251| | std::format_to(reinterpret_cast(&b[ix]), fmt, V(value)); 252| | } 253| | else { 254| | ctx.error = error_code::unexpected_end; 255| | return; 256| | } 257| | } 258| | ix += size; 259| | } 260| |#else 261| | // snprintf fallback for platforms without std::format float support (e.g., iOS < 16.3) 262| | // Convert std::format spec to printf format at compile time 263| | constexpr auto printf_fmt = detail::to_printf_fmt(opts_type::float_format); 264| | 265| | const auto start = reinterpret_cast(&b[ix]); 266| | const auto available = check_write_unchecked(Opts) ? size_t(64) : (b.size() - ix); 267| | 268| | // snprintf returns chars that would be written (excluding null), or negative on error 269| | const int len = std::snprintf(start, available, printf_fmt.data, static_cast(value)); 270| | 271| | if (len < 0) { 272| | ctx.error = error_code::unexpected_end; 273| | return; 274| | } 275| | 276| | if (static_cast(len) >= available) { 277| | // Output was truncated, need to resize and retry 278| | if constexpr (resizable && not check_write_unchecked(Opts)) { 279| | grow_buffer(b, ix + static_cast(len) + 1); 280| | std::snprintf(reinterpret_cast(&b[ix]), static_cast(len) + 1, printf_fmt.data, 281| | static_cast(value)); 282| | } 283| | else { 284| | ctx.error = error_code::unexpected_end; 285| | return; 286| | } 287| | } 288| | ix += static_cast(len); 289| |#endif 290| | } 291| | else { 292| | constexpr auto max_precision = uint8_t(check_float_max_write_precision(Opts)); 293| | constexpr bool narrows = max_precision > 0 && max_precision < sizeof(V); 294| |#if !defined(_LIBCPP_VERSION) || _LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT 295| | constexpr bool has_full_precision_writer = is_any_of || is_float128; 296| |#else 297| | constexpr bool has_full_precision_writer = is_any_of; 298| |#endif 299| | if constexpr (narrows) { 300| | // we cast to a lower precision floating point value before writing out 301| | static_assert(max_precision == 4 || max_precision == 8, "invalid float_max_write_precision"); 302| | using reduced_t = std::conditional_t; 303| | const auto reduced = static_cast(value); 304| | // A finite value beyond the reduced type's range rounds to infinity, which would be written as 305| | // null. Such a value is written at full precision below instead. 306| | const bool overflowed = std::isinf(reduced) && value != static_cast(reduced); 307| | if (not has_full_precision_writer || not overflowed) { 308| | const auto start = reinterpret_cast(&b[ix]); 309| | const auto end = glz::to_chars(start, reduced); 310| | ix += size_t(end - start); 311| | return; 312| | } 313| | } 314| | 315| | // Size optimization: pass OptSize=true so the ~17KB pow-10 lookup 316| | // tables are dropped (recomputed on the fly). Much faster than the 317| | // old simple_float::to_chars path at essentially the same footprint. 318| | // See discussion #2519. 319| | if constexpr (is_size_optimized(Opts) && is_any_of) { 320| | const auto start = reinterpret_cast(&b[ix]); 321| | const auto end = glz::to_chars(start, V(value)); 322| | ix += size_t(end - start); 323| | } 324| | else if constexpr (is_any_of) { 325| | const auto start = reinterpret_cast(&b[ix]); 326| | const auto end = glz::to_chars(start, value); 327| | ix += size_t(end - start); 328| | } 329| |// float128_t requires std::to_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 330| |#if !defined(_LIBCPP_VERSION) || _LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT 331| | else if constexpr (is_float128) { 332| | const auto start = reinterpret_cast(&b[ix]); 333| | const auto [ptr, ec] = std::to_chars(start, &b[0] + b.size(), value, std::chars_format::general); 334| | if (ec != std::errc()) { 335| | ctx.error = error_code::unexpected_end; 336| | return; 337| | } 338| | ix += size_t(ptr - start); 339| | } 340| |#endif 341| | else if constexpr (not narrows) { 342| | static_assert(false_v, "type is not supported"); 343| | } 344| | } 345| | } 346| | else if constexpr (is_any_of) { 347| | // Small integers: always use to_chars (400B tables) 348| | // The 40KB digit_quads table doesn't help for these small ranges 349| | const auto start = reinterpret_cast(&b[ix]); 350| | const auto end = glz::to_chars(start, value); 351| | ix += size_t(end - start); 352| | } 353| 323k| else if constexpr (is_any_of) { 354| 323k| const auto start = reinterpret_cast(&b[ix]); 355| 323k| if constexpr (is_size_optimized(Opts)) { 356| | // Size mode: use glz::to_chars (400B lookup tables) 357| 323k| const auto end = glz::to_chars(start, value); 358| 323k| ix += size_t(end - start); 359| | } 360| | else { 361| | // Normal mode: use to_chars_40kb (40KB digit_quads table) 362| | const auto end = glz::to_chars_40kb(start, value); 363| | ix += size_t(end - start); 364| | } 365| | } 366| | else if constexpr (std::integral) { 367| | // Handle other integral types (char, wchar_t, etc.) by casting to sized types 368| | using X = std::decay_t())>; 369| | const auto start = reinterpret_cast(&b[ix]); 370| | if constexpr (is_size_optimized(Opts)) { 371| | // Size mode: use glz::to_chars (400B lookup tables) 372| | const auto end = glz::to_chars(start, static_cast(value)); 373| | ix += size_t(end - start); 374| | } 375| | else { 376| | // Normal mode: use to_chars_40kb 377| | const auto end = glz::to_chars_40kb(start, static_cast(value)); 378| | ix += size_t(end - start); 379| | } 380| | } 381| | else { 382| | static_assert(false_v, "type is not supported"); 383| | } 384| 323k| } _ZN3glz11write_chars2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj128EEERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEETkNS_5num_tERiTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 206| 1.09k| { 207| | /*if constexpr (std::same_as, std::string>) { 208| | // more efficient strings in C++23: 209| | https://en.cppreference.com/w/cpp/string/basic_string/resize_and_overwrite 210| | }*/ 211| | 212| | // https://stackoverflow.com/questions/1701055/what-is-the-maximum-length-in-chars-needed-to-represent-any-double-value 213| | // maximum length for a double should be 24 chars, we use 64 to be sufficient for float128_t 214| | if constexpr (resizable && not check_write_unchecked(Opts)) { 215| | if (const auto k = ix + 64; k > b.size()) { 216| | grow_buffer(b, k); 217| | } 218| | } 219| | 220| 1.09k| using V = std::decay_t; 221| | 222| | if constexpr (std::floating_point) { 223| | using opts_type = std::decay_t; 224| | constexpr bool use_float_format = requires { opts_type::float_format; }; 225| | 226| | // User-specified float_format takes priority over all other options 227| | if constexpr (use_float_format && is_any_of) { 228| |#if GLZ_USE_STD_FORMAT_FLOAT 229| | // Use std::format with user-provided format string (e.g., "{:.2f}") 230| | // Format string is validated at compile-time via std::format_string 231| | constexpr auto fmt = std::format_string{opts_type::float_format}; 232| | 233| | if constexpr (check_write_unchecked(Opts)) { 234| | // Caller guarantees buffer has enough space 235| | const auto start = reinterpret_cast(&b[ix]); 236| | auto result = std::format_to(start, fmt, V(value)); 237| | ix += size_t(result - start); 238| | } 239| | else { 240| | // format_to_n writes up to 'available' chars and returns total size needed. 241| | // Common case: output fits in pre-allocated buffer (single pass). 242| | // Rare case: output exceeds buffer (e.g., "{:.100f}"), requires resize. 243| | const auto start = reinterpret_cast(&b[ix]); 244| | const auto available = b.size() - ix; 245| | auto [out, size] = std::format_to_n(start, available, fmt, V(value)); 246| | 247| | if (static_cast(size) > available) { 248| | // Output was truncated - size tells us exactly how much space we need 249| | if constexpr (resizable) { 250| | grow_buffer(b, ix + size); 251| | std::format_to(reinterpret_cast(&b[ix]), fmt, V(value)); 252| | } 253| | else { 254| | ctx.error = error_code::unexpected_end; 255| | return; 256| | } 257| | } 258| | ix += size; 259| | } 260| |#else 261| | // snprintf fallback for platforms without std::format float support (e.g., iOS < 16.3) 262| | // Convert std::format spec to printf format at compile time 263| | constexpr auto printf_fmt = detail::to_printf_fmt(opts_type::float_format); 264| | 265| | const auto start = reinterpret_cast(&b[ix]); 266| | const auto available = check_write_unchecked(Opts) ? size_t(64) : (b.size() - ix); 267| | 268| | // snprintf returns chars that would be written (excluding null), or negative on error 269| | const int len = std::snprintf(start, available, printf_fmt.data, static_cast(value)); 270| | 271| | if (len < 0) { 272| | ctx.error = error_code::unexpected_end; 273| | return; 274| | } 275| | 276| | if (static_cast(len) >= available) { 277| | // Output was truncated, need to resize and retry 278| | if constexpr (resizable && not check_write_unchecked(Opts)) { 279| | grow_buffer(b, ix + static_cast(len) + 1); 280| | std::snprintf(reinterpret_cast(&b[ix]), static_cast(len) + 1, printf_fmt.data, 281| | static_cast(value)); 282| | } 283| | else { 284| | ctx.error = error_code::unexpected_end; 285| | return; 286| | } 287| | } 288| | ix += static_cast(len); 289| |#endif 290| | } 291| | else { 292| | constexpr auto max_precision = uint8_t(check_float_max_write_precision(Opts)); 293| | constexpr bool narrows = max_precision > 0 && max_precision < sizeof(V); 294| |#if !defined(_LIBCPP_VERSION) || _LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT 295| | constexpr bool has_full_precision_writer = is_any_of || is_float128; 296| |#else 297| | constexpr bool has_full_precision_writer = is_any_of; 298| |#endif 299| | if constexpr (narrows) { 300| | // we cast to a lower precision floating point value before writing out 301| | static_assert(max_precision == 4 || max_precision == 8, "invalid float_max_write_precision"); 302| | using reduced_t = std::conditional_t; 303| | const auto reduced = static_cast(value); 304| | // A finite value beyond the reduced type's range rounds to infinity, which would be written as 305| | // null. Such a value is written at full precision below instead. 306| | const bool overflowed = std::isinf(reduced) && value != static_cast(reduced); 307| | if (not has_full_precision_writer || not overflowed) { 308| | const auto start = reinterpret_cast(&b[ix]); 309| | const auto end = glz::to_chars(start, reduced); 310| | ix += size_t(end - start); 311| | return; 312| | } 313| | } 314| | 315| | // Size optimization: pass OptSize=true so the ~17KB pow-10 lookup 316| | // tables are dropped (recomputed on the fly). Much faster than the 317| | // old simple_float::to_chars path at essentially the same footprint. 318| | // See discussion #2519. 319| | if constexpr (is_size_optimized(Opts) && is_any_of) { 320| | const auto start = reinterpret_cast(&b[ix]); 321| | const auto end = glz::to_chars(start, V(value)); 322| | ix += size_t(end - start); 323| | } 324| | else if constexpr (is_any_of) { 325| | const auto start = reinterpret_cast(&b[ix]); 326| | const auto end = glz::to_chars(start, value); 327| | ix += size_t(end - start); 328| | } 329| |// float128_t requires std::to_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 330| |#if !defined(_LIBCPP_VERSION) || _LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT 331| | else if constexpr (is_float128) { 332| | const auto start = reinterpret_cast(&b[ix]); 333| | const auto [ptr, ec] = std::to_chars(start, &b[0] + b.size(), value, std::chars_format::general); 334| | if (ec != std::errc()) { 335| | ctx.error = error_code::unexpected_end; 336| | return; 337| | } 338| | ix += size_t(ptr - start); 339| | } 340| |#endif 341| | else if constexpr (not narrows) { 342| | static_assert(false_v, "type is not supported"); 343| | } 344| | } 345| | } 346| | else if constexpr (is_any_of) { 347| | // Small integers: always use to_chars (400B tables) 348| | // The 40KB digit_quads table doesn't help for these small ranges 349| | const auto start = reinterpret_cast(&b[ix]); 350| | const auto end = glz::to_chars(start, value); 351| | ix += size_t(end - start); 352| | } 353| 1.09k| else if constexpr (is_any_of) { 354| 1.09k| const auto start = reinterpret_cast(&b[ix]); 355| | if constexpr (is_size_optimized(Opts)) { 356| | // Size mode: use glz::to_chars (400B lookup tables) 357| | const auto end = glz::to_chars(start, value); 358| | ix += size_t(end - start); 359| | } 360| 1.09k| else { 361| | // Normal mode: use to_chars_40kb (40KB digit_quads table) 362| 1.09k| const auto end = glz::to_chars_40kb(start, value); 363| 1.09k| ix += size_t(end - start); 364| 1.09k| } 365| | } 366| | else if constexpr (std::integral) { 367| | // Handle other integral types (char, wchar_t, etc.) by casting to sized types 368| | using X = std::decay_t())>; 369| | const auto start = reinterpret_cast(&b[ix]); 370| | if constexpr (is_size_optimized(Opts)) { 371| | // Size mode: use glz::to_chars (400B lookup tables) 372| | const auto end = glz::to_chars(start, static_cast(value)); 373| | ix += size_t(end - start); 374| | } 375| | else { 376| | // Normal mode: use to_chars_40kb 377| | const auto end = glz::to_chars_40kb(start, static_cast(value)); 378| | ix += size_t(end - start); 379| | } 380| | } 381| | else { 382| | static_assert(false_v, "type is not supported"); 383| | } 384| 1.09k| } _ZN3glz11write_chars2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj128EEERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEETkNS_5num_tERdTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 206| 1.27k| { 207| | /*if constexpr (std::same_as, std::string>) { 208| | // more efficient strings in C++23: 209| | https://en.cppreference.com/w/cpp/string/basic_string/resize_and_overwrite 210| | }*/ 211| | 212| | // https://stackoverflow.com/questions/1701055/what-is-the-maximum-length-in-chars-needed-to-represent-any-double-value 213| | // maximum length for a double should be 24 chars, we use 64 to be sufficient for float128_t 214| | if constexpr (resizable && not check_write_unchecked(Opts)) { 215| | if (const auto k = ix + 64; k > b.size()) { 216| | grow_buffer(b, k); 217| | } 218| | } 219| | 220| 1.27k| using V = std::decay_t; 221| | 222| 1.27k| if constexpr (std::floating_point) { 223| 1.27k| using opts_type = std::decay_t; 224| 1.27k| constexpr bool use_float_format = requires { opts_type::float_format; }; 225| | 226| | // User-specified float_format takes priority over all other options 227| | if constexpr (use_float_format && is_any_of) { 228| |#if GLZ_USE_STD_FORMAT_FLOAT 229| | // Use std::format with user-provided format string (e.g., "{:.2f}") 230| | // Format string is validated at compile-time via std::format_string 231| | constexpr auto fmt = std::format_string{opts_type::float_format}; 232| | 233| | if constexpr (check_write_unchecked(Opts)) { 234| | // Caller guarantees buffer has enough space 235| | const auto start = reinterpret_cast(&b[ix]); 236| | auto result = std::format_to(start, fmt, V(value)); 237| | ix += size_t(result - start); 238| | } 239| | else { 240| | // format_to_n writes up to 'available' chars and returns total size needed. 241| | // Common case: output fits in pre-allocated buffer (single pass). 242| | // Rare case: output exceeds buffer (e.g., "{:.100f}"), requires resize. 243| | const auto start = reinterpret_cast(&b[ix]); 244| | const auto available = b.size() - ix; 245| | auto [out, size] = std::format_to_n(start, available, fmt, V(value)); 246| | 247| | if (static_cast(size) > available) { 248| | // Output was truncated - size tells us exactly how much space we need 249| | if constexpr (resizable) { 250| | grow_buffer(b, ix + size); 251| | std::format_to(reinterpret_cast(&b[ix]), fmt, V(value)); 252| | } 253| | else { 254| | ctx.error = error_code::unexpected_end; 255| | return; 256| | } 257| | } 258| | ix += size; 259| | } 260| |#else 261| | // snprintf fallback for platforms without std::format float support (e.g., iOS < 16.3) 262| | // Convert std::format spec to printf format at compile time 263| | constexpr auto printf_fmt = detail::to_printf_fmt(opts_type::float_format); 264| | 265| | const auto start = reinterpret_cast(&b[ix]); 266| | const auto available = check_write_unchecked(Opts) ? size_t(64) : (b.size() - ix); 267| | 268| | // snprintf returns chars that would be written (excluding null), or negative on error 269| | const int len = std::snprintf(start, available, printf_fmt.data, static_cast(value)); 270| | 271| | if (len < 0) { 272| | ctx.error = error_code::unexpected_end; 273| | return; 274| | } 275| | 276| | if (static_cast(len) >= available) { 277| | // Output was truncated, need to resize and retry 278| | if constexpr (resizable && not check_write_unchecked(Opts)) { 279| | grow_buffer(b, ix + static_cast(len) + 1); 280| | std::snprintf(reinterpret_cast(&b[ix]), static_cast(len) + 1, printf_fmt.data, 281| | static_cast(value)); 282| | } 283| | else { 284| | ctx.error = error_code::unexpected_end; 285| | return; 286| | } 287| | } 288| | ix += static_cast(len); 289| |#endif 290| | } 291| 1.27k| else { 292| 1.27k| constexpr auto max_precision = uint8_t(check_float_max_write_precision(Opts)); 293| 1.27k| constexpr bool narrows = max_precision > 0 && max_precision < sizeof(V); ------------------ | Branch (293:41): [Folded, False: 1.27k] | Branch (293:62): [True: 0, Folded] ------------------ 294| 1.27k|#if !defined(_LIBCPP_VERSION) || _LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT 295| 1.27k| constexpr bool has_full_precision_writer = is_any_of || is_float128; ------------------ | Branch (295:59): [True: 1.27k, Folded] | Branch (295:90): [Folded, False: 0] ------------------ 296| |#else 297| | constexpr bool has_full_precision_writer = is_any_of; 298| |#endif 299| | if constexpr (narrows) { 300| | // we cast to a lower precision floating point value before writing out 301| | static_assert(max_precision == 4 || max_precision == 8, "invalid float_max_write_precision"); 302| | using reduced_t = std::conditional_t; 303| | const auto reduced = static_cast(value); 304| | // A finite value beyond the reduced type's range rounds to infinity, which would be written as 305| | // null. Such a value is written at full precision below instead. 306| | const bool overflowed = std::isinf(reduced) && value != static_cast(reduced); 307| | if (not has_full_precision_writer || not overflowed) { 308| | const auto start = reinterpret_cast(&b[ix]); 309| | const auto end = glz::to_chars(start, reduced); 310| | ix += size_t(end - start); 311| | return; 312| | } 313| | } 314| | 315| | // Size optimization: pass OptSize=true so the ~17KB pow-10 lookup 316| | // tables are dropped (recomputed on the fly). Much faster than the 317| | // old simple_float::to_chars path at essentially the same footprint. 318| | // See discussion #2519. 319| | if constexpr (is_size_optimized(Opts) && is_any_of) { 320| | const auto start = reinterpret_cast(&b[ix]); 321| | const auto end = glz::to_chars(start, V(value)); 322| | ix += size_t(end - start); 323| | } 324| 1.27k| else if constexpr (is_any_of) { 325| 1.27k| const auto start = reinterpret_cast(&b[ix]); 326| 1.27k| const auto end = glz::to_chars(start, value); 327| 1.27k| ix += size_t(end - start); 328| | } 329| |// float128_t requires std::to_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 330| |#if !defined(_LIBCPP_VERSION) || _LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT 331| | else if constexpr (is_float128) { 332| | const auto start = reinterpret_cast(&b[ix]); 333| | const auto [ptr, ec] = std::to_chars(start, &b[0] + b.size(), value, std::chars_format::general); 334| | if (ec != std::errc()) { 335| | ctx.error = error_code::unexpected_end; 336| | return; 337| | } 338| | ix += size_t(ptr - start); 339| | } 340| |#endif 341| | else if constexpr (not narrows) { 342| | static_assert(false_v, "type is not supported"); 343| | } 344| 1.27k| } 345| | } 346| | else if constexpr (is_any_of) { 347| | // Small integers: always use to_chars (400B tables) 348| | // The 40KB digit_quads table doesn't help for these small ranges 349| | const auto start = reinterpret_cast(&b[ix]); 350| | const auto end = glz::to_chars(start, value); 351| | ix += size_t(end - start); 352| | } 353| | else if constexpr (is_any_of) { 354| | const auto start = reinterpret_cast(&b[ix]); 355| | if constexpr (is_size_optimized(Opts)) { 356| | // Size mode: use glz::to_chars (400B lookup tables) 357| | const auto end = glz::to_chars(start, value); 358| | ix += size_t(end - start); 359| | } 360| | else { 361| | // Normal mode: use to_chars_40kb (40KB digit_quads table) 362| | const auto end = glz::to_chars_40kb(start, value); 363| | ix += size_t(end - start); 364| | } 365| | } 366| | else if constexpr (std::integral) { 367| | // Handle other integral types (char, wchar_t, etc.) by casting to sized types 368| | using X = std::decay_t())>; 369| | const auto start = reinterpret_cast(&b[ix]); 370| | if constexpr (is_size_optimized(Opts)) { 371| | // Size mode: use glz::to_chars (400B lookup tables) 372| | const auto end = glz::to_chars(start, static_cast(value)); 373| | ix += size_t(end - start); 374| | } 375| | else { 376| | // Normal mode: use to_chars_40kb 377| | const auto end = glz::to_chars_40kb(start, static_cast(value)); 378| | ix += size_t(end - start); 379| | } 380| | } 381| | else { 382| | static_assert(false_v, "type is not supported"); 383| | } 384| 1.27k| } _ZN3glz4fromILj10EiE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERPKcRiTkNS_10is_contextERNS_7contextES5_EEvOT1_OT2_OT0_T3_: 763| 621k| { 764| | if constexpr (check_quoted_num(Opts)) { 765| | if (skip_ws(ctx, it, end)) { 766| | return; 767| | } 768| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 769| | return; 770| | } 771| | } 772| | 773| | if constexpr (!check_ws_handled(Opts)) { 774| | if (skip_ws(ctx, it, end)) { 775| | return; 776| | } 777| | } 778| | 779| 621k| using V = std::decay_t; 780| 621k| if constexpr (int_t) { 781| 621k| static_assert(sizeof(*it) == sizeof(char)); 782| | 783| | if constexpr (Opts.null_terminated) { 784| | if (not glz::atoi(value, it)) [[unlikely]] { 785| | ctx.error = error_code::parse_number_failure; 786| | return; 787| | } 788| | } 789| 621k| else { 790| 621k| if (not glz::atoi(value, it, end)) [[unlikely]] { ------------------ | Branch (790:20): [True: 10.5k, False: 611k] ------------------ 791| 10.5k| ctx.error = error_code::parse_number_failure; 792| 10.5k| return; 793| 10.5k| } 794| 621k| } 795| | } 796| | else { 797| |// float128_t requires std::from_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 798| |#if !defined(_LIBCPP_VERSION) || defined(_LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT) 799| | if constexpr (is_float128) { 800| | auto [ptr, ec] = std::from_chars(it, end, value); 801| | if (ec != std::errc()) { 802| | ctx.error = error_code::parse_number_failure; 803| | return; 804| | } 805| | it = ptr; 806| | } 807| | else 808| |#endif 809| | { 810| | if constexpr (std::is_volatile_v>) { 811| | // Hardware may interact with value changes, so we parse into a temporary and assign in one 812| | // place 813| | V temp; 814| | if constexpr (is_size_optimized(Opts)) { 815| | auto [ptr, ec] = simple_float::from_chars(it, end, temp); 816| | if (ec != std::errc{}) [[unlikely]] { 817| | ctx.error = error_code::parse_number_failure; 818| | return; 819| | } 820| | it = ptr; 821| | } 822| | else { 823| | auto [ptr, ec] = glz::from_chars(it, end, temp); 824| | if (ec != std::errc()) [[unlikely]] { 825| | ctx.error = error_code::parse_number_failure; 826| | return; 827| | } 828| | it = ptr; 829| | } 830| | value = temp; 831| | } 832| | else { 833| | if constexpr (is_size_optimized(Opts)) { 834| | auto [ptr, ec] = simple_float::from_chars(it, end, value); 835| | if (ec != std::errc{}) [[unlikely]] { 836| | ctx.error = error_code::parse_number_failure; 837| | return; 838| | } 839| | it = ptr; 840| | } 841| | else { 842| | auto [ptr, ec] = glz::from_chars(it, end, value); 843| | if (ec != std::errc()) [[unlikely]] { 844| | ctx.error = error_code::parse_number_failure; 845| | return; 846| | } 847| | it = ptr; 848| | } 849| | } 850| | } 851| | } 852| | 853| | if constexpr (check_quoted_num(Opts)) { 854| | if constexpr (not Opts.null_terminated) { 855| | if (it == end) [[unlikely]] { 856| | ctx.error = error_code::unexpected_end; 857| | return; 858| | } 859| | } 860| | if (match<'"'>(ctx, it)) { 861| | return; 862| | } 863| | if constexpr (not Opts.null_terminated) { 864| | if (it == end) { 865| | ctx.error = error_code::end_reached; 866| | return; 867| | } 868| | } 869| | } 870| 621k| else { 871| 621k| if constexpr (not Opts.null_terminated) { 872| 621k| if (it == end) { ------------------ | Branch (872:20): [True: 2.50k, False: 619k] ------------------ 873| 2.50k| ctx.error = error_code::end_reached; 874| 2.50k| return; 875| 2.50k| } 876| 621k| } 877| 621k| } 878| 621k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERiTkNS_10is_contextERNS_7contextERPKcS8_EEvOT0_OT1_OT2_T3_: 49| 59.1k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 59.1k| else { 60| 59.1k| using V = std::remove_cvref_t; 61| 59.1k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 59.1k| end); 63| 59.1k| } 64| 59.1k| } _ZN3glz4fromILj10EiE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERPKcRiTkNS_10is_contextERNS_7contextES5_EEvOT1_OT2_OT0_T3_: 763| 59.1k| { 764| | if constexpr (check_quoted_num(Opts)) { 765| | if (skip_ws(ctx, it, end)) { 766| | return; 767| | } 768| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 769| | return; 770| | } 771| | } 772| | 773| 59.1k| if constexpr (!check_ws_handled(Opts)) { 774| 59.1k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (774:17): [True: 159, False: 58.9k] ------------------ 775| 159| return; 776| 159| } 777| 59.1k| } 778| | 779| 58.9k| using V = std::decay_t; 780| 59.1k| if constexpr (int_t) { 781| 59.1k| static_assert(sizeof(*it) == sizeof(char)); 782| | 783| | if constexpr (Opts.null_terminated) { 784| | if (not glz::atoi(value, it)) [[unlikely]] { 785| | ctx.error = error_code::parse_number_failure; 786| | return; 787| | } 788| | } 789| 59.1k| else { 790| 59.1k| if (not glz::atoi(value, it, end)) [[unlikely]] { ------------------ | Branch (790:20): [True: 57.4k, False: 1.64k] ------------------ 791| 57.4k| ctx.error = error_code::parse_number_failure; 792| 57.4k| return; 793| 57.4k| } 794| 59.1k| } 795| | } 796| | else { 797| |// float128_t requires std::from_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 798| |#if !defined(_LIBCPP_VERSION) || defined(_LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT) 799| | if constexpr (is_float128) { 800| | auto [ptr, ec] = std::from_chars(it, end, value); 801| | if (ec != std::errc()) { 802| | ctx.error = error_code::parse_number_failure; 803| | return; 804| | } 805| | it = ptr; 806| | } 807| | else 808| |#endif 809| | { 810| | if constexpr (std::is_volatile_v>) { 811| | // Hardware may interact with value changes, so we parse into a temporary and assign in one 812| | // place 813| | V temp; 814| | if constexpr (is_size_optimized(Opts)) { 815| | auto [ptr, ec] = simple_float::from_chars(it, end, temp); 816| | if (ec != std::errc{}) [[unlikely]] { 817| | ctx.error = error_code::parse_number_failure; 818| | return; 819| | } 820| | it = ptr; 821| | } 822| | else { 823| | auto [ptr, ec] = glz::from_chars(it, end, temp); 824| | if (ec != std::errc()) [[unlikely]] { 825| | ctx.error = error_code::parse_number_failure; 826| | return; 827| | } 828| | it = ptr; 829| | } 830| | value = temp; 831| | } 832| | else { 833| | if constexpr (is_size_optimized(Opts)) { 834| | auto [ptr, ec] = simple_float::from_chars(it, end, value); 835| | if (ec != std::errc{}) [[unlikely]] { 836| | ctx.error = error_code::parse_number_failure; 837| | return; 838| | } 839| | it = ptr; 840| | } 841| | else { 842| | auto [ptr, ec] = glz::from_chars(it, end, value); 843| | if (ec != std::errc()) [[unlikely]] { 844| | ctx.error = error_code::parse_number_failure; 845| | return; 846| | } 847| | it = ptr; 848| | } 849| | } 850| | } 851| | } 852| | 853| | if constexpr (check_quoted_num(Opts)) { 854| | if constexpr (not Opts.null_terminated) { 855| | if (it == end) [[unlikely]] { 856| | ctx.error = error_code::unexpected_end; 857| | return; 858| | } 859| | } 860| | if (match<'"'>(ctx, it)) { 861| | return; 862| | } 863| | if constexpr (not Opts.null_terminated) { 864| | if (it == end) { 865| | ctx.error = error_code::end_reached; 866| | return; 867| | } 868| | } 869| | } 870| 59.1k| else { 871| 59.1k| if constexpr (not Opts.null_terminated) { 872| 59.1k| if (it == end) { ------------------ | Branch (872:20): [True: 1.01k, False: 58.1k] ------------------ 873| 1.01k| ctx.error = error_code::end_reached; 874| 1.01k| return; 875| 1.01k| } 876| 59.1k| } 877| 59.1k| } 878| 59.1k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz5pointETkNS_10is_contextERNS_7contextERPKcSA_EEvOT0_OT1_OT2_T3_: 49| 44.5k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 44.5k| else { 60| 44.5k| using V = std::remove_cvref_t; 61| 44.5k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 44.5k| end); 63| 44.5k| } 64| 44.5k| } _ZN3glz4fromILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_: 2791| 44.5k| { 2792| 44.5k| static constexpr auto num_members = reflect::size; 2793| | 2794| 44.5k| static constexpr auto Opts = opening_handled_off()>(); 2795| 44.5k| if constexpr (!check_opening_handled(Options)) { 2796| 44.5k| if constexpr (!check_ws_handled(Options)) { 2797| 44.5k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2797:20): [True: 118, False: 44.4k] ------------------ 2798| 118| return; 2799| 118| } 2800| 44.5k| } 2801| 44.5k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 16.9k, False: 27.5k] ------------------ 2802| 16.9k| return; 2803| 16.9k| } 2804| 27.5k| if constexpr (not Opts.null_terminated) { 2805| 27.5k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 27.5k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 27.5k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 27.5k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 27.5k] ------------------ 2813| 0| return; 2814| 0| } 2815| 27.5k| } 2816| 27.5k| const auto ws_start = it; 2817| 44.5k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 82, False: 44.4k] ------------------ 2818| 82| return; 2819| 82| } 2820| 44.4k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 44.4k| else { 2895| 44.4k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 44.4k| if constexpr ((glaze_object_t || reflectable) && 2897| 44.4k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 44.4k| return bit_array{}; 2899| 44.4k| } 2900| 44.4k| else { 2901| 44.4k| return nullptr; 2902| 44.4k| } 2903| 44.4k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 44.4k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 44.4k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 44.4k| return has_includer_member; 2915| 44.4k| } 2916| 44.4k| else { 2917| 44.4k| return false; 2918| 44.4k| } 2919| 44.4k| }(); 2920| 44.4k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 44.4k| [[maybe_unused]] const std::conditional_t>, 2930| 44.4k| inert_key_bits_scope> published_bits{ 2931| 44.4k| ctx, [&]() -> void* { 2932| 44.4k| if constexpr (tracks_include_keys) { 2933| 44.4k| return &fields; 2934| 44.4k| } 2935| 44.4k| else { 2936| 44.4k| return nullptr; 2937| 44.4k| } 2938| 44.4k| }()}; 2939| | 2940| 44.4k| size_t read_count{}; // for partial_read 2941| | 2942| 44.4k| bool first = true; 2943| 102k| while (true) { ------------------ | Branch (2943:20): [True: 58.6k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 58.6k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 200, False: 58.4k] ------------------ 2981| 200| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| 200| if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| 200| } 3017| 200| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 200| if constexpr (not Opts.null_terminated) { 3019| 200| if (it == end) { ------------------ | Branch (3019:26): [True: 124, False: 76] ------------------ 3020| 124| ctx.error = error_code::end_reached; 3021| 124| return; 3022| 124| } 3023| 200| } 3024| 76| return; 3025| 200| } 3026| 58.4k| else if (first) { ------------------ | Branch (3026:25): [True: 27.2k, False: 31.2k] ------------------ 3027| 27.2k| first = false; 3028| 27.2k| } 3029| 31.2k| else { 3030| 31.2k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 523, False: 30.7k] ------------------ 3031| 523| return; 3032| 523| } 3033| 30.7k| if constexpr (not Opts.null_terminated) { 3034| 30.7k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 30.7k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 30.7k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| 30.7k| (!Opts.comments)) { 3042| 30.7k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (3042:26): [True: 20.4k, False: 10.2k] | Branch (3042:37): [True: 19.8k, False: 594] ------------------ 3043| 19.8k| skip_matching_ws(ws_start, it, ws_size); 3044| 19.8k| } 3045| 30.7k| } 3046| | 3047| 30.7k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 65, False: 30.6k] ------------------ 3048| 65| return; 3049| 65| } 3050| 30.7k| } 3051| | 3052| 57.8k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [True: 0, Folded] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| 57.8k| else if constexpr (reflection_type) { 3118| 57.8k| static_assert(bool(hash_info.type)); 3119| | 3120| 57.8k| if (*it != '"') [[unlikely]] { ------------------ | Branch (3120:23): [True: 784, False: 57.1k] ------------------ 3121| 784| ctx.error = error_code::expected_quote; 3122| 784| return; 3123| 784| } 3124| 57.1k| ++it; 3125| 57.1k| if constexpr (not Opts.null_terminated) { 3126| 57.1k| if (it == end) [[unlikely]] { ------------------ | Branch (3126:26): [True: 52, False: 57.0k] ------------------ 3127| 52| ctx.error = error_code::unexpected_end; 3128| 52| return; 3129| 52| } 3130| 57.1k| } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| 57.1k| else { 3181| 57.1k| parse_and_invoke(value, ctx, it, end); 3182| 57.1k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3182:26): [True: 25.5k, False: 31.5k] ------------------ 3183| 25.5k| return; 3184| 57.1k| } 3185| | } 3186| | else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| | auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| | else { 3200| | parse::op()>(value[key], ctx, it, end); 3201| | } 3202| | }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| | using Key = typename T::key_type; 3206| | if constexpr (std::is_same_v) { 3207| | ctx.scratch.clear(); 3208| | parse::op(ctx.scratch, ctx, it, end); 3209| | if (bool(ctx.error)) [[unlikely]] 3210| | return; 3211| | 3212| | if (parse_ws_colon(ctx, it, end)) { 3213| | return; 3214| | } 3215| | 3216| | reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| | if (bool(ctx.error)) [[unlikely]] 3223| | return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| | } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 57.8k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 147, False: 57.7k] ------------------ 3294| 147| return; 3295| 147| } 3296| 57.8k| } 3297| 44.4k| } 3298| 44.4k| } _ZZN3glz4fromILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 27.3k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 27.3k| else { 2901| 27.3k| return nullptr; 2902| 27.3k| } 2903| 27.3k| }(); _ZZN3glz4fromILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 27.3k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 27.3k| else { 2936| 27.3k| return nullptr; 2937| 27.3k| } 2938| 27.3k| }()}; _ZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_: 382| 61.4k| { 383| 61.4k| constexpr auto N = reflect::size; 384| | 385| | if constexpr (N == 1) { 386| | decode_index(value, ctx, it, end, selected_index...); 387| | } 388| | else if constexpr (check_linear_search(Opts)) { 389| | // Linear search path 390| | auto key_start = it; 391| | const auto index = decode_linear(ctx, it, end); 392| | if (bool(ctx.error)) [[unlikely]] 393| | return; 394| | 395| | if (index >= N) [[unlikely]] { 396| | if constexpr (Opts.error_on_unknown_keys) { 397| | ctx.error = error_code::unknown_key; 398| | return; 399| | } 400| | else { 401| | // it sits one past the closing quote, so the raw key spans [key_start, it - 1) 402| | if (validate_utf8_span(ctx, key_start, it - 1)) [[unlikely]] { 403| | return; 404| | } 405| | const sv key{key_start, size_t(it - key_start - 1)}; 406| | if constexpr (not Opts.null_terminated) { 407| | if (it == end) [[unlikely]] { 408| | ctx.error = error_code::unexpected_end; 409| | return; 410| | } 411| | } 412| | if (parse_ws_colon(ctx, it, end)) { 413| | return; 414| | } 415| | parse::handle_unknown(key, value, ctx, it, end); 416| | return; 417| | } 418| | } 419| | 420| | if constexpr (not Opts.null_terminated) { 421| | if (it == end) [[unlikely]] { 422| | ctx.error = error_code::unexpected_end; 423| | return; 424| | } 425| | } 426| | if (skip_ws(ctx, it, end)) { 427| | return; 428| | } 429| | if (match_invalid_end<':', Opts>(ctx, it, end)) { 430| | return; 431| | } 432| | if (skip_ws(ctx, it, end)) { 433| | return; 434| | } 435| | 436| | // Fold expression dispatch - avoids jump table overhead for smaller binary size. 437| | // For linear_search, pass Opts through to the field parser to avoid duplicate template 438| | // instantiations; the whitespace before the value has already been skipped either way. 439| | [&](std::index_sequence) { 440| | (void)(((index == Is ? (decode_field_value(value, ctx, it, end, selected_index...), true) 441| | : false) || 442| | ...)); 443| | }(std::make_index_sequence{}); 444| | } 445| 61.4k| else { 446| | // Hash-based lookup 447| 61.4k| constexpr auto& HashInfo = hash_info; 448| 61.4k| constexpr auto type = HashInfo.type; 449| 61.4k| static_assert(bool(type), "invalid hash algorithm"); 450| | 451| 61.4k| const auto index = decode_hash::op(it, end); 452| | 453| 61.4k| if (index >= N) [[unlikely]] { ------------------ | Branch (453:14): [True: 0, False: 61.4k] ------------------ 454| 0| if constexpr (Opts.error_on_unknown_keys) { 455| 0| ctx.error = error_code::unknown_key; 456| 0| return; 457| | } 458| | else { 459| | auto start = it; 460| | skip_string_view(ctx, it, end); 461| | if (bool(ctx.error)) [[unlikely]] 462| | return; 463| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 464| | return; 465| | const sv key = {start, size_t(it - start)}; 466| | ++it; // skip the quote 467| | if constexpr (not Opts.null_terminated) { 468| | if (it == end) [[unlikely]] { 469| | ctx.error = error_code::unexpected_end; 470| | return; 471| | } 472| | } 473| | if (parse_ws_colon(ctx, it, end)) { 474| | return; 475| | } 476| | parse::handle_unknown(key, value, ctx, it, end); 477| | return; 478| | } 479| 0| } 480| | 481| 61.4k| if constexpr (N == 2) { 482| 61.4k| if (index == 0) { ------------------ | Branch (482:17): [True: 20.4k, False: 41.0k] ------------------ 483| 20.4k| decode_index(value, ctx, it, end, selected_index...); 484| 20.4k| } 485| 41.0k| else { 486| 41.0k| decode_index(value, ctx, it, end, selected_index...); 487| 41.0k| } 488| | } 489| | else { 490| | visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); 491| | } 492| 61.4k| } 493| 61.4k| } _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 20.4k| { 313| 20.4k| static constexpr auto Key = get(reflect::keys); 314| 20.4k| static constexpr auto KeyWithEndQuote = join_v>; 315| 20.4k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 20.4k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 20.4k, False: 28] | Branch (321:52): [True: 20.3k, False: 56] ------------------ 322| 20.3k| it += Length; 323| 20.3k| if constexpr (not Opts.null_terminated) { 324| 20.3k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 20.3k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 20.3k| } 329| | 330| 20.3k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 26, False: 20.3k] ------------------ 331| 26| return; 332| 26| } 333| 20.3k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 41, False: 20.3k] ------------------ 334| 41| return; 335| 41| } 336| 20.3k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 25, False: 20.2k] ------------------ 337| 25| return; 338| 25| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 20.2k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 20.2k| } 343| 84| else [[unlikely]] { 344| 84| decode_index_unknown_key(value, ctx, it, end); 345| 84| } 346| 20.4k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz5pointELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 20.2k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 20.2k| else { 274| 20.2k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 20.2k| else { 298| 20.2k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 20.2k| it, end); 300| 20.2k| } 301| 20.2k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 20.2k| } _ZN3glz4fromILj10EdE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERPKcRdTkNS_10is_contextERNS_7contextES5_EEvOT1_OT2_OT0_T3_: 763| 227k| { 764| | if constexpr (check_quoted_num(Opts)) { 765| | if (skip_ws(ctx, it, end)) { 766| | return; 767| | } 768| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 769| | return; 770| | } 771| | } 772| | 773| | if constexpr (!check_ws_handled(Opts)) { 774| | if (skip_ws(ctx, it, end)) { 775| | return; 776| | } 777| | } 778| | 779| 227k| using V = std::decay_t; 780| | if constexpr (int_t) { 781| | static_assert(sizeof(*it) == sizeof(char)); 782| | 783| | if constexpr (Opts.null_terminated) { 784| | if (not glz::atoi(value, it)) [[unlikely]] { 785| | ctx.error = error_code::parse_number_failure; 786| | return; 787| | } 788| | } 789| | else { 790| | if (not glz::atoi(value, it, end)) [[unlikely]] { 791| | ctx.error = error_code::parse_number_failure; 792| | return; 793| | } 794| | } 795| | } 796| 227k| else { 797| |// float128_t requires std::from_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 798| 227k|#if !defined(_LIBCPP_VERSION) || defined(_LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT) 799| | if constexpr (is_float128) { 800| | auto [ptr, ec] = std::from_chars(it, end, value); 801| | if (ec != std::errc()) { 802| | ctx.error = error_code::parse_number_failure; 803| | return; 804| | } 805| | it = ptr; 806| | } 807| | else 808| |#endif 809| 227k| { 810| | if constexpr (std::is_volatile_v>) { 811| | // Hardware may interact with value changes, so we parse into a temporary and assign in one 812| | // place 813| | V temp; 814| | if constexpr (is_size_optimized(Opts)) { 815| | auto [ptr, ec] = simple_float::from_chars(it, end, temp); 816| | if (ec != std::errc{}) [[unlikely]] { 817| | ctx.error = error_code::parse_number_failure; 818| | return; 819| | } 820| | it = ptr; 821| | } 822| | else { 823| | auto [ptr, ec] = glz::from_chars(it, end, temp); 824| | if (ec != std::errc()) [[unlikely]] { 825| | ctx.error = error_code::parse_number_failure; 826| | return; 827| | } 828| | it = ptr; 829| | } 830| | value = temp; 831| | } 832| 227k| else { 833| | if constexpr (is_size_optimized(Opts)) { 834| | auto [ptr, ec] = simple_float::from_chars(it, end, value); 835| | if (ec != std::errc{}) [[unlikely]] { 836| | ctx.error = error_code::parse_number_failure; 837| | return; 838| | } 839| | it = ptr; 840| | } 841| 227k| else { 842| 227k| auto [ptr, ec] = glz::from_chars(it, end, value); 843| 227k| if (ec != std::errc()) [[unlikely]] { ------------------ | Branch (843:26): [True: 741, False: 226k] ------------------ 844| 741| ctx.error = error_code::parse_number_failure; 845| 741| return; 846| 741| } 847| 226k| it = ptr; 848| 226k| } 849| 227k| } 850| 227k| } 851| 227k| } 852| | 853| | if constexpr (check_quoted_num(Opts)) { 854| | if constexpr (not Opts.null_terminated) { 855| | if (it == end) [[unlikely]] { 856| | ctx.error = error_code::unexpected_end; 857| | return; 858| | } 859| | } 860| | if (match<'"'>(ctx, it)) { 861| | return; 862| | } 863| | if constexpr (not Opts.null_terminated) { 864| | if (it == end) { 865| | ctx.error = error_code::end_reached; 866| | return; 867| | } 868| | } 869| | } 870| 227k| else { 871| 227k| if constexpr (not Opts.null_terminated) { 872| 227k| if (it == end) { ------------------ | Branch (872:20): [True: 1.93k, False: 225k] ------------------ 873| 1.93k| ctx.error = error_code::end_reached; 874| 1.93k| return; 875| 1.93k| } 876| 227k| } 877| 227k| } 878| 227k| } _ZN3glz24decode_index_unknown_keyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointERS3_TkNS_10is_contextERNS_7contextERPKcS8_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT2_OT3_T4_: 177| 24.2k| { 178| 24.2k| if constexpr (Opts.error_on_unknown_keys) { 179| 24.2k| ctx.error = error_code::unknown_key; 180| | } 181| | else { 182| | auto* start = it; 183| | uint64_t ascii_acc{}; 184| | skip_string_view(ctx, it, end, ascii_acc); 185| | if (bool(ctx.error)) [[unlikely]] 186| | return; 187| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 188| | return; 189| | const sv key = {start, size_t(it - start)}; 190| | ++it; 191| | if constexpr (not Opts.null_terminated) { 192| | if (it == end) [[unlikely]] { 193| | ctx.error = error_code::unexpected_end; 194| | return; 195| | } 196| | } 197| | 198| | if (parse_ws_colon(ctx, it, end)) { 199| | return; 200| | } 201| | 202| | parse::handle_unknown(key, value, ctx, it, end); 203| | } 204| 24.2k| } _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointELm1ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 41.0k| { 313| 41.0k| static constexpr auto Key = get(reflect::keys); 314| 41.0k| static constexpr auto KeyWithEndQuote = join_v>; 315| 41.0k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 41.0k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 40.7k, False: 253] | Branch (321:52): [True: 16.8k, False: 23.9k] ------------------ 322| 16.8k| it += Length; 323| 16.8k| if constexpr (not Opts.null_terminated) { 324| 16.8k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 16.8k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 16.8k| } 329| | 330| 16.8k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 26, False: 16.8k] ------------------ 331| 26| return; 332| 26| } 333| 16.8k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 75, False: 16.7k] ------------------ 334| 75| return; 335| 75| } 336| 16.7k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 26, False: 16.7k] ------------------ 337| 26| return; 338| 26| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 16.7k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 16.7k| } 343| 24.1k| else [[unlikely]] { 344| 24.1k| decode_index_unknown_key(value, ctx, it, end); 345| 24.1k| } 346| 41.0k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz5pointELm1ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 16.7k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 16.7k| else { 274| 16.7k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 16.7k| else { 298| 16.7k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 16.7k| it, end); 300| 16.7k| } 301| 16.7k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 16.7k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz6nestedETkNS_10is_contextERNS_7contextERPKcSA_EEvOT0_OT1_OT2_T3_: 49| 29.9k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 29.9k| else { 60| 29.9k| using V = std::remove_cvref_t; 61| 29.9k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 29.9k| end); 63| 29.9k| } 64| 29.9k| } _ZN3glz4fromILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_: 2791| 29.9k| { 2792| 29.9k| static constexpr auto num_members = reflect::size; 2793| | 2794| 29.9k| static constexpr auto Opts = opening_handled_off()>(); 2795| 29.9k| if constexpr (!check_opening_handled(Options)) { 2796| 29.9k| if constexpr (!check_ws_handled(Options)) { 2797| 29.9k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2797:20): [True: 83, False: 29.8k] ------------------ 2798| 83| return; 2799| 83| } 2800| 29.9k| } 2801| 29.9k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 11.3k, False: 18.6k] ------------------ 2802| 11.3k| return; 2803| 11.3k| } 2804| 18.6k| if constexpr (not Opts.null_terminated) { 2805| 18.6k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 18.6k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 18.6k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 18.6k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 18.6k] ------------------ 2813| 0| return; 2814| 0| } 2815| 18.6k| } 2816| 18.6k| const auto ws_start = it; 2817| 29.9k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 58, False: 29.8k] ------------------ 2818| 58| return; 2819| 58| } 2820| 29.8k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 29.8k| else { 2895| 29.8k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 29.8k| if constexpr ((glaze_object_t || reflectable) && 2897| 29.8k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 29.8k| return bit_array{}; 2899| 29.8k| } 2900| 29.8k| else { 2901| 29.8k| return nullptr; 2902| 29.8k| } 2903| 29.8k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 29.8k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 29.8k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 29.8k| return has_includer_member; 2915| 29.8k| } 2916| 29.8k| else { 2917| 29.8k| return false; 2918| 29.8k| } 2919| 29.8k| }(); 2920| 29.8k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 29.8k| [[maybe_unused]] const std::conditional_t>, 2930| 29.8k| inert_key_bits_scope> published_bits{ 2931| 29.8k| ctx, [&]() -> void* { 2932| 29.8k| if constexpr (tracks_include_keys) { 2933| 29.8k| return &fields; 2934| 29.8k| } 2935| 29.8k| else { 2936| 29.8k| return nullptr; 2937| 29.8k| } 2938| 29.8k| }()}; 2939| | 2940| 29.8k| size_t read_count{}; // for partial_read 2941| | 2942| 29.8k| bool first = true; 2943| 59.1k| while (true) { ------------------ | Branch (2943:20): [True: 30.1k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 30.1k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 541, False: 29.6k] ------------------ 2981| 541| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| 541| if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| 541| } 3017| 541| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 541| if constexpr (not Opts.null_terminated) { 3019| 541| if (it == end) { ------------------ | Branch (3019:26): [True: 324, False: 217] ------------------ 3020| 324| ctx.error = error_code::end_reached; 3021| 324| return; 3022| 324| } 3023| 541| } 3024| 217| return; 3025| 541| } 3026| 29.6k| else if (first) { ------------------ | Branch (3026:25): [True: 18.3k, False: 11.2k] ------------------ 3027| 18.3k| first = false; 3028| 18.3k| } 3029| 11.2k| else { 3030| 11.2k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 123, False: 11.1k] ------------------ 3031| 123| return; 3032| 123| } 3033| 11.1k| if constexpr (not Opts.null_terminated) { 3034| 11.1k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 11.1k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 11.1k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| 11.1k| (!Opts.comments)) { 3042| 11.1k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (3042:26): [True: 9.99k, False: 1.11k] | Branch (3042:37): [True: 9.89k, False: 98] ------------------ 3043| 9.89k| skip_matching_ws(ws_start, it, ws_size); 3044| 9.89k| } 3045| 11.1k| } 3046| | 3047| 11.1k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 50, False: 11.0k] ------------------ 3048| 50| return; 3049| 50| } 3050| 11.1k| } 3051| | 3052| 29.4k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [True: 0, Folded] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| 29.4k| else if constexpr (reflection_type) { 3118| 29.4k| static_assert(bool(hash_info.type)); 3119| | 3120| 29.4k| if (*it != '"') [[unlikely]] { ------------------ | Branch (3120:23): [True: 684, False: 28.7k] ------------------ 3121| 684| ctx.error = error_code::expected_quote; 3122| 684| return; 3123| 684| } 3124| 28.7k| ++it; 3125| 28.7k| if constexpr (not Opts.null_terminated) { 3126| 28.7k| if (it == end) [[unlikely]] { ------------------ | Branch (3126:26): [True: 26, False: 28.7k] ------------------ 3127| 26| ctx.error = error_code::unexpected_end; 3128| 26| return; 3129| 26| } 3130| 28.7k| } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| 28.7k| else { 3181| 28.7k| parse_and_invoke(value, ctx, it, end); 3182| 28.7k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3182:26): [True: 16.8k, False: 11.8k] ------------------ 3183| 16.8k| return; 3184| 28.7k| } 3185| | } 3186| | else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| | auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| | else { 3200| | parse::op()>(value[key], ctx, it, end); 3201| | } 3202| | }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| | using Key = typename T::key_type; 3206| | if constexpr (std::is_same_v) { 3207| | ctx.scratch.clear(); 3208| | parse::op(ctx.scratch, ctx, it, end); 3209| | if (bool(ctx.error)) [[unlikely]] 3210| | return; 3211| | 3212| | if (parse_ws_colon(ctx, it, end)) { 3213| | return; 3214| | } 3215| | 3216| | reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| | if (bool(ctx.error)) [[unlikely]] 3223| | return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| | } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 29.4k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 147, False: 29.3k] ------------------ 3294| 147| return; 3295| 147| } 3296| 29.4k| } 3297| 29.8k| } 3298| 29.8k| } _ZZN3glz4fromILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 18.4k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 18.4k| else { 2901| 18.4k| return nullptr; 2902| 18.4k| } 2903| 18.4k| }(); _ZZN3glz4fromILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 18.4k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 18.4k| else { 2936| 18.4k| return nullptr; 2937| 18.4k| } 2938| 18.4k| }()}; _ZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6nestedERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_: 382| 31.7k| { 383| 31.7k| constexpr auto N = reflect::size; 384| | 385| | if constexpr (N == 1) { 386| | decode_index(value, ctx, it, end, selected_index...); 387| | } 388| | else if constexpr (check_linear_search(Opts)) { 389| | // Linear search path 390| | auto key_start = it; 391| | const auto index = decode_linear(ctx, it, end); 392| | if (bool(ctx.error)) [[unlikely]] 393| | return; 394| | 395| | if (index >= N) [[unlikely]] { 396| | if constexpr (Opts.error_on_unknown_keys) { 397| | ctx.error = error_code::unknown_key; 398| | return; 399| | } 400| | else { 401| | // it sits one past the closing quote, so the raw key spans [key_start, it - 1) 402| | if (validate_utf8_span(ctx, key_start, it - 1)) [[unlikely]] { 403| | return; 404| | } 405| | const sv key{key_start, size_t(it - key_start - 1)}; 406| | if constexpr (not Opts.null_terminated) { 407| | if (it == end) [[unlikely]] { 408| | ctx.error = error_code::unexpected_end; 409| | return; 410| | } 411| | } 412| | if (parse_ws_colon(ctx, it, end)) { 413| | return; 414| | } 415| | parse::handle_unknown(key, value, ctx, it, end); 416| | return; 417| | } 418| | } 419| | 420| | if constexpr (not Opts.null_terminated) { 421| | if (it == end) [[unlikely]] { 422| | ctx.error = error_code::unexpected_end; 423| | return; 424| | } 425| | } 426| | if (skip_ws(ctx, it, end)) { 427| | return; 428| | } 429| | if (match_invalid_end<':', Opts>(ctx, it, end)) { 430| | return; 431| | } 432| | if (skip_ws(ctx, it, end)) { 433| | return; 434| | } 435| | 436| | // Fold expression dispatch - avoids jump table overhead for smaller binary size. 437| | // For linear_search, pass Opts through to the field parser to avoid duplicate template 438| | // instantiations; the whitespace before the value has already been skipped either way. 439| | [&](std::index_sequence) { 440| | (void)(((index == Is ? (decode_field_value(value, ctx, it, end, selected_index...), true) 441| | : false) || 442| | ...)); 443| | }(std::make_index_sequence{}); 444| | } 445| 31.7k| else { 446| | // Hash-based lookup 447| 31.7k| constexpr auto& HashInfo = hash_info; 448| 31.7k| constexpr auto type = HashInfo.type; 449| 31.7k| static_assert(bool(type), "invalid hash algorithm"); 450| | 451| 31.7k| const auto index = decode_hash::op(it, end); 452| | 453| 31.7k| if (index >= N) [[unlikely]] { ------------------ | Branch (453:14): [True: 0, False: 31.7k] ------------------ 454| 0| if constexpr (Opts.error_on_unknown_keys) { 455| 0| ctx.error = error_code::unknown_key; 456| 0| return; 457| | } 458| | else { 459| | auto start = it; 460| | skip_string_view(ctx, it, end); 461| | if (bool(ctx.error)) [[unlikely]] 462| | return; 463| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 464| | return; 465| | const sv key = {start, size_t(it - start)}; 466| | ++it; // skip the quote 467| | if constexpr (not Opts.null_terminated) { 468| | if (it == end) [[unlikely]] { 469| | ctx.error = error_code::unexpected_end; 470| | return; 471| | } 472| | } 473| | if (parse_ws_colon(ctx, it, end)) { 474| | return; 475| | } 476| | parse::handle_unknown(key, value, ctx, it, end); 477| | return; 478| | } 479| 0| } 480| | 481| 31.7k| if constexpr (N == 2) { 482| 31.7k| if (index == 0) { ------------------ | Branch (482:17): [True: 292, False: 31.4k] ------------------ 483| 292| decode_index(value, ctx, it, end, selected_index...); 484| 292| } 485| 31.4k| else { 486| 31.4k| decode_index(value, ctx, it, end, selected_index...); 487| 31.4k| } 488| | } 489| | else { 490| | visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); 491| | } 492| 31.7k| } 493| 31.7k| } _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6nestedELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 292| { 313| 292| static constexpr auto Key = get(reflect::keys); 314| 292| static constexpr auto KeyWithEndQuote = join_v>; 315| 292| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 292| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 278, False: 14] | Branch (321:52): [True: 0, False: 278] ------------------ 322| 0| it += Length; 323| 0| if constexpr (not Opts.null_terminated) { 324| 0| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 0] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 0| } 329| | 330| 0| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 0, False: 0] ------------------ 331| 0| return; 332| 0| } 333| 0| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 0, False: 0] ------------------ 334| 0| return; 335| 0| } 336| 0| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 0, False: 0] ------------------ 337| 0| return; 338| 0| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 0| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 0| } 343| 292| else [[unlikely]] { 344| 292| decode_index_unknown_key(value, ctx, it, end); 345| 292| } 346| 292| } _ZN3glz24decode_index_unknown_keyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6nestedERS3_TkNS_10is_contextERNS_7contextERPKcS8_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT2_OT3_T4_: 177| 16.3k| { 178| 16.3k| if constexpr (Opts.error_on_unknown_keys) { 179| 16.3k| ctx.error = error_code::unknown_key; 180| | } 181| | else { 182| | auto* start = it; 183| | uint64_t ascii_acc{}; 184| | skip_string_view(ctx, it, end, ascii_acc); 185| | if (bool(ctx.error)) [[unlikely]] 186| | return; 187| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 188| | return; 189| | const sv key = {start, size_t(it - start)}; 190| | ++it; 191| | if constexpr (not Opts.null_terminated) { 192| | if (it == end) [[unlikely]] { 193| | ctx.error = error_code::unexpected_end; 194| | return; 195| | } 196| | } 197| | 198| | if (parse_ws_colon(ctx, it, end)) { 199| | return; 200| | } 201| | 202| | parse::handle_unknown(key, value, ctx, it, end); 203| | } 204| 16.3k| } _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6nestedELm1ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 31.4k| { 313| 31.4k| static constexpr auto Key = get(reflect::keys); 314| 31.4k| static constexpr auto KeyWithEndQuote = join_v>; 315| 31.4k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 31.4k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 30.4k, False: 959] | Branch (321:52): [True: 15.3k, False: 15.0k] ------------------ 322| 15.3k| it += Length; 323| 15.3k| if constexpr (not Opts.null_terminated) { 324| 15.3k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 15.3k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 15.3k| } 329| | 330| 15.3k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 31, False: 15.3k] ------------------ 331| 31| return; 332| 31| } 333| 15.3k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 47, False: 15.2k] ------------------ 334| 47| return; 335| 47| } 336| 15.2k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 37, False: 15.2k] ------------------ 337| 37| return; 338| 37| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 15.2k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 15.2k| } 343| 16.0k| else [[unlikely]] { 344| 16.0k| decode_index_unknown_key(value, ctx, it, end); 345| 16.0k| } 346| 31.4k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz6nestedELm1ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 15.2k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 15.2k| else { 274| 15.2k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 15.2k| else { 298| 15.2k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 15.2k| it, end); 300| 15.2k| } 301| 15.2k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 15.2k| } _ZN3glz4fromILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERPKcSC_S7_TkNS_10is_contextERNS_7contextEEEvRT2_OT3_OT0_T1_: 887| 18.8k| { 888| | if constexpr (check_string_as_number(Opts)) { 889| | auto start = it; 890| | skip_number(ctx, it, end); 891| | if (bool(ctx.error)) [[unlikely]] { 892| | return; 893| | } 894| | if (start == it) [[unlikely]] { 895| | ctx.error = error_code::parse_number_failure; 896| | return; 897| | } 898| | value.append(start, size_t(it - start)); 899| | } 900| 18.8k| else { 901| 18.8k| if constexpr (!check_opening_handled(Opts)) { 902| | if constexpr (!check_ws_handled(Opts)) { 903| | if (skip_ws(ctx, it, end)) { 904| | return; 905| | } 906| | } 907| | 908| 18.8k| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (908:20): [True: 57, False: 18.7k] ------------------ 909| 57| return; 910| 57| } 911| 18.8k| } 912| | 913| 18.8k| if constexpr (not check_raw_string(Opts)) { 914| 18.8k| static constexpr auto string_padding_bytes = 8; 915| | 916| | // How much buffer has to remain for an eight byte load at the cursor to stay inside 917| | // it. One on a padded input, where the last chunk is free to straddle the end of the 918| | // document, so the byte tails below are unreachable; eight otherwise, which costs the 919| | // final bytes of the buffer their chunked path and nothing else. 920| 18.8k| const std::ptrdiff_t scan_min = chunk_min<8>(ctx.padded_input); 921| | 922| 18.8k| if (size_t(end - it) >= 8) { ------------------ | Branch (922:20): [True: 17.8k, False: 990] ------------------ 923| | // The bound as a pointer, so the loops below spend a compare per chunk rather 924| | // than a subtract and a compare. Well defined here and nowhere else in this 925| | // reader: the branch has just established that at least eight bytes remain, and 926| | // `scan_min` is at most eight. 927| 17.8k| const auto* const chunk_limit = end - scan_min; 928| | 929| 17.8k| auto start = it; 930| 17.8k| uint64_t ascii_acc{}; 931| 10.7M| while (it <= chunk_limit) { ------------------ | Branch (931:26): [True: 10.7M, False: 934] ------------------ 932| 10.7M| uint64_t chunk; 933| 10.7M| std::memcpy(&chunk, it, 8); 934| | if constexpr (std::endian::native == std::endian::big) { 935| | chunk = std::byteswap(chunk); 936| | } 937| 10.7M| ascii_acc |= chunk; 938| 10.7M| const uint64_t test_chars = has_quote(chunk); 939| 10.7M| if (test_chars) { ------------------ | Branch (939:26): [True: 19.2k, False: 10.6M] ------------------ 940| 19.2k| it += (countr_zero(test_chars) >> 3); 941| | 942| 19.2k| auto* prev = it - 1; 943| 51.7k| while (*prev == '\\') { ------------------ | Branch (943:32): [True: 32.5k, False: 19.2k] ------------------ 944| 32.5k| --prev; 945| 32.5k| } 946| 19.2k| if (size_t(it - prev) % 2) { ------------------ | Branch (946:29): [True: 16.8k, False: 2.31k] ------------------ 947| 16.8k| goto continue_decode; 948| 16.8k| } 949| 2.31k| ++it; // skip the escaped quote 950| 2.31k| } 951| 10.6M| else { 952| 10.6M| it += 8; 953| 10.6M| } 954| 10.7M| } 955| | 956| 2.14k| while (it[-1] == '\\') [[unlikely]] { ------------------ | Branch (956:26): [True: 1.20k, False: 934] ------------------ 957| | // if we ended on an escape character then we need to rewind 958| | // because we lost our context 959| 1.20k| --it; 960| 1.20k| } 961| | 962| | // The byte-wise tail keeps feeding the accumulator: it has to cover every byte of 963| | // the string, or a non-ASCII byte reached here would be waved through unvalidated. 964| 4.54k| for (; it < end; ++it) { ------------------ | Branch (964:26): [True: 4.45k, False: 93] ------------------ 965| 4.45k| ascii_acc |= uint8_t(*it); 966| 4.45k| if (*it == '"') { ------------------ | Branch (966:26): [True: 892, False: 3.55k] ------------------ 967| 892| auto* prev = it - 1; 968| 1.56k| while (*prev == '\\') { ------------------ | Branch (968:32): [True: 677, False: 892] ------------------ 969| 677| --prev; 970| 677| } 971| 892| if (size_t(it - prev) % 2) { ------------------ | Branch (971:29): [True: 841, False: 51] ------------------ 972| 841| goto continue_decode; 973| 841| } 974| 892| } 975| 4.45k| } 976| | 977| 93| ctx.error = error_code::unexpected_end; 978| 93| return; 979| | 980| 17.7k| continue_decode: 981| | 982| 17.7k| if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] { ------------------ | Branch (982:23): [True: 282, False: 17.4k] ------------------ 983| 282| return; 984| 282| } 985| | 986| 17.4k| auto n = size_t(it - start); 987| | 988| | // The padding lets the chunked copy below run up to the closing quote. Skip it when it 989| | // would be the only reason to allocate, as for a string that fits the small string 990| | // buffer but not with eight bytes to spare. 991| 17.4k| bool pad = true; 992| 17.4k| if constexpr (requires { value.capacity(); }) { 993| 17.4k| const auto capacity = size_t(value.capacity()); 994| 17.4k| pad = capacity >= n + string_padding_bytes || capacity < n; ------------------ | Branch (994:28): [True: 14.7k, False: 2.71k] | Branch (994:68): [True: 1.79k, False: 921] ------------------ 995| 17.4k| } 996| 17.4k| resize_unfilled(value, pad ? n + string_padding_bytes : n); ------------------ | Branch (996:42): [True: 16.5k, False: 921] ------------------ 997| | 998| 17.4k| auto* p = value.data(); 999| | 1000| | // An error below returns with the tail of `value` still unwritten. Leave the size at 1001| | // what was actually written rather than at the padded length, which resize_unfilled 1002| | // did not fill. 1003| 17.4k| auto* const written_begin = p; 1004| | 1005| | // Without the padding, copy a chunk only while eight bytes remain before the quote. 1006| | // Unescaping never puts the output ahead of the input, so no store lands past the end. 1007| 17.4k| const auto* const copy_end = pad ? it : it - (std::min)(n, size_t(7)); ------------------ | Branch (1007:48): [True: 16.5k, False: 921] ------------------ 1008| | 1009| | // Copy eight bytes at a time for as long as eight bytes are there to read, then 1010| | // finish the span below. The chunked form reads past the character it is looking 1011| | // at, so on an unpadded buffer it has to stop short of the end; splitting it this 1012| | // way keeps it for the body of every string rather than giving it up whenever the 1013| | // string happens to finish near the end of the buffer -- which, for a document 1014| | // that is itself one string, is every string. 1015| 8.39M| while (start < copy_end && start <= chunk_limit) { ------------------ | Branch (1015:26): [True: 8.38M, False: 12.0k] | Branch (1015:46): [True: 8.38M, False: 449] ------------------ 1016| 8.38M| std::memcpy(p, start, 8); 1017| 8.38M| uint64_t swar; 1018| 8.38M| std::memcpy(&swar, p, 8); 1019| | if constexpr (std::endian::native == std::endian::big) { 1020| | swar = std::byteswap(swar); 1021| | } 1022| | 1023| 8.38M| constexpr uint64_t lo7_mask = repeat_byte8(0b01111111); 1024| 8.38M| const uint64_t lo7 = swar & lo7_mask; 1025| 8.38M| const uint64_t backslash = (lo7 ^ repeat_byte8('\\')) + lo7_mask; 1026| 8.38M| const uint64_t less_32 = (swar & repeat_byte8(0b01100000)) + lo7_mask; 1027| 8.38M| uint64_t next = ~((backslash & less_32) | swar); 1028| | 1029| 8.38M| next &= repeat_byte8(0b10000000); 1030| 8.38M| if (next == 0) { ------------------ | Branch (1030:26): [True: 8.33M, False: 48.5k] ------------------ 1031| 8.33M| start += 8; 1032| 8.33M| p += 8; 1033| 8.33M| continue; 1034| 8.33M| } 1035| | 1036| 48.5k| next = countr_zero(next) >> 3; 1037| 48.5k| start += next; 1038| 48.5k| if (start >= it) { ------------------ | Branch (1038:26): [True: 4.57k, False: 44.0k] ------------------ 1039| 4.57k| break; 1040| 4.57k| } 1041| | 1042| 44.0k| if ((*start & 0b11100000) == 0) [[unlikely]] { ------------------ | Branch (1042:26): [True: 150, False: 43.8k] ------------------ 1043| 150| ctx.error = error_code::syntax_error; 1044| 150| value.resize(size_t(p - written_begin)); 1045| 150| return; 1046| 150| } 1047| 43.8k| ++start; // skip the escape 1048| 43.8k| if (*start == 'u') { ------------------ | Branch (1048:26): [True: 8.68k, False: 35.1k] ------------------ 1049| 8.68k| ++start; 1050| 8.68k| p += next; 1051| 8.68k| const auto mark = start; 1052| 8.68k| const auto decoded = handle_unicode_code_point(start, p, end); 1053| 8.68k| if (decoded.written == 0) [[unlikely]] { ------------------ | Branch (1053:29): [True: 173, False: 8.51k] ------------------ 1054| 173| ctx.error = decoded.truncated ? error_code::unexpected_end ------------------ | Branch (1054:40): [True: 0, False: 173] ------------------ 1055| 173| : error_code::unicode_escape_conversion_failure; 1056| 173| value.resize(size_t(p - written_begin)); 1057| 173| return; 1058| 173| } 1059| 8.51k| n += decoded.written; 1060| | // escape + u + unicode code points 1061| 8.51k| n -= 2 + uint32_t(start - mark); 1062| 8.51k| } 1063| 35.1k| else { 1064| 35.1k| p += next; 1065| 35.1k| *p = char_unescape_table[uint8_t(*start)]; 1066| 35.1k| if (*p == 0) [[unlikely]] { ------------------ | Branch (1066:29): [True: 32, False: 35.1k] ------------------ 1067| 32| ctx.error = error_code::invalid_escape; 1068| 32| value.resize(size_t(p - written_begin)); 1069| 32| return; 1070| 32| } 1071| 35.1k| ++p; 1072| 35.1k| ++start; 1073| 35.1k| --n; 1074| 35.1k| } 1075| 43.8k| } 1076| | 1077| | // Whatever the chunked copy could not reach. `p` and `start` stay in step across 1078| | // that loop, so this picks up exactly where it stopped. 1079| 22.1k| while (start < it) { ------------------ | Branch (1079:26): [True: 5.19k, False: 16.9k] ------------------ 1080| 5.19k| if ((*start & 0b11100000) == 0) [[unlikely]] { ------------------ | Branch (1080:26): [True: 37, False: 5.15k] ------------------ 1081| 37| ctx.error = error_code::syntax_error; 1082| 37| value.resize(size_t(p - written_begin)); 1083| 37| return; 1084| 37| } 1085| 5.15k| if (*start == '\\') { ------------------ | Branch (1085:26): [True: 322, False: 4.83k] ------------------ 1086| 322| ++start; // skip the escape 1087| 322| if (*start == 'u') { ------------------ | Branch (1087:29): [True: 138, False: 184] ------------------ 1088| 138| ++start; 1089| 138| const auto mark = start; 1090| 138| const auto decoded = handle_unicode_code_point(start, p, end); 1091| 138| if (decoded.written == 0) [[unlikely]] { ------------------ | Branch (1091:32): [True: 82, False: 56] ------------------ 1092| 82| ctx.error = decoded.truncated ? error_code::unexpected_end ------------------ | Branch (1092:43): [True: 0, False: 82] ------------------ 1093| 82| : error_code::unicode_escape_conversion_failure; 1094| 82| value.resize(size_t(p - written_begin)); 1095| 82| return; 1096| 82| } 1097| 56| n += decoded.written; 1098| 56| n -= 2 + uint32_t(start - mark); 1099| 56| } 1100| 184| else { 1101| 184| *p = char_unescape_table[uint8_t(*start)]; 1102| 184| if (*p == 0) [[unlikely]] { ------------------ | Branch (1102:32): [True: 12, False: 172] ------------------ 1103| 12| ctx.error = error_code::invalid_escape; 1104| 12| value.resize(size_t(p - written_begin)); 1105| 12| return; 1106| 12| } 1107| 172| ++p; 1108| 172| ++start; 1109| 172| --n; 1110| 172| } 1111| 322| } 1112| 4.83k| else { 1113| 4.83k| *p = *start; 1114| 4.83k| ++p; 1115| 4.83k| ++start; 1116| 4.83k| } 1117| 5.15k| } 1118| | 1119| 16.9k| value.resize(n); 1120| 16.9k| ++it; 1121| 16.9k| } 1122| 990| else { 1123| | // For short strings 1124| | 1125| 990| std::array buffer{}; 1126| | 1127| 990| auto* p = buffer.data(); 1128| 990| const auto* const utf8_start = it; 1129| | 1130| 2.01k| while (it < end) [[likely]] { ------------------ | Branch (1130:26): [True: 1.89k, False: 125] ------------------ 1131| 1.89k| *p = *it; 1132| 1.89k| if (*it == '"') { ------------------ | Branch (1132:26): [True: 730, False: 1.16k] ------------------ 1133| 730| if (validate_utf8_span(ctx, utf8_start, it)) [[unlikely]] { ------------------ | Branch (1133:29): [True: 151, False: 579] ------------------ 1134| 151| return; 1135| 151| } 1136| 579| const size_t n = size_t(p - buffer.data()); 1137| 579|#if __has_cpp_attribute(assume) >= 202207L 1138| 579| [[assume(n <= sizeof(buffer))]]; 1139| 579|#endif 1140| 579| value.assign(buffer.data(), n); 1141| 579| ++it; 1142| 579| if constexpr (not Opts.null_terminated) { 1143| 579| if (it == end) { ------------------ | Branch (1143:32): [True: 128, False: 451] ------------------ 1144| 128| ctx.error = error_code::end_reached; 1145| 128| return; 1146| 128| } 1147| 579| } 1148| 451| return; 1149| 730| } 1150| 1.16k| else if (*it == '\\') { ------------------ | Branch (1150:31): [True: 231, False: 931] ------------------ 1151| | // Bounded whatever `null_terminated` says: a document cut off inside an 1152| | // escape has run out of input, and saying so beats blaming the terminator 1153| | // the cut exposed -- which is what reading on would find, and would report 1154| | // as a malformed escape. 1155| 231| ++it; // skip the escape 1156| 231| if (it == end) [[unlikely]] { ------------------ | Branch (1156:29): [True: 23, False: 208] ------------------ 1157| 23| ctx.error = error_code::unexpected_end; 1158| 23| return; 1159| 23| } 1160| 208| if (*it == 'u') { ------------------ | Branch (1160:29): [True: 142, False: 66] ------------------ 1161| 142| ++it; 1162| 142| if (it == end) [[unlikely]] { ------------------ | Branch (1162:32): [True: 7, False: 135] ------------------ 1163| 7| ctx.error = error_code::unexpected_end; 1164| 7| return; 1165| 7| } 1166| 135| const auto decoded = handle_unicode_code_point(it, p, end); 1167| 135| if (decoded.written == 0) [[unlikely]] { ------------------ | Branch (1167:32): [True: 72, False: 63] ------------------ 1168| 72| ctx.error = decoded.truncated ? error_code::unexpected_end ------------------ | Branch (1168:43): [True: 24, False: 48] ------------------ 1169| 72| : error_code::unicode_escape_conversion_failure; 1170| 72| return; 1171| 72| } 1172| 135| } 1173| 66| else { 1174| 66| *p = char_unescape_table[uint8_t(*it)]; 1175| 66| if (*p == 0) [[unlikely]] { ------------------ | Branch (1175:32): [True: 14, False: 52] ------------------ 1176| 14| ctx.error = error_code::invalid_escape; 1177| 14| return; 1178| 14| } 1179| 52| ++p; 1180| 52| ++it; 1181| 52| } 1182| 208| } 1183| 931| else if ((*it & 0b11100000) == 0) [[unlikely]] { ------------------ | Branch (1183:31): [True: 19, False: 912] ------------------ 1184| 19| ctx.error = error_code::syntax_error; 1185| 19| return; 1186| 19| } 1187| 912| else { 1188| 912| ++it; 1189| 912| ++p; 1190| 912| } 1191| 1.89k| } 1192| | 1193| 125| ctx.error = error_code::unexpected_end; 1194| 125| } 1195| | } 1196| | else { 1197| | // raw_string 1198| | auto start = it; 1199| | skip_string_view(ctx, it, end); 1200| | if (bool(ctx.error)) [[unlikely]] 1201| | return; 1202| | 1203| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] { 1204| | return; 1205| | } 1206| | 1207| | value.assign(start, size_t(it - start)); 1208| | ++it; 1209| | } 1210| 18.8k| } 1211| 18.8k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz8fuzz_apiETkNS_10is_contextERNS_7contextERPKcSA_EEvOT0_OT1_OT2_T3_: 49| 26.0k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 26.0k| else { 60| 26.0k| using V = std::remove_cvref_t; 61| 26.0k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 26.0k| end); 63| 26.0k| } 64| 26.0k| } _ZN3glz4fromILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_: 2791| 26.0k| { 2792| 26.0k| static constexpr auto num_members = reflect::size; 2793| | 2794| 26.0k| static constexpr auto Opts = opening_handled_off()>(); 2795| 26.0k| if constexpr (!check_opening_handled(Options)) { 2796| 26.0k| if constexpr (!check_ws_handled(Options)) { 2797| 26.0k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2797:20): [True: 55, False: 26.0k] ------------------ 2798| 55| return; 2799| 55| } 2800| 26.0k| } 2801| 26.0k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 9.94k, False: 16.1k] ------------------ 2802| 9.94k| return; 2803| 9.94k| } 2804| 16.1k| if constexpr (not Opts.null_terminated) { 2805| 16.1k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 16.1k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 16.1k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 16.1k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 16.1k] ------------------ 2813| 0| return; 2814| 0| } 2815| 16.1k| } 2816| 16.1k| const auto ws_start = it; 2817| 26.0k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 42, False: 26.0k] ------------------ 2818| 42| return; 2819| 42| } 2820| 26.0k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 26.0k| else { 2895| 26.0k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 26.0k| if constexpr ((glaze_object_t || reflectable) && 2897| 26.0k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 26.0k| return bit_array{}; 2899| 26.0k| } 2900| 26.0k| else { 2901| 26.0k| return nullptr; 2902| 26.0k| } 2903| 26.0k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 26.0k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 26.0k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 26.0k| return has_includer_member; 2915| 26.0k| } 2916| 26.0k| else { 2917| 26.0k| return false; 2918| 26.0k| } 2919| 26.0k| }(); 2920| 26.0k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 26.0k| [[maybe_unused]] const std::conditional_t>, 2930| 26.0k| inert_key_bits_scope> published_bits{ 2931| 26.0k| ctx, [&]() -> void* { 2932| 26.0k| if constexpr (tracks_include_keys) { 2933| 26.0k| return &fields; 2934| 26.0k| } 2935| 26.0k| else { 2936| 26.0k| return nullptr; 2937| 26.0k| } 2938| 26.0k| }()}; 2939| | 2940| 26.0k| size_t read_count{}; // for partial_read 2941| | 2942| 26.0k| bool first = true; 2943| 75.1k| while (true) { ------------------ | Branch (2943:20): [True: 49.8k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 49.8k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 58, False: 49.8k] ------------------ 2981| 58| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| 58| if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| 58| } 3017| 58| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 58| if constexpr (not Opts.null_terminated) { 3019| 58| if (it == end) { ------------------ | Branch (3019:26): [True: 17, False: 41] ------------------ 3020| 17| ctx.error = error_code::end_reached; 3021| 17| return; 3022| 17| } 3023| 58| } 3024| 41| return; 3025| 58| } 3026| 49.8k| else if (first) { ------------------ | Branch (3026:25): [True: 15.9k, False: 33.8k] ------------------ 3027| 15.9k| first = false; 3028| 15.9k| } 3029| 33.8k| else { 3030| 33.8k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 538, False: 33.3k] ------------------ 3031| 538| return; 3032| 538| } 3033| 33.3k| if constexpr (not Opts.null_terminated) { 3034| 33.3k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 33.3k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 33.3k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| 33.3k| (!Opts.comments)) { 3042| 33.3k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (3042:26): [True: 20.2k, False: 13.0k] | Branch (3042:37): [True: 19.8k, False: 334] ------------------ 3043| 19.8k| skip_matching_ws(ws_start, it, ws_size); 3044| 19.8k| } 3045| 33.3k| } 3046| | 3047| 33.3k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 57, False: 33.2k] ------------------ 3048| 57| return; 3049| 57| } 3050| 33.3k| } 3051| | 3052| 49.2k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [True: 0, Folded] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| 49.2k| else if constexpr (reflection_type) { 3118| 49.2k| static_assert(bool(hash_info.type)); 3119| | 3120| 49.2k| if (*it != '"') [[unlikely]] { ------------------ | Branch (3120:23): [True: 680, False: 48.5k] ------------------ 3121| 680| ctx.error = error_code::expected_quote; 3122| 680| return; 3123| 680| } 3124| 48.5k| ++it; 3125| 48.5k| if constexpr (not Opts.null_terminated) { 3126| 48.5k| if (it == end) [[unlikely]] { ------------------ | Branch (3126:26): [True: 37, False: 48.5k] ------------------ 3127| 37| ctx.error = error_code::unexpected_end; 3128| 37| return; 3129| 37| } 3130| 48.5k| } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| 48.5k| else { 3181| 48.5k| parse_and_invoke(value, ctx, it, end); 3182| 48.5k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3182:26): [True: 14.5k, False: 34.0k] ------------------ 3183| 14.5k| return; 3184| 48.5k| } 3185| | } 3186| | else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| | auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| | else { 3200| | parse::op()>(value[key], ctx, it, end); 3201| | } 3202| | }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| | using Key = typename T::key_type; 3206| | if constexpr (std::is_same_v) { 3207| | ctx.scratch.clear(); 3208| | parse::op(ctx.scratch, ctx, it, end); 3209| | if (bool(ctx.error)) [[unlikely]] 3210| | return; 3211| | 3212| | if (parse_ws_colon(ctx, it, end)) { 3213| | return; 3214| | } 3215| | 3216| | reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| | if (bool(ctx.error)) [[unlikely]] 3223| | return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| | } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 49.2k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 139, False: 49.0k] ------------------ 3294| 139| return; 3295| 139| } 3296| 49.2k| } 3297| 26.0k| } 3298| 26.0k| } _ZZN3glz4fromILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 16.0k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 16.0k| else { 2901| 16.0k| return nullptr; 2902| 16.0k| } 2903| 16.0k| }(); _ZZN3glz4fromILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 16.0k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 16.0k| else { 2936| 16.0k| return nullptr; 2937| 16.0k| } 2938| 16.0k| }()}; _ZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_: 382| 48.5k| { 383| 48.5k| constexpr auto N = reflect::size; 384| | 385| | if constexpr (N == 1) { 386| | decode_index(value, ctx, it, end, selected_index...); 387| | } 388| | else if constexpr (check_linear_search(Opts)) { 389| | // Linear search path 390| | auto key_start = it; 391| | const auto index = decode_linear(ctx, it, end); 392| | if (bool(ctx.error)) [[unlikely]] 393| | return; 394| | 395| | if (index >= N) [[unlikely]] { 396| | if constexpr (Opts.error_on_unknown_keys) { 397| | ctx.error = error_code::unknown_key; 398| | return; 399| | } 400| | else { 401| | // it sits one past the closing quote, so the raw key spans [key_start, it - 1) 402| | if (validate_utf8_span(ctx, key_start, it - 1)) [[unlikely]] { 403| | return; 404| | } 405| | const sv key{key_start, size_t(it - key_start - 1)}; 406| | if constexpr (not Opts.null_terminated) { 407| | if (it == end) [[unlikely]] { 408| | ctx.error = error_code::unexpected_end; 409| | return; 410| | } 411| | } 412| | if (parse_ws_colon(ctx, it, end)) { 413| | return; 414| | } 415| | parse::handle_unknown(key, value, ctx, it, end); 416| | return; 417| | } 418| | } 419| | 420| | if constexpr (not Opts.null_terminated) { 421| | if (it == end) [[unlikely]] { 422| | ctx.error = error_code::unexpected_end; 423| | return; 424| | } 425| | } 426| | if (skip_ws(ctx, it, end)) { 427| | return; 428| | } 429| | if (match_invalid_end<':', Opts>(ctx, it, end)) { 430| | return; 431| | } 432| | if (skip_ws(ctx, it, end)) { 433| | return; 434| | } 435| | 436| | // Fold expression dispatch - avoids jump table overhead for smaller binary size. 437| | // For linear_search, pass Opts through to the field parser to avoid duplicate template 438| | // instantiations; the whitespace before the value has already been skipped either way. 439| | [&](std::index_sequence) { 440| | (void)(((index == Is ? (decode_field_value(value, ctx, it, end, selected_index...), true) 441| | : false) || 442| | ...)); 443| | }(std::make_index_sequence{}); 444| | } 445| 48.5k| else { 446| | // Hash-based lookup 447| 48.5k| constexpr auto& HashInfo = hash_info; 448| 48.5k| constexpr auto type = HashInfo.type; 449| 48.5k| static_assert(bool(type), "invalid hash algorithm"); 450| | 451| 48.5k| const auto index = decode_hash::op(it, end); 452| | 453| 48.5k| if (index >= N) [[unlikely]] { ------------------ | Branch (453:14): [True: 4.77k, False: 43.7k] ------------------ 454| 4.77k| if constexpr (Opts.error_on_unknown_keys) { 455| 4.77k| ctx.error = error_code::unknown_key; 456| 4.77k| return; 457| | } 458| | else { 459| | auto start = it; 460| | skip_string_view(ctx, it, end); 461| | if (bool(ctx.error)) [[unlikely]] 462| | return; 463| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 464| | return; 465| | const sv key = {start, size_t(it - start)}; 466| | ++it; // skip the quote 467| | if constexpr (not Opts.null_terminated) { 468| | if (it == end) [[unlikely]] { 469| | ctx.error = error_code::unexpected_end; 470| | return; 471| | } 472| | } 473| | if (parse_ws_colon(ctx, it, end)) { 474| | return; 475| | } 476| | parse::handle_unknown(key, value, ctx, it, end); 477| | return; 478| | } 479| 4.77k| } 480| | 481| | if constexpr (N == 2) { 482| | if (index == 0) { 483| | decode_index(value, ctx, it, end, selected_index...); 484| | } 485| | else { 486| | decode_index(value, ctx, it, end, selected_index...); 487| | } 488| | } 489| 48.5k| else { 490| 48.5k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); 491| 48.5k| } 492| 48.5k| } 493| 48.5k| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm0EEEDav: 490| 22.0k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 22.0k| { 313| 22.0k| static constexpr auto Key = get(reflect::keys); 314| 22.0k| static constexpr auto KeyWithEndQuote = join_v>; 315| 22.0k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 22.0k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 21.9k, False: 18] | Branch (321:52): [True: 21.9k, False: 70] ------------------ 322| 21.9k| it += Length; 323| 21.9k| if constexpr (not Opts.null_terminated) { 324| 21.9k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 21.9k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 21.9k| } 329| | 330| 21.9k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 16, False: 21.8k] ------------------ 331| 16| return; 332| 16| } 333| 21.8k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 28, False: 21.8k] ------------------ 334| 28| return; 335| 28| } 336| 21.8k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 18, False: 21.8k] ------------------ 337| 18| return; 338| 18| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 21.8k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 21.8k| } 343| 88| else [[unlikely]] { 344| 88| decode_index_unknown_key(value, ctx, it, end); 345| 88| } 346| 22.0k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 21.8k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 21.8k| else { 274| 21.8k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 21.8k| else { 298| 21.8k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 21.8k| it, end); 300| 21.8k| } 301| 21.8k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 21.8k| } _ZN3glz24decode_index_unknown_keyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_TkNS_10is_contextERNS_7contextERPKcS8_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT2_OT3_T4_: 177| 970| { 178| 970| if constexpr (Opts.error_on_unknown_keys) { 179| 970| ctx.error = error_code::unknown_key; 180| | } 181| | else { 182| | auto* start = it; 183| | uint64_t ascii_acc{}; 184| | skip_string_view(ctx, it, end, ascii_acc); 185| | if (bool(ctx.error)) [[unlikely]] 186| | return; 187| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 188| | return; 189| | const sv key = {start, size_t(it - start)}; 190| | ++it; 191| | if constexpr (not Opts.null_terminated) { 192| | if (it == end) [[unlikely]] { 193| | ctx.error = error_code::unexpected_end; 194| | return; 195| | } 196| | } 197| | 198| | if (parse_ws_colon(ctx, it, end)) { 199| | return; 200| | } 201| | 202| | parse::handle_unknown(key, value, ctx, it, end); 203| | } 204| 970| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm1EEEDav: 490| 518| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm1ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 518| { 313| 518| static constexpr auto Key = get(reflect::keys); 314| 518| static constexpr auto KeyWithEndQuote = join_v>; 315| 518| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 518| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 506, False: 12] | Branch (321:52): [True: 410, False: 96] ------------------ 322| 410| it += Length; 323| 410| if constexpr (not Opts.null_terminated) { 324| 410| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 410] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 410| } 329| | 330| 410| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 396] ------------------ 331| 14| return; 332| 14| } 333| 396| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 18, False: 378] ------------------ 334| 18| return; 335| 18| } 336| 378| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 16, False: 362] ------------------ 337| 16| return; 338| 16| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 362| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 362| } 343| 108| else [[unlikely]] { 344| 108| decode_index_unknown_key(value, ctx, it, end); 345| 108| } 346| 518| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm1ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 362| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 362| else { 274| 362| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 362| else { 298| 362| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 362| it, end); 300| 362| } 301| 362| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 362| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm2EEEDav: 490| 1.11k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm2ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 1.11k| { 313| 1.11k| static constexpr auto Key = get(reflect::keys); 314| 1.11k| static constexpr auto KeyWithEndQuote = join_v>; 315| 1.11k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 1.11k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 1.10k, False: 12] | Branch (321:52): [True: 1.06k, False: 40] ------------------ 322| 1.06k| it += Length; 323| 1.06k| if constexpr (not Opts.null_terminated) { 324| 1.06k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 1.06k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 1.06k| } 329| | 330| 1.06k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 1.05k] ------------------ 331| 14| return; 332| 14| } 333| 1.05k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 12, False: 1.03k] ------------------ 334| 12| return; 335| 12| } 336| 1.03k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 1.02k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 1.02k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 1.02k| } 343| 52| else [[unlikely]] { 344| 52| decode_index_unknown_key(value, ctx, it, end); 345| 52| } 346| 1.11k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm2ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 1.02k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 1.02k| else { 274| 1.02k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 1.02k| else { 298| 1.02k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 1.02k| it, end); 300| 1.02k| } 301| 1.02k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 1.02k| } _ZN3glz4fromILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_: 2791| 1.02k| { 2792| 1.02k| static constexpr auto num_members = reflect::size; 2793| | 2794| 1.02k| static constexpr auto Opts = opening_handled_off()>(); 2795| 1.02k| if constexpr (!check_opening_handled(Options)) { 2796| | if constexpr (!check_ws_handled(Options)) { 2797| | if (skip_ws(ctx, it, end)) { 2798| | return; 2799| | } 2800| | } 2801| 1.02k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 14, False: 1.01k] ------------------ 2802| 14| return; 2803| 14| } 2804| 1.01k| if constexpr (not Opts.null_terminated) { 2805| 1.01k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 1.01k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 1.01k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 1.01k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 1.01k] ------------------ 2813| 0| return; 2814| 0| } 2815| 1.01k| } 2816| 1.01k| const auto ws_start = it; 2817| 1.02k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 14, False: 1.01k] ------------------ 2818| 14| return; 2819| 14| } 2820| 1.01k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 1.01k| else { 2895| 1.01k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 1.01k| if constexpr ((glaze_object_t || reflectable) && 2897| 1.01k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 1.01k| return bit_array{}; 2899| 1.01k| } 2900| 1.01k| else { 2901| 1.01k| return nullptr; 2902| 1.01k| } 2903| 1.01k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 1.01k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 1.01k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 1.01k| return has_includer_member; 2915| 1.01k| } 2916| 1.01k| else { 2917| 1.01k| return false; 2918| 1.01k| } 2919| 1.01k| }(); 2920| 1.01k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 1.01k| [[maybe_unused]] const std::conditional_t>, 2930| 1.01k| inert_key_bits_scope> published_bits{ 2931| 1.01k| ctx, [&]() -> void* { 2932| 1.01k| if constexpr (tracks_include_keys) { 2933| 1.01k| return &fields; 2934| 1.01k| } 2935| 1.01k| else { 2936| 1.01k| return nullptr; 2937| 1.01k| } 2938| 1.01k| }()}; 2939| | 2940| 1.01k| size_t read_count{}; // for partial_read 2941| | 2942| 1.01k| bool first = true; 2943| 6.06k| while (true) { ------------------ | Branch (2943:20): [True: 5.27k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 5.27k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 143, False: 5.13k] ------------------ 2981| 143| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| 143| if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| 143| } 3017| 143| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 143| if constexpr (not Opts.null_terminated) { 3019| 143| if (it == end) { ------------------ | Branch (3019:26): [True: 7, False: 136] ------------------ 3020| 7| ctx.error = error_code::end_reached; 3021| 7| return; 3022| 7| } 3023| 143| } 3024| 136| return; 3025| 143| } 3026| 5.13k| else if (first) { ------------------ | Branch (3026:25): [True: 942, False: 4.19k] ------------------ 3027| 942| first = false; 3028| 942| } 3029| 4.19k| else { 3030| 4.19k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 17, False: 4.17k] ------------------ 3031| 17| return; 3032| 17| } 3033| 4.17k| if constexpr (not Opts.null_terminated) { 3034| 4.17k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 4.17k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 4.17k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| 4.17k| (!Opts.comments)) { 3042| 4.17k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (3042:26): [True: 3.89k, False: 276] | Branch (3042:37): [True: 3.58k, False: 316] ------------------ 3043| 3.58k| skip_matching_ws(ws_start, it, ws_size); 3044| 3.58k| } 3045| 4.17k| } 3046| | 3047| 4.17k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 44, False: 4.13k] ------------------ 3048| 44| return; 3049| 44| } 3050| 4.17k| } 3051| | 3052| 5.07k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [True: 0, Folded] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| 5.07k| else if constexpr (reflection_type) { 3118| 5.07k| static_assert(bool(hash_info.type)); 3119| | 3120| 5.07k| if (*it != '"') [[unlikely]] { ------------------ | Branch (3120:23): [True: 602, False: 4.47k] ------------------ 3121| 602| ctx.error = error_code::expected_quote; 3122| 602| return; 3123| 602| } 3124| 4.47k| ++it; 3125| 4.47k| if constexpr (not Opts.null_terminated) { 3126| 4.47k| if (it == end) [[unlikely]] { ------------------ | Branch (3126:26): [True: 20, False: 4.45k] ------------------ 3127| 20| ctx.error = error_code::unexpected_end; 3128| 20| return; 3129| 20| } 3130| 4.47k| } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| 4.47k| else { 3181| 4.47k| parse_and_invoke(value, ctx, it, end); 3182| 4.47k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3182:26): [True: 155, False: 4.31k] ------------------ 3183| 155| return; 3184| 4.47k| } 3185| | } 3186| | else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| | auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| | else { 3200| | parse::op()>(value[key], ctx, it, end); 3201| | } 3202| | }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| | using Key = typename T::key_type; 3206| | if constexpr (std::is_same_v) { 3207| | ctx.scratch.clear(); 3208| | parse::op(ctx.scratch, ctx, it, end); 3209| | if (bool(ctx.error)) [[unlikely]] 3210| | return; 3211| | 3212| | if (parse_ws_colon(ctx, it, end)) { 3213| | return; 3214| | } 3215| | 3216| | reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| | if (bool(ctx.error)) [[unlikely]] 3223| | return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| | } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 5.07k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 16, False: 5.05k] ------------------ 3294| 16| return; 3295| 16| } 3296| 5.07k| } 3297| 1.01k| } 3298| 1.01k| } _ZZN3glz4fromILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 997| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 997| else { 2901| 997| return nullptr; 2902| 997| } 2903| 997| }(); _ZZN3glz4fromILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 997| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 997| else { 2936| 997| return nullptr; 2937| 997| } 2938| 997| }()}; _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm3EEEDav: 490| 1.16k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm3ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 1.16k| { 313| 1.16k| static constexpr auto Key = get(reflect::keys); 314| 1.16k| static constexpr auto KeyWithEndQuote = join_v>; 315| 1.16k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 1.16k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 1.15k, False: 7] | Branch (321:52): [True: 1.14k, False: 18] ------------------ 322| 1.14k| it += Length; 323| 1.14k| if constexpr (not Opts.null_terminated) { 324| 1.14k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 1.14k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 1.14k| } 329| | 330| 1.14k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 1.12k] ------------------ 331| 14| return; 332| 14| } 333| 1.12k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 8, False: 1.11k] ------------------ 334| 8| return; 335| 8| } 336| 1.11k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 1.10k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 1.10k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 1.10k| } 343| 25| else [[unlikely]] { 344| 25| decode_index_unknown_key(value, ctx, it, end); 345| 25| } 346| 1.16k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm3ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 1.10k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 1.10k| else { 274| 1.10k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 1.10k| else { 298| 1.10k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 1.10k| it, end); 300| 1.10k| } 301| 1.10k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 1.10k| } _ZN3glz4fromILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_: 2791| 1.10k| { 2792| 1.10k| static constexpr auto num_members = reflect::size; 2793| | 2794| 1.10k| static constexpr auto Opts = opening_handled_off()>(); 2795| 1.10k| if constexpr (!check_opening_handled(Options)) { 2796| | if constexpr (!check_ws_handled(Options)) { 2797| | if (skip_ws(ctx, it, end)) { 2798| | return; 2799| | } 2800| | } 2801| 1.10k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 10, False: 1.09k] ------------------ 2802| 10| return; 2803| 10| } 2804| 1.09k| if constexpr (not Opts.null_terminated) { 2805| 1.09k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 1.09k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 1.09k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 1.09k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 1.09k] ------------------ 2813| 0| return; 2814| 0| } 2815| 1.09k| } 2816| 1.09k| const auto ws_start = it; 2817| 1.10k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 14, False: 1.09k] ------------------ 2818| 14| return; 2819| 14| } 2820| 1.09k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 1.09k| else { 2895| 1.09k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 1.09k| if constexpr ((glaze_object_t || reflectable) && 2897| 1.09k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 1.09k| return bit_array{}; 2899| 1.09k| } 2900| 1.09k| else { 2901| 1.09k| return nullptr; 2902| 1.09k| } 2903| 1.09k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 1.09k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 1.09k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 1.09k| return has_includer_member; 2915| 1.09k| } 2916| 1.09k| else { 2917| 1.09k| return false; 2918| 1.09k| } 2919| 1.09k| }(); 2920| 1.09k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 1.09k| [[maybe_unused]] const std::conditional_t>, 2930| 1.09k| inert_key_bits_scope> published_bits{ 2931| 1.09k| ctx, [&]() -> void* { 2932| 1.09k| if constexpr (tracks_include_keys) { 2933| 1.09k| return &fields; 2934| 1.09k| } 2935| 1.09k| else { 2936| 1.09k| return nullptr; 2937| 1.09k| } 2938| 1.09k| }()}; 2939| | 2940| 1.09k| size_t read_count{}; // for partial_read 2941| | 2942| 1.09k| bool first = true; 2943| 4.71k| while (true) { ------------------ | Branch (2943:20): [True: 3.90k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 3.90k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 209, False: 3.69k] ------------------ 2981| 209| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| 209| if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| 209| } 3017| 209| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 209| if constexpr (not Opts.null_terminated) { 3019| 209| if (it == end) { ------------------ | Branch (3019:26): [True: 3, False: 206] ------------------ 3020| 3| ctx.error = error_code::end_reached; 3021| 3| return; 3022| 3| } 3023| 209| } 3024| 206| return; 3025| 209| } 3026| 3.69k| else if (first) { ------------------ | Branch (3026:25): [True: 874, False: 2.82k] ------------------ 3027| 874| first = false; 3028| 874| } 3029| 2.82k| else { 3030| 2.82k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 8, False: 2.81k] ------------------ 3031| 8| return; 3032| 8| } 3033| 2.81k| if constexpr (not Opts.null_terminated) { 3034| 2.81k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 2.81k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 2.81k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| 2.81k| (!Opts.comments)) { 3042| 2.81k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (3042:26): [True: 2.60k, False: 210] | Branch (3042:37): [True: 2.50k, False: 98] ------------------ 3043| 2.50k| skip_matching_ws(ws_start, it, ws_size); 3044| 2.50k| } 3045| 2.81k| } 3046| | 3047| 2.81k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 45, False: 2.76k] ------------------ 3048| 45| return; 3049| 45| } 3050| 2.81k| } 3051| | 3052| 3.64k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [True: 0, Folded] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| 3.64k| else if constexpr (reflection_type) { 3118| 3.64k| static_assert(bool(hash_info.type)); 3119| | 3120| 3.64k| if (*it != '"') [[unlikely]] { ------------------ | Branch (3120:23): [True: 669, False: 2.97k] ------------------ 3121| 669| ctx.error = error_code::expected_quote; 3122| 669| return; 3123| 669| } 3124| 2.97k| ++it; 3125| 2.97k| if constexpr (not Opts.null_terminated) { 3126| 2.97k| if (it == end) [[unlikely]] { ------------------ | Branch (3126:26): [True: 21, False: 2.95k] ------------------ 3127| 21| ctx.error = error_code::unexpected_end; 3128| 21| return; 3129| 21| } 3130| 2.97k| } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| 2.97k| else { 3181| 2.97k| parse_and_invoke(value, ctx, it, end); 3182| 2.97k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3182:26): [True: 115, False: 2.85k] ------------------ 3183| 115| return; 3184| 2.97k| } 3185| | } 3186| | else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| | auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| | else { 3200| | parse::op()>(value[key], ctx, it, end); 3201| | } 3202| | }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| | using Key = typename T::key_type; 3206| | if constexpr (std::is_same_v) { 3207| | ctx.scratch.clear(); 3208| | parse::op(ctx.scratch, ctx, it, end); 3209| | if (bool(ctx.error)) [[unlikely]] 3210| | return; 3211| | 3212| | if (parse_ws_colon(ctx, it, end)) { 3213| | return; 3214| | } 3215| | 3216| | reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| | if (bool(ctx.error)) [[unlikely]] 3223| | return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| | } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 3.64k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 14, False: 3.62k] ------------------ 3294| 14| return; 3295| 14| } 3296| 3.64k| } 3297| 1.09k| } 3298| 1.09k| } _ZZN3glz4fromILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 1.08k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 1.08k| else { 2901| 1.08k| return nullptr; 2902| 1.08k| } 2903| 1.08k| }(); _ZZN3glz4fromILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 1.08k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 1.08k| else { 2936| 1.08k| return nullptr; 2937| 1.08k| } 2938| 1.08k| }()}; _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm4EEEDav: 490| 8.36k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm4ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 8.36k| { 313| 8.36k| static constexpr auto Key = get(reflect::keys); 314| 8.36k| static constexpr auto KeyWithEndQuote = join_v>; 315| 8.36k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 8.36k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 8.35k, False: 10] | Branch (321:52): [True: 8.31k, False: 43] ------------------ 322| 8.31k| it += Length; 323| 8.31k| if constexpr (not Opts.null_terminated) { 324| 8.31k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 8.31k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 8.31k| } 329| | 330| 8.31k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 8.30k] ------------------ 331| 14| return; 332| 14| } 333| 8.30k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 11, False: 8.29k] ------------------ 334| 11| return; 335| 11| } 336| 8.29k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 8.27k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 8.27k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 8.27k| } 343| 53| else [[unlikely]] { 344| 53| decode_index_unknown_key(value, ctx, it, end); 345| 53| } 346| 8.36k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm4ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 8.27k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 8.27k| else { 274| 8.27k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 8.27k| else { 298| 8.27k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 8.27k| it, end); 300| 8.27k| } 301| 8.27k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 8.27k| } _ZN3glz4fromILj10ENSt3__16vectorIiNS1_9allocatorIiEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERS5_TkNS_10is_contextERNS_7contextERPKcSD_EEvOT0_OT1_OT2_T3_: 2050| 8.27k| { 2051| 8.27k| constexpr auto Opts = ws_handled_off(); 2052| | if constexpr (!check_ws_handled(Options)) { 2053| | if (skip_ws(ctx, it, end)) { 2054| | return; 2055| | } 2056| | } 2057| | 2058| 8.27k| if (match_invalid_end<'[', Opts>(ctx, it, end)) { ------------------ | Branch (2058:14): [True: 19, False: 8.25k] ------------------ 2059| 19| return; 2060| 19| } 2061| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2062| | // released at each syntactic close below 2063| 8.25k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2063:14): [True: 0, False: 8.25k] ------------------ 2064| 0| return; 2065| 0| } 2066| | 2067| 8.25k| const auto ws_start = it; 2068| 8.25k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2068:14): [True: 14, False: 8.24k] ------------------ 2069| 14| return; 2070| 14| } 2071| | 2072| 8.24k| if (*it == ']') { ------------------ | Branch (2072:14): [True: 404, False: 7.84k] ------------------ 2073| 404| --ctx.depth; 2074| 404| ++it; 2075| 404| if constexpr ((resizable || is_inplace_vector) && not check_append_arrays(Opts)) { 2076| 404| value.clear(); 2077| | 2078| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2079| | value.shrink_to_fit(); 2080| | } 2081| 404| } 2082| 404| return; 2083| 404| } 2084| | 2085| 7.84k| const size_t ws_size = size_t(it - ws_start); 2086| | 2087| 7.84k| static constexpr bool should_append = (resizable || is_inplace_vector) && check_append_arrays(Opts); ------------------ | Branch (2087:49): [True: 7.84k, Folded] | Branch (2087:65): [Folded, False: 0] | Branch (2087:90): [Folded, False: 0] ------------------ 2088| 7.84k| if constexpr (not should_append) { 2089| 7.84k| const auto n = value.size(); 2090| | 2091| 7.84k| auto value_it = value.begin(); 2092| | 2093| 24.8k| for (size_t i = 0; i < n; ++i) { ------------------ | Branch (2093:32): [True: 19.3k, False: 5.42k] ------------------ 2094| 19.3k| parse::op()>(*value_it++, ctx, it, end); 2095| 19.3k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (2095:20): [True: 762, False: 18.6k] ------------------ 2096| 762| return; 2097| 18.6k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2097:20): [True: 35, False: 18.6k] ------------------ 2098| 35| return; 2099| 35| } 2100| 18.6k| if (*it == ',') { ------------------ | Branch (2100:20): [True: 17.0k, False: 1.55k] ------------------ 2101| 17.0k| ++it; 2102| | 2103| 17.0k| if constexpr (!Opts.minified && !Opts.comments) { 2104| 17.0k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (2104:26): [True: 8.25k, False: 8.79k] | Branch (2104:37): [True: 7.92k, False: 334] ------------------ 2105| 7.92k| skip_matching_ws(ws_start, it, ws_size); 2106| 7.92k| } 2107| 17.0k| } 2108| | 2109| 17.0k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2109:23): [True: 68, False: 16.9k] ------------------ 2110| 68| return; 2111| 68| } 2112| 17.0k| } 2113| 1.55k| else if (*it == ']') { ------------------ | Branch (2113:25): [True: 1.37k, False: 180] ------------------ 2114| 1.37k| --ctx.depth; 2115| 1.37k| ++it; 2116| 1.37k| if constexpr (erasable) { 2117| 1.37k| value.erase(value_it, 2118| 1.37k| value.end()); // use erase rather than resize for non-default constructible elements 2119| | 2120| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2121| | value.shrink_to_fit(); 2122| | } 2123| 1.37k| } 2124| 1.37k| return; 2125| 1.37k| } 2126| 180| else [[unlikely]] { 2127| 180| ctx.error = error_code::expected_bracket; 2128| 180| return; 2129| 180| } 2130| 18.6k| } 2131| 7.84k| } 2132| | 2133| | if constexpr (Opts.partial_read) { 2134| | // partial_read stops early on a success path, so give the level back like the 2135| | // syntactic-close paths do; otherwise it accumulates across reads sharing a context. 2136| | --ctx.depth; 2137| | return; 2138| | } 2139| 7.84k| else { 2140| | // growing 2141| 7.84k| if constexpr (emplace_backable || has_try_emplace_back) { 2142| 334k| while (it < end) { ------------------ | Branch (2142:23): [True: 332k, False: 2.41k] ------------------ 2143| | // Streaming refill point: at start of each iteration, ensure buffer has data 2144| | if constexpr (has_streaming_state) { 2145| | if (ctx.stream.enabled()) { 2146| | const size_t consumed = static_cast(it - ctx.stream.data()); 2147| | const size_t remaining = ctx.stream.size() - consumed; 2148| | // Refill when less than half of buffer remains to ensure space for next element 2149| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2150| | const char* new_it; 2151| | const char* new_end; 2152| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2153| | it = new_it; 2154| | end = new_end; 2155| | if (it >= end && ctx.stream.at_eof()) { 2156| | break; // No more data, exit loop normally 2157| | } 2158| | } 2159| | } 2160| | } 2161| | 2162| | if constexpr (has_try_emplace_back) { 2163| | if (value.try_emplace_back()) 2164| | parse::op()>(value.back(), ctx, it, end); 2165| | else 2166| | ctx.error = error_code::exceeded_static_array_size; 2167| | } 2168| 332k| else { 2169| 332k| parse::op()>(value.emplace_back(), ctx, it, end); 2170| 332k| } 2171| | 2172| 332k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (2172:23): [True: 1.96k, False: 330k] ------------------ 2173| 1.96k| return; 2174| | 2175| | // Streaming refill point: after parsing each element, refill if buffer is low 2176| | if constexpr (has_streaming_state) { 2177| | if (ctx.stream.enabled()) { 2178| | const size_t consumed = static_cast(it - ctx.stream.data()); 2179| | // Refill when less than 25% of buffer remains to ensure enough space for next element 2180| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 2181| | const char* new_it; 2182| | const char* new_end; 2183| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2184| | it = new_it; 2185| | end = new_end; 2186| | if (it >= end && ctx.stream.at_eof()) { 2187| | ctx.error = error_code::unexpected_end; 2188| | return; 2189| | } 2190| | } 2191| | } 2192| | } 2193| | 2194| 330k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2194:23): [True: 28, False: 330k] ------------------ 2195| 28| return; 2196| 28| } 2197| 330k| if (*it == ',') [[likely]] { ------------------ | Branch (2197:23): [True: 327k, False: 3.36k] ------------------ 2198| 327k| ++it; 2199| | 2200| 327k| if constexpr (!Opts.minified && !Opts.comments) { 2201| 327k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (2201:29): [True: 317k, False: 9.49k] | Branch (2201:40): [True: 317k, False: 307] ------------------ 2202| 317k| skip_matching_ws(ws_start, it, ws_size); 2203| 317k| } 2204| 327k| } 2205| | 2206| 327k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2206:26): [True: 75, False: 326k] ------------------ 2207| 75| return; 2208| 75| } 2209| 327k| } 2210| 3.36k| else if (*it == ']') { ------------------ | Branch (2210:28): [True: 3.00k, False: 359] ------------------ 2211| 3.00k| --ctx.depth; 2212| 3.00k| ++it; 2213| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2214| | value.shrink_to_fit(); 2215| | } 2216| 3.00k| return; 2217| 3.00k| } 2218| 359| else [[unlikely]] { 2219| 359| ctx.error = error_code::expected_bracket; 2220| 359| return; 2221| 359| } 2222| 330k| } 2223| | 2224| | // A valid array always returns from inside the loop upon reaching ']'. 2225| | // For a null-terminated buffer the loop can only exit here by falling 2226| | // through when `it` reaches the terminator without a closing bracket, 2227| | // which means the input was truncated (e.g. "[", "[1," or "[1,2,"). 2228| | // Non-null-terminated buffers surface this through skip_ws/depth 2229| | // tracking (or the streaming refill break), so this guard is limited 2230| | // to the null-terminated case. 2231| | if constexpr (Opts.null_terminated) { 2232| | ctx.error = error_code::unexpected_end; 2233| | } 2234| | } 2235| | else { 2236| | ctx.error = error_code::exceeded_static_array_size; 2237| | } 2238| 7.84k| } 2239| 7.84k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERiTkNS_10is_contextERNS_7contextERPKcS8_EEvOT0_OT1_OT2_T3_: 49| 599k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 599k| else { 60| 599k| using V = std::remove_cvref_t; 61| 599k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 599k| end); 63| 599k| } 64| 599k| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm5EEEDav: 490| 1.79k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm5ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 1.79k| { 313| 1.79k| static constexpr auto Key = get(reflect::keys); 314| 1.79k| static constexpr auto KeyWithEndQuote = join_v>; 315| 1.79k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 1.79k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 1.78k, False: 18] | Branch (321:52): [True: 1.75k, False: 25] ------------------ 322| 1.75k| it += Length; 323| 1.75k| if constexpr (not Opts.null_terminated) { 324| 1.75k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 1.75k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 1.75k| } 329| | 330| 1.75k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 1.74k] ------------------ 331| 14| return; 332| 14| } 333| 1.74k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 14, False: 1.72k] ------------------ 334| 14| return; 335| 14| } 336| 1.72k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 1.71k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 1.71k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 1.71k| } 343| 43| else [[unlikely]] { 344| 43| decode_index_unknown_key(value, ctx, it, end); 345| 43| } 346| 1.79k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm5ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 1.71k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 1.71k| else { 274| 1.71k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 1.71k| else { 298| 1.71k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 1.71k| it, end); 300| 1.71k| } 301| 1.71k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 1.71k| } _ZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_: 2791| 1.71k| { 2792| 1.71k| static constexpr auto num_members = reflect::size; 2793| | 2794| 1.71k| static constexpr auto Opts = opening_handled_off()>(); 2795| 1.71k| if constexpr (!check_opening_handled(Options)) { 2796| | if constexpr (!check_ws_handled(Options)) { 2797| | if (skip_ws(ctx, it, end)) { 2798| | return; 2799| | } 2800| | } 2801| 1.71k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 28, False: 1.68k] ------------------ 2802| 28| return; 2803| 28| } 2804| 1.68k| if constexpr (not Opts.null_terminated) { 2805| 1.68k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 1.68k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 1.68k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 1.68k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 1.68k] ------------------ 2813| 0| return; 2814| 0| } 2815| 1.68k| } 2816| 1.68k| const auto ws_start = it; 2817| 1.71k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 14, False: 1.69k] ------------------ 2818| 14| return; 2819| 14| } 2820| 1.69k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 1.69k| else { 2895| 1.69k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 1.69k| if constexpr ((glaze_object_t || reflectable) && 2897| 1.69k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 1.69k| return bit_array{}; 2899| 1.69k| } 2900| 1.69k| else { 2901| 1.69k| return nullptr; 2902| 1.69k| } 2903| 1.69k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 1.69k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 1.69k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 1.69k| return has_includer_member; 2915| 1.69k| } 2916| 1.69k| else { 2917| 1.69k| return false; 2918| 1.69k| } 2919| 1.69k| }(); 2920| 1.69k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 1.69k| [[maybe_unused]] const std::conditional_t>, 2930| 1.69k| inert_key_bits_scope> published_bits{ 2931| 1.69k| ctx, [&]() -> void* { 2932| 1.69k| if constexpr (tracks_include_keys) { 2933| 1.69k| return &fields; 2934| 1.69k| } 2935| 1.69k| else { 2936| 1.69k| return nullptr; 2937| 1.69k| } 2938| 1.69k| }()}; 2939| | 2940| 1.69k| size_t read_count{}; // for partial_read 2941| | 2942| 1.69k| bool first = true; 2943| 19.2k| while (true) { ------------------ | Branch (2943:20): [True: 18.0k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 18.0k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 293, False: 17.7k] ------------------ 2981| 293| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| | if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| | } 3017| 293| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 293| if constexpr (not Opts.null_terminated) { 3019| 293| if (it == end) { ------------------ | Branch (3019:26): [True: 9, False: 284] ------------------ 3020| 9| ctx.error = error_code::end_reached; 3021| 9| return; 3022| 9| } 3023| 293| } 3024| 284| return; 3025| 293| } 3026| 17.7k| else if (first) { ------------------ | Branch (3026:25): [True: 1.59k, False: 16.1k] ------------------ 3027| 1.59k| first = false; 3028| 1.59k| } 3029| 16.1k| else { 3030| 16.1k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 216, False: 15.9k] ------------------ 3031| 216| return; 3032| 216| } 3033| 15.9k| if constexpr (not Opts.null_terminated) { 3034| 15.9k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 15.9k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 15.9k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| | (!Opts.comments)) { 3042| | if (ws_size && ws_size < size_t(end - it)) { 3043| | skip_matching_ws(ws_start, it, ws_size); 3044| | } 3045| | } 3046| | 3047| 15.9k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 14, False: 15.9k] ------------------ 3048| 14| return; 3049| 14| } 3050| 15.9k| } 3051| | 3052| 17.5k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [Folded, False: 0] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| | else if constexpr (reflection_type) { 3118| | static_assert(bool(hash_info.type)); 3119| | 3120| | if (*it != '"') [[unlikely]] { 3121| | ctx.error = error_code::expected_quote; 3122| | return; 3123| | } 3124| | ++it; 3125| | if constexpr (not Opts.null_terminated) { 3126| | if (it == end) [[unlikely]] { 3127| | ctx.error = error_code::unexpected_end; 3128| | return; 3129| | } 3130| | } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| | else { 3181| | parse_and_invoke(value, ctx, it, end); 3182| | if (bool(ctx.error)) [[unlikely]] 3183| | return; 3184| | } 3185| | } 3186| 17.5k| else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| 17.5k| auto reading = [&](auto&& key) { 3190| 17.5k| if constexpr (Opts.partial_read) { 3191| 17.5k| if (auto element = value.find(key); element != value.end()) { 3192| 17.5k| ++read_count; 3193| 17.5k| parse::op()>(element->second, ctx, it, end); 3194| 17.5k| } 3195| 17.5k| else { 3196| 17.5k| skip_value::op(ctx, it, end); 3197| 17.5k| } 3198| 17.5k| } 3199| 17.5k| else { 3200| 17.5k| parse::op()>(value[key], ctx, it, end); 3201| 17.5k| } 3202| 17.5k| }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| 17.5k| using Key = typename T::key_type; 3206| 17.5k| if constexpr (std::is_same_v) { 3207| 17.5k| ctx.scratch.clear(); 3208| 17.5k| parse::op(ctx.scratch, ctx, it, end); 3209| 17.5k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3209:26): [True: 181, False: 17.3k] ------------------ 3210| 181| return; 3211| | 3212| 17.3k| if (parse_ws_colon(ctx, it, end)) { ------------------ | Branch (3212:26): [True: 85, False: 17.2k] ------------------ 3213| 85| return; 3214| 85| } 3215| | 3216| 17.2k| reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| 17.2k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3222:26): [True: 859, False: 16.4k] ------------------ 3223| 859| return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| 17.5k| } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 17.5k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 23, False: 17.5k] ------------------ 3294| 23| return; 3295| 23| } 3296| 17.5k| } 3297| 1.69k| } 3298| 1.69k| } _ZZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 1.67k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 1.67k| else { 2901| 1.67k| return nullptr; 2902| 1.67k| } 2903| 1.67k| }(); _ZZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 1.67k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 1.67k| else { 2936| 1.67k| return nullptr; 2937| 1.67k| } 2938| 1.67k| }()}; _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEETkNS_10is_contextERNS_7contextERPKcSF_EEvOT0_OT1_OT2_T3_: 49| 98.2k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 98.2k| else { 60| 98.2k| using V = std::remove_cvref_t; 61| 98.2k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 98.2k| end); 63| 98.2k| } 64| 98.2k| } _ZN3glz4fromILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERPKcSC_S7_TkNS_10is_contextERNS_7contextEEEvRT2_OT3_OT0_T1_: 887| 98.2k| { 888| | if constexpr (check_string_as_number(Opts)) { 889| | auto start = it; 890| | skip_number(ctx, it, end); 891| | if (bool(ctx.error)) [[unlikely]] { 892| | return; 893| | } 894| | if (start == it) [[unlikely]] { 895| | ctx.error = error_code::parse_number_failure; 896| | return; 897| | } 898| | value.append(start, size_t(it - start)); 899| | } 900| 98.2k| else { 901| 98.2k| if constexpr (!check_opening_handled(Opts)) { 902| 98.2k| if constexpr (!check_ws_handled(Opts)) { 903| 98.2k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (903:23): [True: 119, False: 98.1k] ------------------ 904| 119| return; 905| 119| } 906| 98.2k| } 907| | 908| 98.2k| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (908:20): [True: 41.6k, False: 56.6k] ------------------ 909| 41.6k| return; 910| 41.6k| } 911| 98.2k| } 912| | 913| 98.2k| if constexpr (not check_raw_string(Opts)) { 914| 98.2k| static constexpr auto string_padding_bytes = 8; 915| | 916| | // How much buffer has to remain for an eight byte load at the cursor to stay inside 917| | // it. One on a padded input, where the last chunk is free to straddle the end of the 918| | // document, so the byte tails below are unreachable; eight otherwise, which costs the 919| | // final bytes of the buffer their chunked path and nothing else. 920| 98.2k| const std::ptrdiff_t scan_min = chunk_min<8>(ctx.padded_input); 921| | 922| 98.2k| if (size_t(end - it) >= 8) { ------------------ | Branch (922:20): [True: 53.9k, False: 44.3k] ------------------ 923| | // The bound as a pointer, so the loops below spend a compare per chunk rather 924| | // than a subtract and a compare. Well defined here and nowhere else in this 925| | // reader: the branch has just established that at least eight bytes remain, and 926| | // `scan_min` is at most eight. 927| 53.9k| const auto* const chunk_limit = end - scan_min; 928| | 929| 53.9k| auto start = it; 930| 53.9k| uint64_t ascii_acc{}; 931| 9.25M| while (it <= chunk_limit) { ------------------ | Branch (931:26): [True: 9.25M, False: 1.65k] ------------------ 932| 9.25M| uint64_t chunk; 933| 9.25M| std::memcpy(&chunk, it, 8); 934| | if constexpr (std::endian::native == std::endian::big) { 935| | chunk = std::byteswap(chunk); 936| | } 937| 9.25M| ascii_acc |= chunk; 938| 9.25M| const uint64_t test_chars = has_quote(chunk); 939| 9.25M| if (test_chars) { ------------------ | Branch (939:26): [True: 55.3k, False: 9.19M] ------------------ 940| 55.3k| it += (countr_zero(test_chars) >> 3); 941| | 942| 55.3k| auto* prev = it - 1; 943| 97.7k| while (*prev == '\\') { ------------------ | Branch (943:32): [True: 42.3k, False: 55.3k] ------------------ 944| 42.3k| --prev; 945| 42.3k| } 946| 55.3k| if (size_t(it - prev) % 2) { ------------------ | Branch (946:29): [True: 52.2k, False: 3.12k] ------------------ 947| 52.2k| goto continue_decode; 948| 52.2k| } 949| 3.12k| ++it; // skip the escaped quote 950| 3.12k| } 951| 9.19M| else { 952| 9.19M| it += 8; 953| 9.19M| } 954| 9.25M| } 955| | 956| 3.46k| while (it[-1] == '\\') [[unlikely]] { ------------------ | Branch (956:26): [True: 1.80k, False: 1.65k] ------------------ 957| | // if we ended on an escape character then we need to rewind 958| | // because we lost our context 959| 1.80k| --it; 960| 1.80k| } 961| | 962| | // The byte-wise tail keeps feeding the accumulator: it has to cover every byte of 963| | // the string, or a non-ASCII byte reached here would be waved through unvalidated. 964| 7.56k| for (; it < end; ++it) { ------------------ | Branch (964:26): [True: 7.30k, False: 256] ------------------ 965| 7.30k| ascii_acc |= uint8_t(*it); 966| 7.30k| if (*it == '"') { ------------------ | Branch (966:26): [True: 1.49k, False: 5.81k] ------------------ 967| 1.49k| auto* prev = it - 1; 968| 2.95k| while (*prev == '\\') { ------------------ | Branch (968:32): [True: 1.45k, False: 1.49k] ------------------ 969| 1.45k| --prev; 970| 1.45k| } 971| 1.49k| if (size_t(it - prev) % 2) { ------------------ | Branch (971:29): [True: 1.39k, False: 95] ------------------ 972| 1.39k| goto continue_decode; 973| 1.39k| } 974| 1.49k| } 975| 7.30k| } 976| | 977| 256| ctx.error = error_code::unexpected_end; 978| 256| return; 979| | 980| 53.6k| continue_decode: 981| | 982| 53.6k| if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] { ------------------ | Branch (982:23): [True: 507, False: 53.1k] ------------------ 983| 507| return; 984| 507| } 985| | 986| 53.1k| auto n = size_t(it - start); 987| | 988| | // The padding lets the chunked copy below run up to the closing quote. Skip it when it 989| | // would be the only reason to allocate, as for a string that fits the small string 990| | // buffer but not with eight bytes to spare. 991| 53.1k| bool pad = true; 992| 53.1k| if constexpr (requires { value.capacity(); }) { 993| 53.1k| const auto capacity = size_t(value.capacity()); 994| 53.1k| pad = capacity >= n + string_padding_bytes || capacity < n; ------------------ | Branch (994:28): [True: 51.2k, False: 1.92k] | Branch (994:68): [True: 962, False: 966] ------------------ 995| 53.1k| } 996| 53.1k| resize_unfilled(value, pad ? n + string_padding_bytes : n); ------------------ | Branch (996:42): [True: 52.1k, False: 966] ------------------ 997| | 998| 53.1k| auto* p = value.data(); 999| | 1000| | // An error below returns with the tail of `value` still unwritten. Leave the size at 1001| | // what was actually written rather than at the padded length, which resize_unfilled 1002| | // did not fill. 1003| 53.1k| auto* const written_begin = p; 1004| | 1005| | // Without the padding, copy a chunk only while eight bytes remain before the quote. 1006| | // Unescaping never puts the output ahead of the input, so no store lands past the end. 1007| 53.1k| const auto* const copy_end = pad ? it : it - (std::min)(n, size_t(7)); ------------------ | Branch (1007:48): [True: 52.1k, False: 966] ------------------ 1008| | 1009| | // Copy eight bytes at a time for as long as eight bytes are there to read, then 1010| | // finish the span below. The chunked form reads past the character it is looking 1011| | // at, so on an unpadded buffer it has to stop short of the end; splitting it this 1012| | // way keeps it for the body of every string rather than giving it up whenever the 1013| | // string happens to finish near the end of the buffer -- which, for a document 1014| | // that is itself one string, is every string. 1015| 7.06M| while (start < copy_end && start <= chunk_limit) { ------------------ | Branch (1015:26): [True: 7.01M, False: 45.1k] | Branch (1015:46): [True: 7.01M, False: 715] ------------------ 1016| 7.01M| std::memcpy(p, start, 8); 1017| 7.01M| uint64_t swar; 1018| 7.01M| std::memcpy(&swar, p, 8); 1019| | if constexpr (std::endian::native == std::endian::big) { 1020| | swar = std::byteswap(swar); 1021| | } 1022| | 1023| 7.01M| constexpr uint64_t lo7_mask = repeat_byte8(0b01111111); 1024| 7.01M| const uint64_t lo7 = swar & lo7_mask; 1025| 7.01M| const uint64_t backslash = (lo7 ^ repeat_byte8('\\')) + lo7_mask; 1026| 7.01M| const uint64_t less_32 = (swar & repeat_byte8(0b01100000)) + lo7_mask; 1027| 7.01M| uint64_t next = ~((backslash & less_32) | swar); 1028| | 1029| 7.01M| next &= repeat_byte8(0b10000000); 1030| 7.01M| if (next == 0) { ------------------ | Branch (1030:26): [True: 6.96M, False: 51.6k] ------------------ 1031| 6.96M| start += 8; 1032| 6.96M| p += 8; 1033| 6.96M| continue; 1034| 6.96M| } 1035| | 1036| 51.6k| next = countr_zero(next) >> 3; 1037| 51.6k| start += next; 1038| 51.6k| if (start >= it) { ------------------ | Branch (1038:26): [True: 6.56k, False: 45.0k] ------------------ 1039| 6.56k| break; 1040| 6.56k| } 1041| | 1042| 45.0k| if ((*start & 0b11100000) == 0) [[unlikely]] { ------------------ | Branch (1042:26): [True: 250, False: 44.8k] ------------------ 1043| 250| ctx.error = error_code::syntax_error; 1044| 250| value.resize(size_t(p - written_begin)); 1045| 250| return; 1046| 250| } 1047| 44.8k| ++start; // skip the escape 1048| 44.8k| if (*start == 'u') { ------------------ | Branch (1048:26): [True: 6.82k, False: 37.9k] ------------------ 1049| 6.82k| ++start; 1050| 6.82k| p += next; 1051| 6.82k| const auto mark = start; 1052| 6.82k| const auto decoded = handle_unicode_code_point(start, p, end); 1053| 6.82k| if (decoded.written == 0) [[unlikely]] { ------------------ | Branch (1053:29): [True: 384, False: 6.43k] ------------------ 1054| 384| ctx.error = decoded.truncated ? error_code::unexpected_end ------------------ | Branch (1054:40): [True: 0, False: 384] ------------------ 1055| 384| : error_code::unicode_escape_conversion_failure; 1056| 384| value.resize(size_t(p - written_begin)); 1057| 384| return; 1058| 384| } 1059| 6.43k| n += decoded.written; 1060| | // escape + u + unicode code points 1061| 6.43k| n -= 2 + uint32_t(start - mark); 1062| 6.43k| } 1063| 37.9k| else { 1064| 37.9k| p += next; 1065| 37.9k| *p = char_unescape_table[uint8_t(*start)]; 1066| 37.9k| if (*p == 0) [[unlikely]] { ------------------ | Branch (1066:29): [True: 61, False: 37.9k] ------------------ 1067| 61| ctx.error = error_code::invalid_escape; 1068| 61| value.resize(size_t(p - written_begin)); 1069| 61| return; 1070| 61| } 1071| 37.9k| ++p; 1072| 37.9k| ++start; 1073| 37.9k| --n; 1074| 37.9k| } 1075| 44.8k| } 1076| | 1077| | // Whatever the chunked copy could not reach. `p` and `start` stay in step across 1078| | // that loop, so this picks up exactly where it stopped. 1079| 58.0k| while (start < it) { ------------------ | Branch (1079:26): [True: 5.80k, False: 52.2k] ------------------ 1080| 5.80k| if ((*start & 0b11100000) == 0) [[unlikely]] { ------------------ | Branch (1080:26): [True: 49, False: 5.75k] ------------------ 1081| 49| ctx.error = error_code::syntax_error; 1082| 49| value.resize(size_t(p - written_begin)); 1083| 49| return; 1084| 49| } 1085| 5.75k| if (*start == '\\') { ------------------ | Branch (1085:26): [True: 704, False: 5.05k] ------------------ 1086| 704| ++start; // skip the escape 1087| 704| if (*start == 'u') { ------------------ | Branch (1087:29): [True: 369, False: 335] ------------------ 1088| 369| ++start; 1089| 369| const auto mark = start; 1090| 369| const auto decoded = handle_unicode_code_point(start, p, end); 1091| 369| if (decoded.written == 0) [[unlikely]] { ------------------ | Branch (1091:32): [True: 179, False: 190] ------------------ 1092| 179| ctx.error = decoded.truncated ? error_code::unexpected_end ------------------ | Branch (1092:43): [True: 0, False: 179] ------------------ 1093| 179| : error_code::unicode_escape_conversion_failure; 1094| 179| value.resize(size_t(p - written_begin)); 1095| 179| return; 1096| 179| } 1097| 190| n += decoded.written; 1098| 190| n -= 2 + uint32_t(start - mark); 1099| 190| } 1100| 335| else { 1101| 335| *p = char_unescape_table[uint8_t(*start)]; 1102| 335| if (*p == 0) [[unlikely]] { ------------------ | Branch (1102:32): [True: 25, False: 310] ------------------ 1103| 25| ctx.error = error_code::invalid_escape; 1104| 25| value.resize(size_t(p - written_begin)); 1105| 25| return; 1106| 25| } 1107| 310| ++p; 1108| 310| ++start; 1109| 310| --n; 1110| 310| } 1111| 704| } 1112| 5.05k| else { 1113| 5.05k| *p = *start; 1114| 5.05k| ++p; 1115| 5.05k| ++start; 1116| 5.05k| } 1117| 5.75k| } 1118| | 1119| 52.2k| value.resize(n); 1120| 52.2k| ++it; 1121| 52.2k| } 1122| 44.3k| else { 1123| | // For short strings 1124| | 1125| 44.3k| std::array buffer{}; 1126| | 1127| 44.3k| auto* p = buffer.data(); 1128| 44.3k| const auto* const utf8_start = it; 1129| | 1130| 47.8k| while (it < end) [[likely]] { ------------------ | Branch (1130:26): [True: 5.78k, False: 42.0k] ------------------ 1131| 5.78k| *p = *it; 1132| 5.78k| if (*it == '"') { ------------------ | Branch (1132:26): [True: 1.98k, False: 3.80k] ------------------ 1133| 1.98k| if (validate_utf8_span(ctx, utf8_start, it)) [[unlikely]] { ------------------ | Branch (1133:29): [True: 284, False: 1.69k] ------------------ 1134| 284| return; 1135| 284| } 1136| 1.69k| const size_t n = size_t(p - buffer.data()); 1137| 1.69k|#if __has_cpp_attribute(assume) >= 202207L 1138| 1.69k| [[assume(n <= sizeof(buffer))]]; 1139| 1.69k|#endif 1140| 1.69k| value.assign(buffer.data(), n); 1141| 1.69k| ++it; 1142| 1.69k| if constexpr (not Opts.null_terminated) { 1143| 1.69k| if (it == end) { ------------------ | Branch (1143:32): [True: 322, False: 1.37k] ------------------ 1144| 322| ctx.error = error_code::end_reached; 1145| 322| return; 1146| 322| } 1147| 1.69k| } 1148| 1.37k| return; 1149| 1.98k| } 1150| 3.80k| else if (*it == '\\') { ------------------ | Branch (1150:31): [True: 446, False: 3.35k] ------------------ 1151| | // Bounded whatever `null_terminated` says: a document cut off inside an 1152| | // escape has run out of input, and saying so beats blaming the terminator 1153| | // the cut exposed -- which is what reading on would find, and would report 1154| | // as a malformed escape. 1155| 446| ++it; // skip the escape 1156| 446| if (it == end) [[unlikely]] { ------------------ | Branch (1156:29): [True: 31, False: 415] ------------------ 1157| 31| ctx.error = error_code::unexpected_end; 1158| 31| return; 1159| 31| } 1160| 415| if (*it == 'u') { ------------------ | Branch (1160:29): [True: 298, False: 117] ------------------ 1161| 298| ++it; 1162| 298| if (it == end) [[unlikely]] { ------------------ | Branch (1162:32): [True: 10, False: 288] ------------------ 1163| 10| ctx.error = error_code::unexpected_end; 1164| 10| return; 1165| 10| } 1166| 288| const auto decoded = handle_unicode_code_point(it, p, end); 1167| 288| if (decoded.written == 0) [[unlikely]] { ------------------ | Branch (1167:32): [True: 132, False: 156] ------------------ 1168| 132| ctx.error = decoded.truncated ? error_code::unexpected_end ------------------ | Branch (1168:43): [True: 37, False: 95] ------------------ 1169| 132| : error_code::unicode_escape_conversion_failure; 1170| 132| return; 1171| 132| } 1172| 288| } 1173| 117| else { 1174| 117| *p = char_unescape_table[uint8_t(*it)]; 1175| 117| if (*p == 0) [[unlikely]] { ------------------ | Branch (1175:32): [True: 33, False: 84] ------------------ 1176| 33| ctx.error = error_code::invalid_escape; 1177| 33| return; 1178| 33| } 1179| 84| ++p; 1180| 84| ++it; 1181| 84| } 1182| 415| } 1183| 3.35k| else if ((*it & 0b11100000) == 0) [[unlikely]] { ------------------ | Branch (1183:31): [True: 106, False: 3.25k] ------------------ 1184| 106| ctx.error = error_code::syntax_error; 1185| 106| return; 1186| 106| } 1187| 3.25k| else { 1188| 3.25k| ++it; 1189| 3.25k| ++p; 1190| 3.25k| } 1191| 5.78k| } 1192| | 1193| 42.0k| ctx.error = error_code::unexpected_end; 1194| 42.0k| } 1195| | } 1196| | else { 1197| | // raw_string 1198| | auto start = it; 1199| | skip_string_view(ctx, it, end); 1200| | if (bool(ctx.error)) [[unlikely]] 1201| | return; 1202| | 1203| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] { 1204| | return; 1205| | } 1206| | 1207| | value.assign(start, size_t(it - start)); 1208| | ++it; 1209| | } 1210| 98.2k| } 1211| 98.2k| } _ZN3glz14parse_ws_colonITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETkNS_10is_contextENS_7contextERPKcS4_EEbRT0_OT1_T2_: 159| 52.2k| { 160| 52.2k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (160:11): [True: 205, False: 52.0k] ------------------ 161| 205| return true; 162| 205| } 163| 52.0k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (163:11): [True: 329, False: 51.7k] ------------------ 164| 329| return true; 165| 329| } 166| 51.7k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (166:11): [True: 161, False: 51.6k] ------------------ 167| 161| return true; 168| 161| } 169| 51.6k| return false; 170| 51.7k| } _ZZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_ENKUlOT_E_clIRS8_EEDaSZ_: 3189| 17.2k| auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| 17.2k| else { 3200| 17.2k| parse::op()>(value[key], ctx, it, end); 3201| 17.2k| } 3202| 17.2k| }; _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm6EEEDav: 490| 1.63k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm6ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 1.63k| { 313| 1.63k| static constexpr auto Key = get(reflect::keys); 314| 1.63k| static constexpr auto KeyWithEndQuote = join_v>; 315| 1.63k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 1.63k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 1.61k, False: 14] | Branch (321:52): [True: 1.59k, False: 26] ------------------ 322| 1.59k| it += Length; 323| 1.59k| if constexpr (not Opts.null_terminated) { 324| 1.59k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 1.59k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 1.59k| } 329| | 330| 1.59k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 1.57k] ------------------ 331| 14| return; 332| 14| } 333| 1.57k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 28, False: 1.55k] ------------------ 334| 28| return; 335| 28| } 336| 1.55k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 1.53k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 1.53k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 1.53k| } 343| 40| else [[unlikely]] { 344| 40| decode_index_unknown_key(value, ctx, it, end); 345| 40| } 346| 1.63k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm6ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 1.53k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 1.53k| else { 274| 1.53k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 1.53k| else { 298| 1.53k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 1.53k| it, end); 300| 1.53k| } 301| 1.53k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 1.53k| } _ZN3glz4fromILj10ENSt3__18optionalIdEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERS3_TkNS_10is_contextERNS_7contextERPKcSB_EEvOT0_OT1_OT2_T3_: 4883| 1.53k| { 4884| 1.53k| constexpr auto Opts = ws_handled_off(); 4885| | if constexpr (!check_ws_handled(Options)) { 4886| | if (skip_ws(ctx, it, end)) { 4887| | return; 4888| | } 4889| | } 4890| | 4891| 1.53k| if (*it == 'n') { ------------------ | Branch (4891:14): [True: 739, False: 797] ------------------ 4892| 739| ++it; 4893| 739| if constexpr (not Opts.null_terminated) { 4894| 739| if (it == end) [[unlikely]] { ------------------ | Branch (4894:20): [True: 3, False: 736] ------------------ 4895| 3| ctx.error = error_code::unexpected_end; 4896| 3| return; 4897| 3| } 4898| 739| } 4899| 736| match<"ull", Opts>(ctx, it, end); 4900| 739| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (4900:17): [True: 40, False: 699] ------------------ 4901| 40| return; 4902| 699| if constexpr (requires { value.reset(); }) { 4903| 699| value.reset(); 4904| 699| } 4905| 699| } 4906| 797| else { 4907| 797| if constexpr (nullable_value_t) { 4908| 797| if (not value.has_value()) { ------------------ | Branch (4908:20): [True: 476, False: 321] ------------------ 4909| | if constexpr (constructible) { 4910| | value = meta_construct_v(); 4911| | } 4912| 476| else if constexpr (requires { value.emplace(); }) { 4913| 476| value.emplace(); 4914| | } 4915| | else { 4916| | static_assert(false_v, 4917| | "Your nullable type must have `emplace()` or be glz::meta constructible, or " 4918| | "create a custom glz::from specialization"); 4919| | } 4920| 476| } 4921| 797| parse::op(value.value(), ctx, it, end); 4922| | } 4923| | else { 4924| | if (!value) { 4925| | if (!nullable_emplace(value, ctx)) { 4926| | return; 4927| | } 4928| | } 4929| | parse::op(*value, ctx, it, end); 4930| | } 4931| 797| } 4932| 1.53k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERdTkNS_10is_contextERNS_7contextERPKcS8_EEvOT0_OT1_OT2_T3_: 49| 30.2k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 30.2k| else { 60| 30.2k| using V = std::remove_cvref_t; 61| 30.2k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 30.2k| end); 63| 30.2k| } 64| 30.2k| } _ZN3glz4fromILj10EdE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERPKcRdTkNS_10is_contextERNS_7contextES5_EEvOT1_OT2_OT0_T3_: 763| 30.2k| { 764| | if constexpr (check_quoted_num(Opts)) { 765| | if (skip_ws(ctx, it, end)) { 766| | return; 767| | } 768| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 769| | return; 770| | } 771| | } 772| | 773| 30.2k| if constexpr (!check_ws_handled(Opts)) { 774| 30.2k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (774:17): [True: 40, False: 30.2k] ------------------ 775| 40| return; 776| 40| } 777| 30.2k| } 778| | 779| 30.2k| using V = std::decay_t; 780| | if constexpr (int_t) { 781| | static_assert(sizeof(*it) == sizeof(char)); 782| | 783| | if constexpr (Opts.null_terminated) { 784| | if (not glz::atoi(value, it)) [[unlikely]] { 785| | ctx.error = error_code::parse_number_failure; 786| | return; 787| | } 788| | } 789| | else { 790| | if (not glz::atoi(value, it, end)) [[unlikely]] { 791| | ctx.error = error_code::parse_number_failure; 792| | return; 793| | } 794| | } 795| | } 796| 30.2k| else { 797| |// float128_t requires std::from_chars for floating-point, unavailable on older Apple platforms (iOS < 16.3) 798| 30.2k|#if !defined(_LIBCPP_VERSION) || defined(_LIBCPP_AVAILABILITY_HAS_TO_CHARS_FLOATING_POINT) 799| | if constexpr (is_float128) { 800| | auto [ptr, ec] = std::from_chars(it, end, value); 801| | if (ec != std::errc()) { 802| | ctx.error = error_code::parse_number_failure; 803| | return; 804| | } 805| | it = ptr; 806| | } 807| | else 808| |#endif 809| 30.2k| { 810| | if constexpr (std::is_volatile_v>) { 811| | // Hardware may interact with value changes, so we parse into a temporary and assign in one 812| | // place 813| | V temp; 814| | if constexpr (is_size_optimized(Opts)) { 815| | auto [ptr, ec] = simple_float::from_chars(it, end, temp); 816| | if (ec != std::errc{}) [[unlikely]] { 817| | ctx.error = error_code::parse_number_failure; 818| | return; 819| | } 820| | it = ptr; 821| | } 822| | else { 823| | auto [ptr, ec] = glz::from_chars(it, end, temp); 824| | if (ec != std::errc()) [[unlikely]] { 825| | ctx.error = error_code::parse_number_failure; 826| | return; 827| | } 828| | it = ptr; 829| | } 830| | value = temp; 831| | } 832| 30.2k| else { 833| | if constexpr (is_size_optimized(Opts)) { 834| | auto [ptr, ec] = simple_float::from_chars(it, end, value); 835| | if (ec != std::errc{}) [[unlikely]] { 836| | ctx.error = error_code::parse_number_failure; 837| | return; 838| | } 839| | it = ptr; 840| | } 841| 30.2k| else { 842| 30.2k| auto [ptr, ec] = glz::from_chars(it, end, value); 843| 30.2k| if (ec != std::errc()) [[unlikely]] { ------------------ | Branch (843:26): [True: 25.5k, False: 4.68k] ------------------ 844| 25.5k| ctx.error = error_code::parse_number_failure; 845| 25.5k| return; 846| 25.5k| } 847| 4.68k| it = ptr; 848| 4.68k| } 849| 30.2k| } 850| 30.2k| } 851| 30.2k| } 852| | 853| | if constexpr (check_quoted_num(Opts)) { 854| | if constexpr (not Opts.null_terminated) { 855| | if (it == end) [[unlikely]] { 856| | ctx.error = error_code::unexpected_end; 857| | return; 858| | } 859| | } 860| | if (match<'"'>(ctx, it)) { 861| | return; 862| | } 863| | if constexpr (not Opts.null_terminated) { 864| | if (it == end) { 865| | ctx.error = error_code::end_reached; 866| | return; 867| | } 868| | } 869| | } 870| 30.2k| else { 871| 30.2k| if constexpr (not Opts.null_terminated) { 872| 30.2k| if (it == end) { ------------------ | Branch (872:20): [True: 3.19k, False: 27.0k] ------------------ 873| 3.19k| ctx.error = error_code::end_reached; 874| 3.19k| return; 875| 3.19k| } 876| 30.2k| } 877| 30.2k| } 878| 30.2k| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm7EEEDav: 490| 4.88k| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm7ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 4.88k| { 313| 4.88k| static constexpr auto Key = get(reflect::keys); 314| 4.88k| static constexpr auto KeyWithEndQuote = join_v>; 315| 4.88k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 4.88k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 4.86k, False: 19] | Branch (321:52): [True: 4.72k, False: 142] ------------------ 322| 4.72k| it += Length; 323| 4.72k| if constexpr (not Opts.null_terminated) { 324| 4.72k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 4.72k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 4.72k| } 329| | 330| 4.72k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 4.71k] ------------------ 331| 14| return; 332| 14| } 333| 4.71k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 10, False: 4.70k] ------------------ 334| 10| return; 335| 10| } 336| 4.70k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 4.68k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 4.68k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 4.68k| } 343| 161| else [[unlikely]] { 344| 161| decode_index_unknown_key(value, ctx, it, end); 345| 161| } 346| 4.88k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm7ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 4.68k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 4.68k| else { 274| 4.68k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 4.68k| else { 298| 4.68k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 4.68k| it, end); 300| 4.68k| } 301| 4.68k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 4.68k| } _ZN3glz4fromILj10ENSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERSB_TkNS_10is_contextERNS_7contextERPKcSJ_EEvOT0_OT1_OT2_T3_: 3860| 4.68k| { 3861| | if constexpr (tagging == variant_tagging_kind::adjacent) { 3862| | read_adjacent(value, ctx, it, end); 3863| | } 3864| 4.68k| else { 3865| 4.68k| read_deduced(value, ctx, it, end); 3866| 4.68k| } 3867| 4.68k| } _ZN3glz4fromILj10ENSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEEE12read_deducedITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERSB_TkNS_10is_contextERNS_7contextERPKcSJ_EEvOT0_OT1_OT2_T3_: 3871| 4.68k| { 3872| 4.68k| constexpr auto Opts = ws_handled_off(); 3873| 4.68k| if constexpr (variant_is_auto_deducible()) { 3874| | if constexpr (not check_ws_handled(Options)) { 3875| | if (skip_ws(ctx, it, end)) { 3876| | return; 3877| | } 3878| | } 3879| | 3880| 4.68k| switch (*it) { 3881| 3| case '\0': ------------------ | Branch (3881:13): [True: 3, False: 4.68k] ------------------ 3882| 3| ctx.error = error_code::unexpected_end; 3883| 3| return; 3884| 2.55k| case '{': { ------------------ | Branch (3884:13): [True: 2.55k, False: 2.13k] ------------------ 3885| | // This branch consumes the brace itself and hands the object to a reader with 3886| | // `opening_handled`, which therefore does not count the level -- but does release it at 3887| | // the closing brace. So the level is taken here, in both buffer modes, and paid back by 3888| | // the reader below. 3889| 2.55k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (3889:20): [True: 0, False: 2.55k] ------------------ 3890| 0| return; 3891| 0| } 3892| | 3893| 2.55k| ++it; 3894| 2.55k| if constexpr (not Opts.null_terminated) { 3895| 2.55k| if (it == end) [[unlikely]] { ------------------ | Branch (3895:23): [True: 7, False: 2.54k] ------------------ 3896| 7| ctx.error = error_code::unexpected_end; 3897| 7| return; 3898| 7| } 3899| 2.55k| } 3900| 2.54k| using type_counts = variant_type_count; 3901| 2.55k| constexpr auto n_object_candidates = variant_object_candidate_count_v; 3902| | if constexpr (n_object_candidates < 1) { 3903| | ctx.error = error_code::no_matching_variant_type; 3904| | return; 3905| | } 3906| 2.55k| else if constexpr (n_object_candidates == 1 && tag_v.empty()) { 3907| 2.55k| constexpr auto first_idx = variant_first_object_candidate_v; 3908| 2.55k| using V = std::variant_alternative_t; 3909| 2.55k| if (!std::holds_alternative(value)) value = V{}; ------------------ | Branch (3909:23): [True: 1.80k, False: 748] ------------------ 3910| 2.55k| parse::op()>(std::get(value), ctx, it, end); 3911| 2.55k| return; 3912| | } 3913| | else { 3914| | auto possible_types = bit_array>{}.flip(); 3915| | static constexpr auto& deduction_bits = variant_deduction_bits; 3916| | static constexpr size_t deduction_key_count = variant_deduction_key_count; 3917| | static constexpr auto tag_literal = string_literal_from_view.size()>(tag_v); 3918| | 3919| | // Track if we've encountered a tag and what value it had 3920| | std::optional tag_specified_index{}; 3921| | 3922| | if (skip_ws(ctx, it, end)) { 3923| | return; 3924| | } 3925| | // Once the reader knows which alternative this object holds it may have to read 3926| | // it again from here. Anchor the position rather than keep the pointer: the scan 3927| | // below skips values, and a streaming skip refills, which moves the window out 3928| | // from under a raw pointer (see rewind_anchor). 3929| | auto start = make_rewind_anchor(ctx, it); 3930| | bool first_key = true; 3931| | // Parse bifurcation for tagged variants: 3932| | // 3933| | // Without this optimization, tagged variant parsing always uses two passes: 3934| | // 1. Scan all keys to find the tag (e.g. "type"), skipping values 3935| | // 2. Reset `it = start` and re-parse the entire object into the resolved type 3936| | // 3937| | // When the tag is the first key, the second pass redundantly re-reads every 3938| | // field that follows it. This lambda avoids that: if the tag was the first key, 3939| | // it advances past the trailing comma so the object parser picks up at the 3940| | // second field. If the tag was found later, it falls back to the full re-parse. 3941| | // 3942| | // One exception: if the tag name is also a field on the resolved struct 3943| | // (contains_tag), we must re-parse regardless so the value is stored in 3944| | // the struct field. This override is applied inside each std::visit lambda. 3945| | // 3946| | // Either way the rewind can fail under a streaming read: the window only holds so 3947| | // much, and an object wider than it has no start left to return to. 3948| | auto position_after_tag = [&] { 3949| | if (first_key) { 3950| | if (*it == ',') ++it; // skip comma; handles tag-only objects where *it == '}' 3951| | return true; 3952| | } 3953| | return start.rewind(ctx, it, end); // tag came later, re-parse from the beginning 3954| | }; 3955| | // `first_key` also answers "were we reset to the object start", which is what 3956| | // position_after_tag does for every key but the first. 3957| | for (; *it != '}'; first_key = false) { 3958| | if (!first_key) { 3959| | if (match_invalid_end<',', Opts>(ctx, it, end)) { 3960| | return; 3961| | } 3962| | } 3963| | 3964| | if (skip_ws(ctx, it, end)) { 3965| | return; 3966| | } 3967| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3968| | return; 3969| | } 3970| | 3971| | auto* key_start = it; 3972| | skip_string_view(ctx, it, end); 3973| | if (bool(ctx.error)) [[unlikely]] 3974| | return; 3975| | if (validate_utf8_span(ctx, key_start, it)) [[unlikely]] 3976| | return; 3977| | const sv key = {key_start, size_t(it - key_start)}; 3978| | 3979| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3980| | return; 3981| | } 3982| | 3983| | if constexpr (deduction_key_count > 0) { 3984| | // We first check if a tag is defined and see if the key matches the tag 3985| | if constexpr (not tag_v.empty()) { 3986| | if (key == tag_v) { 3987| | if (parse_ws_colon(ctx, it, end)) { 3988| | return; 3989| | } 3990| | 3991| | using id_type = std::decay_t[0])>; 3992| | 3993| | std::conditional_t, id_type, sv> type_id{}; 3994| | if constexpr (std::integral) { 3995| | from::template op()>(type_id, ctx, it, end); 3996| | } 3997| | else { 3998| | // The id is turned into an index below and never leaves this 3999| | // reader, so the view of the window it borrows cannot outlive it. 4000| | parse_transient_string_view()>(type_id, ctx, it, end); 4001| | } 4002| | if (bool(ctx.error)) [[unlikely]] 4003| | return; 4004| | if (skip_ws(ctx, it, end)) { 4005| | return; 4006| | } 4007| | if (!(*it == ',' || *it == '}')) [[unlikely]] { 4008| | ctx.error = error_code::syntax_error; 4009| | return; 4010| | } 4011| | 4012| | size_t type_index; 4013| | if constexpr (std::integral) { 4014| | type_index = variant_id_to_index::op(type_id); 4015| | } 4016| | else { 4017| | type_index = variant_id_to_index::op( 4018| | type_id.data(), type_id.data() + type_id.size(), type_id.size()); 4019| | } 4020| | if (type_index < ids_v.size()) [[likely]] { 4021| | // Check if the deduced types include the tag-specified type 4022| | // If not, the tag doesn't match the fields 4023| | // We're already inside if constexpr (deduction_registry.size()), so we know deduction 4024| | // is happening. At this point, possible_types has been narrowed by field deduction. 4025| | // Check if the tag-specified type is still possible 4026| | const bool type_is_possible = possible_types[type_index]; 4027| | if (!type_is_possible) { 4028| | // Tag specifies a type that doesn't match the fields seen so far 4029| | ctx.error = error_code::no_matching_variant_type; 4030| | return; 4031| | } 4032| | 4033| | if (!position_after_tag()) return; 4034| | tag_specified_index = type_index; // Store the tag-specified type 4035| | if (value.index() != type_index) emplace_runtime_variant(value, type_index); 4036| | std::visit( 4037| | [&](auto&& v) { 4038| | using V = std::decay_t; 4039| | constexpr bool is_object = 4040| | (glaze_object_t || reflectable) && not custom_read; 4041| | if constexpr (variant_unit_alternative) { 4042| | // A unit alternative carries no data; its object holds only the 4043| | // discriminator. Consume that body through an empty reflected object so 4044| | // unknown-key policy and terminator handling match every other alternative. 4045| | detail::variant_unit_body unit_body{}; 4046| | from::template op(), 4047| | tag_literal>(unit_body, 4048| | ctx, it, end); 4049| | } 4050| | else if constexpr (is_object) { 4051| | if constexpr (contains_tag()) { 4052| | // tag is a struct field, must re-parse 4053| | if (!start.rewind(ctx, it, end)) return; 4054| | } 4055| | from::template op(), tag_literal>(v, ctx, it, 4056| | end); 4057| | } 4058| | else if constexpr (is_memory_object) { 4059| | if (!v) { 4060| | if constexpr (is_specialization_v) { 4061| | if constexpr (requires { v.emplace(); }) { 4062| | v.emplace(); 4063| | } 4064| | else { 4065| | v = typename V::value_type{}; 4066| | } 4067| | } 4068| | else if constexpr (is_specialization_v) 4069| | v = std::make_unique(); 4070| | else if constexpr (is_specialization_v) 4071| | v = std::make_shared(); 4072| | else if constexpr (constructible) { 4073| | v = meta_construct_v(); 4074| | } 4075| | else if constexpr (std::is_pointer_v && 4076| | can_allocate_raw_pointer>) { 4078| | if (!try_allocate_raw_pointer(v, ctx)) { 4079| | return; 4080| | } 4081| | } 4082| | else { 4083| | ctx.error = error_code::invalid_nullable_read; 4084| | return; 4085| | // Cannot read into unset nullable that is not std::optional, 4086| | // std::unique_ptr, or std::shared_ptr 4087| | } 4088| | } 4089| | if constexpr (contains_tag, tag_literal>()) { 4090| | // tag is a struct field, must re-parse 4091| | if (!start.rewind(ctx, it, end)) return; 4092| | } 4093| | from>::template op(), tag_literal>( 4094| | *v, ctx, it, end); 4095| | } 4096| | else if constexpr (custom_read) { 4097| | // Custom handlers parse the remaining body themselves and do not 4098| | // accept the tag template parameter; the tag was already consumed. 4099| | // This only works when the tag was the first key. If it came later, 4100| | // we were reset to the object start and the custom handler would 4101| | // absorb the tag, so error rather than corrupt the value. 4102| | if (!first_key) { 4103| | ctx.error = error_code::feature_not_supported; 4104| | ctx.custom_error_message = 4105| | "the tag must be the first key for a custom variant alternative"; 4106| | return; 4107| | } 4108| | from::template op()>(v, ctx, it, end); 4109| | } 4110| | }, 4111| | value); 4112| | 4113| | return; // we've decoded our target type 4114| | } 4115| | else [[unlikely]] { 4116| | // Check if we have a default type (ids array shorter than variant) 4117| | constexpr auto ids_size = ids_v.size(); 4118| | constexpr auto variant_size = std::variant_size_v; 4119| | if constexpr (ids_size < variant_size) { 4120| | // Use the first unlabeled type as the default 4121| | const auto default_type_index = ids_size; 4122| | 4123| | if (!position_after_tag()) return; 4124| | tag_specified_index = default_type_index; // Store the default type index 4125| | if (value.index() != default_type_index) 4126| | emplace_runtime_variant(value, default_type_index); 4127| | std::visit( 4128| | [&](auto&& v) { 4129| | using V = std::decay_t; 4130| | constexpr bool is_object = 4131| | (glaze_object_t || reflectable) && not custom_read; 4132| | if constexpr (variant_unit_alternative) { 4133| | // A unit alternative carries no data; its object holds only the 4134| | // discriminator. Consume that body through an empty reflected object so 4135| | // unknown-key policy and terminator handling match every other 4136| | // alternative. 4137| | detail::variant_unit_body unit_body{}; 4138| | from::template op(), 4139| | tag_literal>( 4140| | unit_body, ctx, it, end); 4141| | } 4142| | else if constexpr (is_object) { 4143| | if constexpr (contains_tag()) { 4144| | // tag is a struct field, must re-parse 4145| | if (!start.rewind(ctx, it, end)) return; 4146| | } 4147| | from::template op()>(v, ctx, it, end); 4148| | } 4149| | else if constexpr (is_memory_object) { 4150| | if (!v) { 4151| | if constexpr (is_specialization_v) { 4152| | if constexpr (requires { v.emplace(); }) { 4153| | v.emplace(); 4154| | } 4155| | else { 4156| | v = typename V::value_type{}; 4157| | } 4158| | } 4159| | else if constexpr (is_specialization_v) 4160| | v = std::make_unique(); 4161| | else if constexpr (is_specialization_v) 4162| | v = std::make_shared(); 4163| | else if constexpr (constructible) { 4164| | v = meta_construct_v(); 4165| | } 4166| | else if constexpr (std::is_pointer_v && 4167| | can_allocate_raw_pointer< 4168| | Opts, std::decay_t>) { 4169| | if (!try_allocate_raw_pointer(v, ctx)) { 4170| | return; 4171| | } 4172| | } 4173| | else { 4174| | ctx.error = error_code::invalid_nullable_read; 4175| | return; 4176| | } 4177| | } 4178| | if constexpr (contains_tag, tag_literal>()) { 4179| | // tag is a struct field, must re-parse 4180| | if (!start.rewind(ctx, it, end)) return; 4181| | } 4182| | from>::template op()>(*v, ctx, 4183| | it, end); 4184| | } 4185| | else if constexpr (custom_read) { 4186| | // Custom handlers parse the remaining body themselves; this only 4187| | // works when the tag was the first key (see above). If it came 4188| | // later we were reset to the object start, so error rather than 4189| | // let the custom handler absorb the tag. 4190| | if (!first_key) { 4191| | ctx.error = error_code::feature_not_supported; 4192| | ctx.custom_error_message = 4193| | "the tag must be the first key for a custom variant alternative"; 4194| | return; 4195| | } 4196| | from::template op()>(v, ctx, it, end); 4197| | } 4198| | }, 4199| | value); 4200| | 4201| | return; 4202| | } 4203| | else { 4204| | ctx.error = error_code::no_matching_variant_type; 4205| | ctx.custom_error_message = variant_ids_string_v; 4206| | return; 4207| | } 4208| | } 4209| | } 4210| | } 4211| | 4212| | // Inline decode_hash lookup for variant deduction 4213| | using deduction_keys_t = keys_wrapper>; 4214| | constexpr auto& DeductionHashInfo = hash_info; 4215| | const auto deduction_index = 4216| | decode_hash_with_size::op( 4217| | key.data(), key.data() + key.size(), key.size()); 4218| | if (deduction_index < deduction_key_count && variant_deduction_keys[deduction_index] == key) 4219| | [[likely]] { 4220| | possible_types &= deduction_bits[deduction_index]; 4221| | } 4222| | else if constexpr (Opts.error_on_unknown_keys) { 4223| | ctx.error = error_code::unknown_key; 4224| | return; 4225| | } 4226| | } 4227| | else if constexpr (not tag_v.empty()) { 4228| | // empty object case for variant, if there are no normal elements 4229| | if (key == tag_v) { 4230| | if (parse_ws_colon(ctx, it, end)) { 4231| | return; 4232| | } 4233| | 4234| | // The id is turned into an index below and never leaves this reader, 4235| | // so the view of the window it borrows cannot outlive that window. 4236| | std::string_view type_id{}; 4237| | parse_transient_string_view()>(type_id, ctx, it, end); 4238| | if (bool(ctx.error)) [[unlikely]] 4239| | return; 4240| | if (skip_ws(ctx, it, end)) { 4241| | return; 4242| | } 4243| | 4244| | const auto type_index = variant_id_to_index::op( 4245| | type_id.data(), type_id.data() + type_id.size(), type_id.size()); 4246| | if (type_index < ids_v.size()) [[likely]] { 4247| | if (!position_after_tag()) return; 4248| | tag_specified_index = type_index; // Store the tag-specified type 4249| | if (value.index() != type_index) emplace_runtime_variant(value, type_index); 4250| | } 4251| | else { 4252| | // Check if we have a default type (ids array shorter than variant) 4253| | constexpr auto ids_size = ids_v.size(); 4254| | constexpr auto variant_size = std::variant_size_v; 4255| | if constexpr (ids_size < variant_size) { 4256| | // Use the first unlabeled type as the default 4257| | if (!position_after_tag()) return; 4258| | const auto default_index = ids_size; 4259| | tag_specified_index = default_index; // Store the default type index 4260| | if (value.index() != default_index) emplace_runtime_variant(value, default_index); 4261| | } 4262| | else { 4263| | ctx.error = error_code::no_matching_variant_type; 4264| | ctx.custom_error_message = variant_ids_string_v; 4265| | return; 4266| | } 4267| | } 4268| | // Parse the type (handles tag skipping and unknown keys) 4269| | std::visit( 4270| | [&](auto&& v) { 4271| | using V = std::decay_t; 4272| | if constexpr (custom_read) { 4273| | // Custom handlers parse the remaining object body themselves and do not 4274| | // accept the tag template parameter that reflected objects use to skip an 4275| | // interior tag key. That only works when the tag is the first key (it was 4276| | // just consumed). If the tag came after other keys, position_after_tag() 4277| | // reset us to the object start and the custom handler would absorb the tag 4278| | // into its value, so error here rather than corrupt the result. 4279| | if (!first_key) { 4280| | ctx.error = error_code::feature_not_supported; 4281| | ctx.custom_error_message = 4282| | "the tag must be the first key for a custom variant alternative"; 4283| | return; 4284| | } 4285| | from::template op()>(v, ctx, it, end); 4286| | } 4287| | else { 4288| | if constexpr (contains_tag()) { 4289| | // tag is a struct field, must re-parse 4290| | if (!start.rewind(ctx, it, end)) return; 4291| | } 4292| | from::template op(), tag_literal>(v, ctx, it, end); 4293| | } 4294| | }, 4295| | value); 4296| | return; 4297| | } 4298| | else if constexpr (Opts.error_on_unknown_keys) { 4299| | ctx.error = error_code::unknown_key; 4300| | return; 4301| | } 4302| | else { 4303| | // Skip unknown key's value (non-tag key in empty variant) 4304| | if (parse_ws_colon(ctx, it, end)) { 4305| | return; 4306| | } 4307| | skip_value::op(ctx, it, end); 4308| | if (bool(ctx.error)) [[unlikely]] 4309| | return; 4310| | resync_window_end(ctx, end); // a streaming skip refills 4311| | if (skip_ws(ctx, it, end)) { 4312| | return; 4313| | } 4314| | continue; // Continue loop to find the tag 4315| | } 4316| | } 4317| | else if constexpr (Opts.error_on_unknown_keys) { 4318| | ctx.error = error_code::unknown_key; 4319| | return; 4320| | } 4321| | 4322| | auto matching_types = possible_types.popcount(); 4323| | if (matching_types == 0) { 4324| | ctx.error = error_code::no_matching_variant_type; 4325| | return; 4326| | } 4327| | // Only short-circuit for variants without tags 4328| | else if constexpr (tag_v.empty()) { 4329| | if (matching_types == 1) { 4330| | if (!start.rewind(ctx, it, end)) return; 4331| | const auto type_index = possible_types.countr_zero(); 4332| | 4333| | if (value.index() != static_cast(type_index)) 4334| | emplace_runtime_variant(value, type_index); 4335| | std::visit( 4336| | [&](auto&& v) { 4337| | using V = std::decay_t; 4338| | constexpr bool is_object = (glaze_object_t || reflectable) && not custom_read; 4339| | if constexpr (variant_unit_alternative) { 4340| | // A unit alternative carries no data; its object holds only the discriminator. 4341| | // Consume that body through an empty reflected object so unknown-key policy and 4342| | // terminator handling match every other alternative. 4343| | detail::variant_unit_body unit_body{}; 4344| | from::template op(), 4345| | tag_literal>(unit_body, ctx, it, 4346| | end); 4347| | } 4348| | else if constexpr (is_object) { 4349| | from::template op(), tag_literal>(v, ctx, it, end); 4350| | } 4351| | else if constexpr (is_memory_object) { 4352| | if (!v) { 4353| | if constexpr (is_specialization_v) { 4354| | if constexpr (requires { v.emplace(); }) { 4355| | v.emplace(); 4356| | } 4357| | else { 4358| | v = typename V::value_type{}; 4359| | } 4360| | } 4361| | else if constexpr (is_specialization_v) 4362| | v = std::make_unique(); 4363| | else if constexpr (is_specialization_v) 4364| | v = std::make_shared(); 4365| | else if constexpr (constructible) { 4366| | v = meta_construct_v(); 4367| | } 4368| | else if constexpr (std::is_pointer_v && 4369| | can_allocate_raw_pointer>) { 4370| | if (!try_allocate_raw_pointer(v, ctx)) { 4371| | return; 4372| | } 4373| | } 4374| | else { 4375| | ctx.error = error_code::invalid_nullable_read; 4376| | return; 4377| | // Cannot read into unset nullable that is not std::optional, 4378| | // std::unique_ptr, or std::shared_ptr 4379| | } 4380| | } 4381| | from>::template op(), tag_literal>( 4382| | *v, ctx, it, end); 4383| | } 4384| | else if constexpr (custom_read) { 4385| | // Custom handlers parse the remaining body themselves. 4386| | from::template op()>(v, ctx, it, end); 4387| | } 4388| | }, 4389| | value); 4390| | 4391| | return; // we've decoded our target type 4392| | } 4393| | } 4394| | // For tagged variants, continue processing to validate tags 4395| | if (parse_ws_colon(ctx, it, end)) { 4396| | return; 4397| | } 4398| | 4399| | skip_value::op(ctx, it, end); 4400| | if (bool(ctx.error)) [[unlikely]] 4401| | return; 4402| | resync_window_end(ctx, end); // a streaming skip refills 4403| | if (skip_ws(ctx, it, end)) { 4404| | return; 4405| | } 4406| | } 4407| | // Only apply ambiguous variant resolution if we have multiple object types 4408| | if constexpr ((type_counts::n_object + type_counts::n_nullable_object) > 1) { 4409| | // After parsing all keys, check if we have multiple matching types 4410| | // If so, choose the one with the fewest fields 4411| | auto final_matching = possible_types.popcount(); 4412| | if (final_matching == 0) { 4413| | ctx.error = error_code::no_matching_variant_type; 4414| | } 4415| | else if (final_matching == 1) { 4416| | // Single type remains after field deduction 4417| | const auto type_index = possible_types.countr_zero(); 4418| | 4419| | // Validate against tag if one was specified 4420| | if (tag_specified_index.has_value() && 4421| | tag_specified_index.value() != static_cast(type_index)) { 4422| | ctx.error = error_code::no_matching_variant_type; 4423| | return; 4424| | } 4425| | 4426| | if (!start.rewind(ctx, it, end)) return; 4427| | if (value.index() != static_cast(type_index)) 4428| | emplace_runtime_variant(value, type_index); 4429| | std::visit( 4430| | [&](auto&& v) { 4431| | using V = std::decay_t; 4432| | constexpr bool is_object = (glaze_object_t || reflectable) && not custom_read; 4433| | if constexpr (variant_unit_alternative) { 4434| | // A unit alternative carries no data; its object holds only the discriminator. 4435| | // Consume that body through an empty reflected object so unknown-key policy and 4436| | // terminator handling match every other alternative. 4437| | detail::variant_unit_body unit_body{}; 4438| | from::template op(), 4439| | tag_literal>(unit_body, ctx, it, 4440| | end); 4441| | } 4442| | else if constexpr (is_object) { 4443| | from::template op(), tag_literal>(v, ctx, it, end); 4444| | } 4445| | else if constexpr (is_memory_object) { 4446| | if (!v) { 4447| | if constexpr (is_specialization_v) { 4448| | if constexpr (requires { v.emplace(); }) { 4449| | v.emplace(); 4450| | } 4451| | else { 4452| | v = typename V::value_type{}; 4453| | } 4454| | } 4455| | else if constexpr (is_specialization_v) 4456| | v = std::make_unique(); 4457| | else if constexpr (is_specialization_v) 4458| | v = std::make_shared(); 4459| | else if constexpr (constructible) { 4460| | v = meta_construct_v(); 4461| | } 4462| | else if constexpr (std::is_pointer_v && 4463| | can_allocate_raw_pointer>) { 4464| | if (!try_allocate_raw_pointer(v, ctx)) { 4465| | return; 4466| | } 4467| | } 4468| | else { 4469| | ctx.error = error_code::invalid_nullable_read; 4470| | return; 4471| | } 4472| | } 4473| | from>::template op(), tag_literal>(*v, ctx, 4474| | it, end); 4475| | } 4476| | else if constexpr (custom_read) { 4477| | // Custom handlers parse the remaining body themselves. 4478| | from::template op()>(v, ctx, it, end); 4479| | } 4480| | }, 4481| | value); 4482| | } 4483| | else if (final_matching > 1) { 4484| | constexpr auto N = std::variant_size_v; 4485| | 4486| | // Compile-time array of field counts for each variant type 4487| | constexpr auto field_counts = [](std::index_sequence) { 4488| | return std::array { 4489| | ([]() -> size_t { 4490| | using V = std::decay_t>; 4491| | if constexpr (glaze_object_t || reflectable) { 4492| | return reflect::size; 4493| | } 4494| | else if constexpr (is_memory_object) { 4495| | using X = memory_type; 4496| | if constexpr (glaze_object_t || reflectable) { 4497| | return reflect::size; 4498| | } 4499| | else { 4500| | return (std::numeric_limits::max)(); 4501| | } 4502| | } 4503| | else { 4504| | return (std::numeric_limits::max)(); 4505| | } 4506| | }.template operator()())... 4507| | }; 4508| | }(std::make_index_sequence{}); 4509| | 4510| | // Find the type with minimum field count among the possible types 4511| | size_t min_fields = (std::numeric_limits::max)(); 4512| | size_t chosen_index = N; // Invalid index initially 4513| | 4514| | for (size_t i = 0; i < N; ++i) { 4515| | if (possible_types[i] && field_counts[i] < min_fields) { 4516| | min_fields = field_counts[i]; 4517| | chosen_index = i; 4518| | } 4519| | } 4520| | 4521| | if (chosen_index < N) { 4522| | // Validate against tag if one was specified 4523| | if (tag_specified_index.has_value() && tag_specified_index.value() != chosen_index) { 4524| | ctx.error = error_code::no_matching_variant_type; 4525| | return; 4526| | } 4527| | 4528| | if (!start.rewind(ctx, it, end)) return; 4529| | if (value.index() != chosen_index) emplace_runtime_variant(value, chosen_index); 4530| | std::visit( 4531| | [&](auto&& v) { 4532| | using V = std::decay_t; 4533| | constexpr bool is_object = (glaze_object_t || reflectable) && not custom_read; 4534| | if constexpr (variant_unit_alternative) { 4535| | // A unit alternative carries no data; its object holds only the discriminator. 4536| | // Consume that body through an empty reflected object so unknown-key policy and 4537| | // terminator handling match every other alternative. 4538| | detail::variant_unit_body unit_body{}; 4539| | from::template op(), 4540| | tag_literal>(unit_body, ctx, it, 4541| | end); 4542| | } 4543| | else if constexpr (is_object) { 4544| | from::template op(), tag_literal>(v, ctx, it, end); 4545| | } 4546| | else if constexpr (is_memory_object) { 4547| | if (!v) { 4548| | if constexpr (is_specialization_v) { 4549| | if constexpr (requires { v.emplace(); }) { 4550| | v.emplace(); 4551| | } 4552| | else { 4553| | v = typename V::value_type{}; 4554| | } 4555| | } 4556| | else if constexpr (is_specialization_v) 4557| | v = std::make_unique(); 4558| | else if constexpr (is_specialization_v) 4559| | v = std::make_shared(); 4560| | else if constexpr (constructible) { 4561| | v = meta_construct_v(); 4562| | } 4563| | else if constexpr (std::is_pointer_v && 4564| | can_allocate_raw_pointer>) { 4565| | if (!try_allocate_raw_pointer(v, ctx)) { 4566| | return; 4567| | } 4568| | } 4569| | else { 4570| | ctx.error = error_code::invalid_nullable_read; 4571| | return; 4572| | } 4573| | } 4574| | from>::template op(), tag_literal>( 4575| | *v, ctx, it, end); 4576| | } 4577| | else if constexpr (custom_read) { 4578| | // Custom handlers parse the remaining body themselves. 4579| | from::template op()>(v, ctx, it, end); 4580| | } 4581| | }, 4582| | value); 4583| | } 4584| | else { 4585| | ctx.error = error_code::no_matching_variant_type; 4586| | } 4587| | } 4588| | } 4589| | else { 4590| | // For variants with 0 or 1 object types, use the original error handling 4591| | ctx.error = error_code::no_matching_variant_type; 4592| | } 4593| | } 4594| 0| break; 4595| 2.55k| } 4596| 3| case '[': ------------------ | Branch (4596:13): [True: 3, False: 4.68k] ------------------ 4597| | // As with '{' above: the array reader each alternative goes through counts the level. 4598| 3| process_variant_alternatives::template op(value, ctx, it, end); 4599| 3| break; 4600| 2.11k| case '"': { ------------------ | Branch (4600:13): [True: 2.11k, False: 2.57k] ------------------ 4601| 2.11k| process_variant_alternatives::template op(value, ctx, it, end); 4602| 2.11k| break; 4603| 2.55k| } 4604| 3| case 't': ------------------ | Branch (4604:13): [True: 3, False: 4.68k] ------------------ 4605| 6| case 'f': { ------------------ | Branch (4605:13): [True: 3, False: 4.68k] ------------------ 4606| 6| process_variant_alternatives::template op(value, ctx, it, end); 4607| 6| break; 4608| 3| } 4609| 3| case 'n': ------------------ | Branch (4609:13): [True: 3, False: 4.68k] ------------------ 4610| 3| if constexpr (variant_count_v == 0) { 4611| 3| ctx.error = error_code::no_matching_variant_type; 4612| | } 4613| | else { 4614| | constexpr auto first_idx = variant_first_index_v; 4615| | using V = std::variant_alternative_t; 4616| | if (!std::holds_alternative(value)) value = V{}; 4617| | match<"null", Opts>(ctx, it, end); 4618| | } 4619| 3| break; 4620| 5| default: { ------------------ | Branch (4620:13): [True: 5, False: 4.68k] ------------------ 4621| | // Not bool, string, object, or array so must be number or null 4622| 5| process_variant_alternatives::template op(value, ctx, it, end); 4623| 5| } 4624| 4.68k| } 4625| | } 4626| | else { 4627| | // For non-auto-deducible variants, try each type until one succeeds 4628| | constexpr auto N = std::variant_size_v; 4629| | bool parsed = false; 4630| | bool exhausted = false; // speculation budget spent; see charge_speculation 4631| | 4632| | for_each([&]() { 4633| | if (parsed || exhausted || variant_alternative_exhausted(ctx)) return; 4634| | 4635| | auto copy_it = it; 4636| | // A rejected alternative may have bailed out inside a container, which leaves its 4637| | // nesting level counted (see enter_depth), so the depth rewinds with the iterator. 4638| | const auto copy_depth = ctx.depth; 4639| | 4640| | // Try parsing as this type 4641| | if (value.index() != I) { 4642| | emplace_runtime_variant(value, I); 4643| | } 4644| | 4645| | std::visit([&](auto&& v) { parse::op(v, ctx, it, end); }, value); 4646| | if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 4647| | exhausted = true; // only rejected attempts are charged; see charge_speculation 4648| | } 4649| | 4650| | if (!bool(ctx.error)) { 4651| | parsed = true; 4652| | } 4653| | else if constexpr (not Options.null_terminated) { 4654| | // In non-null-terminated mode, if we hit end_reached after advancing the iterator, 4655| | // it means we successfully parsed the value but couldn't skip trailing whitespace 4656| | if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 4657| | // We advanced the iterator, so we did parse something -- unless what advanced it 4658| | // was an abandoned attempt, which is what a spent speculation budget means. 4659| | parsed = true; 4660| | ctx.error = error_code::none; 4661| | } 4662| | else { 4663| | // Reset for next attempt (unless this is the last type) 4664| | it = copy_it; 4665| | rewind_depth(ctx, copy_depth); 4666| | if constexpr (I + 1 < N) { 4667| | if (not exhausted && not variant_alternative_exhausted(ctx)) { 4668| | ctx.error = error_code::none; // Clear error for next attempt 4669| | } 4670| | } 4671| | } 4672| | } 4673| | else { 4674| | // Reset for next attempt (unless this is the last type) 4675| | it = copy_it; 4676| | rewind_depth(ctx, copy_depth); 4677| | if constexpr (I + 1 < N) { 4678| | if (not exhausted && not variant_alternative_exhausted(ctx)) { 4679| | ctx.error = error_code::none; // Clear error for next attempt 4680| | } 4681| | } 4682| | } 4683| | }); 4684| | } 4685| 4.68k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj1EEERN9repe_fuzz6amountETkNS_10is_contextERNS_7contextERPKcSA_EEvOT0_OT1_OT2_T3_: 49| 11.6k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 11.6k| else { 60| 11.6k| using V = std::remove_cvref_t; 61| 11.6k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 11.6k| end); 63| 11.6k| } 64| 11.6k| } _ZN3glz4fromILj10EN9repe_fuzz6amountEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_: 2791| 11.6k| { 2792| 11.6k| static constexpr auto num_members = reflect::size; 2793| | 2794| 11.6k| static constexpr auto Opts = opening_handled_off()>(); 2795| | if constexpr (!check_opening_handled(Options)) { 2796| | if constexpr (!check_ws_handled(Options)) { 2797| | if (skip_ws(ctx, it, end)) { 2798| | return; 2799| | } 2800| | } 2801| | if (match_invalid_end<'{', Opts>(ctx, it, end)) { 2802| | return; 2803| | } 2804| | if constexpr (not Opts.null_terminated) { 2805| | if (it == end) [[unlikely]] { 2806| | ctx.error = error_code::unexpected_end; 2807| | return; 2808| | } 2809| | } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| | if (enter_depth(ctx)) [[unlikely]] { 2813| | return; 2814| | } 2815| | } 2816| 11.6k| const auto ws_start = it; 2817| 11.6k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 34, False: 11.5k] ------------------ 2818| 34| return; 2819| 34| } 2820| 11.5k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 11.5k| else { 2895| 11.5k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 11.5k| if constexpr ((glaze_object_t || reflectable) && 2897| 11.5k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 11.5k| return bit_array{}; 2899| 11.5k| } 2900| 11.5k| else { 2901| 11.5k| return nullptr; 2902| 11.5k| } 2903| 11.5k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 11.5k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 11.5k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 11.5k| return has_includer_member; 2915| 11.5k| } 2916| 11.5k| else { 2917| 11.5k| return false; 2918| 11.5k| } 2919| 11.5k| }(); 2920| 11.5k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 11.5k| [[maybe_unused]] const std::conditional_t>, 2930| 11.5k| inert_key_bits_scope> published_bits{ 2931| 11.5k| ctx, [&]() -> void* { 2932| 11.5k| if constexpr (tracks_include_keys) { 2933| 11.5k| return &fields; 2934| 11.5k| } 2935| 11.5k| else { 2936| 11.5k| return nullptr; 2937| 11.5k| } 2938| 11.5k| }()}; 2939| | 2940| 11.5k| size_t read_count{}; // for partial_read 2941| | 2942| 11.5k| bool first = true; 2943| 31.1k| while (true) { ------------------ | Branch (2943:20): [True: 22.2k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 22.2k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 2.51k, False: 19.7k] ------------------ 2981| 2.51k| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| 2.51k| if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| 2.51k| } 3017| 2.51k| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 2.51k| if constexpr (not Opts.null_terminated) { 3019| 2.51k| if (it == end) { ------------------ | Branch (3019:26): [True: 23, False: 2.48k] ------------------ 3020| 23| ctx.error = error_code::end_reached; 3021| 23| return; 3022| 23| } 3023| 2.51k| } 3024| 2.48k| return; 3025| 2.51k| } 3026| 19.7k| else if (first) { ------------------ | Branch (3026:25): [True: 9.08k, False: 10.6k] ------------------ 3027| 9.08k| first = false; 3028| 9.08k| } 3029| 10.6k| else { 3030| 10.6k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 146, False: 10.5k] ------------------ 3031| 146| return; 3032| 146| } 3033| 10.5k| if constexpr (not Opts.null_terminated) { 3034| 10.5k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 10.5k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 10.5k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| | (!Opts.comments)) { 3042| | if (ws_size && ws_size < size_t(end - it)) { 3043| | skip_matching_ws(ws_start, it, ws_size); 3044| | } 3045| | } 3046| | 3047| 10.5k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 28, False: 10.4k] ------------------ 3048| 28| return; 3049| 28| } 3050| 10.5k| } 3051| | 3052| 19.5k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [True: 0, Folded] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| 19.5k| else if constexpr (reflection_type) { 3118| 19.5k| static_assert(bool(hash_info.type)); 3119| | 3120| 19.5k| if (*it != '"') [[unlikely]] { ------------------ | Branch (3120:23): [True: 336, False: 19.2k] ------------------ 3121| 336| ctx.error = error_code::expected_quote; 3122| 336| return; 3123| 336| } 3124| 19.2k| ++it; 3125| 19.2k| if constexpr (not Opts.null_terminated) { 3126| 19.2k| if (it == end) [[unlikely]] { ------------------ | Branch (3126:26): [True: 20, False: 19.2k] ------------------ 3127| 20| ctx.error = error_code::unexpected_end; 3128| 20| return; 3129| 20| } 3130| 19.2k| } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| 19.2k| else { 3181| 19.2k| parse_and_invoke(value, ctx, it, end); 3182| 19.2k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3182:26): [True: 8.52k, False: 10.7k] ------------------ 3183| 8.52k| return; 3184| 19.2k| } 3185| | } 3186| | else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| | auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| | else { 3200| | parse::op()>(value[key], ctx, it, end); 3201| | } 3202| | }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| | using Key = typename T::key_type; 3206| | if constexpr (std::is_same_v) { 3207| | ctx.scratch.clear(); 3208| | parse::op(ctx.scratch, ctx, it, end); 3209| | if (bool(ctx.error)) [[unlikely]] 3210| | return; 3211| | 3212| | if (parse_ws_colon(ctx, it, end)) { 3213| | return; 3214| | } 3215| | 3216| | reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| | if (bool(ctx.error)) [[unlikely]] 3223| | return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| | } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 19.5k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 20, False: 19.5k] ------------------ 3294| 20| return; 3295| 20| } 3296| 19.5k| } 3297| 11.5k| } 3298| 11.5k| } _ZZN3glz4fromILj10EN9repe_fuzz6amountEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 11.5k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 11.5k| else { 2901| 11.5k| return nullptr; 2902| 11.5k| } 2903| 11.5k| }(); _ZZN3glz4fromILj10EN9repe_fuzz6amountEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj1EEETnNS_14string_literalEXtlNS6_ILm1EEEEERS2_TkNS_10is_contextERNS_7contextERPKcSC_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 11.5k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 11.5k| else { 2936| 11.5k| return nullptr; 2937| 11.5k| } 2938| 11.5k| }()}; _ZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6amountERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_: 382| 19.2k| { 383| 19.2k| constexpr auto N = reflect::size; 384| | 385| 19.2k| if constexpr (N == 1) { 386| 19.2k| decode_index(value, ctx, it, end, selected_index...); 387| | } 388| | else if constexpr (check_linear_search(Opts)) { 389| | // Linear search path 390| | auto key_start = it; 391| | const auto index = decode_linear(ctx, it, end); 392| | if (bool(ctx.error)) [[unlikely]] 393| | return; 394| | 395| | if (index >= N) [[unlikely]] { 396| | if constexpr (Opts.error_on_unknown_keys) { 397| | ctx.error = error_code::unknown_key; 398| | return; 399| | } 400| | else { 401| | // it sits one past the closing quote, so the raw key spans [key_start, it - 1) 402| | if (validate_utf8_span(ctx, key_start, it - 1)) [[unlikely]] { 403| | return; 404| | } 405| | const sv key{key_start, size_t(it - key_start - 1)}; 406| | if constexpr (not Opts.null_terminated) { 407| | if (it == end) [[unlikely]] { 408| | ctx.error = error_code::unexpected_end; 409| | return; 410| | } 411| | } 412| | if (parse_ws_colon(ctx, it, end)) { 413| | return; 414| | } 415| | parse::handle_unknown(key, value, ctx, it, end); 416| | return; 417| | } 418| | } 419| | 420| | if constexpr (not Opts.null_terminated) { 421| | if (it == end) [[unlikely]] { 422| | ctx.error = error_code::unexpected_end; 423| | return; 424| | } 425| | } 426| | if (skip_ws(ctx, it, end)) { 427| | return; 428| | } 429| | if (match_invalid_end<':', Opts>(ctx, it, end)) { 430| | return; 431| | } 432| | if (skip_ws(ctx, it, end)) { 433| | return; 434| | } 435| | 436| | // Fold expression dispatch - avoids jump table overhead for smaller binary size. 437| | // For linear_search, pass Opts through to the field parser to avoid duplicate template 438| | // instantiations; the whitespace before the value has already been skipped either way. 439| | [&](std::index_sequence) { 440| | (void)(((index == Is ? (decode_field_value(value, ctx, it, end, selected_index...), true) 441| | : false) || 442| | ...)); 443| | }(std::make_index_sequence{}); 444| | } 445| | else { 446| | // Hash-based lookup 447| | constexpr auto& HashInfo = hash_info; 448| | constexpr auto type = HashInfo.type; 449| | static_assert(bool(type), "invalid hash algorithm"); 450| | 451| | const auto index = decode_hash::op(it, end); 452| | 453| | if (index >= N) [[unlikely]] { 454| | if constexpr (Opts.error_on_unknown_keys) { 455| | ctx.error = error_code::unknown_key; 456| | return; 457| | } 458| | else { 459| | auto start = it; 460| | skip_string_view(ctx, it, end); 461| | if (bool(ctx.error)) [[unlikely]] 462| | return; 463| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 464| | return; 465| | const sv key = {start, size_t(it - start)}; 466| | ++it; // skip the quote 467| | if constexpr (not Opts.null_terminated) { 468| | if (it == end) [[unlikely]] { 469| | ctx.error = error_code::unexpected_end; 470| | return; 471| | } 472| | } 473| | if (parse_ws_colon(ctx, it, end)) { 474| | return; 475| | } 476| | parse::handle_unknown(key, value, ctx, it, end); 477| | return; 478| | } 479| | } 480| | 481| | if constexpr (N == 2) { 482| | if (index == 0) { 483| | decode_index(value, ctx, it, end, selected_index...); 484| | } 485| | else { 486| | decode_index(value, ctx, it, end, selected_index...); 487| | } 488| | } 489| | else { 490| | visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); 491| | } 492| | } 493| 19.2k| } _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6amountELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 19.2k| { 313| 19.2k| static constexpr auto Key = get(reflect::keys); 314| 19.2k| static constexpr auto KeyWithEndQuote = join_v>; 315| 19.2k| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 19.2k| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 18.7k, False: 486] | Branch (321:52): [True: 11.1k, False: 7.59k] ------------------ 322| 11.1k| it += Length; 323| 11.1k| if constexpr (not Opts.null_terminated) { 324| 11.1k| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 11.1k] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 11.1k| } 329| | 330| 11.1k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 15, False: 11.1k] ------------------ 331| 15| return; 332| 15| } 333| 11.1k| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 22, False: 11.1k] ------------------ 334| 22| return; 335| 22| } 336| 11.1k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 11.0k] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 11.0k| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 11.0k| } 343| 8.08k| else [[unlikely]] { 344| 8.08k| decode_index_unknown_key(value, ctx, it, end); 345| 8.08k| } 346| 19.2k| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz6amountELm0ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 11.0k| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 11.0k| else { 274| 11.0k| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 11.0k| else { 298| 11.0k| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 11.0k| it, end); 300| 11.0k| } 301| 11.0k| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 11.0k| } _ZN3glz24decode_index_unknown_keyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6amountERS3_TkNS_10is_contextERNS_7contextERPKcS8_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT2_OT3_T4_: 177| 8.08k| { 178| 8.08k| if constexpr (Opts.error_on_unknown_keys) { 179| 8.08k| ctx.error = error_code::unknown_key; 180| | } 181| | else { 182| | auto* start = it; 183| | uint64_t ascii_acc{}; 184| | skip_string_view(ctx, it, end, ascii_acc); 185| | if (bool(ctx.error)) [[unlikely]] 186| | return; 187| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 188| | return; 189| | const sv key = {start, size_t(it - start)}; 190| | ++it; 191| | if constexpr (not Opts.null_terminated) { 192| | if (it == end) [[unlikely]] { 193| | ctx.error = error_code::unexpected_end; 194| | return; 195| | } 196| | } 197| | 198| | if (parse_ws_colon(ctx, it, end)) { 199| | return; 200| | } 201| | 202| | parse::handle_unknown(key, value, ctx, it, end); 203| | } 204| 8.08k| } _ZN3glz28process_variant_alternativesINSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_16is_variant_arrayEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSK_EEvOT0_OT1_OT2_T3_: 3520| 1.90k| { 3521| 1.90k| constexpr auto category_count = variant_count_v; 3522| | 3523| 1.90k| if constexpr (category_count == 0) { 3524| 1.90k| ctx.error = error_code::no_matching_variant_type; 3525| | } 3526| | else { 3527| | constexpr auto N = std::variant_size_v; 3528| | constexpr auto const_count = variant_filtered_count_v; 3529| | constexpr auto non_const_count = variant_filtered_count_v; 3530| | 3531| | bool found_match{}; 3532| | // Set when the speculative parsing budget runs out; see charge_speculation. An ambiguous 3533| | // nest re-parses the same subtree per alternative at every level, which is exponential, 3534| | // so the budget stops it and the failure already in hand is reported. 3535| | bool exhausted{}; 3536| | 3537| | // First pass: const glaze types in this category 3538| | if constexpr (const_count > 0) { 3539| | for_each([&]() { 3540| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3541| | return; 3542| | } 3543| | using V = std::variant_alternative_t; 3544| | if constexpr (Trait::value && glaze_const_value_t) { 3545| | // run time substitute to compare to const value 3546| | std::remove_const_t>>> substitute{}; 3547| | auto copy_it{it}; 3548| | // A rejected alternative may have bailed out inside a container, which leaves its 3549| | // nesting level counted (see enter_depth). Rewind the depth with the iterator so 3550| | // trying N alternatives cannot spend N levels of the recursion budget. 3551| | const auto copy_depth{ctx.depth}; 3552| | parse::op()>(substitute, ctx, it, end); 3553| | static constexpr auto const_value{*meta_wrapper_v}; 3554| | if (substitute == const_value) { 3555| | found_match = true; 3556| | if (!std::holds_alternative(value)) { 3557| | value = V{}; 3558| | } 3559| | } 3560| | else { 3561| | // Rejected: charge the bytes it parsed before we rewind. See charge_speculation. 3562| | if (!charge_speculation(ctx, size_t(it - copy_it))) { 3563| | exhausted = true; 3564| | } 3565| | if constexpr (not Options.null_terminated) { 3566| | if (ctx.error == error_code::end_reached && not exhausted) { 3567| | ctx.error = error_code::none; 3568| | } 3569| | } 3570| | it = copy_it; 3571| | rewind_depth(ctx, copy_depth); 3572| | } 3573| | } 3574| | }); 3575| | if (found_match) { 3576| | return; 3577| | } 3578| | } 3579| | 3580| | // Second pass: non-const types in this category 3581| | if constexpr (non_const_count > 0) { 3582| | // Track position within matching types for "is last" check. 3583| | // We iterate over all variant indices but only process matching types, 3584| | // so we need runtime tracking (vs the old tuple-based approach where 3585| | // the loop index directly corresponded to position in filtered set). 3586| | // This has negligible cost: one increment per matching type. 3587| | size_t non_const_idx = 0; 3588| | 3589| | for_each([&]() { 3590| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3591| | return; 3592| | } 3593| | using V = std::variant_alternative_t; 3594| | if constexpr (Trait::value && !glaze_const_value_t) { 3595| | auto copy_it{it}; 3596| | const auto copy_depth{ctx.depth}; // rewound with `it`; see the note above 3597| | if (!std::holds_alternative(value)) { 3598| | value = V{}; 3599| | } 3600| | parse::op()>(std::get(value), ctx, it, end); 3601| | if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 3602| | exhausted = true; // only rejected attempts are charged; see charge_speculation 3603| | } 3604| | if (!bool(ctx.error)) { 3605| | found_match = true; 3606| | } 3607| | else if constexpr (not Options.null_terminated) { 3608| | constexpr bool is_complete_type = 3609| | num_t || bool_t || string_t || std::is_enum_v || tuple_t || is_std_tuple; 3610| | 3611| | if constexpr (is_complete_type) { 3612| | if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 3613| | found_match = true; 3614| | ctx.error = error_code::none; 3615| | } 3616| | else { 3617| | it = copy_it; 3618| | rewind_depth(ctx, copy_depth); 3619| | if (non_const_idx + 1 < non_const_count && not exhausted && 3620| | not variant_alternative_exhausted(ctx)) { 3621| | ctx.error = error_code::none; 3622| | } 3623| | } 3624| | } 3625| | else { 3626| | it = copy_it; 3627| | rewind_depth(ctx, copy_depth); 3628| | if (non_const_idx + 1 < non_const_count && not exhausted && 3629| | not variant_alternative_exhausted(ctx)) { 3630| | ctx.error = error_code::none; 3631| | } 3632| | } 3633| | } 3634| | else { 3635| | it = copy_it; 3636| | rewind_depth(ctx, copy_depth); 3637| | if (non_const_idx + 1 < non_const_count && not exhausted && 3638| | not variant_alternative_exhausted(ctx)) { 3639| | ctx.error = error_code::none; 3640| | } 3641| | } 3642| | ++non_const_idx; 3643| | } 3644| | }); 3645| | if (!found_match) { 3646| | if constexpr (non_const_count == 1) { 3647| | // Keep the specific error from the single type we tried 3648| | } 3649| | else if (not exhausted && not variant_alternative_exhausted(ctx)) { 3650| | // Over-nested input is not a failure of the alternative set; keep saying so. 3651| | ctx.error = error_code::no_matching_variant_type; 3652| | } 3653| | } 3654| | } 3655| | else { 3656| | ctx.error = error_code::no_matching_variant_type; 3657| | } 3658| | } 3659| 1.90k| } _ZN3glz28process_variant_alternativesINSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_14is_variant_strEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSK_EEvOT0_OT1_OT2_T3_: 3520| 3.21k| { 3521| 3.21k| constexpr auto category_count = variant_count_v; 3522| | 3523| | if constexpr (category_count == 0) { 3524| | ctx.error = error_code::no_matching_variant_type; 3525| | } 3526| 3.21k| else { 3527| 3.21k| constexpr auto N = std::variant_size_v; 3528| 3.21k| constexpr auto const_count = variant_filtered_count_v; 3529| 3.21k| constexpr auto non_const_count = variant_filtered_count_v; 3530| | 3531| 3.21k| bool found_match{}; 3532| | // Set when the speculative parsing budget runs out; see charge_speculation. An ambiguous 3533| | // nest re-parses the same subtree per alternative at every level, which is exponential, 3534| | // so the budget stops it and the failure already in hand is reported. 3535| 3.21k| bool exhausted{}; 3536| | 3537| | // First pass: const glaze types in this category 3538| | if constexpr (const_count > 0) { 3539| | for_each([&]() { 3540| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3541| | return; 3542| | } 3543| | using V = std::variant_alternative_t; 3544| | if constexpr (Trait::value && glaze_const_value_t) { 3545| | // run time substitute to compare to const value 3546| | std::remove_const_t>>> substitute{}; 3547| | auto copy_it{it}; 3548| | // A rejected alternative may have bailed out inside a container, which leaves its 3549| | // nesting level counted (see enter_depth). Rewind the depth with the iterator so 3550| | // trying N alternatives cannot spend N levels of the recursion budget. 3551| | const auto copy_depth{ctx.depth}; 3552| | parse::op()>(substitute, ctx, it, end); 3553| | static constexpr auto const_value{*meta_wrapper_v}; 3554| | if (substitute == const_value) { 3555| | found_match = true; 3556| | if (!std::holds_alternative(value)) { 3557| | value = V{}; 3558| | } 3559| | } 3560| | else { 3561| | // Rejected: charge the bytes it parsed before we rewind. See charge_speculation. 3562| | if (!charge_speculation(ctx, size_t(it - copy_it))) { 3563| | exhausted = true; 3564| | } 3565| | if constexpr (not Options.null_terminated) { 3566| | if (ctx.error == error_code::end_reached && not exhausted) { 3567| | ctx.error = error_code::none; 3568| | } 3569| | } 3570| | it = copy_it; 3571| | rewind_depth(ctx, copy_depth); 3572| | } 3573| | } 3574| | }); 3575| | if (found_match) { 3576| | return; 3577| | } 3578| | } 3579| | 3580| | // Second pass: non-const types in this category 3581| 3.21k| if constexpr (non_const_count > 0) { 3582| | // Track position within matching types for "is last" check. 3583| | // We iterate over all variant indices but only process matching types, 3584| | // so we need runtime tracking (vs the old tuple-based approach where 3585| | // the loop index directly corresponded to position in filtered set). 3586| | // This has negligible cost: one increment per matching type. 3587| 3.21k| size_t non_const_idx = 0; 3588| | 3589| 3.21k| for_each([&]() { 3590| 3.21k| if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3591| 3.21k| return; 3592| 3.21k| } 3593| 3.21k| using V = std::variant_alternative_t; 3594| 3.21k| if constexpr (Trait::value && !glaze_const_value_t) { 3595| 3.21k| auto copy_it{it}; 3596| 3.21k| const auto copy_depth{ctx.depth}; // rewound with `it`; see the note above 3597| 3.21k| if (!std::holds_alternative(value)) { 3598| 3.21k| value = V{}; 3599| 3.21k| } 3600| 3.21k| parse::op()>(std::get(value), ctx, it, end); 3601| 3.21k| if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 3602| 3.21k| exhausted = true; // only rejected attempts are charged; see charge_speculation 3603| 3.21k| } 3604| 3.21k| if (!bool(ctx.error)) { 3605| 3.21k| found_match = true; 3606| 3.21k| } 3607| 3.21k| else if constexpr (not Options.null_terminated) { 3608| 3.21k| constexpr bool is_complete_type = 3609| 3.21k| num_t || bool_t || string_t || std::is_enum_v || tuple_t || is_std_tuple; 3610| | 3611| 3.21k| if constexpr (is_complete_type) { 3612| 3.21k| if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 3613| 3.21k| found_match = true; 3614| 3.21k| ctx.error = error_code::none; 3615| 3.21k| } 3616| 3.21k| else { 3617| 3.21k| it = copy_it; 3618| 3.21k| rewind_depth(ctx, copy_depth); 3619| 3.21k| if (non_const_idx + 1 < non_const_count && not exhausted && 3620| 3.21k| not variant_alternative_exhausted(ctx)) { 3621| 3.21k| ctx.error = error_code::none; 3622| 3.21k| } 3623| 3.21k| } 3624| 3.21k| } 3625| 3.21k| else { 3626| 3.21k| it = copy_it; 3627| 3.21k| rewind_depth(ctx, copy_depth); 3628| 3.21k| if (non_const_idx + 1 < non_const_count && not exhausted && 3629| 3.21k| not variant_alternative_exhausted(ctx)) { 3630| 3.21k| ctx.error = error_code::none; 3631| 3.21k| } 3632| 3.21k| } 3633| 3.21k| } 3634| 3.21k| else { 3635| 3.21k| it = copy_it; 3636| 3.21k| rewind_depth(ctx, copy_depth); 3637| 3.21k| if (non_const_idx + 1 < non_const_count && not exhausted && 3638| 3.21k| not variant_alternative_exhausted(ctx)) { 3639| 3.21k| ctx.error = error_code::none; 3640| 3.21k| } 3641| 3.21k| } 3642| 3.21k| ++non_const_idx; 3643| 3.21k| } 3644| 3.21k| }); 3645| 3.21k| if (!found_match) { ------------------ | Branch (3645:20): [True: 628, False: 2.58k] ------------------ 3646| 628| if constexpr (non_const_count == 1) { 3647| | // Keep the specific error from the single type we tried 3648| | } 3649| | else if (not exhausted && not variant_alternative_exhausted(ctx)) { 3650| | // Over-nested input is not a failure of the alternative set; keep saying so. 3651| | ctx.error = error_code::no_matching_variant_type; 3652| | } 3653| 628| } 3654| | } 3655| | else { 3656| | ctx.error = error_code::no_matching_variant_type; 3657| | } 3658| 3.21k| } 3659| 3.21k| } _ZZN3glz28process_variant_alternativesINSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_14is_variant_strEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSK_EEvOT0_OT1_OT2_T3_ENKUlTnmvE_clILm0EEEDav: 3589| 3.21k| for_each([&]() { 3590| 3.21k| if (found_match || exhausted || variant_alternative_exhausted(ctx)) { ------------------ | Branch (3590:23): [True: 0, False: 3.21k] | Branch (3590:38): [True: 0, False: 3.21k] | Branch (3590:51): [True: 0, False: 3.21k] ------------------ 3591| 0| return; 3592| 0| } 3593| 3.21k| using V = std::variant_alternative_t; 3594| 3.21k| if constexpr (Trait::value && !glaze_const_value_t) { 3595| 3.21k| auto copy_it{it}; 3596| 3.21k| const auto copy_depth{ctx.depth}; // rewound with `it`; see the note above 3597| 3.21k| if (!std::holds_alternative(value)) { ------------------ | Branch (3597:26): [True: 1.66k, False: 1.55k] ------------------ 3598| 1.66k| value = V{}; 3599| 1.66k| } 3600| 3.21k| parse::op()>(std::get(value), ctx, it, end); 3601| 3.21k| if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { ------------------ | Branch (3601:26): [True: 719, False: 2.49k] | Branch (3601:45): [True: 0, False: 719] ------------------ 3602| 0| exhausted = true; // only rejected attempts are charged; see charge_speculation 3603| 0| } 3604| 3.21k| if (!bool(ctx.error)) { ------------------ | Branch (3604:26): [True: 2.49k, False: 719] ------------------ 3605| 2.49k| found_match = true; 3606| 2.49k| } 3607| 719| else if constexpr (not Options.null_terminated) { 3608| 719| constexpr bool is_complete_type = 3609| 719| num_t || bool_t || string_t || std::is_enum_v || tuple_t || is_std_tuple; ------------------ | Branch (3609:28): [Folded, False: 0] | Branch (3609:40): [Folded, False: 0] | Branch (3609:53): [True: 0, Folded] | Branch (3609:68): [Folded, False: 0] | Branch (3609:89): [Folded, False: 0] | Branch (3609:103): [Folded, False: 0] ------------------ 3610| | 3611| 719| if constexpr (is_complete_type) { 3612| 719| if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { ------------------ | Branch (3612:32): [True: 91, False: 628] | Branch (3612:72): [True: 91, False: 0] | Branch (3612:88): [True: 91, False: 0] ------------------ 3613| 91| found_match = true; 3614| 91| ctx.error = error_code::none; 3615| 91| } 3616| 628| else { 3617| 628| it = copy_it; 3618| 628| rewind_depth(ctx, copy_depth); 3619| 628| if (non_const_idx + 1 < non_const_count && not exhausted && ------------------ | Branch (3619:35): [True: 0, False: 628] | Branch (3619:74): [True: 0, False: 0] ------------------ 3620| 0| not variant_alternative_exhausted(ctx)) { ------------------ | Branch (3620:35): [True: 0, False: 0] ------------------ 3621| 0| ctx.error = error_code::none; 3622| 0| } 3623| 628| } 3624| | } 3625| | else { 3626| | it = copy_it; 3627| | rewind_depth(ctx, copy_depth); 3628| | if (non_const_idx + 1 < non_const_count && not exhausted && 3629| | not variant_alternative_exhausted(ctx)) { 3630| | ctx.error = error_code::none; 3631| | } 3632| | } 3633| | } 3634| | else { 3635| | it = copy_it; 3636| | rewind_depth(ctx, copy_depth); 3637| | if (non_const_idx + 1 < non_const_count && not exhausted && 3638| | not variant_alternative_exhausted(ctx)) { 3639| | ctx.error = error_code::none; 3640| | } 3641| | } 3642| 3.21k| ++non_const_idx; 3643| 3.21k| } 3644| 3.21k| }); _ZN3glz29variant_alternative_exhaustedITkNS_10is_contextENS_7contextEEEbRT_: 3509| 3.84k| { 3510| 3.84k| return ctx.error == error_code::exceeded_max_recursive_depth; 3511| 3.84k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEETkNS_10is_contextERNS_7contextERPKcSF_EEvOT0_OT1_OT2_T3_: 49| 3.21k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 3.21k| else { 60| 3.21k| using V = std::remove_cvref_t; 61| 3.21k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 3.21k| end); 63| 3.21k| } 64| 3.21k| } _ZN3glz12rewind_depthITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETkNS_10is_contextENS_7contextEEEvRT0_j: 3492| 628| { 3493| 628| if (ctx.error == error_code::exceeded_max_recursive_depth) [[unlikely]] { ------------------ | Branch (3493:11): [True: 0, False: 628] ------------------ 3494| 0| return; 3495| 0| } 3496| | if constexpr (Opts.null_terminated) { 3497| | ctx.depth = depth; 3498| | } 3499| 628| else { 3500| 628| if (ctx.error != error_code::end_reached && ctx.error != error_code::unexpected_end) { ------------------ | Branch (3500:14): [True: 628, False: 0] | Branch (3500:54): [True: 496, False: 132] ------------------ 3501| 496| ctx.depth = depth; 3502| 496| } 3503| 628| } 3504| 628| } _ZZN3glz28process_variant_alternativesINSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_14is_variant_strEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSK_EEvOT0_OT1_OT2_T3_ENKUlTnmvE_clILm1EEEDav: 3589| 3.21k| for_each([&]() { 3590| 3.21k| if (found_match || exhausted || variant_alternative_exhausted(ctx)) { ------------------ | Branch (3590:23): [True: 2.58k, False: 628] | Branch (3590:38): [True: 0, False: 628] | Branch (3590:51): [True: 0, False: 628] ------------------ 3591| 2.58k| return; 3592| 2.58k| } 3593| 628| using V = std::variant_alternative_t; 3594| | if constexpr (Trait::value && !glaze_const_value_t) { 3595| | auto copy_it{it}; 3596| | const auto copy_depth{ctx.depth}; // rewound with `it`; see the note above 3597| | if (!std::holds_alternative(value)) { 3598| | value = V{}; 3599| | } 3600| | parse::op()>(std::get(value), ctx, it, end); 3601| | if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 3602| | exhausted = true; // only rejected attempts are charged; see charge_speculation 3603| | } 3604| | if (!bool(ctx.error)) { 3605| | found_match = true; 3606| | } 3607| | else if constexpr (not Options.null_terminated) { 3608| | constexpr bool is_complete_type = 3609| | num_t || bool_t || string_t || std::is_enum_v || tuple_t || is_std_tuple; 3610| | 3611| | if constexpr (is_complete_type) { 3612| | if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 3613| | found_match = true; 3614| | ctx.error = error_code::none; 3615| | } 3616| | else { 3617| | it = copy_it; 3618| | rewind_depth(ctx, copy_depth); 3619| | if (non_const_idx + 1 < non_const_count && not exhausted && 3620| | not variant_alternative_exhausted(ctx)) { 3621| | ctx.error = error_code::none; 3622| | } 3623| | } 3624| | } 3625| | else { 3626| | it = copy_it; 3627| | rewind_depth(ctx, copy_depth); 3628| | if (non_const_idx + 1 < non_const_count && not exhausted && 3629| | not variant_alternative_exhausted(ctx)) { 3630| | ctx.error = error_code::none; 3631| | } 3632| | } 3633| | } 3634| | else { 3635| | it = copy_it; 3636| | rewind_depth(ctx, copy_depth); 3637| | if (non_const_idx + 1 < non_const_count && not exhausted && 3638| | not variant_alternative_exhausted(ctx)) { 3639| | ctx.error = error_code::none; 3640| | } 3641| | } 3642| | ++non_const_idx; 3643| | } 3644| 628| }); _ZN3glz28process_variant_alternativesINSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_15is_variant_boolEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSK_EEvOT0_OT1_OT2_T3_: 3520| 16| { 3521| 16| constexpr auto category_count = variant_count_v; 3522| | 3523| 16| if constexpr (category_count == 0) { 3524| 16| ctx.error = error_code::no_matching_variant_type; 3525| | } 3526| | else { 3527| | constexpr auto N = std::variant_size_v; 3528| | constexpr auto const_count = variant_filtered_count_v; 3529| | constexpr auto non_const_count = variant_filtered_count_v; 3530| | 3531| | bool found_match{}; 3532| | // Set when the speculative parsing budget runs out; see charge_speculation. An ambiguous 3533| | // nest re-parses the same subtree per alternative at every level, which is exponential, 3534| | // so the budget stops it and the failure already in hand is reported. 3535| | bool exhausted{}; 3536| | 3537| | // First pass: const glaze types in this category 3538| | if constexpr (const_count > 0) { 3539| | for_each([&]() { 3540| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3541| | return; 3542| | } 3543| | using V = std::variant_alternative_t; 3544| | if constexpr (Trait::value && glaze_const_value_t) { 3545| | // run time substitute to compare to const value 3546| | std::remove_const_t>>> substitute{}; 3547| | auto copy_it{it}; 3548| | // A rejected alternative may have bailed out inside a container, which leaves its 3549| | // nesting level counted (see enter_depth). Rewind the depth with the iterator so 3550| | // trying N alternatives cannot spend N levels of the recursion budget. 3551| | const auto copy_depth{ctx.depth}; 3552| | parse::op()>(substitute, ctx, it, end); 3553| | static constexpr auto const_value{*meta_wrapper_v}; 3554| | if (substitute == const_value) { 3555| | found_match = true; 3556| | if (!std::holds_alternative(value)) { 3557| | value = V{}; 3558| | } 3559| | } 3560| | else { 3561| | // Rejected: charge the bytes it parsed before we rewind. See charge_speculation. 3562| | if (!charge_speculation(ctx, size_t(it - copy_it))) { 3563| | exhausted = true; 3564| | } 3565| | if constexpr (not Options.null_terminated) { 3566| | if (ctx.error == error_code::end_reached && not exhausted) { 3567| | ctx.error = error_code::none; 3568| | } 3569| | } 3570| | it = copy_it; 3571| | rewind_depth(ctx, copy_depth); 3572| | } 3573| | } 3574| | }); 3575| | if (found_match) { 3576| | return; 3577| | } 3578| | } 3579| | 3580| | // Second pass: non-const types in this category 3581| | if constexpr (non_const_count > 0) { 3582| | // Track position within matching types for "is last" check. 3583| | // We iterate over all variant indices but only process matching types, 3584| | // so we need runtime tracking (vs the old tuple-based approach where 3585| | // the loop index directly corresponded to position in filtered set). 3586| | // This has negligible cost: one increment per matching type. 3587| | size_t non_const_idx = 0; 3588| | 3589| | for_each([&]() { 3590| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3591| | return; 3592| | } 3593| | using V = std::variant_alternative_t; 3594| | if constexpr (Trait::value && !glaze_const_value_t) { 3595| | auto copy_it{it}; 3596| | const auto copy_depth{ctx.depth}; // rewound with `it`; see the note above 3597| | if (!std::holds_alternative(value)) { 3598| | value = V{}; 3599| | } 3600| | parse::op()>(std::get(value), ctx, it, end); 3601| | if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 3602| | exhausted = true; // only rejected attempts are charged; see charge_speculation 3603| | } 3604| | if (!bool(ctx.error)) { 3605| | found_match = true; 3606| | } 3607| | else if constexpr (not Options.null_terminated) { 3608| | constexpr bool is_complete_type = 3609| | num_t || bool_t || string_t || std::is_enum_v || tuple_t || is_std_tuple; 3610| | 3611| | if constexpr (is_complete_type) { 3612| | if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 3613| | found_match = true; 3614| | ctx.error = error_code::none; 3615| | } 3616| | else { 3617| | it = copy_it; 3618| | rewind_depth(ctx, copy_depth); 3619| | if (non_const_idx + 1 < non_const_count && not exhausted && 3620| | not variant_alternative_exhausted(ctx)) { 3621| | ctx.error = error_code::none; 3622| | } 3623| | } 3624| | } 3625| | else { 3626| | it = copy_it; 3627| | rewind_depth(ctx, copy_depth); 3628| | if (non_const_idx + 1 < non_const_count && not exhausted && 3629| | not variant_alternative_exhausted(ctx)) { 3630| | ctx.error = error_code::none; 3631| | } 3632| | } 3633| | } 3634| | else { 3635| | it = copy_it; 3636| | rewind_depth(ctx, copy_depth); 3637| | if (non_const_idx + 1 < non_const_count && not exhausted && 3638| | not variant_alternative_exhausted(ctx)) { 3639| | ctx.error = error_code::none; 3640| | } 3641| | } 3642| | ++non_const_idx; 3643| | } 3644| | }); 3645| | if (!found_match) { 3646| | if constexpr (non_const_count == 1) { 3647| | // Keep the specific error from the single type we tried 3648| | } 3649| | else if (not exhausted && not variant_alternative_exhausted(ctx)) { 3650| | // Over-nested input is not a failure of the alternative set; keep saying so. 3651| | ctx.error = error_code::no_matching_variant_type; 3652| | } 3653| | } 3654| | } 3655| | else { 3656| | ctx.error = error_code::no_matching_variant_type; 3657| | } 3658| | } 3659| 16| } _ZN3glz28process_variant_alternativesINSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_14is_variant_numEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSK_EEvOT0_OT1_OT2_T3_: 3520| 2.41k| { 3521| 2.41k| constexpr auto category_count = variant_count_v; 3522| | 3523| 2.41k| if constexpr (category_count == 0) { 3524| 2.41k| ctx.error = error_code::no_matching_variant_type; 3525| | } 3526| | else { 3527| | constexpr auto N = std::variant_size_v; 3528| | constexpr auto const_count = variant_filtered_count_v; 3529| | constexpr auto non_const_count = variant_filtered_count_v; 3530| | 3531| | bool found_match{}; 3532| | // Set when the speculative parsing budget runs out; see charge_speculation. An ambiguous 3533| | // nest re-parses the same subtree per alternative at every level, which is exponential, 3534| | // so the budget stops it and the failure already in hand is reported. 3535| | bool exhausted{}; 3536| | 3537| | // First pass: const glaze types in this category 3538| | if constexpr (const_count > 0) { 3539| | for_each([&]() { 3540| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3541| | return; 3542| | } 3543| | using V = std::variant_alternative_t; 3544| | if constexpr (Trait::value && glaze_const_value_t) { 3545| | // run time substitute to compare to const value 3546| | std::remove_const_t>>> substitute{}; 3547| | auto copy_it{it}; 3548| | // A rejected alternative may have bailed out inside a container, which leaves its 3549| | // nesting level counted (see enter_depth). Rewind the depth with the iterator so 3550| | // trying N alternatives cannot spend N levels of the recursion budget. 3551| | const auto copy_depth{ctx.depth}; 3552| | parse::op()>(substitute, ctx, it, end); 3553| | static constexpr auto const_value{*meta_wrapper_v}; 3554| | if (substitute == const_value) { 3555| | found_match = true; 3556| | if (!std::holds_alternative(value)) { 3557| | value = V{}; 3558| | } 3559| | } 3560| | else { 3561| | // Rejected: charge the bytes it parsed before we rewind. See charge_speculation. 3562| | if (!charge_speculation(ctx, size_t(it - copy_it))) { 3563| | exhausted = true; 3564| | } 3565| | if constexpr (not Options.null_terminated) { 3566| | if (ctx.error == error_code::end_reached && not exhausted) { 3567| | ctx.error = error_code::none; 3568| | } 3569| | } 3570| | it = copy_it; 3571| | rewind_depth(ctx, copy_depth); 3572| | } 3573| | } 3574| | }); 3575| | if (found_match) { 3576| | return; 3577| | } 3578| | } 3579| | 3580| | // Second pass: non-const types in this category 3581| | if constexpr (non_const_count > 0) { 3582| | // Track position within matching types for "is last" check. 3583| | // We iterate over all variant indices but only process matching types, 3584| | // so we need runtime tracking (vs the old tuple-based approach where 3585| | // the loop index directly corresponded to position in filtered set). 3586| | // This has negligible cost: one increment per matching type. 3587| | size_t non_const_idx = 0; 3588| | 3589| | for_each([&]() { 3590| | if (found_match || exhausted || variant_alternative_exhausted(ctx)) { 3591| | return; 3592| | } 3593| | using V = std::variant_alternative_t; 3594| | if constexpr (Trait::value && !glaze_const_value_t) { 3595| | auto copy_it{it}; 3596| | const auto copy_depth{ctx.depth}; // rewound with `it`; see the note above 3597| | if (!std::holds_alternative(value)) { 3598| | value = V{}; 3599| | } 3600| | parse::op()>(std::get(value), ctx, it, end); 3601| | if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 3602| | exhausted = true; // only rejected attempts are charged; see charge_speculation 3603| | } 3604| | if (!bool(ctx.error)) { 3605| | found_match = true; 3606| | } 3607| | else if constexpr (not Options.null_terminated) { 3608| | constexpr bool is_complete_type = 3609| | num_t || bool_t || string_t || std::is_enum_v || tuple_t || is_std_tuple; 3610| | 3611| | if constexpr (is_complete_type) { 3612| | if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 3613| | found_match = true; 3614| | ctx.error = error_code::none; 3615| | } 3616| | else { 3617| | it = copy_it; 3618| | rewind_depth(ctx, copy_depth); 3619| | if (non_const_idx + 1 < non_const_count && not exhausted && 3620| | not variant_alternative_exhausted(ctx)) { 3621| | ctx.error = error_code::none; 3622| | } 3623| | } 3624| | } 3625| | else { 3626| | it = copy_it; 3627| | rewind_depth(ctx, copy_depth); 3628| | if (non_const_idx + 1 < non_const_count && not exhausted && 3629| | not variant_alternative_exhausted(ctx)) { 3630| | ctx.error = error_code::none; 3631| | } 3632| | } 3633| | } 3634| | else { 3635| | it = copy_it; 3636| | rewind_depth(ctx, copy_depth); 3637| | if (non_const_idx + 1 < non_const_count && not exhausted && 3638| | not variant_alternative_exhausted(ctx)) { 3639| | ctx.error = error_code::none; 3640| | } 3641| | } 3642| | ++non_const_idx; 3643| | } 3644| | }); 3645| | if (!found_match) { 3646| | if constexpr (non_const_count == 1) { 3647| | // Keep the specific error from the single type we tried 3648| | } 3649| | else if (not exhausted && not variant_alternative_exhausted(ctx)) { 3650| | // Over-nested input is not a failure of the alternative set; keep saying so. 3651| | ctx.error = error_code::no_matching_variant_type; 3652| | } 3653| | } 3654| | } 3655| | else { 3656| | ctx.error = error_code::no_matching_variant_type; 3657| | } 3658| | } 3659| 2.41k| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm8EEEDav: 490| 482| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm8ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 482| { 313| 482| static constexpr auto Key = get(reflect::keys); 314| 482| static constexpr auto KeyWithEndQuote = join_v>; 315| 482| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 482| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 461, False: 21] | Branch (321:52): [True: 243, False: 218] ------------------ 322| 243| it += Length; 323| 243| if constexpr (not Opts.null_terminated) { 324| 243| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 243] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 243| } 329| | 330| 243| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 229] ------------------ 331| 14| return; 332| 14| } 333| 229| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 17, False: 212] ------------------ 334| 17| return; 335| 17| } 336| 212| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 198] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 198| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 198| } 343| 239| else [[unlikely]] { 344| 239| decode_index_unknown_key(value, ctx, it, end); 345| 239| } 346| 482| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm8ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 198| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 198| else { 274| 198| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 198| else { 298| 198| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 198| it, end); 300| 198| } 301| 198| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 198| } _ZN3glz4fromILj10ENSt3__18functionIFiiEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEES4_TkNS_10is_contextERNS_7contextERPKcSB_EEvRT0_OT1_OT2_T3_: 1921| 198| { 1922| | if constexpr (!check_ws_handled(Opts)) { 1923| | if (skip_ws(ctx, it, end)) { 1924| | return; 1925| | } 1926| | } 1927| 198| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (1927:14): [True: 20, False: 178] ------------------ 1928| 20| return; 1929| 20| } 1930| 178| skip_string_view(ctx, it, end); 1931| 178| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (1931:14): [True: 48, False: 130] ------------------ 1932| 48| return; 1933| 130| if (match<'"'>(ctx, it)) { ------------------ | Branch (1933:14): [True: 0, False: 130] ------------------ 1934| 0| return; 1935| 0| } 1936| 130| if constexpr (not Opts.null_terminated) { 1937| 130| if (it == end) { ------------------ | Branch (1937:17): [True: 14, False: 116] ------------------ 1938| 14| ctx.error = error_code::end_reached; 1939| 14| return; 1940| 14| } 1941| 130| } 1942| 130| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm9EEEDav: 490| 358| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm9ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 358| { 313| 358| static constexpr auto Key = get(reflect::keys); 314| 358| static constexpr auto KeyWithEndQuote = join_v>; 315| 358| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 358| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 348, False: 10] | Branch (321:52): [True: 320, False: 28] ------------------ 322| 320| it += Length; 323| 320| if constexpr (not Opts.null_terminated) { 324| 320| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 320] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 320| } 329| | 330| 320| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 306] ------------------ 331| 14| return; 332| 14| } 333| 306| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 9, False: 297] ------------------ 334| 9| return; 335| 9| } 336| 297| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 283] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 283| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 283| } 343| 38| else [[unlikely]] { 344| 38| decode_index_unknown_key(value, ctx, it, end); 345| 38| } 346| 358| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm9ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 283| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 283| else { 274| 283| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 283| else { 298| 283| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 283| it, end); 300| 283| } 301| 283| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 283| } _ZN3glz4fromILj10ENSt3__18functionIFNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKS8_EEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEESC_TkNS_10is_contextERNS_7contextERPKcSJ_EEvRT0_OT1_OT2_T3_: 1921| 283| { 1922| | if constexpr (!check_ws_handled(Opts)) { 1923| | if (skip_ws(ctx, it, end)) { 1924| | return; 1925| | } 1926| | } 1927| 283| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (1927:14): [True: 20, False: 263] ------------------ 1928| 20| return; 1929| 20| } 1930| 263| skip_string_view(ctx, it, end); 1931| 263| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (1931:14): [True: 55, False: 208] ------------------ 1932| 55| return; 1933| 208| if (match<'"'>(ctx, it)) { ------------------ | Branch (1933:14): [True: 0, False: 208] ------------------ 1934| 0| return; 1935| 0| } 1936| 208| if constexpr (not Opts.null_terminated) { 1937| 208| if (it == end) { ------------------ | Branch (1937:17): [True: 24, False: 184] ------------------ 1938| 24| ctx.error = error_code::end_reached; 1939| 24| return; 1940| 24| } 1941| 208| } 1942| 208| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm10EEEDav: 490| 591| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm10ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 591| { 313| 591| static constexpr auto Key = get(reflect::keys); 314| 591| static constexpr auto KeyWithEndQuote = join_v>; 315| 591| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 591| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 571, False: 20] | Branch (321:52): [True: 522, False: 49] ------------------ 322| 522| it += Length; 323| 522| if constexpr (not Opts.null_terminated) { 324| 522| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 522] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 522| } 329| | 330| 522| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 508] ------------------ 331| 14| return; 332| 14| } 333| 508| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 30, False: 478] ------------------ 334| 30| return; 335| 30| } 336| 478| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 464] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 464| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 464| } 343| 69| else [[unlikely]] { 344| 69| decode_index_unknown_key(value, ctx, it, end); 345| 69| } 346| 591| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm10ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 464| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 464| else { 274| 464| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 464| else { 298| 464| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 464| it, end); 300| 464| } 301| 464| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 464| } _ZN3glz4fromILj10ENSt3__18functionIFN9repe_fuzz5pointERKS4_EEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEES8_TkNS_10is_contextERNS_7contextERPKcSF_EEvRT0_OT1_OT2_T3_: 1921| 464| { 1922| | if constexpr (!check_ws_handled(Opts)) { 1923| | if (skip_ws(ctx, it, end)) { 1924| | return; 1925| | } 1926| | } 1927| 464| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (1927:14): [True: 6, False: 458] ------------------ 1928| 6| return; 1929| 6| } 1930| 458| skip_string_view(ctx, it, end); 1931| 458| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (1931:14): [True: 48, False: 410] ------------------ 1932| 48| return; 1933| 410| if (match<'"'>(ctx, it)) { ------------------ | Branch (1933:14): [True: 0, False: 410] ------------------ 1934| 0| return; 1935| 0| } 1936| 410| if constexpr (not Opts.null_terminated) { 1937| 410| if (it == end) { ------------------ | Branch (1937:17): [True: 15, False: 395] ------------------ 1938| 15| ctx.error = error_code::end_reached; 1939| 15| return; 1940| 15| } 1941| 410| } 1942| 410| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm11EEEDav: 490| 510| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm11ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 510| { 313| 510| static constexpr auto Key = get(reflect::keys); 314| 510| static constexpr auto KeyWithEndQuote = join_v>; 315| 510| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 510| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 500, False: 10] | Branch (321:52): [True: 493, False: 7] ------------------ 322| 493| it += Length; 323| 493| if constexpr (not Opts.null_terminated) { 324| 493| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 493] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 493| } 329| | 330| 493| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 16, False: 477] ------------------ 331| 16| return; 332| 16| } 333| 477| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 11, False: 466] ------------------ 334| 11| return; 335| 11| } 336| 466| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 15, False: 451] ------------------ 337| 15| return; 338| 15| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 451| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 451| } 343| 17| else [[unlikely]] { 344| 17| decode_index_unknown_key(value, ctx, it, end); 345| 17| } 346| 510| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm11ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 451| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 451| else { 274| 451| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 451| else { 298| 451| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 451| it, end); 300| 451| } 301| 451| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 451| } _ZN3glz4fromILj10ENSt3__18functionIFdRNS1_6vectorIdNS1_9allocatorIdEEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEES9_TkNS_10is_contextERNS_7contextERPKcSG_EEvRT0_OT1_OT2_T3_: 1921| 451| { 1922| | if constexpr (!check_ws_handled(Opts)) { 1923| | if (skip_ws(ctx, it, end)) { 1924| | return; 1925| | } 1926| | } 1927| 451| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (1927:14): [True: 8, False: 443] ------------------ 1928| 8| return; 1929| 8| } 1930| 443| skip_string_view(ctx, it, end); 1931| 443| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (1931:14): [True: 57, False: 386] ------------------ 1932| 57| return; 1933| 386| if (match<'"'>(ctx, it)) { ------------------ | Branch (1933:14): [True: 0, False: 386] ------------------ 1934| 0| return; 1935| 0| } 1936| 386| if constexpr (not Opts.null_terminated) { 1937| 386| if (it == end) { ------------------ | Branch (1937:17): [True: 16, False: 370] ------------------ 1938| 16| ctx.error = error_code::end_reached; 1939| 16| return; 1940| 16| } 1941| 386| } 1942| 386| } _ZZN3glz16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT1_OT3_OT4_OT5_DpOT2_ENKUlTnmvE_clILm12EEEDav: 490| 320| visit([&]() { decode_index(value, ctx, it, end, selected_index...); }, index); _ZN3glz12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm12ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT0_E11reflectableISA_EEEvOT2_OT4_OT5_OT6_DpOT3_: 312| 320| { 313| 320| static constexpr auto Key = get(reflect::keys); 314| 320| static constexpr auto KeyWithEndQuote = join_v>; 315| 320| static constexpr auto Length = KeyWithEndQuote.size(); 316| | 317| | // Compared as a count rather than by forming `it + Length` first: a pointer past one-past-the-end 318| | // is undefined even when it is never dereferenced, and a key near the end of a short buffer 319| | // reaches this with fewer than `Length` bytes left. Signed, so a cursor that has overshot 320| | // `end` does not read as room. 321| 320| if (((end - it) > std::ptrdiff_t(Length)) && comparitor(it)) [[likely]] { ------------------ | Branch (321:11): [True: 305, False: 15] | Branch (321:52): [True: 283, False: 22] ------------------ 322| 283| it += Length; 323| 283| if constexpr (not Opts.null_terminated) { 324| 283| if (it == end) [[unlikely]] { ------------------ | Branch (324:17): [True: 0, False: 283] ------------------ 325| 0| ctx.error = error_code::unexpected_end; 326| 0| return; 327| 0| } 328| 283| } 329| | 330| 283| if (skip_ws(ctx, it, end)) { ------------------ | Branch (330:14): [True: 14, False: 269] ------------------ 331| 14| return; 332| 14| } 333| 269| if (match_invalid_end<':', Opts>(ctx, it, end)) { ------------------ | Branch (333:14): [True: 8, False: 261] ------------------ 334| 8| return; 335| 8| } 336| 261| if (skip_ws(ctx, it, end)) { ------------------ | Branch (336:14): [True: 14, False: 247] ------------------ 337| 14| return; 338| 14| } 339| | 340| | // The hash path has already consumed the whitespace before the value 341| 247| decode_field_value(), T, I>(value, ctx, it, end, selected_index...); 342| 247| } 343| 37| else [[unlikely]] { 344| 37| decode_index_unknown_key(value, ctx, it, end); 345| 37| } 346| 320| } _ZN3glz18decode_field_valueITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnDaXtlS1_Lj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEEN9repe_fuzz8fuzz_apiELm12ERS3_JETkNS_10is_contextERNS_7contextERPKcS9_Qoo14glaze_object_tIT1_E11reflectableISA_EEEvOT3_OT5_OT6_OT7_DpOT4_: 246| 247| { 247| | // Check for null value skipping on read 248| | if constexpr (check_skip_null_members_on_read(Opts)) { 249| | if (*it == 'n') { 250| | ++it; 251| | if constexpr (not Opts.null_terminated) { 252| | if (it == end) [[unlikely]] { 253| | ctx.error = error_code::unexpected_end; 254| | return; 255| | } 256| | } 257| | match<"ull", Opts>(ctx, it, end); 258| | if (bool(ctx.error)) [[unlikely]] 259| | return; 260| | // Successfully matched "null", skip it 261| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 262| | ((selected_index = I), ...); // Mark as handled even if skipped 263| | } 264| | return; 265| | } 266| | } 267| | 268| | if constexpr (skipped_by_meta) { 269| | skip_value::op(ctx, it, end); 270| | if (bool(ctx.error)) [[unlikely]] 271| | return; // Propagate error from skip_value 272| | } 273| 247| else { 274| 247| using V = refl_t; 275| | 276| | if constexpr (const_value_v) { 277| | if constexpr (check_error_on_const_read(Opts)) { 278| | ctx.error = error_code::attempt_const_read; 279| | } 280| | else { 281| | // do not read anything into the const value 282| | skip_value::op(ctx, it, end); 283| | } 284| | } 285| | else if constexpr (is_function_ptr_or_ref) { 286| | // Function pointers cannot be deserialized from JSON. 287| | // When write_function_pointers is enabled the writer emits a type-name string, 288| | // but there is nothing meaningful to reconstruct on read — just skip the value. 289| | // When write_function_pointers is off the key is never written, so this branch 290| | // is unreachable in that case. 291| | skip_value::op(ctx, it, end); 292| | } 293| | else if constexpr (glaze_object_t) { 294| | from>::template op(get_member(value, get(reflect::values)), 295| | ctx, it, end); 296| | } 297| 247| else { 298| 247| from>::template op(get_member(value, get(to_tie(value))), ctx, 299| 247| it, end); 300| 247| } 301| 247| } 302| | 303| | // The key was present and handled, even when the value itself was skipped 304| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 305| | ((selected_index = I), ...); 306| | } 307| 247| } _ZN3glz4fromILj10ENSt3__18functionIFvvEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEES4_TkNS_10is_contextERNS_7contextERPKcSB_EEvRT0_OT1_OT2_T3_: 1921| 247| { 1922| | if constexpr (!check_ws_handled(Opts)) { 1923| | if (skip_ws(ctx, it, end)) { 1924| | return; 1925| | } 1926| | } 1927| 247| if (match_invalid_end<'"', Opts>(ctx, it, end)) { ------------------ | Branch (1927:14): [True: 14, False: 233] ------------------ 1928| 14| return; 1929| 14| } 1930| 233| skip_string_view(ctx, it, end); 1931| 233| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (1931:14): [True: 39, False: 194] ------------------ 1932| 39| return; 1933| 194| if (match<'"'>(ctx, it)) { ------------------ | Branch (1933:14): [True: 0, False: 194] ------------------ 1934| 0| return; 1935| 0| } 1936| 194| if constexpr (not Opts.null_terminated) { 1937| 194| if (it == end) { ------------------ | Branch (1937:17): [True: 18, False: 176] ------------------ 1938| 18| ctx.error = error_code::end_reached; 1939| 18| return; 1940| 18| } 1941| 194| } 1942| 194| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIiNS4_9allocatorIiEEEETkNS_10is_contextERNS_7contextERPKcSD_EEvOT0_OT1_OT2_T3_: 49| 15.0k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 15.0k| else { 60| 15.0k| using V = std::remove_cvref_t; 61| 15.0k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 15.0k| end); 63| 15.0k| } 64| 15.0k| } _ZN3glz4fromILj10ENSt3__16vectorIiNS1_9allocatorIiEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS5_TkNS_10is_contextERNS_7contextERPKcSD_EEvOT0_OT1_OT2_T3_: 2050| 15.0k| { 2051| 15.0k| constexpr auto Opts = ws_handled_off(); 2052| 15.0k| if constexpr (!check_ws_handled(Options)) { 2053| 15.0k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2053:17): [True: 43, False: 14.9k] ------------------ 2054| 43| return; 2055| 43| } 2056| 15.0k| } 2057| | 2058| 15.0k| if (match_invalid_end<'[', Opts>(ctx, it, end)) { ------------------ | Branch (2058:14): [True: 12.8k, False: 2.16k] ------------------ 2059| 12.8k| return; 2060| 12.8k| } 2061| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2062| | // released at each syntactic close below 2063| 2.16k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2063:14): [True: 0, False: 2.16k] ------------------ 2064| 0| return; 2065| 0| } 2066| | 2067| 2.16k| const auto ws_start = it; 2068| 2.16k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2068:14): [True: 16, False: 2.15k] ------------------ 2069| 16| return; 2070| 16| } 2071| | 2072| 2.15k| if (*it == ']') { ------------------ | Branch (2072:14): [True: 8, False: 2.14k] ------------------ 2073| 8| --ctx.depth; 2074| 8| ++it; 2075| 8| if constexpr ((resizable || is_inplace_vector) && not check_append_arrays(Opts)) { 2076| 8| value.clear(); 2077| | 2078| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2079| | value.shrink_to_fit(); 2080| | } 2081| 8| } 2082| 8| return; 2083| 8| } 2084| | 2085| 2.14k| const size_t ws_size = size_t(it - ws_start); 2086| | 2087| 2.14k| static constexpr bool should_append = (resizable || is_inplace_vector) && check_append_arrays(Opts); ------------------ | Branch (2087:49): [True: 2.14k, Folded] | Branch (2087:65): [Folded, False: 0] | Branch (2087:90): [Folded, False: 0] ------------------ 2088| 2.14k| if constexpr (not should_append) { 2089| 2.14k| const auto n = value.size(); 2090| | 2091| 2.14k| auto value_it = value.begin(); 2092| | 2093| 2.14k| for (size_t i = 0; i < n; ++i) { ------------------ | Branch (2093:32): [True: 0, False: 2.14k] ------------------ 2094| 0| parse::op()>(*value_it++, ctx, it, end); 2095| 0| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (2095:20): [True: 0, False: 0] ------------------ 2096| 0| return; 2097| 0| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2097:20): [True: 0, False: 0] ------------------ 2098| 0| return; 2099| 0| } 2100| 0| if (*it == ',') { ------------------ | Branch (2100:20): [True: 0, False: 0] ------------------ 2101| 0| ++it; 2102| | 2103| 0| if constexpr (!Opts.minified && !Opts.comments) { 2104| 0| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (2104:26): [True: 0, False: 0] | Branch (2104:37): [True: 0, False: 0] ------------------ 2105| 0| skip_matching_ws(ws_start, it, ws_size); 2106| 0| } 2107| 0| } 2108| | 2109| 0| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2109:23): [True: 0, False: 0] ------------------ 2110| 0| return; 2111| 0| } 2112| 0| } 2113| 0| else if (*it == ']') { ------------------ | Branch (2113:25): [True: 0, False: 0] ------------------ 2114| 0| --ctx.depth; 2115| 0| ++it; 2116| 0| if constexpr (erasable) { 2117| 0| value.erase(value_it, 2118| 0| value.end()); // use erase rather than resize for non-default constructible elements 2119| | 2120| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2121| | value.shrink_to_fit(); 2122| | } 2123| 0| } 2124| 0| return; 2125| 0| } 2126| 0| else [[unlikely]] { 2127| 0| ctx.error = error_code::expected_bracket; 2128| 0| return; 2129| 0| } 2130| 0| } 2131| 2.14k| } 2132| | 2133| | if constexpr (Opts.partial_read) { 2134| | // partial_read stops early on a success path, so give the level back like the 2135| | // syntactic-close paths do; otherwise it accumulates across reads sharing a context. 2136| | --ctx.depth; 2137| | return; 2138| | } 2139| 2.14k| else { 2140| | // growing 2141| 2.14k| if constexpr (emplace_backable || has_try_emplace_back) { 2142| 196k| while (it < end) { ------------------ | Branch (2142:23): [True: 196k, False: 43] ------------------ 2143| | // Streaming refill point: at start of each iteration, ensure buffer has data 2144| | if constexpr (has_streaming_state) { 2145| | if (ctx.stream.enabled()) { 2146| | const size_t consumed = static_cast(it - ctx.stream.data()); 2147| | const size_t remaining = ctx.stream.size() - consumed; 2148| | // Refill when less than half of buffer remains to ensure space for next element 2149| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2150| | const char* new_it; 2151| | const char* new_end; 2152| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2153| | it = new_it; 2154| | end = new_end; 2155| | if (it >= end && ctx.stream.at_eof()) { 2156| | break; // No more data, exit loop normally 2157| | } 2158| | } 2159| | } 2160| | } 2161| | 2162| | if constexpr (has_try_emplace_back) { 2163| | if (value.try_emplace_back()) 2164| | parse::op()>(value.back(), ctx, it, end); 2165| | else 2166| | ctx.error = error_code::exceeded_static_array_size; 2167| | } 2168| 196k| else { 2169| 196k| parse::op()>(value.emplace_back(), ctx, it, end); 2170| 196k| } 2171| | 2172| 196k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (2172:23): [True: 1.70k, False: 194k] ------------------ 2173| 1.70k| return; 2174| | 2175| | // Streaming refill point: after parsing each element, refill if buffer is low 2176| | if constexpr (has_streaming_state) { 2177| | if (ctx.stream.enabled()) { 2178| | const size_t consumed = static_cast(it - ctx.stream.data()); 2179| | // Refill when less than 25% of buffer remains to ensure enough space for next element 2180| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 2181| | const char* new_it; 2182| | const char* new_end; 2183| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2184| | it = new_it; 2185| | end = new_end; 2186| | if (it >= end && ctx.stream.at_eof()) { 2187| | ctx.error = error_code::unexpected_end; 2188| | return; 2189| | } 2190| | } 2191| | } 2192| | } 2193| | 2194| 194k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2194:23): [True: 24, False: 194k] ------------------ 2195| 24| return; 2196| 24| } 2197| 194k| if (*it == ',') [[likely]] { ------------------ | Branch (2197:23): [True: 194k, False: 283] ------------------ 2198| 194k| ++it; 2199| | 2200| 194k| if constexpr (!Opts.minified && !Opts.comments) { 2201| 194k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (2201:29): [True: 145k, False: 49.1k] | Branch (2201:40): [True: 145k, False: 294] ------------------ 2202| 145k| skip_matching_ws(ws_start, it, ws_size); 2203| 145k| } 2204| 194k| } 2205| | 2206| 194k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2206:26): [True: 94, False: 194k] ------------------ 2207| 94| return; 2208| 94| } 2209| 194k| } 2210| 283| else if (*it == ']') { ------------------ | Branch (2210:28): [True: 92, False: 191] ------------------ 2211| 92| --ctx.depth; 2212| 92| ++it; 2213| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2214| | value.shrink_to_fit(); 2215| | } 2216| 92| return; 2217| 92| } 2218| 191| else [[unlikely]] { 2219| 191| ctx.error = error_code::expected_bracket; 2220| 191| return; 2221| 191| } 2222| 194k| } 2223| | 2224| | // A valid array always returns from inside the loop upon reaching ']'. 2225| | // For a null-terminated buffer the loop can only exit here by falling 2226| | // through when `it` reaches the terminator without a closing bracket, 2227| | // which means the input was truncated (e.g. "[", "[1," or "[1,2,"). 2228| | // Non-null-terminated buffers surface this through skip_ws/depth 2229| | // tracking (or the streaming refill break), so this guard is limited 2230| | // to the null-terminated case. 2231| | if constexpr (Opts.null_terminated) { 2232| | ctx.error = error_code::unexpected_end; 2233| | } 2234| | } 2235| | else { 2236| | ctx.error = error_code::exceeded_static_array_size; 2237| | } 2238| 2.14k| } 2239| 2.14k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__13mapINS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEiNS4_4lessISB_EENS9_INS4_4pairIKSB_iEEEEEETkNS_10is_contextERNS_7contextERPKcSN_EEvOT0_OT1_OT2_T3_: 49| 15.1k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 15.1k| else { 60| 15.1k| using V = std::remove_cvref_t; 61| 15.1k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 15.1k| end); 63| 15.1k| } 64| 15.1k| } _ZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_: 2791| 15.1k| { 2792| 15.1k| static constexpr auto num_members = reflect::size; 2793| | 2794| 15.1k| static constexpr auto Opts = opening_handled_off()>(); 2795| 15.1k| if constexpr (!check_opening_handled(Options)) { 2796| 15.1k| if constexpr (!check_ws_handled(Options)) { 2797| 15.1k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2797:20): [True: 43, False: 15.1k] ------------------ 2798| 43| return; 2799| 43| } 2800| 15.1k| } 2801| 15.1k| if (match_invalid_end<'{', Opts>(ctx, it, end)) { ------------------ | Branch (2801:17): [True: 5.66k, False: 9.49k] ------------------ 2802| 5.66k| return; 2803| 5.66k| } 2804| 9.49k| if constexpr (not Opts.null_terminated) { 2805| 9.49k| if (it == end) [[unlikely]] { ------------------ | Branch (2805:20): [True: 0, False: 9.49k] ------------------ 2806| 0| ctx.error = error_code::unexpected_end; 2807| 0| return; 2808| 0| } 2809| 9.49k| } 2810| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2811| | // released at each syntactic close below 2812| 9.49k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2812:17): [True: 0, False: 9.49k] ------------------ 2813| 0| return; 2814| 0| } 2815| 9.49k| } 2816| 9.49k| const auto ws_start = it; 2817| 15.1k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2817:14): [True: 31, False: 15.1k] ------------------ 2818| 31| return; 2819| 31| } 2820| 15.1k| const size_t ws_size = size_t(it - ws_start); 2821| | 2822| | if constexpr ((glaze_object_t || reflectable) && num_members == 0 && Opts.error_on_unknown_keys) { 2823| | if constexpr (not tag.sv().empty()) { 2824| | if (*it == '"') { 2825| | ++it; 2826| | if constexpr (not Opts.null_terminated) { 2827| | if (it == end) [[unlikely]] { 2828| | ctx.error = error_code::unexpected_end; 2829| | return; 2830| | } 2831| | } 2832| | 2833| | const auto start = it; 2834| | skip_string_view(ctx, it, end); 2835| | if (bool(ctx.error)) [[unlikely]] 2836| | return; 2837| | if (validate_utf8_span(ctx, start, it)) [[unlikely]] 2838| | return; 2839| | const sv key{start, size_t(it - start)}; 2840| | ++it; 2841| | if constexpr (not Opts.null_terminated) { 2842| | if (it == end) [[unlikely]] { 2843| | ctx.error = error_code::unexpected_end; 2844| | return; 2845| | } 2846| | } 2847| | 2848| | if (key == tag.sv()) { 2849| | if (parse_ws_colon(ctx, it, end)) { 2850| | return; 2851| | } 2852| | 2853| | parse::handle_unknown(key, value, ctx, it, end); 2854| | if (bool(ctx.error)) [[unlikely]] 2855| | return; 2856| | 2857| | if (skip_ws(ctx, it, end)) { 2858| | return; 2859| | } 2860| | } 2861| | else { 2862| | ctx.error = error_code::unknown_key; 2863| | return; 2864| | } 2865| | } 2866| | } 2867| | 2868| | if (*it == '}') [[likely]] { 2869| | --ctx.depth; 2870| | if constexpr (glaze_object_t || reflectable) { 2871| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 2872| | auto wrapper = self_constraint_v(value); 2873| | from::template op()>(wrapper, ctx, it, end); 2874| | if (bool(ctx.error)) { 2875| | return; 2876| | } 2877| | } 2878| | } 2879| | ++it; 2880| | if constexpr (not Opts.null_terminated) { 2881| | if (it == end) { 2882| | ctx.error = error_code::end_reached; 2883| | return; 2884| | } 2885| | } 2886| | if constexpr (Opts.partial_read) { 2887| | ctx.error = error_code::partial_read_complete; 2888| | } 2889| | return; 2890| | } 2891| | ctx.error = error_code::unknown_key; 2892| | return; 2893| | } 2894| 15.1k| else { 2895| 15.1k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| 15.1k| if constexpr ((glaze_object_t || reflectable) && 2897| 15.1k| (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| 15.1k| return bit_array{}; 2899| 15.1k| } 2900| 15.1k| else { 2901| 15.1k| return nullptr; 2902| 15.1k| } 2903| 15.1k| }(); 2904| | 2905| | // A file include merges an external document into this object, so with 2906| | // error_on_missing_keys the keys have to be counted across both documents (see 2907| | // context::key_bits). While this object parses, its bits are published for its 2908| | // includer members to hand down; and if this parse is itself an included document, 2909| | // it claims the bits of the object that included us and merges into them at the 2910| | // closing brace instead of running a check of its own. 2911| 15.1k| static constexpr bool tracks_include_keys = [] { 2912| | // Nested so that reflecting over the members is only asked for when it can matter 2913| 15.1k| if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2914| 15.1k| return has_includer_member; 2915| 15.1k| } 2916| 15.1k| else { 2917| 15.1k| return false; 2918| 15.1k| } 2919| 15.1k| }(); 2920| 15.1k| [[maybe_unused]] bit_array* include_bits{}; 2921| | if constexpr (tracks_include_keys) { 2922| | if (ctx.include_key_type == &include_key_tag) { 2923| | include_bits = static_cast*>(ctx.include_key_bits); 2924| | ctx.include_key_bits = nullptr; 2925| | ctx.include_key_type = nullptr; 2926| | } 2927| | } 2928| 15.1k| [[maybe_unused]] const std::conditional_t>, 2930| 15.1k| inert_key_bits_scope> published_bits{ 2931| 15.1k| ctx, [&]() -> void* { 2932| 15.1k| if constexpr (tracks_include_keys) { 2933| 15.1k| return &fields; 2934| 15.1k| } 2935| 15.1k| else { 2936| 15.1k| return nullptr; 2937| 15.1k| } 2938| 15.1k| }()}; 2939| | 2940| 15.1k| size_t read_count{}; // for partial_read 2941| | 2942| 15.1k| bool first = true; 2943| 51.2k| while (true) { ------------------ | Branch (2943:20): [True: 36.6k, Folded] ------------------ 2944| | if constexpr ((glaze_object_t || reflectable) && Opts.partial_read) { 2945| | static constexpr bit_array all_fields = [] { 2946| | bit_array arr{}; 2947| | for (size_t i = 0; i < num_members; ++i) { 2948| | arr[i] = true; 2949| | } 2950| | return arr; 2951| | }(); 2952| | 2953| | if ((all_fields & fields) == all_fields) { 2954| | ctx.error = error_code::partial_read_complete; 2955| | --ctx.depth; // as above: an early success still closes this level 2956| | return; 2957| | } 2958| | } 2959| | 2960| | // Streaming refill point: at start of each iteration, ensure buffer has data 2961| | if constexpr (has_streaming_state) { 2962| | if (ctx.stream.enabled()) { 2963| | const size_t consumed = static_cast(it - ctx.stream.data()); 2964| | const size_t remaining = ctx.stream.size() - consumed; 2965| | // Refill when less than half of buffer remains to ensure space for next key-value pair 2966| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2967| | const char* new_it; 2968| | const char* new_end; 2969| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2970| | it = new_it; 2971| | end = new_end; 2972| | if (it >= end && ctx.stream.at_eof()) { 2973| | ctx.error = error_code::unexpected_end; 2974| | return; 2975| | } 2976| | } 2977| | } 2978| | } 2979| | 2980| 36.6k| if (*it == '}') { ------------------ | Branch (2980:20): [True: 51, False: 36.6k] ------------------ 2981| 51| --ctx.depth; 2982| | if constexpr ((glaze_object_t || reflectable) && Opts.error_on_missing_keys) { 2983| | const bool defer_to_includer = [&] { 2984| | if constexpr (tracks_include_keys) { 2985| | if (include_bits) { 2986| | // An included document is a fragment: hand the keys it supplied to 2987| | // the object that included it, which checks the union of both. 2988| | *include_bits |= fields; 2989| | return true; 2990| | } 2991| | } 2992| | return false; 2993| | }(); 2994| | constexpr auto req_fields = required_fields(); 2995| | if (not defer_to_includer && (req_fields & fields) != req_fields) { 2996| | for (size_t i = 0; i < num_members; ++i) { 2997| | if (not fields[i] && req_fields[i]) { 2998| | ctx.custom_error_message = reflect::keys[i]; 2999| | // We just return the first missing key in order to avoid heap allocations 3000| | break; 3001| | } 3002| | } 3003| | 3004| | ctx.error = error_code::missing_key; 3005| | return; 3006| | } 3007| | } 3008| | if constexpr (glaze_object_t || reflectable) { 3009| | if constexpr (has_self_constraint_v && !check_skip_self_constraint(Opts)) { 3010| | auto wrapper = self_constraint_v(value); 3011| | from::template op()>(wrapper, ctx, it, end); 3012| | if (bool(ctx.error)) { 3013| | return; 3014| | } 3015| | } 3016| | } 3017| 51| ++it; // Increment after checking for missing keys so errors are within buffer bounds 3018| 51| if constexpr (not Opts.null_terminated) { 3019| 51| if (it == end) { ------------------ | Branch (3019:26): [True: 26, False: 25] ------------------ 3020| 26| ctx.error = error_code::end_reached; 3021| 26| return; 3022| 26| } 3023| 51| } 3024| 25| return; 3025| 51| } 3026| 36.6k| else if (first) { ------------------ | Branch (3026:25): [True: 9.38k, False: 27.2k] ------------------ 3027| 9.38k| first = false; 3028| 9.38k| } 3029| 27.2k| else { 3030| 27.2k| if (match_invalid_end<',', Opts>(ctx, it, end)) { ------------------ | Branch (3030:23): [True: 344, False: 26.8k] ------------------ 3031| 344| return; 3032| 344| } 3033| 26.8k| if constexpr (not Opts.null_terminated) { 3034| 26.8k| if (it == end) [[unlikely]] { ------------------ | Branch (3034:26): [True: 0, False: 26.8k] ------------------ 3035| 0| ctx.error = error_code::unexpected_end; 3036| 0| return; 3037| 0| } 3038| 26.8k| } 3039| | 3040| | if constexpr ((not Opts.minified) && (num_members > 1 || not Opts.error_on_unknown_keys) && 3041| | (!Opts.comments)) { 3042| | if (ws_size && ws_size < size_t(end - it)) { 3043| | skip_matching_ws(ws_start, it, ws_size); 3044| | } 3045| | } 3046| | 3047| 26.8k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3047:23): [True: 62, False: 26.8k] ------------------ 3048| 62| return; 3049| 62| } 3050| 26.8k| } 3051| | 3052| 36.2k| constexpr auto reflection_type = glaze_object_t || reflectable; ------------------ | Branch (3052:49): [Folded, False: 0] | Branch (3052:70): [Folded, False: 0] ------------------ 3053| | 3054| | if constexpr (reflection_type && (num_members == 0)) { 3055| | if constexpr (Opts.error_on_unknown_keys) { 3056| | static_assert(false_v, "This should be unreachable"); 3057| | } 3058| | else { 3059| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3060| | return; 3061| | } 3062| | 3063| | // parsing to an empty object, but at this point the JSON presents keys 3064| | 3065| | // Unknown key handler does not unescape keys. Unknown escaped keys are 3066| | // handled by the user. 3067| | 3068| | const auto start = it; 3069| | uint64_t ascii_acc{}; 3070| | skip_string_view(ctx, it, end, ascii_acc); 3071| | if (bool(ctx.error)) [[unlikely]] 3072| | return; 3073| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3074| | return; 3075| | const sv key{start, size_t(it - start)}; 3076| | ++it; 3077| | if constexpr (not Opts.null_terminated) { 3078| | if (it == end) [[unlikely]] { 3079| | ctx.error = error_code::unexpected_end; 3080| | return; 3081| | } 3082| | } 3083| | 3084| | if (parse_ws_colon(ctx, it, end)) { 3085| | return; 3086| | } 3087| | 3088| | // Check if this key is the variant tag that should be skipped 3089| | if constexpr (not tag.sv().empty()) { 3090| | if (key == tag.sv()) { 3091| | // Skip the tag value 3092| | skip_value::op(ctx, it, end); 3093| | if (bool(ctx.error)) [[unlikely]] 3094| | return; 3095| | resync_window_end(ctx, end); // a streaming skip refills 3096| | if (skip_ws(ctx, it, end)) { 3097| | return; 3098| | } 3099| | continue; 3100| | } 3101| | } 3102| | 3103| | parse::handle_unknown(key, value, ctx, it, end); 3104| | if (bool(ctx.error)) [[unlikely]] 3105| | return; 3106| | if constexpr (not Opts.null_terminated) { 3107| | if (it == end) [[unlikely]] { 3108| | ctx.error = error_code::unexpected_end; 3109| | return; 3110| | } 3111| | } 3112| | if (skip_ws(ctx, it, end)) { 3113| | return; 3114| | } 3115| | } 3116| | } 3117| | else if constexpr (reflection_type) { 3118| | static_assert(bool(hash_info.type)); 3119| | 3120| | if (*it != '"') [[unlikely]] { 3121| | ctx.error = error_code::expected_quote; 3122| | return; 3123| | } 3124| | ++it; 3125| | if constexpr (not Opts.null_terminated) { 3126| | if (it == end) [[unlikely]] { 3127| | ctx.error = error_code::unexpected_end; 3128| | return; 3129| | } 3130| | } 3131| | 3132| | if constexpr (not tag.sv().empty() && not contains_tag()) { 3133| | // For tagged variants we first check to see if the key matches the tag 3134| | // We only need to do this if the tag is not part of the keys 3135| | 3136| | const auto start = it; 3137| | uint64_t ascii_acc{}; 3138| | skip_string_view(ctx, it, end, ascii_acc); 3139| | if (bool(ctx.error)) [[unlikely]] 3140| | return; 3141| | if (validate_utf8_span(ctx, start, it, ascii_acc)) [[unlikely]] 3142| | return; 3143| | const sv key{start, size_t(it - start)}; 3144| | ++it; 3145| | if constexpr (not Opts.null_terminated) { 3146| | if (it == end) [[unlikely]] { 3147| | ctx.error = error_code::unexpected_end; 3148| | return; 3149| | } 3150| | } 3151| | 3152| | if (key == tag.sv()) { 3153| | if (parse_ws_colon(ctx, it, end)) { 3154| | return; 3155| | } 3156| | 3157| | parse::handle_unknown(key, value, ctx, it, end); 3158| | if (bool(ctx.error)) [[unlikely]] 3159| | return; 3160| | 3161| | if (skip_ws(ctx, it, end)) { 3162| | return; 3163| | } 3164| | continue; 3165| | } 3166| | else { 3167| | it = start; // reset the iterator 3168| | } 3169| | } 3170| | 3171| | if constexpr (Opts.error_on_missing_keys || Opts.partial_read) { 3172| | size_t index = num_members; 3173| | parse_and_invoke(value, ctx, it, end, index); 3174| | if (bool(ctx.error)) [[unlikely]] 3175| | return; 3176| | if (index < num_members) { 3177| | fields[index] = true; 3178| | } 3179| | } 3180| | else { 3181| | parse_and_invoke(value, ctx, it, end); 3182| | if (bool(ctx.error)) [[unlikely]] 3183| | return; 3184| | } 3185| | } 3186| 36.2k| else { 3187| | // For types like std::map, std::unordered_map 3188| | 3189| 36.2k| auto reading = [&](auto&& key) { 3190| 36.2k| if constexpr (Opts.partial_read) { 3191| 36.2k| if (auto element = value.find(key); element != value.end()) { 3192| 36.2k| ++read_count; 3193| 36.2k| parse::op()>(element->second, ctx, it, end); 3194| 36.2k| } 3195| 36.2k| else { 3196| 36.2k| skip_value::op(ctx, it, end); 3197| 36.2k| } 3198| 36.2k| } 3199| 36.2k| else { 3200| 36.2k| parse::op()>(value[key], ctx, it, end); 3201| 36.2k| } 3202| 36.2k| }; 3203| | 3204| | // using Key = std::conditional_t, sv, typename T::key_type>; 3205| 36.2k| using Key = typename T::key_type; 3206| 36.2k| if constexpr (std::is_same_v) { 3207| 36.2k| ctx.scratch.clear(); 3208| 36.2k| parse::op(ctx.scratch, ctx, it, end); 3209| 36.2k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3209:26): [True: 1.27k, False: 34.9k] ------------------ 3210| 1.27k| return; 3211| | 3212| 34.9k| if (parse_ws_colon(ctx, it, end)) { ------------------ | Branch (3212:26): [True: 610, False: 34.3k] ------------------ 3213| 610| return; 3214| 610| } 3215| | 3216| 34.3k| reading(ctx.scratch); 3217| | if constexpr (Opts.partial_read) { 3218| | if (read_count == value.size()) { 3219| | return; 3220| | } 3221| | } 3222| 34.3k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (3222:26): [True: 7.03k, False: 27.2k] ------------------ 3223| 7.03k| return; 3224| | } 3225| | else if constexpr (str_t) { 3226| | Key key; 3227| | parse::op(key, ctx, it, end); 3228| | if (bool(ctx.error)) [[unlikely]] 3229| | return; 3230| | 3231| | if (parse_ws_colon(ctx, it, end)) { 3232| | return; 3233| | } 3234| | 3235| | reading(key); 3236| | if constexpr (Opts.partial_read) { 3237| | if (read_count == value.size()) { 3238| | return; 3239| | } 3240| | } 3241| | if (bool(ctx.error)) [[unlikely]] 3242| | return; 3243| | } 3244| | else { 3245| | Key key_value{}; 3246| | if constexpr (is_named_enum || mimics_str_t) { 3247| | parse::op(key_value, ctx, it, end); 3248| | } 3249| | else if constexpr (std::is_arithmetic_v) { 3250| | // prefer over quoted_t below to avoid double parsing of quoted_t 3251| | parse::op>(key_value, ctx, it, end); 3252| | } 3253| | else { 3254| | parse::op>(quoted_t{key_value}, ctx, it, end); 3255| | } 3256| | if (bool(ctx.error)) [[unlikely]] 3257| | return; 3258| | 3259| | if (parse_ws_colon(ctx, it, end)) { 3260| | return; 3261| | } 3262| | 3263| | reading(key_value); 3264| | if constexpr (Opts.partial_read) { 3265| | if (read_count == value.size()) { 3266| | return; 3267| | } 3268| | } 3269| | if (bool(ctx.error)) [[unlikely]] 3270| | return; 3271| | } 3272| 36.2k| } 3273| | 3274| | // Streaming refill point: after parsing each key-value pair, refill if buffer is low 3275| | if constexpr (has_streaming_state) { 3276| | if (ctx.stream.enabled()) { 3277| | const size_t consumed = static_cast(it - ctx.stream.data()); 3278| | // Refill when less than 25% of buffer remains to ensure enough space for next element 3279| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 3280| | const char* new_it; 3281| | const char* new_end; 3282| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 3283| | it = new_it; 3284| | end = new_end; 3285| | if (it >= end && ctx.stream.at_eof()) { 3286| | ctx.error = error_code::unexpected_end; 3287| | return; 3288| | } 3289| | } 3290| | } 3291| | } 3292| | 3293| 36.2k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3293:20): [True: 43, False: 36.1k] ------------------ 3294| 43| return; 3295| 43| } 3296| 36.2k| } 3297| 15.1k| } 3298| 15.1k| } _ZZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_ENKUlvE_clEv: 2895| 9.42k| decltype(auto) fields = [&]() -> decltype(auto) { 2896| | if constexpr ((glaze_object_t || reflectable) && 2897| | (Opts.error_on_missing_keys || Opts.partial_read)) { 2898| | return bit_array{}; 2899| | } 2900| 9.42k| else { 2901| 9.42k| return nullptr; 2902| 9.42k| } 2903| 9.42k| }(); _ZZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_ENKUlvE1_clEv: 2931| 9.42k| ctx, [&]() -> void* { 2932| | if constexpr (tracks_include_keys) { 2933| | return &fields; 2934| | } 2935| 9.42k| else { 2936| 9.42k| return nullptr; 2937| 9.42k| } 2938| 9.42k| }()}; _ZZN3glz4fromILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETnNS_14string_literalEXtlNSJ_ILm1EEEEERSF_TkNS_10is_contextERNS_7contextERPKcSP_EEvOT1_OT2_OT3_T4_ENKUlOT_E_clIRS8_EEDaSZ_: 3189| 34.3k| auto reading = [&](auto&& key) { 3190| | if constexpr (Opts.partial_read) { 3191| | if (auto element = value.find(key); element != value.end()) { 3192| | ++read_count; 3193| | parse::op()>(element->second, ctx, it, end); 3194| | } 3195| | else { 3196| | skip_value::op(ctx, it, end); 3197| | } 3198| | } 3199| 34.3k| else { 3200| 34.3k| parse::op()>(value[key], ctx, it, end); 3201| 34.3k| } 3202| 34.3k| }; _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__18optionalIdEETkNS_10is_contextERNS_7contextERPKcSB_EEvOT0_OT1_OT2_T3_: 49| 14.7k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 14.7k| else { 60| 14.7k| using V = std::remove_cvref_t; 61| 14.7k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 14.7k| end); 63| 14.7k| } 64| 14.7k| } _ZN3glz4fromILj10ENSt3__18optionalIdEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS3_TkNS_10is_contextERNS_7contextERPKcSB_EEvOT0_OT1_OT2_T3_: 4883| 14.7k| { 4884| 14.7k| constexpr auto Opts = ws_handled_off(); 4885| 14.7k| if constexpr (!check_ws_handled(Options)) { 4886| 14.7k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (4886:17): [True: 40, False: 14.7k] ------------------ 4887| 40| return; 4888| 40| } 4889| 14.7k| } 4890| | 4891| 14.7k| if (*it == 'n') { ------------------ | Branch (4891:14): [True: 41, False: 14.7k] ------------------ 4892| 41| ++it; 4893| 41| if constexpr (not Opts.null_terminated) { 4894| 41| if (it == end) [[unlikely]] { ------------------ | Branch (4894:20): [True: 5, False: 36] ------------------ 4895| 5| ctx.error = error_code::unexpected_end; 4896| 5| return; 4897| 5| } 4898| 41| } 4899| 36| match<"ull", Opts>(ctx, it, end); 4900| 41| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (4900:17): [True: 33, False: 8] ------------------ 4901| 33| return; 4902| 8| if constexpr (requires { value.reset(); }) { 4903| 8| value.reset(); 4904| 8| } 4905| 8| } 4906| 14.7k| else { 4907| 14.7k| if constexpr (nullable_value_t) { 4908| 14.7k| if (not value.has_value()) { ------------------ | Branch (4908:20): [True: 14.7k, False: 40] ------------------ 4909| | if constexpr (constructible) { 4910| | value = meta_construct_v(); 4911| | } 4912| 14.7k| else if constexpr (requires { value.emplace(); }) { 4913| 14.7k| value.emplace(); 4914| | } 4915| | else { 4916| | static_assert(false_v, 4917| | "Your nullable type must have `emplace()` or be glz::meta constructible, or " 4918| | "create a custom glz::from specialization"); 4919| | } 4920| 14.7k| } 4921| 14.7k| parse::op(value.value(), ctx, it, end); 4922| | } 4923| | else { 4924| | if (!value) { 4925| | if (!nullable_emplace(value, ctx)) { 4926| | return; 4927| | } 4928| | } 4929| | parse::op(*value, ctx, it, end); 4930| | } 4931| 14.7k| } 4932| 14.7k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__17variantIJNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEN9repe_fuzz6amountEEEETkNS_10is_contextERNS_7contextERPKcSJ_EEvOT0_OT1_OT2_T3_: 49| 14.7k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 14.7k| else { 60| 14.7k| using V = std::remove_cvref_t; 61| 14.7k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 14.7k| end); 63| 14.7k| } 64| 14.7k| } _ZN3glz4fromILj10ENSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSJ_EEvOT0_OT1_OT2_T3_: 3860| 14.7k| { 3861| | if constexpr (tagging == variant_tagging_kind::adjacent) { 3862| | read_adjacent(value, ctx, it, end); 3863| | } 3864| 14.7k| else { 3865| 14.7k| read_deduced(value, ctx, it, end); 3866| 14.7k| } 3867| 14.7k| } _ZN3glz4fromILj10ENSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEEE12read_deducedITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSB_TkNS_10is_contextERNS_7contextERPKcSJ_EEvOT0_OT1_OT2_T3_: 3871| 14.7k| { 3872| 14.7k| constexpr auto Opts = ws_handled_off(); 3873| 14.7k| if constexpr (variant_is_auto_deducible()) { 3874| 14.7k| if constexpr (not check_ws_handled(Options)) { 3875| 14.7k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (3875:20): [True: 40, False: 14.7k] ------------------ 3876| 40| return; 3877| 40| } 3878| 14.7k| } 3879| | 3880| 14.7k| switch (*it) { 3881| 214| case '\0': ------------------ | Branch (3881:13): [True: 214, False: 14.5k] ------------------ 3882| 214| ctx.error = error_code::unexpected_end; 3883| 214| return; 3884| 9.08k| case '{': { ------------------ | Branch (3884:13): [True: 9.08k, False: 5.71k] ------------------ 3885| | // This branch consumes the brace itself and hands the object to a reader with 3886| | // `opening_handled`, which therefore does not count the level -- but does release it at 3887| | // the closing brace. So the level is taken here, in both buffer modes, and paid back by 3888| | // the reader below. 3889| 9.08k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (3889:20): [True: 0, False: 9.08k] ------------------ 3890| 0| return; 3891| 0| } 3892| | 3893| 9.08k| ++it; 3894| 9.08k| if constexpr (not Opts.null_terminated) { 3895| 9.08k| if (it == end) [[unlikely]] { ------------------ | Branch (3895:23): [True: 7, False: 9.08k] ------------------ 3896| 7| ctx.error = error_code::unexpected_end; 3897| 7| return; 3898| 7| } 3899| 9.08k| } 3900| 9.08k| using type_counts = variant_type_count; 3901| 9.08k| constexpr auto n_object_candidates = variant_object_candidate_count_v; 3902| | if constexpr (n_object_candidates < 1) { 3903| | ctx.error = error_code::no_matching_variant_type; 3904| | return; 3905| | } 3906| 9.08k| else if constexpr (n_object_candidates == 1 && tag_v.empty()) { 3907| 9.08k| constexpr auto first_idx = variant_first_object_candidate_v; 3908| 9.08k| using V = std::variant_alternative_t; 3909| 9.08k| if (!std::holds_alternative(value)) value = V{}; ------------------ | Branch (3909:23): [True: 9.08k, False: 7] ------------------ 3910| 9.08k| parse::op()>(std::get(value), ctx, it, end); 3911| 9.08k| return; 3912| | } 3913| | else { 3914| | auto possible_types = bit_array>{}.flip(); 3915| | static constexpr auto& deduction_bits = variant_deduction_bits; 3916| | static constexpr size_t deduction_key_count = variant_deduction_key_count; 3917| | static constexpr auto tag_literal = string_literal_from_view.size()>(tag_v); 3918| | 3919| | // Track if we've encountered a tag and what value it had 3920| | std::optional tag_specified_index{}; 3921| | 3922| | if (skip_ws(ctx, it, end)) { 3923| | return; 3924| | } 3925| | // Once the reader knows which alternative this object holds it may have to read 3926| | // it again from here. Anchor the position rather than keep the pointer: the scan 3927| | // below skips values, and a streaming skip refills, which moves the window out 3928| | // from under a raw pointer (see rewind_anchor). 3929| | auto start = make_rewind_anchor(ctx, it); 3930| | bool first_key = true; 3931| | // Parse bifurcation for tagged variants: 3932| | // 3933| | // Without this optimization, tagged variant parsing always uses two passes: 3934| | // 1. Scan all keys to find the tag (e.g. "type"), skipping values 3935| | // 2. Reset `it = start` and re-parse the entire object into the resolved type 3936| | // 3937| | // When the tag is the first key, the second pass redundantly re-reads every 3938| | // field that follows it. This lambda avoids that: if the tag was the first key, 3939| | // it advances past the trailing comma so the object parser picks up at the 3940| | // second field. If the tag was found later, it falls back to the full re-parse. 3941| | // 3942| | // One exception: if the tag name is also a field on the resolved struct 3943| | // (contains_tag), we must re-parse regardless so the value is stored in 3944| | // the struct field. This override is applied inside each std::visit lambda. 3945| | // 3946| | // Either way the rewind can fail under a streaming read: the window only holds so 3947| | // much, and an object wider than it has no start left to return to. 3948| | auto position_after_tag = [&] { 3949| | if (first_key) { 3950| | if (*it == ',') ++it; // skip comma; handles tag-only objects where *it == '}' 3951| | return true; 3952| | } 3953| | return start.rewind(ctx, it, end); // tag came later, re-parse from the beginning 3954| | }; 3955| | // `first_key` also answers "were we reset to the object start", which is what 3956| | // position_after_tag does for every key but the first. 3957| | for (; *it != '}'; first_key = false) { 3958| | if (!first_key) { 3959| | if (match_invalid_end<',', Opts>(ctx, it, end)) { 3960| | return; 3961| | } 3962| | } 3963| | 3964| | if (skip_ws(ctx, it, end)) { 3965| | return; 3966| | } 3967| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3968| | return; 3969| | } 3970| | 3971| | auto* key_start = it; 3972| | skip_string_view(ctx, it, end); 3973| | if (bool(ctx.error)) [[unlikely]] 3974| | return; 3975| | if (validate_utf8_span(ctx, key_start, it)) [[unlikely]] 3976| | return; 3977| | const sv key = {key_start, size_t(it - key_start)}; 3978| | 3979| | if (match_invalid_end<'"', Opts>(ctx, it, end)) { 3980| | return; 3981| | } 3982| | 3983| | if constexpr (deduction_key_count > 0) { 3984| | // We first check if a tag is defined and see if the key matches the tag 3985| | if constexpr (not tag_v.empty()) { 3986| | if (key == tag_v) { 3987| | if (parse_ws_colon(ctx, it, end)) { 3988| | return; 3989| | } 3990| | 3991| | using id_type = std::decay_t[0])>; 3992| | 3993| | std::conditional_t, id_type, sv> type_id{}; 3994| | if constexpr (std::integral) { 3995| | from::template op()>(type_id, ctx, it, end); 3996| | } 3997| | else { 3998| | // The id is turned into an index below and never leaves this 3999| | // reader, so the view of the window it borrows cannot outlive it. 4000| | parse_transient_string_view()>(type_id, ctx, it, end); 4001| | } 4002| | if (bool(ctx.error)) [[unlikely]] 4003| | return; 4004| | if (skip_ws(ctx, it, end)) { 4005| | return; 4006| | } 4007| | if (!(*it == ',' || *it == '}')) [[unlikely]] { 4008| | ctx.error = error_code::syntax_error; 4009| | return; 4010| | } 4011| | 4012| | size_t type_index; 4013| | if constexpr (std::integral) { 4014| | type_index = variant_id_to_index::op(type_id); 4015| | } 4016| | else { 4017| | type_index = variant_id_to_index::op( 4018| | type_id.data(), type_id.data() + type_id.size(), type_id.size()); 4019| | } 4020| | if (type_index < ids_v.size()) [[likely]] { 4021| | // Check if the deduced types include the tag-specified type 4022| | // If not, the tag doesn't match the fields 4023| | // We're already inside if constexpr (deduction_registry.size()), so we know deduction 4024| | // is happening. At this point, possible_types has been narrowed by field deduction. 4025| | // Check if the tag-specified type is still possible 4026| | const bool type_is_possible = possible_types[type_index]; 4027| | if (!type_is_possible) { 4028| | // Tag specifies a type that doesn't match the fields seen so far 4029| | ctx.error = error_code::no_matching_variant_type; 4030| | return; 4031| | } 4032| | 4033| | if (!position_after_tag()) return; 4034| | tag_specified_index = type_index; // Store the tag-specified type 4035| | if (value.index() != type_index) emplace_runtime_variant(value, type_index); 4036| | std::visit( 4037| | [&](auto&& v) { 4038| | using V = std::decay_t; 4039| | constexpr bool is_object = 4040| | (glaze_object_t || reflectable) && not custom_read; 4041| | if constexpr (variant_unit_alternative) { 4042| | // A unit alternative carries no data; its object holds only the 4043| | // discriminator. Consume that body through an empty reflected object so 4044| | // unknown-key policy and terminator handling match every other alternative. 4045| | detail::variant_unit_body unit_body{}; 4046| | from::template op(), 4047| | tag_literal>(unit_body, 4048| | ctx, it, end); 4049| | } 4050| | else if constexpr (is_object) { 4051| | if constexpr (contains_tag()) { 4052| | // tag is a struct field, must re-parse 4053| | if (!start.rewind(ctx, it, end)) return; 4054| | } 4055| | from::template op(), tag_literal>(v, ctx, it, 4056| | end); 4057| | } 4058| | else if constexpr (is_memory_object) { 4059| | if (!v) { 4060| | if constexpr (is_specialization_v) { 4061| | if constexpr (requires { v.emplace(); }) { 4062| | v.emplace(); 4063| | } 4064| | else { 4065| | v = typename V::value_type{}; 4066| | } 4067| | } 4068| | else if constexpr (is_specialization_v) 4069| | v = std::make_unique(); 4070| | else if constexpr (is_specialization_v) 4071| | v = std::make_shared(); 4072| | else if constexpr (constructible) { 4073| | v = meta_construct_v(); 4074| | } 4075| | else if constexpr (std::is_pointer_v && 4076| | can_allocate_raw_pointer>) { 4078| | if (!try_allocate_raw_pointer(v, ctx)) { 4079| | return; 4080| | } 4081| | } 4082| | else { 4083| | ctx.error = error_code::invalid_nullable_read; 4084| | return; 4085| | // Cannot read into unset nullable that is not std::optional, 4086| | // std::unique_ptr, or std::shared_ptr 4087| | } 4088| | } 4089| | if constexpr (contains_tag, tag_literal>()) { 4090| | // tag is a struct field, must re-parse 4091| | if (!start.rewind(ctx, it, end)) return; 4092| | } 4093| | from>::template op(), tag_literal>( 4094| | *v, ctx, it, end); 4095| | } 4096| | else if constexpr (custom_read) { 4097| | // Custom handlers parse the remaining body themselves and do not 4098| | // accept the tag template parameter; the tag was already consumed. 4099| | // This only works when the tag was the first key. If it came later, 4100| | // we were reset to the object start and the custom handler would 4101| | // absorb the tag, so error rather than corrupt the value. 4102| | if (!first_key) { 4103| | ctx.error = error_code::feature_not_supported; 4104| | ctx.custom_error_message = 4105| | "the tag must be the first key for a custom variant alternative"; 4106| | return; 4107| | } 4108| | from::template op()>(v, ctx, it, end); 4109| | } 4110| | }, 4111| | value); 4112| | 4113| | return; // we've decoded our target type 4114| | } 4115| | else [[unlikely]] { 4116| | // Check if we have a default type (ids array shorter than variant) 4117| | constexpr auto ids_size = ids_v.size(); 4118| | constexpr auto variant_size = std::variant_size_v; 4119| | if constexpr (ids_size < variant_size) { 4120| | // Use the first unlabeled type as the default 4121| | const auto default_type_index = ids_size; 4122| | 4123| | if (!position_after_tag()) return; 4124| | tag_specified_index = default_type_index; // Store the default type index 4125| | if (value.index() != default_type_index) 4126| | emplace_runtime_variant(value, default_type_index); 4127| | std::visit( 4128| | [&](auto&& v) { 4129| | using V = std::decay_t; 4130| | constexpr bool is_object = 4131| | (glaze_object_t || reflectable) && not custom_read; 4132| | if constexpr (variant_unit_alternative) { 4133| | // A unit alternative carries no data; its object holds only the 4134| | // discriminator. Consume that body through an empty reflected object so 4135| | // unknown-key policy and terminator handling match every other 4136| | // alternative. 4137| | detail::variant_unit_body unit_body{}; 4138| | from::template op(), 4139| | tag_literal>( 4140| | unit_body, ctx, it, end); 4141| | } 4142| | else if constexpr (is_object) { 4143| | if constexpr (contains_tag()) { 4144| | // tag is a struct field, must re-parse 4145| | if (!start.rewind(ctx, it, end)) return; 4146| | } 4147| | from::template op()>(v, ctx, it, end); 4148| | } 4149| | else if constexpr (is_memory_object) { 4150| | if (!v) { 4151| | if constexpr (is_specialization_v) { 4152| | if constexpr (requires { v.emplace(); }) { 4153| | v.emplace(); 4154| | } 4155| | else { 4156| | v = typename V::value_type{}; 4157| | } 4158| | } 4159| | else if constexpr (is_specialization_v) 4160| | v = std::make_unique(); 4161| | else if constexpr (is_specialization_v) 4162| | v = std::make_shared(); 4163| | else if constexpr (constructible) { 4164| | v = meta_construct_v(); 4165| | } 4166| | else if constexpr (std::is_pointer_v && 4167| | can_allocate_raw_pointer< 4168| | Opts, std::decay_t>) { 4169| | if (!try_allocate_raw_pointer(v, ctx)) { 4170| | return; 4171| | } 4172| | } 4173| | else { 4174| | ctx.error = error_code::invalid_nullable_read; 4175| | return; 4176| | } 4177| | } 4178| | if constexpr (contains_tag, tag_literal>()) { 4179| | // tag is a struct field, must re-parse 4180| | if (!start.rewind(ctx, it, end)) return; 4181| | } 4182| | from>::template op()>(*v, ctx, 4183| | it, end); 4184| | } 4185| | else if constexpr (custom_read) { 4186| | // Custom handlers parse the remaining body themselves; this only 4187| | // works when the tag was the first key (see above). If it came 4188| | // later we were reset to the object start, so error rather than 4189| | // let the custom handler absorb the tag. 4190| | if (!first_key) { 4191| | ctx.error = error_code::feature_not_supported; 4192| | ctx.custom_error_message = 4193| | "the tag must be the first key for a custom variant alternative"; 4194| | return; 4195| | } 4196| | from::template op()>(v, ctx, it, end); 4197| | } 4198| | }, 4199| | value); 4200| | 4201| | return; 4202| | } 4203| | else { 4204| | ctx.error = error_code::no_matching_variant_type; 4205| | ctx.custom_error_message = variant_ids_string_v; 4206| | return; 4207| | } 4208| | } 4209| | } 4210| | } 4211| | 4212| | // Inline decode_hash lookup for variant deduction 4213| | using deduction_keys_t = keys_wrapper>; 4214| | constexpr auto& DeductionHashInfo = hash_info; 4215| | const auto deduction_index = 4216| | decode_hash_with_size::op( 4217| | key.data(), key.data() + key.size(), key.size()); 4218| | if (deduction_index < deduction_key_count && variant_deduction_keys[deduction_index] == key) 4219| | [[likely]] { 4220| | possible_types &= deduction_bits[deduction_index]; 4221| | } 4222| | else if constexpr (Opts.error_on_unknown_keys) { 4223| | ctx.error = error_code::unknown_key; 4224| | return; 4225| | } 4226| | } 4227| | else if constexpr (not tag_v.empty()) { 4228| | // empty object case for variant, if there are no normal elements 4229| | if (key == tag_v) { 4230| | if (parse_ws_colon(ctx, it, end)) { 4231| | return; 4232| | } 4233| | 4234| | // The id is turned into an index below and never leaves this reader, 4235| | // so the view of the window it borrows cannot outlive that window. 4236| | std::string_view type_id{}; 4237| | parse_transient_string_view()>(type_id, ctx, it, end); 4238| | if (bool(ctx.error)) [[unlikely]] 4239| | return; 4240| | if (skip_ws(ctx, it, end)) { 4241| | return; 4242| | } 4243| | 4244| | const auto type_index = variant_id_to_index::op( 4245| | type_id.data(), type_id.data() + type_id.size(), type_id.size()); 4246| | if (type_index < ids_v.size()) [[likely]] { 4247| | if (!position_after_tag()) return; 4248| | tag_specified_index = type_index; // Store the tag-specified type 4249| | if (value.index() != type_index) emplace_runtime_variant(value, type_index); 4250| | } 4251| | else { 4252| | // Check if we have a default type (ids array shorter than variant) 4253| | constexpr auto ids_size = ids_v.size(); 4254| | constexpr auto variant_size = std::variant_size_v; 4255| | if constexpr (ids_size < variant_size) { 4256| | // Use the first unlabeled type as the default 4257| | if (!position_after_tag()) return; 4258| | const auto default_index = ids_size; 4259| | tag_specified_index = default_index; // Store the default type index 4260| | if (value.index() != default_index) emplace_runtime_variant(value, default_index); 4261| | } 4262| | else { 4263| | ctx.error = error_code::no_matching_variant_type; 4264| | ctx.custom_error_message = variant_ids_string_v; 4265| | return; 4266| | } 4267| | } 4268| | // Parse the type (handles tag skipping and unknown keys) 4269| | std::visit( 4270| | [&](auto&& v) { 4271| | using V = std::decay_t; 4272| | if constexpr (custom_read) { 4273| | // Custom handlers parse the remaining object body themselves and do not 4274| | // accept the tag template parameter that reflected objects use to skip an 4275| | // interior tag key. That only works when the tag is the first key (it was 4276| | // just consumed). If the tag came after other keys, position_after_tag() 4277| | // reset us to the object start and the custom handler would absorb the tag 4278| | // into its value, so error here rather than corrupt the result. 4279| | if (!first_key) { 4280| | ctx.error = error_code::feature_not_supported; 4281| | ctx.custom_error_message = 4282| | "the tag must be the first key for a custom variant alternative"; 4283| | return; 4284| | } 4285| | from::template op()>(v, ctx, it, end); 4286| | } 4287| | else { 4288| | if constexpr (contains_tag()) { 4289| | // tag is a struct field, must re-parse 4290| | if (!start.rewind(ctx, it, end)) return; 4291| | } 4292| | from::template op(), tag_literal>(v, ctx, it, end); 4293| | } 4294| | }, 4295| | value); 4296| | return; 4297| | } 4298| | else if constexpr (Opts.error_on_unknown_keys) { 4299| | ctx.error = error_code::unknown_key; 4300| | return; 4301| | } 4302| | else { 4303| | // Skip unknown key's value (non-tag key in empty variant) 4304| | if (parse_ws_colon(ctx, it, end)) { 4305| | return; 4306| | } 4307| | skip_value::op(ctx, it, end); 4308| | if (bool(ctx.error)) [[unlikely]] 4309| | return; 4310| | resync_window_end(ctx, end); // a streaming skip refills 4311| | if (skip_ws(ctx, it, end)) { 4312| | return; 4313| | } 4314| | continue; // Continue loop to find the tag 4315| | } 4316| | } 4317| | else if constexpr (Opts.error_on_unknown_keys) { 4318| | ctx.error = error_code::unknown_key; 4319| | return; 4320| | } 4321| | 4322| | auto matching_types = possible_types.popcount(); 4323| | if (matching_types == 0) { 4324| | ctx.error = error_code::no_matching_variant_type; 4325| | return; 4326| | } 4327| | // Only short-circuit for variants without tags 4328| | else if constexpr (tag_v.empty()) { 4329| | if (matching_types == 1) { 4330| | if (!start.rewind(ctx, it, end)) return; 4331| | const auto type_index = possible_types.countr_zero(); 4332| | 4333| | if (value.index() != static_cast(type_index)) 4334| | emplace_runtime_variant(value, type_index); 4335| | std::visit( 4336| | [&](auto&& v) { 4337| | using V = std::decay_t; 4338| | constexpr bool is_object = (glaze_object_t || reflectable) && not custom_read; 4339| | if constexpr (variant_unit_alternative) { 4340| | // A unit alternative carries no data; its object holds only the discriminator. 4341| | // Consume that body through an empty reflected object so unknown-key policy and 4342| | // terminator handling match every other alternative. 4343| | detail::variant_unit_body unit_body{}; 4344| | from::template op(), 4345| | tag_literal>(unit_body, ctx, it, 4346| | end); 4347| | } 4348| | else if constexpr (is_object) { 4349| | from::template op(), tag_literal>(v, ctx, it, end); 4350| | } 4351| | else if constexpr (is_memory_object) { 4352| | if (!v) { 4353| | if constexpr (is_specialization_v) { 4354| | if constexpr (requires { v.emplace(); }) { 4355| | v.emplace(); 4356| | } 4357| | else { 4358| | v = typename V::value_type{}; 4359| | } 4360| | } 4361| | else if constexpr (is_specialization_v) 4362| | v = std::make_unique(); 4363| | else if constexpr (is_specialization_v) 4364| | v = std::make_shared(); 4365| | else if constexpr (constructible) { 4366| | v = meta_construct_v(); 4367| | } 4368| | else if constexpr (std::is_pointer_v && 4369| | can_allocate_raw_pointer>) { 4370| | if (!try_allocate_raw_pointer(v, ctx)) { 4371| | return; 4372| | } 4373| | } 4374| | else { 4375| | ctx.error = error_code::invalid_nullable_read; 4376| | return; 4377| | // Cannot read into unset nullable that is not std::optional, 4378| | // std::unique_ptr, or std::shared_ptr 4379| | } 4380| | } 4381| | from>::template op(), tag_literal>( 4382| | *v, ctx, it, end); 4383| | } 4384| | else if constexpr (custom_read) { 4385| | // Custom handlers parse the remaining body themselves. 4386| | from::template op()>(v, ctx, it, end); 4387| | } 4388| | }, 4389| | value); 4390| | 4391| | return; // we've decoded our target type 4392| | } 4393| | } 4394| | // For tagged variants, continue processing to validate tags 4395| | if (parse_ws_colon(ctx, it, end)) { 4396| | return; 4397| | } 4398| | 4399| | skip_value::op(ctx, it, end); 4400| | if (bool(ctx.error)) [[unlikely]] 4401| | return; 4402| | resync_window_end(ctx, end); // a streaming skip refills 4403| | if (skip_ws(ctx, it, end)) { 4404| | return; 4405| | } 4406| | } 4407| | // Only apply ambiguous variant resolution if we have multiple object types 4408| | if constexpr ((type_counts::n_object + type_counts::n_nullable_object) > 1) { 4409| | // After parsing all keys, check if we have multiple matching types 4410| | // If so, choose the one with the fewest fields 4411| | auto final_matching = possible_types.popcount(); 4412| | if (final_matching == 0) { 4413| | ctx.error = error_code::no_matching_variant_type; 4414| | } 4415| | else if (final_matching == 1) { 4416| | // Single type remains after field deduction 4417| | const auto type_index = possible_types.countr_zero(); 4418| | 4419| | // Validate against tag if one was specified 4420| | if (tag_specified_index.has_value() && 4421| | tag_specified_index.value() != static_cast(type_index)) { 4422| | ctx.error = error_code::no_matching_variant_type; 4423| | return; 4424| | } 4425| | 4426| | if (!start.rewind(ctx, it, end)) return; 4427| | if (value.index() != static_cast(type_index)) 4428| | emplace_runtime_variant(value, type_index); 4429| | std::visit( 4430| | [&](auto&& v) { 4431| | using V = std::decay_t; 4432| | constexpr bool is_object = (glaze_object_t || reflectable) && not custom_read; 4433| | if constexpr (variant_unit_alternative) { 4434| | // A unit alternative carries no data; its object holds only the discriminator. 4435| | // Consume that body through an empty reflected object so unknown-key policy and 4436| | // terminator handling match every other alternative. 4437| | detail::variant_unit_body unit_body{}; 4438| | from::template op(), 4439| | tag_literal>(unit_body, ctx, it, 4440| | end); 4441| | } 4442| | else if constexpr (is_object) { 4443| | from::template op(), tag_literal>(v, ctx, it, end); 4444| | } 4445| | else if constexpr (is_memory_object) { 4446| | if (!v) { 4447| | if constexpr (is_specialization_v) { 4448| | if constexpr (requires { v.emplace(); }) { 4449| | v.emplace(); 4450| | } 4451| | else { 4452| | v = typename V::value_type{}; 4453| | } 4454| | } 4455| | else if constexpr (is_specialization_v) 4456| | v = std::make_unique(); 4457| | else if constexpr (is_specialization_v) 4458| | v = std::make_shared(); 4459| | else if constexpr (constructible) { 4460| | v = meta_construct_v(); 4461| | } 4462| | else if constexpr (std::is_pointer_v && 4463| | can_allocate_raw_pointer>) { 4464| | if (!try_allocate_raw_pointer(v, ctx)) { 4465| | return; 4466| | } 4467| | } 4468| | else { 4469| | ctx.error = error_code::invalid_nullable_read; 4470| | return; 4471| | } 4472| | } 4473| | from>::template op(), tag_literal>(*v, ctx, 4474| | it, end); 4475| | } 4476| | else if constexpr (custom_read) { 4477| | // Custom handlers parse the remaining body themselves. 4478| | from::template op()>(v, ctx, it, end); 4479| | } 4480| | }, 4481| | value); 4482| | } 4483| | else if (final_matching > 1) { 4484| | constexpr auto N = std::variant_size_v; 4485| | 4486| | // Compile-time array of field counts for each variant type 4487| | constexpr auto field_counts = [](std::index_sequence) { 4488| | return std::array { 4489| | ([]() -> size_t { 4490| | using V = std::decay_t>; 4491| | if constexpr (glaze_object_t || reflectable) { 4492| | return reflect::size; 4493| | } 4494| | else if constexpr (is_memory_object) { 4495| | using X = memory_type; 4496| | if constexpr (glaze_object_t || reflectable) { 4497| | return reflect::size; 4498| | } 4499| | else { 4500| | return (std::numeric_limits::max)(); 4501| | } 4502| | } 4503| | else { 4504| | return (std::numeric_limits::max)(); 4505| | } 4506| | }.template operator()())... 4507| | }; 4508| | }(std::make_index_sequence{}); 4509| | 4510| | // Find the type with minimum field count among the possible types 4511| | size_t min_fields = (std::numeric_limits::max)(); 4512| | size_t chosen_index = N; // Invalid index initially 4513| | 4514| | for (size_t i = 0; i < N; ++i) { 4515| | if (possible_types[i] && field_counts[i] < min_fields) { 4516| | min_fields = field_counts[i]; 4517| | chosen_index = i; 4518| | } 4519| | } 4520| | 4521| | if (chosen_index < N) { 4522| | // Validate against tag if one was specified 4523| | if (tag_specified_index.has_value() && tag_specified_index.value() != chosen_index) { 4524| | ctx.error = error_code::no_matching_variant_type; 4525| | return; 4526| | } 4527| | 4528| | if (!start.rewind(ctx, it, end)) return; 4529| | if (value.index() != chosen_index) emplace_runtime_variant(value, chosen_index); 4530| | std::visit( 4531| | [&](auto&& v) { 4532| | using V = std::decay_t; 4533| | constexpr bool is_object = (glaze_object_t || reflectable) && not custom_read; 4534| | if constexpr (variant_unit_alternative) { 4535| | // A unit alternative carries no data; its object holds only the discriminator. 4536| | // Consume that body through an empty reflected object so unknown-key policy and 4537| | // terminator handling match every other alternative. 4538| | detail::variant_unit_body unit_body{}; 4539| | from::template op(), 4540| | tag_literal>(unit_body, ctx, it, 4541| | end); 4542| | } 4543| | else if constexpr (is_object) { 4544| | from::template op(), tag_literal>(v, ctx, it, end); 4545| | } 4546| | else if constexpr (is_memory_object) { 4547| | if (!v) { 4548| | if constexpr (is_specialization_v) { 4549| | if constexpr (requires { v.emplace(); }) { 4550| | v.emplace(); 4551| | } 4552| | else { 4553| | v = typename V::value_type{}; 4554| | } 4555| | } 4556| | else if constexpr (is_specialization_v) 4557| | v = std::make_unique(); 4558| | else if constexpr (is_specialization_v) 4559| | v = std::make_shared(); 4560| | else if constexpr (constructible) { 4561| | v = meta_construct_v(); 4562| | } 4563| | else if constexpr (std::is_pointer_v && 4564| | can_allocate_raw_pointer>) { 4565| | if (!try_allocate_raw_pointer(v, ctx)) { 4566| | return; 4567| | } 4568| | } 4569| | else { 4570| | ctx.error = error_code::invalid_nullable_read; 4571| | return; 4572| | } 4573| | } 4574| | from>::template op(), tag_literal>( 4575| | *v, ctx, it, end); 4576| | } 4577| | else if constexpr (custom_read) { 4578| | // Custom handlers parse the remaining body themselves. 4579| | from::template op()>(v, ctx, it, end); 4580| | } 4581| | }, 4582| | value); 4583| | } 4584| | else { 4585| | ctx.error = error_code::no_matching_variant_type; 4586| | } 4587| | } 4588| | } 4589| | else { 4590| | // For variants with 0 or 1 object types, use the original error handling 4591| | ctx.error = error_code::no_matching_variant_type; 4592| | } 4593| | } 4594| 0| break; 4595| 9.08k| } 4596| 1.90k| case '[': ------------------ | Branch (4596:13): [True: 1.90k, False: 12.8k] ------------------ 4597| | // As with '{' above: the array reader each alternative goes through counts the level. 4598| 1.90k| process_variant_alternatives::template op(value, ctx, it, end); 4599| 1.90k| break; 4600| 1.10k| case '"': { ------------------ | Branch (4600:13): [True: 1.10k, False: 13.6k] ------------------ 4601| 1.10k| process_variant_alternatives::template op(value, ctx, it, end); 4602| 1.10k| break; 4603| 9.08k| } 4604| 6| case 't': ------------------ | Branch (4604:13): [True: 6, False: 14.7k] ------------------ 4605| 10| case 'f': { ------------------ | Branch (4605:13): [True: 4, False: 14.7k] ------------------ 4606| 10| process_variant_alternatives::template op(value, ctx, it, end); 4607| 10| break; 4608| 6| } 4609| 38| case 'n': ------------------ | Branch (4609:13): [True: 38, False: 14.7k] ------------------ 4610| 38| if constexpr (variant_count_v == 0) { 4611| 38| ctx.error = error_code::no_matching_variant_type; 4612| | } 4613| | else { 4614| | constexpr auto first_idx = variant_first_index_v; 4615| | using V = std::variant_alternative_t; 4616| | if (!std::holds_alternative(value)) value = V{}; 4617| | match<"null", Opts>(ctx, it, end); 4618| | } 4619| 38| break; 4620| 2.40k| default: { ------------------ | Branch (4620:13): [True: 2.40k, False: 12.3k] ------------------ 4621| | // Not bool, string, object, or array so must be number or null 4622| 2.40k| process_variant_alternatives::template op(value, ctx, it, end); 4623| 2.40k| } 4624| 14.7k| } 4625| | } 4626| | else { 4627| | // For non-auto-deducible variants, try each type until one succeeds 4628| | constexpr auto N = std::variant_size_v; 4629| | bool parsed = false; 4630| | bool exhausted = false; // speculation budget spent; see charge_speculation 4631| | 4632| | for_each([&]() { 4633| | if (parsed || exhausted || variant_alternative_exhausted(ctx)) return; 4634| | 4635| | auto copy_it = it; 4636| | // A rejected alternative may have bailed out inside a container, which leaves its 4637| | // nesting level counted (see enter_depth), so the depth rewinds with the iterator. 4638| | const auto copy_depth = ctx.depth; 4639| | 4640| | // Try parsing as this type 4641| | if (value.index() != I) { 4642| | emplace_runtime_variant(value, I); 4643| | } 4644| | 4645| | std::visit([&](auto&& v) { parse::op(v, ctx, it, end); }, value); 4646| | if (bool(ctx.error) && !charge_speculation(ctx, size_t(it - copy_it))) { 4647| | exhausted = true; // only rejected attempts are charged; see charge_speculation 4648| | } 4649| | 4650| | if (!bool(ctx.error)) { 4651| | parsed = true; 4652| | } 4653| | else if constexpr (not Options.null_terminated) { 4654| | // In non-null-terminated mode, if we hit end_reached after advancing the iterator, 4655| | // it means we successfully parsed the value but couldn't skip trailing whitespace 4656| | if (ctx.error == error_code::end_reached && it > copy_it && not speculation_exhausted(ctx)) { 4657| | // We advanced the iterator, so we did parse something -- unless what advanced it 4658| | // was an abandoned attempt, which is what a spent speculation budget means. 4659| | parsed = true; 4660| | ctx.error = error_code::none; 4661| | } 4662| | else { 4663| | // Reset for next attempt (unless this is the last type) 4664| | it = copy_it; 4665| | rewind_depth(ctx, copy_depth); 4666| | if constexpr (I + 1 < N) { 4667| | if (not exhausted && not variant_alternative_exhausted(ctx)) { 4668| | ctx.error = error_code::none; // Clear error for next attempt 4669| | } 4670| | } 4671| | } 4672| | } 4673| | else { 4674| | // Reset for next attempt (unless this is the last type) 4675| | it = copy_it; 4676| | rewind_depth(ctx, copy_depth); 4677| | if constexpr (I + 1 < N) { 4678| | if (not exhausted && not variant_alternative_exhausted(ctx)) { 4679| | ctx.error = error_code::none; // Clear error for next attempt 4680| | } 4681| | } 4682| | } 4683| | }); 4684| | } 4685| 14.7k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIdNS4_9allocatorIdEEEETkNS_10is_contextERNS_7contextERPKcSD_EEvOT0_OT1_OT2_T3_: 49| 14.7k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 14.7k| else { 60| 14.7k| using V = std::remove_cvref_t; 61| 14.7k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 14.7k| end); 63| 14.7k| } 64| 14.7k| } _ZN3glz4fromILj10ENSt3__16vectorIdNS1_9allocatorIdEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS5_TkNS_10is_contextERNS_7contextERPKcSD_EEvOT0_OT1_OT2_T3_: 2050| 14.7k| { 2051| 14.7k| constexpr auto Opts = ws_handled_off(); 2052| 14.7k| if constexpr (!check_ws_handled(Options)) { 2053| 14.7k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2053:17): [True: 40, False: 14.7k] ------------------ 2054| 40| return; 2055| 40| } 2056| 14.7k| } 2057| | 2058| 14.7k| if (match_invalid_end<'[', Opts>(ctx, it, end)) { ------------------ | Branch (2058:14): [True: 12.8k, False: 1.95k] ------------------ 2059| 12.8k| return; 2060| 12.8k| } 2061| | // one nesting level (see enter_depth): counted in both modes so the limit binds, 2062| | // released at each syntactic close below 2063| 1.95k| if (enter_depth(ctx)) [[unlikely]] { ------------------ | Branch (2063:14): [True: 0, False: 1.95k] ------------------ 2064| 0| return; 2065| 0| } 2066| | 2067| 1.95k| const auto ws_start = it; 2068| 1.95k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2068:14): [True: 14, False: 1.93k] ------------------ 2069| 14| return; 2070| 14| } 2071| | 2072| 1.93k| if (*it == ']') { ------------------ | Branch (2072:14): [True: 9, False: 1.92k] ------------------ 2073| 9| --ctx.depth; 2074| 9| ++it; 2075| 9| if constexpr ((resizable || is_inplace_vector) && not check_append_arrays(Opts)) { 2076| 9| value.clear(); 2077| | 2078| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2079| | value.shrink_to_fit(); 2080| | } 2081| 9| } 2082| 9| return; 2083| 9| } 2084| | 2085| 1.92k| const size_t ws_size = size_t(it - ws_start); 2086| | 2087| 1.92k| static constexpr bool should_append = (resizable || is_inplace_vector) && check_append_arrays(Opts); ------------------ | Branch (2087:49): [True: 1.92k, Folded] | Branch (2087:65): [Folded, False: 0] | Branch (2087:90): [Folded, False: 0] ------------------ 2088| 1.92k| if constexpr (not should_append) { 2089| 1.92k| const auto n = value.size(); 2090| | 2091| 1.92k| auto value_it = value.begin(); 2092| | 2093| 1.92k| for (size_t i = 0; i < n; ++i) { ------------------ | Branch (2093:32): [True: 0, False: 1.92k] ------------------ 2094| 0| parse::op()>(*value_it++, ctx, it, end); 2095| 0| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (2095:20): [True: 0, False: 0] ------------------ 2096| 0| return; 2097| 0| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2097:20): [True: 0, False: 0] ------------------ 2098| 0| return; 2099| 0| } 2100| 0| if (*it == ',') { ------------------ | Branch (2100:20): [True: 0, False: 0] ------------------ 2101| 0| ++it; 2102| | 2103| 0| if constexpr (!Opts.minified && !Opts.comments) { 2104| 0| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (2104:26): [True: 0, False: 0] | Branch (2104:37): [True: 0, False: 0] ------------------ 2105| 0| skip_matching_ws(ws_start, it, ws_size); 2106| 0| } 2107| 0| } 2108| | 2109| 0| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2109:23): [True: 0, False: 0] ------------------ 2110| 0| return; 2111| 0| } 2112| 0| } 2113| 0| else if (*it == ']') { ------------------ | Branch (2113:25): [True: 0, False: 0] ------------------ 2114| 0| --ctx.depth; 2115| 0| ++it; 2116| 0| if constexpr (erasable) { 2117| 0| value.erase(value_it, 2118| 0| value.end()); // use erase rather than resize for non-default constructible elements 2119| | 2120| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2121| | value.shrink_to_fit(); 2122| | } 2123| 0| } 2124| 0| return; 2125| 0| } 2126| 0| else [[unlikely]] { 2127| 0| ctx.error = error_code::expected_bracket; 2128| 0| return; 2129| 0| } 2130| 0| } 2131| 1.92k| } 2132| | 2133| | if constexpr (Opts.partial_read) { 2134| | // partial_read stops early on a success path, so give the level back like the 2135| | // syntactic-close paths do; otherwise it accumulates across reads sharing a context. 2136| | --ctx.depth; 2137| | return; 2138| | } 2139| 1.92k| else { 2140| | // growing 2141| 1.92k| if constexpr (emplace_backable || has_try_emplace_back) { 2142| 179k| while (it < end) { ------------------ | Branch (2142:23): [True: 178k, False: 40] ------------------ 2143| | // Streaming refill point: at start of each iteration, ensure buffer has data 2144| | if constexpr (has_streaming_state) { 2145| | if (ctx.stream.enabled()) { 2146| | const size_t consumed = static_cast(it - ctx.stream.data()); 2147| | const size_t remaining = ctx.stream.size() - consumed; 2148| | // Refill when less than half of buffer remains to ensure space for next element 2149| | if (remaining <= ctx.stream.size() / 2 || it >= end) { 2150| | const char* new_it; 2151| | const char* new_end; 2152| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2153| | it = new_it; 2154| | end = new_end; 2155| | if (it >= end && ctx.stream.at_eof()) { 2156| | break; // No more data, exit loop normally 2157| | } 2158| | } 2159| | } 2160| | } 2161| | 2162| | if constexpr (has_try_emplace_back) { 2163| | if (value.try_emplace_back()) 2164| | parse::op()>(value.back(), ctx, it, end); 2165| | else 2166| | ctx.error = error_code::exceeded_static_array_size; 2167| | } 2168| 178k| else { 2169| 178k| parse::op()>(value.emplace_back(), ctx, it, end); 2170| 178k| } 2171| | 2172| 178k| if (bool(ctx.error)) [[unlikely]] ------------------ | Branch (2172:23): [True: 1.05k, False: 177k] ------------------ 2173| 1.05k| return; 2174| | 2175| | // Streaming refill point: after parsing each element, refill if buffer is low 2176| | if constexpr (has_streaming_state) { 2177| | if (ctx.stream.enabled()) { 2178| | const size_t consumed = static_cast(it - ctx.stream.data()); 2179| | // Refill when less than 25% of buffer remains to ensure enough space for next element 2180| | if (ctx.stream.size() - consumed <= ctx.stream.size() / 4 || it >= end) { 2181| | const char* new_it; 2182| | const char* new_end; 2183| | ctx.stream.consume_and_refill(consumed, new_it, new_end); 2184| | it = new_it; 2185| | end = new_end; 2186| | if (it >= end && ctx.stream.at_eof()) { 2187| | ctx.error = error_code::unexpected_end; 2188| | return; 2189| | } 2190| | } 2191| | } 2192| | } 2193| | 2194| 177k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2194:23): [True: 39, False: 177k] ------------------ 2195| 39| return; 2196| 39| } 2197| 177k| if (*it == ',') [[likely]] { ------------------ | Branch (2197:23): [True: 177k, False: 718] ------------------ 2198| 177k| ++it; 2199| | 2200| 177k| if constexpr (!Opts.minified && !Opts.comments) { 2201| 177k| if (ws_size && ws_size < size_t(end - it)) { ------------------ | Branch (2201:29): [True: 143k, False: 33.4k] | Branch (2201:40): [True: 143k, False: 281] ------------------ 2202| 143k| skip_matching_ws(ws_start, it, ws_size); 2203| 143k| } 2204| 177k| } 2205| | 2206| 177k| if (skip_ws(ctx, it, end)) { ------------------ | Branch (2206:26): [True: 79, False: 177k] ------------------ 2207| 79| return; 2208| 79| } 2209| 177k| } 2210| 718| else if (*it == ']') { ------------------ | Branch (2210:28): [True: 502, False: 216] ------------------ 2211| 502| --ctx.depth; 2212| 502| ++it; 2213| | if constexpr (check_shrink_to_fit(Opts) && has_shrink_to_fit) { 2214| | value.shrink_to_fit(); 2215| | } 2216| 502| return; 2217| 502| } 2218| 216| else [[unlikely]] { 2219| 216| ctx.error = error_code::expected_bracket; 2220| 216| return; 2221| 216| } 2222| 177k| } 2223| | 2224| | // A valid array always returns from inside the loop upon reaching ']'. 2225| | // For a null-terminated buffer the loop can only exit here by falling 2226| | // through when `it` reaches the terminator without a closing bracket, 2227| | // which means the input was truncated (e.g. "[", "[1," or "[1,2,"). 2228| | // Non-null-terminated buffers surface this through skip_ws/depth 2229| | // tracking (or the streaming refill break), so this guard is limited 2230| | // to the null-terminated case. 2231| | if constexpr (Opts.null_terminated) { 2232| | ctx.error = error_code::unexpected_end; 2233| | } 2234| | } 2235| | else { 2236| | ctx.error = error_code::exceeded_static_array_size; 2237| | } 2238| 1.92k| } 2239| 1.92k| } _ZN3glz5parseILj10EE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEERdTkNS_10is_contextERNS_7contextERPKcS8_EEvOT0_OT1_OT2_T3_: 49| 178k| { 50| | if constexpr (const_value_v) { 51| | if constexpr (check_error_on_const_read(Opts)) { 52| | ctx.error = error_code::attempt_const_read; 53| | } 54| | else { 55| | // do not read anything into the const value 56| | skip_value::op(std::forward(ctx), std::forward(it), end); 57| | } 58| | } 59| 178k| else { 60| 178k| using V = std::remove_cvref_t; 61| 178k| from::template op(std::forward(value), std::forward(ctx), std::forward(it), 62| 178k| end); 63| 178k| } 64| 178k| } _ZN3glz2toILj10EiE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj128EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERiTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 814| 226| { 815| | if constexpr (not check_write_unchecked(Opts)) { 816| | static_assert(required_padding()); 817| | if (!ensure_space(ctx, b, ix + required_padding())) [[unlikely]] { 818| | return; 819| | } 820| | } 821| | 822| 226| static constexpr auto O = write_unchecked_on(); 823| | 824| | if constexpr (check_quoted_num(Opts)) { 825| | std::memcpy(&b[ix], "\"", 1); 826| | ++ix; 827| | write_chars::op(value, ctx, b, ix); 828| | std::memcpy(&b[ix], "\"", 1); 829| | ++ix; 830| | } 831| 226| else { 832| 226| write_chars::op(value, ctx, b, ix); 833| 226| } 834| 226| } _ZN3glz2toILj10EDnE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEDnTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1849| 21.9k| { 1850| 21.9k| if constexpr (not check_write_unchecked(Opts)) { 1851| 21.9k| if (!ensure_space(ctx, b, ix + 4)) [[unlikely]] { ------------------ | Branch (1851:17): [True: 0, False: 21.9k] ------------------ 1852| 0| return; 1853| 0| } 1854| 21.9k| } 1855| | if constexpr (std::endian::native == std::endian::big) { 1856| | static constexpr char null_v[] = "null"; 1857| | std::memcpy(&b[ix], null_v, 4); 1858| | } 1859| 21.9k| else { 1860| 21.9k| static constexpr uint32_t null_v = 1819047278; 1861| 21.9k| std::memcpy(&b[ix], &null_v, 4); 1862| 21.9k| } 1863| 21.9k| ix += 4; 1864| 21.9k| } _ZN3glz2toILj10EiE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERiTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 814| 470| { 815| 470| if constexpr (not check_write_unchecked(Opts)) { 816| 470| static_assert(required_padding()); 817| 470| if (!ensure_space(ctx, b, ix + required_padding())) [[unlikely]] { ------------------ | Branch (817:17): [True: 0, False: 470] ------------------ 818| 0| return; 819| 0| } 820| 470| } 821| | 822| 470| static constexpr auto O = write_unchecked_on(); 823| | 824| | if constexpr (check_quoted_num(Opts)) { 825| | std::memcpy(&b[ix], "\"", 1); 826| | ++ix; 827| | write_chars::op(value, ctx, b, ix); 828| | std::memcpy(&b[ix], "\"", 1); 829| | ++ix; 830| | } 831| 470| else { 832| 470| write_chars::op(value, ctx, b, ix); 833| 470| } 834| 470| } _ZN3glz16required_paddingIiEEmv: 538| 865| { 539| 865| constexpr auto value = []() -> size_t { 540| 865| if constexpr (boolean_like) { 541| 865| return 8; 542| 865| } 543| 865| else if constexpr (num_t) { 544| 865| if constexpr (std::floating_point) { 545| 865| if constexpr (sizeof(T) > 8) { 546| 865| return 64; 547| 865| } 548| 865| else if constexpr (sizeof(T) > 4) { 549| | // zmij scratch + 4 for optional quotes and trailing comma. 550| 865| return zmij::double_buffer_size + 4; 551| 865| } 552| 865| else { 553| 865| return zmij::float_buffer_size + 4; 554| 865| } 555| 865| } 556| 865| else if constexpr (sizeof(T) > 4) { 557| 865| return 24; 558| 865| } 559| 865| else if constexpr (sizeof(T) > 2) { 560| 865| return 16; 561| 865| } 562| 865| else { 563| 865| return 8; 564| 865| } 565| 865| } 566| 865| else if constexpr (nullable_like) { 567| 865| if constexpr (has_value_type) { 568| 865| return required_padding(); 569| 865| } 570| 865| else if constexpr (has_element_type) { 571| 865| return required_padding(); 572| 865| } 573| 865| else { 574| 865| return 0; 575| 865| } 576| 865| } 577| 865| else if constexpr (always_null_t) { 578| 865| return 8; 579| 865| } 580| 865| else { 581| 865| return 0; 582| 865| } 583| 865| }(); 584| | 585| | if constexpr (value >= (write_padding_bytes - 16)) { 586| | // we always require 16 bytes available from write_padding_bytes 587| | // for opening and closing characters 588| | return 0; 589| | } 590| 865| return value; 591| 865| } _ZN3glz2toILj10EiE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEiTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 814| 395| { 815| 395| if constexpr (not check_write_unchecked(Opts)) { 816| 395| static_assert(required_padding()); 817| 395| if (!ensure_space(ctx, b, ix + required_padding())) [[unlikely]] { ------------------ | Branch (817:17): [True: 0, False: 395] ------------------ 818| 0| return; 819| 0| } 820| 395| } 821| | 822| 395| static constexpr auto O = write_unchecked_on(); 823| | 824| | if constexpr (check_quoted_num(Opts)) { 825| | std::memcpy(&b[ix], "\"", 1); 826| | ++ix; 827| | write_chars::op(value, ctx, b, ix); 828| | std::memcpy(&b[ix], "\"", 1); 829| | ++ix; 830| | } 831| 395| else { 832| 395| write_chars::op(value, ctx, b, ix); 833| 395| } 834| 395| } _ZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEES2_RNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_: 2471| 136| { 2472| 136| using ValueType = std::decay_t; 2473| | if constexpr (has_unknown_writer && not check_disable_write_unknown(Options)) { 2474| | constexpr auto& writer = meta_unknown_write_v; 2475| | 2476| | using WriterType = meta_unknown_write_t; 2477| | if constexpr (std::is_member_object_pointer_v) { 2478| | decltype(auto) unknown_writer = value.*writer; 2479| | if (unknown_writer.size() > 0) { 2480| | // TODO: This intermediate is added to get GCC 14 to build 2481| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2482| | serialize::op()>(std::move(merged), ctx, b, ix); 2483| | } 2484| | else { 2485| | serialize::op()>(value, ctx, b, ix); 2486| | } 2487| | } 2488| | else if constexpr (std::is_member_function_pointer_v) { 2489| | decltype(auto) unknown_writer = (value.*writer)(); 2490| | if (unknown_writer.size() > 0) { 2491| | // TODO: This intermediate is added to get GCC 14 to build 2492| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2493| | serialize::op()>(std::move(merged), ctx, b, ix); 2494| | } 2495| | else { 2496| | serialize::op()>(value, ctx, b, ix); 2497| | } 2498| | } 2499| | else { 2500| | static_assert(false_v, "unknown_write type not handled"); 2501| | } 2502| | } 2503| 136| else { 2504| | // handles glaze_object_t without extra unknown fields 2505| 136| static constexpr auto Opts = 2506| 136| disable_write_unknown_off()>()>(); 2507| | 2508| 136| if constexpr (not check_opening_handled(Options)) { 2509| | if constexpr (Options.prettify) { 2510| | ctx.depth += check_indentation_width(Options); 2511| | if constexpr (not check_write_unchecked(Options)) { 2512| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2513| | return; 2514| | } 2515| | } 2516| | std::memcpy(&b[ix], "{\n", 2); 2517| | ix += 2; 2518| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2519| | ix += ctx.depth; 2520| | } 2521| 136| else { 2522| 136| if constexpr (not check_write_unchecked(Options)) { 2523| 136| if (!ensure_space(ctx, b, ix + 1)) [[unlikely]] { ------------------ | Branch (2523:26): [True: 0, False: 136] ------------------ 2524| 0| return; 2525| 0| } 2526| 136| } 2527| 136| dump('{', b, ix); 2528| 136| } 2529| 136| } 2530| | 2531| 0| static constexpr auto N = reflect::size; 2532| | 2533| 136| decltype(auto) t = [&]() -> decltype(auto) { 2534| 136| if constexpr (reflectable) { 2535| 136| return to_tie(value); 2536| 136| } 2537| 136| else { 2538| 136| return nullptr; 2539| 136| } 2540| 136| }(); 2541| | 2542| 136| static constexpr auto padding = round_up_to_nearest_16(maximum_key_size + write_padding_bytes); 2543| | if constexpr (maybe_skipped) { 2544| | bool first = true; 2545| | for_each([&]() { 2546| | using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| | else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| | else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| | if (is_glaze_value_field_null(value, t)) return; 2601| | } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| | else { 2621| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2622| | return; 2623| | } 2624| | } 2625| | 2626| | if (first) { 2627| | first = false; 2628| | } 2629| | else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| | else { 2638| | std::memcpy(&b[ix], ",", 1); 2639| | ++ix; 2640| | } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| | } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| | static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| | static constexpr auto quoted_key = quoted_key_v; 2649| | static constexpr auto n = quoted_key.size(); 2650| | std::memcpy(&b[ix], quoted_key.data(), n); 2651| | ix += n; 2652| | 2653| | static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2654| | if constexpr (reflectable) { 2655| | to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| | } 2662| | }); 2663| | } 2664| 136| else { 2665| 136| static constexpr size_t fixed_max_size = Opts.prettify ? 0 : fixed_padding; ------------------ | Branch (2665:57): [Folded, False: 136] ------------------ 2666| 136| if constexpr (fixed_max_size && not check_write_unchecked(Options)) { 2667| 136| if (!ensure_space(ctx, b, ix + fixed_max_size)) [[unlikely]] { ------------------ | Branch (2667:23): [True: 0, False: 136] ------------------ 2668| 0| return; 2669| 0| } 2670| 136| } 2671| | 2672| 136| for_each([&]() { 2673| 136| if constexpr (write_can_error()) { 2674| 136| if (bool(ctx.error)) [[unlikely]] { 2675| 136| return; 2676| 136| } 2677| 136| } 2678| 136| if constexpr (not fixed_max_size) { 2679| 136| if constexpr (Opts.prettify) { 2680| 136| if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| 136| return; 2682| 136| } 2683| 136| } 2684| 136| else { 2685| 136| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| 136| return; 2687| 136| } 2688| 136| } 2689| 136| } 2690| | 2691| 136| if constexpr (I != 0 && Opts.prettify) { 2692| 136| std::memcpy(&b[ix], ",\n", 2); 2693| 136| ix += 2; 2694| 136| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| 136| ix += ctx.depth; 2696| 136| } 2697| | 2698| 136| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 136| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| 136| if constexpr (always_null_t) { 2703| 136| if constexpr (I == 0 || Opts.prettify) { 2704| 136| static constexpr auto quoted_key = join_v, chars<"null">>; 2705| 136| static constexpr auto n = quoted_key.size(); 2706| 136| std::memcpy(&b[ix], quoted_key.data(), n); 2707| 136| ix += n; 2708| 136| } 2709| 136| else { 2710| 136| static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| 136| static constexpr auto n = quoted_key.size(); 2712| 136| std::memcpy(&b[ix], quoted_key.data(), n); 2713| 136| ix += n; 2714| 136| } 2715| 136| } 2716| 136| else { 2717| 136| if constexpr (I == 0 || Opts.prettify) { 2718| 136| static constexpr auto quoted_key = quoted_key_v; 2719| 136| static constexpr auto n = quoted_key.size(); 2720| 136| std::memcpy(&b[ix], quoted_key.data(), n); 2721| 136| ix += n; 2722| 136| } 2723| 136| else { 2724| 136| static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| 136| static constexpr auto n = quoted_key.size(); 2726| 136| std::memcpy(&b[ix], quoted_key.data(), n); 2727| 136| ix += n; 2728| 136| } 2729| | 2730| 136| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2731| 136| if constexpr (reflectable) { 2732| 136| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| 136| } 2734| 136| else { 2735| 136| to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| 136| ix); 2737| 136| } 2738| 136| } 2739| 136| }); 2740| 136| } 2741| | 2742| | // Options is required here, because it must be the top level 2743| 136| if constexpr (not check_closing_handled(Options)) { 2744| | if constexpr (Options.prettify) { 2745| | ctx.depth -= check_indentation_width(Options); 2746| | if constexpr (not check_write_unchecked(Options)) { 2747| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2748| | return; 2749| | } 2750| | } 2751| | std::memcpy(&b[ix], "\n", 1); 2752| | ++ix; 2753| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2754| | ix += ctx.depth; 2755| | std::memcpy(&b[ix], "}", 1); 2756| | ++ix; 2757| | } 2758| 136| else { 2759| 136| dump || check_write_unchecked(Options))>('}', b, ix); 2760| 136| } 2761| 136| } 2762| 136| } 2763| 136| } _ZZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEES2_RNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlvE_clEv: 2533| 136| decltype(auto) t = [&]() -> decltype(auto) { 2534| 136| if constexpr (reflectable) { 2535| 136| return to_tie(value); 2536| | } 2537| | else { 2538| | return nullptr; 2539| | } 2540| 136| }(); _ZZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEES2_RNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm0EEEDav: 2672| 136| for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| | if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| | else { 2685| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| | return; 2687| | } 2688| | } 2689| | } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| 136| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 136| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| 136| else { 2717| 136| if constexpr (I == 0 || Opts.prettify) { 2718| 136| static constexpr auto quoted_key = quoted_key_v; 2719| 136| static constexpr auto n = quoted_key.size(); 2720| 136| std::memcpy(&b[ix], quoted_key.data(), n); 2721| 136| ix += n; 2722| | } 2723| | else { 2724| | static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| | static constexpr auto n = quoted_key.size(); 2726| | std::memcpy(&b[ix], quoted_key.data(), n); 2727| | ix += n; 2728| | } 2729| | 2730| 136| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2730:57): [True: 0, Folded] ------------------ 2731| 136| if constexpr (reflectable) { 2732| 136| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| 136| } 2739| 136| }); _ZN3glz2toILj10EdE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj128EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERdTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 814| 694| { 815| | if constexpr (not check_write_unchecked(Opts)) { 816| | static_assert(required_padding()); 817| | if (!ensure_space(ctx, b, ix + required_padding())) [[unlikely]] { 818| | return; 819| | } 820| | } 821| | 822| 694| static constexpr auto O = write_unchecked_on(); 823| | 824| | if constexpr (check_quoted_num(Opts)) { 825| | std::memcpy(&b[ix], "\"", 1); 826| | ++ix; 827| | write_chars::op(value, ctx, b, ix); 828| | std::memcpy(&b[ix], "\"", 1); 829| | ++ix; 830| | } 831| 694| else { 832| 694| write_chars::op(value, ctx, b, ix); 833| 694| } 834| 694| } _ZZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEES2_RNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm1EEEDav: 2672| 136| for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| | if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| | else { 2685| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| | return; 2687| | } 2688| | } 2689| | } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| 136| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 136| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| 136| else { 2717| | if constexpr (I == 0 || Opts.prettify) { 2718| | static constexpr auto quoted_key = quoted_key_v; 2719| | static constexpr auto n = quoted_key.size(); 2720| | std::memcpy(&b[ix], quoted_key.data(), n); 2721| | ix += n; 2722| | } 2723| 136| else { 2724| 136| static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| 136| static constexpr auto n = quoted_key.size(); 2726| 136| std::memcpy(&b[ix], quoted_key.data(), n); 2727| 136| ix += n; 2728| 136| } 2729| | 2730| 136| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2730:57): [True: 0, Folded] ------------------ 2731| 136| if constexpr (reflectable) { 2732| 136| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| 136| } 2739| 136| }); _ZN3glz2toILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS7_S7_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 845| 370| { 846| | if constexpr (check_string_as_number(Opts)) { 847| | const sv str = [&]() -> const sv { 848| | if constexpr (array_char_t) { 849| | const auto* start = value.data(); 850| | const auto* end = static_cast(std::memchr(start, '\0', value.size())); 851| | return sv{start, end ? size_t(end - start) : value.size()}; 852| | } 853| | else if constexpr (u8str_t) { 854| | return sv{reinterpret_cast(value.data()), value.size()}; 855| | } 856| | else { 857| | return str_view(value); 858| | } 859| | }(); 860| | if (!ensure_space(ctx, b, ix + str.size() + write_padding_bytes)) [[unlikely]] { 861| | return; 862| | } 863| | dump_maybe_empty(str, b, ix); 864| | } 865| | else if constexpr (char_t) { 866| | if constexpr (check_unquoted(Opts)) { 867| | dump(value, b, ix); 868| | } 869| | else { 870| | // 8 bytes is enough for quotes and escaped character (worst case: \uXXXX = 6 + 2 quotes) 871| | if (!ensure_space(ctx, b, ix + 8)) [[unlikely]] { 872| | return; 873| | } 874| | 875| | std::memcpy(&b[ix], "\"", 1); 876| | ++ix; 877| | if (const auto escaped = char_escape_table[uint8_t(value)]; escaped) { 878| | std::memcpy(&b[ix], &escaped, 2); 879| | ix += 2; 880| | } 881| | else if (value == '\0') { 882| | // null character treated as empty string 883| | } 884| | else if constexpr (check_escape_control_characters(Opts)) { 885| | if (uint8_t(value) < 0x20) { 886| | // Write as \uXXXX format 887| | char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 888| | constexpr char hex_digits[] = "0123456789ABCDEF"; 889| | unicode_escape[4] = hex_digits[(value >> 4) & 0xF]; 890| | unicode_escape[5] = hex_digits[value & 0xF]; 891| | std::memcpy(&b[ix], unicode_escape, 6); 892| | ix += 6; 893| | } 894| | else { 895| | std::memcpy(&b[ix], &value, 1); 896| | ++ix; 897| | } 898| | } 899| | else { 900| | if constexpr (check_reject_control_characters(Opts)) { 901| | if (uint8_t(value) < 0x20) [[unlikely]] { 902| | ctx.error = error_code::invalid_control_character; 903| | } 904| | } 905| | std::memcpy(&b[ix], &value, 1); 906| | ++ix; 907| | } 908| | std::memcpy(&b[ix], "\"", 1); 909| | ++ix; 910| | } 911| | } 912| 370| else { 913| | if constexpr (check_raw_string(Opts)) { 914| | const sv str = [&]() -> const sv { 915| | if constexpr (u8str_t) { 916| | return sv{reinterpret_cast(value.data()), value.size()}; 917| | } 918| | else { 919| | return str_view(value); 920| | } 921| | }(); 922| | 923| | // We need space for quotes and the string length: 2 + n. 924| | // Use +8 for extra buffer 925| | if (!ensure_space(ctx, b, ix + 8 + str.size())) [[unlikely]] { 926| | return; 927| | } 928| | // now we don't have to check writing 929| | 930| | if constexpr (not check_unquoted(Opts)) { 931| | std::memcpy(&b[ix], "\"", 1); 932| | ++ix; 933| | } 934| | if (str.size()) [[likely]] { 935| | const auto n = str.size(); 936| | std::memcpy(&b[ix], str.data(), n); 937| | ix += n; 938| | } 939| | if constexpr (not check_unquoted(Opts)) { 940| | std::memcpy(&b[ix], "\"", 1); 941| | ++ix; 942| | } 943| | } 944| 370| else { 945| 370| const sv str = [&]() -> const sv { 946| 370| if constexpr (array_char_t) { 947| 370| return sv{value.data(), value.size()}; 948| 370| } 949| 370| else if constexpr (u8str_t) { 950| 370| return sv{reinterpret_cast(value.data()), value.size()}; 951| 370| } 952| 370| else { 953| 370| return str_view(value); 954| 370| } 955| 370| }(); 956| 370| const auto n = str.size(); 957| | 958| | // In the case n == 0 we need two characters for quotes. 959| | // For each individual character we need room for two characters to handle escapes. 960| | // When using Unicode escapes, we might need up to 6 characters (\uXXXX) per character 961| | if constexpr (check_escape_control_characters(Opts)) { 962| | if constexpr (has_bounded_capacity) { 963| | // 6 bytes per character is a ceiling only a string of nothing but control 964| | // characters reaches. A resizable buffer merely over-allocates against it, 965| | // but a fixed buffer has nowhere to grow, so the ceiling would reject output 966| | // that fits. Measuring the string answers exactly, at the cost of a pass over 967| | // it, so bracket the measurement between two O(1) bounds and only pay it when 968| | // the answer is still in doubt: the ceiling fitting means yes, and the floor 969| | // of one byte per character not fitting means no. 970| | const size_t capacity = buffer_traits>::capacity(b); 971| | size_t required = ix + 10 + 6 * n; 972| | if (required > capacity) [[unlikely]] { 973| | required = ix + 10 + n; 974| | if (required <= capacity) { 975| | required = ix + 10 + detail::escaped_string_size(str); 976| | } 977| | } 978| | if (!ensure_space(ctx, b, required)) [[unlikely]] { 979| | return; 980| | } 981| | } 982| | // We need 2 + 6 * n characters in the worst case (all control chars) 983| | else if (!ensure_space(ctx, b, ix + 10 + 6 * n)) [[unlikely]] { 984| | return; 985| | } 986| | } 987| 370| else { 988| | // Using the original sizing 989| 370| if (!ensure_space(ctx, b, ix + 10 + 2 * n)) [[unlikely]] { ------------------ | Branch (989:23): [True: 0, False: 370] ------------------ 990| 0| return; 991| 0| } 992| 370| } 993| | // now we don't have to check writing 994| | 995| | if constexpr (check_unquoted(Opts)) { 996| | if (n) { 997| | std::memcpy(&b[ix], str.data(), n); 998| | ix += n; 999| | } 1000| | } 1001| 370| else { 1002| 370| std::memcpy(&b[ix], "\"", 1); 1003| 370| ++ix; 1004| | 1005| 370| const auto* c = str.data(); 1006| 370| const auto* const e = c + n; 1007| 370| const auto start = &b[ix]; 1008| 370| auto data = start; 1009| | 1010| | // By default we don't escape control characters for performance. Invalid JSON characters 1011| | // result in null characters in the output, making the JSON invalid — these would then be 1012| | // detected upon reading. Enable the `escape_control_characters` option to properly escape 1013| | // control characters (0x00–0x1F) as \uXXXX sequences. 1014| | 1015| | // Escape handler: writes the escaped form of *c into data, advances both pointers 1016| 370| auto write_escape = [&]() { 1017| 370| if constexpr (check_escape_control_characters(Opts)) { 1018| 370| if (const auto escaped = char_escape_table[uint8_t(*c)]; escaped) { 1019| 370| std::memcpy(data, &escaped, 2); 1020| 370| data += 2; 1021| 370| } 1022| 370| else { 1023| 370| char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 1024| 370| constexpr char hex_digits[] = "0123456789ABCDEF"; 1025| 370| unicode_escape[4] = hex_digits[(uint8_t(*c) >> 4) & 0xF]; 1026| 370| unicode_escape[5] = hex_digits[uint8_t(*c) & 0xF]; 1027| 370| std::memcpy(data, unicode_escape, 6); 1028| 370| data += 6; 1029| 370| } 1030| 370| } 1031| 370| else { 1032| 370| if constexpr (check_reject_control_characters(Opts)) { 1033| | // A control character with no two-character escape cannot be written 1034| | // without \uXXXX. The table entry is zero, so the memcpy below would 1035| | // put two NULs where one byte was. Flag it and let the loop finish: 1036| | // returning early here would leave c un-advanced and the SIMD scan 1037| | // would find the same byte forever. The output is abandoned anyway. 1038| 370| if (char_escape_table[uint8_t(*c)] == 0) [[unlikely]] { 1039| 370| ctx.error = error_code::invalid_control_character; 1040| 370| } 1041| 370| } 1042| 370| std::memcpy(data, &char_escape_table[uint8_t(*c)], 2); 1043| 370| data += 2; 1044| 370| } 1045| 370| ++c; 1046| 370| }; 1047| | 1048| | // Adding a helper here means adding a branch to string_escape_simd() in 1049| | // simd/backends.hpp, which names the widest one this cascade invokes, and a row 1050| | // to known_builds in tests/json_test/utf8_validation_test.cpp, which checks it. 1051| |#if defined(GLZ_USE_AVX2) 1052| | detail::avx2_string_escape(c, e, data, n, write_escape); 1053| |#endif 1054| 370|#if defined(GLZ_USE_SSE2) 1055| 370| detail::sse2_string_escape(c, e, data, n, write_escape); 1056| |#elif defined(GLZ_USE_NEON) 1057| | detail::neon_string_escape(c, e, data, n, write_escape); 1058| |#endif 1059| | 1060| | // SWAR: 8 bytes at a time 1061| 370| if (n > 7) { ------------------ | Branch (1061:23): [True: 246, False: 124] ------------------ 1062| 540| for (const auto end_m7 = e - 7; c < end_m7;) { ------------------ | Branch (1062:54): [True: 294, False: 246] ------------------ 1063| 294| std::memcpy(data, c, 8); 1064| 294| uint64_t swar; 1065| 294| std::memcpy(&swar, c, 8); 1066| | if constexpr (std::endian::native == std::endian::big) { 1067| | swar = std::byteswap(swar); 1068| | } 1069| | 1070| 294| constexpr uint64_t lo7_mask = repeat_byte8(0b01111111); 1071| 294| const uint64_t lo7 = swar & lo7_mask; 1072| 294| const uint64_t quote = (lo7 ^ repeat_byte8('"')) + lo7_mask; 1073| 294| const uint64_t backslash = (lo7 ^ repeat_byte8('\\')) + lo7_mask; 1074| 294| const uint64_t less_32 = (swar & repeat_byte8(0b01100000)) + lo7_mask; 1075| 294| uint64_t next = ~((quote & backslash & less_32) | swar); 1076| | 1077| 294| next &= repeat_byte8(0b10000000); 1078| 294| if (next == 0) { ------------------ | Branch (1078:29): [True: 112, False: 182] ------------------ 1079| 112| data += 8; 1080| 112| c += 8; 1081| 112| continue; 1082| 112| } 1083| | 1084| 182| const auto length = (countr_zero(next) >> 3); 1085| 182| c += length; 1086| 182| data += length; 1087| 182| write_escape(); 1088| 182| } 1089| 246| } 1090| | 1091| | // Scalar tail 1092| 1.32k| for (; c < e; ++c) { ------------------ | Branch (1092:26): [True: 955, False: 370] ------------------ 1093| 955| if (const auto escaped = char_escape_table[uint8_t(*c)]; escaped) { ------------------ | Branch (1093:79): [True: 100, False: 855] ------------------ 1094| 100| std::memcpy(data, &escaped, 2); 1095| 100| data += 2; 1096| 100| } 1097| | else if constexpr (check_escape_control_characters(Opts)) { 1098| | if (uint8_t(*c) < 0x20) { 1099| | char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 1100| | constexpr char hex_digits[] = "0123456789ABCDEF"; 1101| | unicode_escape[4] = hex_digits[(uint8_t(*c) >> 4) & 0xF]; 1102| | unicode_escape[5] = hex_digits[uint8_t(*c) & 0xF]; 1103| | std::memcpy(data, unicode_escape, 6); 1104| | data += 6; 1105| | } 1106| | else { 1107| | std::memcpy(data, c, 1); 1108| | ++data; 1109| | } 1110| | } 1111| 855| else { 1112| | if constexpr (check_reject_control_characters(Opts)) { 1113| | if (uint8_t(*c) < 0x20) [[unlikely]] { 1114| | ctx.error = error_code::invalid_control_character; 1115| | } 1116| | } 1117| 855| std::memcpy(data, c, 1); 1118| 855| ++data; 1119| 855| } 1120| 955| } 1121| | 1122| 370| ix += size_t(data - start); 1123| | 1124| 370| std::memcpy(&b[ix], "\"", 1); 1125| 370| ++ix; 1126| 370| } 1127| 370| } 1128| 370| } 1129| 370| } _ZZN3glz2toILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS7_S7_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_ENKUlvE_clEv: 945| 370| const sv str = [&]() -> const sv { 946| | if constexpr (array_char_t) { 947| | return sv{value.data(), value.size()}; 948| | } 949| | else if constexpr (u8str_t) { 950| | return sv{reinterpret_cast(value.data()), value.size()}; 951| | } 952| 370| else { 953| 370| return str_view(value); 954| 370| } 955| 370| }(); _ZZN3glz2toILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS7_S7_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_ENKUlvE0_clEv: 1016| 12.6k| auto write_escape = [&]() { 1017| | if constexpr (check_escape_control_characters(Opts)) { 1018| | if (const auto escaped = char_escape_table[uint8_t(*c)]; escaped) { 1019| | std::memcpy(data, &escaped, 2); 1020| | data += 2; 1021| | } 1022| | else { 1023| | char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 1024| | constexpr char hex_digits[] = "0123456789ABCDEF"; 1025| | unicode_escape[4] = hex_digits[(uint8_t(*c) >> 4) & 0xF]; 1026| | unicode_escape[5] = hex_digits[uint8_t(*c) & 0xF]; 1027| | std::memcpy(data, unicode_escape, 6); 1028| | data += 6; 1029| | } 1030| | } 1031| 12.6k| else { 1032| | if constexpr (check_reject_control_characters(Opts)) { 1033| | // A control character with no two-character escape cannot be written 1034| | // without \uXXXX. The table entry is zero, so the memcpy below would 1035| | // put two NULs where one byte was. Flag it and let the loop finish: 1036| | // returning early here would leave c un-advanced and the SIMD scan 1037| | // would find the same byte forever. The output is abandoned anyway. 1038| | if (char_escape_table[uint8_t(*c)] == 0) [[unlikely]] { 1039| | ctx.error = error_code::invalid_control_character; 1040| | } 1041| | } 1042| 12.6k| std::memcpy(data, &char_escape_table[uint8_t(*c)], 2); 1043| 12.6k| data += 2; 1044| 12.6k| } 1045| 12.6k| ++c; 1046| 12.6k| }; _ZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_: 2471| 76| { 2472| 76| using ValueType = std::decay_t; 2473| | if constexpr (has_unknown_writer && not check_disable_write_unknown(Options)) { 2474| | constexpr auto& writer = meta_unknown_write_v; 2475| | 2476| | using WriterType = meta_unknown_write_t; 2477| | if constexpr (std::is_member_object_pointer_v) { 2478| | decltype(auto) unknown_writer = value.*writer; 2479| | if (unknown_writer.size() > 0) { 2480| | // TODO: This intermediate is added to get GCC 14 to build 2481| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2482| | serialize::op()>(std::move(merged), ctx, b, ix); 2483| | } 2484| | else { 2485| | serialize::op()>(value, ctx, b, ix); 2486| | } 2487| | } 2488| | else if constexpr (std::is_member_function_pointer_v) { 2489| | decltype(auto) unknown_writer = (value.*writer)(); 2490| | if (unknown_writer.size() > 0) { 2491| | // TODO: This intermediate is added to get GCC 14 to build 2492| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2493| | serialize::op()>(std::move(merged), ctx, b, ix); 2494| | } 2495| | else { 2496| | serialize::op()>(value, ctx, b, ix); 2497| | } 2498| | } 2499| | else { 2500| | static_assert(false_v, "unknown_write type not handled"); 2501| | } 2502| | } 2503| 76| else { 2504| | // handles glaze_object_t without extra unknown fields 2505| 76| static constexpr auto Opts = 2506| 76| disable_write_unknown_off()>()>(); 2507| | 2508| 76| if constexpr (not check_opening_handled(Options)) { 2509| | if constexpr (Options.prettify) { 2510| | ctx.depth += check_indentation_width(Options); 2511| | if constexpr (not check_write_unchecked(Options)) { 2512| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2513| | return; 2514| | } 2515| | } 2516| | std::memcpy(&b[ix], "{\n", 2); 2517| | ix += 2; 2518| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2519| | ix += ctx.depth; 2520| | } 2521| 76| else { 2522| 76| if constexpr (not check_write_unchecked(Options)) { 2523| 76| if (!ensure_space(ctx, b, ix + 1)) [[unlikely]] { ------------------ | Branch (2523:26): [True: 0, False: 76] ------------------ 2524| 0| return; 2525| 0| } 2526| 76| } 2527| 76| dump('{', b, ix); 2528| 76| } 2529| 76| } 2530| | 2531| 0| static constexpr auto N = reflect::size; 2532| | 2533| 76| decltype(auto) t = [&]() -> decltype(auto) { 2534| 76| if constexpr (reflectable) { 2535| 76| return to_tie(value); 2536| 76| } 2537| 76| else { 2538| 76| return nullptr; 2539| 76| } 2540| 76| }(); 2541| | 2542| 76| static constexpr auto padding = round_up_to_nearest_16(maximum_key_size + write_padding_bytes); 2543| 76| if constexpr (maybe_skipped) { 2544| 76| bool first = true; 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| 76| if constexpr (skipped_on_write) { 2551| 76| return; 2552| 76| } 2553| 76| else { 2554| 76| if constexpr (meta_has_skip_if) { 2555| 76| static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| 76| static constexpr meta_context mctx{.op = operation::serialize}; 2557| 76| decltype(auto) field_value = [&]() -> decltype(auto) { 2558| 76| if constexpr (reflectable) { 2559| 76| return get(t); 2560| 76| } 2561| 76| else { 2562| 76| return get_member(value, glz::get(reflect::values)); 2563| 76| } 2564| 76| }(); 2565| 76| if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| 76| } 2567| | 2568| 76| if constexpr (null_t && Opts.skip_null_members) { 2569| 76| if constexpr (always_null_t) 2570| 76| return; 2571| 76| else { 2572| 76| const auto is_null = [&]() { 2573| 76| decltype(auto) element = [&]() -> decltype(auto) { 2574| 76| if constexpr (reflectable) { 2575| 76| return get(t); 2576| 76| } 2577| 76| else { 2578| 76| return get(reflect::values); 2579| 76| } 2580| 76| }; 2581| | 2582| 76| if constexpr (nullable_wrapper) { 2583| 76| return !bool(element()(value).val); 2584| 76| } 2585| 76| else if constexpr (nullable_value_t) { 2586| 76| return !get_member(value, element()).has_value(); 2587| 76| } 2588| 76| else { 2589| 76| return !bool(get_member(value, element())); 2590| 76| } 2591| 76| }(); 2592| 76| if (is_null) return; 2593| 76| } 2594| 76| } 2595| 76| else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| 76| custom_getter_returns_nullable()) { 2597| 76| if (is_custom_field_null(value, t, ctx)) return; 2598| 76| } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| 76| if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| 76| decltype(auto) member = [&]() -> decltype(auto) { 2605| 76| if constexpr (reflectable) { 2606| 76| return get_member(value, get(t)); 2607| 76| } 2608| 76| else { 2609| 76| return get_member(value, get(reflect::values)); 2610| 76| } 2611| 76| }(); 2612| 76| if (is_default_value(member)) return; 2613| 76| } 2614| | 2615| 76| if constexpr (Opts.prettify) { 2616| 76| if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| 76| return; 2618| 76| } 2619| 76| } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2622| 76| return; 2623| 76| } 2624| 76| } 2625| | 2626| 76| if (first) { 2627| 76| first = false; 2628| 76| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| 76| if constexpr (Opts.prettify) { 2632| 76| std::memcpy(&b[ix], ",\n", 2); 2633| 76| ix += 2; 2634| 76| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| 76| ix += ctx.depth; 2636| 76| } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| 76| if constexpr (is_output_streaming) { 2642| 76| flush_buffer(b, ix); 2643| 76| } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| 76| } 2657| 76| else { 2658| 76| to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| 76| ix); 2660| 76| } 2661| 76| } 2662| 76| }); 2663| | } 2664| | else { 2665| | static constexpr size_t fixed_max_size = Opts.prettify ? 0 : fixed_padding; 2666| | if constexpr (fixed_max_size && not check_write_unchecked(Options)) { 2667| | if (!ensure_space(ctx, b, ix + fixed_max_size)) [[unlikely]] { 2668| | return; 2669| | } 2670| | } 2671| | 2672| | for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| | if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| | else { 2685| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| | return; 2687| | } 2688| | } 2689| | } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| | using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| | static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| | else { 2717| | if constexpr (I == 0 || Opts.prettify) { 2718| | static constexpr auto quoted_key = quoted_key_v; 2719| | static constexpr auto n = quoted_key.size(); 2720| | std::memcpy(&b[ix], quoted_key.data(), n); 2721| | ix += n; 2722| | } 2723| | else { 2724| | static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| | static constexpr auto n = quoted_key.size(); 2726| | std::memcpy(&b[ix], quoted_key.data(), n); 2727| | ix += n; 2728| | } 2729| | 2730| | static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2731| | if constexpr (reflectable) { 2732| | to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| | } 2739| | }); 2740| | } 2741| | 2742| | // Options is required here, because it must be the top level 2743| 76| if constexpr (not check_closing_handled(Options)) { 2744| | if constexpr (Options.prettify) { 2745| | ctx.depth -= check_indentation_width(Options); 2746| | if constexpr (not check_write_unchecked(Options)) { 2747| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2748| | return; 2749| | } 2750| | } 2751| | std::memcpy(&b[ix], "\n", 1); 2752| | ++ix; 2753| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2754| | ix += ctx.depth; 2755| | std::memcpy(&b[ix], "}", 1); 2756| | ++ix; 2757| | } 2758| 76| else { 2759| 76| dump || check_write_unchecked(Options))>('}', b, ix); 2760| 76| } 2761| 76| } 2762| 76| } 2763| 76| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlvE_clEv: 2533| 76| decltype(auto) t = [&]() -> decltype(auto) { 2534| 76| if constexpr (reflectable) { 2535| 76| return to_tie(value); 2536| | } 2537| | else { 2538| | return nullptr; 2539| | } 2540| 76| }(); _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm0EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 76, False: 0] ------------------ 2627| 76| first = false; 2628| 76| } 2629| 0| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 0| else { 2638| 0| std::memcpy(&b[ix], ",", 1); 2639| 0| ++ix; 2640| 0| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 0| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [True: 0, Folded] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm1EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS7_SB_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 845| 882| { 846| | if constexpr (check_string_as_number(Opts)) { 847| | const sv str = [&]() -> const sv { 848| | if constexpr (array_char_t) { 849| | const auto* start = value.data(); 850| | const auto* end = static_cast(std::memchr(start, '\0', value.size())); 851| | return sv{start, end ? size_t(end - start) : value.size()}; 852| | } 853| | else if constexpr (u8str_t) { 854| | return sv{reinterpret_cast(value.data()), value.size()}; 855| | } 856| | else { 857| | return str_view(value); 858| | } 859| | }(); 860| | if (!ensure_space(ctx, b, ix + str.size() + write_padding_bytes)) [[unlikely]] { 861| | return; 862| | } 863| | dump_maybe_empty(str, b, ix); 864| | } 865| | else if constexpr (char_t) { 866| | if constexpr (check_unquoted(Opts)) { 867| | dump(value, b, ix); 868| | } 869| | else { 870| | // 8 bytes is enough for quotes and escaped character (worst case: \uXXXX = 6 + 2 quotes) 871| | if (!ensure_space(ctx, b, ix + 8)) [[unlikely]] { 872| | return; 873| | } 874| | 875| | std::memcpy(&b[ix], "\"", 1); 876| | ++ix; 877| | if (const auto escaped = char_escape_table[uint8_t(value)]; escaped) { 878| | std::memcpy(&b[ix], &escaped, 2); 879| | ix += 2; 880| | } 881| | else if (value == '\0') { 882| | // null character treated as empty string 883| | } 884| | else if constexpr (check_escape_control_characters(Opts)) { 885| | if (uint8_t(value) < 0x20) { 886| | // Write as \uXXXX format 887| | char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 888| | constexpr char hex_digits[] = "0123456789ABCDEF"; 889| | unicode_escape[4] = hex_digits[(value >> 4) & 0xF]; 890| | unicode_escape[5] = hex_digits[value & 0xF]; 891| | std::memcpy(&b[ix], unicode_escape, 6); 892| | ix += 6; 893| | } 894| | else { 895| | std::memcpy(&b[ix], &value, 1); 896| | ++ix; 897| | } 898| | } 899| | else { 900| | if constexpr (check_reject_control_characters(Opts)) { 901| | if (uint8_t(value) < 0x20) [[unlikely]] { 902| | ctx.error = error_code::invalid_control_character; 903| | } 904| | } 905| | std::memcpy(&b[ix], &value, 1); 906| | ++ix; 907| | } 908| | std::memcpy(&b[ix], "\"", 1); 909| | ++ix; 910| | } 911| | } 912| 882| else { 913| | if constexpr (check_raw_string(Opts)) { 914| | const sv str = [&]() -> const sv { 915| | if constexpr (u8str_t) { 916| | return sv{reinterpret_cast(value.data()), value.size()}; 917| | } 918| | else { 919| | return str_view(value); 920| | } 921| | }(); 922| | 923| | // We need space for quotes and the string length: 2 + n. 924| | // Use +8 for extra buffer 925| | if (!ensure_space(ctx, b, ix + 8 + str.size())) [[unlikely]] { 926| | return; 927| | } 928| | // now we don't have to check writing 929| | 930| | if constexpr (not check_unquoted(Opts)) { 931| | std::memcpy(&b[ix], "\"", 1); 932| | ++ix; 933| | } 934| | if (str.size()) [[likely]] { 935| | const auto n = str.size(); 936| | std::memcpy(&b[ix], str.data(), n); 937| | ix += n; 938| | } 939| | if constexpr (not check_unquoted(Opts)) { 940| | std::memcpy(&b[ix], "\"", 1); 941| | ++ix; 942| | } 943| | } 944| 882| else { 945| 882| const sv str = [&]() -> const sv { 946| 882| if constexpr (array_char_t) { 947| 882| return sv{value.data(), value.size()}; 948| 882| } 949| 882| else if constexpr (u8str_t) { 950| 882| return sv{reinterpret_cast(value.data()), value.size()}; 951| 882| } 952| 882| else { 953| 882| return str_view(value); 954| 882| } 955| 882| }(); 956| 882| const auto n = str.size(); 957| | 958| | // In the case n == 0 we need two characters for quotes. 959| | // For each individual character we need room for two characters to handle escapes. 960| | // When using Unicode escapes, we might need up to 6 characters (\uXXXX) per character 961| | if constexpr (check_escape_control_characters(Opts)) { 962| | if constexpr (has_bounded_capacity) { 963| | // 6 bytes per character is a ceiling only a string of nothing but control 964| | // characters reaches. A resizable buffer merely over-allocates against it, 965| | // but a fixed buffer has nowhere to grow, so the ceiling would reject output 966| | // that fits. Measuring the string answers exactly, at the cost of a pass over 967| | // it, so bracket the measurement between two O(1) bounds and only pay it when 968| | // the answer is still in doubt: the ceiling fitting means yes, and the floor 969| | // of one byte per character not fitting means no. 970| | const size_t capacity = buffer_traits>::capacity(b); 971| | size_t required = ix + 10 + 6 * n; 972| | if (required > capacity) [[unlikely]] { 973| | required = ix + 10 + n; 974| | if (required <= capacity) { 975| | required = ix + 10 + detail::escaped_string_size(str); 976| | } 977| | } 978| | if (!ensure_space(ctx, b, required)) [[unlikely]] { 979| | return; 980| | } 981| | } 982| | // We need 2 + 6 * n characters in the worst case (all control chars) 983| | else if (!ensure_space(ctx, b, ix + 10 + 6 * n)) [[unlikely]] { 984| | return; 985| | } 986| | } 987| 882| else { 988| | // Using the original sizing 989| 882| if (!ensure_space(ctx, b, ix + 10 + 2 * n)) [[unlikely]] { ------------------ | Branch (989:23): [True: 0, False: 882] ------------------ 990| 0| return; 991| 0| } 992| 882| } 993| | // now we don't have to check writing 994| | 995| | if constexpr (check_unquoted(Opts)) { 996| | if (n) { 997| | std::memcpy(&b[ix], str.data(), n); 998| | ix += n; 999| | } 1000| | } 1001| 882| else { 1002| 882| std::memcpy(&b[ix], "\"", 1); 1003| 882| ++ix; 1004| | 1005| 882| const auto* c = str.data(); 1006| 882| const auto* const e = c + n; 1007| 882| const auto start = &b[ix]; 1008| 882| auto data = start; 1009| | 1010| | // By default we don't escape control characters for performance. Invalid JSON characters 1011| | // result in null characters in the output, making the JSON invalid — these would then be 1012| | // detected upon reading. Enable the `escape_control_characters` option to properly escape 1013| | // control characters (0x00–0x1F) as \uXXXX sequences. 1014| | 1015| | // Escape handler: writes the escaped form of *c into data, advances both pointers 1016| 882| auto write_escape = [&]() { 1017| 882| if constexpr (check_escape_control_characters(Opts)) { 1018| 882| if (const auto escaped = char_escape_table[uint8_t(*c)]; escaped) { 1019| 882| std::memcpy(data, &escaped, 2); 1020| 882| data += 2; 1021| 882| } 1022| 882| else { 1023| 882| char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 1024| 882| constexpr char hex_digits[] = "0123456789ABCDEF"; 1025| 882| unicode_escape[4] = hex_digits[(uint8_t(*c) >> 4) & 0xF]; 1026| 882| unicode_escape[5] = hex_digits[uint8_t(*c) & 0xF]; 1027| 882| std::memcpy(data, unicode_escape, 6); 1028| 882| data += 6; 1029| 882| } 1030| 882| } 1031| 882| else { 1032| 882| if constexpr (check_reject_control_characters(Opts)) { 1033| | // A control character with no two-character escape cannot be written 1034| | // without \uXXXX. The table entry is zero, so the memcpy below would 1035| | // put two NULs where one byte was. Flag it and let the loop finish: 1036| | // returning early here would leave c un-advanced and the SIMD scan 1037| | // would find the same byte forever. The output is abandoned anyway. 1038| 882| if (char_escape_table[uint8_t(*c)] == 0) [[unlikely]] { 1039| 882| ctx.error = error_code::invalid_control_character; 1040| 882| } 1041| 882| } 1042| 882| std::memcpy(data, &char_escape_table[uint8_t(*c)], 2); 1043| 882| data += 2; 1044| 882| } 1045| 882| ++c; 1046| 882| }; 1047| | 1048| | // Adding a helper here means adding a branch to string_escape_simd() in 1049| | // simd/backends.hpp, which names the widest one this cascade invokes, and a row 1050| | // to known_builds in tests/json_test/utf8_validation_test.cpp, which checks it. 1051| |#if defined(GLZ_USE_AVX2) 1052| | detail::avx2_string_escape(c, e, data, n, write_escape); 1053| |#endif 1054| 882|#if defined(GLZ_USE_SSE2) 1055| 882| detail::sse2_string_escape(c, e, data, n, write_escape); 1056| |#elif defined(GLZ_USE_NEON) 1057| | detail::neon_string_escape(c, e, data, n, write_escape); 1058| |#endif 1059| | 1060| | // SWAR: 8 bytes at a time 1061| 882| if (n > 7) { ------------------ | Branch (1061:23): [True: 283, False: 599] ------------------ 1062| 604| for (const auto end_m7 = e - 7; c < end_m7;) { ------------------ | Branch (1062:54): [True: 321, False: 283] ------------------ 1063| 321| std::memcpy(data, c, 8); 1064| 321| uint64_t swar; 1065| 321| std::memcpy(&swar, c, 8); 1066| | if constexpr (std::endian::native == std::endian::big) { 1067| | swar = std::byteswap(swar); 1068| | } 1069| | 1070| 321| constexpr uint64_t lo7_mask = repeat_byte8(0b01111111); 1071| 321| const uint64_t lo7 = swar & lo7_mask; 1072| 321| const uint64_t quote = (lo7 ^ repeat_byte8('"')) + lo7_mask; 1073| 321| const uint64_t backslash = (lo7 ^ repeat_byte8('\\')) + lo7_mask; 1074| 321| const uint64_t less_32 = (swar & repeat_byte8(0b01100000)) + lo7_mask; 1075| 321| uint64_t next = ~((quote & backslash & less_32) | swar); 1076| | 1077| 321| next &= repeat_byte8(0b10000000); 1078| 321| if (next == 0) { ------------------ | Branch (1078:29): [True: 143, False: 178] ------------------ 1079| 143| data += 8; 1080| 143| c += 8; 1081| 143| continue; 1082| 143| } 1083| | 1084| 178| const auto length = (countr_zero(next) >> 3); 1085| 178| c += length; 1086| 178| data += length; 1087| 178| write_escape(); 1088| 178| } 1089| 283| } 1090| | 1091| | // Scalar tail 1092| 2.16k| for (; c < e; ++c) { ------------------ | Branch (1092:26): [True: 1.28k, False: 882] ------------------ 1093| 1.28k| if (const auto escaped = char_escape_table[uint8_t(*c)]; escaped) { ------------------ | Branch (1093:79): [True: 164, False: 1.12k] ------------------ 1094| 164| std::memcpy(data, &escaped, 2); 1095| 164| data += 2; 1096| 164| } 1097| | else if constexpr (check_escape_control_characters(Opts)) { 1098| | if (uint8_t(*c) < 0x20) { 1099| | char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 1100| | constexpr char hex_digits[] = "0123456789ABCDEF"; 1101| | unicode_escape[4] = hex_digits[(uint8_t(*c) >> 4) & 0xF]; 1102| | unicode_escape[5] = hex_digits[uint8_t(*c) & 0xF]; 1103| | std::memcpy(data, unicode_escape, 6); 1104| | data += 6; 1105| | } 1106| | else { 1107| | std::memcpy(data, c, 1); 1108| | ++data; 1109| | } 1110| | } 1111| 1.12k| else { 1112| | if constexpr (check_reject_control_characters(Opts)) { 1113| | if (uint8_t(*c) < 0x20) [[unlikely]] { 1114| | ctx.error = error_code::invalid_control_character; 1115| | } 1116| | } 1117| 1.12k| std::memcpy(data, c, 1); 1118| 1.12k| ++data; 1119| 1.12k| } 1120| 1.28k| } 1121| | 1122| 882| ix += size_t(data - start); 1123| | 1124| 882| std::memcpy(&b[ix], "\"", 1); 1125| 882| ++ix; 1126| 882| } 1127| 882| } 1128| 882| } 1129| 882| } _ZZN3glz2toILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS7_SB_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_ENKUlvE_clEv: 945| 882| const sv str = [&]() -> const sv { 946| | if constexpr (array_char_t) { 947| | return sv{value.data(), value.size()}; 948| | } 949| | else if constexpr (u8str_t) { 950| | return sv{reinterpret_cast(value.data()), value.size()}; 951| | } 952| 882| else { 953| 882| return str_view(value); 954| 882| } 955| 882| }(); _ZZN3glz2toILj10ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS7_SB_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_ENKUlvE0_clEv: 1016| 9.99k| auto write_escape = [&]() { 1017| | if constexpr (check_escape_control_characters(Opts)) { 1018| | if (const auto escaped = char_escape_table[uint8_t(*c)]; escaped) { 1019| | std::memcpy(data, &escaped, 2); 1020| | data += 2; 1021| | } 1022| | else { 1023| | char unicode_escape[6] = {'\\', 'u', '0', '0', '0', '0'}; 1024| | constexpr char hex_digits[] = "0123456789ABCDEF"; 1025| | unicode_escape[4] = hex_digits[(uint8_t(*c) >> 4) & 0xF]; 1026| | unicode_escape[5] = hex_digits[uint8_t(*c) & 0xF]; 1027| | std::memcpy(data, unicode_escape, 6); 1028| | data += 6; 1029| | } 1030| | } 1031| 9.99k| else { 1032| | if constexpr (check_reject_control_characters(Opts)) { 1033| | // A control character with no two-character escape cannot be written 1034| | // without \uXXXX. The table entry is zero, so the memcpy below would 1035| | // put two NULs where one byte was. Flag it and let the loop finish: 1036| | // returning early here would leave c un-advanced and the SIMD scan 1037| | // would find the same byte forever. The output is abandoned anyway. 1038| | if (char_escape_table[uint8_t(*c)] == 0) [[unlikely]] { 1039| | ctx.error = error_code::invalid_control_character; 1040| | } 1041| | } 1042| 9.99k| std::memcpy(data, &char_escape_table[uint8_t(*c)], 2); 1043| 9.99k| data += 2; 1044| 9.99k| } 1045| 9.99k| ++c; 1046| 9.99k| }; _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm2EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_: 2471| 211| { 2472| 211| using ValueType = std::decay_t; 2473| | if constexpr (has_unknown_writer && not check_disable_write_unknown(Options)) { 2474| | constexpr auto& writer = meta_unknown_write_v; 2475| | 2476| | using WriterType = meta_unknown_write_t; 2477| | if constexpr (std::is_member_object_pointer_v) { 2478| | decltype(auto) unknown_writer = value.*writer; 2479| | if (unknown_writer.size() > 0) { 2480| | // TODO: This intermediate is added to get GCC 14 to build 2481| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2482| | serialize::op()>(std::move(merged), ctx, b, ix); 2483| | } 2484| | else { 2485| | serialize::op()>(value, ctx, b, ix); 2486| | } 2487| | } 2488| | else if constexpr (std::is_member_function_pointer_v) { 2489| | decltype(auto) unknown_writer = (value.*writer)(); 2490| | if (unknown_writer.size() > 0) { 2491| | // TODO: This intermediate is added to get GCC 14 to build 2492| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2493| | serialize::op()>(std::move(merged), ctx, b, ix); 2494| | } 2495| | else { 2496| | serialize::op()>(value, ctx, b, ix); 2497| | } 2498| | } 2499| | else { 2500| | static_assert(false_v, "unknown_write type not handled"); 2501| | } 2502| | } 2503| 211| else { 2504| | // handles glaze_object_t without extra unknown fields 2505| 211| static constexpr auto Opts = 2506| 211| disable_write_unknown_off()>()>(); 2507| | 2508| 211| if constexpr (not check_opening_handled(Options)) { 2509| | if constexpr (Options.prettify) { 2510| | ctx.depth += check_indentation_width(Options); 2511| | if constexpr (not check_write_unchecked(Options)) { 2512| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2513| | return; 2514| | } 2515| | } 2516| | std::memcpy(&b[ix], "{\n", 2); 2517| | ix += 2; 2518| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2519| | ix += ctx.depth; 2520| | } 2521| 211| else { 2522| 211| if constexpr (not check_write_unchecked(Options)) { 2523| 211| if (!ensure_space(ctx, b, ix + 1)) [[unlikely]] { ------------------ | Branch (2523:26): [True: 0, False: 211] ------------------ 2524| 0| return; 2525| 0| } 2526| 211| } 2527| 211| dump('{', b, ix); 2528| 211| } 2529| 211| } 2530| | 2531| 0| static constexpr auto N = reflect::size; 2532| | 2533| 211| decltype(auto) t = [&]() -> decltype(auto) { 2534| 211| if constexpr (reflectable) { 2535| 211| return to_tie(value); 2536| 211| } 2537| 211| else { 2538| 211| return nullptr; 2539| 211| } 2540| 211| }(); 2541| | 2542| 211| static constexpr auto padding = round_up_to_nearest_16(maximum_key_size + write_padding_bytes); 2543| | if constexpr (maybe_skipped) { 2544| | bool first = true; 2545| | for_each([&]() { 2546| | using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| | else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| | else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| | if (is_glaze_value_field_null(value, t)) return; 2601| | } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| | else { 2621| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2622| | return; 2623| | } 2624| | } 2625| | 2626| | if (first) { 2627| | first = false; 2628| | } 2629| | else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| | else { 2638| | std::memcpy(&b[ix], ",", 1); 2639| | ++ix; 2640| | } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| | } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| | static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| | static constexpr auto quoted_key = quoted_key_v; 2649| | static constexpr auto n = quoted_key.size(); 2650| | std::memcpy(&b[ix], quoted_key.data(), n); 2651| | ix += n; 2652| | 2653| | static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2654| | if constexpr (reflectable) { 2655| | to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| | } 2662| | }); 2663| | } 2664| 211| else { 2665| 211| static constexpr size_t fixed_max_size = Opts.prettify ? 0 : fixed_padding; ------------------ | Branch (2665:57): [Folded, False: 211] ------------------ 2666| 211| if constexpr (fixed_max_size && not check_write_unchecked(Options)) { 2667| 211| if (!ensure_space(ctx, b, ix + fixed_max_size)) [[unlikely]] { ------------------ | Branch (2667:23): [True: 0, False: 211] ------------------ 2668| 0| return; 2669| 0| } 2670| 211| } 2671| | 2672| 211| for_each([&]() { 2673| 211| if constexpr (write_can_error()) { 2674| 211| if (bool(ctx.error)) [[unlikely]] { 2675| 211| return; 2676| 211| } 2677| 211| } 2678| 211| if constexpr (not fixed_max_size) { 2679| 211| if constexpr (Opts.prettify) { 2680| 211| if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| 211| return; 2682| 211| } 2683| 211| } 2684| 211| else { 2685| 211| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| 211| return; 2687| 211| } 2688| 211| } 2689| 211| } 2690| | 2691| 211| if constexpr (I != 0 && Opts.prettify) { 2692| 211| std::memcpy(&b[ix], ",\n", 2); 2693| 211| ix += 2; 2694| 211| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| 211| ix += ctx.depth; 2696| 211| } 2697| | 2698| 211| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 211| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| 211| if constexpr (always_null_t) { 2703| 211| if constexpr (I == 0 || Opts.prettify) { 2704| 211| static constexpr auto quoted_key = join_v, chars<"null">>; 2705| 211| static constexpr auto n = quoted_key.size(); 2706| 211| std::memcpy(&b[ix], quoted_key.data(), n); 2707| 211| ix += n; 2708| 211| } 2709| 211| else { 2710| 211| static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| 211| static constexpr auto n = quoted_key.size(); 2712| 211| std::memcpy(&b[ix], quoted_key.data(), n); 2713| 211| ix += n; 2714| 211| } 2715| 211| } 2716| 211| else { 2717| 211| if constexpr (I == 0 || Opts.prettify) { 2718| 211| static constexpr auto quoted_key = quoted_key_v; 2719| 211| static constexpr auto n = quoted_key.size(); 2720| 211| std::memcpy(&b[ix], quoted_key.data(), n); 2721| 211| ix += n; 2722| 211| } 2723| 211| else { 2724| 211| static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| 211| static constexpr auto n = quoted_key.size(); 2726| 211| std::memcpy(&b[ix], quoted_key.data(), n); 2727| 211| ix += n; 2728| 211| } 2729| | 2730| 211| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2731| 211| if constexpr (reflectable) { 2732| 211| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| 211| } 2734| 211| else { 2735| 211| to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| 211| ix); 2737| 211| } 2738| 211| } 2739| 211| }); 2740| 211| } 2741| | 2742| | // Options is required here, because it must be the top level 2743| 211| if constexpr (not check_closing_handled(Options)) { 2744| | if constexpr (Options.prettify) { 2745| | ctx.depth -= check_indentation_width(Options); 2746| | if constexpr (not check_write_unchecked(Options)) { 2747| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2748| | return; 2749| | } 2750| | } 2751| | std::memcpy(&b[ix], "\n", 1); 2752| | ++ix; 2753| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2754| | ix += ctx.depth; 2755| | std::memcpy(&b[ix], "}", 1); 2756| | ++ix; 2757| | } 2758| 211| else { 2759| 211| dump || check_write_unchecked(Options))>('}', b, ix); 2760| 211| } 2761| 211| } 2762| 211| } 2763| 211| } _ZZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlvE_clEv: 2533| 211| decltype(auto) t = [&]() -> decltype(auto) { 2534| 211| if constexpr (reflectable) { 2535| 211| return to_tie(value); 2536| | } 2537| | else { 2538| | return nullptr; 2539| | } 2540| 211| }(); _ZZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm0EEEDav: 2672| 211| for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| | if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| | else { 2685| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| | return; 2687| | } 2688| | } 2689| | } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| 211| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 211| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| 211| else { 2717| 211| if constexpr (I == 0 || Opts.prettify) { 2718| 211| static constexpr auto quoted_key = quoted_key_v; 2719| 211| static constexpr auto n = quoted_key.size(); 2720| 211| std::memcpy(&b[ix], quoted_key.data(), n); 2721| 211| ix += n; 2722| | } 2723| | else { 2724| | static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| | static constexpr auto n = quoted_key.size(); 2726| | std::memcpy(&b[ix], quoted_key.data(), n); 2727| | ix += n; 2728| | } 2729| | 2730| 211| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2730:57): [True: 0, Folded] ------------------ 2731| 211| if constexpr (reflectable) { 2732| 211| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| 211| } 2739| 211| }); _ZZN3glz2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm1EEEDav: 2672| 211| for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| | if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| | else { 2685| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| | return; 2687| | } 2688| | } 2689| | } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| 211| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 211| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| 211| else { 2717| | if constexpr (I == 0 || Opts.prettify) { 2718| | static constexpr auto quoted_key = quoted_key_v; 2719| | static constexpr auto n = quoted_key.size(); 2720| | std::memcpy(&b[ix], quoted_key.data(), n); 2721| | ix += n; 2722| | } 2723| 211| else { 2724| 211| static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| 211| static constexpr auto n = quoted_key.size(); 2726| 211| std::memcpy(&b[ix], quoted_key.data(), n); 2727| 211| ix += n; 2728| 211| } 2729| | 2730| 211| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2730:57): [True: 0, Folded] ------------------ 2731| 211| if constexpr (reflectable) { 2732| 211| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| 211| } 2739| 211| }); _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm3EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_: 2471| 150| { 2472| 150| using ValueType = std::decay_t; 2473| | if constexpr (has_unknown_writer && not check_disable_write_unknown(Options)) { 2474| | constexpr auto& writer = meta_unknown_write_v; 2475| | 2476| | using WriterType = meta_unknown_write_t; 2477| | if constexpr (std::is_member_object_pointer_v) { 2478| | decltype(auto) unknown_writer = value.*writer; 2479| | if (unknown_writer.size() > 0) { 2480| | // TODO: This intermediate is added to get GCC 14 to build 2481| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2482| | serialize::op()>(std::move(merged), ctx, b, ix); 2483| | } 2484| | else { 2485| | serialize::op()>(value, ctx, b, ix); 2486| | } 2487| | } 2488| | else if constexpr (std::is_member_function_pointer_v) { 2489| | decltype(auto) unknown_writer = (value.*writer)(); 2490| | if (unknown_writer.size() > 0) { 2491| | // TODO: This intermediate is added to get GCC 14 to build 2492| | decltype(auto) merged = glz::merge{value, unknown_writer}; 2493| | serialize::op()>(std::move(merged), ctx, b, ix); 2494| | } 2495| | else { 2496| | serialize::op()>(value, ctx, b, ix); 2497| | } 2498| | } 2499| | else { 2500| | static_assert(false_v, "unknown_write type not handled"); 2501| | } 2502| | } 2503| 150| else { 2504| | // handles glaze_object_t without extra unknown fields 2505| 150| static constexpr auto Opts = 2506| 150| disable_write_unknown_off()>()>(); 2507| | 2508| 150| if constexpr (not check_opening_handled(Options)) { 2509| | if constexpr (Options.prettify) { 2510| | ctx.depth += check_indentation_width(Options); 2511| | if constexpr (not check_write_unchecked(Options)) { 2512| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2513| | return; 2514| | } 2515| | } 2516| | std::memcpy(&b[ix], "{\n", 2); 2517| | ix += 2; 2518| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2519| | ix += ctx.depth; 2520| | } 2521| 150| else { 2522| 150| if constexpr (not check_write_unchecked(Options)) { 2523| 150| if (!ensure_space(ctx, b, ix + 1)) [[unlikely]] { ------------------ | Branch (2523:26): [True: 0, False: 150] ------------------ 2524| 0| return; 2525| 0| } 2526| 150| } 2527| 150| dump('{', b, ix); 2528| 150| } 2529| 150| } 2530| | 2531| 0| static constexpr auto N = reflect::size; 2532| | 2533| 150| decltype(auto) t = [&]() -> decltype(auto) { 2534| 150| if constexpr (reflectable) { 2535| 150| return to_tie(value); 2536| 150| } 2537| 150| else { 2538| 150| return nullptr; 2539| 150| } 2540| 150| }(); 2541| | 2542| 150| static constexpr auto padding = round_up_to_nearest_16(maximum_key_size + write_padding_bytes); 2543| | if constexpr (maybe_skipped) { 2544| | bool first = true; 2545| | for_each([&]() { 2546| | using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| | else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| | else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| | if (is_glaze_value_field_null(value, t)) return; 2601| | } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| | else { 2621| | if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2622| | return; 2623| | } 2624| | } 2625| | 2626| | if (first) { 2627| | first = false; 2628| | } 2629| | else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| | else { 2638| | std::memcpy(&b[ix], ",", 1); 2639| | ++ix; 2640| | } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| | } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| | static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| | static constexpr auto quoted_key = quoted_key_v; 2649| | static constexpr auto n = quoted_key.size(); 2650| | std::memcpy(&b[ix], quoted_key.data(), n); 2651| | ix += n; 2652| | 2653| | static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2654| | if constexpr (reflectable) { 2655| | to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| | } 2662| | }); 2663| | } 2664| 150| else { 2665| 150| static constexpr size_t fixed_max_size = Opts.prettify ? 0 : fixed_padding; ------------------ | Branch (2665:57): [Folded, False: 150] ------------------ 2666| | if constexpr (fixed_max_size && not check_write_unchecked(Options)) { 2667| | if (!ensure_space(ctx, b, ix + fixed_max_size)) [[unlikely]] { 2668| | return; 2669| | } 2670| | } 2671| | 2672| 150| for_each([&]() { 2673| 150| if constexpr (write_can_error()) { 2674| 150| if (bool(ctx.error)) [[unlikely]] { 2675| 150| return; 2676| 150| } 2677| 150| } 2678| 150| if constexpr (not fixed_max_size) { 2679| 150| if constexpr (Opts.prettify) { 2680| 150| if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| 150| return; 2682| 150| } 2683| 150| } 2684| 150| else { 2685| 150| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { 2686| 150| return; 2687| 150| } 2688| 150| } 2689| 150| } 2690| | 2691| 150| if constexpr (I != 0 && Opts.prettify) { 2692| 150| std::memcpy(&b[ix], ",\n", 2); 2693| 150| ix += 2; 2694| 150| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| 150| ix += ctx.depth; 2696| 150| } 2697| | 2698| 150| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 150| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| 150| if constexpr (always_null_t) { 2703| 150| if constexpr (I == 0 || Opts.prettify) { 2704| 150| static constexpr auto quoted_key = join_v, chars<"null">>; 2705| 150| static constexpr auto n = quoted_key.size(); 2706| 150| std::memcpy(&b[ix], quoted_key.data(), n); 2707| 150| ix += n; 2708| 150| } 2709| 150| else { 2710| 150| static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| 150| static constexpr auto n = quoted_key.size(); 2712| 150| std::memcpy(&b[ix], quoted_key.data(), n); 2713| 150| ix += n; 2714| 150| } 2715| 150| } 2716| 150| else { 2717| 150| if constexpr (I == 0 || Opts.prettify) { 2718| 150| static constexpr auto quoted_key = quoted_key_v; 2719| 150| static constexpr auto n = quoted_key.size(); 2720| 150| std::memcpy(&b[ix], quoted_key.data(), n); 2721| 150| ix += n; 2722| 150| } 2723| 150| else { 2724| 150| static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| 150| static constexpr auto n = quoted_key.size(); 2726| 150| std::memcpy(&b[ix], quoted_key.data(), n); 2727| 150| ix += n; 2728| 150| } 2729| | 2730| 150| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; 2731| 150| if constexpr (reflectable) { 2732| 150| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| 150| } 2734| 150| else { 2735| 150| to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| 150| ix); 2737| 150| } 2738| 150| } 2739| 150| }); 2740| 150| } 2741| | 2742| | // Options is required here, because it must be the top level 2743| 150| if constexpr (not check_closing_handled(Options)) { 2744| | if constexpr (Options.prettify) { 2745| | ctx.depth -= check_indentation_width(Options); 2746| | if constexpr (not check_write_unchecked(Options)) { 2747| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2748| | return; 2749| | } 2750| | } 2751| | std::memcpy(&b[ix], "\n", 1); 2752| | ++ix; 2753| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2754| | ix += ctx.depth; 2755| | std::memcpy(&b[ix], "}", 1); 2756| | ++ix; 2757| | } 2758| 150| else { 2759| 150| dump || check_write_unchecked(Options))>('}', b, ix); 2760| 150| } 2761| 150| } 2762| 150| } 2763| 150| } _ZZN3glz2toILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlvE_clEv: 2533| 150| decltype(auto) t = [&]() -> decltype(auto) { 2534| 150| if constexpr (reflectable) { 2535| 150| return to_tie(value); 2536| | } 2537| | else { 2538| | return nullptr; 2539| | } 2540| 150| }(); _ZZN3glz2toILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm0EEEDav: 2672| 150| for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| 150| if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| 150| else { 2685| 150| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2685:29): [True: 0, False: 150] ------------------ 2686| 0| return; 2687| 0| } 2688| 150| } 2689| 150| } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| 150| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 150| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| 150| else { 2717| 150| if constexpr (I == 0 || Opts.prettify) { 2718| 150| static constexpr auto quoted_key = quoted_key_v; 2719| 150| static constexpr auto n = quoted_key.size(); 2720| 150| std::memcpy(&b[ix], quoted_key.data(), n); 2721| 150| ix += n; 2722| | } 2723| | else { 2724| | static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| | static constexpr auto n = quoted_key.size(); 2726| | std::memcpy(&b[ix], quoted_key.data(), n); 2727| | ix += n; 2728| | } 2729| | 2730| 150| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2730:57): [True: 0, Folded] ------------------ 2731| 150| if constexpr (reflectable) { 2732| 150| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| 150| } 2739| 150| }); _ZZN3glz2toILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm1EEEDav: 2672| 150| for_each([&]() { 2673| | if constexpr (write_can_error()) { 2674| | if (bool(ctx.error)) [[unlikely]] { 2675| | return; 2676| | } 2677| | } 2678| 150| if constexpr (not fixed_max_size) { 2679| | if constexpr (Opts.prettify) { 2680| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2681| | return; 2682| | } 2683| | } 2684| 150| else { 2685| 150| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2685:29): [True: 0, False: 150] ------------------ 2686| 0| return; 2687| 0| } 2688| 150| } 2689| 150| } 2690| | 2691| | if constexpr (I != 0 && Opts.prettify) { 2692| | std::memcpy(&b[ix], ",\n", 2); 2693| | ix += 2; 2694| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2695| | ix += ctx.depth; 2696| | } 2697| | 2698| 150| using val_t = field_t; 2699| | 2700| | // MSVC requires get rather than keys[I] 2701| 150| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2702| | if constexpr (always_null_t) { 2703| | if constexpr (I == 0 || Opts.prettify) { 2704| | static constexpr auto quoted_key = join_v, chars<"null">>; 2705| | static constexpr auto n = quoted_key.size(); 2706| | std::memcpy(&b[ix], quoted_key.data(), n); 2707| | ix += n; 2708| | } 2709| | else { 2710| | static constexpr auto quoted_key = join_v, quoted_key_v, chars<"null">>; 2711| | static constexpr auto n = quoted_key.size(); 2712| | std::memcpy(&b[ix], quoted_key.data(), n); 2713| | ix += n; 2714| | } 2715| | } 2716| 150| else { 2717| | if constexpr (I == 0 || Opts.prettify) { 2718| | static constexpr auto quoted_key = quoted_key_v; 2719| | static constexpr auto n = quoted_key.size(); 2720| | std::memcpy(&b[ix], quoted_key.data(), n); 2721| | ix += n; 2722| | } 2723| 150| else { 2724| 150| static constexpr auto quoted_key = join_v, quoted_key_v>; 2725| 150| static constexpr auto n = quoted_key.size(); 2726| 150| std::memcpy(&b[ix], quoted_key.data(), n); 2727| 150| ix += n; 2728| 150| } 2729| | 2730| 150| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2730:57): [Folded, False: 150] ------------------ 2731| 150| if constexpr (reflectable) { 2732| 150| to::template op(get_member(value, get(t)), ctx, b, ix); 2733| | } 2734| | else { 2735| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2736| | ix); 2737| | } 2738| 150| } 2739| 150| }); _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm4EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__16vectorIiNS1_9allocatorIiEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNS1_12basic_stringIcNS1_11char_traitsIcEENS3_IcEEEERS5_TkNS_10is_contextERNS_7contextEmQaa16writable_array_tIT_EquL_ZNS0_ILj10ESI_E14map_like_arrayEEeqcl17check_concatenateTL0__ELb0ELb1EEEvOT1_OT2_OT0_RT3_: 1435| 150| { 1436| 150| if (empty_range(value)) { ------------------ | Branch (1436:14): [True: 150, False: 0] ------------------ 1437| 150| dump("[]", b, ix); 1438| 150| } 1439| 0| else { 1440| | // For bounded buffers, skip pre-allocation path since value_padding is for SIMD, not actual size 1441| 0| if constexpr (has_size && array_padding_known && !has_bounded_capacity) { 1442| 0| const auto n = value.size(); 1443| | 1444| 0| static constexpr auto value_padding = []() -> size_t { 1445| 0| if constexpr (required_padding() > 0) 1446| 0| return required_padding(); 1447| 0| else 1448| 0| return fixed_padding; 1449| 0| }(); 1450| | 1451| | if constexpr (Opts.prettify) { 1452| | if constexpr (check_new_lines_in_arrays(Opts)) { 1453| | ctx.depth += check_indentation_width(Opts); 1454| | } 1455| | 1456| | // add space for '\n' and ',' characters for each element, hence `+ 2` 1457| | // use n + 1 because we put the end array character after the last element with whitespace 1458| | if (!ensure_space(ctx, b, ix + (n + 1) * (value_padding + ctx.depth + 2) + write_padding_bytes)) 1459| | [[unlikely]] { 1460| | return; 1461| | } 1462| | 1463| | if constexpr (check_new_lines_in_arrays(Opts)) { 1464| | std::memcpy(&b[ix], "[\n", 2); 1465| | ix += 2; 1466| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1467| | ix += ctx.depth; 1468| | } 1469| | else { 1470| | std::memcpy(&b[ix], "[", 1); 1471| | ++ix; 1472| | } 1473| | } 1474| 0| else { 1475| 0| static constexpr auto comma_padding = 1; 1476| 0| if (!ensure_space(ctx, b, ix + n * (value_padding + comma_padding) + write_padding_bytes)) ------------------ | Branch (1476:23): [True: 0, False: 0] ------------------ 1477| 0| [[unlikely]] { 1478| 0| return; 1479| 0| } 1480| 0| std::memcpy(&b[ix], "[", 1); 1481| 0| ++ix; 1482| 0| } 1483| | 1484| 0| auto it = std::begin(value); 1485| 0| using val_t = std::remove_cvref_t; 1486| 0| to::template op()>(*it, ctx, b, ix); 1487| | 1488| 0| ++it; 1489| 0| for (const auto fin = std::end(value); it != fin; ++it) { ------------------ | Branch (1489:55): [True: 0, False: 0] ------------------ 1490| | if constexpr (Opts.prettify) { 1491| | if constexpr (check_new_lines_in_arrays(Opts)) { 1492| | std::memcpy(&b[ix], ",\n", 2); 1493| | ix += 2; 1494| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1495| | ix += ctx.depth; 1496| | } 1497| | else { 1498| | std::memcpy(&b[ix], ", ", 2); 1499| | ix += 2; 1500| | } 1501| | } 1502| 0| else { 1503| 0| std::memcpy(&b[ix], ",", 1); 1504| 0| ++ix; 1505| 0| } 1506| | if constexpr (is_output_streaming) { 1507| | flush_buffer(b, ix); 1508| | } 1509| | 1510| 0| to::template op()>(*it, ctx, b, ix); 1511| 0| } 1512| | if constexpr (Opts.prettify && check_new_lines_in_arrays(Opts)) { 1513| | ctx.depth -= check_indentation_width(Opts); 1514| | std::memcpy(&b[ix], "\n", 1); 1515| | ++ix; 1516| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1517| | ix += ctx.depth; 1518| | } 1519| | 1520| 0| std::memcpy(&b[ix], "]", 1); 1521| 0| ++ix; 1522| | } 1523| | else { 1524| | // we either can't get the size (std::forward_list) or we cannot compute the allocation size 1525| | 1526| | if constexpr (Opts.prettify) { 1527| | if constexpr (check_new_lines_in_arrays(Opts)) { 1528| | ctx.depth += check_indentation_width(Opts); 1529| | } 1530| | 1531| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 1532| | return; 1533| | } 1534| | 1535| | if constexpr (check_new_lines_in_arrays(Opts)) { 1536| | std::memcpy(&b[ix], "[\n", 2); 1537| | ix += 2; 1538| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1539| | ix += ctx.depth; 1540| | } 1541| | else { 1542| | std::memcpy(&b[ix], "[", 1); 1543| | ++ix; 1544| | } 1545| | } 1546| | else { 1547| | if (!ensure_space(ctx, b, ix + write_padding_bytes)) [[unlikely]] { 1548| | return; 1549| | } 1550| | std::memcpy(&b[ix], "[", 1); 1551| | ++ix; 1552| | } 1553| | 1554| | auto it = std::begin(value); 1555| | using val_t = std::remove_cvref_t; 1556| | if constexpr (required_padding()) { 1557| | to::template op()>(*it, ctx, b, ix); 1558| | } 1559| | else { 1560| | to::template op(*it, ctx, b, ix); 1561| | if (bool(ctx.error)) [[unlikely]] { 1562| | return; 1563| | } 1564| | } 1565| | 1566| | ++it; 1567| | for (const auto fin = std::end(value); it != fin; ++it) { 1568| | if constexpr (required_padding()) { 1569| | if constexpr (Opts.prettify) { 1570| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 1571| | return; 1572| | } 1573| | } 1574| | else { 1575| | if (!ensure_space(ctx, b, ix + write_padding_bytes)) [[unlikely]] { 1576| | return; 1577| | } 1578| | } 1579| | 1580| | if constexpr (Opts.prettify) { 1581| | if constexpr (check_new_lines_in_arrays(Opts)) { 1582| | std::memcpy(&b[ix], ",\n", 2); 1583| | ix += 2; 1584| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1585| | ix += ctx.depth; 1586| | } 1587| | else { 1588| | std::memcpy(&b[ix], ", ", 2); 1589| | ix += 2; 1590| | } 1591| | } 1592| | else { 1593| | std::memcpy(&b[ix], ",", 1); 1594| | ++ix; 1595| | } 1596| | if constexpr (is_output_streaming) { 1597| | flush_buffer(b, ix); 1598| | } 1599| | 1600| | to::template op()>(*it, ctx, b, ix); 1601| | } 1602| | else { 1603| | write_array_entry_separator(ctx, b, ix); 1604| | to::template op(*it, ctx, b, ix); 1605| | if (bool(ctx.error)) [[unlikely]] { 1606| | return; 1607| | } 1608| | } 1609| | } 1610| | if constexpr (Opts.prettify && check_new_lines_in_arrays(Opts)) { 1611| | ctx.depth -= check_indentation_width(Opts); 1612| | dump_newline_indent(check_indentation_char(Opts), ctx.depth, b, ix); 1613| | } 1614| | 1615| | dump(']', b, ix); 1616| | } 1617| 0| } 1618| 150| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm5EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__13mapINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEiNS1_4lessIS8_EENS6_INS1_4pairIKS8_iEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS8_RSF_TkNS_10is_contextERNS_7contextEmQoo14writable_map_tIT_EaaL_ZNS0_ILj10ESN_E14map_like_arrayEEeqcl17check_concatenateTL0__ELb1EEEvOT1_OT2_OT0_RT3_: 1623| 150| { 1624| 150| if constexpr (not check_opening_handled(Opts)) { 1625| 150| dump('{', b, ix); 1626| 150| } 1627| | 1628| 150| if (!empty_range(value)) { ------------------ | Branch (1628:14): [True: 0, False: 150] ------------------ 1629| 0| if constexpr (!check_opening_handled(Opts)) { 1630| | if constexpr (Opts.prettify) { 1631| | ctx.depth += check_indentation_width(Opts); 1632| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 1633| | return; 1634| | } 1635| | std::memcpy(&b[ix], "\n", 1); 1636| | ++ix; 1637| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1638| | ix += ctx.depth; 1639| | } 1640| 0| } 1641| | 1642| 0| using val_t = detail::iterator_second_type; // the type of value in each [key, value] pair 1643| 0| if constexpr (!never_written) { 1644| | if constexpr (null_t && Opts.skip_null_members) { 1645| | auto write_first_entry = [&](auto&& it) { 1646| | auto&& [key, entry_val] = *it; 1647| | if (skip_member(entry_val)) { 1648| | return true; 1649| | } 1650| | write_pair_content(key, entry_val, ctx, b, ix); 1651| | return bool(ctx.error); 1652| | }; 1653| | 1654| | auto it = std::begin(value); 1655| | bool first = write_first_entry(it); 1656| | if (bool(ctx.error)) [[unlikely]] { 1657| | return; 1658| | } 1659| | ++it; 1660| | for (const auto end = std::end(value); it != end; ++it) { 1661| | auto&& [key, entry_val] = *it; 1662| | if (skip_member(entry_val)) { 1663| | continue; 1664| | } 1665| | 1666| | // When Opts.skip_null_members, *any* entry may be skipped, meaning separator dumping must be 1667| | // conditional for every entry. 1668| | // Alternatively, write separator after each entry except last but then branch is permanent 1669| | if (not first) { 1670| | write_object_entry_separator(ctx, b, ix); 1671| | } 1672| | 1673| | write_pair_content(key, entry_val, ctx, b, ix); 1674| | if (bool(ctx.error)) [[unlikely]] { 1675| | return; 1676| | } 1677| | 1678| | first = false; 1679| | } 1680| | } 1681| 0| else { 1682| 0| auto write_first_entry = [&](auto&& it) { 1683| 0| auto&& [key, entry_val] = *it; 1684| 0| write_pair_content(key, entry_val, ctx, b, ix); 1685| 0| }; 1686| | 1687| 0| auto it = std::begin(value); 1688| 0| write_first_entry(it); 1689| 0| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (1689:23): [True: 0, False: 0] ------------------ 1690| 0| return; 1691| 0| } 1692| 0| ++it; 1693| 0| for (const auto end = std::end(value); it != end; ++it) { ------------------ | Branch (1693:58): [True: 0, False: 0] ------------------ 1694| 0| auto&& [key, entry_val] = *it; 1695| 0| write_object_entry_separator(ctx, b, ix); 1696| 0| write_pair_content(key, entry_val, ctx, b, ix); 1697| 0| if (bool(ctx.error)) [[unlikely]] { ------------------ | Branch (1697:26): [True: 0, False: 0] ------------------ 1698| 0| return; 1699| 0| } 1700| 0| } 1701| 0| } 1702| 0| } 1703| | 1704| 0| if constexpr (!check_closing_handled(Opts)) { 1705| | if constexpr (Opts.prettify) { 1706| | ctx.depth -= check_indentation_width(Opts); 1707| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 1708| | return; 1709| | } 1710| | std::memcpy(&b[ix], "\n", 1); 1711| | ++ix; 1712| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 1713| | ix += ctx.depth; 1714| | } 1715| 0| } 1716| 0| } 1717| | 1718| 150| if constexpr (!check_closing_handled(Opts)) { 1719| 150| dump('}', b, ix); 1720| 150| } 1721| 150| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm6EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| 76| if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| 76| else { 2572| 76| const auto is_null = [&]() { 2573| 76| decltype(auto) element = [&]() -> decltype(auto) { 2574| 76| if constexpr (reflectable) { 2575| 76| return get(t); 2576| 76| } 2577| 76| else { 2578| 76| return get(reflect::values); 2579| 76| } 2580| 76| }; 2581| | 2582| 76| if constexpr (nullable_wrapper) { 2583| 76| return !bool(element()(value).val); 2584| 76| } 2585| 76| else if constexpr (nullable_value_t) { 2586| 76| return !get_member(value, element()).has_value(); 2587| 76| } 2588| 76| else { 2589| 76| return !bool(get_member(value, element())); 2590| 76| } 2591| 76| }(); 2592| 76| if (is_null) return; ------------------ | Branch (2592:32): [True: 76, False: 0] ------------------ 2593| 76| } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| | else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| | if (is_glaze_value_field_null(value, t)) return; 2601| | } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [True: 0, Folded] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm6EEEDavENKUlvE_clEv: 2572| 76| const auto is_null = [&]() { 2573| 76| decltype(auto) element = [&]() -> decltype(auto) { 2574| 76| if constexpr (reflectable) { 2575| 76| return get(t); 2576| 76| } 2577| 76| else { 2578| 76| return get(reflect::values); 2579| 76| } 2580| 76| }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| 76| else if constexpr (nullable_value_t) { 2586| 76| return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| 76| }(); _ZZZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm6EEEDavENKUlvE_clEvENKUlvE_clEv: 2573| 76| decltype(auto) element = [&]() -> decltype(auto) { 2574| 76| if constexpr (reflectable) { 2575| 76| return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| 76| }; _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm7EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS8_RSB_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1955| 150| { 1956| | // Adjacent tagging needs no per-alternative dispatch: the discriminator and the value are 1957| | // written side by side whatever the alternative is. The visit below still instantiates in 1958| | // that mode (`if constexpr` does not discard the statements after it), but both of its 1959| | // tagged branches are compile-time dead there and the runtime `return` keeps it unreached. 1960| | if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::adjacent) { 1961| | write_adjacent(value, ctx, b, ix); 1962| | return; 1963| | } 1964| 150| std::visit( 1965| 150| [&](auto&& val) { 1966| 150| using V = std::decay_t; 1967| | 1968| 150| if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::internal && 1969| 150| custom_write) { 1970| | // Custom alternative: the user's serializer emits the object body, into which we 1971| | // merge the variant tag. For this to produce valid JSON the custom to<> must (1) 1972| | // write an object body and (2) honor opening_and_closing_handled (suppress its own 1973| | // braces) so the tag shares the alternative's object. A custom writer that emits a 1974| | // scalar/array, or that ignores those flags, would yield malformed output. 1975| | // 1976| | // The tag-emission below mirrors the reflected-object branch that follows; keep the 1977| | // two in sync. The body size is not known at compile time, so we always write the 1978| | // tag separator and then drop it at runtime if the body turned out empty. 1979| 150| if (missing_id(value, ctx)) { 1980| 150| return; 1981| 150| } 1982| 150| using id_type = std::decay_t[value.index()])>; 1983| 150| if constexpr (Opts.prettify) { 1984| 150| dump("{\n", b, ix); 1985| 150| ctx.depth += check_indentation_width(Opts); 1986| 150| dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 1987| 150| dump('"', b, ix); 1988| 150| dump_maybe_empty(tag_v, b, ix); 1989| 150| if constexpr (std::integral) { 1990| 150| dump("\": ", b, ix); 1991| 150| serialize::op(ids_v[value.index()], ctx, b, ix); 1992| 150| } 1993| 150| else { 1994| 150| dump("\": \"", b, ix); 1995| 150| dump_maybe_empty(ids_v[value.index()], b, ix); 1996| 150| dump('"', b, ix); 1997| 150| } 1998| 150| const auto pos_after_tag = ix; 1999| 150| dump(",\n", b, ix); 2000| 150| dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2001| 150| const auto pos_body_start = ix; 2002| 150| to::template op()>(val, ctx, b, ix); 2003| 150| if (ix == pos_body_start) { 2004| 150| ix = pos_after_tag; // custom body was empty: undo the tag separator 2005| 150| } 2006| 150| ctx.depth -= check_indentation_width(Opts); 2007| 150| if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2008| 150| return; 2009| 150| } 2010| 150| std::memcpy(&b[ix], "\n", 1); 2011| 150| ++ix; 2012| 150| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2013| 150| ix += ctx.depth; 2014| 150| std::memcpy(&b[ix], "}", 1); 2015| 150| ++ix; 2016| 150| } 2017| 150| else { 2018| 150| dump("{\"", b, ix); 2019| 150| dump_maybe_empty(tag_v, b, ix); 2020| 150| if constexpr (std::integral) { 2021| 150| dump("\":", b, ix); 2022| 150| serialize::op(ids_v[value.index()], ctx, b, ix); 2023| 150| } 2024| 150| else { 2025| 150| dump("\":\"", b, ix); 2026| 150| dump_maybe_empty(ids_v[value.index()], b, ix); 2027| 150| dump('"', b, ix); 2028| 150| } 2029| 150| const auto pos_after_tag = ix; 2030| 150| dump(',', b, ix); 2031| 150| const auto pos_body_start = ix; 2032| 150| to::template op()>(val, ctx, b, ix); 2033| 150| if (ix == pos_body_start) { 2034| 150| ix = pos_after_tag; // custom body was empty: undo the tag separator 2035| 150| } 2036| 150| dump('}', b, ix); 2037| 150| } 2038| 150| } 2039| 150| else if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::internal && 2040| 150| variant_unit_alternative) { 2041| | // A unit alternative carries no data, so internal tagging renders it as the 2042| | // discriminator alone -- the same object an empty struct alternative produces. 2043| 150| if (missing_id(value, ctx)) { 2044| 150| return; 2045| 150| } 2046| 150| if constexpr (Opts.prettify) { 2047| 150| dump("{\n", b, ix); 2048| 150| ctx.depth += check_indentation_width(Opts); 2049| 150| dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2050| 150| dump('"', b, ix); 2051| 150| dump_maybe_empty(tag_v, b, ix); 2052| 150| dump("\": ", b, ix); 2053| 150| write_id(value, ctx, b, ix); 2054| 150| ctx.depth -= check_indentation_width(Opts); 2055| 150| if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2056| 150| return; 2057| 150| } 2058| 150| std::memcpy(&b[ix], "\n", 1); 2059| 150| ++ix; 2060| 150| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2061| 150| ix += ctx.depth; 2062| 150| std::memcpy(&b[ix], "}", 1); 2063| 150| ++ix; 2064| 150| } 2065| 150| else { 2066| 150| dump("{\"", b, ix); 2067| 150| dump_maybe_empty(tag_v, b, ix); 2068| 150| dump("\":", b, ix); 2069| 150| write_id(value, ctx, b, ix); 2070| 150| dump('}', b, ix); 2071| 150| } 2072| 150| } 2073| 150| else if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::internal && 2074| 150| (glaze_object_t || reflectable || is_memory_object) && 2075| 150| (not alternative_declares_key(tag_v))) { 2076| | // An alternative that declares a member named like the discriminator carries the 2077| | // discriminator itself, so no tag is merged here and the bare-write branch below 2078| | // handles it. Previously only `reflectable` alternatives were excluded; a 2079| | // `glaze_object_t` one fell through to this branch and emitted the key twice. 2080| 150| if (missing_id(value, ctx)) { 2081| 150| return; 2082| 150| } 2083| 150| constexpr auto N = []() { 2084| 150| if constexpr (is_memory_object) { 2085| 150| return reflect>::size; 2086| 150| } 2087| 150| else { 2088| 150| return reflect::size; 2089| 150| } 2090| 150| }(); 2091| | 2092| | // must first write out type 2093| 150| if constexpr (Opts.prettify) { 2094| 150| dump("{\n", b, ix); 2095| 150| ctx.depth += check_indentation_width(Opts); 2096| 150| dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2097| 150| dump('"', b, ix); 2098| 150| dump_maybe_empty(tag_v, b, ix); 2099| | 2100| 150| using id_type = std::decay_t[value.index()])>; 2101| | 2102| 150| if constexpr (std::integral) { 2103| 150| dump("\": ", b, ix); 2104| 150| serialize::op(ids_v[value.index()], ctx, b, ix); 2105| 150| if constexpr (N > 0) { 2106| 150| dump(",\n", b, ix); 2107| 150| dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2108| 150| } 2109| 150| } 2110| 150| else { 2111| 150| dump("\": \"", b, ix); 2112| 150| dump_maybe_empty(ids_v[value.index()], b, ix); 2113| 150| if constexpr (N == 0) { 2114| 150| dump('"', b, ix); 2115| 150| } 2116| 150| else { 2117| 150| dump("\",\n", b, ix); 2118| 150| dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2119| 150| } 2120| 150| } 2121| 150| } 2122| 150| else { 2123| 150| using id_type = std::decay_t[value.index()])>; 2124| | 2125| 150| dump("{\"", b, ix); 2126| 150| dump_maybe_empty(tag_v, b, ix); 2127| | 2128| 150| if constexpr (std::integral) { 2129| 150| dump("\":", b, ix); 2130| 150| serialize::op(ids_v[value.index()], ctx, b, ix); 2131| 150| if constexpr (N > 0) { 2132| 150| dump(',', b, ix); 2133| 150| } 2134| 150| } 2135| 150| else { 2136| 150| dump("\":\"", b, ix); 2137| 150| dump_maybe_empty(ids_v[value.index()], b, ix); 2138| 150| if constexpr (N == 0) { 2139| 150| dump('"', b, ix); 2140| 150| } 2141| 150| else { 2142| 150| dump("\",", b, ix); 2143| 150| } 2144| 150| } 2145| 150| } 2146| 150| if constexpr (is_memory_object) { 2147| 150| if (!val) [[unlikely]] { 2148| 150| ctx.error = error_code::invalid_variant_object; 2149| 150| return; 2150| 150| } 2151| 150| to>::template op()>(*val, ctx, b, ix); 2152| 150| } 2153| 150| else { 2154| 150| to::template op()>(val, ctx, b, ix); 2155| 150| } 2156| | // If we skip everything then we may have an extra comma, which we want to revert 2157| 150| if constexpr (Opts.skip_null_members) { 2158| 150| if (b[ix - 1] == ',') { 2159| 150| --ix; 2160| 150| } 2161| 150| } 2162| | 2163| 150| if constexpr (Opts.prettify) { 2164| 150| ctx.depth -= check_indentation_width(Opts); 2165| 150| if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2166| 150| return; 2167| 150| } 2168| 150| std::memcpy(&b[ix], "\n", 1); 2169| 150| ++ix; 2170| 150| fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2171| 150| ix += ctx.depth; 2172| 150| std::memcpy(&b[ix], "}", 1); 2173| 150| ++ix; 2174| 150| } 2175| 150| else { 2176| 150| dump('}', b, ix); 2177| 150| } 2178| 150| } 2179| 150| else { 2180| 150| to::template op(val, ctx, b, ix); 2181| 150| } 2182| 150| }, 2183| 150| value); 2184| 150| } _ZZN3glz2toILj10ENSt3__17variantIJNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEN9repe_fuzz6amountEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS8_RSB_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_ENKUlOT_E_clISF_EEDaSS_: 1965| 150| [&](auto&& val) { 1966| 150| using V = std::decay_t; 1967| | 1968| | if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::internal && 1969| | custom_write) { 1970| | // Custom alternative: the user's serializer emits the object body, into which we 1971| | // merge the variant tag. For this to produce valid JSON the custom to<> must (1) 1972| | // write an object body and (2) honor opening_and_closing_handled (suppress its own 1973| | // braces) so the tag shares the alternative's object. A custom writer that emits a 1974| | // scalar/array, or that ignores those flags, would yield malformed output. 1975| | // 1976| | // The tag-emission below mirrors the reflected-object branch that follows; keep the 1977| | // two in sync. The body size is not known at compile time, so we always write the 1978| | // tag separator and then drop it at runtime if the body turned out empty. 1979| | if (missing_id(value, ctx)) { 1980| | return; 1981| | } 1982| | using id_type = std::decay_t[value.index()])>; 1983| | if constexpr (Opts.prettify) { 1984| | dump("{\n", b, ix); 1985| | ctx.depth += check_indentation_width(Opts); 1986| | dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 1987| | dump('"', b, ix); 1988| | dump_maybe_empty(tag_v, b, ix); 1989| | if constexpr (std::integral) { 1990| | dump("\": ", b, ix); 1991| | serialize::op(ids_v[value.index()], ctx, b, ix); 1992| | } 1993| | else { 1994| | dump("\": \"", b, ix); 1995| | dump_maybe_empty(ids_v[value.index()], b, ix); 1996| | dump('"', b, ix); 1997| | } 1998| | const auto pos_after_tag = ix; 1999| | dump(",\n", b, ix); 2000| | dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2001| | const auto pos_body_start = ix; 2002| | to::template op()>(val, ctx, b, ix); 2003| | if (ix == pos_body_start) { 2004| | ix = pos_after_tag; // custom body was empty: undo the tag separator 2005| | } 2006| | ctx.depth -= check_indentation_width(Opts); 2007| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2008| | return; 2009| | } 2010| | std::memcpy(&b[ix], "\n", 1); 2011| | ++ix; 2012| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2013| | ix += ctx.depth; 2014| | std::memcpy(&b[ix], "}", 1); 2015| | ++ix; 2016| | } 2017| | else { 2018| | dump("{\"", b, ix); 2019| | dump_maybe_empty(tag_v, b, ix); 2020| | if constexpr (std::integral) { 2021| | dump("\":", b, ix); 2022| | serialize::op(ids_v[value.index()], ctx, b, ix); 2023| | } 2024| | else { 2025| | dump("\":\"", b, ix); 2026| | dump_maybe_empty(ids_v[value.index()], b, ix); 2027| | dump('"', b, ix); 2028| | } 2029| | const auto pos_after_tag = ix; 2030| | dump(',', b, ix); 2031| | const auto pos_body_start = ix; 2032| | to::template op()>(val, ctx, b, ix); 2033| | if (ix == pos_body_start) { 2034| | ix = pos_after_tag; // custom body was empty: undo the tag separator 2035| | } 2036| | dump('}', b, ix); 2037| | } 2038| | } 2039| | else if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::internal && 2040| | variant_unit_alternative) { 2041| | // A unit alternative carries no data, so internal tagging renders it as the 2042| | // discriminator alone -- the same object an empty struct alternative produces. 2043| | if (missing_id(value, ctx)) { 2044| | return; 2045| | } 2046| | if constexpr (Opts.prettify) { 2047| | dump("{\n", b, ix); 2048| | ctx.depth += check_indentation_width(Opts); 2049| | dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2050| | dump('"', b, ix); 2051| | dump_maybe_empty(tag_v, b, ix); 2052| | dump("\": ", b, ix); 2053| | write_id(value, ctx, b, ix); 2054| | ctx.depth -= check_indentation_width(Opts); 2055| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2056| | return; 2057| | } 2058| | std::memcpy(&b[ix], "\n", 1); 2059| | ++ix; 2060| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2061| | ix += ctx.depth; 2062| | std::memcpy(&b[ix], "}", 1); 2063| | ++ix; 2064| | } 2065| | else { 2066| | dump("{\"", b, ix); 2067| | dump_maybe_empty(tag_v, b, ix); 2068| | dump("\":", b, ix); 2069| | write_id(value, ctx, b, ix); 2070| | dump('}', b, ix); 2071| | } 2072| | } 2073| | else if constexpr (check_write_type_info(Opts) && tagging == variant_tagging_kind::internal && 2074| | (glaze_object_t || reflectable || is_memory_object) && 2075| | (not alternative_declares_key(tag_v))) { 2076| | // An alternative that declares a member named like the discriminator carries the 2077| | // discriminator itself, so no tag is merged here and the bare-write branch below 2078| | // handles it. Previously only `reflectable` alternatives were excluded; a 2079| | // `glaze_object_t` one fell through to this branch and emitted the key twice. 2080| | if (missing_id(value, ctx)) { 2081| | return; 2082| | } 2083| | constexpr auto N = []() { 2084| | if constexpr (is_memory_object) { 2085| | return reflect>::size; 2086| | } 2087| | else { 2088| | return reflect::size; 2089| | } 2090| | }(); 2091| | 2092| | // must first write out type 2093| | if constexpr (Opts.prettify) { 2094| | dump("{\n", b, ix); 2095| | ctx.depth += check_indentation_width(Opts); 2096| | dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2097| | dump('"', b, ix); 2098| | dump_maybe_empty(tag_v, b, ix); 2099| | 2100| | using id_type = std::decay_t[value.index()])>; 2101| | 2102| | if constexpr (std::integral) { 2103| | dump("\": ", b, ix); 2104| | serialize::op(ids_v[value.index()], ctx, b, ix); 2105| | if constexpr (N > 0) { 2106| | dump(",\n", b, ix); 2107| | dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2108| | } 2109| | } 2110| | else { 2111| | dump("\": \"", b, ix); 2112| | dump_maybe_empty(ids_v[value.index()], b, ix); 2113| | if constexpr (N == 0) { 2114| | dump('"', b, ix); 2115| | } 2116| | else { 2117| | dump("\",\n", b, ix); 2118| | dumpn(check_indentation_char(Opts), ctx.depth, b, ix); 2119| | } 2120| | } 2121| | } 2122| | else { 2123| | using id_type = std::decay_t[value.index()])>; 2124| | 2125| | dump("{\"", b, ix); 2126| | dump_maybe_empty(tag_v, b, ix); 2127| | 2128| | if constexpr (std::integral) { 2129| | dump("\":", b, ix); 2130| | serialize::op(ids_v[value.index()], ctx, b, ix); 2131| | if constexpr (N > 0) { 2132| | dump(',', b, ix); 2133| | } 2134| | } 2135| | else { 2136| | dump("\":\"", b, ix); 2137| | dump_maybe_empty(ids_v[value.index()], b, ix); 2138| | if constexpr (N == 0) { 2139| | dump('"', b, ix); 2140| | } 2141| | else { 2142| | dump("\",", b, ix); 2143| | } 2144| | } 2145| | } 2146| | if constexpr (is_memory_object) { 2147| | if (!val) [[unlikely]] { 2148| | ctx.error = error_code::invalid_variant_object; 2149| | return; 2150| | } 2151| | to>::template op()>(*val, ctx, b, ix); 2152| | } 2153| | else { 2154| | to::template op()>(val, ctx, b, ix); 2155| | } 2156| | // If we skip everything then we may have an extra comma, which we want to revert 2157| | if constexpr (Opts.skip_null_members) { 2158| | if (b[ix - 1] == ',') { 2159| | --ix; 2160| | } 2161| | } 2162| | 2163| | if constexpr (Opts.prettify) { 2164| | ctx.depth -= check_indentation_width(Opts); 2165| | if (!ensure_space(ctx, b, ix + ctx.depth + write_padding_bytes)) [[unlikely]] { 2166| | return; 2167| | } 2168| | std::memcpy(&b[ix], "\n", 1); 2169| | ++ix; 2170| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2171| | ix += ctx.depth; 2172| | std::memcpy(&b[ix], "}", 1); 2173| | ++ix; 2174| | } 2175| | else { 2176| | dump('}', b, ix); 2177| | } 2178| | } 2179| 150| else { 2180| 150| to::template op(val, ctx, b, ix); 2181| 150| } 2182| 150| }, _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm8EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__18functionIFiiEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERS4_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1275| 76| { 1276| 76| static constexpr auto name = name_v>; 1277| 76| constexpr auto n = name.size(); 1278| | 1279| 76| if (!ensure_space(ctx, b, ix + 8 + n)) [[unlikely]] { ------------------ | Branch (1279:14): [True: 0, False: 76] ------------------ 1280| 0| return; 1281| 0| } 1282| | 1283| 76| std::memcpy(&b[ix], "\"", 1); 1284| 76| ++ix; 1285| 76| if constexpr (not name.empty()) { 1286| 76| std::memcpy(&b[ix], name.data(), n); 1287| 76| ix += n; 1288| 76| } 1289| 76| std::memcpy(&b[ix], "\"", 1); 1290| 76| ++ix; 1291| 76| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm9EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__18functionIFNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKS8_EEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS8_RSC_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1275| 76| { 1276| 76| static constexpr auto name = name_v>; 1277| 76| constexpr auto n = name.size(); 1278| | 1279| 76| if (!ensure_space(ctx, b, ix + 8 + n)) [[unlikely]] { ------------------ | Branch (1279:14): [True: 0, False: 76] ------------------ 1280| 0| return; 1281| 0| } 1282| | 1283| 76| std::memcpy(&b[ix], "\"", 1); 1284| 76| ++ix; 1285| 76| if constexpr (not name.empty()) { 1286| 76| std::memcpy(&b[ix], name.data(), n); 1287| 76| ix += n; 1288| 76| } 1289| 76| std::memcpy(&b[ix], "\"", 1); 1290| 76| ++ix; 1291| 76| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm10EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__18functionIFN9repe_fuzz5pointERKS4_EEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERS8_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1275| 76| { 1276| 76| static constexpr auto name = name_v>; 1277| 76| constexpr auto n = name.size(); 1278| | 1279| 76| if (!ensure_space(ctx, b, ix + 8 + n)) [[unlikely]] { ------------------ | Branch (1279:14): [True: 0, False: 76] ------------------ 1280| 0| return; 1281| 0| } 1282| | 1283| 76| std::memcpy(&b[ix], "\"", 1); 1284| 76| ++ix; 1285| 76| if constexpr (not name.empty()) { 1286| 76| std::memcpy(&b[ix], name.data(), n); 1287| 76| ix += n; 1288| 76| } 1289| 76| std::memcpy(&b[ix], "\"", 1); 1290| 76| ++ix; 1291| 76| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm11EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__18functionIFdRNS1_6vectorIdNS1_9allocatorIdEEEEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNS1_12basic_stringIcNS1_11char_traitsIcEENS4_IcEEEERS9_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1275| 76| { 1276| 76| static constexpr auto name = name_v>; 1277| 76| constexpr auto n = name.size(); 1278| | 1279| 76| if (!ensure_space(ctx, b, ix + 8 + n)) [[unlikely]] { ------------------ | Branch (1279:14): [True: 0, False: 76] ------------------ 1280| 0| return; 1281| 0| } 1282| | 1283| 76| std::memcpy(&b[ix], "\"", 1); 1284| 76| ++ix; 1285| 76| if constexpr (not name.empty()) { 1286| 76| std::memcpy(&b[ix], name.data(), n); 1287| 76| ix += n; 1288| 76| } 1289| 76| std::memcpy(&b[ix], "\"", 1); 1290| 76| ++ix; 1291| 76| } _ZZN3glz2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS2_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_ENKUlTnmvE_clILm12EEEDav: 2545| 76| for_each([&]() { 2546| 76| using val_t = field_t; 2547| | 2548| | // Compile-time exclusions gate the field here rather than returning early, so that a 2549| | // skipped field's writer is never instantiated -- see `skipped_by_meta`. 2550| | if constexpr (skipped_on_write) { 2551| | return; 2552| | } 2553| 76| else { 2554| | if constexpr (meta_has_skip_if) { 2555| | static constexpr auto skip_if_key = glz::get(reflect::keys); 2556| | static constexpr meta_context mctx{.op = operation::serialize}; 2557| | decltype(auto) field_value = [&]() -> decltype(auto) { 2558| | if constexpr (reflectable) { 2559| | return get(t); 2560| | } 2561| | else { 2562| | return get_member(value, glz::get(reflect::values)); 2563| | } 2564| | }(); 2565| | if (meta::skip_if(field_value, skip_if_key, mctx)) return; 2566| | } 2567| | 2568| | if constexpr (null_t && Opts.skip_null_members) { 2569| | if constexpr (always_null_t) 2570| | return; 2571| | else { 2572| | const auto is_null = [&]() { 2573| | decltype(auto) element = [&]() -> decltype(auto) { 2574| | if constexpr (reflectable) { 2575| | return get(t); 2576| | } 2577| | else { 2578| | return get(reflect::values); 2579| | } 2580| | }; 2581| | 2582| | if constexpr (nullable_wrapper) { 2583| | return !bool(element()(value).val); 2584| | } 2585| | else if constexpr (nullable_value_t) { 2586| | return !get_member(value, element()).has_value(); 2587| | } 2588| | else { 2589| | return !bool(get_member(value, element())); 2590| | } 2591| | }(); 2592| | if (is_null) return; 2593| | } 2594| | } 2595| | else if constexpr (is_specialization_v && Opts.skip_null_members && 2596| | custom_getter_returns_nullable()) { 2597| | if (is_custom_field_null(value, t, ctx)) return; 2598| | } 2599| 76| else if constexpr (Opts.skip_null_members && glaze_value_is_nullable()) { 2600| 76| if (is_glaze_value_field_null(value, t)) return; 2601| 76| } 2602| | 2603| | if constexpr (check_skip_default_members(Opts) && has_skippable_default) { 2604| | decltype(auto) member = [&]() -> decltype(auto) { 2605| | if constexpr (reflectable) { 2606| | return get_member(value, get(t)); 2607| | } 2608| | else { 2609| | return get_member(value, get(reflect::values)); 2610| | } 2611| | }(); 2612| | if (is_default_value(member)) return; 2613| | } 2614| | 2615| | if constexpr (Opts.prettify) { 2616| | if (!ensure_space(ctx, b, ix + padding + ctx.depth)) [[unlikely]] { 2617| | return; 2618| | } 2619| | } 2620| 76| else { 2621| 76| if (!ensure_space(ctx, b, ix + padding)) [[unlikely]] { ------------------ | Branch (2621:29): [True: 0, False: 76] ------------------ 2622| 0| return; 2623| 0| } 2624| 76| } 2625| | 2626| 76| if (first) { ------------------ | Branch (2626:26): [True: 0, False: 76] ------------------ 2627| 0| first = false; 2628| 0| } 2629| 76| else { 2630| | // Null members may be skipped so we can't just write it out for all but the last member 2631| | if constexpr (Opts.prettify) { 2632| | std::memcpy(&b[ix], ",\n", 2); 2633| | ix += 2; 2634| | fill_bytes(&b[ix], check_indentation_char(Opts), ctx.depth); 2635| | ix += ctx.depth; 2636| | } 2637| 76| else { 2638| 76| std::memcpy(&b[ix], ",", 1); 2639| 76| ++ix; 2640| 76| } 2641| | if constexpr (is_output_streaming) { 2642| | flush_buffer(b, ix); 2643| | } 2644| 76| } 2645| | 2646| | // MSVC requires get rather than keys[I] 2647| 76| static constexpr auto key = glz::get(reflect::keys); // GCC 14 requires auto here 2648| 76| static constexpr auto quoted_key = quoted_key_v; 2649| 76| static constexpr auto n = quoted_key.size(); 2650| 76| std::memcpy(&b[ix], quoted_key.data(), n); 2651| 76| ix += n; 2652| | 2653| 76| static constexpr auto check_opts = required_padding() ? write_unchecked_on() : Opts; ------------------ | Branch (2653:57): [Folded, False: 76] ------------------ 2654| 76| if constexpr (reflectable) { 2655| 76| to::template op(get_member(value, get(t)), ctx, b, ix); 2656| | } 2657| | else { 2658| | to::template op(get_member(value, get(reflect::values)), ctx, b, 2659| | ix); 2660| | } 2661| 76| } 2662| 76| }); _ZN3glz2toILj10ENSt3__18functionIFvvEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERS4_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 1275| 76| { 1276| 76| static constexpr auto name = name_v>; 1277| 76| constexpr auto n = name.size(); 1278| | 1279| 76| if (!ensure_space(ctx, b, ix + 8 + n)) [[unlikely]] { ------------------ | Branch (1279:14): [True: 0, False: 76] ------------------ 1280| 0| return; 1281| 0| } 1282| | 1283| 76| std::memcpy(&b[ix], "\"", 1); 1284| 76| ++ix; 1285| 76| if constexpr (not name.empty()) { 1286| 76| std::memcpy(&b[ix], name.data(), n); 1287| 76| ix += n; 1288| 76| } 1289| 76| std::memcpy(&b[ix], "\"", 1); 1290| 76| ++ix; 1291| 76| } _ZN3glz2toILj10EdE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERdTkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_: 814| 578| { 815| 578| if constexpr (not check_write_unchecked(Opts)) { 816| 578| static_assert(required_padding()); 817| 578| if (!ensure_space(ctx, b, ix + required_padding())) [[unlikely]] { ------------------ | Branch (817:17): [True: 0, False: 578] ------------------ 818| 0| return; 819| 0| } 820| 578| } 821| | 822| 578| static constexpr auto O = write_unchecked_on(); 823| | 824| | if constexpr (check_quoted_num(Opts)) { 825| | std::memcpy(&b[ix], "\"", 1); 826| | ++ix; 827| | write_chars::op(value, ctx, b, ix); 828| | std::memcpy(&b[ix], "\"", 1); 829| | ++ix; 830| | } 831| 578| else { 832| 578| write_chars::op(value, ctx, b, ix); 833| 578| } 834| 578| } _ZN3glz16required_paddingIdEEmv: 538| 578| { 539| 578| constexpr auto value = []() -> size_t { 540| 578| if constexpr (boolean_like) { 541| 578| return 8; 542| 578| } 543| 578| else if constexpr (num_t) { 544| 578| if constexpr (std::floating_point) { 545| 578| if constexpr (sizeof(T) > 8) { 546| 578| return 64; 547| 578| } 548| 578| else if constexpr (sizeof(T) > 4) { 549| | // zmij scratch + 4 for optional quotes and trailing comma. 550| 578| return zmij::double_buffer_size + 4; 551| 578| } 552| 578| else { 553| 578| return zmij::float_buffer_size + 4; 554| 578| } 555| 578| } 556| 578| else if constexpr (sizeof(T) > 4) { 557| 578| return 24; 558| 578| } 559| 578| else if constexpr (sizeof(T) > 2) { 560| 578| return 16; 561| 578| } 562| 578| else { 563| 578| return 8; 564| 578| } 565| 578| } 566| 578| else if constexpr (nullable_like) { 567| 578| if constexpr (has_value_type) { 568| 578| return required_padding(); 569| 578| } 570| 578| else if constexpr (has_element_type) { 571| 578| return required_padding(); 572| 578| } 573| 578| else { 574| 578| return 0; 575| 578| } 576| 578| } 577| 578| else if constexpr (always_null_t) { 578| 578| return 8; 579| 578| } 580| 578| else { 581| 578| return 0; 582| 578| } 583| 578| }(); 584| | 585| | if constexpr (value >= (write_padding_bytes - 16)) { 586| | // we always require 16 bytes available from write_padding_bytes 587| | // for opening and closing characters 588| | return 0; 589| | } 590| 578| return value; 591| 578| } _ZN3glz2toILj10ENSt3__18optionalIdEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS3_TkNS_10is_contextERNS_7contextERNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEmEEvOT0_OT1_OT2_RT3_: 1813| 74| { 1814| 74| if (value) { ------------------ | Branch (1814:14): [True: 0, False: 74] ------------------ 1815| 0| if constexpr (required_padding()) { 1816| 0| serialize::op(*value, ctx, b, ix); 1817| | } 1818| | else { 1819| | serialize::op()>(*value, ctx, b, ix); 1820| | } 1821| 0| } 1822| 74| else { 1823| 74| dump("null", b, ix); 1824| 74| } 1825| 74| } _ZN3glz6to_tieIRN9repe_fuzz5pointELm2EQleT0_L_ZNS_6detail25max_pure_reflection_countEEEEDcOT_: 137| 397k| { 138| | if constexpr (N == 0) { 139| | return tuple{}; 140| | } 141| | else if constexpr (N == 1) { 142| | auto& [p] = t; 143| | return glz::tie(p); 144| | } 145| 397k| else if constexpr (N == 2) { 146| 397k| auto& [p0, p1] = t; 147| 397k| return glz::tie(p0, p1); 148| | } 149| | else if constexpr (N == 3) { 150| | auto& [p0, p1, p2] = t; 151| | return glz::tie(p0, p1, p2); 152| | } 153| | else if constexpr (N == 4) { 154| | auto& [p0, p1, p2, p3] = t; 155| | return glz::tie(p0, p1, p2, p3); 156| | } 157| | else if constexpr (N == 5) { 158| | auto& [p0, p1, p2, p3, p4] = t; 159| | return glz::tie(p0, p1, p2, p3, p4); 160| | } 161| | else if constexpr (N == 6) { 162| | auto& [p0, p1, p2, p3, p4, p5] = t; 163| | return glz::tie(p0, p1, p2, p3, p4, p5); 164| | } 165| | else if constexpr (N == 7) { 166| | auto& [p0, p1, p2, p3, p4, p5, p6] = t; 167| | return glz::tie(p0, p1, p2, p3, p4, p5, p6); 168| | } 169| | else if constexpr (N == 8) { 170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7] = t; 171| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7); 172| | } 173| | else if constexpr (N == 9) { 174| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8] = t; 175| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8); 176| | } 177| | else if constexpr (N == 10) { 178| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9] = t; 179| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); 180| | } 181| | else if constexpr (N == 11) { 182| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10] = t; 183| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10); 184| | } 185| | else if constexpr (N == 12) { 186| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11] = t; 187| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11); 188| | } 189| | else if constexpr (N == 13) { 190| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12] = t; 191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12); 192| | } 193| | else if constexpr (N == 14) { 194| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13] = t; 195| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13); 196| | } 197| | else if constexpr (N == 15) { 198| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14] = t; 199| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14); 200| | } 201| | else if constexpr (N == 16) { 202| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15] = t; 203| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15); 204| | } 205| | else if constexpr (N == 17) { 206| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16] = t; 207| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16); 208| | } 209| | else if constexpr (N == 18) { 210| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17] = t; 211| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17); 212| | } 213| | else if constexpr (N == 19) { 214| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18] = t; 215| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18); 216| | } 217| | else if constexpr (N == 20) { 218| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19] = t; 219| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19); 220| | } 221| | else if constexpr (N == 21) { 222| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20] = t; 223| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20); 224| | } 225| | else if constexpr (N == 22) { 226| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21] = t; 227| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 228| | p21); 229| | } 230| | else if constexpr (N == 23) { 231| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, 232| | p22] = t; 233| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 234| | p21, p22); 235| | } 236| | else if constexpr (N == 24) { 237| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 238| | p23] = t; 239| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 240| | p21, p22, p23); 241| | } 242| | else if constexpr (N == 25) { 243| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 244| | p23, p24] = t; 245| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 246| | p21, p22, p23, p24); 247| | } 248| | else if constexpr (N == 26) { 249| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 250| | p23, p24, p25] = t; 251| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 252| | p21, p22, p23, p24, p25); 253| | } 254| | else if constexpr (N == 27) { 255| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 256| | p23, p24, p25, p26] = t; 257| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 258| | p21, p22, p23, p24, p25, p26); 259| | } 260| | else if constexpr (N == 28) { 261| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 262| | p23, p24, p25, p26, p27] = t; 263| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 264| | p21, p22, p23, p24, p25, p26, p27); 265| | } 266| | else if constexpr (N == 29) { 267| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 268| | p23, p24, p25, p26, p27, p28] = t; 269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 270| | p21, p22, p23, p24, p25, p26, p27, p28); 271| | } 272| | else if constexpr (N == 30) { 273| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 274| | p23, p24, p25, p26, p27, p28, p29] = t; 275| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 276| | p21, p22, p23, p24, p25, p26, p27, p28, p29); 277| | } 278| | else if constexpr (N == 31) { 279| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 280| | p23, p24, p25, p26, p27, p28, p29, p30] = t; 281| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 282| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30); 283| | } 284| | else if constexpr (N == 32) { 285| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 286| | p23, p24, p25, p26, p27, p28, p29, p30, p31] = t; 287| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 288| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31); 289| | } 290| | else if constexpr (N == 33) { 291| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 292| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32] = t; 293| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 294| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32); 295| | } 296| | else if constexpr (N == 34) { 297| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 298| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33] = t; 299| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 300| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33); 301| | } 302| | else if constexpr (N == 35) { 303| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 304| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34] = t; 305| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 306| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34); 307| | } 308| | else if constexpr (N == 36) { 309| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 310| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35] = t; 311| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 312| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35); 313| | } 314| | else if constexpr (N == 37) { 315| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 316| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36] = t; 317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36); 319| | } 320| | else if constexpr (N == 38) { 321| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 322| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37] = t; 323| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 324| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37); 325| | } 326| | else if constexpr (N == 39) { 327| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 328| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38] = t; 329| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 330| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38); 331| | } 332| | else if constexpr (N == 40) { 333| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 334| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39] = t; 335| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 336| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39); 337| | } 338| | else if constexpr (N == 41) { 339| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 340| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40] = t; 341| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 342| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 343| | p40); 344| | } 345| | else if constexpr (N == 42) { 346| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 347| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41] = t; 348| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 349| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 350| | p40, p41); 351| | } 352| | else if constexpr (N == 43) { 353| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 354| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42] = t; 355| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 356| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 357| | p40, p41, p42); 358| | } 359| | else if constexpr (N == 44) { 360| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 361| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, 362| | p43] = t; 363| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 364| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 365| | p40, p41, p42, p43); 366| | } 367| | else if constexpr (N == 45) { 368| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 369| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 370| | p44] = t; 371| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 372| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 373| | p40, p41, p42, p43, p44); 374| | } 375| | else if constexpr (N == 46) { 376| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 377| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 378| | p44, p45] = t; 379| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 380| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 381| | p40, p41, p42, p43, p44, p45); 382| | } 383| | else if constexpr (N == 47) { 384| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 385| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 386| | p44, p45, p46] = t; 387| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 388| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 389| | p40, p41, p42, p43, p44, p45, p46); 390| | } 391| | else if constexpr (N == 48) { 392| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 393| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 394| | p44, p45, p46, p47] = t; 395| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 396| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 397| | p40, p41, p42, p43, p44, p45, p46, p47); 398| | } 399| | else if constexpr (N == 49) { 400| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 401| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 402| | p44, p45, p46, p47, p48] = t; 403| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 404| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 405| | p40, p41, p42, p43, p44, p45, p46, p47, p48); 406| | } 407| | else if constexpr (N == 50) { 408| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 409| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 410| | p44, p45, p46, p47, p48, p49] = t; 411| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 412| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 413| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49); 414| | } 415| | else if constexpr (N == 51) { 416| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 417| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 418| | p44, p45, p46, p47, p48, p49, p50] = t; 419| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 420| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 421| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50); 422| | } 423| | else if constexpr (N == 52) { 424| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 425| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 426| | p44, p45, p46, p47, p48, p49, p50, p51] = t; 427| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 428| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 429| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51); 430| | } 431| | else if constexpr (N == 53) { 432| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 433| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 434| | p44, p45, p46, p47, p48, p49, p50, p51, p52] = t; 435| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 436| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 437| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52); 438| | } 439| | else if constexpr (N == 54) { 440| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 441| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 442| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53] = t; 443| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 444| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 445| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53); 446| | } 447| | else if constexpr (N == 55) { 448| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 449| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 450| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54] = t; 451| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 452| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 453| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54); 454| | } 455| | else if constexpr (N == 56) { 456| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 457| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 458| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55] = t; 459| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 460| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 461| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55); 462| | } 463| | else if constexpr (N == 57) { 464| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 465| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 466| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56] = t; 467| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 468| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 469| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56); 470| | } 471| | else if constexpr (N == 58) { 472| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 473| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 474| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57] = t; 475| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 476| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 477| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57); 478| | } 479| | else if constexpr (N == 59) { 480| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 481| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 482| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58] = t; 483| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 484| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 485| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58); 486| | } 487| | else if constexpr (N == 60) { 488| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 489| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 490| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59] = t; 491| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 492| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 493| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 494| | p59); 495| | } 496| | else if constexpr (N == 61) { 497| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 498| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 499| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60] = t; 500| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 501| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 502| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 503| | p59, p60); 504| | } 505| | else if constexpr (N == 62) { 506| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 507| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 508| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61] = t; 509| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 510| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 511| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 512| | p59, p60, p61); 513| | } 514| | else if constexpr (N == 63) { 515| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 516| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 517| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62] = t; 518| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 519| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 520| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 521| | p59, p60, p61, p62); 522| | } 523| | else if constexpr (N == 64) { 524| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 525| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 526| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63] = t; 527| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 528| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 529| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 530| | p59, p60, p61, p62, p63); 531| | } 532| | else if constexpr (N == 65) { 533| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 534| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 535| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, 536| | p64] = t; 537| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 538| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 539| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 540| | p59, p60, p61, p62, p63, p64); 541| | } 542| | else if constexpr (N == 66) { 543| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 544| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 545| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 546| | p65] = t; 547| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 548| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 549| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 550| | p59, p60, p61, p62, p63, p64, p65); 551| | } 552| | else if constexpr (N == 67) { 553| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 554| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 555| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 556| | p65, p66] = t; 557| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 558| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 559| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 560| | p59, p60, p61, p62, p63, p64, p65, p66); 561| | } 562| | else if constexpr (N == 68) { 563| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 564| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 565| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 566| | p65, p66, p67] = t; 567| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 568| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 569| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 570| | p59, p60, p61, p62, p63, p64, p65, p66, p67); 571| | } 572| | else if constexpr (N == 69) { 573| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 574| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 575| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 576| | p65, p66, p67, p68] = t; 577| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 578| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 579| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 580| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68); 581| | } 582| | else if constexpr (N == 70) { 583| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 584| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 585| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 586| | p65, p66, p67, p68, p69] = t; 587| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 588| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 589| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 590| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69); 591| | } 592| | else if constexpr (N == 71) { 593| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 594| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 595| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 596| | p65, p66, p67, p68, p69, p70] = t; 597| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 598| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 599| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 600| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70); 601| | } 602| | else if constexpr (N == 72) { 603| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 604| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 605| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 606| | p65, p66, p67, p68, p69, p70, p71] = t; 607| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 608| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 609| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 610| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71); 611| | } 612| | else if constexpr (N == 73) { 613| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 614| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 615| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 616| | p65, p66, p67, p68, p69, p70, p71, p72] = t; 617| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 618| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 619| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 620| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72); 621| | } 622| | else if constexpr (N == 74) { 623| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 624| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 625| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 626| | p65, p66, p67, p68, p69, p70, p71, p72, p73] = t; 627| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 628| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 629| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 630| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73); 631| | } 632| | else if constexpr (N == 75) { 633| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 634| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 635| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 636| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74] = t; 637| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 638| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 639| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 640| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74); 641| | } 642| | else if constexpr (N == 76) { 643| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 644| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 645| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 646| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75] = t; 647| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 648| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 649| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 650| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75); 651| | } 652| | else if constexpr (N == 77) { 653| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 654| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 655| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 656| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76] = t; 657| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 658| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 659| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 660| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76); 661| | } 662| | else if constexpr (N == 78) { 663| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 664| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 665| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 666| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77] = t; 667| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 668| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 669| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 670| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77); 671| | } 672| | else if constexpr (N == 79) { 673| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 674| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 675| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 676| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78] = t; 677| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 678| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 679| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 680| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 681| | p78); 682| | } 683| | else if constexpr (N == 80) { 684| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 685| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 686| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 687| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79] = t; 688| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 689| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 690| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 691| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 692| | p78, p79); 693| | } 694| | else if constexpr (N == 81) { 695| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 696| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 697| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 698| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80] = t; 699| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 700| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 701| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 702| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 703| | p78, p79, p80); 704| | } 705| | else if constexpr (N == 82) { 706| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 707| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 708| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 709| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81] = t; 710| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 711| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 712| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 713| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 714| | p78, p79, p80, p81); 715| | } 716| | else if constexpr (N == 83) { 717| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 718| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 719| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 720| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82] = t; 721| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 722| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 723| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 724| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 725| | p78, p79, p80, p81, p82); 726| | } 727| | else if constexpr (N == 84) { 728| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 729| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 730| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 731| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83] = t; 732| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 733| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 734| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 735| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 736| | p78, p79, p80, p81, p82, p83); 737| | } 738| | else if constexpr (N == 85) { 739| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 740| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 741| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 742| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84] = t; 743| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 744| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 745| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 746| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 747| | p78, p79, p80, p81, p82, p83, p84); 748| | } 749| | else if constexpr (N == 86) { 750| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 751| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 752| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 753| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, 754| | p85] = t; 755| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 756| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 757| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 758| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 759| | p78, p79, p80, p81, p82, p83, p84, p85); 760| | } 761| | else if constexpr (N == 87) { 762| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 763| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 764| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 765| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 766| | p86] = t; 767| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 768| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 769| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 770| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 771| | p78, p79, p80, p81, p82, p83, p84, p85, p86); 772| | } 773| | else if constexpr (N == 88) { 774| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 775| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 776| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 777| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 778| | p86, p87] = t; 779| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 780| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 781| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 782| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 783| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87); 784| | } 785| | else if constexpr (N == 89) { 786| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 787| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 788| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 789| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 790| | p86, p87, p88] = t; 791| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 792| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 793| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 794| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 795| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88); 796| | } 797| | else if constexpr (N == 90) { 798| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 799| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 800| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 801| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 802| | p86, p87, p88, p89] = t; 803| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 804| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 805| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 806| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 807| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89); 808| | } 809| | else if constexpr (N == 91) { 810| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 811| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 812| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 813| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 814| | p86, p87, p88, p89, p90] = t; 815| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 816| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 817| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 818| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 819| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90); 820| | } 821| | else if constexpr (N == 92) { 822| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 823| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 824| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 825| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 826| | p86, p87, p88, p89, p90, p91] = t; 827| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 828| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 829| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 830| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 831| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91); 832| | } 833| | else if constexpr (N == 93) { 834| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 835| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 836| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 837| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 838| | p86, p87, p88, p89, p90, p91, p92] = t; 839| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 840| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 841| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 842| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 843| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92); 844| | } 845| | else if constexpr (N == 94) { 846| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 847| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 848| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 849| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 850| | p86, p87, p88, p89, p90, p91, p92, p93] = t; 851| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 852| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 853| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 854| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 855| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93); 856| | } 857| | else if constexpr (N == 95) { 858| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 859| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 860| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 861| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 862| | p86, p87, p88, p89, p90, p91, p92, p93, p94] = t; 863| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 864| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 865| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 866| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 867| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94); 868| | } 869| | else if constexpr (N == 96) { 870| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 871| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 872| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 873| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 874| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95] = t; 875| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 876| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 877| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 878| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 879| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95); 880| | } 881| | else if constexpr (N == 97) { 882| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 883| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 884| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 885| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 886| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96] = t; 887| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 888| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 889| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 890| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 891| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96); 892| | } 893| | else if constexpr (N == 98) { 894| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 895| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 896| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 897| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 898| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97] = t; 899| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 900| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 901| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 902| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 903| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 904| | p97); 905| | } 906| | else if constexpr (N == 99) { 907| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 908| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 909| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 910| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 911| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98] = t; 912| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 913| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 914| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 915| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 916| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 917| | p97, p98); 918| | } 919| | else if constexpr (N == 100) { 920| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 921| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 922| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 923| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 924| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99] = t; 925| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 926| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 927| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 928| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 929| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 930| | p97, p98, p99); 931| | } 932| | else if constexpr (N == 101) { 933| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 934| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 935| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 936| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 937| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100] = t; 938| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 939| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 940| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 941| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 942| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 943| | p97, p98, p99, p100); 944| | } 945| | else if constexpr (N == 102) { 946| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 947| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 948| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 949| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 950| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101] = t; 951| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 952| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 953| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 954| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 955| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 956| | p97, p98, p99, p100, p101); 957| | } 958| | else if constexpr (N == 103) { 959| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 960| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 961| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 962| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 963| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102] = t; 964| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 965| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 966| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 967| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 968| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 969| | p97, p98, p99, p100, p101, p102); 970| | } 971| | else if constexpr (N == 104) { 972| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 973| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 974| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 975| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 976| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103] = t; 977| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 978| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 979| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 980| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 981| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 982| | p97, p98, p99, p100, p101, p102, p103); 983| | } 984| | else if constexpr (N == 105) { 985| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 986| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 987| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 988| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 989| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104] = t; 990| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 991| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 992| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 993| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 994| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 995| | p97, p98, p99, p100, p101, p102, p103, p104); 996| | } 997| | else if constexpr (N == 106) { 998| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 999| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1000| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1001| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1002| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1003| | p105] = t; 1004| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1005| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1006| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1007| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1008| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1009| | p97, p98, p99, p100, p101, p102, p103, p104, p105); 1010| | } 1011| | else if constexpr (N == 107) { 1012| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1013| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1014| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1015| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1016| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1017| | p105, p106] = t; 1018| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1019| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1020| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1021| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1022| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1023| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106); 1024| | } 1025| | else if constexpr (N == 108) { 1026| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1027| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1028| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1029| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1030| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1031| | p105, p106, p107] = t; 1032| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1033| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1034| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1035| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1036| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1037| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107); 1038| | } 1039| | else if constexpr (N == 109) { 1040| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1041| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1042| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1043| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1044| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1045| | p105, p106, p107, p108] = t; 1046| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1047| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1048| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1049| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1050| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1051| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108); 1052| | } 1053| | else if constexpr (N == 110) { 1054| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1055| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1056| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1057| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1058| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1059| | p105, p106, p107, p108, p109] = t; 1060| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1061| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1062| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1063| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1064| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1065| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109); 1066| | } 1067| | else if constexpr (N == 111) { 1068| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1069| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1070| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1071| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1072| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1073| | p105, p106, p107, p108, p109, p110] = t; 1074| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1075| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1076| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1077| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1078| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1079| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110); 1080| | } 1081| | else if constexpr (N == 112) { 1082| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1083| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1084| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1085| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1086| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1087| | p105, p106, p107, p108, p109, p110, p111] = t; 1088| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1089| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1090| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1091| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1092| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1093| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111); 1094| | } 1095| | else if constexpr (N == 113) { 1096| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1097| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1098| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1099| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1100| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1101| | p105, p106, p107, p108, p109, p110, p111, p112] = t; 1102| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1103| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1104| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1105| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1106| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1107| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112); 1108| | } 1109| | else if constexpr (N == 114) { 1110| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1111| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1112| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1113| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1114| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1115| | p105, p106, p107, p108, p109, p110, p111, p112, p113] = t; 1116| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1117| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1118| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1119| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1120| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1121| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1122| | p113); 1123| | } 1124| | else if constexpr (N == 115) { 1125| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1126| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1127| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1128| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1129| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1130| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114] = t; 1131| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1132| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1133| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1134| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1135| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1136| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1137| | p113, p114); 1138| | } 1139| | else if constexpr (N == 116) { 1140| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1141| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1142| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1143| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1144| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1145| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115] = t; 1146| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1147| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1148| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1149| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1150| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1151| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1152| | p113, p114, p115); 1153| | } 1154| | else if constexpr (N == 117) { 1155| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1156| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1157| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1158| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1159| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1160| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116] = t; 1161| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1162| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1163| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1164| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1165| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1166| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1167| | p113, p114, p115, p116); 1168| | } 1169| | else if constexpr (N == 118) { 1170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1171| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1172| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1173| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1174| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1175| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117] = t; 1176| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1177| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1178| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1179| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1180| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1181| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1182| | p113, p114, p115, p116, p117); 1183| | } 1184| | else if constexpr (N == 119) { 1185| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1186| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1187| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1188| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1189| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1190| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118] = t; 1191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1192| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1193| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1194| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1195| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1196| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1197| | p113, p114, p115, p116, p117, p118); 1198| | } 1199| | else if constexpr (N == 120) { 1200| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1201| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1202| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1203| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1204| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1205| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119] = t; 1206| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1207| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1208| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1209| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1210| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1211| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1212| | p113, p114, p115, p116, p117, p118, p119); 1213| | } 1214| | else if constexpr (N == 121) { 1215| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1216| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1217| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1218| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1219| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1220| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120] = t; 1221| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1222| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1223| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1224| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1225| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1226| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1227| | p113, p114, p115, p116, p117, p118, p119, p120); 1228| | } 1229| | else if constexpr (N == 122) { 1230| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1231| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1232| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1233| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1234| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1235| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121] = 1236| | t; 1237| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1238| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1239| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1240| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1241| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1242| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1243| | p113, p114, p115, p116, p117, p118, p119, p120, p121); 1244| | } 1245| | else if constexpr (N == 123) { 1246| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1247| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1248| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1249| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1250| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1251| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1252| | p122] = t; 1253| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1254| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1255| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1256| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1257| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1258| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1259| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122); 1260| | } 1261| | else if constexpr (N == 124) { 1262| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1263| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1264| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1265| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1266| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1267| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1268| | p122, p123] = t; 1269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1270| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1271| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1272| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1273| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1274| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1275| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123); 1276| | } 1277| | else if constexpr (N == 125) { 1278| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1279| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1280| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1281| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1282| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1283| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1284| | p122, p123, p124] = t; 1285| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1286| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1287| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1288| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1289| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1290| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1291| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124); 1292| | } 1293| | else if constexpr (N == 126) { 1294| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1295| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1296| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1297| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1298| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1299| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1300| | p122, p123, p124, p125] = t; 1301| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1302| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1303| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1304| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1305| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1306| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1307| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125); 1308| | } 1309| | else if constexpr (N == 127) { 1310| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1311| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1312| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1313| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1314| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1315| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1316| | p122, p123, p124, p125, p126] = t; 1317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1319| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1320| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1321| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1322| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1323| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126); 1324| | } 1325| | else if constexpr (N == 128) { 1326| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1327| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1328| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1329| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1330| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1331| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1332| | p122, p123, p124, p125, p126, p127] = t; 1333| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1334| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1335| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1336| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1337| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1338| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1339| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126, p127); 1340| | } 1341| 397k| } _ZN3glz6to_tieIRN9repe_fuzz6nestedELm2EQleT0_L_ZNS_6detail25max_pure_reflection_countEEEEDcOT_: 137| 375k| { 138| | if constexpr (N == 0) { 139| | return tuple{}; 140| | } 141| | else if constexpr (N == 1) { 142| | auto& [p] = t; 143| | return glz::tie(p); 144| | } 145| 375k| else if constexpr (N == 2) { 146| 375k| auto& [p0, p1] = t; 147| 375k| return glz::tie(p0, p1); 148| | } 149| | else if constexpr (N == 3) { 150| | auto& [p0, p1, p2] = t; 151| | return glz::tie(p0, p1, p2); 152| | } 153| | else if constexpr (N == 4) { 154| | auto& [p0, p1, p2, p3] = t; 155| | return glz::tie(p0, p1, p2, p3); 156| | } 157| | else if constexpr (N == 5) { 158| | auto& [p0, p1, p2, p3, p4] = t; 159| | return glz::tie(p0, p1, p2, p3, p4); 160| | } 161| | else if constexpr (N == 6) { 162| | auto& [p0, p1, p2, p3, p4, p5] = t; 163| | return glz::tie(p0, p1, p2, p3, p4, p5); 164| | } 165| | else if constexpr (N == 7) { 166| | auto& [p0, p1, p2, p3, p4, p5, p6] = t; 167| | return glz::tie(p0, p1, p2, p3, p4, p5, p6); 168| | } 169| | else if constexpr (N == 8) { 170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7] = t; 171| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7); 172| | } 173| | else if constexpr (N == 9) { 174| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8] = t; 175| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8); 176| | } 177| | else if constexpr (N == 10) { 178| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9] = t; 179| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); 180| | } 181| | else if constexpr (N == 11) { 182| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10] = t; 183| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10); 184| | } 185| | else if constexpr (N == 12) { 186| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11] = t; 187| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11); 188| | } 189| | else if constexpr (N == 13) { 190| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12] = t; 191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12); 192| | } 193| | else if constexpr (N == 14) { 194| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13] = t; 195| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13); 196| | } 197| | else if constexpr (N == 15) { 198| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14] = t; 199| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14); 200| | } 201| | else if constexpr (N == 16) { 202| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15] = t; 203| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15); 204| | } 205| | else if constexpr (N == 17) { 206| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16] = t; 207| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16); 208| | } 209| | else if constexpr (N == 18) { 210| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17] = t; 211| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17); 212| | } 213| | else if constexpr (N == 19) { 214| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18] = t; 215| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18); 216| | } 217| | else if constexpr (N == 20) { 218| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19] = t; 219| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19); 220| | } 221| | else if constexpr (N == 21) { 222| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20] = t; 223| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20); 224| | } 225| | else if constexpr (N == 22) { 226| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21] = t; 227| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 228| | p21); 229| | } 230| | else if constexpr (N == 23) { 231| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, 232| | p22] = t; 233| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 234| | p21, p22); 235| | } 236| | else if constexpr (N == 24) { 237| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 238| | p23] = t; 239| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 240| | p21, p22, p23); 241| | } 242| | else if constexpr (N == 25) { 243| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 244| | p23, p24] = t; 245| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 246| | p21, p22, p23, p24); 247| | } 248| | else if constexpr (N == 26) { 249| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 250| | p23, p24, p25] = t; 251| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 252| | p21, p22, p23, p24, p25); 253| | } 254| | else if constexpr (N == 27) { 255| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 256| | p23, p24, p25, p26] = t; 257| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 258| | p21, p22, p23, p24, p25, p26); 259| | } 260| | else if constexpr (N == 28) { 261| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 262| | p23, p24, p25, p26, p27] = t; 263| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 264| | p21, p22, p23, p24, p25, p26, p27); 265| | } 266| | else if constexpr (N == 29) { 267| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 268| | p23, p24, p25, p26, p27, p28] = t; 269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 270| | p21, p22, p23, p24, p25, p26, p27, p28); 271| | } 272| | else if constexpr (N == 30) { 273| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 274| | p23, p24, p25, p26, p27, p28, p29] = t; 275| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 276| | p21, p22, p23, p24, p25, p26, p27, p28, p29); 277| | } 278| | else if constexpr (N == 31) { 279| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 280| | p23, p24, p25, p26, p27, p28, p29, p30] = t; 281| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 282| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30); 283| | } 284| | else if constexpr (N == 32) { 285| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 286| | p23, p24, p25, p26, p27, p28, p29, p30, p31] = t; 287| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 288| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31); 289| | } 290| | else if constexpr (N == 33) { 291| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 292| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32] = t; 293| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 294| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32); 295| | } 296| | else if constexpr (N == 34) { 297| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 298| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33] = t; 299| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 300| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33); 301| | } 302| | else if constexpr (N == 35) { 303| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 304| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34] = t; 305| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 306| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34); 307| | } 308| | else if constexpr (N == 36) { 309| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 310| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35] = t; 311| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 312| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35); 313| | } 314| | else if constexpr (N == 37) { 315| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 316| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36] = t; 317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36); 319| | } 320| | else if constexpr (N == 38) { 321| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 322| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37] = t; 323| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 324| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37); 325| | } 326| | else if constexpr (N == 39) { 327| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 328| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38] = t; 329| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 330| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38); 331| | } 332| | else if constexpr (N == 40) { 333| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 334| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39] = t; 335| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 336| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39); 337| | } 338| | else if constexpr (N == 41) { 339| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 340| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40] = t; 341| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 342| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 343| | p40); 344| | } 345| | else if constexpr (N == 42) { 346| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 347| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41] = t; 348| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 349| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 350| | p40, p41); 351| | } 352| | else if constexpr (N == 43) { 353| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 354| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42] = t; 355| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 356| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 357| | p40, p41, p42); 358| | } 359| | else if constexpr (N == 44) { 360| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 361| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, 362| | p43] = t; 363| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 364| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 365| | p40, p41, p42, p43); 366| | } 367| | else if constexpr (N == 45) { 368| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 369| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 370| | p44] = t; 371| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 372| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 373| | p40, p41, p42, p43, p44); 374| | } 375| | else if constexpr (N == 46) { 376| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 377| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 378| | p44, p45] = t; 379| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 380| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 381| | p40, p41, p42, p43, p44, p45); 382| | } 383| | else if constexpr (N == 47) { 384| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 385| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 386| | p44, p45, p46] = t; 387| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 388| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 389| | p40, p41, p42, p43, p44, p45, p46); 390| | } 391| | else if constexpr (N == 48) { 392| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 393| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 394| | p44, p45, p46, p47] = t; 395| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 396| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 397| | p40, p41, p42, p43, p44, p45, p46, p47); 398| | } 399| | else if constexpr (N == 49) { 400| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 401| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 402| | p44, p45, p46, p47, p48] = t; 403| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 404| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 405| | p40, p41, p42, p43, p44, p45, p46, p47, p48); 406| | } 407| | else if constexpr (N == 50) { 408| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 409| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 410| | p44, p45, p46, p47, p48, p49] = t; 411| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 412| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 413| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49); 414| | } 415| | else if constexpr (N == 51) { 416| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 417| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 418| | p44, p45, p46, p47, p48, p49, p50] = t; 419| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 420| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 421| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50); 422| | } 423| | else if constexpr (N == 52) { 424| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 425| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 426| | p44, p45, p46, p47, p48, p49, p50, p51] = t; 427| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 428| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 429| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51); 430| | } 431| | else if constexpr (N == 53) { 432| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 433| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 434| | p44, p45, p46, p47, p48, p49, p50, p51, p52] = t; 435| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 436| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 437| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52); 438| | } 439| | else if constexpr (N == 54) { 440| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 441| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 442| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53] = t; 443| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 444| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 445| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53); 446| | } 447| | else if constexpr (N == 55) { 448| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 449| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 450| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54] = t; 451| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 452| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 453| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54); 454| | } 455| | else if constexpr (N == 56) { 456| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 457| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 458| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55] = t; 459| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 460| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 461| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55); 462| | } 463| | else if constexpr (N == 57) { 464| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 465| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 466| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56] = t; 467| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 468| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 469| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56); 470| | } 471| | else if constexpr (N == 58) { 472| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 473| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 474| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57] = t; 475| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 476| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 477| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57); 478| | } 479| | else if constexpr (N == 59) { 480| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 481| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 482| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58] = t; 483| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 484| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 485| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58); 486| | } 487| | else if constexpr (N == 60) { 488| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 489| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 490| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59] = t; 491| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 492| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 493| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 494| | p59); 495| | } 496| | else if constexpr (N == 61) { 497| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 498| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 499| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60] = t; 500| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 501| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 502| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 503| | p59, p60); 504| | } 505| | else if constexpr (N == 62) { 506| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 507| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 508| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61] = t; 509| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 510| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 511| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 512| | p59, p60, p61); 513| | } 514| | else if constexpr (N == 63) { 515| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 516| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 517| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62] = t; 518| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 519| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 520| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 521| | p59, p60, p61, p62); 522| | } 523| | else if constexpr (N == 64) { 524| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 525| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 526| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63] = t; 527| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 528| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 529| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 530| | p59, p60, p61, p62, p63); 531| | } 532| | else if constexpr (N == 65) { 533| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 534| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 535| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, 536| | p64] = t; 537| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 538| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 539| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 540| | p59, p60, p61, p62, p63, p64); 541| | } 542| | else if constexpr (N == 66) { 543| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 544| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 545| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 546| | p65] = t; 547| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 548| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 549| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 550| | p59, p60, p61, p62, p63, p64, p65); 551| | } 552| | else if constexpr (N == 67) { 553| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 554| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 555| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 556| | p65, p66] = t; 557| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 558| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 559| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 560| | p59, p60, p61, p62, p63, p64, p65, p66); 561| | } 562| | else if constexpr (N == 68) { 563| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 564| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 565| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 566| | p65, p66, p67] = t; 567| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 568| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 569| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 570| | p59, p60, p61, p62, p63, p64, p65, p66, p67); 571| | } 572| | else if constexpr (N == 69) { 573| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 574| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 575| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 576| | p65, p66, p67, p68] = t; 577| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 578| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 579| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 580| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68); 581| | } 582| | else if constexpr (N == 70) { 583| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 584| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 585| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 586| | p65, p66, p67, p68, p69] = t; 587| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 588| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 589| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 590| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69); 591| | } 592| | else if constexpr (N == 71) { 593| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 594| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 595| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 596| | p65, p66, p67, p68, p69, p70] = t; 597| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 598| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 599| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 600| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70); 601| | } 602| | else if constexpr (N == 72) { 603| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 604| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 605| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 606| | p65, p66, p67, p68, p69, p70, p71] = t; 607| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 608| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 609| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 610| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71); 611| | } 612| | else if constexpr (N == 73) { 613| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 614| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 615| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 616| | p65, p66, p67, p68, p69, p70, p71, p72] = t; 617| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 618| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 619| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 620| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72); 621| | } 622| | else if constexpr (N == 74) { 623| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 624| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 625| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 626| | p65, p66, p67, p68, p69, p70, p71, p72, p73] = t; 627| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 628| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 629| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 630| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73); 631| | } 632| | else if constexpr (N == 75) { 633| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 634| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 635| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 636| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74] = t; 637| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 638| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 639| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 640| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74); 641| | } 642| | else if constexpr (N == 76) { 643| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 644| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 645| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 646| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75] = t; 647| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 648| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 649| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 650| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75); 651| | } 652| | else if constexpr (N == 77) { 653| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 654| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 655| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 656| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76] = t; 657| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 658| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 659| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 660| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76); 661| | } 662| | else if constexpr (N == 78) { 663| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 664| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 665| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 666| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77] = t; 667| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 668| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 669| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 670| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77); 671| | } 672| | else if constexpr (N == 79) { 673| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 674| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 675| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 676| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78] = t; 677| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 678| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 679| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 680| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 681| | p78); 682| | } 683| | else if constexpr (N == 80) { 684| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 685| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 686| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 687| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79] = t; 688| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 689| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 690| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 691| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 692| | p78, p79); 693| | } 694| | else if constexpr (N == 81) { 695| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 696| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 697| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 698| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80] = t; 699| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 700| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 701| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 702| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 703| | p78, p79, p80); 704| | } 705| | else if constexpr (N == 82) { 706| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 707| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 708| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 709| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81] = t; 710| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 711| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 712| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 713| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 714| | p78, p79, p80, p81); 715| | } 716| | else if constexpr (N == 83) { 717| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 718| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 719| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 720| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82] = t; 721| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 722| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 723| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 724| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 725| | p78, p79, p80, p81, p82); 726| | } 727| | else if constexpr (N == 84) { 728| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 729| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 730| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 731| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83] = t; 732| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 733| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 734| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 735| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 736| | p78, p79, p80, p81, p82, p83); 737| | } 738| | else if constexpr (N == 85) { 739| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 740| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 741| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 742| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84] = t; 743| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 744| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 745| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 746| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 747| | p78, p79, p80, p81, p82, p83, p84); 748| | } 749| | else if constexpr (N == 86) { 750| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 751| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 752| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 753| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, 754| | p85] = t; 755| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 756| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 757| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 758| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 759| | p78, p79, p80, p81, p82, p83, p84, p85); 760| | } 761| | else if constexpr (N == 87) { 762| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 763| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 764| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 765| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 766| | p86] = t; 767| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 768| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 769| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 770| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 771| | p78, p79, p80, p81, p82, p83, p84, p85, p86); 772| | } 773| | else if constexpr (N == 88) { 774| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 775| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 776| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 777| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 778| | p86, p87] = t; 779| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 780| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 781| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 782| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 783| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87); 784| | } 785| | else if constexpr (N == 89) { 786| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 787| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 788| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 789| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 790| | p86, p87, p88] = t; 791| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 792| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 793| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 794| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 795| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88); 796| | } 797| | else if constexpr (N == 90) { 798| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 799| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 800| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 801| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 802| | p86, p87, p88, p89] = t; 803| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 804| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 805| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 806| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 807| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89); 808| | } 809| | else if constexpr (N == 91) { 810| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 811| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 812| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 813| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 814| | p86, p87, p88, p89, p90] = t; 815| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 816| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 817| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 818| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 819| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90); 820| | } 821| | else if constexpr (N == 92) { 822| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 823| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 824| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 825| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 826| | p86, p87, p88, p89, p90, p91] = t; 827| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 828| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 829| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 830| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 831| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91); 832| | } 833| | else if constexpr (N == 93) { 834| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 835| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 836| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 837| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 838| | p86, p87, p88, p89, p90, p91, p92] = t; 839| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 840| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 841| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 842| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 843| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92); 844| | } 845| | else if constexpr (N == 94) { 846| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 847| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 848| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 849| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 850| | p86, p87, p88, p89, p90, p91, p92, p93] = t; 851| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 852| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 853| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 854| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 855| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93); 856| | } 857| | else if constexpr (N == 95) { 858| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 859| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 860| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 861| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 862| | p86, p87, p88, p89, p90, p91, p92, p93, p94] = t; 863| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 864| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 865| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 866| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 867| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94); 868| | } 869| | else if constexpr (N == 96) { 870| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 871| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 872| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 873| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 874| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95] = t; 875| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 876| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 877| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 878| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 879| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95); 880| | } 881| | else if constexpr (N == 97) { 882| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 883| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 884| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 885| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 886| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96] = t; 887| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 888| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 889| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 890| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 891| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96); 892| | } 893| | else if constexpr (N == 98) { 894| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 895| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 896| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 897| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 898| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97] = t; 899| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 900| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 901| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 902| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 903| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 904| | p97); 905| | } 906| | else if constexpr (N == 99) { 907| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 908| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 909| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 910| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 911| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98] = t; 912| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 913| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 914| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 915| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 916| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 917| | p97, p98); 918| | } 919| | else if constexpr (N == 100) { 920| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 921| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 922| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 923| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 924| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99] = t; 925| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 926| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 927| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 928| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 929| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 930| | p97, p98, p99); 931| | } 932| | else if constexpr (N == 101) { 933| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 934| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 935| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 936| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 937| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100] = t; 938| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 939| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 940| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 941| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 942| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 943| | p97, p98, p99, p100); 944| | } 945| | else if constexpr (N == 102) { 946| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 947| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 948| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 949| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 950| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101] = t; 951| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 952| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 953| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 954| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 955| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 956| | p97, p98, p99, p100, p101); 957| | } 958| | else if constexpr (N == 103) { 959| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 960| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 961| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 962| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 963| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102] = t; 964| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 965| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 966| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 967| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 968| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 969| | p97, p98, p99, p100, p101, p102); 970| | } 971| | else if constexpr (N == 104) { 972| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 973| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 974| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 975| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 976| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103] = t; 977| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 978| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 979| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 980| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 981| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 982| | p97, p98, p99, p100, p101, p102, p103); 983| | } 984| | else if constexpr (N == 105) { 985| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 986| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 987| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 988| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 989| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104] = t; 990| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 991| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 992| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 993| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 994| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 995| | p97, p98, p99, p100, p101, p102, p103, p104); 996| | } 997| | else if constexpr (N == 106) { 998| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 999| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1000| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1001| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1002| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1003| | p105] = t; 1004| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1005| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1006| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1007| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1008| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1009| | p97, p98, p99, p100, p101, p102, p103, p104, p105); 1010| | } 1011| | else if constexpr (N == 107) { 1012| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1013| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1014| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1015| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1016| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1017| | p105, p106] = t; 1018| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1019| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1020| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1021| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1022| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1023| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106); 1024| | } 1025| | else if constexpr (N == 108) { 1026| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1027| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1028| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1029| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1030| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1031| | p105, p106, p107] = t; 1032| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1033| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1034| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1035| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1036| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1037| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107); 1038| | } 1039| | else if constexpr (N == 109) { 1040| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1041| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1042| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1043| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1044| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1045| | p105, p106, p107, p108] = t; 1046| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1047| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1048| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1049| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1050| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1051| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108); 1052| | } 1053| | else if constexpr (N == 110) { 1054| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1055| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1056| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1057| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1058| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1059| | p105, p106, p107, p108, p109] = t; 1060| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1061| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1062| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1063| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1064| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1065| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109); 1066| | } 1067| | else if constexpr (N == 111) { 1068| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1069| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1070| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1071| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1072| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1073| | p105, p106, p107, p108, p109, p110] = t; 1074| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1075| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1076| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1077| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1078| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1079| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110); 1080| | } 1081| | else if constexpr (N == 112) { 1082| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1083| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1084| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1085| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1086| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1087| | p105, p106, p107, p108, p109, p110, p111] = t; 1088| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1089| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1090| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1091| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1092| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1093| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111); 1094| | } 1095| | else if constexpr (N == 113) { 1096| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1097| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1098| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1099| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1100| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1101| | p105, p106, p107, p108, p109, p110, p111, p112] = t; 1102| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1103| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1104| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1105| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1106| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1107| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112); 1108| | } 1109| | else if constexpr (N == 114) { 1110| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1111| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1112| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1113| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1114| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1115| | p105, p106, p107, p108, p109, p110, p111, p112, p113] = t; 1116| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1117| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1118| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1119| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1120| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1121| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1122| | p113); 1123| | } 1124| | else if constexpr (N == 115) { 1125| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1126| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1127| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1128| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1129| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1130| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114] = t; 1131| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1132| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1133| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1134| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1135| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1136| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1137| | p113, p114); 1138| | } 1139| | else if constexpr (N == 116) { 1140| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1141| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1142| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1143| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1144| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1145| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115] = t; 1146| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1147| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1148| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1149| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1150| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1151| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1152| | p113, p114, p115); 1153| | } 1154| | else if constexpr (N == 117) { 1155| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1156| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1157| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1158| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1159| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1160| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116] = t; 1161| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1162| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1163| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1164| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1165| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1166| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1167| | p113, p114, p115, p116); 1168| | } 1169| | else if constexpr (N == 118) { 1170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1171| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1172| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1173| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1174| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1175| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117] = t; 1176| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1177| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1178| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1179| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1180| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1181| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1182| | p113, p114, p115, p116, p117); 1183| | } 1184| | else if constexpr (N == 119) { 1185| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1186| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1187| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1188| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1189| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1190| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118] = t; 1191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1192| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1193| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1194| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1195| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1196| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1197| | p113, p114, p115, p116, p117, p118); 1198| | } 1199| | else if constexpr (N == 120) { 1200| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1201| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1202| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1203| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1204| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1205| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119] = t; 1206| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1207| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1208| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1209| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1210| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1211| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1212| | p113, p114, p115, p116, p117, p118, p119); 1213| | } 1214| | else if constexpr (N == 121) { 1215| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1216| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1217| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1218| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1219| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1220| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120] = t; 1221| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1222| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1223| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1224| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1225| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1226| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1227| | p113, p114, p115, p116, p117, p118, p119, p120); 1228| | } 1229| | else if constexpr (N == 122) { 1230| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1231| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1232| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1233| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1234| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1235| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121] = 1236| | t; 1237| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1238| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1239| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1240| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1241| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1242| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1243| | p113, p114, p115, p116, p117, p118, p119, p120, p121); 1244| | } 1245| | else if constexpr (N == 123) { 1246| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1247| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1248| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1249| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1250| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1251| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1252| | p122] = t; 1253| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1254| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1255| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1256| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1257| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1258| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1259| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122); 1260| | } 1261| | else if constexpr (N == 124) { 1262| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1263| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1264| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1265| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1266| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1267| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1268| | p122, p123] = t; 1269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1270| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1271| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1272| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1273| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1274| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1275| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123); 1276| | } 1277| | else if constexpr (N == 125) { 1278| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1279| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1280| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1281| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1282| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1283| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1284| | p122, p123, p124] = t; 1285| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1286| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1287| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1288| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1289| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1290| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1291| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124); 1292| | } 1293| | else if constexpr (N == 126) { 1294| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1295| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1296| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1297| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1298| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1299| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1300| | p122, p123, p124, p125] = t; 1301| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1302| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1303| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1304| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1305| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1306| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1307| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125); 1308| | } 1309| | else if constexpr (N == 127) { 1310| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1311| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1312| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1313| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1314| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1315| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1316| | p122, p123, p124, p125, p126] = t; 1317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1319| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1320| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1321| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1322| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1323| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126); 1324| | } 1325| | else if constexpr (N == 128) { 1326| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1327| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1328| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1329| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1330| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1331| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1332| | p122, p123, p124, p125, p126, p127] = t; 1333| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1334| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1335| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1336| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1337| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1338| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1339| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126, p127); 1340| | } 1341| 375k| } _ZN3glz6to_tieIRN9repe_fuzz8fuzz_apiELm13EQleT0_L_ZNS_6detail25max_pure_reflection_countEEEEDcOT_: 137| 402k| { 138| | if constexpr (N == 0) { 139| | return tuple{}; 140| | } 141| | else if constexpr (N == 1) { 142| | auto& [p] = t; 143| | return glz::tie(p); 144| | } 145| | else if constexpr (N == 2) { 146| | auto& [p0, p1] = t; 147| | return glz::tie(p0, p1); 148| | } 149| | else if constexpr (N == 3) { 150| | auto& [p0, p1, p2] = t; 151| | return glz::tie(p0, p1, p2); 152| | } 153| | else if constexpr (N == 4) { 154| | auto& [p0, p1, p2, p3] = t; 155| | return glz::tie(p0, p1, p2, p3); 156| | } 157| | else if constexpr (N == 5) { 158| | auto& [p0, p1, p2, p3, p4] = t; 159| | return glz::tie(p0, p1, p2, p3, p4); 160| | } 161| | else if constexpr (N == 6) { 162| | auto& [p0, p1, p2, p3, p4, p5] = t; 163| | return glz::tie(p0, p1, p2, p3, p4, p5); 164| | } 165| | else if constexpr (N == 7) { 166| | auto& [p0, p1, p2, p3, p4, p5, p6] = t; 167| | return glz::tie(p0, p1, p2, p3, p4, p5, p6); 168| | } 169| | else if constexpr (N == 8) { 170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7] = t; 171| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7); 172| | } 173| | else if constexpr (N == 9) { 174| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8] = t; 175| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8); 176| | } 177| | else if constexpr (N == 10) { 178| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9] = t; 179| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); 180| | } 181| | else if constexpr (N == 11) { 182| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10] = t; 183| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10); 184| | } 185| | else if constexpr (N == 12) { 186| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11] = t; 187| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11); 188| | } 189| 402k| else if constexpr (N == 13) { 190| 402k| auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12] = t; 191| 402k| return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12); 192| | } 193| | else if constexpr (N == 14) { 194| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13] = t; 195| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13); 196| | } 197| | else if constexpr (N == 15) { 198| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14] = t; 199| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14); 200| | } 201| | else if constexpr (N == 16) { 202| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15] = t; 203| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15); 204| | } 205| | else if constexpr (N == 17) { 206| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16] = t; 207| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16); 208| | } 209| | else if constexpr (N == 18) { 210| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17] = t; 211| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17); 212| | } 213| | else if constexpr (N == 19) { 214| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18] = t; 215| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18); 216| | } 217| | else if constexpr (N == 20) { 218| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19] = t; 219| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19); 220| | } 221| | else if constexpr (N == 21) { 222| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20] = t; 223| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20); 224| | } 225| | else if constexpr (N == 22) { 226| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21] = t; 227| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 228| | p21); 229| | } 230| | else if constexpr (N == 23) { 231| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, 232| | p22] = t; 233| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 234| | p21, p22); 235| | } 236| | else if constexpr (N == 24) { 237| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 238| | p23] = t; 239| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 240| | p21, p22, p23); 241| | } 242| | else if constexpr (N == 25) { 243| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 244| | p23, p24] = t; 245| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 246| | p21, p22, p23, p24); 247| | } 248| | else if constexpr (N == 26) { 249| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 250| | p23, p24, p25] = t; 251| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 252| | p21, p22, p23, p24, p25); 253| | } 254| | else if constexpr (N == 27) { 255| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 256| | p23, p24, p25, p26] = t; 257| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 258| | p21, p22, p23, p24, p25, p26); 259| | } 260| | else if constexpr (N == 28) { 261| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 262| | p23, p24, p25, p26, p27] = t; 263| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 264| | p21, p22, p23, p24, p25, p26, p27); 265| | } 266| | else if constexpr (N == 29) { 267| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 268| | p23, p24, p25, p26, p27, p28] = t; 269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 270| | p21, p22, p23, p24, p25, p26, p27, p28); 271| | } 272| | else if constexpr (N == 30) { 273| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 274| | p23, p24, p25, p26, p27, p28, p29] = t; 275| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 276| | p21, p22, p23, p24, p25, p26, p27, p28, p29); 277| | } 278| | else if constexpr (N == 31) { 279| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 280| | p23, p24, p25, p26, p27, p28, p29, p30] = t; 281| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 282| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30); 283| | } 284| | else if constexpr (N == 32) { 285| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 286| | p23, p24, p25, p26, p27, p28, p29, p30, p31] = t; 287| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 288| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31); 289| | } 290| | else if constexpr (N == 33) { 291| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 292| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32] = t; 293| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 294| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32); 295| | } 296| | else if constexpr (N == 34) { 297| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 298| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33] = t; 299| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 300| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33); 301| | } 302| | else if constexpr (N == 35) { 303| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 304| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34] = t; 305| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 306| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34); 307| | } 308| | else if constexpr (N == 36) { 309| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 310| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35] = t; 311| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 312| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35); 313| | } 314| | else if constexpr (N == 37) { 315| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 316| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36] = t; 317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36); 319| | } 320| | else if constexpr (N == 38) { 321| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 322| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37] = t; 323| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 324| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37); 325| | } 326| | else if constexpr (N == 39) { 327| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 328| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38] = t; 329| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 330| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38); 331| | } 332| | else if constexpr (N == 40) { 333| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 334| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39] = t; 335| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 336| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39); 337| | } 338| | else if constexpr (N == 41) { 339| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 340| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40] = t; 341| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 342| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 343| | p40); 344| | } 345| | else if constexpr (N == 42) { 346| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 347| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41] = t; 348| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 349| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 350| | p40, p41); 351| | } 352| | else if constexpr (N == 43) { 353| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 354| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42] = t; 355| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 356| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 357| | p40, p41, p42); 358| | } 359| | else if constexpr (N == 44) { 360| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 361| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, 362| | p43] = t; 363| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 364| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 365| | p40, p41, p42, p43); 366| | } 367| | else if constexpr (N == 45) { 368| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 369| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 370| | p44] = t; 371| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 372| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 373| | p40, p41, p42, p43, p44); 374| | } 375| | else if constexpr (N == 46) { 376| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 377| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 378| | p44, p45] = t; 379| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 380| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 381| | p40, p41, p42, p43, p44, p45); 382| | } 383| | else if constexpr (N == 47) { 384| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 385| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 386| | p44, p45, p46] = t; 387| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 388| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 389| | p40, p41, p42, p43, p44, p45, p46); 390| | } 391| | else if constexpr (N == 48) { 392| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 393| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 394| | p44, p45, p46, p47] = t; 395| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 396| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 397| | p40, p41, p42, p43, p44, p45, p46, p47); 398| | } 399| | else if constexpr (N == 49) { 400| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 401| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 402| | p44, p45, p46, p47, p48] = t; 403| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 404| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 405| | p40, p41, p42, p43, p44, p45, p46, p47, p48); 406| | } 407| | else if constexpr (N == 50) { 408| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 409| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 410| | p44, p45, p46, p47, p48, p49] = t; 411| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 412| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 413| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49); 414| | } 415| | else if constexpr (N == 51) { 416| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 417| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 418| | p44, p45, p46, p47, p48, p49, p50] = t; 419| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 420| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 421| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50); 422| | } 423| | else if constexpr (N == 52) { 424| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 425| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 426| | p44, p45, p46, p47, p48, p49, p50, p51] = t; 427| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 428| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 429| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51); 430| | } 431| | else if constexpr (N == 53) { 432| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 433| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 434| | p44, p45, p46, p47, p48, p49, p50, p51, p52] = t; 435| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 436| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 437| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52); 438| | } 439| | else if constexpr (N == 54) { 440| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 441| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 442| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53] = t; 443| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 444| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 445| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53); 446| | } 447| | else if constexpr (N == 55) { 448| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 449| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 450| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54] = t; 451| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 452| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 453| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54); 454| | } 455| | else if constexpr (N == 56) { 456| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 457| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 458| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55] = t; 459| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 460| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 461| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55); 462| | } 463| | else if constexpr (N == 57) { 464| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 465| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 466| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56] = t; 467| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 468| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 469| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56); 470| | } 471| | else if constexpr (N == 58) { 472| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 473| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 474| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57] = t; 475| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 476| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 477| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57); 478| | } 479| | else if constexpr (N == 59) { 480| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 481| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 482| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58] = t; 483| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 484| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 485| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58); 486| | } 487| | else if constexpr (N == 60) { 488| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 489| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 490| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59] = t; 491| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 492| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 493| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 494| | p59); 495| | } 496| | else if constexpr (N == 61) { 497| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 498| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 499| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60] = t; 500| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 501| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 502| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 503| | p59, p60); 504| | } 505| | else if constexpr (N == 62) { 506| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 507| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 508| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61] = t; 509| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 510| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 511| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 512| | p59, p60, p61); 513| | } 514| | else if constexpr (N == 63) { 515| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 516| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 517| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62] = t; 518| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 519| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 520| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 521| | p59, p60, p61, p62); 522| | } 523| | else if constexpr (N == 64) { 524| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 525| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 526| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63] = t; 527| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 528| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 529| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 530| | p59, p60, p61, p62, p63); 531| | } 532| | else if constexpr (N == 65) { 533| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 534| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 535| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, 536| | p64] = t; 537| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 538| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 539| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 540| | p59, p60, p61, p62, p63, p64); 541| | } 542| | else if constexpr (N == 66) { 543| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 544| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 545| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 546| | p65] = t; 547| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 548| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 549| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 550| | p59, p60, p61, p62, p63, p64, p65); 551| | } 552| | else if constexpr (N == 67) { 553| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 554| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 555| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 556| | p65, p66] = t; 557| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 558| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 559| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 560| | p59, p60, p61, p62, p63, p64, p65, p66); 561| | } 562| | else if constexpr (N == 68) { 563| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 564| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 565| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 566| | p65, p66, p67] = t; 567| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 568| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 569| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 570| | p59, p60, p61, p62, p63, p64, p65, p66, p67); 571| | } 572| | else if constexpr (N == 69) { 573| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 574| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 575| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 576| | p65, p66, p67, p68] = t; 577| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 578| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 579| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 580| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68); 581| | } 582| | else if constexpr (N == 70) { 583| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 584| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 585| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 586| | p65, p66, p67, p68, p69] = t; 587| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 588| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 589| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 590| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69); 591| | } 592| | else if constexpr (N == 71) { 593| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 594| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 595| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 596| | p65, p66, p67, p68, p69, p70] = t; 597| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 598| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 599| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 600| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70); 601| | } 602| | else if constexpr (N == 72) { 603| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 604| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 605| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 606| | p65, p66, p67, p68, p69, p70, p71] = t; 607| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 608| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 609| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 610| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71); 611| | } 612| | else if constexpr (N == 73) { 613| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 614| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 615| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 616| | p65, p66, p67, p68, p69, p70, p71, p72] = t; 617| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 618| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 619| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 620| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72); 621| | } 622| | else if constexpr (N == 74) { 623| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 624| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 625| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 626| | p65, p66, p67, p68, p69, p70, p71, p72, p73] = t; 627| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 628| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 629| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 630| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73); 631| | } 632| | else if constexpr (N == 75) { 633| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 634| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 635| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 636| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74] = t; 637| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 638| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 639| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 640| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74); 641| | } 642| | else if constexpr (N == 76) { 643| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 644| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 645| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 646| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75] = t; 647| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 648| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 649| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 650| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75); 651| | } 652| | else if constexpr (N == 77) { 653| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 654| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 655| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 656| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76] = t; 657| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 658| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 659| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 660| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76); 661| | } 662| | else if constexpr (N == 78) { 663| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 664| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 665| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 666| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77] = t; 667| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 668| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 669| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 670| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77); 671| | } 672| | else if constexpr (N == 79) { 673| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 674| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 675| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 676| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78] = t; 677| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 678| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 679| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 680| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 681| | p78); 682| | } 683| | else if constexpr (N == 80) { 684| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 685| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 686| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 687| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79] = t; 688| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 689| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 690| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 691| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 692| | p78, p79); 693| | } 694| | else if constexpr (N == 81) { 695| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 696| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 697| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 698| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80] = t; 699| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 700| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 701| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 702| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 703| | p78, p79, p80); 704| | } 705| | else if constexpr (N == 82) { 706| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 707| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 708| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 709| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81] = t; 710| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 711| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 712| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 713| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 714| | p78, p79, p80, p81); 715| | } 716| | else if constexpr (N == 83) { 717| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 718| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 719| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 720| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82] = t; 721| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 722| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 723| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 724| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 725| | p78, p79, p80, p81, p82); 726| | } 727| | else if constexpr (N == 84) { 728| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 729| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 730| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 731| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83] = t; 732| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 733| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 734| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 735| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 736| | p78, p79, p80, p81, p82, p83); 737| | } 738| | else if constexpr (N == 85) { 739| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 740| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 741| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 742| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84] = t; 743| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 744| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 745| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 746| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 747| | p78, p79, p80, p81, p82, p83, p84); 748| | } 749| | else if constexpr (N == 86) { 750| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 751| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 752| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 753| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, 754| | p85] = t; 755| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 756| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 757| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 758| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 759| | p78, p79, p80, p81, p82, p83, p84, p85); 760| | } 761| | else if constexpr (N == 87) { 762| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 763| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 764| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 765| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 766| | p86] = t; 767| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 768| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 769| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 770| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 771| | p78, p79, p80, p81, p82, p83, p84, p85, p86); 772| | } 773| | else if constexpr (N == 88) { 774| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 775| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 776| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 777| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 778| | p86, p87] = t; 779| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 780| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 781| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 782| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 783| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87); 784| | } 785| | else if constexpr (N == 89) { 786| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 787| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 788| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 789| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 790| | p86, p87, p88] = t; 791| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 792| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 793| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 794| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 795| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88); 796| | } 797| | else if constexpr (N == 90) { 798| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 799| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 800| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 801| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 802| | p86, p87, p88, p89] = t; 803| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 804| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 805| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 806| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 807| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89); 808| | } 809| | else if constexpr (N == 91) { 810| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 811| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 812| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 813| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 814| | p86, p87, p88, p89, p90] = t; 815| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 816| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 817| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 818| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 819| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90); 820| | } 821| | else if constexpr (N == 92) { 822| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 823| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 824| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 825| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 826| | p86, p87, p88, p89, p90, p91] = t; 827| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 828| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 829| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 830| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 831| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91); 832| | } 833| | else if constexpr (N == 93) { 834| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 835| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 836| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 837| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 838| | p86, p87, p88, p89, p90, p91, p92] = t; 839| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 840| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 841| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 842| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 843| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92); 844| | } 845| | else if constexpr (N == 94) { 846| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 847| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 848| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 849| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 850| | p86, p87, p88, p89, p90, p91, p92, p93] = t; 851| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 852| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 853| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 854| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 855| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93); 856| | } 857| | else if constexpr (N == 95) { 858| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 859| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 860| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 861| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 862| | p86, p87, p88, p89, p90, p91, p92, p93, p94] = t; 863| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 864| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 865| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 866| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 867| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94); 868| | } 869| | else if constexpr (N == 96) { 870| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 871| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 872| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 873| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 874| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95] = t; 875| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 876| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 877| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 878| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 879| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95); 880| | } 881| | else if constexpr (N == 97) { 882| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 883| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 884| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 885| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 886| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96] = t; 887| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 888| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 889| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 890| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 891| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96); 892| | } 893| | else if constexpr (N == 98) { 894| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 895| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 896| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 897| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 898| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97] = t; 899| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 900| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 901| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 902| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 903| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 904| | p97); 905| | } 906| | else if constexpr (N == 99) { 907| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 908| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 909| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 910| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 911| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98] = t; 912| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 913| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 914| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 915| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 916| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 917| | p97, p98); 918| | } 919| | else if constexpr (N == 100) { 920| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 921| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 922| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 923| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 924| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99] = t; 925| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 926| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 927| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 928| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 929| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 930| | p97, p98, p99); 931| | } 932| | else if constexpr (N == 101) { 933| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 934| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 935| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 936| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 937| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100] = t; 938| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 939| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 940| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 941| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 942| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 943| | p97, p98, p99, p100); 944| | } 945| | else if constexpr (N == 102) { 946| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 947| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 948| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 949| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 950| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101] = t; 951| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 952| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 953| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 954| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 955| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 956| | p97, p98, p99, p100, p101); 957| | } 958| | else if constexpr (N == 103) { 959| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 960| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 961| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 962| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 963| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102] = t; 964| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 965| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 966| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 967| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 968| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 969| | p97, p98, p99, p100, p101, p102); 970| | } 971| | else if constexpr (N == 104) { 972| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 973| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 974| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 975| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 976| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103] = t; 977| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 978| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 979| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 980| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 981| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 982| | p97, p98, p99, p100, p101, p102, p103); 983| | } 984| | else if constexpr (N == 105) { 985| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 986| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 987| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 988| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 989| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104] = t; 990| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 991| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 992| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 993| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 994| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 995| | p97, p98, p99, p100, p101, p102, p103, p104); 996| | } 997| | else if constexpr (N == 106) { 998| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 999| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1000| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1001| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1002| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1003| | p105] = t; 1004| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1005| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1006| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1007| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1008| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1009| | p97, p98, p99, p100, p101, p102, p103, p104, p105); 1010| | } 1011| | else if constexpr (N == 107) { 1012| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1013| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1014| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1015| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1016| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1017| | p105, p106] = t; 1018| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1019| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1020| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1021| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1022| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1023| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106); 1024| | } 1025| | else if constexpr (N == 108) { 1026| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1027| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1028| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1029| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1030| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1031| | p105, p106, p107] = t; 1032| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1033| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1034| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1035| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1036| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1037| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107); 1038| | } 1039| | else if constexpr (N == 109) { 1040| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1041| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1042| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1043| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1044| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1045| | p105, p106, p107, p108] = t; 1046| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1047| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1048| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1049| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1050| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1051| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108); 1052| | } 1053| | else if constexpr (N == 110) { 1054| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1055| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1056| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1057| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1058| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1059| | p105, p106, p107, p108, p109] = t; 1060| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1061| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1062| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1063| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1064| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1065| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109); 1066| | } 1067| | else if constexpr (N == 111) { 1068| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1069| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1070| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1071| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1072| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1073| | p105, p106, p107, p108, p109, p110] = t; 1074| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1075| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1076| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1077| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1078| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1079| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110); 1080| | } 1081| | else if constexpr (N == 112) { 1082| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1083| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1084| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1085| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1086| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1087| | p105, p106, p107, p108, p109, p110, p111] = t; 1088| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1089| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1090| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1091| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1092| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1093| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111); 1094| | } 1095| | else if constexpr (N == 113) { 1096| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1097| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1098| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1099| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1100| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1101| | p105, p106, p107, p108, p109, p110, p111, p112] = t; 1102| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1103| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1104| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1105| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1106| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1107| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112); 1108| | } 1109| | else if constexpr (N == 114) { 1110| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1111| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1112| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1113| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1114| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1115| | p105, p106, p107, p108, p109, p110, p111, p112, p113] = t; 1116| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1117| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1118| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1119| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1120| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1121| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1122| | p113); 1123| | } 1124| | else if constexpr (N == 115) { 1125| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1126| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1127| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1128| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1129| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1130| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114] = t; 1131| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1132| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1133| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1134| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1135| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1136| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1137| | p113, p114); 1138| | } 1139| | else if constexpr (N == 116) { 1140| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1141| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1142| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1143| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1144| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1145| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115] = t; 1146| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1147| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1148| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1149| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1150| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1151| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1152| | p113, p114, p115); 1153| | } 1154| | else if constexpr (N == 117) { 1155| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1156| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1157| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1158| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1159| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1160| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116] = t; 1161| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1162| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1163| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1164| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1165| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1166| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1167| | p113, p114, p115, p116); 1168| | } 1169| | else if constexpr (N == 118) { 1170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1171| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1172| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1173| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1174| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1175| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117] = t; 1176| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1177| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1178| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1179| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1180| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1181| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1182| | p113, p114, p115, p116, p117); 1183| | } 1184| | else if constexpr (N == 119) { 1185| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1186| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1187| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1188| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1189| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1190| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118] = t; 1191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1192| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1193| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1194| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1195| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1196| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1197| | p113, p114, p115, p116, p117, p118); 1198| | } 1199| | else if constexpr (N == 120) { 1200| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1201| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1202| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1203| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1204| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1205| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119] = t; 1206| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1207| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1208| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1209| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1210| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1211| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1212| | p113, p114, p115, p116, p117, p118, p119); 1213| | } 1214| | else if constexpr (N == 121) { 1215| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1216| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1217| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1218| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1219| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1220| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120] = t; 1221| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1222| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1223| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1224| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1225| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1226| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1227| | p113, p114, p115, p116, p117, p118, p119, p120); 1228| | } 1229| | else if constexpr (N == 122) { 1230| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1231| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1232| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1233| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1234| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1235| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121] = 1236| | t; 1237| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1238| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1239| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1240| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1241| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1242| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1243| | p113, p114, p115, p116, p117, p118, p119, p120, p121); 1244| | } 1245| | else if constexpr (N == 123) { 1246| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1247| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1248| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1249| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1250| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1251| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1252| | p122] = t; 1253| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1254| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1255| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1256| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1257| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1258| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1259| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122); 1260| | } 1261| | else if constexpr (N == 124) { 1262| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1263| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1264| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1265| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1266| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1267| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1268| | p122, p123] = t; 1269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1270| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1271| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1272| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1273| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1274| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1275| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123); 1276| | } 1277| | else if constexpr (N == 125) { 1278| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1279| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1280| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1281| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1282| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1283| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1284| | p122, p123, p124] = t; 1285| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1286| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1287| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1288| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1289| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1290| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1291| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124); 1292| | } 1293| | else if constexpr (N == 126) { 1294| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1295| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1296| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1297| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1298| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1299| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1300| | p122, p123, p124, p125] = t; 1301| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1302| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1303| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1304| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1305| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1306| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1307| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125); 1308| | } 1309| | else if constexpr (N == 127) { 1310| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1311| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1312| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1313| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1314| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1315| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1316| | p122, p123, p124, p125, p126] = t; 1317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1319| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1320| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1321| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1322| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1323| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126); 1324| | } 1325| | else if constexpr (N == 128) { 1326| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1327| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1328| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1329| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1330| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1331| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1332| | p122, p123, p124, p125, p126, p127] = t; 1333| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1334| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1335| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1336| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1337| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1338| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1339| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126, p127); 1340| | } 1341| 402k| } _ZN3glz6to_tieIRN9repe_fuzz6amountELm1EQleT0_L_ZNS_6detail25max_pure_reflection_countEEEEDcOT_: 137| 11.0k| { 138| | if constexpr (N == 0) { 139| | return tuple{}; 140| | } 141| 11.0k| else if constexpr (N == 1) { 142| 11.0k| auto& [p] = t; 143| 11.0k| return glz::tie(p); 144| | } 145| | else if constexpr (N == 2) { 146| | auto& [p0, p1] = t; 147| | return glz::tie(p0, p1); 148| | } 149| | else if constexpr (N == 3) { 150| | auto& [p0, p1, p2] = t; 151| | return glz::tie(p0, p1, p2); 152| | } 153| | else if constexpr (N == 4) { 154| | auto& [p0, p1, p2, p3] = t; 155| | return glz::tie(p0, p1, p2, p3); 156| | } 157| | else if constexpr (N == 5) { 158| | auto& [p0, p1, p2, p3, p4] = t; 159| | return glz::tie(p0, p1, p2, p3, p4); 160| | } 161| | else if constexpr (N == 6) { 162| | auto& [p0, p1, p2, p3, p4, p5] = t; 163| | return glz::tie(p0, p1, p2, p3, p4, p5); 164| | } 165| | else if constexpr (N == 7) { 166| | auto& [p0, p1, p2, p3, p4, p5, p6] = t; 167| | return glz::tie(p0, p1, p2, p3, p4, p5, p6); 168| | } 169| | else if constexpr (N == 8) { 170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7] = t; 171| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7); 172| | } 173| | else if constexpr (N == 9) { 174| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8] = t; 175| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8); 176| | } 177| | else if constexpr (N == 10) { 178| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9] = t; 179| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); 180| | } 181| | else if constexpr (N == 11) { 182| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10] = t; 183| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10); 184| | } 185| | else if constexpr (N == 12) { 186| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11] = t; 187| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11); 188| | } 189| | else if constexpr (N == 13) { 190| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12] = t; 191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12); 192| | } 193| | else if constexpr (N == 14) { 194| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13] = t; 195| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13); 196| | } 197| | else if constexpr (N == 15) { 198| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14] = t; 199| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14); 200| | } 201| | else if constexpr (N == 16) { 202| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15] = t; 203| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15); 204| | } 205| | else if constexpr (N == 17) { 206| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16] = t; 207| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16); 208| | } 209| | else if constexpr (N == 18) { 210| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17] = t; 211| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17); 212| | } 213| | else if constexpr (N == 19) { 214| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18] = t; 215| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18); 216| | } 217| | else if constexpr (N == 20) { 218| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19] = t; 219| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19); 220| | } 221| | else if constexpr (N == 21) { 222| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20] = t; 223| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20); 224| | } 225| | else if constexpr (N == 22) { 226| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21] = t; 227| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 228| | p21); 229| | } 230| | else if constexpr (N == 23) { 231| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, 232| | p22] = t; 233| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 234| | p21, p22); 235| | } 236| | else if constexpr (N == 24) { 237| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 238| | p23] = t; 239| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 240| | p21, p22, p23); 241| | } 242| | else if constexpr (N == 25) { 243| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 244| | p23, p24] = t; 245| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 246| | p21, p22, p23, p24); 247| | } 248| | else if constexpr (N == 26) { 249| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 250| | p23, p24, p25] = t; 251| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 252| | p21, p22, p23, p24, p25); 253| | } 254| | else if constexpr (N == 27) { 255| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 256| | p23, p24, p25, p26] = t; 257| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 258| | p21, p22, p23, p24, p25, p26); 259| | } 260| | else if constexpr (N == 28) { 261| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 262| | p23, p24, p25, p26, p27] = t; 263| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 264| | p21, p22, p23, p24, p25, p26, p27); 265| | } 266| | else if constexpr (N == 29) { 267| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 268| | p23, p24, p25, p26, p27, p28] = t; 269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 270| | p21, p22, p23, p24, p25, p26, p27, p28); 271| | } 272| | else if constexpr (N == 30) { 273| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 274| | p23, p24, p25, p26, p27, p28, p29] = t; 275| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 276| | p21, p22, p23, p24, p25, p26, p27, p28, p29); 277| | } 278| | else if constexpr (N == 31) { 279| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 280| | p23, p24, p25, p26, p27, p28, p29, p30] = t; 281| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 282| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30); 283| | } 284| | else if constexpr (N == 32) { 285| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 286| | p23, p24, p25, p26, p27, p28, p29, p30, p31] = t; 287| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 288| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31); 289| | } 290| | else if constexpr (N == 33) { 291| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 292| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32] = t; 293| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 294| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32); 295| | } 296| | else if constexpr (N == 34) { 297| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 298| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33] = t; 299| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 300| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33); 301| | } 302| | else if constexpr (N == 35) { 303| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 304| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34] = t; 305| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 306| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34); 307| | } 308| | else if constexpr (N == 36) { 309| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 310| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35] = t; 311| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 312| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35); 313| | } 314| | else if constexpr (N == 37) { 315| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 316| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36] = t; 317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36); 319| | } 320| | else if constexpr (N == 38) { 321| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 322| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37] = t; 323| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 324| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37); 325| | } 326| | else if constexpr (N == 39) { 327| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 328| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38] = t; 329| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 330| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38); 331| | } 332| | else if constexpr (N == 40) { 333| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 334| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39] = t; 335| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 336| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39); 337| | } 338| | else if constexpr (N == 41) { 339| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 340| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40] = t; 341| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 342| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 343| | p40); 344| | } 345| | else if constexpr (N == 42) { 346| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 347| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41] = t; 348| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 349| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 350| | p40, p41); 351| | } 352| | else if constexpr (N == 43) { 353| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 354| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42] = t; 355| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 356| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 357| | p40, p41, p42); 358| | } 359| | else if constexpr (N == 44) { 360| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 361| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, 362| | p43] = t; 363| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 364| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 365| | p40, p41, p42, p43); 366| | } 367| | else if constexpr (N == 45) { 368| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 369| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 370| | p44] = t; 371| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 372| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 373| | p40, p41, p42, p43, p44); 374| | } 375| | else if constexpr (N == 46) { 376| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 377| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 378| | p44, p45] = t; 379| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 380| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 381| | p40, p41, p42, p43, p44, p45); 382| | } 383| | else if constexpr (N == 47) { 384| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 385| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 386| | p44, p45, p46] = t; 387| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 388| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 389| | p40, p41, p42, p43, p44, p45, p46); 390| | } 391| | else if constexpr (N == 48) { 392| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 393| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 394| | p44, p45, p46, p47] = t; 395| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 396| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 397| | p40, p41, p42, p43, p44, p45, p46, p47); 398| | } 399| | else if constexpr (N == 49) { 400| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 401| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 402| | p44, p45, p46, p47, p48] = t; 403| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 404| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 405| | p40, p41, p42, p43, p44, p45, p46, p47, p48); 406| | } 407| | else if constexpr (N == 50) { 408| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 409| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 410| | p44, p45, p46, p47, p48, p49] = t; 411| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 412| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 413| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49); 414| | } 415| | else if constexpr (N == 51) { 416| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 417| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 418| | p44, p45, p46, p47, p48, p49, p50] = t; 419| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 420| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 421| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50); 422| | } 423| | else if constexpr (N == 52) { 424| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 425| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 426| | p44, p45, p46, p47, p48, p49, p50, p51] = t; 427| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 428| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 429| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51); 430| | } 431| | else if constexpr (N == 53) { 432| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 433| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 434| | p44, p45, p46, p47, p48, p49, p50, p51, p52] = t; 435| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 436| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 437| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52); 438| | } 439| | else if constexpr (N == 54) { 440| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 441| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 442| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53] = t; 443| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 444| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 445| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53); 446| | } 447| | else if constexpr (N == 55) { 448| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 449| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 450| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54] = t; 451| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 452| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 453| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54); 454| | } 455| | else if constexpr (N == 56) { 456| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 457| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 458| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55] = t; 459| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 460| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 461| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55); 462| | } 463| | else if constexpr (N == 57) { 464| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 465| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 466| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56] = t; 467| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 468| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 469| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56); 470| | } 471| | else if constexpr (N == 58) { 472| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 473| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 474| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57] = t; 475| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 476| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 477| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57); 478| | } 479| | else if constexpr (N == 59) { 480| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 481| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 482| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58] = t; 483| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 484| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 485| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58); 486| | } 487| | else if constexpr (N == 60) { 488| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 489| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 490| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59] = t; 491| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 492| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 493| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 494| | p59); 495| | } 496| | else if constexpr (N == 61) { 497| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 498| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 499| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60] = t; 500| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 501| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 502| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 503| | p59, p60); 504| | } 505| | else if constexpr (N == 62) { 506| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 507| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 508| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61] = t; 509| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 510| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 511| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 512| | p59, p60, p61); 513| | } 514| | else if constexpr (N == 63) { 515| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 516| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 517| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62] = t; 518| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 519| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 520| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 521| | p59, p60, p61, p62); 522| | } 523| | else if constexpr (N == 64) { 524| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 525| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 526| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63] = t; 527| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 528| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 529| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 530| | p59, p60, p61, p62, p63); 531| | } 532| | else if constexpr (N == 65) { 533| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 534| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 535| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, 536| | p64] = t; 537| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 538| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 539| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 540| | p59, p60, p61, p62, p63, p64); 541| | } 542| | else if constexpr (N == 66) { 543| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 544| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 545| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 546| | p65] = t; 547| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 548| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 549| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 550| | p59, p60, p61, p62, p63, p64, p65); 551| | } 552| | else if constexpr (N == 67) { 553| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 554| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 555| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 556| | p65, p66] = t; 557| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 558| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 559| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 560| | p59, p60, p61, p62, p63, p64, p65, p66); 561| | } 562| | else if constexpr (N == 68) { 563| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 564| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 565| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 566| | p65, p66, p67] = t; 567| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 568| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 569| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 570| | p59, p60, p61, p62, p63, p64, p65, p66, p67); 571| | } 572| | else if constexpr (N == 69) { 573| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 574| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 575| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 576| | p65, p66, p67, p68] = t; 577| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 578| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 579| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 580| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68); 581| | } 582| | else if constexpr (N == 70) { 583| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 584| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 585| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 586| | p65, p66, p67, p68, p69] = t; 587| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 588| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 589| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 590| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69); 591| | } 592| | else if constexpr (N == 71) { 593| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 594| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 595| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 596| | p65, p66, p67, p68, p69, p70] = t; 597| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 598| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 599| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 600| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70); 601| | } 602| | else if constexpr (N == 72) { 603| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 604| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 605| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 606| | p65, p66, p67, p68, p69, p70, p71] = t; 607| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 608| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 609| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 610| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71); 611| | } 612| | else if constexpr (N == 73) { 613| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 614| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 615| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 616| | p65, p66, p67, p68, p69, p70, p71, p72] = t; 617| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 618| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 619| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 620| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72); 621| | } 622| | else if constexpr (N == 74) { 623| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 624| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 625| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 626| | p65, p66, p67, p68, p69, p70, p71, p72, p73] = t; 627| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 628| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 629| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 630| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73); 631| | } 632| | else if constexpr (N == 75) { 633| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 634| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 635| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 636| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74] = t; 637| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 638| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 639| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 640| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74); 641| | } 642| | else if constexpr (N == 76) { 643| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 644| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 645| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 646| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75] = t; 647| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 648| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 649| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 650| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75); 651| | } 652| | else if constexpr (N == 77) { 653| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 654| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 655| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 656| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76] = t; 657| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 658| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 659| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 660| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76); 661| | } 662| | else if constexpr (N == 78) { 663| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 664| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 665| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 666| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77] = t; 667| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 668| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 669| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 670| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77); 671| | } 672| | else if constexpr (N == 79) { 673| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 674| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 675| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 676| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78] = t; 677| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 678| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 679| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 680| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 681| | p78); 682| | } 683| | else if constexpr (N == 80) { 684| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 685| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 686| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 687| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79] = t; 688| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 689| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 690| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 691| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 692| | p78, p79); 693| | } 694| | else if constexpr (N == 81) { 695| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 696| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 697| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 698| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80] = t; 699| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 700| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 701| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 702| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 703| | p78, p79, p80); 704| | } 705| | else if constexpr (N == 82) { 706| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 707| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 708| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 709| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81] = t; 710| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 711| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 712| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 713| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 714| | p78, p79, p80, p81); 715| | } 716| | else if constexpr (N == 83) { 717| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 718| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 719| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 720| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82] = t; 721| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 722| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 723| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 724| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 725| | p78, p79, p80, p81, p82); 726| | } 727| | else if constexpr (N == 84) { 728| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 729| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 730| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 731| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83] = t; 732| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 733| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 734| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 735| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 736| | p78, p79, p80, p81, p82, p83); 737| | } 738| | else if constexpr (N == 85) { 739| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 740| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 741| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 742| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84] = t; 743| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 744| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 745| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 746| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 747| | p78, p79, p80, p81, p82, p83, p84); 748| | } 749| | else if constexpr (N == 86) { 750| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 751| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 752| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 753| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, 754| | p85] = t; 755| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 756| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 757| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 758| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 759| | p78, p79, p80, p81, p82, p83, p84, p85); 760| | } 761| | else if constexpr (N == 87) { 762| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 763| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 764| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 765| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 766| | p86] = t; 767| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 768| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 769| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 770| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 771| | p78, p79, p80, p81, p82, p83, p84, p85, p86); 772| | } 773| | else if constexpr (N == 88) { 774| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 775| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 776| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 777| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 778| | p86, p87] = t; 779| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 780| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 781| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 782| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 783| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87); 784| | } 785| | else if constexpr (N == 89) { 786| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 787| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 788| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 789| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 790| | p86, p87, p88] = t; 791| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 792| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 793| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 794| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 795| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88); 796| | } 797| | else if constexpr (N == 90) { 798| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 799| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 800| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 801| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 802| | p86, p87, p88, p89] = t; 803| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 804| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 805| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 806| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 807| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89); 808| | } 809| | else if constexpr (N == 91) { 810| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 811| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 812| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 813| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 814| | p86, p87, p88, p89, p90] = t; 815| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 816| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 817| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 818| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 819| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90); 820| | } 821| | else if constexpr (N == 92) { 822| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 823| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 824| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 825| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 826| | p86, p87, p88, p89, p90, p91] = t; 827| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 828| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 829| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 830| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 831| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91); 832| | } 833| | else if constexpr (N == 93) { 834| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 835| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 836| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 837| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 838| | p86, p87, p88, p89, p90, p91, p92] = t; 839| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 840| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 841| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 842| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 843| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92); 844| | } 845| | else if constexpr (N == 94) { 846| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 847| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 848| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 849| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 850| | p86, p87, p88, p89, p90, p91, p92, p93] = t; 851| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 852| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 853| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 854| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 855| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93); 856| | } 857| | else if constexpr (N == 95) { 858| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 859| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 860| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 861| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 862| | p86, p87, p88, p89, p90, p91, p92, p93, p94] = t; 863| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 864| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 865| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 866| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 867| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94); 868| | } 869| | else if constexpr (N == 96) { 870| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 871| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 872| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 873| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 874| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95] = t; 875| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 876| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 877| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 878| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 879| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95); 880| | } 881| | else if constexpr (N == 97) { 882| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 883| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 884| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 885| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 886| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96] = t; 887| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 888| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 889| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 890| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 891| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96); 892| | } 893| | else if constexpr (N == 98) { 894| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 895| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 896| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 897| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 898| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97] = t; 899| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 900| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 901| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 902| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 903| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 904| | p97); 905| | } 906| | else if constexpr (N == 99) { 907| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 908| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 909| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 910| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 911| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98] = t; 912| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 913| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 914| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 915| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 916| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 917| | p97, p98); 918| | } 919| | else if constexpr (N == 100) { 920| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 921| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 922| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 923| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 924| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99] = t; 925| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 926| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 927| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 928| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 929| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 930| | p97, p98, p99); 931| | } 932| | else if constexpr (N == 101) { 933| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 934| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 935| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 936| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 937| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100] = t; 938| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 939| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 940| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 941| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 942| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 943| | p97, p98, p99, p100); 944| | } 945| | else if constexpr (N == 102) { 946| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 947| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 948| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 949| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 950| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101] = t; 951| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 952| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 953| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 954| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 955| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 956| | p97, p98, p99, p100, p101); 957| | } 958| | else if constexpr (N == 103) { 959| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 960| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 961| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 962| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 963| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102] = t; 964| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 965| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 966| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 967| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 968| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 969| | p97, p98, p99, p100, p101, p102); 970| | } 971| | else if constexpr (N == 104) { 972| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 973| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 974| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 975| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 976| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103] = t; 977| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 978| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 979| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 980| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 981| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 982| | p97, p98, p99, p100, p101, p102, p103); 983| | } 984| | else if constexpr (N == 105) { 985| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 986| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 987| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 988| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 989| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104] = t; 990| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 991| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 992| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 993| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 994| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 995| | p97, p98, p99, p100, p101, p102, p103, p104); 996| | } 997| | else if constexpr (N == 106) { 998| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 999| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1000| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1001| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1002| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1003| | p105] = t; 1004| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1005| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1006| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1007| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1008| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1009| | p97, p98, p99, p100, p101, p102, p103, p104, p105); 1010| | } 1011| | else if constexpr (N == 107) { 1012| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1013| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1014| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1015| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1016| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1017| | p105, p106] = t; 1018| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1019| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1020| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1021| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1022| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1023| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106); 1024| | } 1025| | else if constexpr (N == 108) { 1026| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1027| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1028| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1029| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1030| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1031| | p105, p106, p107] = t; 1032| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1033| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1034| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1035| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1036| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1037| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107); 1038| | } 1039| | else if constexpr (N == 109) { 1040| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1041| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1042| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1043| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1044| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1045| | p105, p106, p107, p108] = t; 1046| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1047| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1048| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1049| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1050| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1051| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108); 1052| | } 1053| | else if constexpr (N == 110) { 1054| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1055| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1056| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1057| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1058| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1059| | p105, p106, p107, p108, p109] = t; 1060| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1061| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1062| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1063| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1064| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1065| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109); 1066| | } 1067| | else if constexpr (N == 111) { 1068| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1069| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1070| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1071| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1072| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1073| | p105, p106, p107, p108, p109, p110] = t; 1074| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1075| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1076| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1077| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1078| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1079| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110); 1080| | } 1081| | else if constexpr (N == 112) { 1082| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1083| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1084| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1085| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1086| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1087| | p105, p106, p107, p108, p109, p110, p111] = t; 1088| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1089| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1090| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1091| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1092| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1093| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111); 1094| | } 1095| | else if constexpr (N == 113) { 1096| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1097| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1098| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1099| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1100| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1101| | p105, p106, p107, p108, p109, p110, p111, p112] = t; 1102| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1103| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1104| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1105| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1106| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1107| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112); 1108| | } 1109| | else if constexpr (N == 114) { 1110| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1111| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1112| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1113| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1114| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1115| | p105, p106, p107, p108, p109, p110, p111, p112, p113] = t; 1116| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1117| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1118| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1119| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1120| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1121| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1122| | p113); 1123| | } 1124| | else if constexpr (N == 115) { 1125| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1126| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1127| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1128| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1129| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1130| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114] = t; 1131| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1132| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1133| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1134| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1135| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1136| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1137| | p113, p114); 1138| | } 1139| | else if constexpr (N == 116) { 1140| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1141| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1142| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1143| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1144| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1145| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115] = t; 1146| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1147| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1148| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1149| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1150| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1151| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1152| | p113, p114, p115); 1153| | } 1154| | else if constexpr (N == 117) { 1155| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1156| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1157| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1158| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1159| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1160| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116] = t; 1161| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1162| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1163| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1164| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1165| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1166| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1167| | p113, p114, p115, p116); 1168| | } 1169| | else if constexpr (N == 118) { 1170| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1171| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1172| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1173| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1174| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1175| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117] = t; 1176| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1177| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1178| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1179| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1180| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1181| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1182| | p113, p114, p115, p116, p117); 1183| | } 1184| | else if constexpr (N == 119) { 1185| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1186| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1187| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1188| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1189| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1190| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118] = t; 1191| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1192| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1193| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1194| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1195| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1196| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1197| | p113, p114, p115, p116, p117, p118); 1198| | } 1199| | else if constexpr (N == 120) { 1200| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1201| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1202| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1203| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1204| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1205| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119] = t; 1206| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1207| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1208| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1209| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1210| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1211| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1212| | p113, p114, p115, p116, p117, p118, p119); 1213| | } 1214| | else if constexpr (N == 121) { 1215| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1216| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1217| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1218| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1219| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1220| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120] = t; 1221| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1222| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1223| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1224| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1225| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1226| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1227| | p113, p114, p115, p116, p117, p118, p119, p120); 1228| | } 1229| | else if constexpr (N == 122) { 1230| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1231| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1232| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1233| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1234| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1235| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121] = 1236| | t; 1237| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1238| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1239| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1240| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1241| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1242| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1243| | p113, p114, p115, p116, p117, p118, p119, p120, p121); 1244| | } 1245| | else if constexpr (N == 123) { 1246| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1247| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1248| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1249| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1250| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1251| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1252| | p122] = t; 1253| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1254| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1255| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1256| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1257| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1258| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1259| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122); 1260| | } 1261| | else if constexpr (N == 124) { 1262| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1263| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1264| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1265| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1266| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1267| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1268| | p122, p123] = t; 1269| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1270| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1271| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1272| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1273| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1274| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1275| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123); 1276| | } 1277| | else if constexpr (N == 125) { 1278| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1279| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1280| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1281| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1282| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1283| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1284| | p122, p123, p124] = t; 1285| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1286| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1287| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1288| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1289| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1290| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1291| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124); 1292| | } 1293| | else if constexpr (N == 126) { 1294| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1295| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1296| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1297| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1298| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1299| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1300| | p122, p123, p124, p125] = t; 1301| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1302| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1303| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1304| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1305| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1306| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1307| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125); 1308| | } 1309| | else if constexpr (N == 127) { 1310| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1311| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1312| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1313| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1314| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1315| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1316| | p122, p123, p124, p125, p126] = t; 1317| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1318| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1319| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1320| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1321| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1322| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1323| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126); 1324| | } 1325| | else if constexpr (N == 128) { 1326| | auto& [p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, p21, p22, 1327| | p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, p41, p42, p43, 1328| | p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, p59, p60, p61, p62, p63, p64, 1329| | p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, p78, p79, p80, p81, p82, p83, p84, p85, 1330| | p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, p97, p98, p99, p100, p101, p102, p103, p104, 1331| | p105, p106, p107, p108, p109, p110, p111, p112, p113, p114, p115, p116, p117, p118, p119, p120, p121, 1332| | p122, p123, p124, p125, p126, p127] = t; 1333| | return glz::tie(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, 1334| | p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, p31, p32, p33, p34, p35, p36, p37, p38, p39, 1335| | p40, p41, p42, p43, p44, p45, p46, p47, p48, p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, 1336| | p59, p60, p61, p62, p63, p64, p65, p66, p67, p68, p69, p70, p71, p72, p73, p74, p75, p76, p77, 1337| | p78, p79, p80, p81, p82, p83, p84, p85, p86, p87, p88, p89, p90, p91, p92, p93, p94, p95, p96, 1338| | p97, p98, p99, p100, p101, p102, p103, p104, p105, p106, p107, p108, p109, p110, p111, p112, 1339| | p113, p114, p115, p116, p117, p118, p119, p120, p121, p122, p123, p124, p125, p126, p127); 1340| | } 1341| 11.0k| } repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE2onIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_: 307| 345k| { 308| 345k| using impl = registry_impl; 309| | 310| 345k| if constexpr (parent == root && (glaze_object_t || reflectable)) { 311| 345k| impl::register_endpoint(root, value, *this); 312| 345k| } 313| | 314| 345k| register_members(value); 315| 345k| } repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_: 176| 345k| { 177| 345k| using namespace glz::detail; 178| 345k| static constexpr auto N = reflect::size; 179| | 180| 345k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 345k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 345k| return to_tie(value); 183| 345k| } 184| 345k| else { 185| 345k| return nullptr; 186| 345k| } 187| 345k| }(); 188| | 189| 345k| using impl = registry_impl; 190| | 191| 345k| for_each([&]() { 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| 345k| if constexpr (reflectable) { 194| 345k| return get_member(value, get(t)); 195| 345k| } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); 200| | 201| 345k| static constexpr auto key = reflect::keys[I]; 202| | 203| 345k| static constexpr std::string_view full_key = [&] { 204| 345k| if constexpr (parent == detail::empty_path) { 205| 345k| return join_v, key>; 206| 345k| } 207| 345k| else { 208| 345k| return join_v, key>; 209| 345k| } 210| 345k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 345k| using Func = decltype(func); 214| 345k| if constexpr (std::is_invocable_v) { 215| 345k| using Result = std::decay_t>; 216| 345k| impl::template register_function_endpoint(full_key, func, *this); 217| 345k| } 218| 345k| else if constexpr (is_invocable_concrete>) { 219| 345k| using Tuple = invocable_args_t>; 220| 345k| constexpr auto N = glz::tuple_size_v; 221| 345k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 345k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 345k| impl::template register_param_function_endpoint(full_key, func, *this); 226| 345k| } 227| 345k| else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| 345k| using Tuple = function_ptr_args_t>; 230| 345k| constexpr auto N = glz::tuple_size_v; 231| 345k| static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| 345k| using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| 345k| impl::template register_param_function_endpoint(full_key, func, *this); 236| 345k| } 237| 345k| else if constexpr (std::is_pointer_v> && 238| 345k| (glaze_object_t>> || 239| 345k| reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| 345k| if (func) { // Only traverse if pointer is valid 242| 345k| on>, full_key>(*func); 243| 345k| impl::template register_object_endpoint>>( 244| 345k| full_key, *func, *this); 245| 345k| } 246| | // else: skip registration for null pointers - no endpoints created 247| 345k| } 248| 345k| else if constexpr (glaze_object_t> || reflectable>) { 249| 345k| on, full_key>(func); 250| | 251| 345k| impl::template register_object_endpoint>(full_key, func, *this); 252| 345k| } 253| 345k| else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| 345k| impl::template register_value_endpoint>(full_key, func, *this); 256| 345k| } 257| 345k| else { 258| 345k| static_assert(std::is_lvalue_reference_v); 259| | 260| 345k| if constexpr (std::is_member_function_pointer_v>) { 261| 345k| using F = std::decay_t; 262| 345k| using Ret = typename return_type::type; 263| 345k| using Tuple = typename inputs_as_tuple::type; 264| 345k| constexpr auto n_args = glz::tuple_size_v; 265| 345k| if constexpr (std::is_void_v) { 266| 345k| if constexpr (n_args == 0) { 267| 345k| impl::template register_member_function_endpoint(full_key, value, func, *this); 268| 345k| } 269| 345k| else if constexpr (n_args == 1) { 270| 345k| using Input = std::decay_t>; 271| 345k| impl::template register_member_function_with_params_endpoint(full_key, value, 272| 345k| func, *this); 273| 345k| } 274| 345k| else { 275| 345k| static_assert(false_v, "function cannot have more than one input"); 276| 345k| } 277| 345k| } 278| 345k| else { 279| | // Member function pointers 280| 345k| if constexpr (n_args == 0) { 281| 345k| impl::template register_member_function_endpoint(full_key, value, func, *this); 282| 345k| } 283| 345k| else if constexpr (n_args == 1) { 284| 345k| using Input = std::decay_t>; 285| 345k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 345k| func, *this); 287| 345k| } 288| 345k| else { 289| 345k| static_assert(false_v, "function cannot have more than one input"); 290| 345k| } 291| 345k| } 292| 345k| } 293| 345k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 345k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 345k| } 298| 345k| } 299| 345k| }); 300| 345k| } repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlvE_clEv: 180| 345k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| | if constexpr (reflectable && requires { to_tie(value); }) { 182| | return to_tie(value); 183| | } 184| 345k| else { 185| 345k| return nullptr; 186| 345k| } 187| 345k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm0EEEDav: 191| 345k| for_each([&]() { 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| 345k| if constexpr (reflectable) { 194| 345k| return get_member(value, get(t)); 195| 345k| } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); 200| | 201| 345k| static constexpr auto key = reflect::keys[I]; 202| | 203| 345k| static constexpr std::string_view full_key = [&] { 204| 345k| if constexpr (parent == detail::empty_path) { 205| 345k| return join_v, key>; 206| 345k| } 207| 345k| else { 208| 345k| return join_v, key>; 209| 345k| } 210| 345k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 345k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 345k| else { 258| 345k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 345k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 345k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 345k| } 298| 345k| } 299| 345k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm0EEEDavENKUlvE_clEv: 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| | if constexpr (reflectable) { 194| | return get_member(value, get(t)); 195| | } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm1EEEDav: 191| 345k| for_each([&]() { 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| 345k| if constexpr (reflectable) { 194| 345k| return get_member(value, get(t)); 195| 345k| } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); 200| | 201| 345k| static constexpr auto key = reflect::keys[I]; 202| | 203| 345k| static constexpr std::string_view full_key = [&] { 204| 345k| if constexpr (parent == detail::empty_path) { 205| 345k| return join_v, key>; 206| 345k| } 207| 345k| else { 208| 345k| return join_v, key>; 209| 345k| } 210| 345k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 345k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 345k| else { 258| 345k| static_assert(std::is_lvalue_reference_v); 259| | 260| 345k| if constexpr (std::is_member_function_pointer_v>) { 261| 345k| using F = std::decay_t; 262| 345k| using Ret = typename return_type::type; 263| 345k| using Tuple = typename inputs_as_tuple::type; 264| 345k| constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| 345k| else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| 345k| else if constexpr (n_args == 1) { 284| 345k| using Input = std::decay_t>; 285| 345k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 345k| func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| 345k| } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| 345k| } 299| 345k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm1EEEDavENKUlvE_clEv: 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| | if constexpr (reflectable) { 194| | return get_member(value, get(t)); 195| | } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm2EEEDav: 191| 345k| for_each([&]() { 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| 345k| if constexpr (reflectable) { 194| 345k| return get_member(value, get(t)); 195| 345k| } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); 200| | 201| 345k| static constexpr auto key = reflect::keys[I]; 202| | 203| 345k| static constexpr std::string_view full_key = [&] { 204| 345k| if constexpr (parent == detail::empty_path) { 205| 345k| return join_v, key>; 206| 345k| } 207| 345k| else { 208| 345k| return join_v, key>; 209| 345k| } 210| 345k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 345k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 345k| else { 258| 345k| static_assert(std::is_lvalue_reference_v); 259| | 260| 345k| if constexpr (std::is_member_function_pointer_v>) { 261| 345k| using F = std::decay_t; 262| 345k| using Ret = typename return_type::type; 263| 345k| using Tuple = typename inputs_as_tuple::type; 264| 345k| constexpr auto n_args = glz::tuple_size_v; 265| 345k| if constexpr (std::is_void_v) { 266| 345k| if constexpr (n_args == 0) { 267| 345k| impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| 345k| } 299| 345k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm2EEEDavENKUlvE_clEv: 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| | if constexpr (reflectable) { 194| | return get_member(value, get(t)); 195| | } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm3EEEDav: 191| 345k| for_each([&]() { 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| 345k| if constexpr (reflectable) { 194| 345k| return get_member(value, get(t)); 195| 345k| } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); 200| | 201| 345k| static constexpr auto key = reflect::keys[I]; 202| | 203| 345k| static constexpr std::string_view full_key = [&] { 204| 345k| if constexpr (parent == detail::empty_path) { 205| 345k| return join_v, key>; 206| 345k| } 207| 345k| else { 208| 345k| return join_v, key>; 209| 345k| } 210| 345k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 345k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 345k| else { 258| 345k| static_assert(std::is_lvalue_reference_v); 259| | 260| 345k| if constexpr (std::is_member_function_pointer_v>) { 261| 345k| using F = std::decay_t; 262| 345k| using Ret = typename return_type::type; 263| 345k| using Tuple = typename inputs_as_tuple::type; 264| 345k| constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| 345k| else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| 345k| else if constexpr (n_args == 1) { 284| 345k| using Input = std::decay_t>; 285| 345k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 345k| func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| 345k| } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| 345k| } 299| 345k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm3EEEDavENKUlvE_clEv: 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| | if constexpr (reflectable) { 194| | return get_member(value, get(t)); 195| | } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm4EEEDav: 191| 345k| for_each([&]() { 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| 345k| if constexpr (reflectable) { 194| 345k| return get_member(value, get(t)); 195| 345k| } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); 200| | 201| 345k| static constexpr auto key = reflect::keys[I]; 202| | 203| 345k| static constexpr std::string_view full_key = [&] { 204| 345k| if constexpr (parent == detail::empty_path) { 205| 345k| return join_v, key>; 206| 345k| } 207| 345k| else { 208| 345k| return join_v, key>; 209| 345k| } 210| 345k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 345k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 345k| else { 258| 345k| static_assert(std::is_lvalue_reference_v); 259| | 260| 345k| if constexpr (std::is_member_function_pointer_v>) { 261| 345k| using F = std::decay_t; 262| 345k| using Ret = typename return_type::type; 263| 345k| using Tuple = typename inputs_as_tuple::type; 264| 345k| constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| 345k| else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| 345k| else if constexpr (n_args == 1) { 284| 345k| using Input = std::decay_t>; 285| 345k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 345k| func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| 345k| } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| 345k| } 299| 345k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm4EEEDavENKUlvE_clEv: 192| 345k| decltype(auto) func = [&]() -> decltype(auto) { 193| | if constexpr (reflectable) { 194| | return get_member(value, get(t)); 195| | } 196| 345k| else { 197| 345k| return get_member(value, get(reflect::values)); 198| 345k| } 199| 345k| }(); repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE2onIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_: 307| 360k| { 308| 360k| using impl = registry_impl; 309| | 310| 360k| if constexpr (parent == root && (glaze_object_t || reflectable)) { 311| 360k| impl::register_endpoint(root, value, *this); 312| 360k| } 313| | 314| 360k| register_members(value); 315| 360k| } repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_: 176| 360k| { 177| 360k| using namespace glz::detail; 178| 360k| static constexpr auto N = reflect::size; 179| | 180| 360k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 360k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 360k| return to_tie(value); 183| 360k| } 184| 360k| else { 185| 360k| return nullptr; 186| 360k| } 187| 360k| }(); 188| | 189| 360k| using impl = registry_impl; 190| | 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| 360k| if constexpr (std::is_invocable_v) { 215| 360k| using Result = std::decay_t>; 216| 360k| impl::template register_function_endpoint(full_key, func, *this); 217| 360k| } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| 360k| } 227| 360k| else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| 360k| using Tuple = function_ptr_args_t>; 230| 360k| constexpr auto N = glz::tuple_size_v; 231| 360k| static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| 360k| using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 236| 360k| } 237| 360k| else if constexpr (std::is_pointer_v> && 238| 360k| (glaze_object_t>> || 239| 360k| reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| 360k| if (func) { // Only traverse if pointer is valid 242| 360k| on>, full_key>(*func); 243| 360k| impl::template register_object_endpoint>>( 244| 360k| full_key, *func, *this); 245| 360k| } 246| | // else: skip registration for null pointers - no endpoints created 247| 360k| } 248| 360k| else if constexpr (glaze_object_t> || reflectable>) { 249| 360k| on, full_key>(func); 250| | 251| 360k| impl::template register_object_endpoint>(full_key, func, *this); 252| 360k| } 253| 360k| else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| 360k| impl::template register_value_endpoint>(full_key, func, *this); 256| 360k| } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| 360k| if constexpr (std::is_member_function_pointer_v>) { 261| 360k| using F = std::decay_t; 262| 360k| using Ret = typename return_type::type; 263| 360k| using Tuple = typename inputs_as_tuple::type; 264| 360k| constexpr auto n_args = glz::tuple_size_v; 265| 360k| if constexpr (std::is_void_v) { 266| 360k| if constexpr (n_args == 0) { 267| 360k| impl::template register_member_function_endpoint(full_key, value, func, *this); 268| 360k| } 269| 360k| else if constexpr (n_args == 1) { 270| 360k| using Input = std::decay_t>; 271| 360k| impl::template register_member_function_with_params_endpoint(full_key, value, 272| 360k| func, *this); 273| 360k| } 274| 360k| else { 275| 360k| static_assert(false_v, "function cannot have more than one input"); 276| 360k| } 277| 360k| } 278| 360k| else { 279| | // Member function pointers 280| 360k| if constexpr (n_args == 0) { 281| 360k| impl::template register_member_function_endpoint(full_key, value, func, *this); 282| 360k| } 283| 360k| else if constexpr (n_args == 1) { 284| 360k| using Input = std::decay_t>; 285| 360k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 360k| func, *this); 287| 360k| } 288| 360k| else { 289| 360k| static_assert(false_v, "function cannot have more than one input"); 290| 360k| } 291| 360k| } 292| 360k| } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); 300| 360k| } repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlvE_clEv: 180| 360k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 360k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 360k| return to_tie(value); 183| | } 184| | else { 185| | return nullptr; 186| | } 187| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm0EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm0EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm1EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm1EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm2EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| 360k| else if constexpr (glaze_object_t> || reflectable>) { 249| 360k| on, full_key>(func); 250| | 251| 360k| impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm2EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE2onIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS2_16register_membersIL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS9_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS9_E11reflectableIS9_EEEvSB_: 307| 360k| { 308| 360k| using impl = registry_impl; 309| | 310| | if constexpr (parent == root && (glaze_object_t || reflectable)) { 311| | impl::register_endpoint(root, value, *this); 312| | } 313| | 314| 360k| register_members(value); 315| 360k| } repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_: 176| 360k| { 177| 360k| using namespace glz::detail; 178| 360k| static constexpr auto N = reflect::size; 179| | 180| 360k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 360k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 360k| return to_tie(value); 183| 360k| } 184| 360k| else { 185| 360k| return nullptr; 186| 360k| } 187| 360k| }(); 188| | 189| 360k| using impl = registry_impl; 190| | 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| 360k| if constexpr (std::is_invocable_v) { 215| 360k| using Result = std::decay_t>; 216| 360k| impl::template register_function_endpoint(full_key, func, *this); 217| 360k| } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| 360k| } 227| 360k| else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| 360k| using Tuple = function_ptr_args_t>; 230| 360k| constexpr auto N = glz::tuple_size_v; 231| 360k| static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| 360k| using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 236| 360k| } 237| 360k| else if constexpr (std::is_pointer_v> && 238| 360k| (glaze_object_t>> || 239| 360k| reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| 360k| if (func) { // Only traverse if pointer is valid 242| 360k| on>, full_key>(*func); 243| 360k| impl::template register_object_endpoint>>( 244| 360k| full_key, *func, *this); 245| 360k| } 246| | // else: skip registration for null pointers - no endpoints created 247| 360k| } 248| 360k| else if constexpr (glaze_object_t> || reflectable>) { 249| 360k| on, full_key>(func); 250| | 251| 360k| impl::template register_object_endpoint>(full_key, func, *this); 252| 360k| } 253| 360k| else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| 360k| impl::template register_value_endpoint>(full_key, func, *this); 256| 360k| } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| 360k| if constexpr (std::is_member_function_pointer_v>) { 261| 360k| using F = std::decay_t; 262| 360k| using Ret = typename return_type::type; 263| 360k| using Tuple = typename inputs_as_tuple::type; 264| 360k| constexpr auto n_args = glz::tuple_size_v; 265| 360k| if constexpr (std::is_void_v) { 266| 360k| if constexpr (n_args == 0) { 267| 360k| impl::template register_member_function_endpoint(full_key, value, func, *this); 268| 360k| } 269| 360k| else if constexpr (n_args == 1) { 270| 360k| using Input = std::decay_t>; 271| 360k| impl::template register_member_function_with_params_endpoint(full_key, value, 272| 360k| func, *this); 273| 360k| } 274| 360k| else { 275| 360k| static_assert(false_v, "function cannot have more than one input"); 276| 360k| } 277| 360k| } 278| 360k| else { 279| | // Member function pointers 280| 360k| if constexpr (n_args == 0) { 281| 360k| impl::template register_member_function_endpoint(full_key, value, func, *this); 282| 360k| } 283| 360k| else if constexpr (n_args == 1) { 284| 360k| using Input = std::decay_t>; 285| 360k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 360k| func, *this); 287| 360k| } 288| 360k| else { 289| 360k| static_assert(false_v, "function cannot have more than one input"); 290| 360k| } 291| 360k| } 292| 360k| } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); 300| 360k| } repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlvE_clEv: 180| 360k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 360k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 360k| return to_tie(value); 183| | } 184| | else { 185| | return nullptr; 186| | } 187| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi0EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi0EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi1EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi1EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm3EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| 360k| else if constexpr (glaze_object_t> || reflectable>) { 249| 360k| on, full_key>(func); 250| | 251| 360k| impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm3EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE2onIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS2_16register_membersIL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS9_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS9_E11reflectableIS9_EEEvSB_: 307| 360k| { 308| 360k| using impl = registry_impl; 309| | 310| | if constexpr (parent == root && (glaze_object_t || reflectable)) { 311| | impl::register_endpoint(root, value, *this); 312| | } 313| | 314| 360k| register_members(value); 315| 360k| } repe_registry.cpp:_ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_: 176| 360k| { 177| 360k| using namespace glz::detail; 178| 360k| static constexpr auto N = reflect::size; 179| | 180| 360k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 360k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 360k| return to_tie(value); 183| 360k| } 184| 360k| else { 185| 360k| return nullptr; 186| 360k| } 187| 360k| }(); 188| | 189| 360k| using impl = registry_impl; 190| | 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| 360k| if constexpr (std::is_invocable_v) { 215| 360k| using Result = std::decay_t>; 216| 360k| impl::template register_function_endpoint(full_key, func, *this); 217| 360k| } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| 360k| } 227| 360k| else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| 360k| using Tuple = function_ptr_args_t>; 230| 360k| constexpr auto N = glz::tuple_size_v; 231| 360k| static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| 360k| using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 236| 360k| } 237| 360k| else if constexpr (std::is_pointer_v> && 238| 360k| (glaze_object_t>> || 239| 360k| reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| 360k| if (func) { // Only traverse if pointer is valid 242| 360k| on>, full_key>(*func); 243| 360k| impl::template register_object_endpoint>>( 244| 360k| full_key, *func, *this); 245| 360k| } 246| | // else: skip registration for null pointers - no endpoints created 247| 360k| } 248| 360k| else if constexpr (glaze_object_t> || reflectable>) { 249| 360k| on, full_key>(func); 250| | 251| 360k| impl::template register_object_endpoint>(full_key, func, *this); 252| 360k| } 253| 360k| else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| 360k| impl::template register_value_endpoint>(full_key, func, *this); 256| 360k| } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| 360k| if constexpr (std::is_member_function_pointer_v>) { 261| 360k| using F = std::decay_t; 262| 360k| using Ret = typename return_type::type; 263| 360k| using Tuple = typename inputs_as_tuple::type; 264| 360k| constexpr auto n_args = glz::tuple_size_v; 265| 360k| if constexpr (std::is_void_v) { 266| 360k| if constexpr (n_args == 0) { 267| 360k| impl::template register_member_function_endpoint(full_key, value, func, *this); 268| 360k| } 269| 360k| else if constexpr (n_args == 1) { 270| 360k| using Input = std::decay_t>; 271| 360k| impl::template register_member_function_with_params_endpoint(full_key, value, 272| 360k| func, *this); 273| 360k| } 274| 360k| else { 275| 360k| static_assert(false_v, "function cannot have more than one input"); 276| 360k| } 277| 360k| } 278| 360k| else { 279| | // Member function pointers 280| 360k| if constexpr (n_args == 0) { 281| 360k| impl::template register_member_function_endpoint(full_key, value, func, *this); 282| 360k| } 283| 360k| else if constexpr (n_args == 1) { 284| 360k| using Input = std::decay_t>; 285| 360k| impl::template register_member_function_with_params_endpoint(full_key, value, 286| 360k| func, *this); 287| 360k| } 288| 360k| else { 289| 360k| static_assert(false_v, "function cannot have more than one input"); 290| 360k| } 291| 360k| } 292| 360k| } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); 300| 360k| } repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlvE_clEv: 180| 360k| [[maybe_unused]] decltype(auto) t = [&]() -> decltype(auto) { 181| 360k| if constexpr (reflectable && requires { to_tie(value); }) { 182| 360k| return to_tie(value); 183| | } 184| | else { 185| | return nullptr; 186| | } 187| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi0EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi0EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi1EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS3_IL_ZNS4_L10empty_pathEENS5_8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS8_E11reflectableIS8_EEEvSA_ENKUlTnDavE_clILi1EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm4EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm4EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm5EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm5EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm6EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm6EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm7EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| 360k| else { 258| 360k| static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| 360k| else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| 360k| impl::template register_variable_endpoint>(full_key, func, *this); 297| 360k| } 298| 360k| } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm7EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm8EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm8EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm9EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm9EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm10EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm10EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm11EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| | if constexpr (std::is_invocable_v) { 215| | using Result = std::decay_t>; 216| | impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| 360k| else if constexpr (is_invocable_concrete>) { 219| 360k| using Tuple = invocable_args_t>; 220| 360k| constexpr auto N = glz::tuple_size_v; 221| 360k| static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| 360k| using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| 360k| impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm11EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); repe_registry.cpp:_ZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm12EEEDav: 191| 360k| for_each([&]() { 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| 360k| } 196| 360k| else { 197| 360k| return get_member(value, get(reflect::values)); 198| 360k| } 199| 360k| }(); 200| | 201| 360k| static constexpr auto key = reflect::keys[I]; 202| | 203| 360k| static constexpr std::string_view full_key = [&] { 204| 360k| if constexpr (parent == detail::empty_path) { 205| 360k| return join_v, key>; 206| 360k| } 207| 360k| else { 208| 360k| return join_v, key>; 209| 360k| } 210| 360k| }(); 211| | 212| | // This logic chain should match glz::cli_menu 213| 360k| using Func = decltype(func); 214| 360k| if constexpr (std::is_invocable_v) { 215| 360k| using Result = std::decay_t>; 216| 360k| impl::template register_function_endpoint(full_key, func, *this); 217| | } 218| | else if constexpr (is_invocable_concrete>) { 219| | using Tuple = invocable_args_t>; 220| | constexpr auto N = glz::tuple_size_v; 221| | static_assert(N == 1, "Only one input is allowed for your function"); 222| | 223| | using Params = glz::tuple_element_t<0, Tuple>; 224| | 225| | impl::template register_param_function_endpoint(full_key, func, *this); 226| | } 227| | else if constexpr (is_function_ptr_invocable>) { 228| | // Handle function pointers with arguments (e.g., void(*)(int)) 229| | using Tuple = function_ptr_args_t>; 230| | constexpr auto N = glz::tuple_size_v; 231| | static_assert(N == 1, "Only one input is allowed for your function pointer"); 232| | 233| | using Params = glz::tuple_element_t<0, Tuple>; 234| | 235| | impl::template register_param_function_endpoint(full_key, func, *this); 236| | } 237| | else if constexpr (std::is_pointer_v> && 238| | (glaze_object_t>> || 239| | reflectable>>)) { 240| | // Handle pointer members explicitly for RPC traversal 241| | if (func) { // Only traverse if pointer is valid 242| | on>, full_key>(*func); 243| | impl::template register_object_endpoint>>( 244| | full_key, *func, *this); 245| | } 246| | // else: skip registration for null pointers - no endpoints created 247| | } 248| | else if constexpr (glaze_object_t> || reflectable>) { 249| | on, full_key>(func); 250| | 251| | impl::template register_object_endpoint>(full_key, func, *this); 252| | } 253| | else if constexpr (not std::is_lvalue_reference_v) { 254| | // For glz::custom, glz::manage, etc. 255| | impl::template register_value_endpoint>(full_key, func, *this); 256| | } 257| | else { 258| | static_assert(std::is_lvalue_reference_v); 259| | 260| | if constexpr (std::is_member_function_pointer_v>) { 261| | using F = std::decay_t; 262| | using Ret = typename return_type::type; 263| | using Tuple = typename inputs_as_tuple::type; 264| | constexpr auto n_args = glz::tuple_size_v; 265| | if constexpr (std::is_void_v) { 266| | if constexpr (n_args == 0) { 267| | impl::template register_member_function_endpoint(full_key, value, func, *this); 268| | } 269| | else if constexpr (n_args == 1) { 270| | using Input = std::decay_t>; 271| | impl::template register_member_function_with_params_endpoint(full_key, value, 272| | func, *this); 273| | } 274| | else { 275| | static_assert(false_v, "function cannot have more than one input"); 276| | } 277| | } 278| | else { 279| | // Member function pointers 280| | if constexpr (n_args == 0) { 281| | impl::template register_member_function_endpoint(full_key, value, func, *this); 282| | } 283| | else if constexpr (n_args == 1) { 284| | using Input = std::decay_t>; 285| | impl::template register_member_function_with_params_endpoint(full_key, value, 286| | func, *this); 287| | } 288| | else { 289| | static_assert(false_v, "function cannot have more than one input"); 290| | } 291| | } 292| | } 293| | else { 294| | // this is a variable and not a function, so we build RPC read/write calls 295| | // We can't remove const here, because const fields need to be able to be written 296| | impl::template register_variable_endpoint>(full_key, func, *this); 297| | } 298| | } 299| 360k| }); repe_registry.cpp:_ZZZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS4_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS7_EEEvRT0_ENKUlTnDavE_clILm12EEEDavENKUlvE_clEv: 192| 360k| decltype(auto) func = [&]() -> decltype(auto) { 193| 360k| if constexpr (reflectable) { 194| 360k| return get_member(value, get(t)); 195| | } 196| | else { 197| | return get_member(value, get(reflect::values)); 198| | } 199| 360k| }(); _ZN3glz8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE4callENSt3__14spanIKcLm18446744073709551615EEERNS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEQeqT0_L_ZNS_4REPEEE: 417| 360k| { 418| 360k| response_buffer.clear(); // Empty buffer means no response 419| 360k| repe::response_builder resp{response_buffer}; 420| | 421| | // Parse request with zero-copy (header copied to stack, query/body are views) 422| 360k| auto result = repe::parse_request(request); 423| 360k| if (!result) { ------------------ | Branch (423:14): [True: 29.9k, False: 330k] ------------------ 424| | // Use the specific error code from parse_result 425| | // Note: parse_request copies the header before validation, so we can access it 426| 29.9k| resp.reset(result.request.hdr.id); 427| | 428| | // Build appropriate error message based on error code 429| 29.9k| if (result.ec == error_code::version_mismatch) { ------------------ | Branch (429:17): [True: 22, False: 29.9k] ------------------ 430| 22| resp.set_error(result.ec, detail::build_version_error(result.request.hdr.version)); 431| 22| } 432| 29.9k| else if (result.ec == error_code::invalid_header) { ------------------ | Branch (432:22): [True: 29.8k, False: 120] ------------------ 433| | // Could be magic mismatch, length mismatch, or buffer too small 434| 29.8k| if (request.size() >= sizeof(repe::header)) { ------------------ | Branch (434:20): [True: 8.45k, False: 21.3k] ------------------ 435| 8.45k| const auto& hdr = result.request.hdr; 436| 8.45k| if (hdr.spec != repe::repe_magic) { ------------------ | Branch (436:23): [True: 7.66k, False: 782] ------------------ 437| 7.66k| resp.set_error(result.ec, detail::build_magic_error(hdr.spec)); 438| 7.66k| } 439| 782| else { 440| | // Length mismatch, or query/body lengths that overflow the total 441| | // (overflow-safe: query_length/body_length are attacker-controlled). 442| 782| uint64_t expected{}; 443| 782| if (repe::checked_message_length(hdr, expected)) { ------------------ | Branch (443:26): [True: 632, False: 150] ------------------ 444| 632| resp.set_error(result.ec, detail::build_length_error(expected, hdr.length)); 445| 632| } 446| 150| else { 447| 150| resp.set_error(result.ec, 448| 150| detail::build_length_overflow_error(hdr.query_length, hdr.body_length)); 449| 150| } 450| 782| } 451| 8.45k| } 452| 21.3k| else { 453| 21.3k| resp.set_error(result.ec, "Invalid header"); 454| 21.3k| } 455| 29.8k| } 456| 120| else { 457| 120| resp.set_error(result.ec, "Failed to parse request"); 458| 120| } 459| 29.9k| return; 460| 29.9k| } 461| | 462| 330k| const auto& req = result.request; 463| | 464| | // Look up endpoint (transparent comparison avoids allocation) 465| 330k| auto it = endpoints.find(req.query); 466| 330k| if (it == endpoints.end()) { ------------------ | Branch (466:14): [True: 2.25k, False: 328k] ------------------ 467| 2.25k| if (req.is_notify()) { ------------------ | Branch (467:17): [True: 1.10k, False: 1.15k] ------------------ 468| 1.10k| return; // Silent ignore for unknown notifications (buffer stays empty) 469| 1.10k| } 470| 1.15k| resp.reset(req); 471| 1.15k| resp.set_error(error_code::method_not_found, detail::build_invalid_query_error(req.query)); 472| 1.15k| return; 473| 2.25k| } 474| | 475| | // If request has an error, just echo it back -- unless it is a notification, whose sender 476| | // has said it will not read a reply, so answering one desynchronizes the connection: the 477| | // client takes the echo as the answer to its next call. The header parsed and validated 478| | // cleanly to reach here, so its notify bit can be trusted, which is what separates this 479| | // from the malformed-header paths above. 480| 328k| if (bool(req.hdr.ec)) { ------------------ | Branch (480:14): [True: 2.65k, False: 325k] ------------------ 481| 2.65k| if (req.is_notify()) { ------------------ | Branch (481:17): [True: 1.80k, False: 857] ------------------ 482| 1.80k| return; // Silent ignore for a notification that carries an error (buffer stays empty) 483| 1.80k| } 484| 857| resp.reset(req); 485| 857| resp.set_error(req.hdr.ec); 486| 857| return; 487| 2.65k| } 488| | 489| | // Zero-copy call: state_view references the parsed request and response builder directly 490| 325k| repe::state_view state{req, resp}; 491| | 492| 325k| try { 493| 325k| it->second(state); 494| 325k| } 495| 325k| catch (const std::exception& e) { 496| 0| resp.reset(req); 497| 0| resp.set_error(error_code::parse_error, detail::build_registry_error(req.query, e.what())); 498| 0| return; 499| 0| } 500| 325k| catch (...) { 501| 0| resp.reset(req); 502| 0| resp.set_error(error_code::parse_error, "Unknown error"); 503| 0| return; 504| 0| } 505| | 506| | // For notifications, response buffer stays empty (no response sent) 507| 325k| } _ZN3glz6detail19build_version_errorEh: 43| 22| { 44| 22| auto& buf = error_buffer(); 45| 22| buf = "REPE version mismatch: expected 1, got "; 46| 22| const auto n = buf.size(); 47| 22| buf.resize(n + 8); 48| 22| auto* end = glz::to_chars(buf.data() + n, uint32_t(version)); 49| 22| buf.resize(size_t(end - buf.data())); 50| 22| return buf; 51| 22| } _ZN3glz6detail12error_bufferEv: 18| 9.62k| { 19| 9.62k| thread_local std::string buffer; 20| 9.62k| buffer.clear(); 21| 9.62k| return buffer; 22| 9.62k| } _ZN3glz6detail17build_magic_errorEt: 89| 7.66k| { 90| 7.66k| auto& buf = error_buffer(); 91| 7.66k| buf = "REPE magic number mismatch: expected 0x1507, got 0x"; 92| 7.66k| constexpr char hex_chars[] = "0123456789abcdef"; 93| 7.66k| char hex[4]; 94| 7.66k| hex[0] = hex_chars[(spec >> 12) & 0xF]; 95| 7.66k| hex[1] = hex_chars[(spec >> 8) & 0xF]; 96| 7.66k| hex[2] = hex_chars[(spec >> 4) & 0xF]; 97| 7.66k| hex[3] = hex_chars[spec & 0xF]; 98| 7.66k| buf.append(hex, 4); 99| 7.66k| return buf; 100| 7.66k| } _ZN3glz6detail18build_length_errorEmm: 54| 632| { 55| 632| auto& buf = error_buffer(); 56| 632| buf = "REPE length mismatch: expected "; 57| 632| auto n = buf.size(); 58| 632| buf.resize(n + 24); 59| 632| auto* end = glz::to_chars(buf.data() + n, expected); 60| 632| buf.resize(size_t(end - buf.data())); 61| 632| buf.append(", got "); 62| 632| n = buf.size(); 63| 632| buf.resize(n + 24); 64| 632| end = glz::to_chars(buf.data() + n, actual); 65| 632| buf.resize(size_t(end - buf.data())); 66| 632| return buf; 67| 632| } _ZN3glz6detail27build_length_overflow_errorEmm: 72| 150| { 73| 150| auto& buf = error_buffer(); 74| 150| buf = "REPE length overflow: query_length "; 75| 150| auto n = buf.size(); 76| 150| buf.resize(n + 24); 77| 150| auto* end = glz::to_chars(buf.data() + n, query_length); 78| 150| buf.resize(size_t(end - buf.data())); 79| 150| buf.append(" + body_length "); 80| 150| n = buf.size(); 81| 150| buf.resize(n + 24); 82| 150| end = glz::to_chars(buf.data() + n, body_length); 83| 150| buf.resize(size_t(end - buf.data())); 84| 150| buf.append(" exceed uint64_t"); 85| 150| return buf; 86| 150| } _ZN3glz6detail25build_invalid_query_errorENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 35| 1.15k| { 36| 1.15k| auto& buf = error_buffer(); 37| 1.15k| buf = "invalid_query: "; 38| 1.15k| buf.append(query); 39| 1.15k| return buf; 40| 1.15k| } _ZN3glz4repe22checked_message_lengthERKNS0_6headerERm: 52| 539k| { 53| 539k| constexpr uint64_t header_size = sizeof(header); 54| 539k| if (hdr.query_length > (std::numeric_limits::max)() - header_size) { ------------------ | Branch (54:11): [True: 8, False: 539k] ------------------ 55| 8| return false; 56| 8| } 57| 539k| const uint64_t header_and_query = header_size + hdr.query_length; 58| 539k| if (hdr.body_length > (std::numeric_limits::max)() - header_and_query) { ------------------ | Branch (58:11): [True: 292, False: 539k] ------------------ 59| 292| return false; 60| 292| } 61| 539k| expected = header_and_query + hdr.body_length; 62| 539k| return true; 63| 539k| } _ZN3glz4repe11plugin_callINS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EEEEE11repe_bufferRT_PKcm: 34| 15.0k| { 35| | // Use zero-copy span-based call - parses request in-place, writes directly to response buffer 36| | // Exception handling is done internally by the registry 37| 15.0k| registry.call(std::span{request, static_cast(request_size)}, plugin_response_buffer); 38| 15.0k| return {plugin_response_buffer.data(), plugin_response_buffer.size()}; 39| 15.0k| } _ZNK3glz6detail11string_hashclENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 27| 8.89M| [[nodiscard]] size_t operator()(std::string_view txt) const { return std::hash{}(txt); } _ZNK3glz4repe10state_view8has_bodyEv: 556| 241k| [[nodiscard]] bool has_body() const noexcept { return !in.body.empty(); } _ZN3glz4repe16response_builder5resetERKNS0_12request_viewE: 373| 192k| void reset(const request_view& request) noexcept { reset(request.id()); } _ZN3glz4repe16response_builder5resetEm: 360| 222k| { 361| 222k| if (msg_) { ------------------ | Branch (361:14): [True: 0, False: 222k] ------------------ 362| 0| init_header(msg_->header, id); 363| 0| msg_->query.clear(); 364| 0| msg_->body.clear(); 365| 0| } 366| 222k| else { 367| 222k| buffer_->clear(); 368| 222k| init_header(hdr_, id); 369| 222k| } 370| 222k| } _ZN3glz4repe16response_builder11init_headerERNS0_6headerEm: 339| 222k| { 340| 222k| hdr = {}; 341| 222k| hdr.spec = repe_magic; 342| 222k| hdr.version = 1; 343| 222k| hdr.id = id; 344| 222k| } _ZNK3glz4repe12request_view2idEv: 256| 192k| [[nodiscard]] uint64_t id() const noexcept { return hdr.id; } _ZN3glz4repe16response_builder9set_errorENS_10error_codeENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 377| 197k| { 378| 197k| if (msg_) { ------------------ | Branch (378:14): [True: 0, False: 197k] ------------------ 379| 0| msg_->header.ec = ec; 380| 0| msg_->header.body_format = body_format::UTF8; 381| 0| msg_->header.query_length = 0; 382| 0| msg_->header.body_length = error_message.size(); 383| 0| msg_->header.length = sizeof(header) + error_message.size(); 384| 0| msg_->query.clear(); 385| 0| msg_->body = error_message; 386| 0| } 387| 197k| else { 388| 197k| hdr_.ec = ec; 389| 197k| hdr_.body_format = body_format::UTF8; 390| 197k| hdr_.query_length = 0; 391| 197k| hdr_.body_length = error_message.size(); 392| 197k| hdr_.length = sizeof(header) + error_message.size(); 393| | 394| 197k| buffer_->resize(hdr_.length); 395| 197k| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 396| 197k| if (!error_message.empty()) { ------------------ | Branch (396:17): [True: 196k, False: 857] ------------------ 397| 196k| std::memcpy(buffer_->data() + sizeof(header), error_message.data(), error_message.size()); 398| 196k| } 399| 197k| } 400| 197k| } _ZNK3glz4repe10state_view6notifyEv: 555| 325k| [[nodiscard]] bool notify() const noexcept { return in.is_notify(); } _ZNK3glz4repe12request_view9is_notifyEv: 257| 330k| [[nodiscard]] bool is_notify() const noexcept { return hdr.notify != 0; } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEEEvRNS0_10state_viewE: 616| 21.9k| { 617| 21.9k| state.out.reset(state.in); 618| 21.9k| auto ec = state.out.template set_body(nullptr); 619| 21.9k| if (bool(ec)) [[unlikely]] { ------------------ | Branch (619:11): [True: 0, False: 21.9k] ------------------ 620| 0| state.out.set_error(ec, "Failed to serialize response"); 621| 0| } 622| 21.9k| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEDnEENS_10error_codeEOT0_: 413| 21.9k| { 414| 21.9k| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 21.9k] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 21.9k| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 21.9k| std::string body_buffer; 439| 21.9k| auto ec = glz::write(std::forward(value), body_buffer); 440| 21.9k| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 21.9k] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 21.9k| hdr_.ec = error_code::none; 445| 21.9k| if constexpr (Opts.format == JSON) { 446| 21.9k| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 21.9k| hdr_.query_length = 0; 455| 21.9k| hdr_.body_length = body_buffer.size(); 456| 21.9k| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 21.9k| buffer_->resize(hdr_.length); 460| 21.9k| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 21.9k| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 21.9k, False: 0] ------------------ 462| 21.9k| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 21.9k| } 464| 21.9k| return error_code::none; 465| 21.9k| } 466| 21.9k| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERiEEbOT0_RNS0_10state_viewE: 568| 59.2k| { 569| 59.2k| glz::context ctx{}; 570| 59.2k| auto body = state.in.body; 571| 59.2k| auto b = body.data(); 572| 59.2k| auto e = b + body.size(); 573| 59.2k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 59.2k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 123, False: 59.1k] ------------------ 577| 123| ctx.error = error_code::no_read_input; 578| 123| } 579| 59.1k| else { 580| 59.1k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 59.1k| finalize_top_level_read(ctx, start, b, e); 583| 59.1k| } 584| | 585| 59.2k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 57.7k, False: 1.48k] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 57.7k| if (state.notify()) { ------------------ | Branch (588:14): [True: 24.4k, False: 33.3k] ------------------ 589| 24.4k| return false; 590| 24.4k| } 591| | 592| 33.3k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 33.3k| std::string error_message = format_error(ec, body); 594| 33.3k| state.out.reset(state.in); 595| 33.3k| state.out.set_error(ctx.error, error_message); 596| 33.3k| return false; 597| 57.7k| } 598| | 599| 1.48k| return true; 600| 59.2k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERiEEvOT0_RNS0_10state_viewE: 605| 470| { 606| 470| state.out.reset(state.in); 607| 470| auto ec = state.out.template set_body(std::forward(value)); 608| 470| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 470] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 470| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERiEENS_10error_codeEOT0_: 413| 470| { 414| 470| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 470] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 470| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 470| std::string body_buffer; 439| 470| auto ec = glz::write(std::forward(value), body_buffer); 440| 470| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 470] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 470| hdr_.ec = error_code::none; 445| 470| if constexpr (Opts.format == JSON) { 446| 470| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 470| hdr_.query_length = 0; 455| 470| hdr_.body_length = body_buffer.size(); 456| 470| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 470| buffer_->resize(hdr_.length); 460| 470| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 470| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 470, False: 0] ------------------ 462| 470| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 470| } 464| 470| return error_code::none; 465| 470| } 466| 470| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEiEEvOT0_RNS0_10state_viewE: 605| 395| { 606| 395| state.out.reset(state.in); 607| 395| auto ec = state.out.template set_body(std::forward(value)); 608| 395| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 395] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 395| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEiEENS_10error_codeEOT0_: 413| 395| { 414| 395| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 395] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 395| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 395| std::string body_buffer; 439| 395| auto ec = glz::write(std::forward(value), body_buffer); 440| 395| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 395] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 395| hdr_.ec = error_code::none; 445| 395| if constexpr (Opts.format == JSON) { 446| 395| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 395| hdr_.query_length = 0; 455| 395| hdr_.body_length = body_buffer.size(); 456| 395| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 395| buffer_->resize(hdr_.length); 460| 395| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 395| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 395, False: 0] ------------------ 462| 395| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 395| } 464| 395| return error_code::none; 465| 395| } 466| 395| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz5pointEEEbOT0_RNS0_10state_viewE: 568| 44.6k| { 569| 44.6k| glz::context ctx{}; 570| 44.6k| auto body = state.in.body; 571| 44.6k| auto b = body.data(); 572| 44.6k| auto e = b + body.size(); 573| 44.6k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 44.6k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 123, False: 44.5k] ------------------ 577| 123| ctx.error = error_code::no_read_input; 578| 123| } 579| 44.5k| else { 580| 44.5k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 44.5k| finalize_top_level_read(ctx, start, b, e); 583| 44.5k| } 584| | 585| 44.6k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 44.4k, False: 200] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 44.4k| if (state.notify()) { ------------------ | Branch (588:14): [True: 18.5k, False: 25.9k] ------------------ 589| 18.5k| return false; 590| 18.5k| } 591| | 592| 25.9k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 25.9k| std::string error_message = format_error(ec, body); 594| 25.9k| state.out.reset(state.in); 595| 25.9k| state.out.set_error(ctx.error, error_message); 596| 25.9k| return false; 597| 44.4k| } 598| | 599| 200| return true; 600| 44.6k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointEEEvOT0_RNS0_10state_viewE: 605| 136| { 606| 136| state.out.reset(state.in); 607| 136| auto ec = state.out.template set_body(std::forward(value)); 608| 136| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 136] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 136| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointEEENS_10error_codeEOT0_: 413| 136| { 414| 136| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 136] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 136| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 136| std::string body_buffer; 439| 136| auto ec = glz::write(std::forward(value), body_buffer); 440| 136| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 136] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 136| hdr_.ec = error_code::none; 445| 136| if constexpr (Opts.format == JSON) { 446| 136| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 136| hdr_.query_length = 0; 455| 136| hdr_.body_length = body_buffer.size(); 456| 136| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 136| buffer_->resize(hdr_.length); 460| 136| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 136| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 136, False: 0] ------------------ 462| 136| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 136| } 464| 136| return error_code::none; 465| 136| } 466| 136| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz6nestedEEEbOT0_RNS0_10state_viewE: 568| 29.9k| { 569| 29.9k| glz::context ctx{}; 570| 29.9k| auto body = state.in.body; 571| 29.9k| auto b = body.data(); 572| 29.9k| auto e = b + body.size(); 573| 29.9k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 29.9k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 29.9k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 29.9k| else { 580| 29.9k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 29.9k| finalize_top_level_read(ctx, start, b, e); 583| 29.9k| } 584| | 585| 29.9k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 29.3k, False: 541] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 29.3k| if (state.notify()) { ------------------ | Branch (588:14): [True: 12.5k, False: 16.8k] ------------------ 589| 12.5k| return false; 590| 12.5k| } 591| | 592| 16.8k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 16.8k| std::string error_message = format_error(ec, body); 594| 16.8k| state.out.reset(state.in); 595| 16.8k| state.out.set_error(ctx.error, error_message); 596| 16.8k| return false; 597| 29.3k| } 598| | 599| 541| return true; 600| 29.9k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEEEvOT0_RNS0_10state_viewE: 605| 370| { 606| 370| state.out.reset(state.in); 607| 370| auto ec = state.out.template set_body(std::forward(value)); 608| 370| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 370] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 370| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEENS_10error_codeEOT0_: 413| 370| { 414| 370| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 370] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 370| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 370| std::string body_buffer; 439| 370| auto ec = glz::write(std::forward(value), body_buffer); 440| 370| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 370] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 370| hdr_.ec = error_code::none; 445| 370| if constexpr (Opts.format == JSON) { 446| 370| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 370| hdr_.query_length = 0; 455| 370| hdr_.body_length = body_buffer.size(); 456| 370| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 370| buffer_->resize(hdr_.length); 460| 370| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 370| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 370, False: 0] ------------------ 462| 370| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 370| } 464| 370| return error_code::none; 465| 370| } 466| 370| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz8fuzz_apiEEEbOT0_RNS0_10state_viewE: 568| 26.0k| { 569| 26.0k| glz::context ctx{}; 570| 26.0k| auto body = state.in.body; 571| 26.0k| auto b = body.data(); 572| 26.0k| auto e = b + body.size(); 573| 26.0k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 26.0k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 26.0k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 26.0k| else { 580| 26.0k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 26.0k| finalize_top_level_read(ctx, start, b, e); 583| 26.0k| } 584| | 585| 26.0k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 26.0k, False: 58] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 26.0k| if (state.notify()) { ------------------ | Branch (588:14): [True: 10.8k, False: 15.2k] ------------------ 589| 10.8k| return false; 590| 10.8k| } 591| | 592| 15.2k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 15.2k| std::string error_message = format_error(ec, body); 594| 15.2k| state.out.reset(state.in); 595| 15.2k| state.out.set_error(ctx.error, error_message); 596| 15.2k| return false; 597| 26.0k| } 598| | 599| 58| return true; 600| 26.0k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz8fuzz_apiEEEvOT0_RNS0_10state_viewE: 605| 76| { 606| 76| state.out.reset(state.in); 607| 76| auto ec = state.out.template set_body(std::forward(value)); 608| 76| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 76] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 76| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz8fuzz_apiEEENS_10error_codeEOT0_: 413| 76| { 414| 76| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 76] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 76| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 76| std::string body_buffer; 439| 76| auto ec = glz::write(std::forward(value), body_buffer); 440| 76| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 76] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 76| hdr_.ec = error_code::none; 445| 76| if constexpr (Opts.format == JSON) { 446| 76| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 76| hdr_.query_length = 0; 455| 76| hdr_.body_length = body_buffer.size(); 456| 76| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 76| buffer_->resize(hdr_.length); 460| 76| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 76| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 76, False: 0] ------------------ 462| 76| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 76| } 464| 76| return error_code::none; 465| 76| } 466| 76| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEEEbOT0_RNS0_10state_viewE: 568| 44.6k| { 569| 44.6k| glz::context ctx{}; 570| 44.6k| auto body = state.in.body; 571| 44.6k| auto b = body.data(); 572| 44.6k| auto e = b + body.size(); 573| 44.6k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 44.6k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 123, False: 44.4k] ------------------ 577| 123| ctx.error = error_code::no_read_input; 578| 123| } 579| 44.4k| else { 580| 44.4k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 44.4k| finalize_top_level_read(ctx, start, b, e); 583| 44.4k| } 584| | 585| 44.6k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 43.0k, False: 1.57k] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 43.0k| if (state.notify()) { ------------------ | Branch (588:14): [True: 18.0k, False: 24.9k] ------------------ 589| 18.0k| return false; 590| 18.0k| } 591| | 592| 24.9k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 24.9k| std::string error_message = format_error(ec, body); 594| 24.9k| state.out.reset(state.in); 595| 24.9k| state.out.set_error(ctx.error, error_message); 596| 24.9k| return false; 597| 43.0k| } 598| | 599| 1.57k| return true; 600| 44.6k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEEEvOT0_RNS0_10state_viewE: 605| 506| { 606| 506| state.out.reset(state.in); 607| 506| auto ec = state.out.template set_body(std::forward(value)); 608| 506| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 506] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 506| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEENS_10error_codeEOT0_: 413| 506| { 414| 506| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 506] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 506| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 506| std::string body_buffer; 439| 506| auto ec = glz::write(std::forward(value), body_buffer); 440| 506| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 506] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 506| hdr_.ec = error_code::none; 445| 506| if constexpr (Opts.format == JSON) { 446| 506| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 506| hdr_.query_length = 0; 455| 506| hdr_.body_length = body_buffer.size(); 456| 506| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 506| buffer_->resize(hdr_.length); 460| 506| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 506| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 506, False: 0] ------------------ 462| 506| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 506| } 464| 506| return error_code::none; 465| 506| } 466| 506| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERdEEbOT0_RNS0_10state_viewE: 568| 14.7k| { 569| 14.7k| glz::context ctx{}; 570| 14.7k| auto body = state.in.body; 571| 14.7k| auto b = body.data(); 572| 14.7k| auto e = b + body.size(); 573| 14.7k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 14.7k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 14.7k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 14.7k| else { 580| 14.7k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 14.7k| finalize_top_level_read(ctx, start, b, e); 583| 14.7k| } 584| | 585| 14.7k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 12.8k, False: 1.93k] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 12.8k| if (state.notify()) { ------------------ | Branch (588:14): [True: 5.37k, False: 7.47k] ------------------ 589| 5.37k| return false; 590| 5.37k| } 591| | 592| 7.47k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 7.47k| std::string error_message = format_error(ec, body); 594| 7.47k| state.out.reset(state.in); 595| 7.47k| state.out.set_error(ctx.error, error_message); 596| 7.47k| return false; 597| 12.8k| } 598| | 599| 1.93k| return true; 600| 14.7k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERdEEvOT0_RNS0_10state_viewE: 605| 578| { 606| 578| state.out.reset(state.in); 607| 578| auto ec = state.out.template set_body(std::forward(value)); 608| 578| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 578] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 578| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERdEENS_10error_codeEOT0_: 413| 578| { 414| 578| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 578] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 578| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 578| std::string body_buffer; 439| 578| auto ec = glz::write(std::forward(value), body_buffer); 440| 578| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 578] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 578| hdr_.ec = error_code::none; 445| 578| if constexpr (Opts.format == JSON) { 446| 578| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 578| hdr_.query_length = 0; 455| 578| hdr_.body_length = body_buffer.size(); 456| 578| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 578| buffer_->resize(hdr_.length); 460| 578| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 578| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 578, False: 0] ------------------ 462| 578| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 578| } 464| 578| return error_code::none; 465| 578| } 466| 578| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz5pointEEEvOT0_RNS0_10state_viewE: 605| 135| { 606| 135| state.out.reset(state.in); 607| 135| auto ec = state.out.template set_body(std::forward(value)); 608| 135| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 135] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 135| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz5pointEEENS_10error_codeEOT0_: 413| 135| { 414| 135| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 135] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 135| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 135| std::string body_buffer; 439| 135| auto ec = glz::write(std::forward(value), body_buffer); 440| 135| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 135] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 135| hdr_.ec = error_code::none; 445| 135| if constexpr (Opts.format == JSON) { 446| 135| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 135| hdr_.query_length = 0; 455| 135| hdr_.body_length = body_buffer.size(); 456| 135| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 135| buffer_->resize(hdr_.length); 460| 135| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 135| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 135, False: 0] ------------------ 462| 135| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 135| } 464| 135| return error_code::none; 465| 135| } 466| 135| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz6nestedEEEvOT0_RNS0_10state_viewE: 605| 74| { 606| 74| state.out.reset(state.in); 607| 74| auto ec = state.out.template set_body(std::forward(value)); 608| 74| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 74] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 74| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERN9repe_fuzz6nestedEEENS_10error_codeEOT0_: 413| 74| { 414| 74| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 74] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 74| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 74| std::string body_buffer; 439| 74| auto ec = glz::write(std::forward(value), body_buffer); 440| 74| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 74] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 74| hdr_.ec = error_code::none; 445| 74| if constexpr (Opts.format == JSON) { 446| 74| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 74| hdr_.query_length = 0; 455| 74| hdr_.body_length = body_buffer.size(); 456| 74| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 74| buffer_->resize(hdr_.length); 460| 74| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 74| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 74, False: 0] ------------------ 462| 74| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 74| } 464| 74| return error_code::none; 465| 74| } 466| 74| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIiNS3_9allocatorIiEEEEEEbOT0_RNS0_10state_viewE: 568| 15.0k| { 569| 15.0k| glz::context ctx{}; 570| 15.0k| auto body = state.in.body; 571| 15.0k| auto b = body.data(); 572| 15.0k| auto e = b + body.size(); 573| 15.0k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 15.0k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 15.0k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 15.0k| else { 580| 15.0k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 15.0k| finalize_top_level_read(ctx, start, b, e); 583| 15.0k| } 584| | 585| 15.0k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 14.9k, False: 100] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 14.9k| if (state.notify()) { ------------------ | Branch (588:14): [True: 6.18k, False: 8.73k] ------------------ 589| 6.18k| return false; 590| 6.18k| } 591| | 592| 8.73k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 8.73k| std::string error_message = format_error(ec, body); 594| 8.73k| state.out.reset(state.in); 595| 8.73k| state.out.set_error(ctx.error, error_message); 596| 8.73k| return false; 597| 14.9k| } 598| | 599| 100| return true; 600| 15.0k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIiNS3_9allocatorIiEEEEEEvOT0_RNS0_10state_viewE: 605| 74| { 606| 74| state.out.reset(state.in); 607| 74| auto ec = state.out.template set_body(std::forward(value)); 608| 74| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 74] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 74| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIiNS4_9allocatorIiEEEEEENS_10error_codeEOT0_: 413| 74| { 414| 74| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 74] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 74| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 74| std::string body_buffer; 439| 74| auto ec = glz::write(std::forward(value), body_buffer); 440| 74| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 74] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 74| hdr_.ec = error_code::none; 445| 74| if constexpr (Opts.format == JSON) { 446| 74| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 74| hdr_.query_length = 0; 455| 74| hdr_.body_length = body_buffer.size(); 456| 74| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 74| buffer_->resize(hdr_.length); 460| 74| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 74| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 74, False: 0] ------------------ 462| 74| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 74| } 464| 74| return error_code::none; 465| 74| } 466| 74| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__13mapINS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEiNS3_4lessISA_EENS8_INS3_4pairIKSA_iEEEEEEEEbOT0_RNS0_10state_viewE: 568| 15.1k| { 569| 15.1k| glz::context ctx{}; 570| 15.1k| auto body = state.in.body; 571| 15.1k| auto b = body.data(); 572| 15.1k| auto e = b + body.size(); 573| 15.1k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 15.1k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 15.1k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 15.1k| else { 580| 15.1k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 15.1k| finalize_top_level_read(ctx, start, b, e); 583| 15.1k| } 584| | 585| 15.1k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 15.1k, False: 51] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 15.1k| if (state.notify()) { ------------------ | Branch (588:14): [True: 6.17k, False: 8.93k] ------------------ 589| 6.17k| return false; 590| 6.17k| } 591| | 592| 8.93k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 8.93k| std::string error_message = format_error(ec, body); 594| 8.93k| state.out.reset(state.in); 595| 8.93k| state.out.set_error(ctx.error, error_message); 596| 8.93k| return false; 597| 15.1k| } 598| | 599| 51| return true; 600| 15.1k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__13mapINS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEiNS3_4lessISA_EENS8_INS3_4pairIKSA_iEEEEEEEEvOT0_RNS0_10state_viewE: 605| 74| { 606| 74| state.out.reset(state.in); 607| 74| auto ec = state.out.template set_body(std::forward(value)); 608| 74| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 74] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 74| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__13mapINS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEiNS4_4lessISB_EENS9_INS4_4pairIKSB_iEEEEEEEENS_10error_codeEOT0_: 413| 74| { 414| 74| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 74] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 74| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 74| std::string body_buffer; 439| 74| auto ec = glz::write(std::forward(value), body_buffer); 440| 74| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 74] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 74| hdr_.ec = error_code::none; 445| 74| if constexpr (Opts.format == JSON) { 446| 74| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 74| hdr_.query_length = 0; 455| 74| hdr_.body_length = body_buffer.size(); 456| 74| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 74| buffer_->resize(hdr_.length); 460| 74| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 74| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 74, False: 0] ------------------ 462| 74| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 74| } 464| 74| return error_code::none; 465| 74| } 466| 74| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__18optionalIdEEEEbOT0_RNS0_10state_viewE: 568| 14.7k| { 569| 14.7k| glz::context ctx{}; 570| 14.7k| auto body = state.in.body; 571| 14.7k| auto b = body.data(); 572| 14.7k| auto e = b + body.size(); 573| 14.7k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 14.7k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 14.7k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 14.7k| else { 580| 14.7k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 14.7k| finalize_top_level_read(ctx, start, b, e); 583| 14.7k| } 584| | 585| 14.7k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 12.8k, False: 1.93k] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 12.8k| if (state.notify()) { ------------------ | Branch (588:14): [True: 5.37k, False: 7.47k] ------------------ 589| 5.37k| return false; 590| 5.37k| } 591| | 592| 7.47k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 7.47k| std::string error_message = format_error(ec, body); 594| 7.47k| state.out.reset(state.in); 595| 7.47k| state.out.set_error(ctx.error, error_message); 596| 7.47k| return false; 597| 12.8k| } 598| | 599| 1.93k| return true; 600| 14.7k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__18optionalIdEEEEvOT0_RNS0_10state_viewE: 605| 74| { 606| 74| state.out.reset(state.in); 607| 74| auto ec = state.out.template set_body(std::forward(value)); 608| 74| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 74] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 74| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__18optionalIdEEEENS_10error_codeEOT0_: 413| 74| { 414| 74| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 74] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 74| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 74| std::string body_buffer; 439| 74| auto ec = glz::write(std::forward(value), body_buffer); 440| 74| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 74] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 74| hdr_.ec = error_code::none; 445| 74| if constexpr (Opts.format == JSON) { 446| 74| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 74| hdr_.query_length = 0; 455| 74| hdr_.body_length = body_buffer.size(); 456| 74| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 74| buffer_->resize(hdr_.length); 460| 74| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 74| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 74, False: 0] ------------------ 462| 74| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 74| } 464| 74| return error_code::none; 465| 74| } 466| 74| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__17variantIJNS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEN9repe_fuzz6amountEEEEEEbOT0_RNS0_10state_viewE: 568| 14.7k| { 569| 14.7k| glz::context ctx{}; 570| 14.7k| auto body = state.in.body; 571| 14.7k| auto b = body.data(); 572| 14.7k| auto e = b + body.size(); 573| 14.7k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 14.7k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 0, False: 14.7k] ------------------ 577| 0| ctx.error = error_code::no_read_input; 578| 0| } 579| 14.7k| else { 580| 14.7k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 14.7k| finalize_top_level_read(ctx, start, b, e); 583| 14.7k| } 584| | 585| 14.7k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 14.2k, False: 540] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 14.2k| if (state.notify()) { ------------------ | Branch (588:14): [True: 5.98k, False: 8.27k] ------------------ 589| 5.98k| return false; 590| 5.98k| } 591| | 592| 8.27k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 8.27k| std::string error_message = format_error(ec, body); 594| 8.27k| state.out.reset(state.in); 595| 8.27k| state.out.set_error(ctx.error, error_message); 596| 8.27k| return false; 597| 14.2k| } 598| | 599| 540| return true; 600| 14.7k| } _ZN3glz4repe14write_responseITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__17variantIJNS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEN9repe_fuzz6amountEEEEEEvOT0_RNS0_10state_viewE: 605| 74| { 606| 74| state.out.reset(state.in); 607| 74| auto ec = state.out.template set_body(std::forward(value)); 608| 74| if (bool(ec)) [[unlikely]] { ------------------ | Branch (608:11): [True: 0, False: 74] ------------------ 609| 0| state.out.set_error(ec, "Failed to serialize response"); 610| 0| } 611| 74| } _ZN3glz4repe16response_builder8set_bodyITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__17variantIJNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEN9repe_fuzz6amountEEEEEENS_10error_codeEOT0_: 413| 74| { 414| 74| if (msg_) { ------------------ | Branch (414:14): [True: 0, False: 74] ------------------ 415| | // Write directly to message body 416| 0| auto ec = glz::write(std::forward(value), msg_->body); 417| 0| if (ec) { ------------------ | Branch (417:17): [True: 0, False: 0] ------------------ 418| 0| return ec.ec; 419| 0| } 420| | 421| 0| msg_->header.ec = error_code::none; 422| 0| if constexpr (Opts.format == JSON) { 423| 0| msg_->header.body_format = body_format::JSON; 424| | } 425| | else if constexpr (Opts.format == BEVE) { 426| | msg_->header.body_format = body_format::BEVE; 427| | } 428| | else { 429| | msg_->header.body_format = body_format::JSON; 430| | } 431| 0| msg_->header.query_length = 0; 432| 0| msg_->header.body_length = msg_->body.size(); 433| 0| msg_->header.length = sizeof(header) + msg_->body.size(); 434| 0| return error_code::none; 435| 0| } 436| 74| else { 437| | // Serialize body to temporary buffer first (glz::write clears the buffer) 438| 74| std::string body_buffer; 439| 74| auto ec = glz::write(std::forward(value), body_buffer); 440| 74| if (ec) { ------------------ | Branch (440:17): [True: 0, False: 74] ------------------ 441| 0| return ec.ec; 442| 0| } 443| | 444| 74| hdr_.ec = error_code::none; 445| 74| if constexpr (Opts.format == JSON) { 446| 74| hdr_.body_format = body_format::JSON; 447| | } 448| | else if constexpr (Opts.format == BEVE) { 449| | hdr_.body_format = body_format::BEVE; 450| | } 451| | else { 452| | hdr_.body_format = body_format::JSON; 453| | } 454| 74| hdr_.query_length = 0; 455| 74| hdr_.body_length = body_buffer.size(); 456| 74| hdr_.length = sizeof(header) + body_buffer.size(); 457| | 458| | // Write header then body 459| 74| buffer_->resize(hdr_.length); 460| 74| std::memcpy(buffer_->data(), &hdr_, sizeof(header)); 461| 74| if (!body_buffer.empty()) { ------------------ | Branch (461:17): [True: 74, False: 0] ------------------ 462| 74| std::memcpy(buffer_->data() + sizeof(header), body_buffer.data(), body_buffer.size()); 463| 74| } 464| 74| return error_code::none; 465| 74| } 466| 74| } _ZN3glz4repe11read_paramsITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERNSt3__16vectorIdNS3_9allocatorIdEEEEEEbOT0_RNS0_10state_viewE: 568| 14.9k| { 569| 14.9k| glz::context ctx{}; 570| 14.9k| auto body = state.in.body; 571| 14.9k| auto b = body.data(); 572| 14.9k| auto e = b + body.size(); 573| 14.9k| auto start = b; 574| | 575| | // An empty body answers like any other failure; see the note in the message overload above. 576| 14.9k| if (body.empty()) [[unlikely]] { ------------------ | Branch (576:11): [True: 123, False: 14.7k] ------------------ 577| 123| ctx.error = error_code::no_read_input; 578| 123| } 579| 14.7k| else { 580| 14.7k| glz::parse::template op()>(std::forward(value), ctx, b, e); 581| | // See the note in the message overload above for why glz::read's bookkeeping is repeated. 582| 14.7k| finalize_top_level_read(ctx, start, b, e); 583| 14.7k| } 584| | 585| 14.9k| if (bool(ctx.error)) { ------------------ | Branch (585:11): [True: 14.4k, False: 511] ------------------ 586| | // A notification is a request the sender has said it will not read a reply to, so a failed 587| | // read of one is reported by not answering, exactly as a successful read of one is. 588| 14.4k| if (state.notify()) { ------------------ | Branch (588:14): [True: 6.19k, False: 8.21k] ------------------ 589| 6.19k| return false; 590| 6.19k| } 591| | 592| 8.21k| error_ctx ec{size_t(b - start), ctx.error, ctx.custom_error_message}; 593| 8.21k| std::string error_message = format_error(ec, body); 594| 8.21k| state.out.reset(state.in); 595| 8.21k| state.out.set_error(ctx.error, error_message); 596| 8.21k| return false; 597| 14.4k| } 598| | 599| 511| return true; 600| 14.9k| } _ZN3glz4repe16response_builderC2ERNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEE: 347| 360k| explicit response_builder(std::string& buffer) noexcept : buffer_(&buffer) {} _ZNK3glz4repe12parse_resultcvbEv: 268| 360k| [[nodiscard]] explicit operator bool() const noexcept { return ec == error_code::none; } _ZN3glz4repe13parse_requestENSt3__14spanIKcLm18446744073709551615EEE: 277| 567k| { 278| 567k| parse_result result{}; 279| | 280| 567k| if (buffer.size() < sizeof(header)) { ------------------ | Branch (280:11): [True: 21.3k, False: 546k] ------------------ 281| 21.3k| result.ec = error_code::invalid_header; 282| 21.3k| return result; 283| 21.3k| } 284| | 285| | // Copy header via memcpy for alignment safety (48 bytes, ~2-5ns) 286| 546k| std::memcpy(&result.request.hdr, buffer.data(), sizeof(header)); 287| | 288| 546k| if (result.request.hdr.spec != repe_magic) { ------------------ | Branch (288:11): [True: 7.66k, False: 538k] ------------------ 289| 7.66k| result.ec = error_code::invalid_header; 290| 7.66k| return result; 291| 7.66k| } 292| | 293| 538k| if (result.request.hdr.version != 1) { ------------------ | Branch (293:11): [True: 22, False: 538k] ------------------ 294| 22| result.ec = error_code::version_mismatch; 295| 22| return result; 296| 22| } 297| | 298| 538k| const auto& hdr = result.request.hdr; 299| 538k| uint64_t expected_length{}; 300| 538k| if (!checked_message_length(hdr, expected_length)) { ------------------ | Branch (300:11): [True: 150, False: 538k] ------------------ 301| 150| result.ec = error_code::invalid_header; 302| 150| return result; 303| 150| } 304| | 305| | // Validate header.length field matches expected value 306| 538k| if (hdr.length != expected_length) { ------------------ | Branch (306:11): [True: 632, False: 537k] ------------------ 307| 632| result.ec = error_code::invalid_header; 308| 632| return result; 309| 632| } 310| | 311| 537k| if (uint64_t(buffer.size()) < expected_length) { ------------------ | Branch (311:11): [True: 120, False: 537k] ------------------ 312| 120| result.ec = error_code::invalid_body; 313| 120| return result; 314| 120| } 315| | 316| | // Set up views into the original buffer 317| 537k| result.request.query = {buffer.data() + sizeof(header), static_cast(hdr.query_length)}; 318| 537k| result.request.body = {buffer.data() + sizeof(header) + hdr.query_length, static_cast(hdr.body_length)}; 319| 537k| result.ec = error_code::none; 320| | 321| 537k| return result; 322| 537k| } _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE17register_endpointIN9repe_fuzz10member_apiENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_: 27| 345k| { 28| 345k| reg.endpoints[path] = [&value](repe::state_view& state) mutable { 29| 345k| if (state.has_body()) { 30| 345k| if (!read_params(value, state)) { 31| 345k| return; 32| 345k| } 33| 345k| } 34| | 35| 345k| if (state.notify()) { 36| 345k| return; 37| 345k| } 38| | 39| 345k| if (not state.has_body()) { 40| 345k| write_response(value, state); 41| 345k| } 42| 345k| else { 43| 345k| write_response(state); 44| 345k| } 45| 345k| }; 46| 345k| } _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointIiNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEERT_RT0_: 151| 1.06M| { 152| 1.06M| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 1.06M| if (state.has_body()) { 154| 1.06M| if (!read_params(var, state)) { 155| 1.06M| return; 156| 1.06M| } 157| 1.06M| } 158| | 159| 1.06M| if (state.notify()) { 160| 1.06M| return; 161| 1.06M| } 162| | 163| 1.06M| if (not state.has_body()) { 164| 1.06M| write_response(var, state); 165| 1.06M| } 166| 1.06M| else { 167| 1.06M| write_response(state); 168| 1.06M| } 169| 1.06M| }; 170| 1.06M| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointIiNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESH_: 152| 29.8k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 29.8k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 29.5k, False: 244] ------------------ 154| 29.5k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 28.8k, False: 741] ------------------ 155| 28.8k| return; 156| 28.8k| } 157| 29.5k| } 158| | 159| 985| if (state.notify()) { ------------------ | Branch (159:17): [True: 199, False: 786] ------------------ 160| 199| return; 161| 199| } 162| | 163| 786| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 147, False: 639] ------------------ 164| 147| write_response(var, state); 165| 147| } 166| 639| else { 167| 639| write_response(state); 168| 639| } 169| 786| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE45register_member_function_with_params_endpointIN9repe_fuzz10member_apiEMS5_FiiEiiNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNSA_11char_traitsIcEEEERT_T0_RT3_: 198| 345k| { 199| 345k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 200| 345k| static thread_local Input input{}; 201| 345k| input = {}; // reset to avoid stale optional/variant fields across calls 202| 345k| if (state.has_body()) { 203| 345k| if (!read_params(input, state)) { 204| 345k| return; 205| 345k| } 206| 345k| } 207| | 208| 345k| if constexpr (std::same_as) { 209| 345k| (value.*func)(input); 210| | 211| 345k| if (state.notify()) { 212| 345k| return; 213| 345k| } 214| | 215| 345k| write_response(state); 216| 345k| } 217| 345k| else { 218| 345k| if (state.notify()) { 219| 345k| std::ignore = (value.*func)(input); 220| 345k| return; 221| 345k| } 222| | 223| 345k| write_response((value.*func)(input), state); 224| 345k| } 225| 345k| }; 226| 345k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE45register_member_function_with_params_endpointIN9repe_fuzz10member_apiEMS5_FiiEiiNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNSA_11char_traitsIcEEEERT_T0_RT3_ENUlRNS_4repe10state_viewEE_clESM_: 199| 14.9k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 200| 14.9k| static thread_local Input input{}; 201| 14.9k| input = {}; // reset to avoid stale optional/variant fields across calls 202| 14.9k| if (state.has_body()) { ------------------ | Branch (202:17): [True: 14.7k, False: 123] ------------------ 203| 14.7k| if (!read_params(input, state)) { ------------------ | Branch (203:20): [True: 14.4k, False: 372] ------------------ 204| 14.4k| return; 205| 14.4k| } 206| 14.7k| } 207| | 208| | if constexpr (std::same_as) { 209| | (value.*func)(input); 210| | 211| | if (state.notify()) { 212| | return; 213| | } 214| | 215| | write_response(state); 216| | } 217| 495| else { 218| 495| if (state.notify()) { ------------------ | Branch (218:20): [True: 100, False: 395] ------------------ 219| 100| std::ignore = (value.*func)(input); 220| 100| return; 221| 100| } 222| | 223| 395| write_response((value.*func)(input), state); 224| 395| } 225| 495| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE33register_member_function_endpointIN9repe_fuzz10member_apiEMS5_FvvEvNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNSA_11char_traitsIcEEEERT_T0_RT2_: 174| 345k| { 175| 345k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 176| 345k| if constexpr (std::same_as) { 177| 345k| (value.*func)(); 178| | 179| 345k| if (state.notify()) { 180| 345k| return; 181| 345k| } 182| | 183| 345k| write_response(state); 184| 345k| } 185| 345k| else { 186| 345k| if (state.notify()) { 187| 345k| std::ignore = (value.*func)(); 188| 345k| return; 189| 345k| } 190| | 191| 345k| write_response((value.*func)(), state); 192| 345k| } 193| 345k| }; 194| 345k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE33register_member_function_endpointIN9repe_fuzz10member_apiEMS5_FvvEvNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNSA_11char_traitsIcEEEERT_T0_RT2_ENUlRNS_4repe10state_viewEE_clESM_: 175| 14.8k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 176| 14.8k| if constexpr (std::same_as) { 177| 14.8k| (value.*func)(); 178| | 179| 14.8k| if (state.notify()) { ------------------ | Branch (179:20): [True: 6.19k, False: 8.70k] ------------------ 180| 6.19k| return; 181| 6.19k| } 182| | 183| 8.70k| write_response(state); 184| | } 185| | else { 186| | if (state.notify()) { 187| | std::ignore = (value.*func)(); 188| | return; 189| | } 190| | 191| | write_response((value.*func)(), state); 192| | } 193| 14.8k| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE45register_member_function_with_params_endpointIN9repe_fuzz10member_apiEMS5_FNS4_5pointERKS6_ES6_S6_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNSD_11char_traitsIcEEEERT_T0_RT3_: 198| 345k| { 199| 345k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 200| 345k| static thread_local Input input{}; 201| 345k| input = {}; // reset to avoid stale optional/variant fields across calls 202| 345k| if (state.has_body()) { 203| 345k| if (!read_params(input, state)) { 204| 345k| return; 205| 345k| } 206| 345k| } 207| | 208| 345k| if constexpr (std::same_as) { 209| 345k| (value.*func)(input); 210| | 211| 345k| if (state.notify()) { 212| 345k| return; 213| 345k| } 214| | 215| 345k| write_response(state); 216| 345k| } 217| 345k| else { 218| 345k| if (state.notify()) { 219| 345k| std::ignore = (value.*func)(input); 220| 345k| return; 221| 345k| } 222| | 223| 345k| write_response((value.*func)(input), state); 224| 345k| } 225| 345k| }; 226| 345k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE45register_member_function_with_params_endpointIN9repe_fuzz10member_apiEMS5_FNS4_5pointERKS6_ES6_S6_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNSD_11char_traitsIcEEEERT_T0_RT3_ENUlRNS_4repe10state_viewEE_clESP_: 199| 14.9k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 200| 14.9k| static thread_local Input input{}; 201| 14.9k| input = {}; // reset to avoid stale optional/variant fields across calls 202| 14.9k| if (state.has_body()) { ------------------ | Branch (202:17): [True: 14.8k, False: 123] ------------------ 203| 14.8k| if (!read_params(input, state)) { ------------------ | Branch (203:20): [True: 14.7k, False: 67] ------------------ 204| 14.7k| return; 205| 14.7k| } 206| 14.8k| } 207| | 208| | if constexpr (std::same_as) { 209| | (value.*func)(input); 210| | 211| | if (state.notify()) { 212| | return; 213| | } 214| | 215| | write_response(state); 216| | } 217| 190| else { 218| 190| if (state.notify()) { ------------------ | Branch (218:20): [True: 54, False: 136] ------------------ 219| 54| std::ignore = (value.*func)(input); 220| 54| return; 221| 54| } 222| | 223| 136| write_response((value.*func)(input), state); 224| 136| } 225| 190| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE45register_member_function_with_params_endpointIN9repe_fuzz10member_apiEMS5_FNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEERKNS4_6nestedEESD_SC_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS6_17basic_string_viewIcS9_EERT_T0_RT3_: 198| 345k| { 199| 345k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 200| 345k| static thread_local Input input{}; 201| 345k| input = {}; // reset to avoid stale optional/variant fields across calls 202| 345k| if (state.has_body()) { 203| 345k| if (!read_params(input, state)) { 204| 345k| return; 205| 345k| } 206| 345k| } 207| | 208| 345k| if constexpr (std::same_as) { 209| 345k| (value.*func)(input); 210| | 211| 345k| if (state.notify()) { 212| 345k| return; 213| 345k| } 214| | 215| 345k| write_response(state); 216| 345k| } 217| 345k| else { 218| 345k| if (state.notify()) { 219| 345k| std::ignore = (value.*func)(input); 220| 345k| return; 221| 345k| } 222| | 223| 345k| write_response((value.*func)(input), state); 224| 345k| } 225| 345k| }; 226| 345k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE45register_member_function_with_params_endpointIN9repe_fuzz10member_apiEMS5_FNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEERKNS4_6nestedEESD_SC_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS6_17basic_string_viewIcS9_EERT_T0_RT3_ENUlRNS_4repe10state_viewEE_clEST_: 199| 15.2k| reg.endpoints[path] = [&value, func](repe::state_view& state) mutable { 200| 15.2k| static thread_local Input input{}; 201| 15.2k| input = {}; // reset to avoid stale optional/variant fields across calls 202| 15.2k| if (state.has_body()) { ------------------ | Branch (202:17): [True: 15.1k, False: 123] ------------------ 203| 15.1k| if (!read_params(input, state)) { ------------------ | Branch (203:20): [True: 14.8k, False: 305] ------------------ 204| 14.8k| return; 205| 14.8k| } 206| 15.1k| } 207| | 208| | if constexpr (std::same_as) { 209| | (value.*func)(input); 210| | 211| | if (state.notify()) { 212| | return; 213| | } 214| | 215| | write_response(state); 216| | } 217| 428| else { 218| 428| if (state.notify()) { ------------------ | Branch (218:20): [True: 58, False: 370] ------------------ 219| 58| std::ignore = (value.*func)(input); 220| 58| return; 221| 58| } 222| | 223| 370| write_response((value.*func)(input), state); 224| 370| } 225| 428| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE17register_endpointIN9repe_fuzz8fuzz_apiENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_: 27| 360k| { 28| 360k| reg.endpoints[path] = [&value](repe::state_view& state) mutable { 29| 360k| if (state.has_body()) { 30| 360k| if (!read_params(value, state)) { 31| 360k| return; 32| 360k| } 33| 360k| } 34| | 35| 360k| if (state.notify()) { 36| 360k| return; 37| 360k| } 38| | 39| 360k| if (not state.has_body()) { 40| 360k| write_response(value, state); 41| 360k| } 42| 360k| else { 43| 360k| write_response(state); 44| 360k| } 45| 360k| }; 46| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE17register_endpointIN9repe_fuzz8fuzz_apiENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESJ_: 28| 26.2k| reg.endpoints[path] = [&value](repe::state_view& state) mutable { 29| 26.2k| if (state.has_body()) { ------------------ | Branch (29:17): [True: 26.0k, False: 137] ------------------ 30| 26.0k| if (!read_params(value, state)) { ------------------ | Branch (30:20): [True: 26.0k, False: 58] ------------------ 31| 26.0k| return; 32| 26.0k| } 33| 26.0k| } 34| | 35| 195| if (state.notify()) { ------------------ | Branch (35:17): [True: 68, False: 127] ------------------ 36| 68| return; 37| 68| } 38| | 39| 127| if (not state.has_body()) { ------------------ | Branch (39:17): [True: 76, False: 51] ------------------ 40| 76| write_response(value, state); 41| 76| } 42| 51| else { 43| 51| write_response(state); 44| 51| } 45| 127| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS7_EERT_RT0_: 151| 721k| { 152| 721k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 721k| if (state.has_body()) { 154| 721k| if (!read_params(var, state)) { 155| 721k| return; 156| 721k| } 157| 721k| } 158| | 159| 721k| if (state.notify()) { 160| 721k| return; 161| 721k| } 162| | 163| 721k| if (not state.has_body()) { 164| 721k| write_response(var, state); 165| 721k| } 166| 721k| else { 167| 721k| write_response(state); 168| 721k| } 169| 721k| }; 170| 721k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS7_EERT_RT0_ENUlRNS_4repe10state_viewEE_clESL_: 152| 29.9k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 29.9k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 29.6k, False: 244] ------------------ 154| 29.6k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 28.6k, False: 1.04k] ------------------ 155| 28.6k| return; 156| 28.6k| } 157| 29.6k| } 158| | 159| 1.28k| if (state.notify()) { ------------------ | Branch (159:17): [True: 454, False: 835] ------------------ 160| 454| return; 161| 454| } 162| | 163| 835| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 147, False: 688] ------------------ 164| 147| write_response(var, state); 165| 147| } 166| 688| else { 167| 688| write_response(state); 168| 688| } 169| 835| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointIdNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEERT_RT0_: 151| 721k| { 152| 721k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 721k| if (state.has_body()) { 154| 721k| if (!read_params(var, state)) { 155| 721k| return; 156| 721k| } 157| 721k| } 158| | 159| 721k| if (state.notify()) { 160| 721k| return; 161| 721k| } 162| | 163| 721k| if (not state.has_body()) { 164| 721k| write_response(var, state); 165| 721k| } 166| 721k| else { 167| 721k| write_response(state); 168| 721k| } 169| 721k| }; 170| 721k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointIdNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESH_: 152| 14.9k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 14.9k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 14.7k, False: 123] ------------------ 154| 14.7k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 12.8k, False: 1.93k] ------------------ 155| 12.8k| return; 156| 12.8k| } 157| 14.7k| } 158| | 159| 2.05k| if (state.notify()) { ------------------ | Branch (159:17): [True: 823, False: 1.23k] ------------------ 160| 823| return; 161| 823| } 162| | 163| 1.23k| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 74, False: 1.16k] ------------------ 164| 74| write_response(var, state); 165| 74| } 166| 1.16k| else { 167| 1.16k| write_response(state); 168| 1.16k| } 169| 1.23k| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE24register_object_endpointIN9repe_fuzz5pointENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_: 105| 360k| { 106| 360k| reg.endpoints[path] = [&obj](repe::state_view& state) mutable { 107| 360k| if (state.has_body()) { 108| 360k| if (!read_params(obj, state)) { 109| 360k| return; 110| 360k| } 111| 360k| } 112| | 113| 360k| if (state.notify()) { 114| 360k| return; 115| 360k| } 116| | 117| 360k| if (not state.has_body()) { 118| 360k| write_response(obj, state); 119| 360k| } 120| 360k| else { 121| 360k| write_response(state); 122| 360k| } 123| 360k| }; 124| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE24register_object_endpointIN9repe_fuzz5pointENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESJ_: 106| 15.0k| reg.endpoints[path] = [&obj](repe::state_view& state) mutable { 107| 15.0k| if (state.has_body()) { ------------------ | Branch (107:17): [True: 14.9k, False: 123] ------------------ 108| 14.9k| if (!read_params(obj, state)) { ------------------ | Branch (108:20): [True: 14.8k, False: 66] ------------------ 109| 14.8k| return; 110| 14.8k| } 111| 14.9k| } 112| | 113| 189| if (state.notify()) { ------------------ | Branch (113:17): [True: 54, False: 135] ------------------ 114| 54| return; 115| 54| } 116| | 117| 135| if (not state.has_body()) { ------------------ | Branch (117:17): [True: 74, False: 61] ------------------ 118| 74| write_response(obj, state); 119| 74| } 120| 61| else { 121| 61| write_response(state); 122| 61| } 123| 135| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE24register_object_endpointIN9repe_fuzz6nestedENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_: 105| 360k| { 106| 360k| reg.endpoints[path] = [&obj](repe::state_view& state) mutable { 107| 360k| if (state.has_body()) { 108| 360k| if (!read_params(obj, state)) { 109| 360k| return; 110| 360k| } 111| 360k| } 112| | 113| 360k| if (state.notify()) { 114| 360k| return; 115| 360k| } 116| | 117| 360k| if (not state.has_body()) { 118| 360k| write_response(obj, state); 119| 360k| } 120| 360k| else { 121| 360k| write_response(state); 122| 360k| } 123| 360k| }; 124| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE24register_object_endpointIN9repe_fuzz6nestedENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNSt3__117basic_string_viewIcNS8_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESJ_: 106| 14.9k| reg.endpoints[path] = [&obj](repe::state_view& state) mutable { 107| 14.9k| if (state.has_body()) { ------------------ | Branch (107:17): [True: 14.7k, False: 123] ------------------ 108| 14.7k| if (!read_params(obj, state)) { ------------------ | Branch (108:20): [True: 14.5k, False: 236] ------------------ 109| 14.5k| return; 110| 14.5k| } 111| 14.7k| } 112| | 113| 359| if (state.notify()) { ------------------ | Branch (113:17): [True: 57, False: 302] ------------------ 114| 57| return; 115| 57| } 116| | 117| 302| if (not state.has_body()) { ------------------ | Branch (117:17): [True: 74, False: 228] ------------------ 118| 74| write_response(obj, state); 119| 74| } 120| 228| else { 121| 228| write_response(state); 122| 228| } 123| 302| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__16vectorIiNS4_9allocatorIiEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT0_: 151| 360k| { 152| 360k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 360k| if (state.has_body()) { 154| 360k| if (!read_params(var, state)) { 155| 360k| return; 156| 360k| } 157| 360k| } 158| | 159| 360k| if (state.notify()) { 160| 360k| return; 161| 360k| } 162| | 163| 360k| if (not state.has_body()) { 164| 360k| write_response(var, state); 165| 360k| } 166| 360k| else { 167| 360k| write_response(state); 168| 360k| } 169| 360k| }; 170| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__16vectorIiNS4_9allocatorIiEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESL_: 152| 15.1k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 15.1k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 15.0k, False: 123] ------------------ 154| 15.0k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 14.9k, False: 100] ------------------ 155| 14.9k| return; 156| 14.9k| } 157| 15.0k| } 158| | 159| 223| if (state.notify()) { ------------------ | Branch (159:17): [True: 54, False: 169] ------------------ 160| 54| return; 161| 54| } 162| | 163| 169| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 74, False: 95] ------------------ 164| 74| write_response(var, state); 165| 74| } 166| 95| else { 167| 95| write_response(state); 168| 95| } 169| 169| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__13mapINS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEiNS4_4lessISB_EENS9_INS4_4pairIKSB_iEEEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS8_EERT_RT0_: 151| 360k| { 152| 360k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 360k| if (state.has_body()) { 154| 360k| if (!read_params(var, state)) { 155| 360k| return; 156| 360k| } 157| 360k| } 158| | 159| 360k| if (state.notify()) { 160| 360k| return; 161| 360k| } 162| | 163| 360k| if (not state.has_body()) { 164| 360k| write_response(var, state); 165| 360k| } 166| 360k| else { 167| 360k| write_response(state); 168| 360k| } 169| 360k| }; 170| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__13mapINS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEiNS4_4lessISB_EENS9_INS4_4pairIKSB_iEEEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS8_EERT_RT0_ENUlRNS_4repe10state_viewEE_clEST_: 152| 15.2k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 15.2k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 15.1k, False: 123] ------------------ 154| 15.1k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 15.1k, False: 51] ------------------ 155| 15.1k| return; 156| 15.1k| } 157| 15.1k| } 158| | 159| 174| if (state.notify()) { ------------------ | Branch (159:17): [True: 60, False: 114] ------------------ 160| 60| return; 161| 60| } 162| | 163| 114| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 74, False: 40] ------------------ 164| 74| write_response(var, state); 165| 74| } 166| 40| else { 167| 40| write_response(state); 168| 40| } 169| 114| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__18optionalIdEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT0_: 151| 360k| { 152| 360k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 360k| if (state.has_body()) { 154| 360k| if (!read_params(var, state)) { 155| 360k| return; 156| 360k| } 157| 360k| } 158| | 159| 360k| if (state.notify()) { 160| 360k| return; 161| 360k| } 162| | 163| 360k| if (not state.has_body()) { 164| 360k| write_response(var, state); 165| 360k| } 166| 360k| else { 167| 360k| write_response(state); 168| 360k| } 169| 360k| }; 170| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__18optionalIdEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT0_ENUlRNS_4repe10state_viewEE_clESJ_: 152| 14.9k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 14.9k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 14.7k, False: 123] ------------------ 154| 14.7k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 12.8k, False: 1.93k] ------------------ 155| 12.8k| return; 156| 12.8k| } 157| 14.7k| } 158| | 159| 2.06k| if (state.notify()) { ------------------ | Branch (159:17): [True: 822, False: 1.23k] ------------------ 160| 822| return; 161| 822| } 162| | 163| 1.23k| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 74, False: 1.16k] ------------------ 164| 74| write_response(var, state); 165| 74| } 166| 1.16k| else { 167| 1.16k| write_response(state); 168| 1.16k| } 169| 1.23k| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__17variantIJNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS8_EERT_RT0_: 151| 360k| { 152| 360k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 360k| if (state.has_body()) { 154| 360k| if (!read_params(var, state)) { 155| 360k| return; 156| 360k| } 157| 360k| } 158| | 159| 360k| if (state.notify()) { 160| 360k| return; 161| 360k| } 162| | 163| 360k| if (not state.has_body()) { 164| 360k| write_response(var, state); 165| 360k| } 166| 360k| else { 167| 360k| write_response(state); 168| 360k| } 169| 360k| }; 170| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_variable_endpointINSt3__17variantIJNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS8_EERT_RT0_ENUlRNS_4repe10state_viewEE_clESP_: 152| 14.9k| reg.endpoints[path] = [&var](repe::state_view& state) mutable { 153| 14.9k| if (state.has_body()) { ------------------ | Branch (153:17): [True: 14.7k, False: 123] ------------------ 154| 14.7k| if (!read_params(var, state)) { ------------------ | Branch (154:20): [True: 14.2k, False: 540] ------------------ 155| 14.2k| return; 156| 14.2k| } 157| 14.7k| } 158| | 159| 663| if (state.notify()) { ------------------ | Branch (159:17): [True: 222, False: 441] ------------------ 160| 222| return; 161| 222| } 162| | 163| 441| if (not state.has_body()) { ------------------ | Branch (163:17): [True: 74, False: 367] ------------------ 164| 74| write_response(var, state); 165| 74| } 166| 367| else { 167| 367| write_response(state); 168| 367| } 169| 441| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFiiEEEiNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_: 73| 360k| { 74| 360k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 360k| static thread_local std::decay_t params{}; 76| 360k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 360k| if (!read_params(params, state)) { 78| 360k| return; 79| 360k| } 80| | 81| 360k| using Result = std::invoke_result_t; 82| | 83| 360k| if (state.notify()) { 84| 360k| if constexpr (std::same_as) { 85| 360k| func(params); 86| 360k| } 87| 360k| else { 88| 360k| std::ignore = func(params); 89| 360k| } 90| 360k| return; 91| 360k| } 92| 360k| if constexpr (std::same_as) { 93| 360k| func(params); 94| 360k| write_response(state); 95| 360k| } 96| 360k| else { 97| 360k| auto ret = func(params); 98| 360k| write_response(ret, state); 99| 360k| } 100| 360k| }; 101| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFiiEEEiNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_ENUlRNS_4repe10state_viewEE_clESL_: 74| 14.9k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 14.9k| static thread_local std::decay_t params{}; 76| 14.9k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 14.9k| if (!read_params(params, state)) { ------------------ | Branch (77:17): [True: 14.5k, False: 375] ------------------ 78| 14.5k| return; 79| 14.5k| } 80| | 81| 375| using Result = std::invoke_result_t; 82| | 83| 375| if (state.notify()) { ------------------ | Branch (83:17): [True: 52, False: 323] ------------------ 84| | if constexpr (std::same_as) { 85| | func(params); 86| | } 87| 52| else { 88| 52| std::ignore = func(params); 89| 52| } 90| 52| return; 91| 52| } 92| | if constexpr (std::same_as) { 93| | func(params); 94| | write_response(state); 95| | } 96| 323| else { 97| 323| auto ret = func(params); 98| 323| write_response(ret, state); 99| 323| } 100| 323| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERKSB_EEESD_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS8_EERT_RT1_: 73| 360k| { 74| 360k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 360k| static thread_local std::decay_t params{}; 76| 360k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 360k| if (!read_params(params, state)) { 78| 360k| return; 79| 360k| } 80| | 81| 360k| using Result = std::invoke_result_t; 82| | 83| 360k| if (state.notify()) { 84| 360k| if constexpr (std::same_as) { 85| 360k| func(params); 86| 360k| } 87| 360k| else { 88| 360k| std::ignore = func(params); 89| 360k| } 90| 360k| return; 91| 360k| } 92| 360k| if constexpr (std::same_as) { 93| 360k| func(params); 94| 360k| write_response(state); 95| 360k| } 96| 360k| else { 97| 360k| auto ret = func(params); 98| 360k| write_response(ret, state); 99| 360k| } 100| 360k| }; 101| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFNS4_12basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEERKSB_EEESD_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcS8_EERT_RT1_ENUlRNS_4repe10state_viewEE_clESR_: 74| 14.9k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 14.9k| static thread_local std::decay_t params{}; 76| 14.9k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 14.9k| if (!read_params(params, state)) { ------------------ | Branch (77:17): [True: 14.3k, False: 529] ------------------ 78| 14.3k| return; 79| 14.3k| } 80| | 81| 529| using Result = std::invoke_result_t; 82| | 83| 529| if (state.notify()) { ------------------ | Branch (83:17): [True: 170, False: 359] ------------------ 84| | if constexpr (std::same_as) { 85| | func(params); 86| | } 87| 170| else { 88| 170| std::ignore = func(params); 89| 170| } 90| 170| return; 91| 170| } 92| | if constexpr (std::same_as) { 93| | func(params); 94| | write_response(state); 95| | } 96| 359| else { 97| 359| auto ret = func(params); 98| 359| write_response(ret, state); 99| 359| } 100| 359| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFN9repe_fuzz5pointERKS7_EEES9_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_: 73| 360k| { 74| 360k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 360k| static thread_local std::decay_t params{}; 76| 360k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 360k| if (!read_params(params, state)) { 78| 360k| return; 79| 360k| } 80| | 81| 360k| using Result = std::invoke_result_t; 82| | 83| 360k| if (state.notify()) { 84| 360k| if constexpr (std::same_as) { 85| 360k| func(params); 86| 360k| } 87| 360k| else { 88| 360k| std::ignore = func(params); 89| 360k| } 90| 360k| return; 91| 360k| } 92| 360k| if constexpr (std::same_as) { 93| 360k| func(params); 94| 360k| write_response(state); 95| 360k| } 96| 360k| else { 97| 360k| auto ret = func(params); 98| 360k| write_response(ret, state); 99| 360k| } 100| 360k| }; 101| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFN9repe_fuzz5pointERKS7_EEES9_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_ENUlRNS_4repe10state_viewEE_clESP_: 74| 14.9k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 14.9k| static thread_local std::decay_t params{}; 76| 14.9k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 14.9k| if (!read_params(params, state)) { ------------------ | Branch (77:17): [True: 14.8k, False: 67] ------------------ 78| 14.8k| return; 79| 14.8k| } 80| | 81| 67| using Result = std::invoke_result_t; 82| | 83| 67| if (state.notify()) { ------------------ | Branch (83:17): [True: 6, False: 61] ------------------ 84| | if constexpr (std::same_as) { 85| | func(params); 86| | } 87| 6| else { 88| 6| std::ignore = func(params); 89| 6| } 90| 6| return; 91| 6| } 92| | if constexpr (std::same_as) { 93| | func(params); 94| | write_response(state); 95| | } 96| 61| else { 97| 61| auto ret = func(params); 98| 61| write_response(ret, state); 99| 61| } 100| 61| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFdRNS4_6vectorIdNS4_9allocatorIdEEEEEEESA_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_: 73| 360k| { 74| 360k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 360k| static thread_local std::decay_t params{}; 76| 360k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 360k| if (!read_params(params, state)) { 78| 360k| return; 79| 360k| } 80| | 81| 360k| using Result = std::invoke_result_t; 82| | 83| 360k| if (state.notify()) { 84| 360k| if constexpr (std::same_as) { 85| 360k| func(params); 86| 360k| } 87| 360k| else { 88| 360k| std::ignore = func(params); 89| 360k| } 90| 360k| return; 91| 360k| } 92| 360k| if constexpr (std::same_as) { 93| 360k| func(params); 94| 360k| write_response(state); 95| 360k| } 96| 360k| else { 97| 360k| auto ret = func(params); 98| 360k| write_response(ret, state); 99| 360k| } 100| 360k| }; 101| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE32register_param_function_endpointIRNSt3__18functionIFdRNS4_6vectorIdNS4_9allocatorIdEEEEEEESA_NS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_ENUlRNS_4repe10state_viewEE_clESQ_: 74| 14.9k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 75| 14.9k| static thread_local std::decay_t params{}; 76| 14.9k| params = {}; // reset to avoid stale optional/variant fields across calls 77| 14.9k| if (!read_params(params, state)) { ------------------ | Branch (77:17): [True: 14.4k, False: 511] ------------------ 78| 14.4k| return; 79| 14.4k| } 80| | 81| 511| using Result = std::invoke_result_t; 82| | 83| 511| if (state.notify()) { ------------------ | Branch (83:17): [True: 7, False: 504] ------------------ 84| | if constexpr (std::same_as) { 85| | func(params); 86| | } 87| 7| else { 88| 7| std::ignore = func(params); 89| 7| } 90| 7| return; 91| 7| } 92| | if constexpr (std::same_as) { 93| | func(params); 94| | write_response(state); 95| | } 96| 504| else { 97| 504| auto ret = func(params); 98| 504| write_response(ret, state); 99| 504| } 100| 504| }; _ZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_function_endpointIRNSt3__18functionIFvvEEEvNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_: 50| 360k| { 51| 360k| if constexpr (std::same_as) { 52| 360k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 53| 360k| func(); 54| 360k| if (state.notify()) { 55| 360k| return; 56| 360k| } 57| 360k| write_response(state); 58| 360k| }; 59| | } 60| | else { 61| | reg.endpoints[path] = [&func](repe::state_view& state) mutable { 62| | if (state.notify()) { 63| | std::ignore = func(); 64| | return; 65| | } 66| | write_response(func(), state); 67| | }; 68| | } 69| 360k| } _ZZN3glz13registry_implIXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEELj30000EE26register_function_endpointIRNSt3__18functionIFvvEEEvNS_8registryIXtlS1_Lj10ELb1ELb0ELb1ELb1EEELj30000EEEEEvNS4_17basic_string_viewIcNS4_11char_traitsIcEEEERT_RT1_ENUlRNS_4repe10state_viewEE_clESL_: 52| 14.8k| reg.endpoints[path] = [&func](repe::state_view& state) mutable { 53| 14.8k| func(); 54| 14.8k| if (state.notify()) { ------------------ | Branch (54:20): [True: 6.19k, False: 8.70k] ------------------ 55| 6.19k| return; 56| 6.19k| } 57| 8.70k| write_response(state); 58| 8.70k| }; _ZN3glz6detail18sse2_string_escapeIcRZNS_2toILj10ENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS9_S9_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_EUlvE0_EEvRPKcSR_RPT_mSL_: 20| 370| { 21| | // SSE2: 16 bytes at a time with direct comparison instructions 22| 370| if (n > 15) { ------------------ | Branch (22:11): [True: 220, False: 150] ------------------ 23| 220| const __m128i quote_vec = _mm_set1_epi8('"'); 24| 220| const __m128i bs_vec = _mm_set1_epi8('\\'); 25| 220| const __m128i ctrl_mask = _mm_set1_epi8(static_cast(0xE0)); 26| 220| const __m128i zero = _mm_setzero_si128(); 27| | 28| 1.84M| for (const char* end_m15 = e - 15; c < end_m15;) { ------------------ | Branch (28:45): [True: 1.84M, False: 220] ------------------ 29| 1.84M| __m128i v = _mm_loadu_si128(reinterpret_cast(c)); 30| 1.84M| _mm_storeu_si128(reinterpret_cast<__m128i*>(data), v); 31| | 32| 1.84M| const uint32_t mask = static_cast( 33| 1.84M| _mm_movemask_epi8(_mm_or_si128(_mm_or_si128(_mm_cmpeq_epi8(v, quote_vec), _mm_cmpeq_epi8(v, bs_vec)), 34| 1.84M| _mm_cmpeq_epi8(_mm_and_si128(v, ctrl_mask), zero)))); 35| | 36| 1.84M| if (mask == 0) { ------------------ | Branch (36:17): [True: 1.83M, False: 12.4k] ------------------ 37| 1.83M| data += 16; 38| 1.83M| c += 16; 39| 1.83M| continue; 40| 1.83M| } 41| | 42| 12.4k| const uint32_t length = countr_zero(mask); 43| 12.4k| c += length; 44| 12.4k| data += length; 45| 12.4k| write_escape(); 46| 12.4k| } 47| 220| } 48| 370| } _ZN3glz6detail18sse2_string_escapeIcRZNS_2toILj10ENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS9_SD_TkNS_10is_contextERNS_7contextEmEEvOT1_OT2_OT0_RT3_EUlvE0_EEvRPKcSR_RPT_mSL_: 20| 882| { 21| | // SSE2: 16 bytes at a time with direct comparison instructions 22| 882| if (n > 15) { ------------------ | Branch (22:11): [True: 225, False: 657] ------------------ 23| 225| const __m128i quote_vec = _mm_set1_epi8('"'); 24| 225| const __m128i bs_vec = _mm_set1_epi8('\\'); 25| 225| const __m128i ctrl_mask = _mm_set1_epi8(static_cast(0xE0)); 26| 225| const __m128i zero = _mm_setzero_si128(); 27| | 28| 830k| for (const char* end_m15 = e - 15; c < end_m15;) { ------------------ | Branch (28:45): [True: 829k, False: 225] ------------------ 29| 829k| __m128i v = _mm_loadu_si128(reinterpret_cast(c)); 30| 829k| _mm_storeu_si128(reinterpret_cast<__m128i*>(data), v); 31| | 32| 829k| const uint32_t mask = static_cast( 33| 829k| _mm_movemask_epi8(_mm_or_si128(_mm_or_si128(_mm_cmpeq_epi8(v, quote_vec), _mm_cmpeq_epi8(v, bs_vec)), 34| 829k| _mm_cmpeq_epi8(_mm_and_si128(v, ctrl_mask), zero)))); 35| | 36| 829k| if (mask == 0) { ------------------ | Branch (36:17): [True: 820k, False: 9.81k] ------------------ 37| 820k| data += 16; 38| 820k| c += 16; 39| 820k| continue; 40| 820k| } 41| | 42| 9.81k| const uint32_t length = countr_zero(mask); 43| 9.81k| c += length; 44| 9.81k| data += length; 45| 9.81k| write_escape(); 46| 9.81k| } 47| 225| } 48| 882| } _ZN3glz4atoiITkNSt3__18integralEicEEbRT_RPKT0_S6_: 806| 680k| { 807| | // The number of characters needed at most for each type, rounded to nearest 8 bytes 808| 680k| constexpr auto buffer_length = int_buffer_lengths[std::bit_width(sizeof(T)) - 1]; 809| | // We copy the rest of the buffer, or buffer_length bytes, into a null terminated buffer. The 810| | // trailing byte is never written by the copy, so the null-terminated atoi below always halts 811| | // inside the array even when the input fills it: the exponent scan stops at a non-digit rather 812| | // than after a fixed digit count, and a value-initialized array alone would not terminate a 813| | // copy that covers every byte. 814| 680k| std::array data{}; 815| 680k| const auto n = size_t(end - it); 816| 680k| if (n > 0) [[likely]] { ------------------ | Branch (816:11): [True: 680k, False: 0] ------------------ 817| 680k| const auto truncated = n > buffer_length; 818| 680k| std::memcpy(data.data(), it, truncated ? buffer_length : n); ------------------ | Branch (818:39): [True: 628k, False: 52.4k] ------------------ 819| | 820| 680k| const auto start = data.data(); 821| 680k| const auto* c = start; 822| 680k| const auto valid = glz::atoi(v, c); 823| 680k| const auto consumed = size_t(c - start); 824| 680k| it += consumed; 825| | // Reaching the end of a truncated copy means the number was cut off: parsing halted on the 826| | // terminator this buffer supplies rather than on a character of the input, so what parsed is 827| | // a prefix and its value is not the number's. Only zero padding can stretch a number this 828| | // far -- no in-range integer needs buffer_length characters -- but a caller that ignores 829| | // trailing content would otherwise take the prefix's value as the answer. 830| 680k| return valid && not(truncated && consumed == buffer_length); ------------------ | Branch (830:17): [True: 612k, False: 68.0k] | Branch (830:30): [True: 596k, False: 16.2k] | Branch (830:43): [True: 6, False: 596k] ------------------ 831| 680k| } 832| 0| else [[unlikely]] { 833| 0| return false; 834| 0| } 835| 680k| } _ZN3glz4atoiITkNSt3__18integralEiKcQsr3stdE11is_signed_vIT_EEEbRS3_RPT0_: 718| 680k| { 719| 680k| using X = std::decay_t; 720| 680k| using utype = std::make_unsigned_t; 721| | 722| 680k| const uint8_t sign = *c == '-'; 723| 680k| if (auto ptr = parse_int(v, reinterpret_cast(c))) [[likely]] { ------------------ | Branch (723:16): [True: 618k, False: 62.2k] ------------------ 724| 618k| c = reinterpret_cast(ptr); 725| 618k| if (*c == 'e' || *c == 'E') { ------------------ | Branch (725:14): [True: 19.6k, False: 598k] | Branch (725:27): [True: 34.1k, False: 564k] ------------------ 726| 53.8k| ++c; 727| 53.8k| } 728| 564k| else { 729| 564k| if (*c == '.') [[unlikely]] { ------------------ | Branch (729:17): [True: 1.97k, False: 562k] ------------------ 730| 1.97k| return false; 731| 1.97k| } 732| 562k| return true; 733| 564k| } 734| | 735| 53.8k| c += (*c == '+'); 736| | 737| 53.8k| if (not is_digit(*c)) [[unlikely]] { ------------------ | Branch (737:14): [True: 1.34k, False: 52.4k] ------------------ 738| 1.34k| return false; 739| 1.34k| } 740| 52.4k| const uint32_t exp = parse_exponent(c); 741| | // As in the unsigned overload: only a non-zero magnitude can overflow, so "0e19" and 742| | // "-0e19" are in range for every width. `v` is already the signed mantissa, and negative 743| | // zero compares equal to zero, so both spellings land here with the value they should keep. 744| | if constexpr (sizeof(T) == 1) { 745| | if (exp > 2) [[unlikely]] { 746| | return v == 0; 747| | } 748| | } 749| | else if constexpr (sizeof(T) == 2) { 750| | if (exp > 4) [[unlikely]] { 751| | return v == 0; 752| | } 753| | } 754| 52.4k| else if constexpr (sizeof(T) == 4) { 755| 52.4k| if (exp > 9) [[unlikely]] { ------------------ | Branch (755:17): [True: 3.36k, False: 49.0k] ------------------ 756| 3.36k| return v == 0; 757| 3.36k| } 758| | } 759| | else { 760| | if (exp > 18) [[unlikely]] { 761| | return v == 0; 762| | } 763| | } 764| | 765| 49.0k| utype i = utype((utype(v) ^ -sign) + sign); 766| 52.4k| if constexpr (sizeof(T) < 8) { 767| | // Scale in a width the product cannot wrap, then range check before narrowing. Scaling 768| | // inside `utype` truncated first and checked afterwards, so an out-of-range magnitude 769| | // aliased onto an accepted one: "13e2" read as 20 for int8_t and "5e9" as 705032704 for 770| | // int32_t. The widest case here is a 4-byte magnitude scaled by 10^9, which stays well 771| | // inside uint64_t. The unsigned path already widens the same way. 772| 52.4k| const uint64_t scaled = uint64_t(i) * powers_of_ten_int[exp]; 773| 52.4k| v = T((utype(scaled) ^ -sign) + sign); 774| | // Bound the magnitude directly rather than subtracting the sign from it: a negative 775| | // zero makes `scaled - sign` underflow, and the old narrow expression only survived 776| | // that because it promoted to int. A negative value may reach one past the positive 777| | // limit, which is exactly INT_MIN's magnitude. 778| 52.4k| return scaled <= uint64_t((std::numeric_limits::max)()) + sign; 779| | } 780| | else { 781| | // Scale the sign-stripped magnitude `i`, not the two's-complement bit pattern of `v`: 782| | // for a negative value that pattern is a huge unsigned number, so every negative 783| | // 64-bit integer written with an exponent ("-1e2") overflowed and was rejected. The 784| | // narrower branches above already scale `i`. 785| |#if defined(__SIZEOF_INT128__) 786| | const __uint128_t res = __uint128_t(i) * powers_of_ten_int[exp]; 787| | v = T((uint64_t(res) ^ -sign) + sign); 788| | // Compare the full 128-bit product. Narrowing it to 64 bits first would let an 789| | // out-of-range magnitude alias onto an accepted one, e.g. 9e36 truncating into range. 790| | return res <= __uint128_t(9223372036854775807ull + sign); 791| |#else 792| | const auto res = full_multiplication(i, powers_of_ten_int[exp]); 793| | v = T((uint64_t(res.low) ^ -sign) + sign); 794| | return res.high == 0 && (uint64_t(res.low) <= (9223372036854775807ull + sign)); 795| |#endif 796| | } 797| 52.4k| } 798| 114k| return false; 799| 680k| } _ZN3glz9parse_intITkNSt3__18integralEiQaasr3stdE11is_signed_vIT_ElestS2_Li8EEEPKhRS2_S4_: 479| 680k| { 480| 680k| const uint8_t sign = *c == '-'; 481| 680k| c += sign; 482| | 483| 680k| if (is_digit(*c)) [[likely]] { ------------------ | Branch (483:11): [True: 623k, False: 57.4k] ------------------ 484| 623k| v = *c - '0'; 485| 623k| ++c; 486| 623k| } 487| 57.4k| else [[unlikely]] { 488| 57.4k| return {}; 489| 57.4k| } 490| | 491| 623k| if (is_digit(*c)) { ------------------ | Branch (491:11): [True: 379k, False: 244k] ------------------ 492| 379k| v = v * 10 + (*c - '0'); 493| 379k| ++c; 494| 379k| } 495| 244k| else { 496| 244k| if (sign) { ------------------ | Branch (496:14): [True: 9.36k, False: 234k] ------------------ 497| 9.36k| v = -v; 498| 9.36k| } 499| 244k| return c; 500| 244k| } 501| | 502| 379k| if (c[-2] == '0') [[unlikely]] { ------------------ | Branch (502:11): [True: 82, False: 379k] ------------------ 503| 82| return {}; 504| 82| } 505| | 506| 379k| if constexpr (sizeof(T) > 1) { 507| 379k| if (is_digit(*c)) { ------------------ | Branch (507:14): [True: 252k, False: 126k] ------------------ 508| 252k| v = v * 10 + (*c - '0'); 509| 252k| ++c; 510| 252k| } 511| 126k| else { 512| 126k| if (sign) { ------------------ | Branch (512:17): [True: 3.48k, False: 123k] ------------------ 513| 3.48k| v = -v; 514| 3.48k| } 515| 126k| return c; 516| 126k| } 517| | 518| 252k| if (is_digit(*c)) { ------------------ | Branch (518:14): [True: 171k, False: 80.5k] ------------------ 519| 171k| v = v * 10 + (*c - '0'); 520| 171k| ++c; 521| 171k| } 522| 80.5k| else { 523| 80.5k| if (sign) { ------------------ | Branch (523:17): [True: 2.86k, False: 77.6k] ------------------ 524| 2.86k| v = -v; 525| 2.86k| } 526| 80.5k| return c; 527| 80.5k| } 528| | 529| 171k| if constexpr (sizeof(T) > 2) { 530| 171k| if (is_digit(*c)) { ------------------ | Branch (530:17): [True: 137k, False: 33.7k] ------------------ 531| 137k| v = v * 10 + (*c - '0'); 532| 137k| ++c; 533| 137k| } 534| 33.7k| else { 535| 33.7k| if (sign) { ------------------ | Branch (535:20): [True: 2.80k, False: 30.9k] ------------------ 536| 2.80k| v = -v; 537| 2.80k| } 538| 33.7k| return c; 539| 33.7k| } 540| | 541| 137k| if (is_digit(*c)) { ------------------ | Branch (541:17): [True: 88.7k, False: 49.1k] ------------------ 542| 88.7k| v = v * 10 + (*c - '0'); 543| 88.7k| ++c; 544| 88.7k| } 545| 49.1k| else { 546| 49.1k| if (sign) { ------------------ | Branch (546:20): [True: 3.00k, False: 46.1k] ------------------ 547| 3.00k| v = -v; 548| 3.00k| } 549| 49.1k| return c; 550| 49.1k| } 551| | 552| 88.7k| if (is_digit(*c)) { ------------------ | Branch (552:17): [True: 51.4k, False: 37.2k] ------------------ 553| 51.4k| v = v * 10 + (*c - '0'); 554| 51.4k| ++c; 555| 51.4k| } 556| 37.2k| else { 557| 37.2k| if (sign) { ------------------ | Branch (557:20): [True: 4.97k, False: 32.2k] ------------------ 558| 4.97k| v = -v; 559| 4.97k| } 560| 37.2k| return c; 561| 37.2k| } 562| | 563| 51.4k| if (is_digit(*c)) { ------------------ | Branch (563:17): [True: 36.0k, False: 15.4k] ------------------ 564| 36.0k| v = v * 10 + (*c - '0'); 565| 36.0k| ++c; 566| 36.0k| } 567| 15.4k| else { 568| 15.4k| if (sign) { ------------------ | Branch (568:20): [True: 2.21k, False: 13.2k] ------------------ 569| 2.21k| v = -v; 570| 2.21k| } 571| 15.4k| return c; 572| 15.4k| } 573| | 574| 36.0k| if (is_digit(*c)) { ------------------ | Branch (574:17): [True: 28.3k, False: 7.62k] ------------------ 575| 28.3k| v = v * 10 + (*c - '0'); 576| 28.3k| ++c; 577| 28.3k| } 578| 7.62k| else { 579| 7.62k| if (sign) { ------------------ | Branch (579:20): [True: 1.91k, False: 5.71k] ------------------ 580| 1.91k| v = -v; 581| 1.91k| } 582| 7.62k| return c; 583| 7.62k| } 584| | 585| | if constexpr (sizeof(T) > 4) { 586| | if (is_digit(*c)) { 587| | v = v * 10 + (*c - '0'); 588| | ++c; 589| | } 590| | else { 591| | if (sign) { 592| | v = -v; 593| | } 594| | return c; 595| | } 596| | 597| | if (is_digit(*c)) { 598| | v = v * 10 + (*c - '0'); 599| | ++c; 600| | } 601| | else { 602| | if (sign) { 603| | v = -v; 604| | } 605| | return c; 606| | } 607| | 608| | if (is_digit(*c)) { 609| | v = v * 10 + (*c - '0'); 610| | ++c; 611| | } 612| | else { 613| | if (sign) { 614| | v = -v; 615| | } 616| | return c; 617| | } 618| | 619| | if (is_digit(*c)) { 620| | v = v * 10 + (*c - '0'); 621| | ++c; 622| | } 623| | else { 624| | if (sign) { 625| | v = -v; 626| | } 627| | return c; 628| | } 629| | 630| | if (is_digit(*c)) { 631| | v = v * 10 + (*c - '0'); 632| | ++c; 633| | } 634| | else { 635| | if (sign) { 636| | v = -v; 637| | } 638| | return c; 639| | } 640| | 641| | if (is_digit(*c)) { 642| | v = v * 10 + (*c - '0'); 643| | ++c; 644| | } 645| | else { 646| | if (sign) { 647| | v = -v; 648| | } 649| | return c; 650| | } 651| | 652| | if (is_digit(*c)) { 653| | v = v * 10 + (*c - '0'); 654| | ++c; 655| | } 656| | else { 657| | if (sign) { 658| | v = -v; 659| | } 660| | return c; 661| | } 662| | 663| | if (is_digit(*c)) { 664| | v = v * 10 + (*c - '0'); 665| | ++c; 666| | } 667| | else { 668| | if (sign) { 669| | v = -v; 670| | } 671| | return c; 672| | } 673| | 674| | if (is_digit(*c)) { 675| | v = v * 10 + (*c - '0'); 676| | ++c; 677| | } 678| | else { 679| | if (sign) { 680| | v = -v; 681| | } 682| | return c; 683| | } 684| | } 685| 28.3k| } 686| 171k| } 687| | 688| 379k| if (is_digit(*c)) { ------------------ | Branch (688:11): [True: 11.1k, False: 367k] ------------------ 689| 11.1k| if (sign) { ------------------ | Branch (689:14): [True: 3.33k, False: 7.79k] ------------------ 690| 3.33k| if (would_overflow_negative(v, *c)) [[unlikely]] { ------------------ | Branch (690:17): [True: 243, False: 3.09k] ------------------ 691| 243| return {}; 692| 243| } 693| 3.09k| v = -1 * v; 694| 3.09k| v = v * 10 - (*c - '0'); 695| 3.09k| } 696| 7.79k| else { 697| 7.79k| if (would_overflow_positive(v, *c)) [[unlikely]] { ------------------ | Branch (697:17): [True: 2.64k, False: 5.15k] ------------------ 698| 2.64k| return {}; 699| 2.64k| } 700| 5.15k| v = v * 10 + (*c - '0'); 701| 5.15k| } 702| 8.25k| ++c; 703| 8.25k| if (is_digit(*c)) [[unlikely]] { ------------------ | Branch (703:14): [True: 1.84k, False: 6.40k] ------------------ 704| 1.84k| return {}; 705| 1.84k| } 706| 6.40k| return c; 707| 8.25k| } 708| | 709| 367k| if (sign) { ------------------ | Branch (709:11): [True: 2.39k, False: 365k] ------------------ 710| 2.39k| v = -v; 711| 2.39k| } 712| 367k| return c; 713| 379k| } _ZN3glz23would_overflow_negativeIiEEbu17__remove_volatileIT_Eh: 154| 3.33k| { 155| | // For negative: max magnitude is max + 1 (e.g., -2147483648 for int32) 156| 3.33k| using U = std::remove_volatile_t; 157| 3.33k| constexpr auto max_val = static_cast((std::numeric_limits::max)()) + 1; 158| 3.33k| constexpr auto threshold = max_val / 10; 159| 3.33k| constexpr auto last_digit = max_val % 10; 160| 3.33k| const auto uv = static_cast(v); 161| 3.33k| const auto digit = static_cast(next_digit - '0'); 162| | // When digit > last_digit, effective threshold is one less 163| 3.33k| return uv > (threshold - uint64_t(digit > last_digit)); 164| 3.33k| } _ZN3glz23would_overflow_positiveIiEEbu17__remove_volatileIT_Eh: 140| 7.79k| { 141| 7.79k| using U = std::remove_volatile_t; 142| 7.79k| constexpr auto max_val = static_cast((std::numeric_limits::max)()); 143| 7.79k| constexpr auto threshold = max_val / 10; 144| 7.79k| constexpr auto last_digit = max_val % 10; 145| 7.79k| const auto uv = static_cast(v); 146| 7.79k| const auto digit = static_cast(next_digit - '0'); 147| | // When digit > last_digit, effective threshold is one less 148| | // This is branch-free and faster than bitwise OR/AND approach 149| 7.79k| return uv > (threshold - uint64_t(digit > last_digit)); 150| 7.79k| } _ZN3glz8is_digitEh: 106| 2.60M| GLZ_ALWAYS_INLINE constexpr bool is_digit(const uint8_t c) noexcept { return c <= '9' && c >= '0'; } ------------------ | Branch (106:81): [True: 2.49M, False: 108k] | Branch (106:93): [True: 1.87M, False: 621k] ------------------ _ZN3glz14parse_exponentIKcEEjRPT_: 124| 52.4k| { 125| 52.4k| uint32_t exp = uint32_t(*c - '0'); 126| 52.4k| ++c; 127| 95.7k| while (is_digit(*c)) { ------------------ | Branch (127:14): [True: 43.2k, False: 52.4k] ------------------ 128| | // Written as a select rather than a branch: the clamp only ever engages on absurdly long 129| | // exponents, so a branch here would be a mispredict risk on the path that matters. 130| 43.2k| exp = exp < exponent_clamp ? exp * 10 + uint32_t(*c - '0') : exp; ------------------ | Branch (130:16): [True: 38.5k, False: 4.72k] ------------------ 131| 43.2k| ++c; 132| 43.2k| } 133| 52.4k| return exp; 134| 52.4k| } _ZN3glz9has_quoteEm: 86| 20.5M| { 87| 20.5M| return has_zero(chunk ^ repeat_byte8('"')); 88| 20.5M| } _ZN3glz8has_zeroEm: 81| 20.5M| { 82| 20.5M| return (((chunk - 0x0101010101010101ull) & ~chunk) & 0x8080808080808080ull); 83| 20.5M| } _ZN3glz11countr_zeroEm: 29| 177k| { 30| |#ifdef _MSC_VER 31| | return std::countr_zero(x); 32| |#else 33| 177k|#if __has_builtin(__builtin_ctzll) 34| 177k| return __builtin_ctzll(x); 35| |#else 36| | return std::countr_zero(x); 37| |#endif 38| 177k|#endif 39| 177k| } _ZN3glz11countr_zeroEj: 16| 22.2k| { 17| |#ifdef _MSC_VER 18| | return std::countr_zero(x); 19| |#else 20| 22.2k|#if __has_builtin(__builtin_ctzl) 21| 22.2k| return __builtin_ctzl(x); 22| |#else 23| | return std::countr_zero(x); 24| |#endif 25| 22.2k|#endif 26| 22.2k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointELm0ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm2EcEEbPKT1_: 245| 20.4k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| 20.4k| else if constexpr (N == 2) { 304| 20.4k| static constexpr auto packed = pack(); 305| 20.4k| uint16_t in; 306| 20.4k| std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| 20.4k| return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 20.4k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz5pointELm1ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm2EcEEbPKT1_: 245| 40.7k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| 40.7k| else if constexpr (N == 2) { 304| 40.7k| static constexpr auto packed = pack(); 305| 40.7k| uint16_t in; 306| 40.7k| std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| 40.7k| return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 40.7k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6nestedELm0ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 278| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 278| else if constexpr (N == 6) { 268| 278| static constexpr auto packed = pack_buffered(); 269| 278| uint64_t in{}; 270| 278| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 278| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 278| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6nestedELm1ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 30.4k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 30.4k| else if constexpr (N == 6) { 268| 30.4k| static constexpr auto packed = pack_buffered(); 269| 30.4k| uint64_t in{}; 270| 30.4k| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 30.4k| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 30.4k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm0ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 21.9k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 21.9k| else if constexpr (N == 6) { 268| 21.9k| static constexpr auto packed = pack_buffered(); 269| 21.9k| uint64_t in{}; 270| 21.9k| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 21.9k| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 21.9k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm1ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm5EcEEbPKT1_: 245| 506| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| 506| else if constexpr (N == 5) { 277| 506| static constexpr auto packed = pack(); 278| 506| uint32_t in; 279| 506| std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| 506| return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 506| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm2ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm9EcEEbPKT1_: 245| 1.10k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| 1.10k| else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| 1.10k| return 0 == std::memcmp(Str.data(), other, N); 323| 1.10k| } 324| 1.10k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm3ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 1.15k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 1.15k| else if constexpr (N == 6) { 268| 1.15k| static constexpr auto packed = pack_buffered(); 269| 1.15k| uint64_t in{}; 270| 1.15k| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 1.15k| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 1.15k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm4ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm7EcEEbPKT1_: 245| 8.35k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| 8.35k| else if constexpr (N == 7) { 259| 8.35k| static constexpr auto packed = pack_buffered(); 260| 8.35k| uint64_t in{}; 261| 8.35k| std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| 8.35k| return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 8.35k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm5ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 1.78k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 1.78k| else if constexpr (N == 6) { 268| 1.78k| static constexpr auto packed = pack_buffered(); 269| 1.78k| uint64_t in{}; 270| 1.78k| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 1.78k| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 1.78k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm6ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 1.61k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 1.61k| else if constexpr (N == 6) { 268| 1.61k| static constexpr auto packed = pack_buffered(); 269| 1.61k| uint64_t in{}; 270| 1.61k| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 1.61k| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 1.61k| } _ZN3glz10comparitorIL_ZZNS_5matchITnNS_14string_literalEXtlNS2_ILm4EEEtlA4_cLc117ELc108ELc108EEEETnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETkNS_10is_contextERNS_7contextERPKcS9_EEvOT1_OT2_T3_E1SELm3EcEEbPKSB_: 245| 762| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| 762| else if constexpr (N == 3) { 295| 762| static constexpr auto packed = pack(); 296| 762| uint16_t in; 297| 762| std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| 762| return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 762| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm7ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm8EcEEbPKT1_: 245| 4.86k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| 4.86k| if constexpr (N == 8) { 250| 4.86k| static constexpr auto packed = pack(); 251| 4.86k| uint64_t in; 252| 4.86k| std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| 4.86k| return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 4.86k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz6amountELm0ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 18.7k| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 18.7k| else if constexpr (N == 6) { 268| 18.7k| static constexpr auto packed = pack_buffered(); 269| 18.7k| uint64_t in{}; 270| 18.7k| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 18.7k| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 18.7k| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm8ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm8EcEEbPKT1_: 245| 461| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| 461| if constexpr (N == 8) { 250| 461| static constexpr auto packed = pack(); 251| 461| uint64_t in; 252| 461| std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| 461| return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 461| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm9ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 348| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 348| else if constexpr (N == 6) { 268| 348| static constexpr auto packed = pack_buffered(); 269| 348| uint64_t in{}; 270| 348| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 348| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 348| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm10ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm9EcEEbPKT1_: 245| 571| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| | else if constexpr (N == 6) { 268| | static constexpr auto packed = pack_buffered(); 269| | uint64_t in{}; 270| | std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| | return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| 571| else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| 571| return 0 == std::memcmp(Str.data(), other, N); 323| 571| } 324| 571| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm11ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 500| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 500| else if constexpr (N == 6) { 268| 500| static constexpr auto packed = pack_buffered(); 269| 500| uint64_t in{}; 270| 500| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 500| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 500| } _ZN3glz10comparitorIL_ZZNS_12decode_indexITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiELm12ERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT2_OT4_OT5_OT6_DpOT3_E15KeyWithEndQuoteELm6EcEEbPKT1_: 245| 305| { 246| | // pack() builds values in little-endian order (byte 0 in LSB position). 247| | // On big-endian systems, memcpy produces native (big-endian) values, 248| | // so we need to byteswap to match the packed representation. 249| | if constexpr (N == 8) { 250| | static constexpr auto packed = pack(); 251| | uint64_t in; 252| | std::memcpy(&in, other, 8); 253| | if constexpr (std::endian::native == std::endian::big) { 254| | in = std::byteswap(in); 255| | } 256| | return (in == packed); 257| | } 258| | else if constexpr (N == 7) { 259| | static constexpr auto packed = pack_buffered(); 260| | uint64_t in{}; 261| | std::memcpy(&in, other, 7); 262| | if constexpr (std::endian::native == std::endian::big) { 263| | in = std::byteswap(in); 264| | } 265| | return (in == packed); 266| | } 267| 305| else if constexpr (N == 6) { 268| 305| static constexpr auto packed = pack_buffered(); 269| 305| uint64_t in{}; 270| 305| std::memcpy(&in, other, 6); 271| | if constexpr (std::endian::native == std::endian::big) { 272| | in = std::byteswap(in); 273| | } 274| 305| return (in == packed); 275| | } 276| | else if constexpr (N == 5) { 277| | static constexpr auto packed = pack(); 278| | uint32_t in; 279| | std::memcpy(&in, other, 4); 280| | if constexpr (std::endian::native == std::endian::big) { 281| | in = std::byteswap(in); 282| | } 283| | return (in == packed) & (Str[4] == other[4]); 284| | } 285| | else if constexpr (N == 4) { 286| | static constexpr auto packed = pack(); 287| | uint32_t in; 288| | std::memcpy(&in, other, 4); 289| | if constexpr (std::endian::native == std::endian::big) { 290| | in = std::byteswap(in); 291| | } 292| | return (in == packed); 293| | } 294| | else if constexpr (N == 3) { 295| | static constexpr auto packed = pack(); 296| | uint16_t in; 297| | std::memcpy(&in, other, 2); 298| | if constexpr (std::endian::native == std::endian::big) { 299| | in = std::byteswap(in); 300| | } 301| | return (in == packed) & (Str[2] == other[2]); 302| | } 303| | else if constexpr (N == 2) { 304| | static constexpr auto packed = pack(); 305| | uint16_t in; 306| | std::memcpy(&in, other, 2); 307| | if constexpr (std::endian::native == std::endian::big) { 308| | in = std::byteswap(in); 309| | } 310| | return (in == packed); 311| | } 312| | else if constexpr (N == 1) { 313| | return Str[0] == other[0]; 314| | } 315| | else if constexpr (N == 0) { 316| | return true; 317| | } 318| | else { 319| | // Clang and GCC optimize this extremely well for constexpr std::string_view 320| | // Packing data can create more binary on GCC 321| | // The other cases probably aren't needed as compiler explorer shows them optimized equally well as memcmp 322| | return 0 == std::memcmp(Str.data(), other, N); 323| | } 324| 305| } _ZN3glz4dumpILb1ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEETkNS_10byte_sizedEcEEvT1_RT0_Rm: 150| 474k| { 151| 474k| if constexpr (Checked && vector_like) { 152| 474k| if (ix == b.size()) [[unlikely]] { ------------------ | Branch (152:14): [True: 0, False: 474k] ------------------ 153| 0| grow_buffer(b, b.size() == 0 ? 64 : ix + 1); ------------------ | Branch (153:28): [True: 0, False: 0] ------------------ 154| 0| } 155| 474k| } 156| 474k| assign_maybe_cast(c, b, ix); 157| 474k| ++ix; 158| 474k| } _ZN3glz17assign_maybe_castITkNS_10byte_sizedEcNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEvT_RT0_Rm: 95| 474k| { 96| 474k| using V = std::decay_t; 97| 474k| using C = std::decay_t; 98| 474k| if constexpr (std::same_as) { 99| 474k| b[ix] = c; 100| | } 101| | else { 102| | b[ix] = static_cast(c); 103| | } 104| 474k| } _ZN3glz4dumpILb1ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEvNS1_17basic_string_viewIcS4_EERT0_Rm: 192| 488k| { 193| 488k| const auto n = str.size(); 194| 488k| if constexpr (vector_like) { 195| 488k| if constexpr (Checked) { 196| 488k| const auto k = ix + n; 197| 488k| if (ix + n > b.size()) [[unlikely]] { ------------------ | Branch (197:17): [True: 0, False: 488k] ------------------ 198| 0| grow_buffer(b, k); 199| 0| } 200| 488k| } 201| 488k| } 202| 488k| std::memcpy(&b[ix], str.data(), n); 203| 488k| ix += n; 204| 488k| } _ZN3glz16dump_maybe_emptyILb1ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEvNS1_17basic_string_viewIcS4_EERT0_Rm: 319| 323k| { 320| 323k| const auto n = str.size(); 321| 323k| if (n) { ------------------ | Branch (321:11): [True: 323k, False: 0] ------------------ 322| 323k| if constexpr (vector_like) { 323| 323k| if constexpr (Checked) { 324| 323k| const auto k = ix + n; 325| 323k| if (k > b.size()) [[unlikely]] { ------------------ | Branch (325:20): [True: 0, False: 323k] ------------------ 326| 0| grow_buffer(b, k); 327| 0| } 328| 323k| } 329| 323k| } 330| 323k| std::memcpy(&b[ix], str.data(), n); 331| 323k| ix += n; 332| 323k| } 333| 323k| } _ZN3glz5dumpnINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEETkNS_10byte_sizedEcEEvT0_mRT_Rm: 222| 157k| { 223| 157k| if constexpr (vector_like) { 224| 157k| const auto k = ix + n; 225| 157k| if (k > b.size()) [[unlikely]] { ------------------ | Branch (225:14): [True: 0, False: 157k] ------------------ 226| 0| grow_buffer(b, k); 227| 0| } 228| 157k| } 229| 157k| fill_bytes(data_at(b, ix), c, n); 230| 157k| ix += n; 231| 157k| } _ZN3glz10fill_bytesIcEEvPT_cm: 54| 157k| { 55| 157k| auto* p = reinterpret_cast(dst); 56| 157k| if (n >= 64) [[unlikely]] { ------------------ | Branch (56:11): [True: 0, False: 157k] ------------------ 57| 0| std::memset(p, c, n); 58| 0| return; 59| 0| } 60| 157k| const uint64_t v = 0x0101010101010101ull * uint8_t(c); 61| 157k| if (n >= 8) { ------------------ | Branch (61:11): [True: 11.2k, False: 146k] ------------------ 62| 11.2k| size_t i = 0; 63| 33.0k| for (; i + 8 <= n; i += 8) { ------------------ | Branch (63:17): [True: 21.8k, False: 11.2k] ------------------ 64| 21.8k| std::memcpy(p + i, &v, 8); 65| 21.8k| } 66| 11.2k| if (i < n) { ------------------ | Branch (66:14): [True: 10.1k, False: 1.05k] ------------------ 67| 10.1k| std::memcpy(p + n - 8, &v, 8); // overlaps what is already written, stays within n 68| 10.1k| } 69| 11.2k| } 70| 146k| else if (n >= 4) { ------------------ | Branch (70:16): [True: 2.94k, False: 143k] ------------------ 71| 2.94k| std::memcpy(p, &v, 4); 72| 2.94k| std::memcpy(p + n - 4, &v, 4); 73| 2.94k| } 74| 143k| else if (n) { ------------------ | Branch (74:16): [True: 26.8k, False: 116k] ------------------ 75| 26.8k| std::memcpy(p, &v, 1); 76| 26.8k| std::memcpy(p + (n >> 1), &v, 1); 77| 26.8k| std::memcpy(p + n - 1, &v, 1); 78| 26.8k| } 79| 157k| } _ZN3glz7data_atINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEDaRT_m: 117| 157k| { 118| | if constexpr (std::is_pointer_v>) { 119| | return b + ix; 120| | } 121| 157k| else { 122| 157k| static_assert(has_data>, 123| 157k| "an output buffer must be contiguous: dump writes through memset and memcpy"); 124| | if constexpr (has_data_offset>) { 125| | assert(ix >= b.data_offset() && "Index before flush offset"); 126| | return b.data() + (ix - b.data_offset()); 127| | } 128| 157k| else { 129| 157k| return b.data() + ix; 130| 157k| } 131| 157k| } 132| 157k| } _ZN3glz4dumpILb0ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEETkNS_10byte_sizedEcEEvT1_RT0_Rm: 150| 347| { 151| | if constexpr (Checked && vector_like) { 152| | if (ix == b.size()) [[unlikely]] { 153| | grow_buffer(b, b.size() == 0 ? 64 : ix + 1); 154| | } 155| | } 156| 347| assign_maybe_cast(c, b, ix); 157| 347| ++ix; 158| 347| } _ZN3glz10fast_float4spanIKcEC2Ev: 438| 514k| constexpr span() : ptr(nullptr), length(0) {} _ZN3glz10fast_float10is_integerIcEEbT_: 1481| 5.72k|fastfloat_really_inline constexpr bool is_integer(UC c) noexcept { 1482| 5.72k| return !(c > UC('9') || c < UC('0')); ------------------ | Branch (1482:12): [True: 11, False: 5.71k] | Branch (1482:27): [True: 28, False: 5.68k] ------------------ 1483| 5.72k|} _ZN3glz10fast_float11digit_valueIcEEmT_: 1489| 8.75M|fastfloat_really_inline constexpr uint64_t digit_value(UC c) noexcept { 1490| 8.75M| return uint64_t(uint8_t(c) - uint8_t('0')); 1491| 8.75M|} _ZN3glz10fast_float4spanIKcEC2EPS2_m: 436| 271k| constexpr span(T const *_ptr, size_t _length) : ptr(_ptr), length(_length) {} _ZN3glz10fast_float26loop_parse_if_eight_digitsERPKcS2_Rm: 1679| 14.5k| uint64_t &i) { 1680| | // optimizes better than parse_if_eight_digits_unrolled() for UC = char. 1681| 876k| while ((std::distance(p, pend) >= 8) && ------------------ | Branch (1681:10): [True: 873k, False: 2.24k] ------------------ 1682| 873k| is_made_of_eight_digits_fast(read8_to_u64(p))) { ------------------ | Branch (1682:10): [True: 861k, False: 12.2k] ------------------ 1683| 861k| i = i * 100000000 + 1684| 861k| parse_eight_digits_unrolled(read8_to_u64( 1685| 861k| p)); // in rare cases, this will overflow, but that's ok 1686| 861k| p += 8; 1687| 861k| } 1688| 14.5k|} _ZN3glz10fast_float28is_made_of_eight_digits_fastEm: 1597| 873k|is_made_of_eight_digits_fast(uint64_t val) noexcept { 1598| 873k| return !((((val + 0x4646464646464646) | (val - 0x3030303030303030)) & 1599| 873k| 0x8080808080808080)); 1600| 873k|} _ZN3glz10fast_float12read8_to_u64IcEEmPKT_: 1503| 1.99M|read8_to_u64(UC const *chars) { 1504| 1.99M| if (cpp20_and_in_constexpr() || !std::is_same::value) { ------------------ | Branch (1504:7): [Folded, False: 0] | Branch (1504:35): [Folded, False: 0] ------------------ 1505| 0| uint64_t val = 0; 1506| 0| for (int i = 0; i < 8; ++i) { ------------------ | Branch (1506:21): [True: 0, False: 0] ------------------ 1507| 0| val |= uint64_t(uint8_t(*chars)) << (i * 8); 1508| 0| ++chars; 1509| 0| } 1510| 0| return val; 1511| 0| } 1512| 1.99M| uint64_t val; 1513| 1.99M| ::memcpy(&val, chars, sizeof(uint64_t)); 1514| |#if GLZ_FASTFLOAT_IS_BIG_ENDIAN == 1 1515| | // Need to read as-if the number was in little-endian order. 1516| | val = byteswap(val); 1517| |#endif 1518| 1.99M| return val; 1519| 1.99M|} _ZN3glz10fast_float27parse_eight_digits_unrolledEm: 1575| 1.12M|parse_eight_digits_unrolled(uint64_t val) { 1576| 1.12M| uint64_t const mask = 0x000000FF000000FF; 1577| 1.12M| uint64_t const mul1 = 0x000F424000000064; // 100 + (1000000ULL << 32) 1578| 1.12M| uint64_t const mul2 = 0x0000271000000001; // 1 + (10000ULL << 32) 1579| 1.12M| val -= 0x3030303030303030; 1580| 1.12M| val = (val * 10) + (val >> 8); // val = (val * 2561) >> 8; 1581| 1.12M| val = (((val & mask) * mul1) + (((val >> 16) & mask) * mul2)) >> 32; 1582| 1.12M| return uint32_t(val); 1583| 1.12M|} _ZNK3glz10fast_float4spanIKcE3lenEv: 440| 47.9k| constexpr size_t len() const noexcept { return length; } _ZN3glz10fast_float19from_chars_advancedIdcEENS0_19from_chars_result_tIT0_EERNS0_22parsed_number_string_tIS3_EERT_: 4249| 231k|from_chars_advanced(parsed_number_string_t &pns, T &value) noexcept { 4250| | 4251| 231k| static_assert(is_supported_float_type::value, 4252| 231k| "only some floating-point types are supported"); 4253| 231k| static_assert(is_supported_char_type::value, 4254| 231k| "only char, wchar_t, char16_t and char32_t are supported"); 4255| | 4256| 231k| from_chars_result_t answer; 4257| | 4258| 231k| answer.ec = std::errc(); // be optimistic 4259| 231k| answer.ptr = pns.lastmatch; 4260| | // The implementation of the Clinger's fast path is convoluted because 4261| | // we want round-to-nearest in all cases, irrespective of the rounding mode 4262| | // selected on the thread. 4263| | // We proceed optimistically, assuming that detail::rounds_to_nearest() 4264| | // returns true. 4265| 231k| if (binary_format::min_exponent_fast_path() <= pns.exponent && ------------------ | Branch (4265:7): [True: 228k, False: 3.16k] ------------------ 4266| 228k| pns.exponent <= binary_format::max_exponent_fast_path() && ------------------ | Branch (4266:7): [True: 223k, False: 5.13k] ------------------ 4267| 223k| !pns.too_many_digits) { ------------------ | Branch (4267:7): [True: 210k, False: 12.5k] ------------------ 4268| | // Unfortunately, the conventional Clinger's fast path is only possible 4269| | // when the system rounds to the nearest float. 4270| | // 4271| | // We expect the next branch to almost always be selected. 4272| | // We could check it first (before the previous branch), but 4273| | // there might be performance advantages at having the check 4274| | // be last. 4275| 210k| if (!cpp20_and_in_constexpr() && detail::rounds_to_nearest()) { ------------------ | Branch (4275:9): [True: 210k, Folded] | Branch (4275:38): [True: 210k, False: 0] ------------------ 4276| | // We have that fegetround() == FE_TONEAREST. 4277| | // Next is Clinger's fast path. 4278| 210k| if (pns.mantissa <= binary_format::max_mantissa_fast_path()) { ------------------ | Branch (4278:11): [True: 209k, False: 1.33k] ------------------ 4279| 209k| value = T(pns.mantissa); 4280| 209k| if (pns.exponent < 0) { ------------------ | Branch (4280:13): [True: 1.77k, False: 207k] ------------------ 4281| 1.77k| value = value / binary_format::exact_power_of_ten(-pns.exponent); 4282| 207k| } else { 4283| 207k| value = value * binary_format::exact_power_of_ten(pns.exponent); 4284| 207k| } 4285| 209k| if (pns.negative) { ------------------ | Branch (4285:13): [True: 5.41k, False: 203k] ------------------ 4286| 5.41k| value = -value; 4287| 5.41k| } 4288| 209k| return answer; 4289| 209k| } 4290| 210k| } else { 4291| | // We do not have that fegetround() == FE_TONEAREST. 4292| | // Next is a modified Clinger's fast path, inspired by Jakub Jelínek's 4293| | // proposal 4294| 0| if (pns.exponent >= 0 && ------------------ | Branch (4294:11): [True: 0, False: 0] ------------------ 4295| 0| pns.mantissa <= ------------------ | Branch (4295:11): [True: 0, False: 0] ------------------ 4296| 0| binary_format::max_mantissa_fast_path(pns.exponent)) { 4297| 0|#if defined(__clang__) || defined(GLZ_FASTFLOAT_32BIT) 4298| | // Clang may map 0 to -0.0 when fegetround() == FE_DOWNWARD 4299| 0| if (pns.mantissa == 0) { ------------------ | Branch (4299:13): [True: 0, False: 0] ------------------ 4300| 0| value = pns.negative ? T(-0.) : T(0.); ------------------ | Branch (4300:19): [True: 0, False: 0] ------------------ 4301| 0| return answer; 4302| 0| } 4303| 0|#endif 4304| 0| value = T(pns.mantissa) * 4305| 0| binary_format::exact_power_of_ten(pns.exponent); 4306| 0| if (pns.negative) { ------------------ | Branch (4306:13): [True: 0, False: 0] ------------------ 4307| 0| value = -value; 4308| 0| } 4309| 0| return answer; 4310| 0| } 4311| 0| } 4312| 210k| } 4313| 22.2k| adjusted_mantissa am = 4314| 22.2k| compute_float>(pns.exponent, pns.mantissa); 4315| 22.2k| if (pns.too_many_digits && am.power2 >= 0) { ------------------ | Branch (4315:7): [True: 18.3k, False: 3.91k] | Branch (4315:30): [True: 18.3k, False: 0] ------------------ 4316| 18.3k| if (am != compute_float>(pns.exponent, pns.mantissa + 1)) { ------------------ | Branch (4316:9): [True: 12.2k, False: 6.08k] ------------------ 4317| 12.2k| am = compute_error>(pns.exponent, pns.mantissa); 4318| 12.2k| } 4319| 18.3k| } 4320| | // If we called compute_float>(pns.exponent, pns.mantissa) 4321| | // and we have an invalid power (am.power2 < 0), then we need to go the long 4322| | // way around again. This is very uncommon. 4323| 22.2k| if (am.power2 < 0) { ------------------ | Branch (4323:7): [True: 12.2k, False: 9.99k] ------------------ 4324| 12.2k| am = digit_comp(pns, am); 4325| 12.2k| } 4326| 22.2k| to_float(pns.negative, am, value); 4327| | // Test for over/underflow. 4328| 22.2k| if ((pns.mantissa != 0 && am.mantissa == 0 && am.power2 == 0) || ------------------ | Branch (4328:8): [True: 21.6k, False: 598] | Branch (4328:29): [True: 1.81k, False: 19.8k] | Branch (4328:49): [True: 161, False: 1.65k] ------------------ 4329| 22.0k| am.power2 == binary_format::infinite_power()) { ------------------ | Branch (4329:7): [True: 297, False: 21.7k] ------------------ 4330| 458| answer.ec = std::errc::result_out_of_range; 4331| 458| } 4332| 22.2k| return answer; 4333| 231k|} _ZN3glz10fast_float13binary_formatIdE22min_exponent_fast_pathEv: 695| 231k|inline constexpr int binary_format::min_exponent_fast_path() { 696| |#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) 697| | return 0; 698| |#else 699| 231k| return -22; 700| 231k|#endif 701| 231k|} _ZN3glz10fast_float13binary_formatIdE22max_exponent_fast_pathEv: 767| 228k|inline constexpr int binary_format::max_exponent_fast_path() { 768| 228k| return 22; 769| 228k|} _ZN3glz10fast_float6detail17rounds_to_nearestEv: 4129| 210k|fastfloat_really_inline bool rounds_to_nearest() noexcept { 4130| | // https://lemire.me/blog/2020/06/26/gcc-not-nearest/ 4131| |#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) 4132| | return false; 4133| |#endif 4134| | // See 4135| | // A fast function to check your floating-point rounding mode 4136| | // https://lemire.me/blog/2022/11/16/a-fast-function-to-check-your-floating-point-rounding-mode/ 4137| | // 4138| | // This function is meant to be equivalent to : 4139| | // prior: #include 4140| | // return fegetround() == FE_TONEAREST; 4141| | // However, it is expected to be much faster than the fegetround() 4142| | // function call. 4143| | // 4144| | // The volatile keyword prevents the compiler from computing the function 4145| | // at compile-time. 4146| | // There might be other ways to prevent compile-time optimizations (e.g., 4147| | // asm). The value does not need to be std::numeric_limits::min(), any 4148| | // small value so that 1 + x should round to 1 would do (after accounting for 4149| | // excess precision, as in 387 instructions). 4150| 210k| static float volatile fmin = (std::numeric_limits::min)(); 4151| 210k| float fmini = fmin; // we copy it so that it gets loaded at most once. 4152| |// 4153| |// Explanation: 4154| |// Only when fegetround() == FE_TONEAREST do we have that 4155| |// fmin + 1.0f == 1.0f - fmin. 4156| |// 4157| |// FE_UPWARD: 4158| |// fmin + 1.0f > 1 4159| |// 1.0f - fmin == 1 4160| |// 4161| |// FE_DOWNWARD or FE_TOWARDZERO: 4162| |// fmin + 1.0f == 1 4163| |// 1.0f - fmin < 1 4164| |// 4165| |// Note: This may fail to be accurate if fast-math has been 4166| |// enabled, as rounding conventions may not apply. 4167| |#ifdef GLZ_FASTFLOAT_VISUAL_STUDIO 4168| |#pragma warning(push) 4169| |// todo: is there a VS warning? 4170| |// see 4171| |// https://stackoverflow.com/questions/46079446/is-there-a-warning-for-floating-point-equality-checking-in-visual-studio-2013 4172| |#elif defined(__clang__) 4173| |#pragma clang diagnostic push 4174| 210k|#pragma clang diagnostic ignored "-Wfloat-equal" 4175| |#elif defined(__GNUC__) 4176| |#pragma GCC diagnostic push 4177| |#pragma GCC diagnostic ignored "-Wfloat-equal" 4178| |#endif 4179| 210k| return (fmini + 1.0f == 1.0f - fmini); 4180| |#ifdef GLZ_FASTFLOAT_VISUAL_STUDIO 4181| |#pragma warning(pop) 4182| |#elif defined(__clang__) 4183| |#pragma clang diagnostic pop 4184| |#elif defined(__GNUC__) 4185| |#pragma GCC diagnostic pop 4186| |#endif 4187| 210k|} _ZN3glz10fast_float13binary_formatIdE22max_mantissa_fast_pathEv: 777| 210k|inline constexpr uint64_t binary_format::max_mantissa_fast_path() { 778| 210k| return uint64_t(2) << mantissa_explicit_bits(); 779| 210k|} _ZN3glz10fast_float13binary_formatIdE22mantissa_explicit_bitsEv: 713| 453k|inline constexpr int binary_format::mantissa_explicit_bits() { 714| 453k| return 52; 715| 453k|} _ZN3glz10fast_float13binary_formatIdE18exact_power_of_tenEl: 1057| 209k|binary_format::exact_power_of_ten(int64_t power) { 1058| | // Work around clang bug https://godbolt.org/z/zedh7rrhc 1059| 209k| return (void)powers_of_ten[0], powers_of_ten[power]; 1060| 209k|} _ZN3glz10fast_float13compute_floatINS0_13binary_formatIdEEEENS0_17adjusted_mantissaElm: 2852| 40.5k|compute_float(int64_t q, uint64_t w) noexcept { 2853| 40.5k| adjusted_mantissa answer; 2854| 40.5k| if ((w == 0) || (q < binary::smallest_power_of_ten())) { ------------------ | Branch (2854:7): [True: 598, False: 39.9k] | Branch (2854:19): [True: 200, False: 39.7k] ------------------ 2855| 798| answer.power2 = 0; 2856| 798| answer.mantissa = 0; 2857| | // result should be zero 2858| 798| return answer; 2859| 798| } 2860| 39.7k| if (q > binary::largest_power_of_ten()) { ------------------ | Branch (2860:7): [True: 328, False: 39.3k] ------------------ 2861| | // we want to get infinity: 2862| 328| answer.power2 = binary::infinite_power(); 2863| 328| answer.mantissa = 0; 2864| 328| return answer; 2865| 328| } 2866| | // At this point in time q is in [powers::smallest_power_of_five, 2867| | // powers::largest_power_of_five]. 2868| | 2869| | // We want the most significant bit of i to be 1. Shift if needed. 2870| 39.3k| int lz = leading_zeroes(w); 2871| 39.3k| w <<= lz; 2872| | 2873| | // The required precision is binary::mantissa_explicit_bits() + 3 because 2874| | // 1. We need the implicit bit 2875| | // 2. We need an extra bit for rounding purposes 2876| | // 3. We might lose a bit due to the "upperbit" routine (result too small, 2877| | // requiring a shift) 2878| | 2879| 39.3k| value128 product = 2880| 39.3k| compute_product_approximation(q, w); 2881| | // The computed 'product' is always sufficient. 2882| | // Mathematical proof: 2883| | // Noble Mushtak and Daniel Lemire, Fast Number Parsing Without Fallback (to 2884| | // appear) See script/mushtak_lemire.py 2885| | 2886| | // The "compute_product_approximation" function can be slightly slower than a 2887| | // branchless approach: value128 product = compute_product(q, w); but in 2888| | // practice, we can win big with the compute_product_approximation if its 2889| | // additional branch is easily predicted. Which is best is data specific. 2890| 39.3k| int upperbit = int(product.high >> 63); 2891| 39.3k| int shift = upperbit + 64 - binary::mantissa_explicit_bits() - 3; 2892| | 2893| 39.3k| answer.mantissa = product.high >> shift; 2894| | 2895| 39.3k| answer.power2 = int32_t(detail::power(int32_t(q)) + upperbit - lz - 2896| 39.3k| binary::minimum_exponent()); 2897| 39.3k| if (answer.power2 <= 0) { // we have a subnormal? ------------------ | Branch (2897:7): [True: 2.14k, False: 37.2k] ------------------ 2898| | // Here have that answer.power2 <= 0 so -answer.power2 >= 0 2899| 2.14k| if (-answer.power2 + 1 >= ------------------ | Branch (2899:9): [True: 12, False: 2.13k] ------------------ 2900| 2.14k| 64) { // if we have more than 64 bits below the minimum exponent, you 2901| | // have a zero for sure. 2902| 12| answer.power2 = 0; 2903| 12| answer.mantissa = 0; 2904| | // result should be zero 2905| 12| return answer; 2906| 12| } 2907| | // next line is safe because -answer.power2 + 1 < 64 2908| 2.13k| answer.mantissa >>= -answer.power2 + 1; 2909| | // Thankfully, we can't have both "round-to-even" and subnormals because 2910| | // "round-to-even" only occurs for powers close to 0 in the 32-bit and 2911| | // and 64-bit case (with no more than 19 digits). 2912| 2.13k| answer.mantissa += (answer.mantissa & 1); // round up 2913| 2.13k| answer.mantissa >>= 1; 2914| | // There is a weird scenario where we don't have a subnormal but just. 2915| | // Suppose we start with 2.2250738585072013e-308, we end up 2916| | // with 0x3fffffffffffff x 2^-1023-53 which is technically subnormal 2917| | // whereas 0x40000000000000 x 2^-1023-53 is normal. Now, we need to round 2918| | // up 0x3fffffffffffff x 2^-1023-53 and once we do, we are no longer 2919| | // subnormal, but we can only know this after rounding. 2920| | // So we only declare a subnormal if we are smaller than the threshold. 2921| 2.13k| answer.power2 = 2922| 2.13k| (answer.mantissa < (uint64_t(1) << binary::mantissa_explicit_bits())) ------------------ | Branch (2922:9): [True: 2.13k, False: 0] ------------------ 2923| 2.13k| ? 0 2924| 2.13k| : 1; 2925| 2.13k| return answer; 2926| 2.14k| } 2927| | 2928| | // usually, we round *up*, but if we fall right in between and and we have an 2929| | // even basis, we need to round down 2930| | // We are only concerned with the cases where 5**q fits in single 64-bit word. 2931| 37.2k| if ((product.low <= 1) && (q >= binary::min_exponent_round_to_even()) && ------------------ | Branch (2931:7): [True: 9.93k, False: 27.3k] | Branch (2931:29): [True: 9.18k, False: 750] ------------------ 2932| 9.18k| (q <= binary::max_exponent_round_to_even()) && ------------------ | Branch (2932:7): [True: 8.72k, False: 465] ------------------ 2933| 8.72k| ((answer.mantissa & 3) == 1)) { // we may fall between two floats! ------------------ | Branch (2933:7): [True: 3.22k, False: 5.50k] ------------------ 2934| | // To be in-between two floats we need that in doing 2935| | // answer.mantissa = product.high >> (upperbit + 64 - 2936| | // binary::mantissa_explicit_bits() - 3); 2937| | // ... we dropped out only zeroes. But if this happened, then we can go 2938| | // back!!! 2939| 3.22k| if ((answer.mantissa << shift) == product.high) { ------------------ | Branch (2939:9): [True: 1.52k, False: 1.69k] ------------------ 2940| 1.52k| answer.mantissa &= ~uint64_t(1); // flip it so that we do not round up 2941| 1.52k| } 2942| 3.22k| } 2943| | 2944| 37.2k| answer.mantissa += (answer.mantissa & 1); // round up 2945| 37.2k| answer.mantissa >>= 1; 2946| 37.2k| if (answer.mantissa >= (uint64_t(2) << binary::mantissa_explicit_bits())) { ------------------ | Branch (2946:7): [True: 1.53k, False: 35.7k] ------------------ 2947| 1.53k| answer.mantissa = (uint64_t(1) << binary::mantissa_explicit_bits()); 2948| 1.53k| answer.power2++; // undo previous addition 2949| 1.53k| } 2950| | 2951| 37.2k| answer.mantissa &= ~(uint64_t(1) << binary::mantissa_explicit_bits()); 2952| 37.2k| if (answer.power2 >= binary::infinite_power()) { // infinity ------------------ | Branch (2952:7): [True: 46, False: 37.2k] ------------------ 2953| 46| answer.power2 = binary::infinite_power(); 2954| 46| answer.mantissa = 0; 2955| 46| } 2956| 37.2k| return answer; 2957| 39.3k|} _ZN3glz10fast_float17adjusted_mantissaC2Ev: 568| 64.9k| adjusted_mantissa() = default; _ZN3glz10fast_float13binary_formatIdE21smallest_power_of_tenEv: 1077| 39.9k|inline constexpr int binary_format::smallest_power_of_ten() { 1078| 39.9k| return -342; 1079| 39.9k|} _ZN3glz10fast_float13binary_formatIdE20largest_power_of_tenEv: 1068| 39.7k|template <> inline constexpr int binary_format::largest_power_of_ten() { 1069| 39.7k| return 308; 1070| 39.7k|} _ZN3glz10fast_float14leading_zeroesEm: 488| 58.5k|leading_zeroes(uint64_t input_num) { 489| 58.5k| assert(input_num > 0); ------------------ | Branch (489:3): [True: 58.5k, False: 0] ------------------ 490| 58.5k| if (cpp20_and_in_constexpr()) { ------------------ | Branch (490:7): [Folded, False: 58.5k] ------------------ 491| 0| return leading_zeroes_generic(input_num); 492| 0| } 493| |#ifdef GLZ_FASTFLOAT_VISUAL_STUDIO 494| |#if defined(_M_X64) || defined(_M_ARM64) 495| | unsigned long leading_zero = 0; 496| | // Search the mask data from most significant bit (MSB) 497| | // to least significant bit (LSB) for a set bit (1). 498| | _BitScanReverse64(&leading_zero, input_num); 499| | return (int)(63 - leading_zero); 500| |#else 501| | return leading_zeroes_generic(input_num); 502| |#endif 503| |#else 504| 58.5k| return __builtin_clzll(input_num); 505| 58.5k|#endif 506| 58.5k|} _ZN3glz10fast_float29compute_product_approximationILi55EEENS0_8value128Elm: 2771| 51.6k|compute_product_approximation(int64_t q, uint64_t w) { 2772| 51.6k| int const index = 2 * int(q - powers::smallest_power_of_five); 2773| | // For small values of q, e.g., q in [0,27], the answer is always exact 2774| | // because The line value128 firstproduct = full_multiplication(w, 2775| | // power_of_five_128[index]); gives the exact answer. 2776| 51.6k| value128 firstproduct = 2777| 51.6k| full_multiplication(w, powers::power_of_five_128[index]); 2778| 51.6k| static_assert((bit_precision >= 0) && (bit_precision <= 64), 2779| 51.6k| " precision should be in (0,64]"); 2780| 51.6k| constexpr uint64_t precision_mask = 2781| 51.6k| (bit_precision < 64) ? (uint64_t(0xFFFFFFFFFFFFFFFF) >> bit_precision) ------------------ | Branch (2781:7): [True: 0, Folded] ------------------ 2782| 51.6k| : uint64_t(0xFFFFFFFFFFFFFFFF); 2783| 51.6k| if ((firstproduct.high & precision_mask) == ------------------ | Branch (2783:7): [True: 7.87k, False: 43.7k] ------------------ 2784| 51.6k| precision_mask) { // could further guard with (lower + w < lower) 2785| | // regarding the second product, we only need secondproduct.high, but our 2786| | // expectation is that the compiler will optimize this extra work away if 2787| | // needed. 2788| 7.87k| value128 secondproduct = 2789| 7.87k| full_multiplication(w, powers::power_of_five_128[index + 1]); 2790| 7.87k| firstproduct.low += secondproduct.high; 2791| 7.87k| if (secondproduct.high > firstproduct.low) { ------------------ | Branch (2791:9): [True: 3.05k, False: 4.82k] ------------------ 2792| 3.05k| firstproduct.high++; 2793| 3.05k| } 2794| 7.87k| } 2795| 51.6k| return firstproduct; 2796| 51.6k|} _ZN3glz10fast_float19full_multiplicationEmm: 540| 59.4k|full_multiplication(uint64_t a, uint64_t b) { 541| 59.4k| if (cpp20_and_in_constexpr()) { ------------------ | Branch (541:7): [Folded, False: 59.4k] ------------------ 542| 0| value128 answer; 543| 0| answer.low = umul128_generic(a, b, &answer.high); 544| 0| return answer; 545| 0| } 546| 59.4k| value128 answer; 547| |#if defined(_M_ARM64) && !defined(__MINGW32__) 548| | // ARM64 has native support for 64-bit multiplications, no need to emulate 549| | // But MinGW on ARM64 doesn't have native support for 64-bit multiplications 550| | answer.high = __umulh(a, b); 551| | answer.low = a * b; 552| |#elif defined(GLZ_FASTFLOAT_32BIT) || \ 553| | (defined(_WIN64) && !defined(__clang__) && !defined(_M_ARM64)) 554| | answer.low = _umul128(a, b, &answer.high); // _umul128 not available on ARM64 555| |#elif defined(GLZ_FASTFLOAT_64BIT) && defined(__SIZEOF_INT128__) 556| | __uint128_t r = ((__uint128_t)a) * b; 557| 59.4k| answer.low = uint64_t(r); 558| 59.4k| answer.high = uint64_t(r >> 64); 559| |#else 560| | answer.low = umul128_generic(a, b, &answer.high); 561| |#endif 562| 59.4k| return answer; 563| 59.4k|} _ZN3glz10fast_float8value128C2Ev: 454| 59.4k| constexpr value128() : low(0), high(0) {} _ZN3glz10fast_float6detail5powerEi: 2814| 51.6k|constexpr fastfloat_really_inline int32_t power(int32_t q) noexcept { 2815| 51.6k| return (((152170 + 65536) * q) >> 16) + 63; 2816| 51.6k|} _ZN3glz10fast_float13binary_formatIdE16minimum_exponentEv: 742| 63.8k|template <> inline constexpr int binary_format::minimum_exponent() { 743| 63.8k| return -1023; 744| 63.8k|} _ZN3glz10fast_float13binary_formatIdE26min_exponent_round_to_evenEv: 733| 9.93k|inline constexpr int binary_format::min_exponent_round_to_even() { 734| 9.93k| return -4; 735| 9.93k|} _ZN3glz10fast_float13binary_formatIdE26max_exponent_round_to_evenEv: 723| 9.18k|inline constexpr int binary_format::max_exponent_round_to_even() { 724| 9.18k| return 23; 725| 9.18k|} _ZNK3glz10fast_float17adjusted_mantissaneERKS1_: 574| 18.3k| constexpr bool operator!=(adjusted_mantissa const &o) const { 575| 18.3k| return mantissa != o.mantissa || power2 != o.power2; ------------------ | Branch (575:12): [True: 12.2k, False: 6.08k] | Branch (575:38): [True: 0, False: 6.08k] ------------------ 576| 18.3k| } _ZN3glz10fast_float13compute_errorINS0_13binary_formatIdEEEENS0_17adjusted_mantissaElm: 2837| 12.2k|compute_error(int64_t q, uint64_t w) noexcept { 2838| 12.2k| int lz = leading_zeroes(w); 2839| 12.2k| w <<= lz; 2840| 12.2k| value128 product = 2841| 12.2k| compute_product_approximation(q, w); 2842| 12.2k| return compute_error_scaled(q, product.high, lz); 2843| 12.2k|} _ZN3glz10fast_float20compute_error_scaledINS0_13binary_formatIdEEEENS0_17adjusted_mantissaElmi: 2823| 12.2k|compute_error_scaled(int64_t q, uint64_t w, int lz) noexcept { 2824| 12.2k| int hilz = int(w >> 63) ^ 1; 2825| 12.2k| adjusted_mantissa answer; 2826| 12.2k| answer.mantissa = w << hilz; 2827| 12.2k| int bias = binary::mantissa_explicit_bits() - binary::minimum_exponent(); 2828| 12.2k| answer.power2 = int32_t(detail::power(int32_t(q)) + bias - hilz - lz - 62 + 2829| 12.2k| invalid_am_bias); 2830| 12.2k| return answer; 2831| 12.2k|} _ZN3glz10fast_float10digit_compIdcEENS0_17adjusted_mantissaERNS0_22parsed_number_string_tIT0_EES2_: 4034| 12.2k|digit_comp(parsed_number_string_t &num, adjusted_mantissa am) noexcept { 4035| | // remove the invalid exponent bias 4036| 12.2k| am.power2 -= invalid_am_bias; 4037| | 4038| 12.2k| int32_t sci_exp = scientific_exponent(num); 4039| 12.2k| size_t max_digits = binary_format::max_digits(); 4040| 12.2k| size_t digits = 0; 4041| 12.2k| bigint bigmant; 4042| 12.2k| parse_mantissa(bigmant, num, max_digits, digits); 4043| | // can't underflow, since digits is at most max_digits. 4044| 12.2k| int32_t exponent = sci_exp + 1 - int32_t(digits); 4045| 12.2k| if (exponent >= 0) { ------------------ | Branch (4045:7): [True: 3.47k, False: 8.74k] ------------------ 4046| 3.47k| return positive_digit_comp(bigmant, exponent); 4047| 8.74k| } else { 4048| 8.74k| return negative_digit_comp(bigmant, am, exponent); 4049| 8.74k| } 4050| 12.2k|} _ZN3glz10fast_float19scientific_exponentIcEEiRNS0_22parsed_number_string_tIT_EE: 3640| 12.2k|scientific_exponent(parsed_number_string_t &num) noexcept { 3641| 12.2k| uint64_t mantissa = num.mantissa; 3642| 12.2k| int32_t exponent = int32_t(num.exponent); 3643| 61.1k| while (mantissa >= 10000) { ------------------ | Branch (3643:10): [True: 48.8k, False: 12.2k] ------------------ 3644| 48.8k| mantissa /= 10000; 3645| 48.8k| exponent += 4; 3646| 48.8k| } 3647| 24.4k| while (mantissa >= 100) { ------------------ | Branch (3647:10): [True: 12.2k, False: 12.2k] ------------------ 3648| 12.2k| mantissa /= 100; 3649| 12.2k| exponent += 2; 3650| 12.2k| } 3651| 12.2k| while (mantissa >= 10) { ------------------ | Branch (3651:10): [True: 0, False: 12.2k] ------------------ 3652| 0| mantissa /= 10; 3653| 0| exponent += 1; 3654| 0| } 3655| 12.2k| return exponent; 3656| 12.2k|} _ZN3glz10fast_float13binary_formatIdE10max_digitsEv: 1085| 12.2k|template <> inline constexpr size_t binary_format::max_digits() { 1086| 12.2k| return 769; 1087| 12.2k|} _ZN3glz10fast_float6bigintC2Ev: 3399| 12.2k| GLZ_FASTFLOAT_CONSTEXPR20 bigint() : vec() {} _ZN3glz10fast_float8stackvecILt62EEC2Ev: 3006| 77.2k| stackvec() = default; _ZN3glz10fast_float14parse_mantissaIcEEvRNS0_6bigintERNS0_22parsed_number_string_tIT_EEmRm: 3859| 12.2k| size_t max_digits, size_t &digits) noexcept { 3860| | // try to minimize the number of big integer and scalar multiplication. 3861| | // therefore, try to parse 8 digits at a time, and multiply by the largest 3862| | // scalar value (9 or 19 digits) for each step. 3863| 12.2k| size_t counter = 0; 3864| 12.2k| digits = 0; 3865| 12.2k| limb value = 0; 3866| 12.2k|#ifdef GLZ_FASTFLOAT_64BIT_LIMB 3867| 12.2k| size_t step = 19; 3868| |#else 3869| | size_t step = 9; 3870| |#endif 3871| | 3872| | // process all integer digits. 3873| 12.2k| UC const *p = num.integer.ptr; 3874| 12.2k| UC const *pend = p + num.integer.len(); 3875| 12.2k| skip_zeros(p, pend); 3876| | // process all digits, in increments of step per loop 3877| 50.1k| while (p != pend) { ------------------ | Branch (3877:10): [True: 38.1k, False: 12.0k] ------------------ 3878| 97.8k| while ((std::distance(p, pend) >= 8) && (step - counter >= 8) && ------------------ | Branch (3878:12): [True: 83.6k, False: 14.1k] | Branch (3878:45): [True: 59.8k, False: 23.7k] ------------------ 3879| 59.8k| (max_digits - digits >= 8)) { ------------------ | Branch (3879:12): [True: 59.7k, False: 148] ------------------ 3880| 59.7k| parse_eight_digits(p, value, counter, digits); 3881| 59.7k| } 3882| 154k| while (counter < step && p != pend && digits < max_digits) { ------------------ | Branch (3882:12): [True: 126k, False: 27.7k] | Branch (3882:30): [True: 116k, False: 10.1k] | Branch (3882:43): [True: 116k, False: 150] ------------------ 3883| 116k| parse_one_digit(p, value, counter, digits); 3884| 116k| } 3885| 38.1k| if (digits == max_digits) { ------------------ | Branch (3885:9): [True: 150, False: 37.9k] ------------------ 3886| | // add the temporary value, then check if we've truncated any digits 3887| 150| add_native(result, limb(powers_of_ten_uint64[counter]), value); 3888| 150| bool truncated = is_truncated(p, pend); 3889| 150| if (num.fraction.ptr != nullptr) { ------------------ | Branch (3889:11): [True: 75, False: 75] ------------------ 3890| 75| truncated |= is_truncated(num.fraction); 3891| 75| } 3892| 150| if (truncated) { ------------------ | Branch (3892:11): [True: 134, False: 16] ------------------ 3893| 134| round_up_bigint(result, digits); 3894| 134| } 3895| 150| return; 3896| 37.9k| } else { 3897| 37.9k| add_native(result, limb(powers_of_ten_uint64[counter]), value); 3898| 37.9k| counter = 0; 3899| 37.9k| value = 0; 3900| 37.9k| } 3901| 38.1k| } 3902| | 3903| | // add our fraction digits, if they're available. 3904| 12.0k| if (num.fraction.ptr != nullptr) { ------------------ | Branch (3904:7): [True: 8.68k, False: 3.38k] ------------------ 3905| 8.68k| p = num.fraction.ptr; 3906| 8.68k| pend = p + num.fraction.len(); 3907| 8.68k| if (digits == 0) { ------------------ | Branch (3907:9): [True: 1.83k, False: 6.84k] ------------------ 3908| 1.83k| skip_zeros(p, pend); 3909| 1.83k| } 3910| | // process all digits, in increments of step per loop 3911| 113k| while (p != pend) { ------------------ | Branch (3911:12): [True: 106k, False: 6.22k] ------------------ 3912| 310k| while ((std::distance(p, pend) >= 8) && (step - counter >= 8) && ------------------ | Branch (3912:14): [True: 302k, False: 8.39k] | Branch (3912:47): [True: 204k, False: 97.6k] ------------------ 3913| 204k| (max_digits - digits >= 8)) { ------------------ | Branch (3913:14): [True: 203k, False: 809] ------------------ 3914| 203k| parse_eight_digits(p, value, counter, digits); 3915| 203k| } 3916| 421k| while (counter < step && p != pend && digits < max_digits) { ------------------ | Branch (3916:14): [True: 322k, False: 98.5k] | Branch (3916:32): [True: 316k, False: 6.13k] | Branch (3916:45): [True: 314k, False: 2.17k] ------------------ 3917| 314k| parse_one_digit(p, value, counter, digits); 3918| 314k| } 3919| 106k| if (digits == max_digits) { ------------------ | Branch (3919:11): [True: 2.46k, False: 104k] ------------------ 3920| | // add the temporary value, then check if we've truncated any digits 3921| 2.46k| add_native(result, limb(powers_of_ten_uint64[counter]), value); 3922| 2.46k| bool truncated = is_truncated(p, pend); 3923| 2.46k| if (truncated) { ------------------ | Branch (3923:13): [True: 1.65k, False: 809] ------------------ 3924| 1.65k| round_up_bigint(result, digits); 3925| 1.65k| } 3926| 2.46k| return; 3927| 104k| } else { 3928| 104k| add_native(result, limb(powers_of_ten_uint64[counter]), value); 3929| 104k| counter = 0; 3930| 104k| value = 0; 3931| 104k| } 3932| 106k| } 3933| 8.68k| } 3934| | 3935| 9.60k| if (counter != 0) { ------------------ | Branch (3935:7): [True: 0, False: 9.60k] ------------------ 3936| 0| add_native(result, limb(powers_of_ten_uint64[counter]), value); 3937| 0| } 3938| 9.60k|} _ZN3glz10fast_float10skip_zerosIcEEvRPKT_S4_: 3773| 14.0k|skip_zeros(UC const *&first, UC const *last) noexcept { 3774| 14.0k| uint64_t val; 3775| 34.4k| while (!cpp20_and_in_constexpr() && ------------------ | Branch (3775:10): [True: 34.4k, Folded] ------------------ 3776| 34.4k| std::distance(first, last) >= int_cmp_len()) { ------------------ | Branch (3776:10): [True: 29.5k, False: 4.89k] ------------------ 3777| 29.5k| ::memcpy(&val, first, sizeof(uint64_t)); 3778| 29.5k| if (val != int_cmp_zeros()) { ------------------ | Branch (3778:9): [True: 9.16k, False: 20.3k] ------------------ 3779| 9.16k| break; 3780| 9.16k| } 3781| 20.3k| first += int_cmp_len(); 3782| 20.3k| } 3783| 20.5k| while (first != last) { ------------------ | Branch (3783:10): [True: 18.6k, False: 1.83k] ------------------ 3784| 18.6k| if (*first != UC('0')) { ------------------ | Branch (3784:9): [True: 12.2k, False: 6.45k] ------------------ 3785| 12.2k| break; 3786| 12.2k| } 3787| 6.45k| first++; 3788| 6.45k| } 3789| 14.0k|} _ZN3glz10fast_float11int_cmp_lenIcEEiv: 1180| 121k|template constexpr int int_cmp_len() { 1181| 121k| return sizeof(uint64_t) / sizeof(UC); 1182| 121k|} _ZN3glz10fast_float13int_cmp_zerosIcEEmv: 1170| 62.6k|template constexpr uint64_t int_cmp_zeros() { 1171| 62.6k| static_assert((sizeof(UC) == 1) || (sizeof(UC) == 2) || (sizeof(UC) == 4), 1172| 62.6k| "Unsupported character size"); 1173| 62.6k| return (sizeof(UC) == 1) ? 0x3030303030303030 ------------------ | Branch (1173:10): [True: 62.6k, Folded] ------------------ 1174| 62.6k| : (sizeof(UC) == 2) ------------------ | Branch (1174:12): [Folded, False: 0] ------------------ 1175| 0| ? (uint64_t(UC('0')) << 48 | uint64_t(UC('0')) << 32 | 1176| 0| uint64_t(UC('0')) << 16 | UC('0')) 1177| 0| : (uint64_t(UC('0')) << 32 | UC('0')); 1178| 62.6k|} _ZN3glz10fast_float18parse_eight_digitsIcEEvRPKT_RmS6_S6_: 3824| 263k| size_t &count) noexcept { 3825| 263k| value = value * 100000000 + parse_eight_digits_unrolled(p); 3826| 263k| p += 8; 3827| 263k| counter += 8; 3828| 263k| count += 8; 3829| 263k|} _ZN3glz10fast_float27parse_eight_digits_unrolledIcEEjPKT_: 1588| 263k|parse_eight_digits_unrolled(UC const *chars) noexcept { 1589| 263k| if (cpp20_and_in_constexpr() || !has_simd_opt()) { ------------------ | Branch (1589:7): [Folded, False: 0] | Branch (1589:35): [True: 0, Folded] ------------------ 1590| 263k| return parse_eight_digits_unrolled(read8_to_u64(chars)); // truncation okay 1591| 263k| } 1592| 0| return parse_eight_digits_unrolled(simd_read8_to_u64(chars)); 1593| 263k|} _ZN3glz10fast_float15parse_one_digitIcEEvRPKT_RmS6_S6_: 3834| 430k| size_t &count) noexcept { 3835| 430k| value = value * 10 + limb(*p - UC('0')); 3836| 430k| p++; 3837| 430k| counter++; 3838| 430k| count++; 3839| 430k|} _ZN3glz10fast_float10add_nativeERNS0_6bigintEmm: 3842| 146k|add_native(bigint &big, limb power, limb value) noexcept { 3843| 146k| big.mul(power); 3844| 146k| big.add(value); 3845| 146k|} _ZN3glz10fast_float6bigint3mulEm: 3552| 146k| GLZ_FASTFLOAT_CONSTEXPR20 bool mul(limb y) noexcept { return small_mul(vec, y); } _ZN3glz10fast_float9small_mulILt62EEEbRNS0_8stackvecIXT_EEEm: 3249| 243k| limb y) noexcept { 3250| 243k| limb carry = 0; 3251| 3.54M| for (size_t index = 0; index < vec.len(); index++) { ------------------ | Branch (3251:26): [True: 3.30M, False: 243k] ------------------ 3252| 3.30M| vec[index] = scalar_mul(vec[index], y, carry); 3253| 3.30M| } 3254| 243k| if (carry != 0) { ------------------ | Branch (3254:7): [True: 215k, False: 27.7k] ------------------ 3255| 215k| GLZ_FASTFLOAT_TRY(vec.try_push(carry)); ------------------ | | 354| 215k| { \ | | 355| 215k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 215k] | | ------------------ | | 356| 215k| return false; \ | | 357| 215k| } ------------------ 3256| 215k| } 3257| 243k| return true; 3258| 243k|} _ZNK3glz10fast_float8stackvecILt62EE3lenEv: 3039| 4.60M| constexpr size_t len() const noexcept { return length; } _ZN3glz10fast_float10scalar_mulEmmRm: 3196| 3.30M|scalar_mul(limb x, limb y, limb &carry) noexcept { 3197| 3.30M|#ifdef GLZ_FASTFLOAT_64BIT_LIMB 3198| 3.30M|#if defined(__SIZEOF_INT128__) 3199| | // GCC and clang both define it as an extension. 3200| 3.30M| __uint128_t z = __uint128_t(x) * __uint128_t(y) + __uint128_t(carry); 3201| 3.30M| carry = limb(z >> limb_bits); 3202| 3.30M| return limb(z); 3203| |#else 3204| | // fallback, no native 128-bit integer multiplication with carry. 3205| | // on msvc, this optimizes identically, somehow. 3206| | value128 z = full_multiplication(x, y); 3207| | bool overflow; 3208| | z.low = scalar_add(z.low, carry, overflow); 3209| | z.high += uint64_t(overflow); // cannot overflow 3210| | carry = z.high; 3211| | return z.low; 3212| |#endif 3213| |#else 3214| | uint64_t z = uint64_t(x) * uint64_t(y) + uint64_t(carry); 3215| | carry = limb(z >> limb_bits); 3216| | return limb(z); 3217| |#endif 3218| 3.30M|} _ZN3glz10fast_float8stackvecILt62EEixEm: 3017| 8.03M| GLZ_FASTFLOAT_CONSTEXPR14 limb &operator[](size_t index) noexcept { 3018| 8.03M| GLZ_FASTFLOAT_DEBUG_ASSERT(index < length); ------------------ | | 349| 8.03M| { ((void)(x)); } ------------------ 3019| 8.03M| return data[index]; 3020| 8.03M| } _ZN3glz10fast_float8stackvecILt62EE8try_pushEm: 3052| 230k| GLZ_FASTFLOAT_CONSTEXPR14 bool try_push(limb value) noexcept { 3053| 230k| if (len() < capacity()) { ------------------ | Branch (3053:9): [True: 230k, False: 0] ------------------ 3054| 230k| push_unchecked(value); 3055| 230k| return true; 3056| 230k| } else { 3057| 0| return false; 3058| 0| } 3059| 230k| } _ZNK3glz10fast_float8stackvecILt62EE8capacityEv: 3043| 362k| constexpr size_t capacity() const noexcept { return size; } _ZN3glz10fast_float8stackvecILt62EE14push_uncheckedEm: 3046| 239k| GLZ_FASTFLOAT_CONSTEXPR14 void push_unchecked(limb value) noexcept { 3047| 239k| data[length] = value; 3048| 239k| length++; 3049| 239k| } _ZN3glz10fast_float6bigint3addEm: 3554| 146k| GLZ_FASTFLOAT_CONSTEXPR20 bool add(limb y) noexcept { return small_add(vec, y); } _ZN3glz10fast_float9small_addILt62EEEbRNS0_8stackvecIXT_EEEm: 3242| 146k|small_add(stackvec &vec, limb y) noexcept { 3243| 146k| return small_add_from(vec, y, 0); 3244| 146k|} _ZN3glz10fast_float14small_add_fromILt62EEEbRNS0_8stackvecIXT_EEEmm: 3224| 146k| size_t start) noexcept { 3225| 146k| size_t index = start; 3226| 146k| limb carry = y; 3227| 146k| bool overflow; 3228| 255k| while (carry != 0 && index < vec.len()) { ------------------ | Branch (3228:10): [True: 120k, False: 134k] | Branch (3228:24): [True: 108k, False: 12.2k] ------------------ 3229| 108k| vec[index] = scalar_add(vec[index], carry, overflow); 3230| 108k| carry = limb(overflow); 3231| 108k| index += 1; 3232| 108k| } 3233| 146k| if (carry != 0) { ------------------ | Branch (3233:7): [True: 12.2k, False: 134k] ------------------ 3234| 12.2k| GLZ_FASTFLOAT_TRY(vec.try_push(carry)); ------------------ | | 354| 12.2k| { \ | | 355| 12.2k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 12.2k] | | ------------------ | | 356| 12.2k| return false; \ | | 357| 12.2k| } ------------------ 3235| 12.2k| } 3236| 146k| return true; 3237| 146k|} _ZN3glz10fast_float10scalar_addEmmRb: 3176| 826k|scalar_add(limb x, limb y, bool &overflow) noexcept { 3177| 826k| limb z; 3178| |// gcc and clang 3179| 826k|#if defined(__has_builtin) 3180| 826k|#if __has_builtin(__builtin_add_overflow) 3181| 826k| if (!cpp20_and_in_constexpr()) { ------------------ | Branch (3181:7): [True: 826k, Folded] ------------------ 3182| 826k| overflow = __builtin_add_overflow(x, y, &z); 3183| 826k| return z; 3184| 826k| } 3185| 0|#endif 3186| 0|#endif 3187| | 3188| | // generic, this still optimizes correctly on MSVC. 3189| 0| z = x + y; 3190| 0| overflow = z < x; 3191| 0| return z; 3192| 826k|} _ZN3glz10fast_float12is_truncatedIcEEbPKT_S4_: 3795| 2.68k|is_truncated(UC const *first, UC const *last) noexcept { 3796| | // do 8-bit optimizations, can just compare to 8 literal 0s. 3797| 2.68k| uint64_t val; 3798| 34.6k| while (!cpp20_and_in_constexpr() && ------------------ | Branch (3798:10): [True: 34.6k, Folded] ------------------ 3799| 34.6k| std::distance(first, last) >= int_cmp_len()) { ------------------ | Branch (3799:10): [True: 33.1k, False: 1.50k] ------------------ 3800| 33.1k| ::memcpy(&val, first, sizeof(uint64_t)); 3801| 33.1k| if (val != int_cmp_zeros()) { ------------------ | Branch (3801:9): [True: 1.18k, False: 31.9k] ------------------ 3802| 1.18k| return true; 3803| 1.18k| } 3804| 31.9k| first += int_cmp_len(); 3805| 31.9k| } 3806| 4.56k| while (first != last) { ------------------ | Branch (3806:10): [True: 3.70k, False: 860] ------------------ 3807| 3.70k| if (*first != UC('0')) { ------------------ | Branch (3807:9): [True: 644, False: 3.05k] ------------------ 3808| 644| return true; 3809| 644| } 3810| 3.05k| ++first; 3811| 3.05k| } 3812| 860| return false; 3813| 1.50k|} _ZN3glz10fast_float12is_truncatedIcEEbNS0_4spanIKT_EE: 3817| 75|is_truncated(span s) noexcept { 3818| 75| return is_truncated(s.ptr, s.ptr + s.len()); 3819| 75|} _ZN3glz10fast_float15round_up_bigintERNS0_6bigintERm: 3848| 1.78k|round_up_bigint(bigint &big, size_t &count) noexcept { 3849| | // need to round-up the digits, but need to avoid rounding 3850| | // ....9999 to ...10000, which could cause a false halfway point. 3851| 1.78k| add_native(big, 10, 1); 3852| 1.78k| count++; 3853| 1.78k|} _ZN3glz10fast_float19positive_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintEi: 3942| 3.47k|positive_digit_comp(bigint &bigmant, int32_t exponent) noexcept { 3943| 3.47k| GLZ_FASTFLOAT_ASSERT(bigmant.pow10(uint32_t(exponent))); ------------------ | | 344| 3.47k| { ((void)(x)); } ------------------ 3944| 3.47k| adjusted_mantissa answer; 3945| 3.47k| bool truncated; 3946| 3.47k| answer.mantissa = bigmant.hi64(truncated); 3947| 3.47k| int bias = binary_format::mantissa_explicit_bits() - 3948| 3.47k| binary_format::minimum_exponent(); 3949| 3.47k| answer.power2 = bigmant.bit_length() - 64 + bias; 3950| | 3951| 3.47k| round(answer, [truncated](adjusted_mantissa &a, int32_t shift) { 3952| 3.47k| round_nearest_tie_even( 3953| 3.47k| a, shift, 3954| 3.47k| [truncated](bool is_odd, bool is_halfway, bool is_above) -> bool { 3955| 3.47k| return is_above || (is_halfway && truncated) || 3956| 3.47k| (is_odd && is_halfway); 3957| 3.47k| }); 3958| 3.47k| }); 3959| | 3960| 3.47k| return answer; 3961| 3.47k|} _ZN3glz10fast_float6bigint5pow10Ej: 3591| 3.47k| GLZ_FASTFLOAT_CONSTEXPR20 bool pow10(uint32_t exp) noexcept { 3592| 3.47k| GLZ_FASTFLOAT_TRY(pow5(exp)); ------------------ | | 354| 3.47k| { \ | | 355| 3.47k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 3.47k] | | ------------------ | | 356| 3.47k| return false; \ | | 357| 3.47k| } ------------------ 3593| 3.47k| return pow2(exp); 3594| 3.47k| } _ZN3glz10fast_float6bigint4pow5Ej: 3560| 12.2k| GLZ_FASTFLOAT_CONSTEXPR20 bool pow5(uint32_t exp) noexcept { 3561| | // multiply by a power of 5 3562| 12.2k| size_t large_length = sizeof(large_power_of_5) / sizeof(limb); 3563| 12.2k| limb_span large = limb_span(large_power_of_5, large_length); 3564| 26.2k| while (exp >= large_step) { ------------------ | Branch (3564:12): [True: 14.0k, False: 12.2k] ------------------ 3565| 14.0k| GLZ_FASTFLOAT_TRY(large_mul(vec, large)); ------------------ | | 354| 14.0k| { \ | | 355| 14.0k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 14.0k] | | ------------------ | | 356| 14.0k| return false; \ | | 357| 14.0k| } ------------------ 3566| 14.0k| exp -= large_step; 3567| 14.0k| } 3568| 12.2k|#ifdef GLZ_FASTFLOAT_64BIT_LIMB 3569| 12.2k| uint32_t small_step = 27; 3570| 12.2k| limb max_native = 7450580596923828125UL; 3571| |#else 3572| | uint32_t small_step = 13; 3573| | limb max_native = 1220703125U; 3574| |#endif 3575| 29.5k| while (exp >= small_step) { ------------------ | Branch (3575:12): [True: 17.3k, False: 12.2k] ------------------ 3576| 17.3k| GLZ_FASTFLOAT_TRY(small_mul(vec, max_native)); ------------------ | | 354| 17.3k| { \ | | 355| 17.3k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 17.3k] | | ------------------ | | 356| 17.3k| return false; \ | | 357| 17.3k| } ------------------ 3577| 17.3k| exp -= small_step; 3578| 17.3k| } 3579| 12.2k| if (exp != 0) { ------------------ | Branch (3579:9): [True: 8.56k, False: 3.65k] ------------------ 3580| | // Work around clang bug https://godbolt.org/z/zedh7rrhc 3581| | // This is similar to https://github.com/llvm/llvm-project/issues/47746, 3582| | // except the workaround described there don't work here 3583| 8.56k| GLZ_FASTFLOAT_TRY(small_mul( ------------------ | | 354| 8.56k| { \ | | 355| 8.56k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 8.56k] | | ------------------ | | 356| 8.56k| return false; \ | | 357| 8.56k| } ------------------ 3584| 8.56k| vec, limb(((void)small_power_of_5[0], small_power_of_5[exp])))); 3585| 8.56k| } 3586| | 3587| 12.2k| return true; 3588| 12.2k| } _ZN3glz10fast_float4spanImEC2EPKmm: 436| 96.6k| constexpr span(T const *_ptr, size_t _length) : ptr(_ptr), length(_length) {} _ZN3glz10fast_float9large_mulILt62EEEbRNS0_8stackvecIXT_EEENS0_4spanImEE: 3329| 14.0k|GLZ_FASTFLOAT_CONSTEXPR20 bool large_mul(stackvec &x, limb_span y) noexcept { 3330| 14.0k| if (y.len() == 1) { ------------------ | Branch (3330:7): [True: 0, False: 14.0k] ------------------ 3331| 0| GLZ_FASTFLOAT_TRY(small_mul(x, y[0])); ------------------ | | 354| 0| { \ | | 355| 0| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 0] | | ------------------ | | 356| 0| return false; \ | | 357| 0| } ------------------ 3332| 14.0k| } else { 3333| 14.0k| GLZ_FASTFLOAT_TRY(long_mul(x, y)); ------------------ | | 354| 14.0k| { \ | | 355| 14.0k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 14.0k] | | ------------------ | | 356| 14.0k| return false; \ | | 357| 14.0k| } ------------------ 3334| 14.0k| } 3335| 14.0k| return true; 3336| 14.0k|} _ZNK3glz10fast_float4spanImE3lenEv: 440| 990k| constexpr size_t len() const noexcept { return length; } _ZNK3glz10fast_float4spanImEixEm: 442| 583k| GLZ_FASTFLOAT_CONSTEXPR14 const T &operator[](size_t index) const noexcept { 443| 583k| GLZ_FASTFLOAT_DEBUG_ASSERT(index < length); ------------------ | | 349| 583k| { ((void)(x)); } ------------------ 444| 583k| return ptr[index]; 445| 583k| } _ZN3glz10fast_float8long_mulILt62EEEbRNS0_8stackvecIXT_EEENS0_4spanImEE: 3301| 14.0k|GLZ_FASTFLOAT_CONSTEXPR20 bool long_mul(stackvec &x, limb_span y) noexcept { 3302| 14.0k| limb_span xs = limb_span(x.data, x.len()); 3303| 14.0k| stackvec z(xs); 3304| 14.0k| limb_span zs = limb_span(z.data, z.len()); 3305| | 3306| 14.0k| if (y.len() != 0) { ------------------ | Branch (3306:7): [True: 14.0k, False: 0] ------------------ 3307| 14.0k| limb y0 = y[0]; 3308| 14.0k| GLZ_FASTFLOAT_TRY(small_mul(x, y0)); ------------------ | | 354| 14.0k| { \ | | 355| 14.0k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 14.0k] | | ------------------ | | 356| 14.0k| return false; \ | | 357| 14.0k| } ------------------ 3309| 70.3k| for (size_t index = 1; index < y.len(); index++) { ------------------ | Branch (3309:28): [True: 56.2k, False: 14.0k] ------------------ 3310| 56.2k| limb yi = y[index]; 3311| 56.2k| stackvec zi; 3312| 56.2k| if (yi != 0) { ------------------ | Branch (3312:11): [True: 56.2k, False: 0] ------------------ 3313| | // re-use the same buffer throughout 3314| 56.2k| zi.set_len(0); 3315| 56.2k| GLZ_FASTFLOAT_TRY(zi.try_extend(zs)); ------------------ | | 354| 56.2k| { \ | | 355| 56.2k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 56.2k] | | ------------------ | | 356| 56.2k| return false; \ | | 357| 56.2k| } ------------------ 3316| 56.2k| GLZ_FASTFLOAT_TRY(small_mul(zi, yi)); ------------------ | | 354| 56.2k| { \ | | 355| 56.2k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 56.2k] | | ------------------ | | 356| 56.2k| return false; \ | | 357| 56.2k| } ------------------ 3317| 56.2k| limb_span zis = limb_span(zi.data, zi.len()); 3318| 56.2k| GLZ_FASTFLOAT_TRY(large_add_from(x, zis, index)); ------------------ | | 354| 56.2k| { \ | | 355| 56.2k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 56.2k] | | ------------------ | | 356| 56.2k| return false; \ | | 357| 56.2k| } ------------------ 3319| 56.2k| } 3320| 56.2k| } 3321| 14.0k| } 3322| | 3323| 14.0k| x.normalize(); 3324| 14.0k| return true; 3325| 14.0k|} _ZN3glz10fast_float8stackvecILt62EEC2ENS0_4spanImEE: 3013| 14.0k| GLZ_FASTFLOAT_CONSTEXPR20 stackvec(limb_span s) { 3014| 14.0k| GLZ_FASTFLOAT_ASSERT(try_extend(s)); ------------------ | | 344| 14.0k| { ((void)(x)); } ------------------ 3015| 14.0k| } _ZN3glz10fast_float8stackvecILt62EE7set_lenEm: 3035| 188k| GLZ_FASTFLOAT_CONSTEXPR14 void set_len(size_t len) noexcept { 3036| 188k| length = uint16_t(len); 3037| 188k| } _ZN3glz10fast_float8stackvecILt62EE10try_extendENS0_4spanImEE: 3069| 70.3k| GLZ_FASTFLOAT_CONSTEXPR20 bool try_extend(limb_span s) noexcept { 3070| 70.3k| if (len() + s.len() <= capacity()) { ------------------ | Branch (3070:9): [True: 70.3k, False: 0] ------------------ 3071| 70.3k| extend_unchecked(s); 3072| 70.3k| return true; 3073| 70.3k| } else { 3074| 0| return false; 3075| 0| } 3076| 70.3k| } _ZN3glz10fast_float8stackvecILt62EE16extend_uncheckedENS0_4spanImEE: 3062| 70.3k| GLZ_FASTFLOAT_CONSTEXPR20 void extend_unchecked(limb_span s) noexcept { 3063| 70.3k| limb *ptr = data + length; 3064| 70.3k| std::copy_n(s.ptr, s.len(), ptr); 3065| 70.3k| set_len(len() + s.len()); 3066| 70.3k| } _ZN3glz10fast_float14large_add_fromILt62EEEbRNS0_8stackvecIXT_EEENS0_4spanImEEm: 3264| 56.2k| size_t start) noexcept { 3265| | // the effective x buffer is from `xstart..x.len()`, so exit early 3266| | // if we can't get that current range. 3267| 56.2k| if (x.len() < start || y.len() > x.len() - start) { ------------------ | Branch (3267:7): [True: 0, False: 56.2k] | Branch (3267:26): [True: 55.5k, False: 731] ------------------ 3268| 55.5k| GLZ_FASTFLOAT_TRY(x.try_resize(y.len() + start, 0)); ------------------ | | 354| 55.5k| { \ | | 355| 55.5k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 55.5k] | | ------------------ | | 356| 55.5k| return false; \ | | 357| 55.5k| } ------------------ 3269| 55.5k| } 3270| | 3271| 56.2k| bool carry = false; 3272| 569k| for (size_t index = 0; index < y.len(); index++) { ------------------ | Branch (3272:26): [True: 513k, False: 56.2k] ------------------ 3273| 513k| limb xi = x[index + start]; 3274| 513k| limb yi = y[index]; 3275| 513k| bool c1 = false; 3276| 513k| bool c2 = false; 3277| 513k| xi = scalar_add(xi, yi, c1); 3278| 513k| if (carry) { ------------------ | Branch (3278:9): [True: 204k, False: 308k] ------------------ 3279| 204k| xi = scalar_add(xi, 1, c2); 3280| 204k| } 3281| 513k| x[index + start] = xi; 3282| 513k| carry = c1 | c2; 3283| 513k| } 3284| | 3285| | // handle overflow 3286| 56.2k| if (carry) { ------------------ | Branch (3286:7): [True: 0, False: 56.2k] ------------------ 3287| 0| GLZ_FASTFLOAT_TRY(small_add_from(x, 1, y.len() + start)); ------------------ | | 354| 0| { \ | | 355| 0| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 0] | | ------------------ | | 356| 0| return false; \ | | 357| 0| } ------------------ 3288| 0| } 3289| 56.2k| return true; 3290| 56.2k|} _ZN3glz10fast_float8stackvecILt62EE10try_resizeEmm: 3095| 55.5k| GLZ_FASTFLOAT_CONSTEXPR20 bool try_resize(size_t new_len, limb value) noexcept { 3096| 55.5k| if (new_len > capacity()) { ------------------ | Branch (3096:9): [True: 0, False: 55.5k] ------------------ 3097| 0| return false; 3098| 55.5k| } else { 3099| 55.5k| resize_unchecked(new_len, value); 3100| 55.5k| return true; 3101| 55.5k| } 3102| 55.5k| } _ZN3glz10fast_float8stackvecILt62EE16resize_uncheckedEmm: 3082| 55.5k| void resize_unchecked(size_t new_len, limb value) noexcept { 3083| 55.5k| if (new_len > len()) { ------------------ | Branch (3083:9): [True: 55.5k, False: 0] ------------------ 3084| 55.5k| size_t count = new_len - len(); 3085| 55.5k| limb *first = data + len(); 3086| 55.5k| limb *last = first + count; 3087| 55.5k| ::std::fill(first, last, value); 3088| 55.5k| set_len(new_len); 3089| 55.5k| } else { 3090| 0| set_len(new_len); 3091| 0| } 3092| 55.5k| } _ZN3glz10fast_float8stackvecILt62EE9normalizeEv: 3118| 22.8k| GLZ_FASTFLOAT_CONSTEXPR14 void normalize() noexcept { 3119| 22.8k| while (len() > 0 && rindex(0) == 0) { ------------------ | Branch (3119:12): [True: 22.8k, False: 0] | Branch (3119:25): [True: 0, False: 22.8k] ------------------ 3120| 0| length--; 3121| 0| } 3122| 22.8k| } _ZNK3glz10fast_float8stackvecILt62EE6rindexEm: 3028| 34.0k| GLZ_FASTFLOAT_CONSTEXPR14 const limb &rindex(size_t index) const noexcept { 3029| 34.0k| GLZ_FASTFLOAT_DEBUG_ASSERT(index < length); ------------------ | | 349| 34.0k| { ((void)(x)); } ------------------ 3030| 34.0k| size_t rindex = length - index - 1; 3031| 34.0k| return data[rindex]; 3032| 34.0k| } _ZN3glz10fast_float6bigint4pow2Ej: 3557| 11.9k| GLZ_FASTFLOAT_CONSTEXPR20 bool pow2(uint32_t exp) noexcept { return shl(exp); } _ZN3glz10fast_float6bigint3shlEm: 3519| 11.9k| GLZ_FASTFLOAT_CONSTEXPR20 bool shl(size_t n) noexcept { 3520| 11.9k| size_t rem = n % limb_bits; 3521| 11.9k| size_t div = n / limb_bits; 3522| 11.9k| if (rem != 0) { ------------------ | Branch (3522:9): [True: 9.39k, False: 2.59k] ------------------ 3523| 9.39k| GLZ_FASTFLOAT_TRY(shl_bits(rem)); ------------------ | | 354| 9.39k| { \ | | 355| 9.39k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 9.39k] | | ------------------ | | 356| 9.39k| return false; \ | | 357| 9.39k| } ------------------ 3524| 9.39k| } 3525| 11.9k| if (div != 0) { ------------------ | Branch (3525:9): [True: 5.86k, False: 6.11k] ------------------ 3526| 5.86k| GLZ_FASTFLOAT_TRY(shl_limbs(div)); ------------------ | | 354| 5.86k| { \ | | 355| 5.86k| if (!(x)) \ | | ------------------ | | | Branch (355:9): [True: 0, False: 5.86k] | | ------------------ | | 356| 5.86k| return false; \ | | 357| 5.86k| } ------------------ 3527| 5.86k| } 3528| 11.9k| return true; 3529| 11.9k| } _ZN3glz10fast_float6bigint8shl_bitsEm: 3472| 9.39k| GLZ_FASTFLOAT_CONSTEXPR20 bool shl_bits(size_t n) noexcept { 3473| | // Internally, for each item, we shift left by n, and add the previous 3474| | // right shifted limb-bits. 3475| | // For example, we transform (for u8) shifted left 2, to: 3476| | // b10100100 b01000010 3477| | // b10 b10010001 b00001000 3478| 9.39k| GLZ_FASTFLOAT_DEBUG_ASSERT(n != 0); ------------------ | | 349| 9.39k| { ((void)(x)); } ------------------ 3479| 9.39k| GLZ_FASTFLOAT_DEBUG_ASSERT(n < sizeof(limb) * 8); ------------------ | | 349| 9.39k| { ((void)(x)); } ------------------ 3480| | 3481| 9.39k| size_t shl = n; 3482| 9.39k| size_t shr = limb_bits - shl; 3483| 9.39k| limb prev = 0; 3484| 102k| for (size_t index = 0; index < vec.len(); index++) { ------------------ | Branch (3484:28): [True: 93.0k, False: 9.39k] ------------------ 3485| 93.0k| limb xi = vec[index]; 3486| 93.0k| vec[index] = (xi << shl) | (prev >> shr); 3487| 93.0k| prev = xi; 3488| 93.0k| } 3489| | 3490| 9.39k| limb carry = prev >> shr; 3491| 9.39k| if (carry != 0) { ------------------ | Branch (3491:9): [True: 3.16k, False: 6.23k] ------------------ 3492| 3.16k| return vec.try_push(carry); 3493| 3.16k| } 3494| 6.23k| return true; 3495| 9.39k| } _ZN3glz10fast_float6bigint9shl_limbsEm: 3498| 5.86k| GLZ_FASTFLOAT_CONSTEXPR20 bool shl_limbs(size_t n) noexcept { 3499| 5.86k| GLZ_FASTFLOAT_DEBUG_ASSERT(n != 0); ------------------ | | 349| 5.86k| { ((void)(x)); } ------------------ 3500| 5.86k| if (n + vec.len() > vec.capacity()) { ------------------ | Branch (3500:9): [True: 0, False: 5.86k] ------------------ 3501| 0| return false; 3502| 5.86k| } else if (!vec.is_empty()) { ------------------ | Branch (3502:16): [True: 5.86k, False: 0] ------------------ 3503| | // move limbs 3504| 5.86k| limb *dst = vec.data + n; 3505| 5.86k| limb const *src = vec.data; 3506| 5.86k| std::copy_backward(src, src + vec.len(), dst + vec.len()); 3507| | // fill in empty limbs 3508| 5.86k| limb *first = vec.data; 3509| 5.86k| limb *last = first + n; 3510| 5.86k| ::std::fill(first, last, 0); 3511| 5.86k| vec.set_len(n + vec.len()); 3512| 5.86k| return true; 3513| 5.86k| } else { 3514| 0| return true; 3515| 0| } 3516| 5.86k| } _ZNK3glz10fast_float8stackvecILt62EE8is_emptyEv: 3041| 9.34k| constexpr bool is_empty() const noexcept { return length == 0; } _ZNK3glz10fast_float6bigint4hi64ERb: 3418| 3.47k| GLZ_FASTFLOAT_CONSTEXPR20 uint64_t hi64(bool &truncated) const noexcept { 3419| 3.47k|#ifdef GLZ_FASTFLOAT_64BIT_LIMB 3420| 3.47k| if (vec.len() == 0) { ------------------ | Branch (3420:9): [True: 0, False: 3.47k] ------------------ 3421| 0| return empty_hi64(truncated); 3422| 3.47k| } else if (vec.len() == 1) { ------------------ | Branch (3422:16): [True: 699, False: 2.77k] ------------------ 3423| 699| return uint64_hi64(vec.rindex(0), truncated); 3424| 2.77k| } else { 3425| 2.77k| uint64_t result = uint64_hi64(vec.rindex(0), vec.rindex(1), truncated); 3426| 2.77k| truncated |= vec.nonzero(2); 3427| 2.77k| return result; 3428| 2.77k| } 3429| |#else 3430| | if (vec.len() == 0) { 3431| | return empty_hi64(truncated); 3432| | } else if (vec.len() == 1) { 3433| | return uint32_hi64(vec.rindex(0), truncated); 3434| | } else if (vec.len() == 2) { 3435| | return uint32_hi64(vec.rindex(0), vec.rindex(1), truncated); 3436| | } else { 3437| | uint64_t result = 3438| | uint32_hi64(vec.rindex(0), vec.rindex(1), vec.rindex(2), truncated); 3439| | truncated |= vec.nonzero(3); 3440| | return result; 3441| | } 3442| |#endif 3443| 3.47k| } _ZN3glz10fast_float11uint64_hi64EmRb: 3132| 699|uint64_hi64(uint64_t r0, bool &truncated) noexcept { 3133| 699| truncated = false; 3134| 699| int shl = leading_zeroes(r0); 3135| 699| return r0 << shl; 3136| 699|} _ZN3glz10fast_float11uint64_hi64EmmRb: 3139| 2.77k|uint64_hi64(uint64_t r0, uint64_t r1, bool &truncated) noexcept { 3140| 2.77k| int shl = leading_zeroes(r0); 3141| 2.77k| if (shl == 0) { ------------------ | Branch (3141:7): [True: 296, False: 2.48k] ------------------ 3142| 296| truncated = r1 != 0; 3143| 296| return r0; 3144| 2.48k| } else { 3145| 2.48k| int shr = 64 - shl; 3146| 2.48k| truncated = (r1 << shl) != 0; 3147| 2.48k| return (r0 << shl) | (r1 >> shr); 3148| 2.48k| } 3149| 2.77k|} _ZNK3glz10fast_float8stackvecILt62EE7nonzeroEm: 3107| 2.77k| GLZ_FASTFLOAT_CONSTEXPR14 bool nonzero(size_t index) const noexcept { 3108| 2.79k| while (index < len()) { ------------------ | Branch (3108:12): [True: 1.52k, False: 1.27k] ------------------ 3109| 1.52k| if (rindex(index) != 0) { ------------------ | Branch (3109:11): [True: 1.50k, False: 20] ------------------ 3110| 1.50k| return true; 3111| 1.50k| } 3112| 20| index++; 3113| 20| } 3114| 1.27k| return false; 3115| 2.77k| } _ZNK3glz10fast_float6bigint10bit_lengthEv: 3547| 3.47k| GLZ_FASTFLOAT_CONSTEXPR20 int bit_length() const noexcept { 3548| 3.47k| int lz = ctlz(); 3549| 3.47k| return int(limb_bits * vec.len()) - lz; 3550| 3.47k| } _ZNK3glz10fast_float6bigint4ctlzEv: 3532| 3.47k| GLZ_FASTFLOAT_CONSTEXPR20 int ctlz() const noexcept { 3533| 3.47k| if (vec.is_empty()) { ------------------ | Branch (3533:9): [True: 0, False: 3.47k] ------------------ 3534| 0| return 0; 3535| 3.47k| } else { 3536| 3.47k|#ifdef GLZ_FASTFLOAT_64BIT_LIMB 3537| 3.47k| return leading_zeroes(vec.rindex(0)); 3538| |#else 3539| | // no use defining a specialized leading_zeroes for a 32-bit type. 3540| | uint64_t r0 = vec.rindex(0); 3541| | return leading_zeroes(r0 << 32); 3542| |#endif 3543| 3.47k| } 3544| 3.47k| } _ZN3glz10fast_float5roundIdZNS0_19positive_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintEiEUlRS3_iE_EEvS6_T0_: 3707| 3.47k| callback cb) noexcept { 3708| 3.47k| int32_t mantissa_shift = 64 - binary_format::mantissa_explicit_bits() - 1; 3709| 3.47k| if (-am.power2 >= mantissa_shift) { ------------------ | Branch (3709:7): [True: 0, False: 3.47k] ------------------ 3710| | // have a denormal float 3711| 0| int32_t shift = -am.power2 + 1; 3712| 0| cb(am, (std::min)(shift, 64)); 3713| | // check for round-up: if rounding-nearest carried us to the hidden bit. 3714| 0| am.power2 = (am.mantissa < ------------------ | Branch (3714:17): [True: 0, False: 0] ------------------ 3715| 0| (uint64_t(1) << binary_format::mantissa_explicit_bits())) 3716| 0| ? 0 3717| 0| : 1; 3718| 0| return; 3719| 0| } 3720| | 3721| | // have a normal float, use the default shift. 3722| 3.47k| cb(am, mantissa_shift); 3723| | 3724| | // check for carry 3725| 3.47k| if (am.mantissa >= ------------------ | Branch (3725:7): [True: 194, False: 3.28k] ------------------ 3726| 3.47k| (uint64_t(2) << binary_format::mantissa_explicit_bits())) { 3727| 194| am.mantissa = (uint64_t(1) << binary_format::mantissa_explicit_bits()); 3728| 194| am.power2++; 3729| 194| } 3730| | 3731| | // check for infinite: we could have carried to an infinite power 3732| 3.47k| am.mantissa &= ~(uint64_t(1) << binary_format::mantissa_explicit_bits()); 3733| 3.47k| if (am.power2 >= binary_format::infinite_power()) { ------------------ | Branch (3733:7): [True: 0, False: 3.47k] ------------------ 3734| 0| am.power2 = binary_format::infinite_power(); 3735| 0| am.mantissa = 0; 3736| 0| } 3737| 3.47k|} _ZZN3glz10fast_float19positive_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintEiENKUlRS2_iE_clES5_i: 3951| 3.47k| round(answer, [truncated](adjusted_mantissa &a, int32_t shift) { 3952| 3.47k| round_nearest_tie_even( 3953| 3.47k| a, shift, 3954| 3.47k| [truncated](bool is_odd, bool is_halfway, bool is_above) -> bool { 3955| 3.47k| return is_above || (is_halfway && truncated) || 3956| 3.47k| (is_odd && is_halfway); 3957| 3.47k| }); 3958| 3.47k| }); _ZN3glz10fast_float22round_nearest_tie_evenIZZNS0_19positive_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintEiENKUlRS3_iE_clES6_iEUlbbbE_EEvS6_iT_: 3742| 3.47k| callback cb) noexcept { 3743| 3.47k| uint64_t const mask = (shift == 64) ? UINT64_MAX : (uint64_t(1) << shift) - 1; ------------------ | Branch (3743:25): [True: 0, False: 3.47k] ------------------ 3744| 3.47k| uint64_t const halfway = (shift == 0) ? 0 : uint64_t(1) << (shift - 1); ------------------ | Branch (3744:28): [True: 0, False: 3.47k] ------------------ 3745| 3.47k| uint64_t truncated_bits = am.mantissa & mask; 3746| 3.47k| bool is_above = truncated_bits > halfway; 3747| 3.47k| bool is_halfway = truncated_bits == halfway; 3748| | 3749| | // shift digits into position 3750| 3.47k| if (shift == 64) { ------------------ | Branch (3750:7): [True: 0, False: 3.47k] ------------------ 3751| 0| am.mantissa = 0; 3752| 3.47k| } else { 3753| 3.47k| am.mantissa >>= shift; 3754| 3.47k| } 3755| 3.47k| am.power2 += shift; 3756| | 3757| 3.47k| bool is_odd = (am.mantissa & 1) == 1; 3758| 3.47k| am.mantissa += uint64_t(cb(is_odd, is_halfway, is_above)); 3759| 3.47k|} _ZZZN3glz10fast_float19positive_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintEiENKUlRS2_iE_clES5_iENKUlbbbE_clEbbb: 3954| 3.47k| [truncated](bool is_odd, bool is_halfway, bool is_above) -> bool { 3955| 3.47k| return is_above || (is_halfway && truncated) || ------------------ | Branch (3955:18): [True: 724, False: 2.75k] | Branch (3955:31): [True: 1.80k, False: 947] | Branch (3955:45): [True: 1.01k, False: 795] ------------------ 3956| 1.74k| (is_odd && is_halfway); ------------------ | Branch (3956:19): [True: 1.03k, False: 703] | Branch (3956:29): [True: 481, False: 558] ------------------ 3957| 3.47k| }); _ZN3glz10fast_float19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES2_i: 3970| 8.74k| bigint &bigmant, adjusted_mantissa am, int32_t exponent) noexcept { 3971| 8.74k| bigint &real_digits = bigmant; 3972| 8.74k| int32_t real_exp = exponent; 3973| | 3974| | // get the value of `b`, rounded down, and get a bigint representation of b+h 3975| 8.74k| adjusted_mantissa am_b = am; 3976| | // gcc7 buf: use a lambda to remove the noexcept qualifier bug with 3977| | // -Wnoexcept-type. 3978| 8.74k| round(am_b, 3979| 8.74k| [](adjusted_mantissa &a, int32_t shift) { round_down(a, shift); }); 3980| 8.74k| T b; 3981| 8.74k| to_float(false, am_b, b); 3982| 8.74k| adjusted_mantissa theor = to_extended_halfway(b); 3983| 8.74k| bigint theor_digits(theor.mantissa); 3984| 8.74k| int32_t theor_exp = theor.power2; 3985| | 3986| | // scale real digits and theor digits to be same power. 3987| 8.74k| int32_t pow2_exp = theor_exp - real_exp; 3988| 8.74k| uint32_t pow5_exp = uint32_t(-real_exp); 3989| 8.74k| if (pow5_exp != 0) { ------------------ | Branch (3989:7): [True: 8.74k, False: 0] ------------------ 3990| 8.74k| GLZ_FASTFLOAT_ASSERT(theor_digits.pow5(pow5_exp)); ------------------ | | 344| 8.74k| { ((void)(x)); } ------------------ 3991| 8.74k| } 3992| 8.74k| if (pow2_exp > 0) { ------------------ | Branch (3992:7): [True: 5.49k, False: 3.24k] ------------------ 3993| 5.49k| GLZ_FASTFLOAT_ASSERT(theor_digits.pow2(uint32_t(pow2_exp))); ------------------ | | 344| 5.49k| { ((void)(x)); } ------------------ 3994| 5.49k| } else if (pow2_exp < 0) { ------------------ | Branch (3994:14): [True: 3.01k, False: 235] ------------------ 3995| 3.01k| GLZ_FASTFLOAT_ASSERT(real_digits.pow2(uint32_t(-pow2_exp))); ------------------ | | 344| 3.01k| { ((void)(x)); } ------------------ 3996| 3.01k| } 3997| | 3998| | // compare digits, and use it to director rounding 3999| 8.74k| int ord = real_digits.compare(theor_digits); 4000| 8.74k| adjusted_mantissa answer = am; 4001| 8.74k| round(answer, [ord](adjusted_mantissa &a, int32_t shift) { 4002| 8.74k| round_nearest_tie_even( 4003| 8.74k| a, shift, [ord](bool is_odd, bool _, bool __) -> bool { 4004| 8.74k| (void)_; // not needed, since we've done our comparison 4005| 8.74k| (void)__; // not needed, since we've done our comparison 4006| 8.74k| if (ord > 0) { 4007| 8.74k| return true; 4008| 8.74k| } else if (ord < 0) { 4009| 8.74k| return false; 4010| 8.74k| } else { 4011| 8.74k| return is_odd; 4012| 8.74k| } 4013| 8.74k| }); 4014| 8.74k| }); 4015| | 4016| 8.74k| return answer; 4017| 8.74k|} _ZN3glz10fast_float5roundIdZNS0_19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES3_iEUlRS3_iE_EEvS6_T0_: 3707| 8.74k| callback cb) noexcept { 3708| 8.74k| int32_t mantissa_shift = 64 - binary_format::mantissa_explicit_bits() - 1; 3709| 8.74k| if (-am.power2 >= mantissa_shift) { ------------------ | Branch (3709:7): [True: 603, False: 8.14k] ------------------ 3710| | // have a denormal float 3711| 603| int32_t shift = -am.power2 + 1; 3712| 603| cb(am, (std::min)(shift, 64)); 3713| | // check for round-up: if rounding-nearest carried us to the hidden bit. 3714| 603| am.power2 = (am.mantissa < ------------------ | Branch (3714:17): [True: 603, False: 0] ------------------ 3715| 603| (uint64_t(1) << binary_format::mantissa_explicit_bits())) 3716| 603| ? 0 3717| 603| : 1; 3718| 603| return; 3719| 603| } 3720| | 3721| | // have a normal float, use the default shift. 3722| 8.14k| cb(am, mantissa_shift); 3723| | 3724| | // check for carry 3725| 8.14k| if (am.mantissa >= ------------------ | Branch (3725:7): [True: 0, False: 8.14k] ------------------ 3726| 8.14k| (uint64_t(2) << binary_format::mantissa_explicit_bits())) { 3727| 0| am.mantissa = (uint64_t(1) << binary_format::mantissa_explicit_bits()); 3728| 0| am.power2++; 3729| 0| } 3730| | 3731| | // check for infinite: we could have carried to an infinite power 3732| 8.14k| am.mantissa &= ~(uint64_t(1) << binary_format::mantissa_explicit_bits()); 3733| 8.14k| if (am.power2 >= binary_format::infinite_power()) { ------------------ | Branch (3733:7): [True: 0, False: 8.14k] ------------------ 3734| 0| am.power2 = binary_format::infinite_power(); 3735| 0| am.mantissa = 0; 3736| 0| } 3737| 8.14k|} _ZZN3glz10fast_float19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES2_iENKUlRS2_iE_clES5_i: 3979| 8.74k| [](adjusted_mantissa &a, int32_t shift) { round_down(a, shift); }); _ZN3glz10fast_float10round_downERNS0_17adjusted_mantissaEi: 3762| 8.74k|round_down(adjusted_mantissa &am, int32_t shift) noexcept { 3763| 8.74k| if (shift == 64) { ------------------ | Branch (3763:7): [True: 0, False: 8.74k] ------------------ 3764| 0| am.mantissa = 0; 3765| 8.74k| } else { 3766| 8.74k| am.mantissa >>= shift; 3767| 8.74k| } 3768| 8.74k| am.power2 += shift; 3769| 8.74k|} _ZN3glz10fast_float19to_extended_halfwayIdEENS0_17adjusted_mantissaET_: 3696| 8.74k|to_extended_halfway(T value) noexcept { 3697| 8.74k| adjusted_mantissa am = to_extended(value); 3698| 8.74k| am.mantissa <<= 1; 3699| 8.74k| am.mantissa += 1; 3700| 8.74k| am.power2 -= 1; 3701| 8.74k| return am; 3702| 8.74k|} _ZN3glz10fast_float11to_extendedIdEENS0_17adjusted_mantissaET_: 3661| 8.74k|to_extended(T value) noexcept { 3662| 8.74k| using equiv_uint = equiv_uint_t; 3663| 8.74k| constexpr equiv_uint exponent_mask = binary_format::exponent_mask(); 3664| 8.74k| constexpr equiv_uint mantissa_mask = binary_format::mantissa_mask(); 3665| 8.74k| constexpr equiv_uint hidden_bit_mask = binary_format::hidden_bit_mask(); 3666| | 3667| 8.74k| adjusted_mantissa am; 3668| 8.74k| int32_t bias = binary_format::mantissa_explicit_bits() - 3669| 8.74k| binary_format::minimum_exponent(); 3670| 8.74k| equiv_uint bits; 3671| 8.74k|#if GLZ_FASTFLOAT_HAS_BIT_CAST 3672| 8.74k| bits = std::bit_cast(value); 3673| |#else 3674| | ::memcpy(&bits, &value, sizeof(T)); 3675| |#endif 3676| 8.74k| if ((bits & exponent_mask) == 0) { ------------------ | Branch (3676:7): [True: 603, False: 8.14k] ------------------ 3677| | // denormal 3678| 603| am.power2 = 1 - bias; 3679| 603| am.mantissa = bits & mantissa_mask; 3680| 8.14k| } else { 3681| | // normal 3682| 8.14k| am.power2 = int32_t((bits & exponent_mask) >> 3683| 8.14k| binary_format::mantissa_explicit_bits()); 3684| 8.14k| am.power2 -= bias; 3685| 8.14k| am.mantissa = (bits & mantissa_mask) | hidden_bit_mask; 3686| 8.14k| } 3687| | 3688| 8.74k| return am; 3689| 8.74k|} _ZN3glz10fast_float6bigintC2Em: 3406| 8.74k| GLZ_FASTFLOAT_CONSTEXPR20 bigint(uint64_t value) : vec() { 3407| 8.74k|#ifdef GLZ_FASTFLOAT_64BIT_LIMB 3408| 8.74k| vec.push_unchecked(value); 3409| |#else 3410| | vec.push_unchecked(uint32_t(value)); 3411| | vec.push_unchecked(uint32_t(value >> 32)); 3412| |#endif 3413| 8.74k| vec.normalize(); 3414| 8.74k| } _ZNK3glz10fast_float6bigint7compareERKS1_: 3451| 8.74k| GLZ_FASTFLOAT_CONSTEXPR20 int compare(bigint const &other) const noexcept { 3452| 8.74k| if (vec.len() > other.vec.len()) { ------------------ | Branch (3452:9): [True: 0, False: 8.74k] ------------------ 3453| 0| return 1; 3454| 8.74k| } else if (vec.len() < other.vec.len()) { ------------------ | Branch (3454:16): [True: 0, False: 8.74k] ------------------ 3455| 0| return -1; 3456| 8.74k| } else { 3457| 17.8k| for (size_t index = vec.len(); index > 0; index--) { ------------------ | Branch (3457:38): [True: 17.2k, False: 665] ------------------ 3458| 17.2k| limb xi = vec[index - 1]; 3459| 17.2k| limb yi = other.vec[index - 1]; 3460| 17.2k| if (xi > yi) { ------------------ | Branch (3460:13): [True: 3.96k, False: 13.2k] ------------------ 3461| 3.96k| return 1; 3462| 13.2k| } else if (xi < yi) { ------------------ | Branch (3462:20): [True: 4.10k, False: 9.14k] ------------------ 3463| 4.10k| return -1; 3464| 4.10k| } 3465| 17.2k| } 3466| 665| return 0; 3467| 8.74k| } 3468| 8.74k| } _ZNK3glz10fast_float8stackvecILt62EEixEm: 3022| 34.4k| GLZ_FASTFLOAT_CONSTEXPR14 const limb &operator[](size_t index) const noexcept { 3023| 34.4k| GLZ_FASTFLOAT_DEBUG_ASSERT(index < length); ------------------ | | 349| 34.4k| { ((void)(x)); } ------------------ 3024| 34.4k| return data[index]; 3025| 34.4k| } _ZN3glz10fast_float5roundIdZNS0_19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES3_iEUlRS3_iE0_EEvS6_T0_: 3707| 8.74k| callback cb) noexcept { 3708| 8.74k| int32_t mantissa_shift = 64 - binary_format::mantissa_explicit_bits() - 1; 3709| 8.74k| if (-am.power2 >= mantissa_shift) { ------------------ | Branch (3709:7): [True: 603, False: 8.14k] ------------------ 3710| | // have a denormal float 3711| 603| int32_t shift = -am.power2 + 1; 3712| 603| cb(am, (std::min)(shift, 64)); 3713| | // check for round-up: if rounding-nearest carried us to the hidden bit. 3714| 603| am.power2 = (am.mantissa < ------------------ | Branch (3714:17): [True: 603, False: 0] ------------------ 3715| 603| (uint64_t(1) << binary_format::mantissa_explicit_bits())) 3716| 603| ? 0 3717| 603| : 1; 3718| 603| return; 3719| 603| } 3720| | 3721| | // have a normal float, use the default shift. 3722| 8.14k| cb(am, mantissa_shift); 3723| | 3724| | // check for carry 3725| 8.14k| if (am.mantissa >= ------------------ | Branch (3725:7): [True: 213, False: 7.92k] ------------------ 3726| 8.14k| (uint64_t(2) << binary_format::mantissa_explicit_bits())) { 3727| 213| am.mantissa = (uint64_t(1) << binary_format::mantissa_explicit_bits()); 3728| 213| am.power2++; 3729| 213| } 3730| | 3731| | // check for infinite: we could have carried to an infinite power 3732| 8.14k| am.mantissa &= ~(uint64_t(1) << binary_format::mantissa_explicit_bits()); 3733| 8.14k| if (am.power2 >= binary_format::infinite_power()) { ------------------ | Branch (3733:7): [True: 0, False: 8.14k] ------------------ 3734| 0| am.power2 = binary_format::infinite_power(); 3735| 0| am.mantissa = 0; 3736| 0| } 3737| 8.14k|} _ZZN3glz10fast_float19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES2_iENKUlRS2_iE0_clES5_i: 4001| 8.74k| round(answer, [ord](adjusted_mantissa &a, int32_t shift) { 4002| 8.74k| round_nearest_tie_even( 4003| 8.74k| a, shift, [ord](bool is_odd, bool _, bool __) -> bool { 4004| 8.74k| (void)_; // not needed, since we've done our comparison 4005| 8.74k| (void)__; // not needed, since we've done our comparison 4006| 8.74k| if (ord > 0) { 4007| 8.74k| return true; 4008| 8.74k| } else if (ord < 0) { 4009| 8.74k| return false; 4010| 8.74k| } else { 4011| 8.74k| return is_odd; 4012| 8.74k| } 4013| 8.74k| }); 4014| 8.74k| }); _ZN3glz10fast_float22round_nearest_tie_evenIZZNS0_19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES3_iENKUlRS3_iE0_clES6_iEUlbbbE_EEvS6_iT_: 3742| 8.74k| callback cb) noexcept { 3743| 8.74k| uint64_t const mask = (shift == 64) ? UINT64_MAX : (uint64_t(1) << shift) - 1; ------------------ | Branch (3743:25): [True: 0, False: 8.74k] ------------------ 3744| 8.74k| uint64_t const halfway = (shift == 0) ? 0 : uint64_t(1) << (shift - 1); ------------------ | Branch (3744:28): [True: 0, False: 8.74k] ------------------ 3745| 8.74k| uint64_t truncated_bits = am.mantissa & mask; 3746| 8.74k| bool is_above = truncated_bits > halfway; 3747| 8.74k| bool is_halfway = truncated_bits == halfway; 3748| | 3749| | // shift digits into position 3750| 8.74k| if (shift == 64) { ------------------ | Branch (3750:7): [True: 0, False: 8.74k] ------------------ 3751| 0| am.mantissa = 0; 3752| 8.74k| } else { 3753| 8.74k| am.mantissa >>= shift; 3754| 8.74k| } 3755| 8.74k| am.power2 += shift; 3756| | 3757| 8.74k| bool is_odd = (am.mantissa & 1) == 1; 3758| 8.74k| am.mantissa += uint64_t(cb(is_odd, is_halfway, is_above)); 3759| 8.74k|} _ZZZN3glz10fast_float19negative_digit_compIdEENS0_17adjusted_mantissaERNS0_6bigintES2_iENKUlRS2_iE0_clES5_iENKUlbbbE_clEbbb: 4003| 8.74k| a, shift, [ord](bool is_odd, bool _, bool __) -> bool { 4004| 8.74k| (void)_; // not needed, since we've done our comparison 4005| 8.74k| (void)__; // not needed, since we've done our comparison 4006| 8.74k| if (ord > 0) { ------------------ | Branch (4006:15): [True: 3.96k, False: 4.77k] ------------------ 4007| 3.96k| return true; 4008| 4.77k| } else if (ord < 0) { ------------------ | Branch (4008:22): [True: 4.10k, False: 665] ------------------ 4009| 4.10k| return false; 4010| 4.10k| } else { 4011| 665| return is_odd; 4012| 665| } 4013| 8.74k| }); _ZN3glz10fast_float8to_floatIdEEvbNS0_17adjusted_mantissaERT_: 1131| 30.9k|to_float(bool negative, adjusted_mantissa am, T &value) { 1132| 30.9k| using equiv_uint = equiv_uint_t; 1133| 30.9k| equiv_uint word = equiv_uint(am.mantissa); 1134| 30.9k| word = equiv_uint(word | equiv_uint(am.power2) 1135| 30.9k| << binary_format::mantissa_explicit_bits()); 1136| 30.9k| word = 1137| 30.9k| equiv_uint(word | equiv_uint(negative) << binary_format::sign_index()); 1138| 30.9k|#if GLZ_FASTFLOAT_HAS_BIT_CAST 1139| 30.9k| value = std::bit_cast(word); 1140| |#else 1141| | ::memcpy(&value, &word, sizeof(T)); 1142| |#endif 1143| 30.9k|} _ZN3glz10fast_float13binary_formatIdE10sign_indexEv: 758| 30.9k|template <> inline constexpr int binary_format::sign_index() { 759| 30.9k| return 63; 760| 30.9k|} _ZN3glz10fast_float13binary_formatIdE14infinite_powerEv: 750| 79.4k|template <> inline constexpr int binary_format::infinite_power() { 751| 79.4k| return 0x7FF; 752| 79.4k|} repe_registry.cpp:_ZN3glz8for_eachILm5EZNS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS5_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_EUlTnDavE_EEvOS9_: 27| 345k| { 28| 345k| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| | else if constexpr (N == 2) { 35| | lambda.template operator()<0>(); 36| | lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| 345k| else { 50| 345k| [&](std::index_sequence) { 51| 345k| (void)(lambda.template operator()(), ...); 52| 345k| }(std::make_index_sequence{}); 53| 345k| } 54| 345k| } 55| 345k| } repe_registry.cpp:_ZZN3glz8for_eachILm5EZNS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz10member_apiEL_ZNS5_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_EUlTnDavE_EEvOS9_ENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4EEEEDaSF_: 50| 345k| [&](std::index_sequence) { 51| 345k| (void)(lambda.template operator()(), ...); 52| 345k| }(std::make_index_sequence{}); _ZN3glz8for_eachILm2EZNS_2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEES3_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_EUlTnmvE_EEvSK_: 27| 136| { 28| 136| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| 136| else if constexpr (N == 2) { 35| 136| lambda.template operator()<0>(); 36| 136| lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| | else { 50| | [&](std::index_sequence) { 51| | (void)(lambda.template operator()(), ...); 52| | }(std::make_index_sequence{}); 53| | } 54| 136| } 55| 136| } _ZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_m: 86| 43.7k| { 87| 43.7k| if constexpr (N > 0) { 88| 43.7k| assert(index < N && "glz::visit index out of range"); ------------------ | Branch (88:10): [True: 43.7k, False: 0] | Branch (88:10): [True: 43.7k, Folded] | Branch (88:10): [True: 43.7k, False: 0] ------------------ 89| | // Explicit sizes for small N to help the compiler and make debugging easier 90| | if constexpr (N == 1) { 91| | (void)index; 92| | (void)(lambda.template operator()<0>()); 93| | } 94| | else if constexpr (N == 2) { 95| | switch (index) { 96| | case 0: 97| | lambda.template operator()<0>(); 98| | break; 99| | case 1: 100| | lambda.template operator()<1>(); 101| | break; 102| | default: 103| | std::unreachable(); 104| | } 105| | } 106| | else if constexpr (N == 3) { 107| | switch (index) { 108| | case 0: 109| | lambda.template operator()<0>(); 110| | break; 111| | case 1: 112| | lambda.template operator()<1>(); 113| | break; 114| | case 2: 115| | lambda.template operator()<2>(); 116| | break; 117| | default: 118| | std::unreachable(); 119| | } 120| | } 121| | else if constexpr (N == 4) { 122| | switch (index) { 123| | case 0: 124| | lambda.template operator()<0>(); 125| | break; 126| | case 1: 127| | lambda.template operator()<1>(); 128| | break; 129| | case 2: 130| | lambda.template operator()<2>(); 131| | break; 132| | case 3: 133| | lambda.template operator()<3>(); 134| | break; 135| | default: 136| | std::unreachable(); 137| | } 138| | } 139| | else if constexpr (N == 5) { 140| | switch (index) { 141| | case 0: 142| | lambda.template operator()<0>(); 143| | break; 144| | case 1: 145| | lambda.template operator()<1>(); 146| | break; 147| | case 2: 148| | lambda.template operator()<2>(); 149| | break; 150| | case 3: 151| | lambda.template operator()<3>(); 152| | break; 153| | case 4: 154| | lambda.template operator()<4>(); 155| | break; 156| | default: 157| | std::unreachable(); 158| | } 159| | } 160| | else if constexpr (N == 6) { 161| | switch (index) { 162| | case 0: 163| | lambda.template operator()<0>(); 164| | break; 165| | case 1: 166| | lambda.template operator()<1>(); 167| | break; 168| | case 2: 169| | lambda.template operator()<2>(); 170| | break; 171| | case 3: 172| | lambda.template operator()<3>(); 173| | break; 174| | case 4: 175| | lambda.template operator()<4>(); 176| | break; 177| | case 5: 178| | lambda.template operator()<5>(); 179| | break; 180| | default: 181| | std::unreachable(); 182| | } 183| | } 184| | else if constexpr (N == 7) { 185| | switch (index) { 186| | case 0: 187| | lambda.template operator()<0>(); 188| | break; 189| | case 1: 190| | lambda.template operator()<1>(); 191| | break; 192| | case 2: 193| | lambda.template operator()<2>(); 194| | break; 195| | case 3: 196| | lambda.template operator()<3>(); 197| | break; 198| | case 4: 199| | lambda.template operator()<4>(); 200| | break; 201| | case 5: 202| | lambda.template operator()<5>(); 203| | break; 204| | case 6: 205| | lambda.template operator()<6>(); 206| | break; 207| | default: 208| | std::unreachable(); 209| | } 210| | } 211| | else if constexpr (N == 8) { 212| | switch (index) { 213| | case 0: 214| | lambda.template operator()<0>(); 215| | break; 216| | case 1: 217| | lambda.template operator()<1>(); 218| | break; 219| | case 2: 220| | lambda.template operator()<2>(); 221| | break; 222| | case 3: 223| | lambda.template operator()<3>(); 224| | break; 225| | case 4: 226| | lambda.template operator()<4>(); 227| | break; 228| | case 5: 229| | lambda.template operator()<5>(); 230| | break; 231| | case 6: 232| | lambda.template operator()<6>(); 233| | break; 234| | case 7: 235| | lambda.template operator()<7>(); 236| | break; 237| | default: 238| | std::unreachable(); 239| | } 240| | } 241| | else if constexpr (N == 9) { 242| | switch (index) { 243| | case 0: 244| | lambda.template operator()<0>(); 245| | break; 246| | case 1: 247| | lambda.template operator()<1>(); 248| | break; 249| | case 2: 250| | lambda.template operator()<2>(); 251| | break; 252| | case 3: 253| | lambda.template operator()<3>(); 254| | break; 255| | case 4: 256| | lambda.template operator()<4>(); 257| | break; 258| | case 5: 259| | lambda.template operator()<5>(); 260| | break; 261| | case 6: 262| | lambda.template operator()<6>(); 263| | break; 264| | case 7: 265| | lambda.template operator()<7>(); 266| | break; 267| | case 8: 268| | lambda.template operator()<8>(); 269| | break; 270| | default: 271| | std::unreachable(); 272| | } 273| | } 274| | else if constexpr (N == 10) { 275| | switch (index) { 276| | case 0: 277| | lambda.template operator()<0>(); 278| | break; 279| | case 1: 280| | lambda.template operator()<1>(); 281| | break; 282| | case 2: 283| | lambda.template operator()<2>(); 284| | break; 285| | case 3: 286| | lambda.template operator()<3>(); 287| | break; 288| | case 4: 289| | lambda.template operator()<4>(); 290| | break; 291| | case 5: 292| | lambda.template operator()<5>(); 293| | break; 294| | case 6: 295| | lambda.template operator()<6>(); 296| | break; 297| | case 7: 298| | lambda.template operator()<7>(); 299| | break; 300| | case 8: 301| | lambda.template operator()<8>(); 302| | break; 303| | case 9: 304| | lambda.template operator()<9>(); 305| | break; 306| | default: 307| | std::unreachable(); 308| | } 309| | } 310| 43.7k| else { 311| |#ifdef _MSC_VER 312| | using Lambda = std::decay_t; 313| | static const auto jump_table = [](std::index_sequence) { 314| | return std::array{make_jump_function()...}; 315| | }(std::make_index_sequence{}); 316| |#else 317| 43.7k| static constexpr auto jump_table = [](std::index_sequence) { 318| 43.7k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; 319| 43.7k| }(std::make_index_sequence{}); 320| 43.7k|#endif 321| | 322| 43.7k|#if defined(__clang_major__) && (__clang_major__ >= 19) 323| 43.7k| [[assume(index < N)]]; 324| 43.7k|#endif 325| 43.7k| jump_table[index](lambda); 326| | 327| | // This code runs significantly slower on Clang 328| | // Simple tests with assembly show that this should be faster, 329| | // but full Glaze assembly need to be looked into 330| | /*[&, index](std::index_sequence) { 331| | (void)((index == I ? lambda.template operator()() : void()), ...); 332| | }(std::make_index_sequence{});*/ 333| 43.7k| } 334| 43.7k| } 335| 43.7k| } _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E_clESU_: 318| 22.0k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E0_clESU_: 318| 518| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E1_clESU_: 318| 1.11k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E2_clESU_: 318| 1.16k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E3_clESU_: 318| 8.36k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E4_clESU_: 318| 1.79k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E5_clESU_: 318| 1.63k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E6_clESU_: 318| 4.88k| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZN3glz8for_eachILm2EZNS_28process_variant_alternativesINSt3__17variantIJNS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEN9repe_fuzz6amountEEEENS_14is_variant_strEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERSC_TkNS_10is_contextERNS_7contextERPKcSL_EEvOT0_OT1_OT2_T3_EUlTnmvE_EEvSO_: 27| 3.21k| { 28| 3.21k| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| 3.21k| else if constexpr (N == 2) { 35| 3.21k| lambda.template operator()<0>(); 36| 3.21k| lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| | else { 50| | [&](std::index_sequence) { 51| | (void)(lambda.template operator()(), ...); 52| | }(std::make_index_sequence{}); 53| | } 54| 3.21k| } 55| 3.21k| } _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E7_clESU_: 318| 482| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E8_clESU_: 318| 358| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E9_clESU_: 318| 591| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E10_clESU_: 318| 510| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZZZN3glz5visitILm13EZNS_16parse_and_invokeITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEEN9repe_fuzz8fuzz_apiERS4_JETkNS_10is_contextERNS_7contextERPKcSA_Qoo14glaze_object_tIT0_E11reflectableISB_EEEvOT1_OT3_OT4_OT5_DpOT2_EUlTnmvE_EEvOSB_mENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSR_ENKUlRSN_E11_clESU_: 318| 320| return std::array{+[](std::decay_t& l) { l.template operator()(); }...}; _ZN3glz8for_eachILm13EZNS_2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS3_RNSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_EUlTnmvE_EEvSL_: 27| 76| { 28| 76| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| | else if constexpr (N == 2) { 35| | lambda.template operator()<0>(); 36| | lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| 76| else { 50| 76| [&](std::index_sequence) { 51| 76| (void)(lambda.template operator()(), ...); 52| 76| }(std::make_index_sequence{}); 53| 76| } 54| 76| } 55| 76| } _ZZN3glz8for_eachILm13EZNS_2toILj10EN9repe_fuzz8fuzz_apiEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS3_RNSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_EUlTnmvE_EEvSL_ENKUlTpTnmNS8_16integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSU_: 50| 76| [&](std::index_sequence) { 51| 76| (void)(lambda.template operator()(), ...); 52| 76| }(std::make_index_sequence{}); _ZN3glz8for_eachILm2EZNS_2toILj10EN9repe_fuzz5pointEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS3_RNSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_EUlTnmvE_EEvSL_: 27| 211| { 28| 211| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| 211| else if constexpr (N == 2) { 35| 211| lambda.template operator()<0>(); 36| 211| lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| | else { 50| | [&](std::index_sequence) { 51| | (void)(lambda.template operator()(), ...); 52| | }(std::make_index_sequence{}); 53| | } 54| 211| } 55| 211| } _ZN3glz8for_eachILm2EZNS_2toILj10EN9repe_fuzz6nestedEE2opITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEERS3_RNSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEETkNS_10is_contextERNS_7contextEmQntsr3stdE12is_pointer_vIu14__remove_cvrefITL0_0_EEEEvOT0_OT2_OT1_RT3_EUlTnmvE_EEvSL_: 27| 150| { 28| 150| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| 150| else if constexpr (N == 2) { 35| 150| lambda.template operator()<0>(); 36| 150| lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| | else { 50| | [&](std::index_sequence) { 51| | (void)(lambda.template operator()(), ...); 52| | }(std::make_index_sequence{}); 53| | } 54| 150| } 55| 150| } repe_registry.cpp:_ZN3glz8for_eachILm13EZNS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS5_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_EUlTnDavE_EEvOS9_: 27| 360k| { 28| 360k| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| | else if constexpr (N == 2) { 35| | lambda.template operator()<0>(); 36| | lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| 360k| else { 50| 360k| [&](std::index_sequence) { 51| 360k| (void)(lambda.template operator()(), ...); 52| 360k| }(std::make_index_sequence{}); 53| 360k| } 54| 360k| } 55| 360k| } repe_registry.cpp:_ZZN3glz8for_eachILm13EZNS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz8fuzz_apiEL_ZNS5_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS8_EEEvRT0_EUlTnDavE_EEvOS9_ENKUlTpTnmNSt3__116integer_sequenceImJXspT_EEEEE_clIJLm0ELm1ELm2ELm3ELm4ELm5ELm6ELm7ELm8ELm9ELm10ELm11ELm12EEEEDaSF_: 50| 360k| [&](std::index_sequence) { 51| 360k| (void)(lambda.template operator()(), ...); 52| 360k| }(std::make_index_sequence{}); repe_registry.cpp:_ZN3glz8for_eachILm2EZNS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz5pointEL_ZZZNS4_IL_ZNS5_L10empty_pathEENS6_8fuzz_apiEL_ZNS5_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS9_EEEvRT0_ENKUlTnDavE_clILm2EEEDavE8full_keyEQoo14glaze_object_tIS9_E11reflectableIS9_EEEvSB_EUlTnDavE_EEvOSA_: 27| 360k| { 28| 360k| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| 360k| else if constexpr (N == 2) { 35| 360k| lambda.template operator()<0>(); 36| 360k| lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| | else { 50| | [&](std::index_sequence) { 51| | (void)(lambda.template operator()(), ...); 52| | }(std::make_index_sequence{}); 53| | } 54| 360k| } 55| 360k| } repe_registry.cpp:_ZN3glz8for_eachILm2EZNS_8registryIXtlNS_4optsELj10ELb1ELb0ELb1ELb1EEELj30000EE16register_membersIL_ZNS_6detailL10empty_pathEEN9repe_fuzz6nestedEL_ZZZNS4_IL_ZNS5_L10empty_pathEENS6_8fuzz_apiEL_ZNS5_L10empty_pathEEQoo14glaze_object_tITL0_0_E11reflectableIS9_EEEvRT0_ENKUlTnDavE_clILm3EEEDavE8full_keyEQoo14glaze_object_tIS9_E11reflectableIS9_EEEvSB_EUlTnDavE_EEvOSA_: 27| 360k| { 28| 360k| if constexpr (N > 0) { 29| | // Explicit sizes for small N to help the compiler and make debugging easier 30| | // These generate less assembly with O0, but make no difference for higher optimization 31| | if constexpr (N == 1) { 32| | lambda.template operator()<0>(); 33| | } 34| 360k| else if constexpr (N == 2) { 35| 360k| lambda.template operator()<0>(); 36| 360k| lambda.template operator()<1>(); 37| | } 38| | else if constexpr (N == 3) { 39| | lambda.template operator()<0>(); 40| | lambda.template operator()<1>(); 41| | lambda.template operator()<2>(); 42| | } 43| | else if constexpr (N == 4) { 44| | lambda.template operator()<0>(); 45| | lambda.template operator()<1>(); 46| | lambda.template operator()<2>(); 47| | lambda.template operator()<3>(); 48| | } 49| | else { 50| | [&](std::index_sequence) { 51| | (void)(lambda.template operator()(), ...); 52| | }(std::make_index_sequence{}); 53| | } 54| 360k| } 55| 360k| } _ZN3glz10from_charsILb0EdcEENS_10fast_float19from_chars_result_tIT1_EEPKS3_S6_RT0_: 235| 257k| { 236| 257k| using namespace glz::fast_float; 237| 257k| static_assert(is_supported_float_type(), "only some floating-point types are supported"); 238| 257k| static_assert(is_supported_char_type(), "only char, wchar_t, char16_t and char32_t are supported"); 239| | 240| 257k| parsed_number_string_t pns = glz::parse_number_string(first, last); 241| 257k| if (!pns.valid) [[unlikely]] { ------------------ | Branch (241:11): [True: 25.8k, False: 231k] ------------------ 242| 25.8k| return {.ptr = first, .ec = std::errc::invalid_argument}; 243| 25.8k| } 244| | 245| 231k| return from_chars_advanced(pns, value); 246| 257k| } _ZN3glz19parse_number_stringILb0EcEENS_10fast_float22parsed_number_string_tIT0_EEPKS3_S6_: 18| 257k| { 19| 257k| using namespace glz::fast_float; 20| 257k| static constexpr UC decimal_point = '.'; 21| | 22| 257k| parsed_number_string_t answer; 23| 257k| answer.valid = false; 24| 257k| answer.too_many_digits = false; 25| 257k| answer.negative = (*p == UC('-')); 26| 257k| if (*p == UC('-')) { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here ------------------ | Branch (26:11): [True: 5.74k, False: 251k] ------------------ 27| 5.74k| ++p; 28| | 29| 5.74k| if constexpr (not null_terminated) { 30| 5.74k| if (p == pend) [[unlikely]] { ------------------ | Branch (30:17): [True: 16, False: 5.72k] ------------------ 31| 16| return answer; 32| 16| } 33| 5.74k| } 34| | 35| 5.74k| if (!glz::fast_float::is_integer(*p)) [[unlikely]] { // a sign must be followed by an integer ------------------ | Branch (35:14): [True: 39, False: 5.70k] ------------------ 36| 39| return answer; 37| 39| } 38| 5.74k| } 39| 257k| UC const* const start_digits = p; 40| | 41| 257k| uint64_t i = 0; // an unsigned int avoids signed overflows (which are bad) 42| | 43| 257k| uint64_t digit; 44| | if constexpr (null_terminated) { 45| | while ((digit = glz::fast_float::digit_value(*p)) <= 9) { 46| | // a multiplication by 10 is cheaper than an arbitrary integer 47| | // multiplication 48| | i = 10 * i + digit; // might overflow, we will handle the overflow later 49| | ++p; 50| | } 51| | } 52| 257k| else { 53| 8.64M| while ((p != pend) && (digit = glz::fast_float::digit_value(*p)) <= 9) { ------------------ | Branch (53:17): [True: 8.64M, False: 1.98k] | Branch (53:32): [True: 8.38M, False: 255k] ------------------ 54| | // a multiplication by 10 is cheaper than an arbitrary integer 55| | // multiplication 56| 8.38M| i = 10 * i + digit; // might overflow, we will handle the overflow later 57| 8.38M| ++p; 58| 8.38M| } 59| 257k| } 60| | 61| 257k| UC const* const end_of_integer_part = p; 62| 257k| int64_t digit_count = int64_t(end_of_integer_part - start_digits); 63| 257k| answer.integer = glz::fast_float::span(start_digits, size_t(digit_count)); 64| | 65| | // at least 1 digit in integer part, without leading zeros 66| 257k| if (digit_count == 0 || (start_digits[0] == UC('0') && digit_count > 1)) { ------------------ | Branch (66:11): [True: 25.5k, False: 231k] | Branch (66:32): [True: 12.5k, False: 219k] | Branch (66:62): [True: 37, False: 12.4k] ------------------ 67| 25.5k| return answer; 68| 25.5k| } 69| | 70| 231k| int64_t exponent = 0; 71| 231k| const bool has_decimal_point = [&] { 72| 231k| if constexpr (null_terminated) { 73| 231k| return (*p == decimal_point); 74| 231k| } 75| 231k| else { 76| 231k| return (p != pend) && (*p == decimal_point); 77| 231k| } 78| 231k| }(); 79| 231k| if (has_decimal_point) { ------------------ | Branch (79:11): [True: 14.5k, False: 217k] ------------------ 80| 14.5k| ++p; 81| 14.5k| UC const* before = p; 82| | // can occur at most twice without overflowing, but let it occur more, since 83| | // for integers with many digits, digit parsing is the primary bottleneck. 84| 14.5k| loop_parse_if_eight_digits(p, pend, i); 85| | 86| | if constexpr (null_terminated) { 87| | while ((digit = glz::fast_float::digit_value(*p)) <= 9) { 88| | ++p; 89| | i = i * 10 + digit; // in rare cases, this will overflow, but that's ok 90| | } 91| | } 92| 14.5k| else { 93| 66.4k| while ((p != pend) && (digit = glz::fast_float::digit_value(*p)) <= 9) { ------------------ | Branch (93:20): [True: 64.7k, False: 1.72k] | Branch (93:35): [True: 51.9k, False: 12.8k] ------------------ 94| 51.9k| ++p; 95| 51.9k| i = i * 10 + digit; // in rare cases, this will overflow, but that's ok 96| 51.9k| } 97| 14.5k| } 98| 14.5k| exponent = before - p; 99| 14.5k| answer.fraction = glz::fast_float::span(before, size_t(p - before)); 100| 14.5k| digit_count -= exponent; 101| 14.5k| } 102| | // at least 1 digit in fractional part 103| 231k| if (has_decimal_point && exponent == 0) { ------------------ | Branch (103:11): [True: 14.5k, False: 217k] | Branch (103:32): [True: 59, False: 14.4k] ------------------ 104| 59| return answer; 105| 59| } 106| | 107| 231k| int64_t exp_number = 0; // explicit exponential part 108| | 109| | // An exponent marker must be followed by at least one digit, after an optional sign. Unlike 110| | // std::from_chars, which ends the number before a digitless marker, "1e", "1e+" and "1.0E-" are 111| | // rejected: ending early would read "1.0e" as 1 wherever trailing content goes unchecked. 112| | if constexpr (null_terminated) { 113| | if ((UC('e') == *p) || (UC('E') == *p)) { 114| | ++p; 115| | bool neg_exp = false; 116| | if (UC('-') == *p) { 117| | neg_exp = true; 118| | ++p; 119| | } 120| | else if (UC('+') == *p) { // '+' on exponent is allowed by C++17 20.19.3.(7.1) 121| | ++p; 122| | } 123| | if ((digit = glz::fast_float::digit_value(*p)) > 9) [[unlikely]] { 124| | return answer; 125| | } 126| | else { 127| | do { 128| | if (exp_number < 0x10000000) { 129| | exp_number = 10 * exp_number + digit; 130| | } 131| | ++p; 132| | } while ((digit = glz::fast_float::digit_value(*p)) <= 9); 133| | if (neg_exp) { 134| | exp_number = -exp_number; 135| | } 136| | exponent += exp_number; 137| | } 138| | } 139| | } 140| 231k| else { 141| 231k| if ((p != pend) && ((UC('e') == *p) || (UC('E') == *p))) { ------------------ | Branch (141:14): [True: 227k, False: 3.66k] | Branch (141:30): [True: 9.06k, False: 218k] | Branch (141:49): [True: 6.65k, False: 212k] ------------------ 142| 15.7k| ++p; 143| 15.7k| bool neg_exp = false; 144| 15.7k| if ((p != pend) && (UC('-') == *p)) { ------------------ | Branch (144:17): [True: 15.6k, False: 93] | Branch (144:32): [True: 1.27k, False: 14.3k] ------------------ 145| 1.27k| neg_exp = true; 146| 1.27k| ++p; 147| 1.27k| } 148| 14.4k| else if ((p != pend) && (UC('+') == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1) ------------------ | Branch (148:22): [True: 14.3k, False: 93] | Branch (148:37): [True: 197, False: 14.1k] ------------------ 149| 197| ++p; 150| 197| } 151| 15.7k| if ((p == pend) || (digit = glz::fast_float::digit_value(*p)) > 9) [[unlikely]] { ------------------ | Branch (151:17): [True: 112, False: 15.6k] | Branch (151:32): [True: 72, False: 15.5k] ------------------ 152| 184| return answer; 153| 184| } 154| 15.5k| else { 155| 38.4k| do { 156| 38.4k| if (exp_number < 0x10000000) { ------------------ | Branch (156:23): [True: 37.8k, False: 539] ------------------ 157| 37.8k| exp_number = 10 * exp_number + digit; 158| 37.8k| } 159| 38.4k| ++p; 160| 38.4k| } while ((p != pend) && (digit = glz::fast_float::digit_value(*p)) <= 9); ------------------ | Branch (160:25): [True: 36.5k, False: 1.89k] | Branch (160:40): [True: 22.8k, False: 13.6k] ------------------ 161| 15.5k| if (neg_exp) { ------------------ | Branch (161:20): [True: 1.26k, False: 14.2k] ------------------ 162| 1.26k| exp_number = -exp_number; 163| 1.26k| } 164| 15.5k| exponent += exp_number; 165| 15.5k| } 166| 15.7k| } 167| 231k| } 168| | 169| 231k| answer.lastmatch = p; 170| 231k| answer.valid = true; 171| | 172| | // If we frequently had to deal with long strings of digits, 173| | // we could extend our code by using a 128-bit integer instead 174| | // of a 64-bit integer. However, this is uncommon. 175| | // 176| | // We can deal with up to 19 digits. 177| 231k| if (digit_count > 19) { // this is uncommon ------------------ | Branch (177:11): [True: 19.0k, False: 212k] ------------------ 178| | // It is possible that the integer had an overflow. 179| | // We have to handle the case where we have 0.0000somenumber. 180| | // We need to be mindful of the case where we only have zeroes... 181| | // E.g., 0.000000000...000. 182| 19.0k| UC const* start = start_digits; 183| | if constexpr (null_terminated) { 184| | while ((*start == UC('0') || *start == decimal_point)) { 185| | if (*start == UC('0')) { 186| | --digit_count; 187| | } 188| | ++start; 189| | } 190| | } 191| 19.0k| else { 192| 2.72M| while ((start != pend) && (*start == UC('0') || *start == decimal_point)) { ------------------ | Branch (192:20): [True: 2.72M, False: 44] | Branch (192:40): [True: 2.70M, False: 23.2k] | Branch (192:61): [True: 4.32k, False: 18.9k] ------------------ 193| 2.70M| if (*start == UC('0')) { ------------------ | Branch (193:20): [True: 2.70M, False: 4.32k] ------------------ 194| 2.70M| --digit_count; 195| 2.70M| } 196| 2.70M| ++start; 197| 2.70M| } 198| 19.0k| } 199| | 200| 19.0k| if (digit_count > 19) { ------------------ | Branch (200:14): [True: 18.3k, False: 710] ------------------ 201| 18.3k| answer.too_many_digits = true; 202| | // Let us start again, this time, avoiding overflows. 203| | // We don't need to check if is_integer, since we use the 204| | // pre-tokenized spans from above. 205| 18.3k| i = 0; 206| 18.3k| p = answer.integer.ptr; 207| 18.3k| UC const* int_end = p + answer.integer.len(); 208| 18.3k| const uint64_t minimal_nineteen_digit_integer{1000000000000000000}; 209| 251k| while ((i < minimal_nineteen_digit_integer) && (p != int_end)) { ------------------ | Branch (209:20): [True: 242k, False: 9.66k] | Branch (209:60): [True: 233k, False: 8.64k] ------------------ 210| 233k| i = i * 10 + uint64_t(*p - UC('0')); 211| 233k| ++p; 212| 233k| } 213| 18.3k| if (i >= minimal_nineteen_digit_integer) { // We have a big integers ------------------ | Branch (213:17): [True: 9.66k, False: 8.64k] ------------------ 214| 9.66k| exponent = end_of_integer_part - p + exp_number; 215| 9.66k| } 216| 8.64k| else { // We have a value with a fractional component. 217| 8.64k| p = answer.fraction.ptr; 218| 8.64k| UC const* frac_end = p + answer.fraction.len(); 219| 408k| while ((i < minimal_nineteen_digit_integer) && (p != frac_end)) { ------------------ | Branch (219:23): [True: 400k, False: 8.64k] | Branch (219:63): [True: 400k, False: 0] ------------------ 220| 400k| i = i * 10 + uint64_t(*p - UC('0')); 221| 400k| ++p; 222| 400k| } 223| 8.64k| exponent = answer.fraction.ptr - p + exp_number; 224| 8.64k| } 225| | // We have now corrected both exponent and i, to a truncated value 226| 18.3k| } 227| 19.0k| } 228| 231k| answer.exponent = exponent; 229| 231k| answer.mantissa = i; 230| 231k| return answer; 231| 231k| } _ZZN3glz19parse_number_stringILb0EcEENS_10fast_float22parsed_number_string_tIT0_EEPKS3_S6_ENKUlvE_clEv: 71| 231k| const bool has_decimal_point = [&] { 72| | if constexpr (null_terminated) { 73| | return (*p == decimal_point); 74| | } 75| 231k| else { 76| 231k| return (p != pend) && (*p == decimal_point); ------------------ | Branch (76:20): [True: 229k, False: 1.94k] | Branch (76:35): [True: 14.5k, False: 215k] ------------------ 77| 231k| } 78| 231k| }(); _ZN3glz8to_charsImQsr3stdE7same_asIu14__remove_cvrefIT_EmEEEPcS3_S1_: 221| 324k| { 222| 324k| using namespace itoa_impl; 223| 324k| if (val < 100000000) { ------------------ | Branch (223:11): [True: 323k, False: 1.29k] ------------------ 224| 323k| return u64_len_1_8(buf, uint32_t(val)); 225| 323k| } 226| 1.29k| else if (val < 10000000000000000ull) { ------------------ | Branch (226:16): [True: 488, False: 804] ------------------ 227| 488| const uint64_t hgh = div_1e8(val); 228| 488| const uint32_t low = uint32_t(val - hgh * 100000000); 229| 488| buf = u64_len_1_8(buf, uint32_t(hgh)); 230| 488| return u64_len_8(buf, low); 231| 488| } 232| 804| else { 233| 804| const uint64_t tmp = div_1e8(val); 234| 804| const uint32_t low = uint32_t(val - tmp * 100000000); 235| 804| const uint32_t hgh = uint32_t(tmp / 10000); 236| 804| const uint32_t mid = uint32_t(tmp - uint64_t(hgh) * 10000); 237| 804| buf = u64_len_5_8(buf, hgh); 238| 804| buf = u64_len_4(buf, mid); 239| 804| return u64_len_8(buf, low); 240| 804| } 241| 324k| } _ZN3glz9itoa_impl11u64_len_1_8EPcj: 157| 323k| { 158| 323k| if (val < 100) { ------------------ | Branch (158:14): [True: 319k, False: 4.33k] ------------------ 159| 319k| return u32_2(buf, val); 160| 319k| } 161| 4.33k| else if (val < 10000) { ------------------ | Branch (161:19): [True: 3.16k, False: 1.17k] ------------------ 162| 3.16k| return u32_4(buf, val); 163| 3.16k| } 164| 1.17k| else if (val < 1000000) { ------------------ | Branch (164:19): [True: 698, False: 478] ------------------ 165| 698| return u32_6(buf, val); 166| 698| } 167| 478| else { 168| 478| return u32_8(buf, val); 169| 478| } 170| 323k| } _ZN3glz9itoa_impl5u32_2EPcj: 74| 319k| { 75| 319k| const uint32_t lz = val < 10; 76| 319k| std::memcpy(buf, char_table + ((val * 2) | lz), 2); 77| 319k| return buf + 2 - lz; 78| 319k| } _ZN3glz9itoa_impl5u32_4EPcj: 81| 3.18k| { 82| 3.18k| const uint32_t aa = (val * 5243) >> 19; // val / 100 83| 3.18k| const uint32_t lz = aa < 10; 84| 3.18k| std::memcpy(buf, char_table + ((aa * 2) | lz), 2); 85| 3.18k| std::memcpy(buf + 2 - lz, &digit_pairs[val - aa * 100], 2); 86| 3.18k| return buf + 4 - lz; 87| 3.18k| } _ZN3glz9itoa_impl5u32_6EPcj: 90| 922| { 91| 922| const uint32_t aa = uint32_t((uint64_t(val) * 429497) >> 32); // val / 10000 92| 922| const uint32_t bbcc = val - aa * 10000; 93| 922| const uint32_t bb = (bbcc * 5243) >> 19; // bbcc / 100 94| 922| const uint32_t lz = aa < 10; 95| 922| std::memcpy(buf, char_table + ((aa * 2) | lz), 2); 96| 922| std::memcpy(buf + 2 - lz, &digit_pairs[bb], 2); 97| 922| std::memcpy(buf + 4 - lz, &digit_pairs[bbcc - bb * 100], 2); 98| 922| return buf + 6 - lz; 99| 922| } _ZN3glz9itoa_impl5u32_8EPcj: 102| 1.05k| { 103| 1.05k| const uint32_t aabb = uint32_t((uint64_t(val) * 109951163) >> 40); // val / 10000 104| 1.05k| const uint32_t ccdd = val - aabb * 10000; 105| 1.05k| const uint32_t aa = (aabb * 5243) >> 19; // aabb / 100 106| 1.05k| const uint32_t cc = (ccdd * 5243) >> 19; // ccdd / 100 107| 1.05k| const uint32_t lz = aa < 10; 108| 1.05k| std::memcpy(buf, char_table + ((aa * 2) | lz), 2); 109| 1.05k| std::memcpy(buf + 2 - lz, &digit_pairs[aabb - aa * 100], 2); 110| 1.05k| std::memcpy(buf + 4 - lz, &digit_pairs[cc], 2); 111| 1.05k| std::memcpy(buf + 6 - lz, &digit_pairs[ccdd - cc * 100], 2); 112| 1.05k| return buf + 8 - lz; 113| 1.05k| } _ZN3glz9itoa_impl7div_1e8Em: 56| 1.29k| { 57| 1.29k| constexpr __uint128_t multiplier = 0xabcc77118461cefdULL; 58| 1.29k| constexpr uint64_t shift = 90; 59| 1.29k| return static_cast((static_cast<__uint128_t>(value) * multiplier) >> shift); 60| 1.29k| } _ZN3glz9itoa_impl9u64_len_8EPcj: 134| 1.29k| { 135| 1.29k| const uint32_t aabb = uint32_t((uint64_t(val) * 109951163) >> 40); 136| 1.29k| const uint32_t ccdd = val - aabb * 10000; 137| 1.29k| const uint32_t aa = (aabb * 5243) >> 19; 138| 1.29k| const uint32_t cc = (ccdd * 5243) >> 19; 139| 1.29k| std::memcpy(buf, &digit_pairs[aa], 2); 140| 1.29k| std::memcpy(buf + 2, &digit_pairs[aabb - aa * 100], 2); 141| 1.29k| std::memcpy(buf + 4, &digit_pairs[cc], 2); 142| 1.29k| std::memcpy(buf + 6, &digit_pairs[ccdd - cc * 100], 2); 143| 1.29k| return buf + 8; 144| 1.29k| } _ZN3glz9itoa_impl11u64_len_5_8EPcj: 174| 804| { 175| 804| if (val < 1000000) { ------------------ | Branch (175:14): [True: 224, False: 580] ------------------ 176| 224| return u32_6(buf, val); 177| 224| } 178| 580| else { 179| 580| return u32_8(buf, val); 180| 580| } 181| 804| } _ZN3glz9itoa_impl9u64_len_4EPcj: 148| 804| { 149| 804| const uint32_t aa = (val * 5243) >> 19; 150| 804| std::memcpy(buf, &digit_pairs[aa], 2); 151| 804| std::memcpy(buf + 2, &digit_pairs[val - aa * 100], 2); 152| 804| return buf + 4; 153| 804| } _ZN3glz8to_charsIjQsr3stdE7same_asIu14__remove_cvrefIT_EjEEEPcS3_S1_: 191| 22| { 192| 22| using namespace itoa_impl; 193| 22| if (val < 100) { ------------------ | Branch (193:11): [True: 2, False: 20] ------------------ 194| 2| return u32_2(buf, val); 195| 2| } 196| 20| else if (val < 10000) { ------------------ | Branch (196:16): [True: 20, False: 0] ------------------ 197| 20| return u32_4(buf, val); 198| 20| } 199| 0| else if (val < 1000000) { ------------------ | Branch (199:16): [True: 0, False: 0] ------------------ 200| 0| return u32_6(buf, val); 201| 0| } 202| 0| else if (val < 100000000) { ------------------ | Branch (202:16): [True: 0, False: 0] ------------------ 203| 0| return u32_8(buf, val); 204| 0| } 205| 0| else { 206| 0| return u32_10(buf, val); 207| 0| } 208| 22| } _ZN3glz13to_chars_40kbIiQsr3stdE7same_asIu14__remove_cvrefIT_EiEEEPcS3_S1_: 282| 1.09k| { 283| 1.09k| *buf = '-'; 284| 1.09k| return to_chars_40kb(buf + (val < 0), 285| 1.09k| static_cast((static_cast(val) ^ (val >> 31)) - (val >> 31))); 286| 1.09k| } _ZN3glz13to_chars_40kbIjQsr3stdE7same_asIu14__remove_cvrefIT_EjEEEPcS3_S1_: 260| 1.09k| { 261| 1.09k| using namespace itoa_40kb_impl; 262| 1.09k| if (val < 10000) { ------------------ | Branch (262:11): [True: 678, False: 413] ------------------ 263| 678| if (val < 100) ------------------ | Branch (263:14): [True: 590, False: 88] ------------------ 264| 590| return u32_2(buf, val); 265| 88| else 266| 88| return u32_4(buf, val); 267| 678| } 268| 413| else if (val < 100000000) { ------------------ | Branch (268:16): [True: 310, False: 103] ------------------ 269| 310| if (val < 1000000) ------------------ | Branch (269:14): [True: 121, False: 189] ------------------ 270| 121| return u32_6(buf, val); 271| 189| else 272| 189| return u32_8(buf, val); 273| 310| } 274| 103| else { 275| 103| return u32_10(buf, val); 276| 103| } 277| 1.09k| } _ZN3glz14itoa_40kb_impl5u32_2EPcj: 62| 590| { 63| 590| const uint64_t lz = val < 10; 64| | // Use OR since val*2 is always even (bit 0 is 0) 65| 590| std::memcpy(buf, char_table + ((val * 2) | lz), 2); 66| 590| return buf + 2 - lz; 67| 590| } _ZN3glz14itoa_40kb_impl5u32_4EPcj: 70| 88| { 71| 88| const uint32_t aa = (val * 5243) >> 19; 72| 88| const uint64_t lz = val < 1000; 73| 88| std::memcpy(buf, char_table + ((aa * 2) | lz), 2); 74| 88| std::memcpy(buf + 2 - lz, &digit_pairs[val - aa * 100], 2); 75| 88| return buf + 4 - lz; 76| 88| } _ZN3glz14itoa_40kb_impl5u32_6EPcj: 79| 121| { 80| 121| const uint32_t aa = static_cast((static_cast(val) * 429497ULL) >> 32); 81| 121| const uint64_t lz = val < 100000; 82| 121| std::memcpy(buf, char_table + ((aa * 2) | lz), 2); 83| 121| std::memcpy(buf + 2 - lz, &digit_quads[val - aa * 10000], 4); 84| 121| return buf + 6 - lz; 85| 121| } _ZN3glz14itoa_40kb_impl5u32_8EPcj: 88| 189| { 89| 189| const uint64_t aabb = (static_cast(val) * 109951163ULL) >> 40; 90| 189| const uint64_t aa = (aabb * 5243ULL) >> 19; 91| 189| const uint64_t lz = val < 10000000; 92| 189| std::memcpy(buf, char_table + ((aa * 2) | lz), 2); 93| 189| std::memcpy(buf + 2 - lz, &digit_pairs[aabb - aa * 100], 2); 94| 189| std::memcpy(buf + 4 - lz, &digit_quads[val - aabb * 10000], 4); 95| 189| return buf + 8 - lz; 96| 189| } _ZN3glz14itoa_40kb_impl6u32_10EPcj: 99| 103| { 100| 103| const uint64_t high = div_1e8(val); 101| 103| const uint64_t low = val - high * 100000000; 102| 103| const uint64_t lz = high < 10; 103| 103| std::memcpy(buf, char_table + ((high * 2) | lz), 2); 104| 103| const uint64_t aabb = (low * 109951163ULL) >> 40; 105| 103| const uint64_t ccdd = low - aabb * 10000; 106| 103| std::memcpy(buf + 2 - lz, &digit_quads[aabb], 4); 107| 103| std::memcpy(buf + 6 - lz, &digit_quads[ccdd], 4); 108| 103| return buf + 10 - lz; 109| 103| } _ZN3glz14itoa_40kb_impl7div_1e8Em: 50| 103| { 51| 103| constexpr __uint128_t multiplier = 0xabcc77118461cefdULL; 52| 103| constexpr uint64_t shift = 90; 53| 103| return static_cast((static_cast<__uint128_t>(value) * multiplier) >> shift); 54| 103| } _ZN3glz7skip_wsIXtlNS_7ws_optsEEETkNS_10is_contextERNS_7contextERPKcS5_EEbOT0_OT1_T2_: 663| 2.49M| { 664| 2.49M| using namespace glz::detail; 665| | 666| 2.49M| if constexpr (not Opts.minified) { 667| | if constexpr (Opts.null_terminated) { 668| | if constexpr (Opts.comments) { 669| | while (whitespace_comment_table[uint8_t(*it)]) { 670| | if (*it == '/') [[unlikely]] { 671| | skip_comment(ctx, it, end); 672| | if (bool(ctx.error)) [[unlikely]] { 673| | return true; 674| | } 675| | } 676| | else [[likely]] { 677| | ++it; 678| | } 679| | } 680| | } 681| | else { 682| | while (whitespace_table[uint8_t(*it)]) { 683| | ++it; 684| | } 685| | } 686| | } 687| 2.49M| else { 688| | if constexpr (Opts.comments) { 689| | while (it < end && whitespace_comment_table[uint8_t(*it)]) { 690| | if (*it == '/') [[unlikely]] { 691| | skip_comment(ctx, it, end); 692| | if (bool(ctx.error)) [[unlikely]] { 693| | return true; 694| | } 695| | } 696| | else [[likely]] { 697| | ++it; 698| | } 699| | } 700| | if (it == end) [[unlikely]] { 701| | ctx.error = error_code::end_reached; 702| | return true; 703| | } 704| | } 705| 2.49M| else { 706| 138M| while (it < end && whitespace_table[uint8_t(*it)]) { ------------------ | Branch (706:23): [True: 138M, False: 4.19k] | Branch (706:35): [True: 136M, False: 2.49M] ------------------ 707| 136M| ++it; 708| 136M| } 709| 2.49M| if (it == end) [[unlikely]] { ------------------ | Branch (709:20): [True: 4.19k, False: 2.49M] ------------------ 710| 4.19k| ctx.error = error_code::end_reached; 711| 4.19k| return true; 712| 4.19k| } 713| 2.49M| } 714| 2.49M| } 715| | } 716| | else if constexpr (not Opts.null_terminated) { 717| | // Minified input has no whitespace to skip, but a non-null-terminated buffer can still 718| | // be exhausted at this point. The non-minified branch above performs the same check; a 719| | // null-terminated buffer relies on the trailing sentinel and keeps this a pure no-op. 720| | if (it == end) [[unlikely]] { 721| | ctx.error = error_code::end_reached; 722| | return true; 723| | } 724| | } 725| | 726| 2.49M| return false; 727| 2.49M| } _ZN3glz17match_invalid_endILc123EXtlNS_22match_invalid_end_optsEEETkNS_10is_contextENS_7contextERPKcS4_EEbRT1_OT2_T3_: 470| 119k| { 471| 119k| if (*it != C) [[unlikely]] { ------------------ | Branch (471:11): [True: 43.9k, False: 75.3k] ------------------ 472| | if constexpr (C == '"') { 473| | ctx.error = error_code::expected_quote; 474| | } 475| | else if constexpr (C == ',') { 476| | ctx.error = error_code::expected_comma; 477| | } 478| | else if constexpr (C == ':') { 479| | ctx.error = error_code::expected_colon; 480| | } 481| | else if constexpr (C == '[' || C == ']') { 482| | ctx.error = error_code::expected_bracket; 483| | } 484| 43.9k| else if constexpr (C == '{' || C == '}') { 485| 43.9k| ctx.error = error_code::expected_brace; 486| | } 487| | else { 488| | ctx.error = error_code::syntax_error; 489| | } 490| 43.9k| return true; 491| 43.9k| } 492| 75.3k| else [[likely]] { 493| 75.3k| ++it; 494| 75.3k| } 495| 75.3k| if constexpr (not Opts.null_terminated) { 496| 75.3k| if (it == end) [[unlikely]] { ------------------ | Branch (496:14): [True: 57, False: 75.2k] ------------------ 497| 57| ctx.error = error_code::unexpected_end; 498| 57| return true; 499| 57| } 500| 75.3k| } 501| 75.2k| return false; 502| 119k| } _ZN3glz17match_invalid_endILc44EXtlNS_22match_invalid_end_optsEEETkNS_10is_contextENS_7contextERPKcS4_EEbRT1_OT2_T3_: 470| 137k| { 471| 137k| if (*it != C) [[unlikely]] { ------------------ | Branch (471:11): [True: 1.75k, False: 135k] ------------------ 472| | if constexpr (C == '"') { 473| | ctx.error = error_code::expected_quote; 474| | } 475| 1.75k| else if constexpr (C == ',') { 476| 1.75k| ctx.error = error_code::expected_comma; 477| | } 478| | else if constexpr (C == ':') { 479| | ctx.error = error_code::expected_colon; 480| | } 481| | else if constexpr (C == '[' || C == ']') { 482| | ctx.error = error_code::expected_bracket; 483| | } 484| | else if constexpr (C == '{' || C == '}') { 485| | ctx.error = error_code::expected_brace; 486| | } 487| | else { 488| | ctx.error = error_code::syntax_error; 489| | } 490| 1.75k| return true; 491| 1.75k| } 492| 135k| else [[likely]] { 493| 135k| ++it; 494| 135k| } 495| 135k| if constexpr (not Opts.null_terminated) { 496| 135k| if (it == end) [[unlikely]] { ------------------ | Branch (496:14): [True: 160, False: 135k] ------------------ 497| 160| ctx.error = error_code::unexpected_end; 498| 160| return true; 499| 160| } 500| 135k| } 501| 135k| return false; 502| 137k| } _ZN3glz16skip_matching_wsIcRPKcEEvPKT_OT0_m: 730| 669k| { 731| 669k| if (length > 7) { ------------------ | Branch (731:11): [True: 292k, False: 376k] ------------------ 732| 292k| uint64_t v[2]; 733| 308k| while (length > 8) { ------------------ | Branch (733:17): [True: 291k, False: 17.8k] ------------------ 734| 291k| std::memcpy(v, ws, 8); 735| 291k| std::memcpy(v + 1, it, 8); 736| 291k| if (v[0] != v[1]) { ------------------ | Branch (736:17): [True: 275k, False: 16.0k] ------------------ 737| 275k| return; 738| 275k| } 739| 16.0k| length -= 8; 740| 16.0k| ws += 8; 741| 16.0k| it += 8; 742| 16.0k| } 743| | 744| 17.8k| const auto shift = 8 - length; 745| 17.8k| ws -= shift; 746| 17.8k| it -= shift; 747| | 748| 17.8k| std::memcpy(v, ws, 8); 749| 17.8k| std::memcpy(v + 1, it, 8); 750| 17.8k| if (v[0] != v[1]) { ------------------ | Branch (750:14): [True: 11.9k, False: 5.82k] ------------------ 751| 11.9k| return; 752| 11.9k| } 753| 5.82k| it += 8; 754| 5.82k| return; 755| 17.8k| } 756| 376k| { 757| 376k| constexpr uint64_t n{sizeof(uint32_t)}; 758| 376k| if (length >= n) { ------------------ | Branch (758:14): [True: 263k, False: 113k] ------------------ 759| 263k| uint32_t v[2]; 760| 263k| std::memcpy(v, ws, n); 761| 263k| std::memcpy(v + 1, it, n); 762| 263k| if (v[0] != v[1]) { ------------------ | Branch (762:17): [True: 259k, False: 4.08k] ------------------ 763| 259k| return; 764| 259k| } 765| 4.08k| length -= n; 766| 4.08k| ws += n; 767| 4.08k| it += n; 768| 4.08k| } 769| 376k| } 770| 117k| { 771| 117k| constexpr uint64_t n{sizeof(uint16_t)}; 772| 117k| if (length >= n) { ------------------ | Branch (772:14): [True: 21.4k, False: 95.9k] ------------------ 773| 21.4k| uint16_t v[2]; 774| 21.4k| std::memcpy(v, ws, n); 775| 21.4k| std::memcpy(v + 1, it, n); 776| 21.4k| if (v[0] != v[1]) { ------------------ | Branch (776:17): [True: 13.6k, False: 7.77k] ------------------ 777| 13.6k| return; 778| 13.6k| } 779| | // length -= n; 780| | // ws += n; 781| 7.77k| it += n; 782| 7.77k| } 783| 117k| } 784| | // We have to call a whitespace check after this function 785| | // in case the whitespace is mismatching. 786| | // So, we forgo this check as to not duplicate. 787| | /*if (length && *ws == *it) { 788| | ++it; 789| | }*/ 790| 117k| } _ZN3glz17match_invalid_endILc58EXtlNS_22match_invalid_end_optsEEETkNS_10is_contextENS_7contextERPKcS4_EEbRT1_OT2_T3_: 470| 158k| { 471| 158k| if (*it != C) [[unlikely]] { ------------------ | Branch (471:11): [True: 572, False: 157k] ------------------ 472| | if constexpr (C == '"') { 473| | ctx.error = error_code::expected_quote; 474| | } 475| | else if constexpr (C == ',') { 476| | ctx.error = error_code::expected_comma; 477| | } 478| 572| else if constexpr (C == ':') { 479| 572| ctx.error = error_code::expected_colon; 480| | } 481| | else if constexpr (C == '[' || C == ']') { 482| | ctx.error = error_code::expected_bracket; 483| | } 484| | else if constexpr (C == '{' || C == '}') { 485| | ctx.error = error_code::expected_brace; 486| | } 487| | else { 488| | ctx.error = error_code::syntax_error; 489| | } 490| 572| return true; 491| 572| } 492| 157k| else [[likely]] { 493| 157k| ++it; 494| 157k| } 495| 157k| if constexpr (not Opts.null_terminated) { 496| 157k| if (it == end) [[unlikely]] { ------------------ | Branch (496:14): [True: 146, False: 157k] ------------------ 497| 146| ctx.error = error_code::unexpected_end; 498| 146| return true; 499| 146| } 500| 157k| } 501| 157k| return false; 502| 158k| } _ZN3glz9chunk_minILm8EEElb: 47| 75.2k| { 48| 75.2k| static_assert(Width <= padding_bytes); 49| 75.2k| return padded ? 1 : std::ptrdiff_t(Width); ------------------ | Branch (49:14): [True: 0, False: 75.2k] ------------------ 50| 75.2k| } _ZN3glz16skip_string_viewITkNS_10is_contextERNS_7contextERPKcS4_EEvOT_OT0_T1_Rm: 910| 1.57k| { 911| | // The bound as a pointer, so each chunk costs one compare rather than a subtract and a 912| | // compare. `end - 8` is only a pointer into the buffer once eight bytes are left; where they 913| | // are not, the fallback is the opening quote, which sits before `it` and so fails the test on 914| | // the first look. Never `it` itself -- that passes, and the chunk behind it would read past 915| | // `end`. Reading eight at a time never passes `end`, so this is safe on buffers that are 916| | // neither padded nor null terminated. 917| 1.57k| const auto* const chunk_limit = (end - it >= 8) ? end - 8 : it - 1; ------------------ | Branch (917:39): [True: 1.35k, False: 217] ------------------ 918| 545k| while (it <= chunk_limit) { ------------------ | Branch (918:14): [True: 545k, False: 431] ------------------ 919| 545k| uint64_t chunk; 920| 545k| std::memcpy(&chunk, it, 8); 921| | if constexpr (std::endian::native == std::endian::big) { 922| | chunk = std::byteswap(chunk); 923| | } 924| 545k| const uint64_t test = has_quote(chunk); 925| 545k| if (test) [[unlikely]] { ------------------ | Branch (925:14): [True: 2.27k, False: 543k] ------------------ 926| 2.27k| const size_t offset = size_t(countr_zero(test)) >> 3; 927| | // Only bytes up to and including the quote belong to the string. Masking the rest off 928| | // keeps a non-ASCII byte in whatever follows from forcing a needless validation pass. 929| 2.27k| ascii_acc |= chunk & (~uint64_t(0) >> (56 - 8 * offset)); 930| 2.27k| it += offset; 931| 2.27k| auto* prev = it - 1; 932| 5.26k| while (*prev == '\\') { ------------------ | Branch (932:20): [True: 2.99k, False: 2.27k] ------------------ 933| 2.99k| --prev; 934| 2.99k| } 935| 2.27k| if (size_t(it - prev) % 2) { ------------------ | Branch (935:17): [True: 1.14k, False: 1.13k] ------------------ 936| 1.14k| return; 937| 1.14k| } 938| 1.13k| ++it; // skip the escaped quote 939| 1.13k| } 940| 543k| else { 941| 543k| ascii_acc |= chunk; 942| 543k| it += 8; 943| 543k| } 944| 545k| } 945| | 946| | // Fewer than eight bytes left in the buffer, so finish one at a time. 947| 1.12k| while (it < end) { ------------------ | Branch (947:14): [True: 873, False: 247] ------------------ 948| 873| ascii_acc |= uint64_t(uint8_t(*it)); 949| 873| if (*it == '"') { ------------------ | Branch (949:14): [True: 333, False: 540] ------------------ 950| 333| auto* prev = it - 1; 951| 1.44k| while (*prev == '\\') { ------------------ | Branch (951:20): [True: 1.10k, False: 333] ------------------ 952| 1.10k| --prev; 953| 1.10k| } 954| 333| if (size_t(it - prev) % 2) { ------------------ | Branch (954:17): [True: 184, False: 149] ------------------ 955| 184| return; 956| 184| } 957| 333| } 958| 689| ++it; 959| 689| } 960| | 961| 247| ctx.error = error_code::expected_quote; 962| 247| } _ZN3glz13validate_utf8IcEEbPKT_m: 842| 6.63k| { 843| 6.63k| const uint8_t* it = reinterpret_cast(str); 844| 6.63k| const uint8_t* const end = it + size; 845| |#if defined(GLZ_UTF8_SIMD) 846| | // 16 is a measured compromise, not a register-size coincidence. The scalar path skips ASCII 8 847| | // bytes at a time, so on ASCII it stays ahead of the vector path's fixed setup cost until the 848| | // input is long enough for the 64 byte ASCII step to engage; on non-ASCII the vector path 849| | // wins from roughly 8 bytes. Raising the threshold buys a few percent on short ASCII and 850| | // costs up to 2.3x on mid length non-ASCII strings, so it stays low. 851| | if (size >= 16) { 852| | return detail::utf8_simd::validate(it, end); 853| | } 854| |#endif 855| 6.63k| return validate_utf8_scalar(it, end); 856| 6.63k| } _ZN3glz20validate_utf8_scalarEPKhS1_: 793| 6.63k| { 794| 11.6M| while (it < end) { ------------------ | Branch (794:14): [True: 11.6M, False: 5.41k] ------------------ 795| | // Optimistic SWAR check for ASCII 796| 11.6M| if (it + 8 <= end) { ------------------ | Branch (796:14): [True: 11.5M, False: 12.0k] ------------------ 797| 11.5M| uint64_t chunk; 798| 11.5M| std::memcpy(&chunk, it, 8); 799| 11.5M| if ((chunk & glz::repeat_byte8(0x80)) == 0) { ------------------ | Branch (799:17): [True: 11.5M, False: 22.9k] ------------------ 800| 11.5M| it += 8; 801| 11.5M| continue; 802| 11.5M| } 803| 11.5M| } 804| | 805| | // Byte-by-byte validation (standard conformant) 806| 35.0k| uint8_t byte = *it; 807| | 808| 35.0k| if (byte < 0x80) { ------------------ | Branch (808:14): [True: 23.2k, False: 11.8k] ------------------ 809| 23.2k| it++; 810| 23.2k| } 811| 11.8k| else if ((byte & 0xE0) == 0xC0) { ------------------ | Branch (811:19): [True: 1.92k, False: 9.87k] ------------------ 812| | // 2-byte sequence 813| 1.92k| if (it + 2 > end || (it[1] & 0xC0) != 0x80) return false; ------------------ | Branch (813:17): [True: 50, False: 1.87k] | Branch (813:33): [True: 127, False: 1.74k] ------------------ 814| 1.74k| if (byte < 0xC2) return false; // Overlong ------------------ | Branch (814:17): [True: 44, False: 1.70k] ------------------ 815| 1.70k| it += 2; 816| 1.70k| } 817| 9.87k| else if ((byte & 0xF0) == 0xE0) { ------------------ | Branch (817:19): [True: 3.08k, False: 6.79k] ------------------ 818| | // 3-byte sequence 819| 3.08k| if (it + 3 > end || (it[1] & 0xC0) != 0x80 || (it[2] & 0xC0) != 0x80) return false; ------------------ | Branch (819:17): [True: 52, False: 3.02k] | Branch (819:33): [True: 82, False: 2.94k] | Branch (819:59): [True: 58, False: 2.88k] ------------------ 820| 2.88k| if (byte == 0xE0 && it[1] < 0xA0) return false; // Overlong ------------------ | Branch (820:17): [True: 1.04k, False: 1.84k] | Branch (820:33): [True: 62, False: 987] ------------------ 821| 2.82k| if (byte == 0xED && it[1] >= 0xA0) return false; // Surrogate ------------------ | Branch (821:17): [True: 709, False: 2.11k] | Branch (821:33): [True: 54, False: 655] ------------------ 822| 2.77k| it += 3; 823| 2.77k| } 824| 6.79k| else if ((byte & 0xF8) == 0xF0) { ------------------ | Branch (824:19): [True: 6.44k, False: 345] ------------------ 825| | // 4-byte sequence 826| 6.44k| if (it + 4 > end || (it[1] & 0xC0) != 0x80 || (it[2] & 0xC0) != 0x80 || (it[3] & 0xC0) != 0x80) ------------------ | Branch (826:17): [True: 44, False: 6.40k] | Branch (826:33): [True: 60, False: 6.34k] | Branch (826:59): [True: 34, False: 6.31k] | Branch (826:85): [True: 62, False: 6.24k] ------------------ 827| 200| return false; 828| 6.24k| if (byte == 0xF0 && it[1] < 0x90) return false; // Overlong ------------------ | Branch (828:17): [True: 1.19k, False: 5.05k] | Branch (828:33): [True: 58, False: 1.13k] ------------------ 829| 6.19k| if (byte == 0xF4 && it[1] >= 0x90) return false; // > U+10FFFF ------------------ | Branch (829:17): [True: 1.33k, False: 4.85k] | Branch (829:33): [True: 54, False: 1.28k] ------------------ 830| 6.13k| if (byte > 0xF4) return false; // > U+10FFFF ------------------ | Branch (830:17): [True: 38, False: 6.09k] ------------------ 831| 6.09k| it += 4; 832| 6.09k| } 833| 345| else { 834| 345| return false; 835| 345| } 836| 35.0k| } 837| | 838| 5.41k| return true; 839| 6.63k| } _ZN3glz17match_invalid_endILc34EXtlNS_22match_invalid_end_optsEEETkNS_10is_contextENS_7contextERPKcS4_EEbRT1_OT2_T3_: 470| 118k| { 471| 118k| if (*it != C) [[unlikely]] { ------------------ | Branch (471:11): [True: 41.6k, False: 76.9k] ------------------ 472| 41.6k| if constexpr (C == '"') { 473| 41.6k| ctx.error = error_code::expected_quote; 474| | } 475| | else if constexpr (C == ',') { 476| | ctx.error = error_code::expected_comma; 477| | } 478| | else if constexpr (C == ':') { 479| | ctx.error = error_code::expected_colon; 480| | } 481| | else if constexpr (C == '[' || C == ']') { 482| | ctx.error = error_code::expected_bracket; 483| | } 484| | else if constexpr (C == '{' || C == '}') { 485| | ctx.error = error_code::expected_brace; 486| | } 487| | else { 488| | ctx.error = error_code::syntax_error; 489| | } 490| 41.6k| return true; 491| 41.6k| } 492| 76.9k| else [[likely]] { 493| 76.9k| ++it; 494| 76.9k| } 495| 76.9k| if constexpr (not Opts.null_terminated) { 496| 76.9k| if (it == end) [[unlikely]] { ------------------ | Branch (496:14): [True: 148, False: 76.8k] ------------------ 497| 148| ctx.error = error_code::unexpected_end; 498| 148| return true; 499| 148| } 500| 76.9k| } 501| 76.8k| return false; 502| 118k| } _ZN3glz18validate_utf8_spanITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1ELb0ELb0ELb0ELb0ELj4EEETkNS_10is_contextERNS_7contextEccEEbOT0_PKT1_PKT2_m: 873| 18.4k| { 874| | if constexpr (not check_validate_utf8(Opts)) { 875| | // Everything the caller computed for us is dead, which lets its scan loop drop the 876| | // accumulator entirely. 877| | (void)ctx, (void)start, (void)fin, (void)ascii_acc; 878| | return false; 879| | } 880| 18.4k| else { 881| 18.4k| if ((ascii_acc & repeat_byte8(0b10000000)) == 0) { ------------------ | Branch (881:14): [True: 15.8k, False: 2.57k] ------------------ 882| 15.8k| return false; // pure ASCII is trivially well formed UTF-8 883| 15.8k| } 884| 2.57k| if (!validate_utf8(start, size_t(fin - start))) [[unlikely]] { ------------------ | Branch (884:14): [True: 433, False: 2.13k] ------------------ 885| 433| ctx.error = error_code::invalid_utf8; 886| 433| return true; 887| 433| } 888| 2.13k| return false; 889| 2.57k| } 890| 18.4k| } _ZN3glz25handle_unicode_code_pointIccEENS_14unicode_resultERPKT_RPT0_S4_: 347| 16.4k| { 348| 16.4k| using namespace unicode; 349| | 350| 16.4k| if (end - it <= 4) [[unlikely]] { ------------------ | Branch (350:11): [True: 162, False: 16.2k] ------------------ 351| 162| return {0, escape_prefix_intact(it, end)}; 352| 162| } 353| 16.2k| const uint32_t high = hex_to_u32(it); 354| 16.2k| if (high == 0xFFFFFFFFu) [[unlikely]] { ------------------ | Branch (354:11): [True: 171, False: 16.1k] ------------------ 355| 171| return {}; 356| 171| } 357| 16.1k| it += 4; // skip the code point characters 358| | 359| 16.1k| uint32_t code_point; 360| | 361| 16.1k| if ((high & generic_surrogate_mask) == generic_surrogate_value) { ------------------ | Branch (361:11): [True: 1.51k, False: 14.5k] ------------------ 362| | // surrogate pair code points 363| 1.51k| if ((high & surrogate_mask) != high_surrogate_value) { ------------------ | Branch (363:14): [True: 59, False: 1.45k] ------------------ 364| 59| return {}; 365| 59| } 366| | 367| 1.45k| if (end - it <= 6) [[unlikely]] { ------------------ | Branch (367:14): [True: 264, False: 1.19k] ------------------ 368| 264| return {0, escape_prefix_intact(it, end)}; 369| 264| } 370| | // The next two characters must be `\u` 371| 1.19k| uint16_t u; 372| 1.19k| std::memcpy(&u, it, 2); 373| 1.19k| if (u != to_uint16_t(R"(\u)")) [[unlikely]] { ------------------ | Branch (373:14): [True: 256, False: 936] ------------------ 374| 256| return {}; 375| 256| } 376| 936| it += 2; 377| | // verify that second unicode escape sequence is present 378| 936| const uint32_t low = hex_to_u32(it); 379| 936| if (low == 0xFFFFFFFFu) [[unlikely]] { ------------------ | Branch (379:14): [True: 53, False: 883] ------------------ 380| 53| return {}; 381| 53| } 382| 883| it += 4; 383| | 384| 883| if ((low & surrogate_mask) != low_surrogate_value) [[unlikely]] { ------------------ | Branch (384:14): [True: 57, False: 826] ------------------ 385| 57| return {}; 386| 57| } 387| | 388| 826| code_point = (high & surrogate_codepoint_mask) << surrogate_codepoint_bits; 389| 826| code_point |= (low & surrogate_codepoint_mask); 390| 826| code_point += surrogate_codepoint_offset; 391| 826| } 392| 14.5k| else { 393| 14.5k| code_point = high; 394| 14.5k| } 395| 15.4k| const uint32_t offset = code_point_to_utf8(code_point, dst); 396| 15.4k| dst += offset; 397| 15.4k| return {offset, false}; 398| 16.1k| } _ZN3glz20escape_prefix_intactILb0EccEEbPKT0_PKT1_: 329| 162| { 330| 162| auto n = size_t(end - it); 331| | if constexpr (ExpectOpener) { 332| | if (n > 0 && it[0] != '\\') return false; 333| | if (n > 1 && it[1] != 'u') return false; 334| | if (n < 2) return true; 335| | it += 2; 336| | n -= 2; 337| | } 338| 399| for (size_t i = 0; i < n; ++i) { ------------------ | Branch (338:26): [True: 355, False: 44] ------------------ 339| 355| if (digit_hex_table[uint8_t(it[i])] == 255) return false; ------------------ | Branch (339:14): [True: 118, False: 237] ------------------ 340| 355| } 341| 44| return true; 342| 162| } _ZN3glz10hex_to_u32EPKc: 224| 17.2k| { 225| 17.2k| constexpr auto& t = digit_hex_table; 226| 17.2k| const uint8_t arr[4]{t[uint8_t(c[3])], t[uint8_t(c[2])], t[uint8_t(c[1])], t[uint8_t(c[0])]}; 227| 17.2k| auto chunk = std::bit_cast(arr); 228| | // On big-endian, bit_cast produces bytes in opposite order than expected 229| | // byteswap to get consistent little-endian representation 230| | if constexpr (std::endian::native == std::endian::big) { 231| | chunk = std::byteswap(chunk); 232| | } 233| | // check that all hex characters are valid 234| 17.2k| if (chunk & repeat_byte4(0b11110000u)) [[unlikely]] { ------------------ | Branch (234:11): [True: 224, False: 16.9k] ------------------ 235| 224| return 0xFFFFFFFFu; 236| 224| } 237| | 238| | // now pack into first four bytes of uint32_t 239| 16.9k| uint32_t packed{}; 240| 16.9k| packed |= (chunk & 0x0000000F); 241| 16.9k| packed |= (chunk & 0x00000F00) >> 4; 242| 16.9k| packed |= (chunk & 0x000F0000) >> 8; 243| 16.9k| packed |= (chunk & 0x0F000000) >> 12; 244| 16.9k| return packed; 245| 17.2k| } _ZN3glz20escape_prefix_intactILb1EccEEbPKT0_PKT1_: 329| 264| { 330| 264| auto n = size_t(end - it); 331| 264| if constexpr (ExpectOpener) { 332| 264| if (n > 0 && it[0] != '\\') return false; ------------------ | Branch (332:14): [True: 264, False: 0] | Branch (332:23): [True: 162, False: 102] ------------------ 333| 102| if (n > 1 && it[1] != 'u') return false; ------------------ | Branch (333:14): [True: 85, False: 17] | Branch (333:23): [True: 41, False: 44] ------------------ 334| 61| if (n < 2) return true; ------------------ | Branch (334:14): [True: 17, False: 44] ------------------ 335| 44| it += 2; 336| 44| n -= 2; 337| 44| } 338| 312| for (size_t i = 0; i < n; ++i) { ------------------ | Branch (338:26): [True: 92, False: 220] ------------------ 339| 92| if (digit_hex_table[uint8_t(it[i])] == 255) return false; ------------------ | Branch (339:14): [True: 44, False: 48] ------------------ 340| 92| } 341| 220| return true; 342| 264| } _ZN3glz18code_point_to_utf8IcEEjjPT_: 249| 15.4k| { 250| 15.4k| if (code_point <= 0x7F) { ------------------ | Branch (250:11): [True: 5.91k, False: 9.50k] ------------------ 251| 5.91k| c[0] = Char(code_point); 252| 5.91k| return 1; 253| 5.91k| } 254| 9.50k| if (code_point <= 0x7FF) { ------------------ | Branch (254:11): [True: 774, False: 8.73k] ------------------ 255| 774| c[0] = Char(0xC0 | ((code_point >> 6) & 0x1F)); 256| 774| c[1] = Char(0x80 | (code_point & 0x3F)); 257| 774| return 2; 258| 774| } 259| 8.73k| if (code_point <= 0xFFFF) { ------------------ | Branch (259:11): [True: 7.90k, False: 826] ------------------ 260| 7.90k| c[0] = Char(0xE0 | ((code_point >> 12) & 0x0F)); 261| 7.90k| c[1] = Char(0x80 | ((code_point >> 6) & 0x3F)); 262| 7.90k| c[2] = Char(0x80 | (code_point & 0x3F)); 263| 7.90k| return 3; 264| 7.90k| } 265| 826| if (code_point <= 0x10FFFF) { ------------------ | Branch (265:11): [True: 826, False: 0] ------------------ 266| 826| c[0] = Char(0xF0 | ((code_point >> 18) & 0x07)); 267| 826| c[1] = Char(0x80 | ((code_point >> 12) & 0x3F)); 268| 826| c[2] = Char(0x80 | ((code_point >> 6) & 0x3F)); 269| 826| c[3] = Char(0x80 | (code_point & 0x3F)); 270| 826| return 4; 271| 826| } 272| 0| return 0; 273| 826| } _ZN3glz17match_invalid_endILc91EXtlNS_22match_invalid_end_optsEEETkNS_10is_contextENS_7contextERPKcS4_EEbRT1_OT2_T3_: 470| 38.0k| { 471| 38.0k| if (*it != C) [[unlikely]] { ------------------ | Branch (471:11): [True: 25.6k, False: 12.3k] ------------------ 472| | if constexpr (C == '"') { 473| | ctx.error = error_code::expected_quote; 474| | } 475| | else if constexpr (C == ',') { 476| | ctx.error = error_code::expected_comma; 477| | } 478| | else if constexpr (C == ':') { 479| | ctx.error = error_code::expected_colon; 480| | } 481| 25.6k| else if constexpr (C == '[' || C == ']') { 482| 25.6k| ctx.error = error_code::expected_bracket; 483| | } 484| | else if constexpr (C == '{' || C == '}') { 485| | ctx.error = error_code::expected_brace; 486| | } 487| | else { 488| | ctx.error = error_code::syntax_error; 489| | } 490| 25.6k| return true; 491| 25.6k| } 492| 12.3k| else [[likely]] { 493| 12.3k| ++it; 494| 12.3k| } 495| 12.3k| if constexpr (not Opts.null_terminated) { 496| 12.3k| if (it == end) [[unlikely]] { ------------------ | Branch (496:14): [True: 22, False: 12.2k] ------------------ 497| 22| ctx.error = error_code::unexpected_end; 498| 22| return true; 499| 22| } 500| 12.3k| } 501| 12.2k| return false; 502| 38.0k| } _ZN3glz18validate_utf8_spanITnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETkNS_10is_contextERNS_7contextEccEEbOT0_PKT1_PKT2_m: 873| 55.6k| { 874| | if constexpr (not check_validate_utf8(Opts)) { 875| | // Everything the caller computed for us is dead, which lets its scan loop drop the 876| | // accumulator entirely. 877| | (void)ctx, (void)start, (void)fin, (void)ascii_acc; 878| | return false; 879| | } 880| 55.6k| else { 881| 55.6k| if ((ascii_acc & repeat_byte8(0b10000000)) == 0) { ------------------ | Branch (881:14): [True: 51.5k, False: 4.06k] ------------------ 882| 51.5k| return false; // pure ASCII is trivially well formed UTF-8 883| 51.5k| } 884| 4.06k| if (!validate_utf8(start, size_t(fin - start))) [[unlikely]] { ------------------ | Branch (884:14): [True: 791, False: 3.27k] ------------------ 885| 791| ctx.error = error_code::invalid_utf8; 886| 791| return true; 887| 791| } 888| 3.27k| return false; 889| 4.06k| } 890| 55.6k| } _ZN3glz5matchITnNS_14string_literalEXtlNS1_ILm4EEEtlA4_cLc117ELc108ELc108EEEETnDaXtlNS_4optsELj10ELb0ELb0ELb1ELb1EEETkNS_10is_contextERNS_7contextERPKcS8_EEvOT1_OT2_T3_: 539| 772| { 540| 772| static constexpr auto S = str.sv(); 541| 772| if ((end - it < std::ptrdiff_t(str.size())) || not comparitor(it)) [[unlikely]] { ------------------ | Branch (541:11): [True: 10, False: 762] | Branch (541:54): [True: 63, False: 699] ------------------ 542| 73| ctx.error = error_code::syntax_error; 543| 73| } 544| 699| else [[likely]] { 545| 699| it += str.size(); 546| 699| } 547| 772| } _ZN3glz16skip_string_viewITkNS_10is_contextERNS_7contextERPKcS4_EEvOT_OT0_T1_: 965| 1.57k| { 966| 1.57k| uint64_t ascii_acc{}; 967| 1.57k| skip_string_view(ctx, it, end, ascii_acc); 968| 1.57k| } _ZN3glz5matchILc34ETkNS_10is_contextENS_7contextERPKcEEbRT0_OT1_: 506| 1.32k| { 507| 1.32k| if (*it != C) [[unlikely]] { ------------------ | Branch (507:11): [True: 0, False: 1.32k] ------------------ 508| 0| if constexpr (C == '"') { 509| 0| ctx.error = error_code::expected_quote; 510| | } 511| | else if constexpr (C == ',') { 512| | ctx.error = error_code::expected_comma; 513| | } 514| | else if constexpr (C == ':') { 515| | ctx.error = error_code::expected_colon; 516| | } 517| | else if constexpr (C == '[' || C == ']') { 518| | ctx.error = error_code::expected_bracket; 519| | } 520| | else if constexpr (C == '{' || C == '}') { 521| | ctx.error = error_code::expected_brace; 522| | } 523| | else { 524| | ctx.error = error_code::syntax_error; 525| | } 526| 0| return true; 527| 0| } 528| 1.32k| else [[likely]] { 529| 1.32k| ++it; 530| 1.32k| return false; 531| 1.32k| } 532| 1.32k| } _ZNK3glz14string_literalILm4EE4sizeEv: 25| 1.47k| [[nodiscard]] constexpr size_t size() const noexcept { return length; } _ZN3glz6detail15get_source_infoITkNS_10contiguousENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEENS0_11source_infoERKT_m: 42| 165k| { 43| 165k| using V = std::decay_t; 44| | 45| | if constexpr (std::same_as) { 46| | return {.context = "", .index = index}; 47| | } 48| 165k| else { 49| 165k| const std::string_view text{reinterpret_cast(buffer.data()), buffer.size()}; 50| 165k| if (index >= text.size()) { ------------------ | Branch (50:17): [True: 7.59k, False: 157k] ------------------ 51| 7.59k| return {.context = "", .index = index}; 52| 7.59k| } 53| | 54| | // The line the error sits on starts just after the newline before it, or at the 55| | // beginning when there is none. Both the column and the context start from that one 56| | // position. Searching from index - 1 leaves index itself out, so a newline *at* the 57| | // error belongs to the line it ends rather than the one it opens. 58| 157k| const size_t prev_newline = index ? text.rfind('\n', index - 1) : text.npos; ------------------ | Branch (58:41): [True: 41.4k, False: 116k] ------------------ 59| 157k| const size_t offset = (prev_newline == text.npos) ? 0 : prev_newline + 1; ------------------ | Branch (59:35): [True: 156k, False: 1.37k] ------------------ 60| 157k| const size_t column = index - offset + 1; 61| 157k| const size_t line = size_t(std::count(text.begin(), text.begin() + index, '\n') + 1); 62| | 63| 157k| size_t context_begin = offset; 64| 157k| size_t context_end = (std::min)(text.find('\n', index + 1), text.size()); 65| | 66| 157k| size_t front_truncation = 0; 67| 157k| size_t rear_truncation = 0; 68| | 69| 157k| if (context_end - context_begin > 64) { ------------------ | Branch (69:17): [True: 36.2k, False: 121k] ------------------ 70| | // reduce the context length so that we can more easily see errors, especially for non-prettified buffers 71| 36.2k| if (column <= 32) { ------------------ | Branch (71:20): [True: 33.1k, False: 3.02k] ------------------ 72| 33.1k| rear_truncation = 64; 73| 33.1k| context_end = context_begin + rear_truncation; 74| 33.1k| } 75| 3.02k| else { 76| 3.02k| front_truncation = column - 32; 77| 3.02k| context_begin += front_truncation; 78| 3.02k| if (context_end - context_begin > 64) { ------------------ | Branch (78:23): [True: 966, False: 2.05k] ------------------ 79| 966| rear_truncation = front_truncation + 64; 80| 966| context_end = offset + rear_truncation; 81| 966| } 82| 3.02k| } 83| 36.2k| } 84| | 85| 157k| std::string context{text.substr(context_begin, context_end - context_begin)}; 86| 157k| convert_tabs_to_single_spaces(context); 87| 157k| return {line, column, context, index, front_truncation, rear_truncation}; 88| 165k| } 89| 165k| } _ZN3glz6detail29convert_tabs_to_single_spacesERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEE: 31| 157k| { 32| 4.56M| for (auto& c : input) { ------------------ | Branch (32:23): [True: 4.56M, False: 157k] ------------------ 33| 4.56M| if (c == '\t') { ------------------ | Branch (33:17): [True: 309k, False: 4.25M] ------------------ 34| 309k| c = ' '; 35| 309k| } 36| 4.56M| } 37| 157k| } _ZN3glz6detail21generate_error_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKNS0_11source_infoES5_: 110| 165k| { 111| 165k| std::string b{}; 112| 165k| b.resize(error.size() + info.context.size() + filename.size() + 128); 113| 165k| size_t ix{}; 114| | 115| 165k| if (not filename.empty()) { ------------------ | Branch (115:14): [True: 0, False: 165k] ------------------ 116| 0| dump_not_empty(filename, b, ix); 117| 0| dump(':', b, ix); 118| 0| } 119| | 120| 165k| glz::context ctx{}; 121| | 122| | // Diagnostic numbers (index/line/column) are always formatted with size-optimized 123| | // integer conversion: error formatting is never a throughput path, and this keeps 124| | // glz::format_error from pulling in the 40 KB integer table regardless of the 125| | // optimization level used elsewhere in the program. 126| 165k| if (info.context.empty()) { ------------------ | Branch (126:14): [True: 7.59k, False: 157k] ------------------ 127| 7.59k| dump("index ", b, ix); 128| 7.59k| write_chars::op(info.index, ctx, b, ix); 129| 7.59k| dump(": ", b, ix); 130| 7.59k| dump_maybe_empty(error, b, ix); 131| 7.59k| } 132| 157k| else { 133| 157k| write_chars::op(info.line, ctx, b, ix); 134| 157k| dump(':', b, ix); 135| 157k| write_chars::op(info.column, ctx, b, ix); 136| 157k| dump(": ", b, ix); 137| 157k| dump_maybe_empty(error, b, ix); 138| 157k| dump('\n', b, ix); 139| 157k| if (info.front_truncation) { ------------------ | Branch (139:17): [True: 3.02k, False: 154k] ------------------ 140| 3.02k| if (info.rear_truncation) { ------------------ | Branch (140:20): [True: 966, False: 2.05k] ------------------ 141| 966| dump("...", b, ix); 142| 966| dump_maybe_empty(info.context, b, ix); 143| 966| dump("...\n ", b, ix); 144| 966| } 145| 2.05k| else { 146| 2.05k| dump("...", b, ix); 147| 2.05k| dump_maybe_empty(info.context, b, ix); 148| 2.05k| dump("\n ", b, ix); 149| 2.05k| } 150| 3.02k| } 151| 154k| else { 152| 154k| dump(" ", b, ix); 153| 154k| dump_maybe_empty(info.context, b, ix); 154| 154k| dump("\n ", b, ix); 155| 154k| } 156| 157k| dumpn(' ', info.column - 1 - info.front_truncation, b, ix); 157| 157k| dump('^', b, ix); 158| 157k| } 159| | 160| 165k| b.resize(ix); 161| 165k| return b; 162| 165k| } _ZN3glz8to_charsITkNSt3__114floating_pointEdLb0EEEPcS2_T_: 1118| 1.27k| { 1119| 1.27k| static_assert(std::is_same_v || std::is_same_v); 1120| 1.27k| return zmij::detail::write(val, buf); 1121| 1.27k| } _ZN3glz4zmij6detail5writeIdLb0EEEPcT_S3_: 975| 1.27k| { 976| 1.27k| using namespace detail_impl; 977| 1.27k| using traits = float_traits; 978| 1.27k| auto bits = traits::to_bits(value); 979| 1.27k| auto bin_exp = traits::get_exp(bits); 980| 1.27k| auto bin_sig = traits::get_sig(bits); 981| | 982| 1.27k| *buffer = '-'; 983| 1.27k| buffer += traits::is_negative(bits); 984| | 985| 1.27k| const auto* c = &consts_v; 986| 1.27k| ZMIJ_ASM(("" : "+r"(c))); ------------------ | | 126| 1.27k|#define ZMIJ_ASM(x) asm x ------------------ 987| 1.27k| int64_t threshold = traits::num_bits == 64 ? static_cast(c->threshold) : 10'000'000; ------------------ | Branch (987:30): [True: 1.27k, Folded] ------------------ 988| | 989| 1.27k| to_decimal_result dec; 990| 1.27k| bool is_normal = unsigned(bin_exp - 1) < unsigned(traits::exp_mask - 1); 991| 1.27k| if (!is_normal) [[unlikely]] { ------------------ | Branch (991:14): [True: 666, False: 606] ------------------ 992| 666| if (bin_exp != 0) { ------------------ | Branch (992:17): [True: 1, False: 665] ------------------ 993| |#if GLZ_ZMIJ_EMIT_INF_NAN 994| | memcpy(buffer, bin_sig == 0 ? "inf" : "nan", 4); 995| | return buffer + 3; 996| |#else 997| | // Undo the speculative '-' for sign-bit-set NaN/Inf: JSON "null" 998| | // never carries a sign. 999| 1| buffer -= traits::is_negative(bits); 1000| 1| memcpy(buffer, "null", 4); 1001| 1| return buffer + 4; 1002| 1|#endif 1003| 1| } 1004| 665| if (bin_sig == 0) { ------------------ | Branch (1004:17): [True: 462, False: 203] ------------------ 1005| 462| memcpy(buffer, "0", 2); 1006| 462| return buffer + 1; 1007| 462| } 1008| 203| dec = detail_impl::to_decimal(bin_sig, 1, true, *c); 1009| 203| int64_t dec_sig = dec.sig * 10 + (dec.has_last_digit ? dec.last_digit : 0); ------------------ | Branch (1009:47): [True: 13, False: 190] ------------------ 1010| 203| int32_t dec_exp = dec.exp; 1011| 1.01k| while (dec_sig < threshold) { ------------------ | Branch (1011:20): [True: 809, False: 203] ------------------ 1012| 809| dec_sig *= 10; 1013| 809| --dec_exp; 1014| 809| } 1015| 203| int64_t d = static_cast(detail_impl::div10(static_cast(dec_sig))); 1016| 203| int32_t last_digit = static_cast(dec_sig - d * 10); 1017| 203| dec = {d, dec_exp, last_digit, last_digit != 0}; 1018| 203| } 1019| 606| else { 1020| 606| dec = detail_impl::to_decimal(bin_sig | traits::implicit_bit, 1021| 606| bin_exp, bin_sig != 0, *c); 1022| 606| } 1023| 809| bool extra_digit = dec.sig >= threshold; 1024| 809| int dec_exp = dec.exp + traits::max_digits10 - 2 + extra_digit; 1025| 809| if (traits::num_bits == 32 && dec.sig < 1'000'000) [[unlikely]] { ------------------ | Branch (1025:14): [Folded, False: 809] | Branch (1025:40): [True: 0, False: 0] ------------------ 1026| 0| dec.sig = 10 * dec.sig + (dec.has_last_digit ? dec.last_digit : 0); ------------------ | Branch (1026:39): [True: 0, False: 0] ------------------ 1027| 0| dec.has_last_digit = false; 1028| 0| --dec_exp; 1029| 0| } 1030| | 1031| 809| char* start = buffer; 1032| 809| auto dig = to_digits(static_cast(dec.sig), extra_digit, *c); 1033| 809| constexpr int bcd_size = traits::num_bits == 64 ? 16 : 8; ------------------ | Branch (1033:35): [True: 0, Folded] ------------------ 1034| 809| if (dec_exp >= traits::min_fixed_dec_exp && dec_exp <= traits::max_fixed_dec_exp) { ------------------ | Branch (1034:14): [True: 561, False: 248] | Branch (1034:54): [True: 438, False: 123] ------------------ 1035| 438| memcpy(start, &zeros_v, 8); 1036| 438| const auto& fmt = dec_exp_formats.get(dec_exp); 1037| 438| buffer += fmt.start_pos; 1038| 438| memcpy(buffer, &dig.digits, bcd_size); 1039| 438| memmove(buffer, buffer + !extra_digit, bcd_size); 1040| 438| buffer[bcd_size + extra_digit - 1] = static_cast('0' + (dec.has_last_digit ? dec.last_digit : 0)); ------------------ | Branch (1040:75): [True: 17, False: 421] ------------------ 1041| 438| memmove(start + fmt.shift_pos, start + fmt.point_pos, bcd_size); 1042| 438| start[fmt.point_pos] = '.'; 1043| 438| int num_digits = dec.has_last_digit ? bcd_size : dig.num_digits - 1; ------------------ | Branch (1043:30): [True: 17, False: 421] ------------------ 1044| 438| return buffer + fmt.exp_pos[num_digits + extra_digit - 1]; 1045| 438| } 1046| 371| buffer += extra_digit; 1047| 371| memcpy(buffer, &dig.digits, bcd_size); 1048| 371| buffer[bcd_size] = static_cast('0' + dec.last_digit); 1049| 371| buffer += dec.has_last_digit ? bcd_size + 1 : dig.num_digits; ------------------ | Branch (1049:20): [True: 42, False: 329] ------------------ 1050| 371| start[0] = start[1]; 1051| 371| start[1] = '.'; 1052| 371| buffer -= (buffer - 1 == start + 1); 1053| | 1054| 371| if constexpr (exp_string_table::enable) { 1055| 371| uint64_t exp_data = exp_strings_v.data[dec_exp + exp_string_table::offset]; 1056| 371| int len = int(exp_data >> 48); 1057| 371| if (is_big_endian) exp_data = bswap64(exp_data); ------------------ | Branch (1057:17): [Folded, False: 371] ------------------ 1058| 371| memcpy(buffer, &exp_data, traits::max_exponent10 >= 100 ? 8 : 4); ------------------ | Branch (1058:39): [True: 371, Folded] ------------------ 1059| 371| return buffer + len; 1060| 371| } 1061| | // Glaze emits uppercase 'E', omits '+' on positive exponents, and 1062| | // drops the leading zero on single-digit exponents (E7, not E07). 1063| | // Branchless: write "E-" always, then advance past the '-' only when 1064| | // the exponent is negative. 1065| 0| bool neg = dec_exp < 0; 1066| 371| buffer[0] = 'E'; 1067| 371| buffer[1] = '-'; 1068| 371| buffer += 1 + unsigned(neg); 1069| 371| dec_exp = neg ? -dec_exp : dec_exp; ------------------ | Branch (1069:20): [True: 0, False: 371] ------------------ 1070| 371| unsigned hundreds_written = 0; 1071| 371| if constexpr (traits::max_exponent10 >= 100) { 1072| 371| int32_t digit = 0; 1073| | if constexpr (use_umul128_hi64) { 1074| | digit = static_cast(umul128_hi64(static_cast(dec_exp), 0x290000000000000ull)); 1075| | } 1076| 371| else { 1077| 371| digit = static_cast((uint32_t(dec_exp) * div100_sig) >> div100_exp); 1078| 371| } 1079| 371| *buffer = static_cast('0' + digit); 1080| 371| hundreds_written = unsigned(dec_exp >= 100); 1081| 371| buffer += hundreds_written; 1082| 371| dec_exp -= digit * 100; 1083| 371| } 1084| | // dec_exp now in [0, 99]. Skip the tens digit only when no higher 1085| | // digit has been written (i.e. true leading zero, not interior). 1086| 371| const char* d2 = digits2(dec_exp); 1087| 371| *buffer = d2[0]; 1088| 371| buffer += hundreds_written | unsigned(dec_exp >= 10); 1089| 371| *buffer = d2[1]; 1090| 371| return buffer + 1; 1091| 809| } _ZN3glz4zmij11detail_impl12float_traitsIdE7to_bitsEd: 358| 1.27k| { 359| 1.27k| sig_type bits; 360| 1.27k| memcpy(&bits, &value, sizeof(value)); 361| 1.27k| return bits; 362| 1.27k| } _ZN3glz4zmij11detail_impl12float_traitsIdE7get_expEm: 367| 1.27k| { 368| 1.27k| return static_cast((bits << 1) >> (num_sig_bits + 1)); 369| 1.27k| } _ZN3glz4zmij11detail_impl12float_traitsIdE7get_sigEm: 365| 1.27k| static auto get_sig(sig_type bits) noexcept -> sig_type { return bits & (implicit_bit - 1); } _ZN3glz4zmij11detail_impl12float_traitsIdE11is_negativeEm: 364| 1.27k| static auto is_negative(sig_type bits) noexcept -> bool { return bits >> (num_bits - 1); } _ZN3glz4zmij11detail_impl10to_decimalIdmLb0EEENS1_17to_decimal_resultET0_lbRKNS1_9constantsIXT1_EEE: 868| 809| { 869| 809| using traits = float_traits; 870| 809| int64_t bin_exp = raw_exp - traits::exp_offset; 871| 809| constexpr int num_bits = std::numeric_limits::digits; 872| | 873| 809| constexpr uint64_t log10_2_sig = 78'913; 874| 809| constexpr int32_t log10_2_exp = 18; 875| 809| int32_t dec_exp = 0; 876| | if constexpr (use_umul128_hi64) { 877| | dec_exp = 878| | static_cast(umul128_hi64(static_cast(bin_exp), log10_2_sig << (64 - log10_2_exp))); 879| | } 880| 809| else { 881| 809| dec_exp = compute_dec_exp(bin_exp); 882| 809| } 883| 809| uint64_t even = 1 - (bin_sig & 1); 884| 809| constexpr int32_t extra_shift = exp_shift_table::extra_shift; 885| | 886| 809| if (!regular) [[unlikely]] { ------------------ | Branch (886:14): [True: 268, False: 541] ------------------ 887| 268| int32_t irregular_dec_exp = compute_dec_exp(bin_exp, false); 888| 268| int32_t shift = compute_exp_shift(bin_exp, irregular_dec_exp + 1) + extra_shift; 889| 268| uint128 pow10 = c.pow10_significands[-irregular_dec_exp - 1]; 890| 268| uint128 p = umul192_hi128(pow10.hi, pow10.lo, bin_sig << shift); 891| | 892| 268| int64_t integral = p.hi >> extra_shift; 893| 268| uint64_t fractional = p.hi << (64 - extra_shift) | p.lo >> extra_shift; 894| | 895| 268| uint64_t half_ulp = pow10.hi >> (extra_shift + 1 - shift); 896| 268| bool round_up = half_ulp > ~uint64_t(0) - fractional; 897| 268| bool round_down = (half_ulp >> 1) > fractional; 898| 268| integral += round_up; 899| | 900| 268| int32_t digit = static_cast(umul128_add_hi64(fractional, 10, (uint64_t(1) << 63) - 1)); 901| 268| int32_t lo = static_cast(umul128_add_hi64(fractional - (half_ulp >> 1), 10, ~uint64_t(0))); 902| 268| if (digit < lo) digit = lo; ------------------ | Branch (902:17): [True: 254, False: 14] ------------------ 903| 268| return {integral, irregular_dec_exp, digit, (round_up + round_down) == 0}; 904| 268| } 905| | 906| | if constexpr (num_bits == 32) { 907| | constexpr int32_t float_extra_shift = 34; 908| | int32_t shift = compute_exp_shift(bin_exp, dec_exp + 1) + float_extra_shift; 909| | uint64_t pow10_hi = c.pow10_significands[-dec_exp - 1].hi; 910| | uint64_t p = umul128_hi64(pow10_hi + 1, uint64_t(bin_sig) << shift); 911| | 912| | int64_t integral = p >> float_extra_shift; 913| | uint64_t fractional = p & ((1ull << float_extra_shift) - 1); 914| | 915| | uint64_t half_ulp = (pow10_hi >> (65 - shift)) + even; 916| | bool round_up = (fractional + half_ulp) >> float_extra_shift; 917| | bool round_down = half_ulp > fractional; 918| | integral += round_up; 919| | 920| | uint64_t prod = fractional * 10; 921| | int32_t digit = static_cast(prod >> float_extra_shift); 922| | uint64_t rem = prod & ((1ull << float_extra_shift) - 1); 923| | digit += 924| | rem > (1ull << (float_extra_shift - 1)) || (rem == (1ull << (float_extra_shift - 1)) && (digit & 1)); 925| | return {integral, dec_exp, digit, (round_up + round_down) == 0}; 926| | } 927| 541| else { 928| 541| int32_t shift = exp_shift_table::enable ? exp_shifts_v.data[bin_exp + traits::exp_offset] ------------------ | Branch (928:29): [True: 541, Folded] ------------------ 929| 541| : compute_exp_shift(bin_exp, dec_exp + 1) + extra_shift; 930| 541| ZMIJ_ASM(("" : "+r"(dec_exp))); ------------------ | | 126| 541|#define ZMIJ_ASM(x) asm x ------------------ 931| 541| uint128 pow10 = c.pow10_significands[-dec_exp - 1]; 932| 541| uint128 p = umul192_hi128(pow10.hi, pow10.lo, bin_sig << shift); 933| 541| int64_t integral = p.hi >> extra_shift; 934| 541| uint64_t fractional = p.hi << (64 - extra_shift) | p.lo >> extra_shift; 935| 541| uint64_t half_ulp = (pow10.hi >> (extra_shift + 1 - shift)) + even; 936| 541| bool round_up = fractional + half_ulp < fractional; 937| 541| bool round_down = half_ulp > fractional; 938| 541| integral += round_up; 939| | 940| 541| int32_t digit = static_cast(umul128_add_hi64(fractional, 10, c.biased_half)); 941| 541| if (fractional == (1ull << 62)) [[unlikely]] { ------------------ | Branch (941:17): [True: 3, False: 538] ------------------ 942| 3| digit = 2; 943| 3| } 944| 541| return {integral, dec_exp, digit, (round_up + round_down) == 0}; 945| 541| } 946| 541| } _ZN3glz4zmij11detail_impl15compute_dec_expElb: 333| 1.07k| { 334| 1.07k| assert(bin_exp >= -1334 && bin_exp <= 2620); ------------------ | Branch (334:10): [True: 1.07k, False: 0] | Branch (334:10): [True: 1.07k, False: 0] | Branch (334:10): [True: 1.07k, False: 0] ------------------ 335| 1.07k| constexpr int log10_3_over_4_sig = 131'072; 336| 1.07k| constexpr int log10_2_sig = 315'653, log10_2_exp = 20; 337| 1.07k| return static_cast((bin_exp * log10_2_sig - !regular * log10_3_over_4_sig) >> log10_2_exp); 338| 1.07k| } _ZN3glz4zmij11detail_impl17compute_exp_shiftEli: 457| 268| { 458| 268| assert(dec_exp >= -350 && dec_exp <= 350); ------------------ | Branch (458:10): [True: 268, False: 0] | Branch (458:10): [True: 268, False: 0] | Branch (458:10): [True: 268, False: 0] ------------------ 459| 268| constexpr int log2_pow10_sig = 217'707, log2_pow10_exp = 16; 460| 268| int pow10_bin_exp = -dec_exp * log2_pow10_sig >> log2_pow10_exp; 461| 268| return static_cast(bin_exp + pow10_bin_exp + 1); 462| 268| } _ZNK3glz4zmij11detail_impl23pow10_significand_tableILb0EEixEi: 440| 809| { 441| 809| constexpr int dec_exp_min = -293; 442| 809| int i = dec_exp - dec_exp_min; 443| 809| if (compress) return compute(i); ------------------ | Branch (443:17): [Folded, False: 809] ------------------ 444| 809| if (!split_tables) return {data[i * 2], data[i * 2 + 1]}; ------------------ | Branch (444:17): [True: 809, Folded] ------------------ 445| | 446| 0| const uint64_t* hi = data + num_pow10s + dec_exp_min - 1; 447| 0| const uint64_t* lo = hi + num_pow10s; 448| | 449| 0| if !consteval { 450| 0| ZMIJ_ASM(volatile("" : "+r"(hi), "+r"(lo))); ------------------ | | 126| 0|#define ZMIJ_ASM(x) asm x ------------------ 451| 0| } 452| 0| return {hi[-dec_exp], lo[-dec_exp]}; 453| 809| } _ZN3glz4zmij11detail_impl13umul192_hi128Emmm: 308| 809| { 309| 809| uint128_t p = umul128(x_hi, y); 310| 809| uint64_t lo = uint64_t(p) + uint64_t(umul128(x_lo, y) >> 64); 311| 809| return {uint64_t(p >> 64) + (lo < uint64_t(p)), lo}; 312| 809| } _ZN3glz4zmij11detail_impl7umul128Emm: 265| 1.82k| { 266| 1.82k|#if ZMIJ_USE_INT128 267| 1.82k| return uint128_t(x) * y; 268| |#else 269| |#if defined(_M_AMD64) 270| | if !consteval { 271| | uint64_t hi = 0; 272| | uint64_t lo = _umul128(x, y, &hi); 273| | return {hi, lo}; 274| | } 275| |#elif defined(_M_ARM64) 276| | if !consteval { 277| | return {__umulh(x, y), x * y}; 278| | } 279| |#endif 280| | uint64_t a = x >> 32; 281| | uint64_t b = uint32_t(x); 282| | uint64_t c = y >> 32; 283| | uint64_t d = uint32_t(y); 284| | 285| | uint64_t ac = a * c; 286| | uint64_t bc = b * c; 287| | uint64_t ad = a * d; 288| | uint64_t bd = b * d; 289| | 290| | uint64_t cs = (bd >> 32) + uint32_t(ad) + uint32_t(bc); 291| | return {ac + (ad >> 32) + (bc >> 32) + (cs >> 32), (cs << 32) + uint32_t(bd)}; 292| |#endif 293| 1.82k| } _ZN3glz4zmij11detail_impl16umul128_add_hi64Emmm: 298| 1.07k| { 299| 1.07k|#if ZMIJ_USE_INT128 300| 1.07k| return uint64_t((uint128_t(x) * y + c) >> 64); 301| |#else 302| | auto p = umul128(x, y); 303| | return p.hi + (p.lo + c < p.lo); 304| |#endif 305| 1.07k| } _ZN3glz4zmij11detail_impl5div10Em: 326| 203| { 327| 203| assert(x <= (1ull << 62)); ------------------ | Branch (327:10): [True: 203, False: 0] ------------------ 328| 203| constexpr uint64_t div10_sig64 = (1ull << 63) / 5 + 1; 329| 203| return ZMIJ_USE_INT128 ? umul128_hi64(x, div10_sig64) : x / 10; ------------------ | | 247| 203|#define ZMIJ_USE_INT128 1 | | ------------------ | | | Branch (247:25): [True: 203, Folded] | | ------------------ ------------------ 330| 203| } _ZN3glz4zmij11detail_impl12umul128_hi64Emm: 295| 203| constexpr auto umul128_hi64(uint64_t x, uint64_t y) noexcept -> uint64_t { return uint64_t(umul128(x, y) >> 64); } _ZN3glz4zmij11detail_impl9to_digitsILi64ELb0EEENS1_10dec_digitsIXT_EEEmbRKNS1_9constantsIXT0_EEE: 809| 809| { 810| | if constexpr (num_bits == 32) { 811| | auto result = to_bcd8(value); 812| | return {result.bcd + zeros_v, result.len}; 813| | } 814| 809| else { 815| |#if !ZMIJ_USE_NEON && !ZMIJ_USE_SSE 816| | uint32_t bbccddee = uint32_t(value / 100'000'000); 817| | uint32_t ffgghhii = uint32_t(value % 100'000'000); 818| | auto hi = to_bcd8(bbccddee); 819| | if (ffgghhii == 0) return {{hi.bcd + zeros_v, zeros_v}, hi.len}; 820| | auto lo = to_bcd8(ffgghhii); 821| | return {{hi.bcd + zeros_v, lo.bcd + zeros_v}, 8 + lo.len}; 822| |#elif ZMIJ_USE_NEON 823| | auto unshuffled_digits = to_unshuffled_digits(value, c); 824| | uint8x16_t digits = vrev64q_u8(unshuffled_digits); 825| | uint16x8_t str = vaddq_u16(vreinterpretq_u16_u8(digits), vreinterpretq_u16_s8(vdupq_n_s8('0'))); 826| | 827| | // vcgtzq_s8 is AArch64-only; the portable spelling (ARMv7 NEON and 828| | // up) is "compare greater-than against a zero vector". 829| | uint16x8_t is_not_zero = vreinterpretq_u16_u8(vcgtq_s8(vreinterpretq_s8_u8(digits), vdupq_n_s8(0))); 830| | uint64_t zeroes = vget_lane_u64(vreinterpret_u64_u8(vshrn_n_u16(is_not_zero, 4)), 0); 831| | return {str, 16 - (clz(zeroes) >> 2)}; 832| |#else 833| 809| uint32_t abbccddee = uint32_t(value / 100'000'000); 834| 809| uint32_t ffgghhii = uint32_t(value % 100'000'000); 835| | 836| 809| const __m128i zeros = _mm_load_si128(m128ptr(&c.zeros)); 837| 809| auto unshuffled_bcd = to_unshuffled_digits(abbccddee, ffgghhii, c); 838| |#if ZMIJ_USE_SSE4_1 839| | const __m128i bswap = _mm_load_si128(m128ptr(&c.bswap)); 840| | auto bcd = _mm_shuffle_epi8(unshuffled_bcd, bswap); 841| |#else 842| 809| auto bcd = _mm_shuffle_epi32(unshuffled_bcd, _MM_SHUFFLE(0, 1, 2, 3)); 843| 809|#endif 844| | 845| 809| __m128i mask128 = _mm_cmpgt_epi8(bcd, _mm_setzero_si128()); 846| 809| uint64_t mask = _mm_movemask_epi8(mask128); 847| |#if defined(__LZCNT__) && !defined(ZMIJ_NO_BUILTINS) 848| | int len = 32 - _lzcnt_u32(mask); 849| |#else 850| 809| int len = 63 - clz((mask << 1) | 1); 851| 809|#endif 852| 809| return {_mm_or_si128(bcd, zeros), len}; 853| 809|#endif 854| 809| } 855| 809| } _ZN3glz4zmij11detail_impl20to_unshuffled_digitsILb0EEEDv2_xjjRKNS1_9constantsIXT_EEE: 735| 809| { 736| 809| const __m128i div10k = _mm_load_si128(m128ptr(&c.div10k)); 737| 809| const __m128i neg10k = _mm_load_si128(m128ptr(&c.neg10k)); 738| 809| __m128i x = _mm_set_epi64x(bbccddee, ffgghhii); 739| 809| __m128i y = _mm_add_epi64(x, _mm_mul_epu32(neg10k, _mm_srli_epi64(_mm_mul_epu32(x, div10k), div10k_exp))); 740| 809| return to_bcd_4x4(y, c); 741| 809| } _ZN3glz4zmij11detail_impl10to_bcd_4x4ILb0EEEDv2_xS3_RKNS1_9constantsIXT_EEE: 712| 809| { 713| 809| const __m128i div100 = _mm_load_si128(m128ptr(&c.div100)); 714| 809| const __m128i div10 = _mm_load_si128(m128ptr(&c.div10)); 715| |#if ZMIJ_USE_SSE4_1 716| | const __m128i neg100 = _mm_load_si128(m128ptr(&c.neg100)); 717| | const __m128i neg10 = _mm_load_si128(m128ptr(&c.neg10)); 718| | 719| | __m128i z = _mm_add_epi64(y, _mm_mullo_epi32(neg100, _mm_srli_epi32(_mm_mulhi_epu16(y, div100), 3))); 720| | return _mm_add_epi16(z, _mm_mullo_epi16(neg10, _mm_mulhi_epu16(z, div10))); 721| |#else 722| 809| const __m128i hundred = _mm_load_si128(m128ptr(&c.hundred)); 723| 809| const __m128i moddiv10 = _mm_load_si128(m128ptr(&c.moddiv10)); 724| | 725| 809| __m128i y_div_100 = _mm_srli_epi16(_mm_mulhi_epu16(y, div100), 3); 726| 809| __m128i y_mod_100 = _mm_sub_epi16(y, _mm_mullo_epi16(y_div_100, hundred)); 727| 809| __m128i z = _mm_or_si128(_mm_slli_epi32(y_mod_100, 16), y_div_100); 728| 809| return _mm_sub_epi16(_mm_slli_epi16(z, 8), _mm_mullo_epi16(moddiv10, _mm_mulhi_epu16(z, div10))); 729| 809|#endif 730| 809| } _ZN3glz4zmij11detail_impl3clzEm: 187| 809| { 188| 809| assert(x != 0); ------------------ | Branch (188:10): [True: 809, False: 0] ------------------ 189| 809|#if ZMIJ_HAS_BUILTIN(__builtin_clzll) 190| 809| return __builtin_clzll(x); 191| |#elif defined(_M_AMD64) && defined(__AVX2__) 192| | return __lzcnt64(x); 193| |#elif defined(_M_AMD64) || defined(_M_ARM64) 194| | unsigned long idx; 195| | _BitScanReverse64(&idx, x); 196| | return 63 - idx; 197| |#elif ZMIJ_MSC_VER 198| | unsigned long idx; 199| | if (_BitScanReverse(&idx, uint32_t(x >> 32))) return 31 - idx; 200| | _BitScanReverse(&idx, uint32_t(x)); 201| | return 63 - idx; 202| |#else 203| | int n = 64; 204| | for (; x > 0; x >>= 1) --n; 205| | return n; 206| |#endif 207| 809| } _ZNK3glz4zmij11detail_impl20dec_exp_format_table3getINS1_12float_traitsIdEEEERKNS2_5entryEi: 559| 438| { 560| 438| constexpr auto min = traits::min_fixed_dec_exp, max = Traits::max_fixed_dec_exp; 561| 438| unsigned i = unsigned(dec_exp - min); 562| 438| return data[i <= unsigned(max - min) ? i : num_entries - 1]; ------------------ | Branch (562:25): [True: 438, False: 0] ------------------ 563| 438| }