_Z29get_supported_implementationsv:
   26|  2.25k|get_supported_implementations() {
   27|  2.25k|  static const auto impl = []() -> auto {
   28|  2.25k|    std::vector<const simdutf::implementation*> ret;
   29|  2.25k|    for (auto e : simdutf::get_available_implementations()) {
   30|  2.25k|      std::cerr << "implementation " << e->name() << " is available? "
   31|  2.25k|                << e->supported_by_runtime_system() << '\n';
   32|  2.25k|      if (e->supported_by_runtime_system()) {
   33|  2.25k|        ret.push_back(e);
   34|  2.25k|      }
   35|  2.25k|    }
   36|  2.25k|    return ret;
   37|  2.25k|  }();
   38|  2.25k|  return {impl.data(), impl.size()};
   39|  2.25k|}
_ZZ29get_supported_implementationsvENKUlvE_clEv:
   27|      1|  static const auto impl = []() -> auto {
   28|      1|    std::vector<const simdutf::implementation*> ret;
   29|      4|    for (auto e : simdutf::get_available_implementations()) {
  ------------------
  |  Branch (29:17): [True: 4, False: 1]
  ------------------
   30|      4|      std::cerr << "implementation " << e->name() << " is available? "
   31|      4|                << e->supported_by_runtime_system() << '\n';
   32|      4|      if (e->supported_by_runtime_system()) {
  ------------------
  |  Branch (32:11): [True: 3, False: 1]
  ------------------
   33|      3|        ret.push_back(e);
   34|      3|      }
   35|      4|    }
   36|      1|    return ret;
   37|      1|  }();
_ZneRKN7simdutf6resultES2_:
   42|  4.50k|inline bool operator!=(const simdutf::result& a, const simdutf::result& b) {
   43|  4.50k|  return a.count != b.count || a.error != b.error;
  ------------------
  |  Branch (43:10): [True: 0, False: 4.50k]
  |  Branch (43:32): [True: 0, False: 4.50k]
  ------------------
   44|  4.50k|}

LLVMFuzzerTestOneInput:
  211|  2.25k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
  212|       |  // First 4 bytes: action selector + alignment padding.
  213|  2.25k|  if (size < 4) {
  ------------------
  |  Branch (213:7): [True: 2, False: 2.25k]
  ------------------
  214|      2|    return 0;
  215|      2|  }
  216|  2.25k|  constexpr auto Ncases = 2u;
  217|  2.25k|  constexpr auto actionmask = std::bit_ceil(Ncases) - 1;
  218|  2.25k|  const auto action = data[0] & actionmask;
  219|       |
  220|       |  // Advance by 4 so the remaining data is aligned to char16_t.
  221|  2.25k|  data += 4;
  222|  2.25k|  size -= 4;
  223|       |
  224|  2.25k|  const std::span<const char16_t> u16data{
  225|  2.25k|      reinterpret_cast<const char16_t*>(data), size / sizeof(char16_t)};
  226|       |
  227|  2.25k|  switch (action) {
  ------------------
  |  Branch (227:11): [True: 2.25k, False: 0]
  ------------------
  228|  1.12k|  case 0:
  ------------------
  |  Branch (228:3): [True: 1.12k, False: 1.12k]
  ------------------
  229|  1.12k|    test_utf16le_with_replacement(u16data);
  230|  1.12k|    break;
  231|  1.12k|  case 1:
  ------------------
  |  Branch (231:3): [True: 1.12k, False: 1.12k]
  ------------------
  232|  1.12k|    test_utf16be_with_replacement(u16data);
  233|  1.12k|    break;
  234|  2.25k|  }
  235|       |
  236|  2.25k|  return 0;
  237|  2.25k|}
with_replacement.cpp:_ZL29test_utf16le_with_replacementNSt3__14spanIKDsLm18446744073709551615EEE:
   27|  1.12k|static void test_utf16le_with_replacement(std::span<const char16_t> input) {
   28|  1.12k|  const auto implementations = get_supported_implementations();
   29|  1.12k|  if (implementations.empty()) {
  ------------------
  |  Branch (29:7): [True: 0, False: 1.12k]
  ------------------
   30|      0|    return;
   31|      0|  }
   32|       |
   33|       |  // Step 1: Collect length predictions from all implementations and check
   34|       |  // agreement.
   35|  1.12k|  std::vector<simdutf::result> len_results;
   36|  1.12k|  len_results.reserve(implementations.size());
   37|  3.38k|  for (auto impl : implementations) {
  ------------------
  |  Branch (37:18): [True: 3.38k, False: 1.12k]
  ------------------
   38|  3.38k|    len_results.push_back(impl->utf8_length_from_utf16le_with_replacement(
   39|  3.38k|        input.data(), input.size()));
   40|  3.38k|  }
   41|  1.12k|  {
   42|  1.12k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
   43|  1.12k|    if (std::ranges::adjacent_find(len_results, neq) != len_results.end()) {
  ------------------
  |  Branch (43:9): [True: 0, False: 1.12k]
  ------------------
   44|      0|      std::cerr << "utf8_length_from_utf16le_with_replacement: implementations "
   45|      0|                   "disagree\n";
   46|      0|      for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (46:31): [True: 0, False: 0]
  ------------------
   47|      0|        std::cerr << "  " << implementations[i]->name()
   48|      0|                  << ": count=" << len_results[i].count
   49|      0|                  << " error=" << len_results[i].error << "\n";
   50|      0|      }
   51|      0|      std::abort();
   52|      0|    }
   53|  1.12k|  }
   54|       |
   55|  1.12k|  const std::size_t expected_len = len_results[0].count;
   56|       |  // error == SUCCESS means no surrogates encountered; SURROGATE means at least
   57|       |  // one.
   58|  1.12k|  const bool has_surrogates = (len_results[0].error != simdutf::SUCCESS);
   59|       |
   60|       |  // Step 2: Run conversion across all implementations and verify written ==
   61|       |  // expected_len.
   62|  1.12k|  std::vector<std::vector<char>> outputs;
   63|  1.12k|  outputs.reserve(implementations.size());
   64|  3.38k|  for (auto impl : implementations) {
  ------------------
  |  Branch (64:18): [True: 3.38k, False: 1.12k]
  ------------------
   65|  3.38k|    std::vector<char> out(expected_len);
   66|  3.38k|    const auto written = impl->convert_utf16le_to_utf8_with_replacement(
   67|  3.38k|        input.data(), input.size(), out.data());
   68|  3.38k|    if (written != expected_len) {
  ------------------
  |  Branch (68:9): [True: 0, False: 3.38k]
  ------------------
   69|      0|      std::cerr << "convert_utf16le_to_utf8_with_replacement:" << " written="
   70|      0|                << written << " but length predicted=" << expected_len
   71|      0|                << " impl=" << impl->name() << "\n";
   72|      0|      std::abort();
   73|      0|    }
   74|  3.38k|    outputs.push_back(std::move(out));
   75|  3.38k|  }
   76|       |
   77|       |  // Step 3: All implementations must agree on the output bytes.
   78|  1.12k|  {
   79|  1.12k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
   80|  1.12k|    if (std::ranges::adjacent_find(outputs, neq) != outputs.end()) {
  ------------------
  |  Branch (80:9): [True: 0, False: 1.12k]
  ------------------
   81|      0|      std::cerr << "convert_utf16le_to_utf8_with_replacement: outputs differ "
   82|      0|                   "between implementations\n";
   83|      0|      for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (83:31): [True: 0, False: 0]
  ------------------
   84|      0|        std::cerr << "  " << implementations[i]->name()
   85|      0|                  << ": hash=" << FNV1A_hash::as_str(outputs[i]) << "\n";
   86|      0|      }
   87|      0|      std::abort();
   88|      0|    }
   89|  1.12k|  }
   90|       |
   91|       |  // Step 4: Output must always be valid UTF-8.
   92|  4.50k|  for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (92:27): [True: 3.38k, False: 1.12k]
  ------------------
   93|  3.38k|    if (!implementations[i]->validate_utf8(outputs[i].data(),
  ------------------
  |  Branch (93:9): [True: 0, False: 3.38k]
  ------------------
   94|  3.38k|                                           outputs[i].size())) {
   95|      0|      std::cerr << "convert_utf16le_to_utf8_with_replacement: output is not "
   96|      0|                   "valid UTF-8"
   97|      0|                << " impl=" << implementations[i]->name() << "\n";
   98|      0|      std::abort();
   99|      0|    }
  100|  3.38k|  }
  101|       |
  102|       |  // Step 5: When no surrogates were found, match the regular (non-replacement)
  103|       |  // length.
  104|  1.12k|  if (!has_surrogates) {
  ------------------
  |  Branch (104:7): [True: 396, False: 731]
  ------------------
  105|  1.58k|    for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (105:29): [True: 1.18k, False: 396]
  ------------------
  106|  1.18k|      auto impl = implementations[i];
  107|  1.18k|      const auto regular_len =
  108|  1.18k|          impl->utf8_length_from_utf16le(input.data(), input.size());
  109|  1.18k|      if (regular_len != expected_len) {
  ------------------
  |  Branch (109:11): [True: 0, False: 1.18k]
  ------------------
  110|      0|        std::cerr
  111|      0|            << "utf16le_with_replacement: no surrogates but length mismatch:"
  112|      0|            << " with_replacement=" << expected_len
  113|      0|            << " regular=" << regular_len << " impl=" << impl->name() << "\n";
  114|      0|        std::abort();
  115|      0|      }
  116|  1.18k|    }
  117|    396|  }
  118|  1.12k|}
with_replacement.cpp:_ZZL29test_utf16le_with_replacementNSt3__14spanIKDsLm18446744073709551615EEEENK3$_0clIN7simdutf6resultES6_EEDaRKT_RKT0_:
   42|  2.25k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
with_replacement.cpp:_ZZL29test_utf16le_with_replacementNSt3__14spanIKDsLm18446744073709551615EEEENK3$_1clINS_6vectorIcNS_9allocatorIcEEEES8_EEDaRKT_RKT0_:
   79|  2.25k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
with_replacement.cpp:_ZL29test_utf16be_with_replacementNSt3__14spanIKDsLm18446744073709551615EEE:
  120|  1.12k|static void test_utf16be_with_replacement(std::span<const char16_t> input) {
  121|  1.12k|  const auto implementations = get_supported_implementations();
  122|  1.12k|  if (implementations.empty()) {
  ------------------
  |  Branch (122:7): [True: 0, False: 1.12k]
  ------------------
  123|      0|    return;
  124|      0|  }
  125|       |
  126|       |  // Step 1: Collect length predictions from all implementations and check
  127|       |  // agreement.
  128|  1.12k|  std::vector<simdutf::result> len_results;
  129|  1.12k|  len_results.reserve(implementations.size());
  130|  3.38k|  for (auto impl : implementations) {
  ------------------
  |  Branch (130:18): [True: 3.38k, False: 1.12k]
  ------------------
  131|  3.38k|    len_results.push_back(impl->utf8_length_from_utf16be_with_replacement(
  132|  3.38k|        input.data(), input.size()));
  133|  3.38k|  }
  134|  1.12k|  {
  135|  1.12k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
  136|  1.12k|    if (std::ranges::adjacent_find(len_results, neq) != len_results.end()) {
  ------------------
  |  Branch (136:9): [True: 0, False: 1.12k]
  ------------------
  137|      0|      std::cerr << "utf8_length_from_utf16be_with_replacement: implementations "
  138|      0|                   "disagree\n";
  139|      0|      for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (139:31): [True: 0, False: 0]
  ------------------
  140|      0|        std::cerr << "  " << implementations[i]->name()
  141|      0|                  << ": count=" << len_results[i].count
  142|      0|                  << " error=" << len_results[i].error << "\n";
  143|      0|      }
  144|      0|      std::abort();
  145|      0|    }
  146|  1.12k|  }
  147|       |
  148|  1.12k|  const std::size_t expected_len = len_results[0].count;
  149|  1.12k|  const bool has_surrogates = (len_results[0].error != simdutf::SUCCESS);
  150|       |
  151|       |  // Step 2: Run conversion across all implementations and verify written ==
  152|       |  // expected_len.
  153|  1.12k|  std::vector<std::vector<char>> outputs;
  154|  1.12k|  outputs.reserve(implementations.size());
  155|  3.38k|  for (auto impl : implementations) {
  ------------------
  |  Branch (155:18): [True: 3.38k, False: 1.12k]
  ------------------
  156|  3.38k|    std::vector<char> out(expected_len);
  157|  3.38k|    const auto written = impl->convert_utf16be_to_utf8_with_replacement(
  158|  3.38k|        input.data(), input.size(), out.data());
  159|  3.38k|    if (written != expected_len) {
  ------------------
  |  Branch (159:9): [True: 0, False: 3.38k]
  ------------------
  160|      0|      std::cerr << "convert_utf16be_to_utf8_with_replacement:" << " written="
  161|      0|                << written << " but length predicted=" << expected_len
  162|      0|                << " impl=" << impl->name() << "\n";
  163|      0|      std::abort();
  164|      0|    }
  165|  3.38k|    outputs.push_back(std::move(out));
  166|  3.38k|  }
  167|       |
  168|       |  // Step 3: All implementations must agree on the output bytes.
  169|  1.12k|  {
  170|  1.12k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
  171|  1.12k|    if (std::ranges::adjacent_find(outputs, neq) != outputs.end()) {
  ------------------
  |  Branch (171:9): [True: 0, False: 1.12k]
  ------------------
  172|      0|      std::cerr << "convert_utf16be_to_utf8_with_replacement: outputs differ "
  173|      0|                   "between implementations\n";
  174|      0|      for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (174:31): [True: 0, False: 0]
  ------------------
  175|      0|        std::cerr << "  " << implementations[i]->name()
  176|      0|                  << ": hash=" << FNV1A_hash::as_str(outputs[i]) << "\n";
  177|      0|      }
  178|      0|      std::abort();
  179|      0|    }
  180|  1.12k|  }
  181|       |
  182|       |  // Step 4: Output must always be valid UTF-8.
  183|  4.50k|  for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (183:27): [True: 3.38k, False: 1.12k]
  ------------------
  184|  3.38k|    if (!implementations[i]->validate_utf8(outputs[i].data(),
  ------------------
  |  Branch (184:9): [True: 0, False: 3.38k]
  ------------------
  185|  3.38k|                                           outputs[i].size())) {
  186|      0|      std::cerr << "convert_utf16be_to_utf8_with_replacement: output is not "
  187|      0|                   "valid UTF-8"
  188|      0|                << " impl=" << implementations[i]->name() << "\n";
  189|      0|      std::abort();
  190|      0|    }
  191|  3.38k|  }
  192|       |
  193|       |  // Step 5: When no surrogates were found, match the regular (non-replacement)
  194|       |  // length.
  195|  1.12k|  if (!has_surrogates) {
  ------------------
  |  Branch (195:7): [True: 380, False: 747]
  ------------------
  196|  1.52k|    for (std::size_t i = 0; i < implementations.size(); ++i) {
  ------------------
  |  Branch (196:29): [True: 1.14k, False: 380]
  ------------------
  197|  1.14k|      auto impl = implementations[i];
  198|  1.14k|      const auto regular_len =
  199|  1.14k|          impl->utf8_length_from_utf16be(input.data(), input.size());
  200|  1.14k|      if (regular_len != expected_len) {
  ------------------
  |  Branch (200:11): [True: 0, False: 1.14k]
  ------------------
  201|      0|        std::cerr
  202|      0|            << "utf16be_with_replacement: no surrogates but length mismatch:"
  203|      0|            << " with_replacement=" << expected_len
  204|      0|            << " regular=" << regular_len << " impl=" << impl->name() << "\n";
  205|      0|        std::abort();
  206|      0|      }
  207|  1.14k|    }
  208|    380|  }
  209|  1.12k|}
with_replacement.cpp:_ZZL29test_utf16be_with_replacementNSt3__14spanIKDsLm18446744073709551615EEEENK3$_0clIN7simdutf6resultES6_EEDaRKT_RKT0_:
  135|  2.25k|    auto neq = [](const auto& a, const auto& b) { return a != b; };
with_replacement.cpp:_ZZL29test_utf16be_with_replacementNSt3__14spanIKDsLm18446744073709551615EEEENK3$_1clINS_6vectorIcNS_9allocatorIcEEEES8_EEDaRKT_RKT0_:
  170|  2.25k|    auto neq = [](const auto& a, const auto& b) { return a != b; };

_ZN7simdutf6resultC2ENS_10error_codeEm:
   87|  2.63M|      : error{err}, count{pos} {}
_ZN7simdutf11full_resultC2ENS_10error_codeEmm:
  111|  14.6k|      : error{err}, input_count{pos_in}, output_count{pos_out} {}
_ZNK7simdutf11full_resultcvNS_6resultEEv:
  117|  14.6k|  simdutf_really_inline simdutf_constexpr23 operator result() const noexcept {
  118|  14.6k|    if (error == error_code::SUCCESS) {
  ------------------
  |  Branch (118:9): [True: 3.21k, False: 11.4k]
  ------------------
  119|  3.21k|      return result{error, output_count};
  120|  11.4k|    } else {
  121|  11.4k|      return result{error, input_count};
  122|  11.4k|    }
  123|  14.6k|  }

_ZNK7simdutf14implementation4nameEv:
 5106|      4|  virtual std::string_view name() const noexcept { return _name; }
_ZNK7simdutf14implementation25required_instruction_setsEv:
 5157|      8|  virtual uint32_t required_instruction_sets() const {
 5158|      8|    return _required_instruction_sets;
 5159|      8|  }
_ZN7simdutf14implementationC2EPKcS2_j:
 7043|      4|      : _name(name), _description(description),
 7044|      4|        _required_instruction_sets(required_instruction_sets) {}
_ZN7simdutf8internal29available_implementation_listC2Ev:
 7075|      1|  simdutf_really_inline available_implementation_list() {}

simdutf.cpp:_ZN7simdutf8internalL30detect_supported_architecturesEv:
  236|      8|static inline uint32_t detect_supported_architectures() {
  237|      8|  uint32_t eax;
  238|      8|  uint32_t ebx = 0;
  239|      8|  uint32_t ecx = 0;
  240|      8|  uint32_t edx = 0;
  241|      8|  uint32_t host_isa = 0x0;
  242|       |
  243|       |  // EBX for EAX=0x1
  244|      8|  eax = 0x1;
  245|      8|  cpuid(&eax, &ebx, &ecx, &edx);
  246|       |
  247|      8|  if (ecx & cpuid_bit::sse42) {
  ------------------
  |  Branch (247:7): [True: 8, False: 0]
  ------------------
  248|      8|    host_isa |= instruction_set::SSE42;
  249|      8|  }
  250|       |
  251|      8|  if (ecx & cpuid_bit::pclmulqdq) {
  ------------------
  |  Branch (251:7): [True: 8, False: 0]
  ------------------
  252|      8|    host_isa |= instruction_set::PCLMULQDQ;
  253|      8|  }
  254|       |
  255|      8|  if ((ecx & cpuid_bit::osxsave) != cpuid_bit::osxsave) {
  ------------------
  |  Branch (255:7): [True: 0, False: 8]
  ------------------
  256|      0|    return host_isa;
  257|      0|  }
  258|       |
  259|       |  // xgetbv for checking if the OS saves registers
  260|      8|  uint64_t xcr0 = xgetbv();
  261|       |
  262|      8|  if ((xcr0 & cpuid_bit::xcr0_bit::avx256_saved) == 0) {
  ------------------
  |  Branch (262:7): [True: 0, False: 8]
  ------------------
  263|      0|    return host_isa;
  264|      0|  }
  265|       |  // ECX for EAX=0x7
  266|      8|  eax = 0x7;
  267|      8|  ecx = 0x0; // Sub-leaf = 0
  268|      8|  cpuid(&eax, &ebx, &ecx, &edx);
  269|      8|  if (ebx & cpuid_bit::ebx::avx2) {
  ------------------
  |  Branch (269:7): [True: 8, False: 0]
  ------------------
  270|      8|    host_isa |= instruction_set::AVX2;
  271|      8|  }
  272|      8|  if (ebx & cpuid_bit::ebx::bmi1) {
  ------------------
  |  Branch (272:7): [True: 8, False: 0]
  ------------------
  273|      8|    host_isa |= instruction_set::BMI1;
  274|      8|  }
  275|      8|  if (ebx & cpuid_bit::ebx::bmi2) {
  ------------------
  |  Branch (275:7): [True: 8, False: 0]
  ------------------
  276|      8|    host_isa |= instruction_set::BMI2;
  277|      8|  }
  278|      8|  if (!((xcr0 & cpuid_bit::xcr0_bit::avx512_saved) ==
  ------------------
  |  Branch (278:7): [True: 8, False: 0]
  ------------------
  279|      8|        cpuid_bit::xcr0_bit::avx512_saved)) {
  280|      8|    return host_isa;
  281|      8|  }
  282|      0|  if (ebx & cpuid_bit::ebx::avx512f) {
  ------------------
  |  Branch (282:7): [True: 0, False: 0]
  ------------------
  283|      0|    host_isa |= instruction_set::AVX512F;
  284|      0|  }
  285|      0|  if (ebx & cpuid_bit::ebx::avx512bw) {
  ------------------
  |  Branch (285:7): [True: 0, False: 0]
  ------------------
  286|      0|    host_isa |= instruction_set::AVX512BW;
  287|      0|  }
  288|      0|  if (ebx & cpuid_bit::ebx::avx512cd) {
  ------------------
  |  Branch (288:7): [True: 0, False: 0]
  ------------------
  289|      0|    host_isa |= instruction_set::AVX512CD;
  290|      0|  }
  291|      0|  if (ebx & cpuid_bit::ebx::avx512dq) {
  ------------------
  |  Branch (291:7): [True: 0, False: 0]
  ------------------
  292|      0|    host_isa |= instruction_set::AVX512DQ;
  293|      0|  }
  294|      0|  if (ebx & cpuid_bit::ebx::avx512vl) {
  ------------------
  |  Branch (294:7): [True: 0, False: 0]
  ------------------
  295|      0|    host_isa |= instruction_set::AVX512VL;
  296|      0|  }
  297|      0|  if (ecx & cpuid_bit::ecx::avx512vbmi2) {
  ------------------
  |  Branch (297:7): [True: 0, False: 0]
  ------------------
  298|      0|    host_isa |= instruction_set::AVX512VBMI2;
  299|      0|  }
  300|      0|  if (ecx & cpuid_bit::ecx::avx512vpopcnt) {
  ------------------
  |  Branch (300:7): [True: 0, False: 0]
  ------------------
  301|      0|    host_isa |= instruction_set::AVX512VPOPCNTDQ;
  302|      0|  }
  303|      0|  return host_isa;
  304|      8|}
simdutf.cpp:_ZN7simdutf8internalL5cpuidEPjS1_S1_S1_:
  202|     16|                         uint32_t *edx) {
  203|       |  #if defined(_MSC_VER)
  204|       |  int cpu_info[4];
  205|       |  __cpuidex(cpu_info, *eax, *ecx);
  206|       |  *eax = cpu_info[0];
  207|       |  *ebx = cpu_info[1];
  208|       |  *ecx = cpu_info[2];
  209|       |  *edx = cpu_info[3];
  210|       |  #elif (defined(HAVE_GCC_GET_CPUID) && defined(USE_GCC_GET_CPUID)) ||         \
  211|       |      defined(__FILC__)
  212|       |  uint32_t level = *eax;
  213|       |  __get_cpuid(level, eax, ebx, ecx, edx);
  214|       |  #else
  215|     16|  uint32_t a = *eax, b, c = *ecx, d;
  216|     16|  asm volatile("cpuid\n\t" : "+a"(a), "=b"(b), "+c"(c), "=d"(d));
  217|     16|  *eax = a;
  218|     16|  *ebx = b;
  219|     16|  *ecx = c;
  220|     16|  *edx = d;
  221|     16|  #endif
  222|     16|}
simdutf.cpp:_ZN7simdutf8internalL6xgetbvEv:
  224|      8|static inline uint64_t xgetbv() {
  225|       |  #if defined(_MSC_VER)
  226|       |  return _xgetbv(0);
  227|       |  #elif defined(__FILC__)
  228|       |  return zxgetbv();
  229|       |  #else
  230|      8|  uint32_t xcr0_lo, xcr0_hi;
  231|      8|  asm volatile("xgetbv\n\t" : "=a"(xcr0_lo), "=d"(xcr0_hi) : "c"(0));
  232|      8|  return xcr0_lo | ((uint64_t)xcr0_hi << 32);
  233|      8|  #endif
  234|      8|}

_ZN7simdutf6scalar14u16_swap_bytesEt:
    8|   100M|u16_swap_bytes(const uint16_t word) {
    9|   100M|  return uint16_t((word >> 8) | (word << 8));
   10|   100M|}
_ZN7simdutf6scalar5utf1614swap_if_neededILNS_10endiannessE1EEEtt:
   27|  58.5M|template <endianness big_endian> constexpr uint16_t swap_if_needed(uint16_t c) {
   28|  58.5M|  return !match_system(big_endian) ? scalar::u16_swap_bytes(c) : c;
  ------------------
  |  Branch (28:10): [True: 58.5M, Folded]
  ------------------
   29|  58.5M|}
_ZN7simdutf6scalar5utf1614swap_if_neededILNS_10endiannessE0EEEtt:
   27|  75.4M|template <endianness big_endian> constexpr uint16_t swap_if_needed(uint16_t c) {
   28|  75.4M|  return !match_system(big_endian) ? scalar::u16_swap_bytes(c) : c;
  ------------------
  |  Branch (28:10): [Folded, False: 75.4M]
  ------------------
   29|  75.4M|}

_ZN7simdutf6scalar5utf1617is_high_surrogateILNS_10endiannessE0EEEbDs:
  137|  25.7M|template <endianness big_endian> constexpr bool is_high_surrogate(char16_t c) {
  138|  25.7M|  c = scalar::utf16::swap_if_needed<big_endian>(c);
  139|  25.7M|  return (0xd800 <= c && c <= 0xdbff);
  ------------------
  |  Branch (139:11): [True: 2.00M, False: 23.6M]
  |  Branch (139:26): [True: 571k, False: 1.43M]
  ------------------
  140|  25.7M|}
_ZN7simdutf6scalar5utf1616is_low_surrogateILNS_10endiannessE0EEEbDs:
  142|  30.0M|template <endianness big_endian> constexpr bool is_low_surrogate(char16_t c) {
  143|  30.0M|  c = scalar::utf16::swap_if_needed<big_endian>(c);
  144|  30.0M|  return (0xdc00 <= c && c <= 0xdfff);
  ------------------
  |  Branch (144:11): [True: 1.83M, False: 28.2M]
  |  Branch (144:26): [True: 514k, False: 1.31M]
  ------------------
  145|  30.0M|}
_ZN7simdutf6scalar5utf1617is_high_surrogateILNS_10endiannessE1EEEbDs:
  137|  20.8M|template <endianness big_endian> constexpr bool is_high_surrogate(char16_t c) {
  138|  20.8M|  c = scalar::utf16::swap_if_needed<big_endian>(c);
  139|  20.8M|  return (0xd800 <= c && c <= 0xdbff);
  ------------------
  |  Branch (139:11): [True: 1.73M, False: 19.1M]
  |  Branch (139:26): [True: 419k, False: 1.31M]
  ------------------
  140|  20.8M|}
_ZN7simdutf6scalar5utf1616is_low_surrogateILNS_10endiannessE1EEEbDs:
  142|  24.4M|template <endianness big_endian> constexpr bool is_low_surrogate(char16_t c) {
  143|  24.4M|  c = scalar::utf16::swap_if_needed<big_endian>(c);
  144|  24.4M|  return (0xdc00 <= c && c <= 0xdfff);
  ------------------
  |  Branch (144:11): [True: 1.63M, False: 22.8M]
  |  Branch (144:26): [True: 310k, False: 1.32M]
  ------------------
  145|  24.4M|}
_ZN7simdutf6scalar5utf1622utf8_length_from_utf16ILNS_10endiannessE0EEEmPKDsm:
   91|  1.54M|                                                  size_t len) {
   92|       |  // We are not BOM aware.
   93|  1.54M|  size_t counter{0};
   94|  15.1M|  for (size_t i = 0; i < len; i++) {
  ------------------
  |  Branch (94:22): [True: 13.6M, False: 1.54M]
  ------------------
   95|  13.6M|    char16_t word = scalar::utf16::swap_if_needed<big_endian>(p[i]);
   96|  13.6M|    counter++; // ASCII
   97|  13.6M|    counter += static_cast<size_t>(
   98|  13.6M|        word >
   99|  13.6M|        0x7F); // non-ASCII is at least 2 bytes, surrogates are 2*2 == 4 bytes
  100|  13.6M|    counter += static_cast<size_t>((word > 0x7FF && word <= 0xD7FF) ||
  ------------------
  |  Branch (100:37): [True: 9.48M, False: 4.16M]
  |  Branch (100:53): [True: 8.39M, False: 1.08M]
  ------------------
  101|  5.24M|                                   (word >= 0xE000)); // three-byte
  ------------------
  |  Branch (101:36): [True: 504k, False: 4.74M]
  ------------------
  102|  13.6M|  }
  103|  1.54M|  return counter;
  104|  1.54M|}
_ZN7simdutf6scalar5utf1622utf8_length_from_utf16ILNS_10endiannessE1EEEmPKDsm:
   91|  1.06M|                                                  size_t len) {
   92|       |  // We are not BOM aware.
   93|  1.06M|  size_t counter{0};
   94|  10.3M|  for (size_t i = 0; i < len; i++) {
  ------------------
  |  Branch (94:22): [True: 9.32M, False: 1.06M]
  ------------------
   95|  9.32M|    char16_t word = scalar::utf16::swap_if_needed<big_endian>(p[i]);
   96|  9.32M|    counter++; // ASCII
   97|  9.32M|    counter += static_cast<size_t>(
   98|  9.32M|        word >
   99|  9.32M|        0x7F); // non-ASCII is at least 2 bytes, surrogates are 2*2 == 4 bytes
  100|  9.32M|    counter += static_cast<size_t>((word > 0x7FF && word <= 0xD7FF) ||
  ------------------
  |  Branch (100:37): [True: 5.72M, False: 3.59M]
  |  Branch (100:53): [True: 4.82M, False: 899k]
  ------------------
  101|  4.49M|                                   (word >= 0xE000)); // three-byte
  ------------------
  |  Branch (101:36): [True: 544k, False: 3.95M]
  ------------------
  102|  9.32M|  }
  103|  1.06M|  return counter;
  104|  1.06M|}
_ZN7simdutf6scalar5utf1639utf8_length_from_utf16_with_replacementILNS_10endiannessE0EEENS_6resultEPKDsm:
  153|  3.38k|utf8_length_from_utf16_with_replacement(const char16_t *p, size_t len) {
  154|  3.38k|  bool any_surrogates = false;
  155|       |  // We are not BOM aware.
  156|  3.38k|  size_t counter{0};
  157|  25.7M|  for (size_t i = 0; i < len; i++) {
  ------------------
  |  Branch (157:22): [True: 25.7M, False: 3.38k]
  ------------------
  158|  25.7M|    if (is_high_surrogate<big_endian>(p[i])) {
  ------------------
  |  Branch (158:9): [True: 570k, False: 25.1M]
  ------------------
  159|   570k|      any_surrogates = true;
  160|       |      // surrogate pair
  161|   570k|      if (i + 1 < len && is_low_surrogate<big_endian>(p[i + 1])) {
  ------------------
  |  Branch (161:11): [True: 570k, False: 441]
  |  Branch (161:26): [True: 151k, False: 419k]
  ------------------
  162|   151k|        counter += 4;
  163|   151k|        i++; // skip low surrogate
  164|   419k|      } else {
  165|   419k|        counter += 3; // unpaired high surrogate replaced by U+FFFD
  166|   419k|      }
  167|   570k|      continue;
  168|  25.1M|    } else if (is_low_surrogate<big_endian>(p[i])) {
  ------------------
  |  Branch (168:16): [True: 353k, False: 24.7M]
  ------------------
  169|   353k|      any_surrogates = true;
  170|   353k|      counter += 3; // unpaired low surrogate replaced by U+FFFD
  171|   353k|      continue;
  172|   353k|    }
  173|  24.7M|    char16_t word = !match_system(big_endian) ? u16_swap_bytes(p[i]) : p[i];
  ------------------
  |  Branch (173:21): [Folded, False: 24.7M]
  ------------------
  174|  24.7M|    counter++; // at least 1 byte
  175|  24.7M|    counter +=
  176|  24.7M|        static_cast<size_t>(word > 0x7F); // non-ASCII is at least 2 bytes
  177|  24.7M|    counter += static_cast<size_t>(word > 0x7FF); // three-byte
  178|  24.7M|  }
  179|  3.38k|  return {any_surrogates ? error_code::SURROGATE : error_code::SUCCESS,
  ------------------
  |  Branch (179:11): [True: 1.67k, False: 1.70k]
  ------------------
  180|  3.38k|          counter};
  181|  3.38k|}
_ZN7simdutf6scalar5utf1639utf8_length_from_utf16_with_replacementILNS_10endiannessE1EEENS_6resultEPKDsm:
  153|  3.38k|utf8_length_from_utf16_with_replacement(const char16_t *p, size_t len) {
  154|  3.38k|  bool any_surrogates = false;
  155|       |  // We are not BOM aware.
  156|  3.38k|  size_t counter{0};
  157|  20.8M|  for (size_t i = 0; i < len; i++) {
  ------------------
  |  Branch (157:22): [True: 20.8M, False: 3.38k]
  ------------------
  158|  20.8M|    if (is_high_surrogate<big_endian>(p[i])) {
  ------------------
  |  Branch (158:9): [True: 418k, False: 20.4M]
  ------------------
  159|   418k|      any_surrogates = true;
  160|       |      // surrogate pair
  161|   418k|      if (i + 1 < len && is_low_surrogate<big_endian>(p[i + 1])) {
  ------------------
  |  Branch (161:11): [True: 418k, False: 417]
  |  Branch (161:26): [True: 93.4k, False: 324k]
  ------------------
  162|  93.4k|        counter += 4;
  163|  93.4k|        i++; // skip low surrogate
  164|   325k|      } else {
  165|   325k|        counter += 3; // unpaired high surrogate replaced by U+FFFD
  166|   325k|      }
  167|   418k|      continue;
  168|  20.4M|    } else if (is_low_surrogate<big_endian>(p[i])) {
  ------------------
  |  Branch (168:16): [True: 210k, False: 20.2M]
  ------------------
  169|   210k|      any_surrogates = true;
  170|   210k|      counter += 3; // unpaired low surrogate replaced by U+FFFD
  171|   210k|      continue;
  172|   210k|    }
  173|  20.2M|    char16_t word = !match_system(big_endian) ? u16_swap_bytes(p[i]) : p[i];
  ------------------
  |  Branch (173:21): [True: 20.2M, Folded]
  ------------------
  174|  20.2M|    counter++; // at least 1 byte
  175|  20.2M|    counter +=
  176|  20.2M|        static_cast<size_t>(word > 0x7F); // non-ASCII is at least 2 bytes
  177|  20.2M|    counter += static_cast<size_t>(word > 0x7FF); // three-byte
  178|  20.2M|  }
  179|  3.38k|  return {any_surrogates ? error_code::SURROGATE : error_code::SUCCESS,
  ------------------
  |  Branch (179:11): [True: 1.66k, False: 1.71k]
  ------------------
  180|  3.38k|          counter};
  181|  3.38k|}

simdutf.cpp:_ZN7simdutf6scalar12_GLOBAL__N_113utf16_to_utf819convert_with_errorsILNS_10endiannessE0ELb0EPKDsPcQaasr7simdutf6detailE18indexes_into_utf16IT1_Esr7simdutf6detailE26index_assignable_from_charIT2_EEENS_11full_resultES8_mS9_m:
  101|  7.13k|                                                    size_t utf8_len = 0) {
  102|  7.13k|  if (check_output && utf8_len == 0) {
  ------------------
  |  Branch (102:7): [Folded, False: 7.13k]
  |  Branch (102:23): [True: 0, False: 0]
  ------------------
  103|      0|    return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, 0, 0);
  104|      0|  }
  105|       |
  106|  7.13k|  size_t pos = 0;
  107|  7.13k|  auto start = utf8_output;
  108|  7.13k|  auto end = utf8_output + utf8_len;
  109|       |
  110|  29.4k|  while (pos < len) {
  ------------------
  |  Branch (110:10): [True: 27.8k, False: 1.60k]
  ------------------
  111|       |#if SIMDUTF_CPLUSPLUS23
  112|       |    if !consteval
  113|       |#endif
  114|  27.8k|    {
  115|       |      // try to convert the next block of 8 bytes
  116|  27.8k|      if (pos + 4 <= len) { // if it is safe to read 8 more bytes, check that
  ------------------
  |  Branch (116:11): [True: 22.3k, False: 5.54k]
  ------------------
  117|       |                            // they are ascii
  118|  22.3k|        uint64_t v;
  119|  22.3k|        ::memcpy(&v, data + pos, sizeof(uint64_t));
  120|       |        if constexpr (!match_system(big_endian))
  121|       |          v = (v >> 8) | (v << (64 - 8));
  122|  22.3k|        if ((v & 0xFF80FF80FF80FF80) == 0) {
  ------------------
  |  Branch (122:13): [True: 896, False: 21.4k]
  ------------------
  123|    896|          size_t final_pos = pos + 4;
  124|  4.48k|          while (pos < final_pos) {
  ------------------
  |  Branch (124:18): [True: 3.58k, False: 896]
  ------------------
  125|  3.58k|            if (check_output && size_t(end - utf8_output) < 1) {
  ------------------
  |  Branch (125:17): [Folded, False: 3.58k]
  |  Branch (125:33): [True: 0, False: 0]
  ------------------
  126|      0|              return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  127|      0|                                 utf8_output - start);
  128|      0|            }
  129|  3.58k|            *utf8_output++ = !match_system(big_endian)
  ------------------
  |  Branch (129:30): [Folded, False: 3.58k]
  ------------------
  130|  3.58k|                                 ? char(u16_swap_bytes(data[pos]))
  131|  3.58k|                                 : char(data[pos]);
  132|  3.58k|            pos++;
  133|  3.58k|          }
  134|    896|          continue;
  135|    896|        }
  136|  22.3k|      }
  137|  27.8k|    }
  138|       |
  139|  26.9k|    uint16_t word =
  140|  26.9k|        !match_system(big_endian) ? u16_swap_bytes(data[pos]) : data[pos];
  ------------------
  |  Branch (140:9): [Folded, False: 26.9k]
  ------------------
  141|  26.9k|    if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (141:9): [True: 3.16k, False: 23.8k]
  ------------------
  142|       |      // will generate one UTF-8 bytes
  143|  3.16k|      if (check_output && size_t(end - utf8_output) < 1) {
  ------------------
  |  Branch (143:11): [Folded, False: 3.16k]
  |  Branch (143:27): [True: 0, False: 0]
  ------------------
  144|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  145|      0|                           utf8_output - start);
  146|      0|      }
  147|  3.16k|      *utf8_output++ = char(word);
  148|  3.16k|      pos++;
  149|  23.8k|    } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (149:16): [True: 2.02k, False: 21.7k]
  ------------------
  150|       |      // will generate two UTF-8 bytes
  151|       |      // we have 0b110XXXXX 0b10XXXXXX
  152|  2.02k|      if (check_output && size_t(end - utf8_output) < 2) {
  ------------------
  |  Branch (152:11): [Folded, False: 2.02k]
  |  Branch (152:27): [True: 0, False: 0]
  ------------------
  153|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  154|      0|                           utf8_output - start);
  155|      0|      }
  156|  2.02k|      *utf8_output++ = char((word >> 6) | 0b11000000);
  157|  2.02k|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  158|  2.02k|      pos++;
  159|       |
  160|  21.7k|    } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (160:16): [True: 15.4k, False: 6.38k]
  ------------------
  161|       |      // will generate three UTF-8 bytes
  162|       |      // we have 0b1110XXXX 0b10XXXXXX 0b10XXXXXX
  163|  15.4k|      if (check_output && size_t(end - utf8_output) < 3) {
  ------------------
  |  Branch (163:11): [Folded, False: 15.4k]
  |  Branch (163:27): [True: 0, False: 0]
  ------------------
  164|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  165|      0|                           utf8_output - start);
  166|      0|      }
  167|  15.4k|      *utf8_output++ = char((word >> 12) | 0b11100000);
  168|  15.4k|      *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  169|  15.4k|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  170|  15.4k|      pos++;
  171|  15.4k|    } else {
  172|       |
  173|  6.38k|      if (check_output && size_t(end - utf8_output) < 4) {
  ------------------
  |  Branch (173:11): [Folded, False: 6.38k]
  |  Branch (173:27): [True: 0, False: 0]
  ------------------
  174|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  175|      0|                           utf8_output - start);
  176|      0|      }
  177|       |      // must be a surrogate pair
  178|  6.38k|      if (pos + 1 >= len) {
  ------------------
  |  Branch (178:11): [True: 650, False: 5.73k]
  ------------------
  179|    650|        return full_result(error_code::SURROGATE, pos, utf8_output - start);
  180|    650|      }
  181|  5.73k|      uint16_t diff = uint16_t(word - 0xD800);
  182|  5.73k|      if (diff > 0x3FF) {
  ------------------
  |  Branch (182:11): [True: 1.75k, False: 3.98k]
  ------------------
  183|  1.75k|        return full_result(error_code::SURROGATE, pos, utf8_output - start);
  184|  1.75k|      }
  185|  3.98k|      uint16_t next_word = !match_system(big_endian)
  ------------------
  |  Branch (185:28): [Folded, False: 3.98k]
  ------------------
  186|  3.98k|                               ? u16_swap_bytes(data[pos + 1])
  187|  3.98k|                               : data[pos + 1];
  188|  3.98k|      uint16_t diff2 = uint16_t(next_word - 0xDC00);
  189|  3.98k|      if (diff2 > 0x3FF) {
  ------------------
  |  Branch (189:11): [True: 3.13k, False: 848]
  ------------------
  190|  3.13k|        return full_result(error_code::SURROGATE, pos, utf8_output - start);
  191|  3.13k|      }
  192|    848|      uint32_t value = (diff << 10) + diff2 + 0x10000;
  193|       |      // will generate four UTF-8 bytes
  194|       |      // we have 0b11110XXX 0b10XXXXXX 0b10XXXXXX 0b10XXXXXX
  195|    848|      *utf8_output++ = char((value >> 18) | 0b11110000);
  196|    848|      *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  197|    848|      *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  198|    848|      *utf8_output++ = char((value & 0b111111) | 0b10000000);
  199|    848|      pos += 2;
  200|    848|    }
  201|  26.9k|  }
  202|  1.60k|  return full_result(error_code::SUCCESS, pos, utf8_output - start);
  203|  7.13k|}
simdutf.cpp:_ZN7simdutf6scalar12_GLOBAL__N_113utf16_to_utf819convert_with_errorsILNS_10endiannessE1ELb0EPKDsPcQaasr7simdutf6detailE18indexes_into_utf16IT1_Esr7simdutf6detailE26index_assignable_from_charIT2_EEENS_11full_resultES8_mS9_m:
  101|  7.55k|                                                    size_t utf8_len = 0) {
  102|  7.55k|  if (check_output && utf8_len == 0) {
  ------------------
  |  Branch (102:7): [Folded, False: 7.55k]
  |  Branch (102:23): [True: 0, False: 0]
  ------------------
  103|      0|    return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, 0, 0);
  104|      0|  }
  105|       |
  106|  7.55k|  size_t pos = 0;
  107|  7.55k|  auto start = utf8_output;
  108|  7.55k|  auto end = utf8_output + utf8_len;
  109|       |
  110|  29.4k|  while (pos < len) {
  ------------------
  |  Branch (110:10): [True: 27.8k, False: 1.61k]
  ------------------
  111|       |#if SIMDUTF_CPLUSPLUS23
  112|       |    if !consteval
  113|       |#endif
  114|  27.8k|    {
  115|       |      // try to convert the next block of 8 bytes
  116|  27.8k|      if (pos + 4 <= len) { // if it is safe to read 8 more bytes, check that
  ------------------
  |  Branch (116:11): [True: 22.3k, False: 5.50k]
  ------------------
  117|       |                            // they are ascii
  118|  22.3k|        uint64_t v;
  119|  22.3k|        ::memcpy(&v, data + pos, sizeof(uint64_t));
  120|       |        if constexpr (!match_system(big_endian))
  121|  22.3k|          v = (v >> 8) | (v << (64 - 8));
  122|  22.3k|        if ((v & 0xFF80FF80FF80FF80) == 0) {
  ------------------
  |  Branch (122:13): [True: 937, False: 21.3k]
  ------------------
  123|    937|          size_t final_pos = pos + 4;
  124|  4.68k|          while (pos < final_pos) {
  ------------------
  |  Branch (124:18): [True: 3.74k, False: 937]
  ------------------
  125|  3.74k|            if (check_output && size_t(end - utf8_output) < 1) {
  ------------------
  |  Branch (125:17): [Folded, False: 3.74k]
  |  Branch (125:33): [True: 0, False: 0]
  ------------------
  126|      0|              return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  127|      0|                                 utf8_output - start);
  128|      0|            }
  129|  3.74k|            *utf8_output++ = !match_system(big_endian)
  ------------------
  |  Branch (129:30): [True: 3.74k, Folded]
  ------------------
  130|  3.74k|                                 ? char(u16_swap_bytes(data[pos]))
  131|  3.74k|                                 : char(data[pos]);
  132|  3.74k|            pos++;
  133|  3.74k|          }
  134|    937|          continue;
  135|    937|        }
  136|  22.3k|      }
  137|  27.8k|    }
  138|       |
  139|  26.9k|    uint16_t word =
  140|  26.9k|        !match_system(big_endian) ? u16_swap_bytes(data[pos]) : data[pos];
  ------------------
  |  Branch (140:9): [True: 26.9k, Folded]
  ------------------
  141|  26.9k|    if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (141:9): [True: 2.88k, False: 24.0k]
  ------------------
  142|       |      // will generate one UTF-8 bytes
  143|  2.88k|      if (check_output && size_t(end - utf8_output) < 1) {
  ------------------
  |  Branch (143:11): [Folded, False: 2.88k]
  |  Branch (143:27): [True: 0, False: 0]
  ------------------
  144|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  145|      0|                           utf8_output - start);
  146|      0|      }
  147|  2.88k|      *utf8_output++ = char(word);
  148|  2.88k|      pos++;
  149|  24.0k|    } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (149:16): [True: 2.03k, False: 21.9k]
  ------------------
  150|       |      // will generate two UTF-8 bytes
  151|       |      // we have 0b110XXXXX 0b10XXXXXX
  152|  2.03k|      if (check_output && size_t(end - utf8_output) < 2) {
  ------------------
  |  Branch (152:11): [Folded, False: 2.03k]
  |  Branch (152:27): [True: 0, False: 0]
  ------------------
  153|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  154|      0|                           utf8_output - start);
  155|      0|      }
  156|  2.03k|      *utf8_output++ = char((word >> 6) | 0b11000000);
  157|  2.03k|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  158|  2.03k|      pos++;
  159|       |
  160|  21.9k|    } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (160:16): [True: 15.1k, False: 6.79k]
  ------------------
  161|       |      // will generate three UTF-8 bytes
  162|       |      // we have 0b1110XXXX 0b10XXXXXX 0b10XXXXXX
  163|  15.1k|      if (check_output && size_t(end - utf8_output) < 3) {
  ------------------
  |  Branch (163:11): [Folded, False: 15.1k]
  |  Branch (163:27): [True: 0, False: 0]
  ------------------
  164|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  165|      0|                           utf8_output - start);
  166|      0|      }
  167|  15.1k|      *utf8_output++ = char((word >> 12) | 0b11100000);
  168|  15.1k|      *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  169|  15.1k|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  170|  15.1k|      pos++;
  171|  15.1k|    } else {
  172|       |
  173|  6.79k|      if (check_output && size_t(end - utf8_output) < 4) {
  ------------------
  |  Branch (173:11): [Folded, False: 6.79k]
  |  Branch (173:27): [True: 0, False: 0]
  ------------------
  174|      0|        return full_result(error_code::OUTPUT_BUFFER_TOO_SMALL, pos,
  175|      0|                           utf8_output - start);
  176|      0|      }
  177|       |      // must be a surrogate pair
  178|  6.79k|      if (pos + 1 >= len) {
  ------------------
  |  Branch (178:11): [True: 636, False: 6.16k]
  ------------------
  179|    636|        return full_result(error_code::SURROGATE, pos, utf8_output - start);
  180|    636|      }
  181|  6.16k|      uint16_t diff = uint16_t(word - 0xD800);
  182|  6.16k|      if (diff > 0x3FF) {
  ------------------
  |  Branch (182:11): [True: 2.20k, False: 3.95k]
  ------------------
  183|  2.20k|        return full_result(error_code::SURROGATE, pos, utf8_output - start);
  184|  2.20k|      }
  185|  3.95k|      uint16_t next_word = !match_system(big_endian)
  ------------------
  |  Branch (185:28): [True: 3.95k, Folded]
  ------------------
  186|  3.95k|                               ? u16_swap_bytes(data[pos + 1])
  187|  3.95k|                               : data[pos + 1];
  188|  3.95k|      uint16_t diff2 = uint16_t(next_word - 0xDC00);
  189|  3.95k|      if (diff2 > 0x3FF) {
  ------------------
  |  Branch (189:11): [True: 3.10k, False: 853]
  ------------------
  190|  3.10k|        return full_result(error_code::SURROGATE, pos, utf8_output - start);
  191|  3.10k|      }
  192|    853|      uint32_t value = (diff << 10) + diff2 + 0x10000;
  193|       |      // will generate four UTF-8 bytes
  194|       |      // we have 0b11110XXX 0b10XXXXXX 0b10XXXXXX 0b10XXXXXX
  195|    853|      *utf8_output++ = char((value >> 18) | 0b11110000);
  196|    853|      *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  197|    853|      *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  198|    853|      *utf8_output++ = char((value & 0b111111) | 0b10000000);
  199|    853|      pos += 2;
  200|    853|    }
  201|  26.9k|  }
  202|  1.61k|  return full_result(error_code::SUCCESS, pos, utf8_output - start);
  203|  7.55k|}
simdutf.cpp:_ZN7simdutf6scalar12_GLOBAL__N_113utf16_to_utf824convert_with_replacementILNS_10endiannessE0EEEmPKDsmPc:
  214|  1.12k|                                                    char *utf8_output) {
  215|  1.12k|  size_t pos = 0;
  216|  1.12k|  char *start = utf8_output;
  217|  20.4M|  while (pos < len) {
  ------------------
  |  Branch (217:10): [True: 20.4M, False: 1.12k]
  ------------------
  218|       |#if SIMDUTF_CPLUSPLUS23
  219|       |    if !consteval
  220|       |#endif
  221|  20.4M|    {
  222|       |      // try to convert the next block of 8 bytes
  223|  20.4M|      if (pos + 4 <= len) { // if it is safe to read 8 more bytes, check that
  ------------------
  |  Branch (223:11): [True: 20.4M, False: 2.77k]
  ------------------
  224|       |                            // they are ascii
  225|  20.4M|        uint64_t v;
  226|  20.4M|        ::memcpy(&v, data + pos, sizeof(uint64_t));
  227|       |        if constexpr (!match_system(big_endian)) {
  228|       |          v = (v >> 8) | (v << (64 - 8));
  229|       |        }
  230|  20.4M|        if ((v & 0xFF80FF80FF80FF80) == 0) {
  ------------------
  |  Branch (230:13): [True: 1.74M, False: 18.6M]
  ------------------
  231|  1.74M|          size_t final_pos = pos + 4;
  232|  8.74M|          while (pos < final_pos) {
  ------------------
  |  Branch (232:18): [True: 6.99M, False: 1.74M]
  ------------------
  233|  6.99M|            *utf8_output++ = !match_system(big_endian)
  ------------------
  |  Branch (233:30): [Folded, False: 6.99M]
  ------------------
  234|  6.99M|                                 ? char(u16_swap_bytes(data[pos]))
  235|  6.99M|                                 : char(data[pos]);
  236|  6.99M|            pos++;
  237|  6.99M|          }
  238|  1.74M|          continue;
  239|  1.74M|        }
  240|  20.4M|      }
  241|  20.4M|    }
  242|  18.6M|    uint16_t word =
  243|  18.6M|        !match_system(big_endian) ? u16_swap_bytes(data[pos]) : data[pos];
  ------------------
  |  Branch (243:9): [Folded, False: 18.6M]
  ------------------
  244|  18.6M|    if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (244:9): [True: 592k, False: 18.1M]
  ------------------
  245|       |      // will generate one UTF-8 bytes
  246|   592k|      *utf8_output++ = char(word);
  247|   592k|      pos++;
  248|  18.1M|    } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (248:16): [True: 689k, False: 17.4M]
  ------------------
  249|       |      // will generate two UTF-8 bytes
  250|       |      // we have 0b110XXXXX 0b10XXXXXX
  251|   689k|      *utf8_output++ = char((word >> 6) | 0b11000000);
  252|   689k|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  253|   689k|      pos++;
  254|  17.4M|    } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (254:16): [True: 16.4M, False: 922k]
  ------------------
  255|       |      // will generate three UTF-8 bytes
  256|       |      // we have 0b1110XXXX 0b10XXXXXX 0b10XXXXXX
  257|  16.4M|      *utf8_output++ = char((word >> 12) | 0b11100000);
  258|  16.4M|      *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  259|  16.4M|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  260|  16.4M|      pos++;
  261|  16.4M|    } else {
  262|       |      // surrogate range
  263|   922k|      uint16_t diff = uint16_t(word - 0xD800);
  264|   922k|      if (diff <= 0x3FF && pos + 1 < len) {
  ------------------
  |  Branch (264:11): [True: 569k, False: 352k]
  |  Branch (264:28): [True: 569k, False: 147]
  ------------------
  265|       |        // high surrogate, check for valid pair
  266|   569k|        uint16_t next_word = !match_system(big_endian)
  ------------------
  |  Branch (266:30): [Folded, False: 569k]
  ------------------
  267|   569k|                                 ? u16_swap_bytes(data[pos + 1])
  268|   569k|                                 : data[pos + 1];
  269|   569k|        uint16_t diff2 = uint16_t(next_word - 0xDC00);
  270|   569k|        if (diff2 <= 0x3FF) {
  ------------------
  |  Branch (270:13): [True: 151k, False: 418k]
  ------------------
  271|       |          // valid surrogate pair
  272|   151k|          uint32_t value = (diff << 10) + diff2 + 0x10000;
  273|       |          // will generate four UTF-8 bytes
  274|   151k|          *utf8_output++ = char((value >> 18) | 0b11110000);
  275|   151k|          *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  276|   151k|          *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  277|   151k|          *utf8_output++ = char((value & 0b111111) | 0b10000000);
  278|   151k|          pos += 2;
  279|   151k|          continue;
  280|   151k|        }
  281|   569k|      }
  282|       |      // unpaired surrogate: replace with U+FFFD (0xEF 0xBF 0xBD)
  283|   771k|      *utf8_output++ = char(0xef);
  284|   771k|      *utf8_output++ = char(0xbf);
  285|   771k|      *utf8_output++ = char(0xbd);
  286|   771k|      pos++;
  287|   771k|    }
  288|  18.6M|  }
  289|  1.12k|  return utf8_output - start;
  290|  1.12k|}
simdutf.cpp:_ZN7simdutf6scalar12_GLOBAL__N_113utf16_to_utf824convert_with_replacementILNS_10endiannessE1EEEmPKDsmPc:
  214|  1.12k|                                                    char *utf8_output) {
  215|  1.12k|  size_t pos = 0;
  216|  1.12k|  char *start = utf8_output;
  217|  15.5M|  while (pos < len) {
  ------------------
  |  Branch (217:10): [True: 15.5M, False: 1.12k]
  ------------------
  218|       |#if SIMDUTF_CPLUSPLUS23
  219|       |    if !consteval
  220|       |#endif
  221|  15.5M|    {
  222|       |      // try to convert the next block of 8 bytes
  223|  15.5M|      if (pos + 4 <= len) { // if it is safe to read 8 more bytes, check that
  ------------------
  |  Branch (223:11): [True: 15.5M, False: 2.75k]
  ------------------
  224|       |                            // they are ascii
  225|  15.5M|        uint64_t v;
  226|  15.5M|        ::memcpy(&v, data + pos, sizeof(uint64_t));
  227|  15.5M|        if constexpr (!match_system(big_endian)) {
  228|  15.5M|          v = (v >> 8) | (v << (64 - 8));
  229|  15.5M|        }
  230|  15.5M|        if ((v & 0xFF80FF80FF80FF80) == 0) {
  ------------------
  |  Branch (230:13): [True: 1.75M, False: 13.8M]
  ------------------
  231|  1.75M|          size_t final_pos = pos + 4;
  232|  8.77M|          while (pos < final_pos) {
  ------------------
  |  Branch (232:18): [True: 7.01M, False: 1.75M]
  ------------------
  233|  7.01M|            *utf8_output++ = !match_system(big_endian)
  ------------------
  |  Branch (233:30): [True: 7.01M, Folded]
  ------------------
  234|  7.01M|                                 ? char(u16_swap_bytes(data[pos]))
  235|  7.01M|                                 : char(data[pos]);
  236|  7.01M|            pos++;
  237|  7.01M|          }
  238|  1.75M|          continue;
  239|  1.75M|        }
  240|  15.5M|      }
  241|  15.5M|    }
  242|  13.8M|    uint16_t word =
  243|  13.8M|        !match_system(big_endian) ? u16_swap_bytes(data[pos]) : data[pos];
  ------------------
  |  Branch (243:9): [True: 13.8M, Folded]
  ------------------
  244|  13.8M|    if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (244:9): [True: 245k, False: 13.5M]
  ------------------
  245|       |      // will generate one UTF-8 bytes
  246|   245k|      *utf8_output++ = char(word);
  247|   245k|      pos++;
  248|  13.5M|    } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (248:16): [True: 398k, False: 13.1M]
  ------------------
  249|       |      // will generate two UTF-8 bytes
  250|       |      // we have 0b110XXXXX 0b10XXXXXX
  251|   398k|      *utf8_output++ = char((word >> 6) | 0b11000000);
  252|   398k|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  253|   398k|      pos++;
  254|  13.1M|    } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (254:16): [True: 12.5M, False: 626k]
  ------------------
  255|       |      // will generate three UTF-8 bytes
  256|       |      // we have 0b1110XXXX 0b10XXXXXX 0b10XXXXXX
  257|  12.5M|      *utf8_output++ = char((word >> 12) | 0b11100000);
  258|  12.5M|      *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  259|  12.5M|      *utf8_output++ = char((word & 0b111111) | 0b10000000);
  260|  12.5M|      pos++;
  261|  12.5M|    } else {
  262|       |      // surrogate range
  263|   626k|      uint16_t diff = uint16_t(word - 0xD800);
  264|   626k|      if (diff <= 0x3FF && pos + 1 < len) {
  ------------------
  |  Branch (264:11): [True: 417k, False: 209k]
  |  Branch (264:28): [True: 416k, False: 139]
  ------------------
  265|       |        // high surrogate, check for valid pair
  266|   416k|        uint16_t next_word = !match_system(big_endian)
  ------------------
  |  Branch (266:30): [True: 416k, Folded]
  ------------------
  267|   416k|                                 ? u16_swap_bytes(data[pos + 1])
  268|   416k|                                 : data[pos + 1];
  269|   416k|        uint16_t diff2 = uint16_t(next_word - 0xDC00);
  270|   416k|        if (diff2 <= 0x3FF) {
  ------------------
  |  Branch (270:13): [True: 93.1k, False: 323k]
  ------------------
  271|       |          // valid surrogate pair
  272|  93.1k|          uint32_t value = (diff << 10) + diff2 + 0x10000;
  273|       |          // will generate four UTF-8 bytes
  274|  93.1k|          *utf8_output++ = char((value >> 18) | 0b11110000);
  275|  93.1k|          *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  276|  93.1k|          *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  277|  93.1k|          *utf8_output++ = char((value & 0b111111) | 0b10000000);
  278|  93.1k|          pos += 2;
  279|  93.1k|          continue;
  280|  93.1k|        }
  281|   416k|      }
  282|       |      // unpaired surrogate: replace with U+FFFD (0xEF 0xBF 0xBD)
  283|   533k|      *utf8_output++ = char(0xef);
  284|   533k|      *utf8_output++ = char(0xbf);
  285|   533k|      *utf8_output++ = char(0xbd);
  286|   533k|      pos++;
  287|   533k|    }
  288|  13.8M|  }
  289|  1.12k|  return utf8_output - start;
  290|  1.12k|}

simdutf.cpp:_ZN7simdutf6scalar12_GLOBAL__N_14utf88validateEPKcm:
  113|  2.25k|                                                        size_t len) noexcept {
  114|  2.25k|  return validate(reinterpret_cast<const uint8_t *>(buf), len);
  115|  2.25k|}
simdutf.cpp:_ZN7simdutf6scalar12_GLOBAL__N_14utf88validateIPKhEEbT_m:
   14|  2.25k|                                                      size_t len) noexcept {
   15|  2.25k|  static_assert(
   16|  2.25k|      std::is_same<typename std::decay<decltype(*data)>::type, uint8_t>::value,
   17|  2.25k|      "dereferencing the data pointer must result in a uint8_t");
   18|  2.25k|  uint64_t pos = 0;
   19|  2.25k|  uint32_t code_point = 0;
   20|  32.5M|  while (pos < len) {
  ------------------
  |  Branch (20:10): [True: 32.5M, False: 1.98k]
  ------------------
   21|  32.5M|    uint64_t next_pos;
   22|       |#if SIMDUTF_CPLUSPLUS23
   23|       |    if !consteval
   24|       |#endif
   25|  32.5M|    { // check if the next 16 bytes are ascii.
   26|  32.5M|      next_pos = pos + 16;
   27|  32.5M|      if (next_pos <= len) { // if it is safe to read 16 more bytes, check
  ------------------
  |  Branch (27:11): [True: 32.5M, False: 8.52k]
  ------------------
   28|       |                             // that they are ascii
   29|  32.5M|        uint64_t v1{};
   30|  32.5M|        std::memcpy(&v1, data + pos, sizeof(uint64_t));
   31|  32.5M|        uint64_t v2{};
   32|  32.5M|        std::memcpy(&v2, data + pos + sizeof(uint64_t), sizeof(uint64_t));
   33|  32.5M|        uint64_t v{v1 | v2};
   34|  32.5M|        if ((v & 0x8080808080808080) == 0) {
  ------------------
  |  Branch (34:13): [True: 833k, False: 31.6M]
  ------------------
   35|   833k|          pos = next_pos;
   36|   833k|          continue;
   37|   833k|        }
   38|  32.5M|      }
   39|  32.5M|    }
   40|       |
   41|  31.7M|    unsigned char byte = data[pos];
   42|       |
   43|  33.2M|    while (byte < 0b10000000) {
  ------------------
  |  Branch (43:12): [True: 1.51M, False: 31.6M]
  ------------------
   44|  1.51M|      if (++pos == len) {
  ------------------
  |  Branch (44:11): [True: 265, False: 1.51M]
  ------------------
   45|    265|        return true;
   46|    265|      }
   47|  1.51M|      byte = data[pos];
   48|  1.51M|    }
   49|       |
   50|  31.6M|    if ((byte & 0b11100000) == 0b11000000) {
  ------------------
  |  Branch (50:9): [True: 1.08M, False: 30.6M]
  ------------------
   51|  1.08M|      next_pos = pos + 2;
   52|  1.08M|      if (next_pos > len) {
  ------------------
  |  Branch (52:11): [True: 0, False: 1.08M]
  ------------------
   53|      0|        return false;
   54|      0|      }
   55|  1.08M|      if ((data[pos + 1] & 0b11000000) != 0b10000000) {
  ------------------
  |  Branch (55:11): [True: 0, False: 1.08M]
  ------------------
   56|      0|        return false;
   57|      0|      }
   58|       |      // range check
   59|  1.08M|      code_point = (byte & 0b00011111) << 6 | (data[pos + 1] & 0b00111111);
   60|  1.08M|      if (code_point < 0x80) {
  ------------------
  |  Branch (60:11): [True: 0, False: 1.08M]
  ------------------
   61|      0|        return false;
   62|      0|      }
   63|  30.6M|    } else if ((byte & 0b11110000) == 0b11100000) {
  ------------------
  |  Branch (63:16): [True: 30.3M, False: 244k]
  ------------------
   64|  30.3M|      next_pos = pos + 3;
   65|  30.3M|      if (next_pos > len) {
  ------------------
  |  Branch (65:11): [True: 0, False: 30.3M]
  ------------------
   66|      0|        return false;
   67|      0|      }
   68|  30.3M|      if ((data[pos + 1] & 0b11000000) != 0b10000000) {
  ------------------
  |  Branch (68:11): [True: 0, False: 30.3M]
  ------------------
   69|      0|        return false;
   70|      0|      }
   71|  30.3M|      if ((data[pos + 2] & 0b11000000) != 0b10000000) {
  ------------------
  |  Branch (71:11): [True: 0, False: 30.3M]
  ------------------
   72|      0|        return false;
   73|      0|      }
   74|       |      // range check
   75|  30.3M|      code_point = (byte & 0b00001111) << 12 |
   76|  30.3M|                   (data[pos + 1] & 0b00111111) << 6 |
   77|  30.3M|                   (data[pos + 2] & 0b00111111);
   78|  30.3M|      if ((code_point < 0x800) ||
  ------------------
  |  Branch (78:11): [True: 0, False: 30.3M]
  ------------------
   79|  30.3M|          (0xd7ff < code_point && code_point < 0xe000)) {
  ------------------
  |  Branch (79:12): [True: 3.49M, False: 26.8M]
  |  Branch (79:35): [True: 0, False: 3.49M]
  ------------------
   80|      0|        return false;
   81|      0|      }
   82|  30.3M|    } else if ((byte & 0b11111000) == 0b11110000) { // 0b11110000
  ------------------
  |  Branch (82:16): [True: 244k, False: 0]
  ------------------
   83|   244k|      next_pos = pos + 4;
   84|   244k|      if (next_pos > len) {
  ------------------
  |  Branch (84:11): [True: 0, False: 244k]
  ------------------
   85|      0|        return false;
   86|      0|      }
   87|   244k|      if ((data[pos + 1] & 0b11000000) != 0b10000000) {
  ------------------
  |  Branch (87:11): [True: 0, False: 244k]
  ------------------
   88|      0|        return false;
   89|      0|      }
   90|   244k|      if ((data[pos + 2] & 0b11000000) != 0b10000000) {
  ------------------
  |  Branch (90:11): [True: 0, False: 244k]
  ------------------
   91|      0|        return false;
   92|      0|      }
   93|   244k|      if ((data[pos + 3] & 0b11000000) != 0b10000000) {
  ------------------
  |  Branch (93:11): [True: 0, False: 244k]
  ------------------
   94|      0|        return false;
   95|      0|      }
   96|       |      // range check
   97|   244k|      code_point =
   98|   244k|          (byte & 0b00000111) << 18 | (data[pos + 1] & 0b00111111) << 12 |
   99|   244k|          (data[pos + 2] & 0b00111111) << 6 | (data[pos + 3] & 0b00111111);
  100|   244k|      if (code_point <= 0xffff || 0x10ffff < code_point) {
  ------------------
  |  Branch (100:11): [True: 0, False: 244k]
  |  Branch (100:35): [True: 0, False: 244k]
  ------------------
  101|      0|        return false;
  102|      0|      }
  103|   244k|    } else {
  104|       |      // we may have a continuation
  105|      0|      return false;
  106|      0|    }
  107|  31.6M|    pos = next_pos;
  108|  31.6M|  }
  109|  1.98k|  return true;
  110|  2.25k|}

_ZNK7simdutf8fallback14implementation13validate_utf8EPKcm:
   37|  2.25k|implementation::validate_utf8(const char *buf, size_t len) const noexcept {
   38|  2.25k|  return scalar::utf8::validate(buf, len);
   39|  2.25k|}
_ZNK7simdutf8fallback14implementation24utf8_length_from_utf16leEPKDsm:
  452|    396|    const char16_t *input, size_t length) const noexcept {
  453|    396|  return scalar::utf16::utf8_length_from_utf16<endianness::LITTLE>(input,
  454|    396|                                                                   length);
  455|    396|}
_ZNK7simdutf8fallback14implementation24utf8_length_from_utf16beEPKDsm:
  458|    380|    const char16_t *input, size_t length) const noexcept {
  459|    380|  return scalar::utf16::utf8_length_from_utf16<endianness::BIG>(input, length);
  460|    380|}
_ZNK7simdutf8fallback14implementation41utf8_length_from_utf16le_with_replacementEPKDsm:
  483|  1.12k|    const char16_t *input, size_t length) const noexcept {
  484|  1.12k|  return scalar::utf16::utf8_length_from_utf16_with_replacement<
  485|  1.12k|      endianness::LITTLE>(input, length);
  486|  1.12k|}
_ZNK7simdutf8fallback14implementation41utf8_length_from_utf16be_with_replacementEPKDsm:
  490|  1.12k|    const char16_t *input, size_t length) const noexcept {
  491|  1.12k|  return scalar::utf16::utf8_length_from_utf16_with_replacement<
  492|  1.12k|      endianness::BIG>(input, length);
  493|  1.12k|}
_ZNK7simdutf8fallback14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPc:
  497|  1.12k|    const char16_t *input, size_t length, char *utf8_buffer) const noexcept {
  498|  1.12k|  return scalar::utf16_to_utf8::convert_with_replacement<endianness::LITTLE>(
  499|  1.12k|      input, length, utf8_buffer);
  500|  1.12k|}
_ZNK7simdutf8fallback14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPc:
  504|  1.12k|    const char16_t *input, size_t length, char *utf8_buffer) const noexcept {
  505|  1.12k|  return scalar::utf16_to_utf8::convert_with_replacement<endianness::BIG>(
  506|  1.12k|      input, length, utf8_buffer);
  507|  1.12k|}

simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_116buf_block_readerILm64EE13get_remainderEPh:
   57|  2.25k|buf_block_reader<STEP_SIZE>::get_remainder(uint8_t *dst) const {
   58|  2.25k|  if (len == idx) {
  ------------------
  |  Branch (58:7): [True: 4, False: 2.25k]
  ------------------
   59|      4|    return 0;
   60|      4|  } // memcpy(dst, null, 0) will trigger an error with some sanitizers
   61|  2.25k|  std::memset(dst, 0x20,
   62|  2.25k|              STEP_SIZE); // std::memset STEP_SIZE because it is more efficient
   63|       |                          // to write out 8 or 16 bytes at once.
   64|  2.25k|  std::memcpy(dst, buf + idx, len - idx);
   65|  2.25k|  return len - idx;
   66|  2.25k|}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_116buf_block_readerILm64EE13get_remainderEPh:
   57|  2.25k|buf_block_reader<STEP_SIZE>::get_remainder(uint8_t *dst) const {
   58|  2.25k|  if (len == idx) {
  ------------------
  |  Branch (58:7): [True: 4, False: 2.25k]
  ------------------
   59|      4|    return 0;
   60|      4|  } // memcpy(dst, null, 0) will trigger an error with some sanitizers
   61|  2.25k|  std::memset(dst, 0x20,
   62|  2.25k|              STEP_SIZE); // std::memset STEP_SIZE because it is more efficient
   63|       |                          // to write out 8 or 16 bytes at once.
   64|  2.25k|  std::memcpy(dst, buf + idx, len - idx);
   65|  2.25k|  return len - idx;
   66|  2.25k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_116buf_block_readerILm64EEC2EPKhm:
   36|  2.25k|    : buf{_buf}, len{_len}, lenminusstep{len < STEP_SIZE ? 0 : len - STEP_SIZE},
  ------------------
  |  Branch (36:42): [True: 1.53k, False: 718]
  ------------------
   37|  2.25k|      idx{0} {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_116buf_block_readerILm64EE14has_full_blockEv:
   45|  1.70M|simdutf_really_inline bool buf_block_reader<STEP_SIZE>::has_full_block() const {
   46|  1.70M|  return idx < lenminusstep;
   47|  1.70M|}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_116buf_block_readerILm64EE10full_blockEv:
   51|  1.70M|buf_block_reader<STEP_SIZE>::full_block() const {
   52|  1.70M|  return &buf[idx];
   53|  1.70M|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_116buf_block_readerILm64EE7advanceEv:
   69|  1.70M|simdutf_really_inline void buf_block_reader<STEP_SIZE>::advance() {
   70|  1.70M|  idx += STEP_SIZE;
   71|  1.70M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_116buf_block_readerILm64EEC2EPKhm:
   36|  2.25k|    : buf{_buf}, len{_len}, lenminusstep{len < STEP_SIZE ? 0 : len - STEP_SIZE},
  ------------------
  |  Branch (36:42): [True: 1.53k, False: 718]
  ------------------
   37|  2.25k|      idx{0} {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_116buf_block_readerILm64EE14has_full_blockEv:
   45|  1.70M|simdutf_really_inline bool buf_block_reader<STEP_SIZE>::has_full_block() const {
   46|  1.70M|  return idx < lenminusstep;
   47|  1.70M|}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_116buf_block_readerILm64EE10full_blockEv:
   51|  1.70M|buf_block_reader<STEP_SIZE>::full_block() const {
   52|  1.70M|  return &buf[idx];
   53|  1.70M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_116buf_block_readerILm64EE7advanceEv:
   69|  1.70M|simdutf_really_inline void buf_block_reader<STEP_SIZE>::advance() {
   70|  1.70M|  idx += STEP_SIZE;
   71|  1.70M|}

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_15utf1631utf8_length_from_utf16_bytemaskILNS_10endiannessE0EEEmPKDsm:
   10|   771k|                                                             size_t size) {
   11|   771k|  size_t pos = 0;
   12|       |
   13|   771k|  using vector_u16 = simd16<uint16_t>;
   14|   771k|  constexpr size_t N = vector_u16::ELEMENTS;
   15|       |
   16|   771k|  const auto one = vector_u16::splat(1);
   17|       |
   18|   771k|  auto v_count = vector_u16::zero();
   19|       |
   20|       |  // each char16 yields at least one byte
   21|   771k|  size_t count = size / N * N;
   22|       |
   23|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
   24|       |  // three additions
   25|   771k|  constexpr size_t max_iterations = 65535 / 2;
   26|   771k|  size_t iteration = max_iterations;
   27|       |
   28|  2.02M|  for (; pos < size / N * N; pos += N) {
  ------------------
  |  Branch (28:10): [True: 1.24M, False: 771k]
  ------------------
   29|  1.24M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
   30|       |    if constexpr (!match_system(big_endian)) {
   31|       |      input = input.swap_bytes();
   32|       |    }
   33|       |    // 0xd800 .. 0xdbff - low surrogate
   34|       |    // 0xdc00 .. 0xdfff - high surrogate
   35|  1.24M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
   36|       |
   37|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
   38|  1.24M|    const auto c0 = min(input & uint16_t(0xff80), one);
   39|       |
   40|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
   41|  1.24M|    const auto c1 = min(input & uint16_t(0xf800), one);
   42|       |
   43|       |    /*
   44|       |        Explanation how the counting works.
   45|       |
   46|       |        In the case of a non-surrogate character we count:
   47|       |        * always 1 -- see how `count` is initialized above;
   48|       |        * c0 = 1 if the current char yields 2 or 3 bytes;
   49|       |        * c1 = 1 if the current char yields 3 bytes.
   50|       |
   51|       |        Thus, we always have correct count for the current char:
   52|       |        from 1, 2 or 3 bytes.
   53|       |
   54|       |        A trickier part is how we count surrogate pairs. Whether
   55|       |        we encounter a surrogate (low or high), we count it as
   56|       |        3 chars and then minus 1 (`is_surrogate` is -1 or 0).
   57|       |        Each surrogate char yields 2. A surrogate pair, that
   58|       |        is a low surrogate followed by a high one, yields
   59|       |        the expected 4 bytes.
   60|       |
   61|       |        It also correctly handles cases when low surrogate is
   62|       |        processed by the this loop, but high surrogate is counted
   63|       |        by the scalar procedure. The scalar procedure uses exactly
   64|       |        the described approach, thanks to that for valid UTF-16
   65|       |        strings it always count correctly.
   66|       |    */
   67|  1.24M|    v_count += c0;
   68|  1.24M|    v_count += c1;
   69|  1.24M|    v_count += vector_u16(is_surrogate);
   70|       |
   71|  1.24M|    iteration -= 1;
   72|  1.24M|    if (iteration == 0) {
  ------------------
  |  Branch (72:9): [True: 17, False: 1.24M]
  ------------------
   73|     17|      count += v_count.sum();
   74|     17|      v_count = vector_u16::zero();
   75|     17|      iteration = max_iterations;
   76|     17|    }
   77|  1.24M|  }
   78|       |
   79|   771k|  if (iteration > 0) {
  ------------------
  |  Branch (79:7): [True: 771k, False: 0]
  ------------------
   80|   771k|    count += v_count.sum();
   81|   771k|  }
   82|       |
   83|   771k|  return count + scalar::utf16::utf8_length_from_utf16<big_endian>(in + pos,
   84|   771k|                                                                   size - pos);
   85|   771k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_15utf1631utf8_length_from_utf16_bytemaskILNS_10endiannessE1EEEmPKDsm:
   10|   533k|                                                             size_t size) {
   11|   533k|  size_t pos = 0;
   12|       |
   13|   533k|  using vector_u16 = simd16<uint16_t>;
   14|   533k|  constexpr size_t N = vector_u16::ELEMENTS;
   15|       |
   16|   533k|  const auto one = vector_u16::splat(1);
   17|       |
   18|   533k|  auto v_count = vector_u16::zero();
   19|       |
   20|       |  // each char16 yields at least one byte
   21|   533k|  size_t count = size / N * N;
   22|       |
   23|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
   24|       |  // three additions
   25|   533k|  constexpr size_t max_iterations = 65535 / 2;
   26|   533k|  size_t iteration = max_iterations;
   27|       |
   28|  1.43M|  for (; pos < size / N * N; pos += N) {
  ------------------
  |  Branch (28:10): [True: 899k, False: 533k]
  ------------------
   29|   899k|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
   30|   899k|    if constexpr (!match_system(big_endian)) {
   31|   899k|      input = input.swap_bytes();
   32|   899k|    }
   33|       |    // 0xd800 .. 0xdbff - low surrogate
   34|       |    // 0xdc00 .. 0xdfff - high surrogate
   35|   899k|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
   36|       |
   37|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
   38|   899k|    const auto c0 = min(input & uint16_t(0xff80), one);
   39|       |
   40|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
   41|   899k|    const auto c1 = min(input & uint16_t(0xf800), one);
   42|       |
   43|       |    /*
   44|       |        Explanation how the counting works.
   45|       |
   46|       |        In the case of a non-surrogate character we count:
   47|       |        * always 1 -- see how `count` is initialized above;
   48|       |        * c0 = 1 if the current char yields 2 or 3 bytes;
   49|       |        * c1 = 1 if the current char yields 3 bytes.
   50|       |
   51|       |        Thus, we always have correct count for the current char:
   52|       |        from 1, 2 or 3 bytes.
   53|       |
   54|       |        A trickier part is how we count surrogate pairs. Whether
   55|       |        we encounter a surrogate (low or high), we count it as
   56|       |        3 chars and then minus 1 (`is_surrogate` is -1 or 0).
   57|       |        Each surrogate char yields 2. A surrogate pair, that
   58|       |        is a low surrogate followed by a high one, yields
   59|       |        the expected 4 bytes.
   60|       |
   61|       |        It also correctly handles cases when low surrogate is
   62|       |        processed by the this loop, but high surrogate is counted
   63|       |        by the scalar procedure. The scalar procedure uses exactly
   64|       |        the described approach, thanks to that for valid UTF-16
   65|       |        strings it always count correctly.
   66|       |    */
   67|   899k|    v_count += c0;
   68|   899k|    v_count += c1;
   69|   899k|    v_count += vector_u16(is_surrogate);
   70|       |
   71|   899k|    iteration -= 1;
   72|   899k|    if (iteration == 0) {
  ------------------
  |  Branch (72:9): [True: 8, False: 899k]
  ------------------
   73|      8|      count += v_count.sum();
   74|      8|      v_count = vector_u16::zero();
   75|      8|      iteration = max_iterations;
   76|      8|    }
   77|   899k|  }
   78|       |
   79|   533k|  if (iteration > 0) {
  ------------------
  |  Branch (79:7): [True: 533k, False: 0]
  ------------------
   80|   533k|    count += v_count.sum();
   81|   533k|  }
   82|       |
   83|   533k|  return count + scalar::utf16::utf8_length_from_utf16<big_endian>(in + pos,
   84|   533k|                                                                   size - pos);
   85|   533k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_15utf1639utf8_length_from_utf16_with_replacementILNS_10endiannessE0EEENS_6resultEPKDsm:
   89|  1.12k|utf8_length_from_utf16_with_replacement(const char16_t *in, size_t size) {
   90|  1.12k|  using vector_u16 = simd16<uint16_t>;
   91|  1.12k|  constexpr size_t N = vector_u16::ELEMENTS;
   92|  1.12k|  if (N + 1 > size) {
  ------------------
  |  Branch (92:7): [True: 505, False: 622]
  ------------------
   93|    505|    return scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
   94|    505|        in, size);
   95|    505|  } // special case for short inputs
   96|    622|  size_t pos = 0;
   97|    622|  bool any_surrogates = false;
   98|       |
   99|    622|  const auto one = vector_u16::splat(1);
  100|       |
  101|    622|  auto v_count = vector_u16::zero();
  102|    622|  auto v_mismatched_count = vector_u16::zero();
  103|       |
  104|    622|  size_t count = 0;
  105|    622|  size_t mismatched_count = 0;
  106|       |
  107|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
  108|       |  // three additions
  109|    622|  constexpr size_t max_iterations = 65535 / 2;
  110|    622|  size_t iteration = max_iterations;
  111|       |
  112|    622|  if (scalar::utf16::is_low_surrogate<big_endian>(in[0])) {
  ------------------
  |  Branch (112:7): [True: 46, False: 576]
  ------------------
  113|     46|    any_surrogates = true;
  114|     46|    mismatched_count += 1;
  115|     46|  }
  116|       |
  117|  1.61M|  for (; pos < (size - 1) / N * N; pos += N) {
  ------------------
  |  Branch (117:10): [True: 1.61M, False: 622]
  ------------------
  118|  1.61M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
  119|       |    if constexpr (!match_system(big_endian)) {
  120|       |      input = input.swap_bytes();
  121|       |    }
  122|       |    // 0xd800 .. 0xdbff - low surrogate
  123|       |    // 0xdc00 .. 0xdfff - high surrogate
  124|  1.61M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
  125|       |
  126|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
  127|  1.61M|    const auto c0 = min(input & uint16_t(0xff80), one);
  128|       |
  129|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
  130|  1.61M|    const auto c1 = min(input & uint16_t(0xf800), one);
  131|       |
  132|  1.61M|    v_count += c0;
  133|  1.61M|    v_count += c1;
  134|  1.61M|    v_count += vector_u16(is_surrogate);
  135|  1.61M|    if (is_surrogate.to_bitmask() != 0 ||
  ------------------
  |  Branch (135:9): [True: 192k, False: 1.42M]
  ------------------
  136|  1.42M|        scalar::utf16::is_low_surrogate<big_endian>(in[pos + N])) {
  ------------------
  |  Branch (136:9): [True: 2.53k, False: 1.42M]
  ------------------
  137|   194k|      any_surrogates = true;
  138|   194k|      auto input_next =
  139|   194k|          vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos + 1));
  140|       |      if constexpr (!match_system(big_endian)) {
  141|       |        input_next = input_next.swap_bytes();
  142|       |      }
  143|       |
  144|   194k|      const auto lb_masked = input & (0xfc00);
  145|   194k|      const auto block_masked = input_next & (0xfc00);
  146|       |
  147|   194k|      const auto lb_is_high = lb_masked == (0xd800);
  148|   194k|      const auto block_is_low = block_masked == (0xdc00);
  149|       |
  150|   194k|      const auto illseq = min(vector_u16(lb_is_high ^ block_is_low), one);
  151|       |
  152|   194k|      v_mismatched_count += illseq;
  153|   194k|    }
  154|       |
  155|  1.61M|    iteration -= 1;
  156|  1.61M|    if (iteration == 0) {
  ------------------
  |  Branch (156:9): [True: 33, False: 1.61M]
  ------------------
  157|     33|      count += v_count.sum();
  158|     33|      v_count = vector_u16::zero();
  159|     33|      mismatched_count += v_mismatched_count.sum();
  160|     33|      v_mismatched_count = vector_u16::zero();
  161|     33|      iteration = max_iterations;
  162|     33|    }
  163|  1.61M|  }
  164|       |
  165|    622|  if (iteration > 0) {
  ------------------
  |  Branch (165:7): [True: 622, False: 0]
  ------------------
  166|    622|    count += v_count.sum();
  167|    622|    mismatched_count += v_mismatched_count.sum();
  168|    622|  }
  169|       |
  170|    622|  if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (170:7): [True: 105, False: 517]
  ------------------
  171|    105|    any_surrogates = true;
  172|    105|    if (!scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (172:9): [True: 70, False: 35]
  ------------------
  173|     70|      mismatched_count -= 1;
  174|     70|      count += 2;
  175|     70|      pos += 1;
  176|     70|    }
  177|    105|  }
  178|    622|  count += pos;
  179|    622|  count += mismatched_count;
  180|    622|  if (scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (180:7): [True: 122, False: 500]
  ------------------
  181|    122|    any_surrogates = true;
  182|    122|    if (pos == size) {
  ------------------
  |  Branch (182:9): [True: 0, False: 122]
  ------------------
  183|      0|      count += 2;
  184|    122|    } else if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (184:16): [True: 35, False: 87]
  ------------------
  185|     35|      pos += 1;
  186|     35|      count += 2;
  187|     35|    }
  188|    122|  }
  189|    622|  result scalar_result =
  190|    622|      scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
  191|    622|          in + pos, size - pos);
  192|    622|  return {any_surrogates ? SURROGATE : scalar_result.error,
  ------------------
  |  Branch (192:11): [True: 373, False: 249]
  ------------------
  193|    622|          count + scalar_result.count};
  194|  1.12k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_15utf1639utf8_length_from_utf16_with_replacementILNS_10endiannessE1EEENS_6resultEPKDsm:
   89|  1.12k|utf8_length_from_utf16_with_replacement(const char16_t *in, size_t size) {
   90|  1.12k|  using vector_u16 = simd16<uint16_t>;
   91|  1.12k|  constexpr size_t N = vector_u16::ELEMENTS;
   92|  1.12k|  if (N + 1 > size) {
  ------------------
  |  Branch (92:7): [True: 512, False: 615]
  ------------------
   93|    512|    return scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
   94|    512|        in, size);
   95|    512|  } // special case for short inputs
   96|    615|  size_t pos = 0;
   97|    615|  bool any_surrogates = false;
   98|       |
   99|    615|  const auto one = vector_u16::splat(1);
  100|       |
  101|    615|  auto v_count = vector_u16::zero();
  102|    615|  auto v_mismatched_count = vector_u16::zero();
  103|       |
  104|    615|  size_t count = 0;
  105|    615|  size_t mismatched_count = 0;
  106|       |
  107|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
  108|       |  // three additions
  109|    615|  constexpr size_t max_iterations = 65535 / 2;
  110|    615|  size_t iteration = max_iterations;
  111|       |
  112|    615|  if (scalar::utf16::is_low_surrogate<big_endian>(in[0])) {
  ------------------
  |  Branch (112:7): [True: 45, False: 570]
  ------------------
  113|     45|    any_surrogates = true;
  114|     45|    mismatched_count += 1;
  115|     45|  }
  116|       |
  117|  1.30M|  for (; pos < (size - 1) / N * N; pos += N) {
  ------------------
  |  Branch (117:10): [True: 1.30M, False: 615]
  ------------------
  118|  1.30M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
  119|  1.30M|    if constexpr (!match_system(big_endian)) {
  120|  1.30M|      input = input.swap_bytes();
  121|  1.30M|    }
  122|       |    // 0xd800 .. 0xdbff - low surrogate
  123|       |    // 0xdc00 .. 0xdfff - high surrogate
  124|  1.30M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
  125|       |
  126|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
  127|  1.30M|    const auto c0 = min(input & uint16_t(0xff80), one);
  128|       |
  129|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
  130|  1.30M|    const auto c1 = min(input & uint16_t(0xf800), one);
  131|       |
  132|  1.30M|    v_count += c0;
  133|  1.30M|    v_count += c1;
  134|  1.30M|    v_count += vector_u16(is_surrogate);
  135|  1.30M|    if (is_surrogate.to_bitmask() != 0 ||
  ------------------
  |  Branch (135:9): [True: 121k, False: 1.18M]
  ------------------
  136|  1.18M|        scalar::utf16::is_low_surrogate<big_endian>(in[pos + N])) {
  ------------------
  |  Branch (136:9): [True: 1.74k, False: 1.18M]
  ------------------
  137|   123k|      any_surrogates = true;
  138|   123k|      auto input_next =
  139|   123k|          vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos + 1));
  140|   123k|      if constexpr (!match_system(big_endian)) {
  141|   123k|        input_next = input_next.swap_bytes();
  142|   123k|      }
  143|       |
  144|   123k|      const auto lb_masked = input & (0xfc00);
  145|   123k|      const auto block_masked = input_next & (0xfc00);
  146|       |
  147|   123k|      const auto lb_is_high = lb_masked == (0xd800);
  148|   123k|      const auto block_is_low = block_masked == (0xdc00);
  149|       |
  150|   123k|      const auto illseq = min(vector_u16(lb_is_high ^ block_is_low), one);
  151|       |
  152|   123k|      v_mismatched_count += illseq;
  153|   123k|    }
  154|       |
  155|  1.30M|    iteration -= 1;
  156|  1.30M|    if (iteration == 0) {
  ------------------
  |  Branch (156:9): [True: 21, False: 1.30M]
  ------------------
  157|     21|      count += v_count.sum();
  158|     21|      v_count = vector_u16::zero();
  159|     21|      mismatched_count += v_mismatched_count.sum();
  160|     21|      v_mismatched_count = vector_u16::zero();
  161|     21|      iteration = max_iterations;
  162|     21|    }
  163|  1.30M|  }
  164|       |
  165|    615|  if (iteration > 0) {
  ------------------
  |  Branch (165:7): [True: 615, False: 0]
  ------------------
  166|    615|    count += v_count.sum();
  167|    615|    mismatched_count += v_mismatched_count.sum();
  168|    615|  }
  169|       |
  170|    615|  if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (170:7): [True: 121, False: 494]
  ------------------
  171|    121|    any_surrogates = true;
  172|    121|    if (!scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (172:9): [True: 84, False: 37]
  ------------------
  173|     84|      mismatched_count -= 1;
  174|     84|      count += 2;
  175|     84|      pos += 1;
  176|     84|    }
  177|    121|  }
  178|    615|  count += pos;
  179|    615|  count += mismatched_count;
  180|    615|  if (scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (180:7): [True: 120, False: 495]
  ------------------
  181|    120|    any_surrogates = true;
  182|    120|    if (pos == size) {
  ------------------
  |  Branch (182:9): [True: 0, False: 120]
  ------------------
  183|      0|      count += 2;
  184|    120|    } else if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (184:16): [True: 37, False: 83]
  ------------------
  185|     37|      pos += 1;
  186|     37|      count += 2;
  187|     37|    }
  188|    120|  }
  189|    615|  result scalar_result =
  190|    615|      scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
  191|    615|          in + pos, size - pos);
  192|    615|  return {any_surrogates ? SURROGATE : scalar_result.error,
  ------------------
  |  Branch (192:11): [True: 390, False: 225]
  ------------------
  193|    615|          count + scalar_result.count};
  194|  1.12k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_15utf1631utf8_length_from_utf16_bytemaskILNS_10endiannessE0EEEmPKDsm:
   10|   771k|                                                             size_t size) {
   11|   771k|  size_t pos = 0;
   12|       |
   13|   771k|  using vector_u16 = simd16<uint16_t>;
   14|   771k|  constexpr size_t N = vector_u16::ELEMENTS;
   15|       |
   16|   771k|  const auto one = vector_u16::splat(1);
   17|       |
   18|   771k|  auto v_count = vector_u16::zero();
   19|       |
   20|       |  // each char16 yields at least one byte
   21|   771k|  size_t count = size / N * N;
   22|       |
   23|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
   24|       |  // three additions
   25|   771k|  constexpr size_t max_iterations = 65535 / 2;
   26|   771k|  size_t iteration = max_iterations;
   27|       |
   28|  3.33M|  for (; pos < size / N * N; pos += N) {
  ------------------
  |  Branch (28:10): [True: 2.56M, False: 771k]
  ------------------
   29|  2.56M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
   30|       |    if constexpr (!match_system(big_endian)) {
   31|       |      input = input.swap_bytes();
   32|       |    }
   33|       |    // 0xd800 .. 0xdbff - low surrogate
   34|       |    // 0xdc00 .. 0xdfff - high surrogate
   35|  2.56M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
   36|       |
   37|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
   38|  2.56M|    const auto c0 = min(input & uint16_t(0xff80), one);
   39|       |
   40|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
   41|  2.56M|    const auto c1 = min(input & uint16_t(0xf800), one);
   42|       |
   43|       |    /*
   44|       |        Explanation how the counting works.
   45|       |
   46|       |        In the case of a non-surrogate character we count:
   47|       |        * always 1 -- see how `count` is initialized above;
   48|       |        * c0 = 1 if the current char yields 2 or 3 bytes;
   49|       |        * c1 = 1 if the current char yields 3 bytes.
   50|       |
   51|       |        Thus, we always have correct count for the current char:
   52|       |        from 1, 2 or 3 bytes.
   53|       |
   54|       |        A trickier part is how we count surrogate pairs. Whether
   55|       |        we encounter a surrogate (low or high), we count it as
   56|       |        3 chars and then minus 1 (`is_surrogate` is -1 or 0).
   57|       |        Each surrogate char yields 2. A surrogate pair, that
   58|       |        is a low surrogate followed by a high one, yields
   59|       |        the expected 4 bytes.
   60|       |
   61|       |        It also correctly handles cases when low surrogate is
   62|       |        processed by the this loop, but high surrogate is counted
   63|       |        by the scalar procedure. The scalar procedure uses exactly
   64|       |        the described approach, thanks to that for valid UTF-16
   65|       |        strings it always count correctly.
   66|       |    */
   67|  2.56M|    v_count += c0;
   68|  2.56M|    v_count += c1;
   69|  2.56M|    v_count += vector_u16(is_surrogate);
   70|       |
   71|  2.56M|    iteration -= 1;
   72|  2.56M|    if (iteration == 0) {
  ------------------
  |  Branch (72:9): [True: 41, False: 2.56M]
  ------------------
   73|     41|      count += v_count.sum();
   74|     41|      v_count = vector_u16::zero();
   75|     41|      iteration = max_iterations;
   76|     41|    }
   77|  2.56M|  }
   78|       |
   79|   771k|  if (iteration > 0) {
  ------------------
  |  Branch (79:7): [True: 771k, False: 0]
  ------------------
   80|   771k|    count += v_count.sum();
   81|   771k|  }
   82|       |
   83|   771k|  return count + scalar::utf16::utf8_length_from_utf16<big_endian>(in + pos,
   84|   771k|                                                                   size - pos);
   85|   771k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_15utf1631utf8_length_from_utf16_bytemaskILNS_10endiannessE1EEEmPKDsm:
   10|   533k|                                                             size_t size) {
   11|   533k|  size_t pos = 0;
   12|       |
   13|   533k|  using vector_u16 = simd16<uint16_t>;
   14|   533k|  constexpr size_t N = vector_u16::ELEMENTS;
   15|       |
   16|   533k|  const auto one = vector_u16::splat(1);
   17|       |
   18|   533k|  auto v_count = vector_u16::zero();
   19|       |
   20|       |  // each char16 yields at least one byte
   21|   533k|  size_t count = size / N * N;
   22|       |
   23|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
   24|       |  // three additions
   25|   533k|  constexpr size_t max_iterations = 65535 / 2;
   26|   533k|  size_t iteration = max_iterations;
   27|       |
   28|  2.37M|  for (; pos < size / N * N; pos += N) {
  ------------------
  |  Branch (28:10): [True: 1.83M, False: 533k]
  ------------------
   29|  1.83M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
   30|  1.83M|    if constexpr (!match_system(big_endian)) {
   31|  1.83M|      input = input.swap_bytes();
   32|  1.83M|    }
   33|       |    // 0xd800 .. 0xdbff - low surrogate
   34|       |    // 0xdc00 .. 0xdfff - high surrogate
   35|  1.83M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
   36|       |
   37|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
   38|  1.83M|    const auto c0 = min(input & uint16_t(0xff80), one);
   39|       |
   40|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
   41|  1.83M|    const auto c1 = min(input & uint16_t(0xf800), one);
   42|       |
   43|       |    /*
   44|       |        Explanation how the counting works.
   45|       |
   46|       |        In the case of a non-surrogate character we count:
   47|       |        * always 1 -- see how `count` is initialized above;
   48|       |        * c0 = 1 if the current char yields 2 or 3 bytes;
   49|       |        * c1 = 1 if the current char yields 3 bytes.
   50|       |
   51|       |        Thus, we always have correct count for the current char:
   52|       |        from 1, 2 or 3 bytes.
   53|       |
   54|       |        A trickier part is how we count surrogate pairs. Whether
   55|       |        we encounter a surrogate (low or high), we count it as
   56|       |        3 chars and then minus 1 (`is_surrogate` is -1 or 0).
   57|       |        Each surrogate char yields 2. A surrogate pair, that
   58|       |        is a low surrogate followed by a high one, yields
   59|       |        the expected 4 bytes.
   60|       |
   61|       |        It also correctly handles cases when low surrogate is
   62|       |        processed by the this loop, but high surrogate is counted
   63|       |        by the scalar procedure. The scalar procedure uses exactly
   64|       |        the described approach, thanks to that for valid UTF-16
   65|       |        strings it always count correctly.
   66|       |    */
   67|  1.83M|    v_count += c0;
   68|  1.83M|    v_count += c1;
   69|  1.83M|    v_count += vector_u16(is_surrogate);
   70|       |
   71|  1.83M|    iteration -= 1;
   72|  1.83M|    if (iteration == 0) {
  ------------------
  |  Branch (72:9): [True: 23, False: 1.83M]
  ------------------
   73|     23|      count += v_count.sum();
   74|     23|      v_count = vector_u16::zero();
   75|     23|      iteration = max_iterations;
   76|     23|    }
   77|  1.83M|  }
   78|       |
   79|   533k|  if (iteration > 0) {
  ------------------
  |  Branch (79:7): [True: 533k, False: 0]
  ------------------
   80|   533k|    count += v_count.sum();
   81|   533k|  }
   82|       |
   83|   533k|  return count + scalar::utf16::utf8_length_from_utf16<big_endian>(in + pos,
   84|   533k|                                                                   size - pos);
   85|   533k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_15utf1639utf8_length_from_utf16_with_replacementILNS_10endiannessE0EEENS_6resultEPKDsm:
   89|  1.12k|utf8_length_from_utf16_with_replacement(const char16_t *in, size_t size) {
   90|  1.12k|  using vector_u16 = simd16<uint16_t>;
   91|  1.12k|  constexpr size_t N = vector_u16::ELEMENTS;
   92|  1.12k|  if (N + 1 > size) {
  ------------------
  |  Branch (92:7): [True: 234, False: 893]
  ------------------
   93|    234|    return scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
   94|    234|        in, size);
   95|    234|  } // special case for short inputs
   96|    893|  size_t pos = 0;
   97|    893|  bool any_surrogates = false;
   98|       |
   99|    893|  const auto one = vector_u16::splat(1);
  100|       |
  101|    893|  auto v_count = vector_u16::zero();
  102|    893|  auto v_mismatched_count = vector_u16::zero();
  103|       |
  104|    893|  size_t count = 0;
  105|    893|  size_t mismatched_count = 0;
  106|       |
  107|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
  108|       |  // three additions
  109|    893|  constexpr size_t max_iterations = 65535 / 2;
  110|    893|  size_t iteration = max_iterations;
  111|       |
  112|    893|  if (scalar::utf16::is_low_surrogate<big_endian>(in[0])) {
  ------------------
  |  Branch (112:7): [True: 70, False: 823]
  ------------------
  113|     70|    any_surrogates = true;
  114|     70|    mismatched_count += 1;
  115|     70|  }
  116|       |
  117|  3.23M|  for (; pos < (size - 1) / N * N; pos += N) {
  ------------------
  |  Branch (117:10): [True: 3.23M, False: 893]
  ------------------
  118|  3.23M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
  119|       |    if constexpr (!match_system(big_endian)) {
  120|       |      input = input.swap_bytes();
  121|       |    }
  122|       |    // 0xd800 .. 0xdbff - low surrogate
  123|       |    // 0xdc00 .. 0xdfff - high surrogate
  124|  3.23M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
  125|       |
  126|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
  127|  3.23M|    const auto c0 = min(input & uint16_t(0xff80), one);
  128|       |
  129|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
  130|  3.23M|    const auto c1 = min(input & uint16_t(0xf800), one);
  131|       |
  132|  3.23M|    v_count += c0;
  133|  3.23M|    v_count += c1;
  134|  3.23M|    v_count += vector_u16(is_surrogate);
  135|  3.23M|    if (is_surrogate.to_bitmask() != 0 ||
  ------------------
  |  Branch (135:9): [True: 301k, False: 2.92M]
  ------------------
  136|  2.92M|        scalar::utf16::is_low_surrogate<big_endian>(in[pos + N])) {
  ------------------
  |  Branch (136:9): [True: 7.06k, False: 2.92M]
  ------------------
  137|   308k|      any_surrogates = true;
  138|   308k|      auto input_next =
  139|   308k|          vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos + 1));
  140|       |      if constexpr (!match_system(big_endian)) {
  141|       |        input_next = input_next.swap_bytes();
  142|       |      }
  143|       |
  144|   308k|      const auto lb_masked = input & (0xfc00);
  145|   308k|      const auto block_masked = input_next & (0xfc00);
  146|       |
  147|   308k|      const auto lb_is_high = lb_masked == (0xd800);
  148|   308k|      const auto block_is_low = block_masked == (0xdc00);
  149|       |
  150|   308k|      const auto illseq = min(vector_u16(lb_is_high ^ block_is_low), one);
  151|       |
  152|   308k|      v_mismatched_count += illseq;
  153|   308k|    }
  154|       |
  155|  3.23M|    iteration -= 1;
  156|  3.23M|    if (iteration == 0) {
  ------------------
  |  Branch (156:9): [True: 78, False: 3.23M]
  ------------------
  157|     78|      count += v_count.sum();
  158|     78|      v_count = vector_u16::zero();
  159|     78|      mismatched_count += v_mismatched_count.sum();
  160|     78|      v_mismatched_count = vector_u16::zero();
  161|     78|      iteration = max_iterations;
  162|     78|    }
  163|  3.23M|  }
  164|       |
  165|    893|  if (iteration > 0) {
  ------------------
  |  Branch (165:7): [True: 893, False: 0]
  ------------------
  166|    893|    count += v_count.sum();
  167|    893|    mismatched_count += v_mismatched_count.sum();
  168|    893|  }
  169|       |
  170|    893|  if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (170:7): [True: 174, False: 719]
  ------------------
  171|    174|    any_surrogates = true;
  172|    174|    if (!scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (172:9): [True: 121, False: 53]
  ------------------
  173|    121|      mismatched_count -= 1;
  174|    121|      count += 2;
  175|    121|      pos += 1;
  176|    121|    }
  177|    174|  }
  178|    893|  count += pos;
  179|    893|  count += mismatched_count;
  180|    893|  if (scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (180:7): [True: 193, False: 700]
  ------------------
  181|    193|    any_surrogates = true;
  182|    193|    if (pos == size) {
  ------------------
  |  Branch (182:9): [True: 0, False: 193]
  ------------------
  183|      0|      count += 2;
  184|    193|    } else if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (184:16): [True: 53, False: 140]
  ------------------
  185|     53|      pos += 1;
  186|     53|      count += 2;
  187|     53|    }
  188|    193|  }
  189|    893|  result scalar_result =
  190|    893|      scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
  191|    893|          in + pos, size - pos);
  192|    893|  return {any_surrogates ? SURROGATE : scalar_result.error,
  ------------------
  |  Branch (192:11): [True: 545, False: 348]
  ------------------
  193|    893|          count + scalar_result.count};
  194|  1.12k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_15utf1639utf8_length_from_utf16_with_replacementILNS_10endiannessE1EEENS_6resultEPKDsm:
   89|  1.12k|utf8_length_from_utf16_with_replacement(const char16_t *in, size_t size) {
   90|  1.12k|  using vector_u16 = simd16<uint16_t>;
   91|  1.12k|  constexpr size_t N = vector_u16::ELEMENTS;
   92|  1.12k|  if (N + 1 > size) {
  ------------------
  |  Branch (92:7): [True: 227, False: 900]
  ------------------
   93|    227|    return scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
   94|    227|        in, size);
   95|    227|  } // special case for short inputs
   96|    900|  size_t pos = 0;
   97|    900|  bool any_surrogates = false;
   98|       |
   99|    900|  const auto one = vector_u16::splat(1);
  100|       |
  101|    900|  auto v_count = vector_u16::zero();
  102|    900|  auto v_mismatched_count = vector_u16::zero();
  103|       |
  104|    900|  size_t count = 0;
  105|    900|  size_t mismatched_count = 0;
  106|       |
  107|       |  // in a single iteration the increment is 0, 1 or 2, despite we have
  108|       |  // three additions
  109|    900|  constexpr size_t max_iterations = 65535 / 2;
  110|    900|  size_t iteration = max_iterations;
  111|       |
  112|    900|  if (scalar::utf16::is_low_surrogate<big_endian>(in[0])) {
  ------------------
  |  Branch (112:7): [True: 73, False: 827]
  ------------------
  113|     73|    any_surrogates = true;
  114|     73|    mismatched_count += 1;
  115|     73|  }
  116|       |
  117|  2.61M|  for (; pos < (size - 1) / N * N; pos += N) {
  ------------------
  |  Branch (117:10): [True: 2.61M, False: 900]
  ------------------
  118|  2.61M|    auto input = vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos));
  119|  2.61M|    if constexpr (!match_system(big_endian)) {
  120|  2.61M|      input = input.swap_bytes();
  121|  2.61M|    }
  122|       |    // 0xd800 .. 0xdbff - low surrogate
  123|       |    // 0xdc00 .. 0xdfff - high surrogate
  124|  2.61M|    const auto is_surrogate = ((input & uint16_t(0xf800)) == uint16_t(0xd800));
  125|       |
  126|       |    // c0 - chars that yield 2- or 3-byte UTF-8 codes
  127|  2.61M|    const auto c0 = min(input & uint16_t(0xff80), one);
  128|       |
  129|       |    // c1 - chars that yield 3-byte UTF-8 codes (including surrogates)
  130|  2.61M|    const auto c1 = min(input & uint16_t(0xf800), one);
  131|       |
  132|  2.61M|    v_count += c0;
  133|  2.61M|    v_count += c1;
  134|  2.61M|    v_count += vector_u16(is_surrogate);
  135|  2.61M|    if (is_surrogate.to_bitmask() != 0 ||
  ------------------
  |  Branch (135:9): [True: 192k, False: 2.42M]
  ------------------
  136|  2.42M|        scalar::utf16::is_low_surrogate<big_endian>(in[pos + N])) {
  ------------------
  |  Branch (136:9): [True: 4.82k, False: 2.42M]
  ------------------
  137|   196k|      any_surrogates = true;
  138|   196k|      auto input_next =
  139|   196k|          vector_u16::load(reinterpret_cast<const uint16_t *>(in + pos + 1));
  140|   196k|      if constexpr (!match_system(big_endian)) {
  141|   196k|        input_next = input_next.swap_bytes();
  142|   196k|      }
  143|       |
  144|   196k|      const auto lb_masked = input & (0xfc00);
  145|   196k|      const auto block_masked = input_next & (0xfc00);
  146|       |
  147|   196k|      const auto lb_is_high = lb_masked == (0xd800);
  148|   196k|      const auto block_is_low = block_masked == (0xdc00);
  149|       |
  150|   196k|      const auto illseq = min(vector_u16(lb_is_high ^ block_is_low), one);
  151|       |
  152|   196k|      v_mismatched_count += illseq;
  153|   196k|    }
  154|       |
  155|  2.61M|    iteration -= 1;
  156|  2.61M|    if (iteration == 0) {
  ------------------
  |  Branch (156:9): [True: 54, False: 2.61M]
  ------------------
  157|     54|      count += v_count.sum();
  158|     54|      v_count = vector_u16::zero();
  159|     54|      mismatched_count += v_mismatched_count.sum();
  160|     54|      v_mismatched_count = vector_u16::zero();
  161|     54|      iteration = max_iterations;
  162|     54|    }
  163|  2.61M|  }
  164|       |
  165|    900|  if (iteration > 0) {
  ------------------
  |  Branch (165:7): [True: 900, False: 0]
  ------------------
  166|    900|    count += v_count.sum();
  167|    900|    mismatched_count += v_mismatched_count.sum();
  168|    900|  }
  169|       |
  170|    900|  if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (170:7): [True: 204, False: 696]
  ------------------
  171|    204|    any_surrogates = true;
  172|    204|    if (!scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (172:9): [True: 146, False: 58]
  ------------------
  173|    146|      mismatched_count -= 1;
  174|    146|      count += 2;
  175|    146|      pos += 1;
  176|    146|    }
  177|    204|  }
  178|    900|  count += pos;
  179|    900|  count += mismatched_count;
  180|    900|  if (scalar::utf16::is_high_surrogate<big_endian>(in[pos - 1])) {
  ------------------
  |  Branch (180:7): [True: 196, False: 704]
  ------------------
  181|    196|    any_surrogates = true;
  182|    196|    if (pos == size) {
  ------------------
  |  Branch (182:9): [True: 0, False: 196]
  ------------------
  183|      0|      count += 2;
  184|    196|    } else if (scalar::utf16::is_low_surrogate<big_endian>(in[pos])) {
  ------------------
  |  Branch (184:16): [True: 58, False: 138]
  ------------------
  185|     58|      pos += 1;
  186|     58|      count += 2;
  187|     58|    }
  188|    196|  }
  189|    900|  result scalar_result =
  190|    900|      scalar::utf16::utf8_length_from_utf16_with_replacement<big_endian>(
  191|    900|          in + pos, size - pos);
  192|    900|  return {any_surrogates ? SURROGATE : scalar_result.error,
  ------------------
  |  Branch (192:11): [True: 579, False: 321]
  ------------------
  193|    900|          count + scalar_result.count};
  194|  1.12k|}

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_113utf16_to_utf828convert_with_replacement_viaIZNKS0_14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPcE3$_0ZNKS4_40convert_utf16le_to_utf8_with_replacementES6_mS7_E3$_1EEmT_T0_S6_mS7_:
   21|  1.12k|    const char16_t *buf, size_t len, char *utf8_output) {
   22|  1.12k|  char *const start = utf8_output;
   23|  1.12k|  size_t pos = 0;
   24|   772k|  while (pos < len) {
  ------------------
  |  Branch (24:10): [True: 771k, False: 327]
  ------------------
   25|   771k|    result r = convert_with_errors(buf + pos, len - pos, utf8_output);
   26|   771k|    if (r.error != error_code::SURROGATE) {
  ------------------
  |  Branch (26:9): [True: 800, False: 771k]
  ------------------
   27|    800|      utf8_output += r.count; // SUCCESS: r.count == UTF-8 bytes written
   28|    800|      break;
   29|    800|    }
   30|       |    // buf[pos + r.count] is unpaired; the valid prefix is already written.
   31|   771k|    const size_t valid_units = r.count;
   32|   771k|    utf8_output += utf8_length(buf + pos, valid_units);
   33|   771k|    pos += valid_units;
   34|       |    // Emit U+FFFD and skip the offending code unit.
   35|   771k|    utf8_output[0] = char(0xef);
   36|   771k|    utf8_output[1] = char(0xbf);
   37|   771k|    utf8_output[2] = char(0xbd);
   38|   771k|    utf8_output += 3;
   39|   771k|    pos += 1;
   40|   771k|  }
   41|  1.12k|  return size_t(utf8_output - start);
   42|  1.12k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_113utf16_to_utf828convert_with_replacement_viaIZNKS0_14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPcE3$_0ZNKS4_40convert_utf16be_to_utf8_with_replacementES6_mS7_E3$_1EEmT_T0_S6_mS7_:
   21|  1.12k|    const char16_t *buf, size_t len, char *utf8_output) {
   22|  1.12k|  char *const start = utf8_output;
   23|  1.12k|  size_t pos = 0;
   24|   534k|  while (pos < len) {
  ------------------
  |  Branch (24:10): [True: 534k, False: 320]
  ------------------
   25|   534k|    result r = convert_with_errors(buf + pos, len - pos, utf8_output);
   26|   534k|    if (r.error != error_code::SURROGATE) {
  ------------------
  |  Branch (26:9): [True: 807, False: 533k]
  ------------------
   27|    807|      utf8_output += r.count; // SUCCESS: r.count == UTF-8 bytes written
   28|    807|      break;
   29|    807|    }
   30|       |    // buf[pos + r.count] is unpaired; the valid prefix is already written.
   31|   533k|    const size_t valid_units = r.count;
   32|   533k|    utf8_output += utf8_length(buf + pos, valid_units);
   33|   533k|    pos += valid_units;
   34|       |    // Emit U+FFFD and skip the offending code unit.
   35|   533k|    utf8_output[0] = char(0xef);
   36|   533k|    utf8_output[1] = char(0xbf);
   37|   533k|    utf8_output[2] = char(0xbd);
   38|   533k|    utf8_output += 3;
   39|   533k|    pos += 1;
   40|   533k|  }
   41|  1.12k|  return size_t(utf8_output - start);
   42|  1.12k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_113utf16_to_utf828convert_with_replacement_viaIZNKS0_14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPcE3$_0ZNKS4_40convert_utf16le_to_utf8_with_replacementES6_mS7_E3$_1EEmT_T0_S6_mS7_:
   21|  1.12k|    const char16_t *buf, size_t len, char *utf8_output) {
   22|  1.12k|  char *const start = utf8_output;
   23|  1.12k|  size_t pos = 0;
   24|   772k|  while (pos < len) {
  ------------------
  |  Branch (24:10): [True: 771k, False: 327]
  ------------------
   25|   771k|    result r = convert_with_errors(buf + pos, len - pos, utf8_output);
   26|   771k|    if (r.error != error_code::SURROGATE) {
  ------------------
  |  Branch (26:9): [True: 800, False: 771k]
  ------------------
   27|    800|      utf8_output += r.count; // SUCCESS: r.count == UTF-8 bytes written
   28|    800|      break;
   29|    800|    }
   30|       |    // buf[pos + r.count] is unpaired; the valid prefix is already written.
   31|   771k|    const size_t valid_units = r.count;
   32|   771k|    utf8_output += utf8_length(buf + pos, valid_units);
   33|   771k|    pos += valid_units;
   34|       |    // Emit U+FFFD and skip the offending code unit.
   35|   771k|    utf8_output[0] = char(0xef);
   36|   771k|    utf8_output[1] = char(0xbf);
   37|   771k|    utf8_output[2] = char(0xbd);
   38|   771k|    utf8_output += 3;
   39|   771k|    pos += 1;
   40|   771k|  }
   41|  1.12k|  return size_t(utf8_output - start);
   42|  1.12k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_113utf16_to_utf828convert_with_replacement_viaIZNKS0_14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPcE3$_0ZNKS4_40convert_utf16be_to_utf8_with_replacementES6_mS7_E3$_1EEmT_T0_S6_mS7_:
   21|  1.12k|    const char16_t *buf, size_t len, char *utf8_output) {
   22|  1.12k|  char *const start = utf8_output;
   23|  1.12k|  size_t pos = 0;
   24|   534k|  while (pos < len) {
  ------------------
  |  Branch (24:10): [True: 534k, False: 320]
  ------------------
   25|   534k|    result r = convert_with_errors(buf + pos, len - pos, utf8_output);
   26|   534k|    if (r.error != error_code::SURROGATE) {
  ------------------
  |  Branch (26:9): [True: 807, False: 533k]
  ------------------
   27|    807|      utf8_output += r.count; // SUCCESS: r.count == UTF-8 bytes written
   28|    807|      break;
   29|    807|    }
   30|       |    // buf[pos + r.count] is unpaired; the valid prefix is already written.
   31|   533k|    const size_t valid_units = r.count;
   32|   533k|    utf8_output += utf8_length(buf + pos, valid_units);
   33|   533k|    pos += valid_units;
   34|       |    // Emit U+FFFD and skip the offending code unit.
   35|   533k|    utf8_output[0] = char(0xef);
   36|   533k|    utf8_output[1] = char(0xbf);
   37|   533k|    utf8_output[2] = char(0xbd);
   38|   533k|    utf8_output += 3;
   39|   533k|    pos += 1;
   40|   533k|  }
   41|  1.12k|  return size_t(utf8_output - start);
   42|  1.12k|}

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation12utf8_checker16check_next_inputERKNS1_4simd8simd8x64IhEE:
  187|  1.70M|  simdutf_really_inline void check_next_input(const simd8x64<uint8_t> &input) {
  188|  1.70M|    if (simdutf_likely(is_ascii(input))) {
  ------------------
  |  |   90|  1.70M|    #define simdutf_likely(x) __builtin_expect(!!(x), 1)
  |  |  ------------------
  |  |  |  Branch (90:31): [True: 193k, False: 1.51M]
  |  |  ------------------
  ------------------
  189|   193k|      this->error |= this->prev_incomplete;
  190|  1.51M|    } else {
  191|       |      // you might think that a for-loop would work, but under Visual Studio, it
  192|       |      // is not good enough.
  193|  1.51M|      static_assert((simd8x64<uint8_t>::NUM_CHUNKS == 2) ||
  194|  1.51M|                        (simd8x64<uint8_t>::NUM_CHUNKS == 4),
  195|  1.51M|                    "We support either two or four chunks per 64-byte block.");
  196|  1.51M|      if constexpr (simd8x64<uint8_t>::NUM_CHUNKS == 2) {
  197|  1.51M|        this->check_utf8_bytes(input.chunks[0], this->prev_input_block);
  198|  1.51M|        this->check_utf8_bytes(input.chunks[1], input.chunks[0]);
  199|       |      } else if constexpr (simd8x64<uint8_t>::NUM_CHUNKS == 4) {
  200|       |        this->check_utf8_bytes(input.chunks[0], this->prev_input_block);
  201|       |        this->check_utf8_bytes(input.chunks[1], input.chunks[0]);
  202|       |        this->check_utf8_bytes(input.chunks[2], input.chunks[1]);
  203|       |        this->check_utf8_bytes(input.chunks[3], input.chunks[2]);
  204|       |      }
  205|  1.51M|      this->prev_incomplete =
  206|  1.51M|          is_incomplete(input.chunks[simd8x64<uint8_t>::NUM_CHUNKS - 1]);
  207|  1.51M|      this->prev_input_block = input.chunks[simd8x64<uint8_t>::NUM_CHUNKS - 1];
  208|  1.51M|    }
  209|  1.70M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation12utf8_checker16check_utf8_bytesENS1_4simd5simd8IhEES6_:
  169|  3.02M|                                              const simd8<uint8_t> prev_input) {
  170|       |    // Flip prev1...prev3 so we can easily determine if they are 2+, 3+ or 4+
  171|       |    // lead bytes (2, 3, 4-byte leads become large positive numbers instead of
  172|       |    // small negative numbers)
  173|  3.02M|    simd8<uint8_t> prev1 = input.prev<1>(prev_input);
  174|  3.02M|    simd8<uint8_t> sc = check_special_cases(input, prev1);
  175|  3.02M|    this->error |= check_multibyte_lengths(input, prev_input, sc);
  176|  3.02M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation19check_special_casesENS1_4simd5simd8IhEES5_:
    9|  3.02M|check_special_cases(const simd8<uint8_t> input, const simd8<uint8_t> prev1) {
   10|       |  // Bit 0 = Too Short (lead byte/ASCII followed by lead byte/ASCII)
   11|       |  // Bit 1 = Too Long (ASCII followed by continuation)
   12|       |  // Bit 2 = Overlong 3-byte
   13|       |  // Bit 4 = Surrogate
   14|       |  // Bit 5 = Overlong 2-byte
   15|       |  // Bit 7 = Two Continuations
   16|  3.02M|  constexpr const uint8_t TOO_SHORT = 1 << 0;  // 11______ 0_______
   17|       |                                               // 11______ 11______
   18|  3.02M|  constexpr const uint8_t TOO_LONG = 1 << 1;   // 0_______ 10______
   19|  3.02M|  constexpr const uint8_t OVERLONG_3 = 1 << 2; // 11100000 100_____
   20|  3.02M|  constexpr const uint8_t SURROGATE = 1 << 4;  // 11101101 101_____
   21|  3.02M|  constexpr const uint8_t OVERLONG_2 = 1 << 5; // 1100000_ 10______
   22|  3.02M|  constexpr const uint8_t TWO_CONTS = 1 << 7;  // 10______ 10______
   23|  3.02M|  constexpr const uint8_t TOO_LARGE = 1 << 3;  // 11110100 1001____
   24|       |                                               // 11110100 101_____
   25|       |                                               // 11110101 1001____
   26|       |                                               // 11110101 101_____
   27|       |                                               // 1111011_ 1001____
   28|       |                                               // 1111011_ 101_____
   29|       |                                               // 11111___ 1001____
   30|       |                                               // 11111___ 101_____
   31|  3.02M|  constexpr const uint8_t TOO_LARGE_1000 = 1 << 6;
   32|       |  // 11110101 1000____
   33|       |  // 1111011_ 1000____
   34|       |  // 11111___ 1000____
   35|  3.02M|  constexpr const uint8_t OVERLONG_4 = 1 << 6; // 11110000 1000____
   36|       |
   37|  3.02M|  const simd8<uint8_t> byte_1_high = prev1.shr<4>().lookup_16<uint8_t>(
   38|       |      // 0_______ ________ <ASCII in byte 1>
   39|  3.02M|      TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG,
   40|  3.02M|      TOO_LONG,
   41|       |      // 10______ ________ <continuation in byte 1>
   42|  3.02M|      TWO_CONTS, TWO_CONTS, TWO_CONTS, TWO_CONTS,
   43|       |      // 1100____ ________ <two byte lead in byte 1>
   44|  3.02M|      TOO_SHORT | OVERLONG_2,
   45|       |      // 1101____ ________ <two byte lead in byte 1>
   46|  3.02M|      TOO_SHORT,
   47|       |      // 1110____ ________ <three byte lead in byte 1>
   48|  3.02M|      TOO_SHORT | OVERLONG_3 | SURROGATE,
   49|       |      // 1111____ ________ <four+ byte lead in byte 1>
   50|  3.02M|      TOO_SHORT | TOO_LARGE | TOO_LARGE_1000 | OVERLONG_4);
   51|  3.02M|  constexpr const uint8_t CARRY =
   52|  3.02M|      TOO_SHORT | TOO_LONG | TWO_CONTS; // These all have ____ in byte 1 .
   53|  3.02M|  const simd8<uint8_t> byte_1_low =
   54|  3.02M|      (prev1 & 0x0F)
   55|  3.02M|          .lookup_16<uint8_t>(
   56|       |              // ____0000 ________
   57|  3.02M|              CARRY | OVERLONG_3 | OVERLONG_2 | OVERLONG_4,
   58|       |              // ____0001 ________
   59|  3.02M|              CARRY | OVERLONG_2,
   60|       |              // ____001_ ________
   61|  3.02M|              CARRY, CARRY,
   62|       |
   63|       |              // ____0100 ________
   64|  3.02M|              CARRY | TOO_LARGE,
   65|       |              // ____0101 ________
   66|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   67|       |              // ____011_ ________
   68|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   69|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   70|       |
   71|       |              // ____1___ ________
   72|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   73|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   74|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   75|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   76|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   77|       |              // ____1101 ________
   78|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000 | SURROGATE,
   79|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   80|  3.02M|              CARRY | TOO_LARGE | TOO_LARGE_1000);
   81|  3.02M|  const simd8<uint8_t> byte_2_high = input.shr<4>().lookup_16<uint8_t>(
   82|       |      // ________ 0_______ <ASCII in byte 2>
   83|  3.02M|      TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT,
   84|  3.02M|      TOO_SHORT, TOO_SHORT,
   85|       |
   86|       |      // ________ 1000____
   87|  3.02M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | OVERLONG_3 | TOO_LARGE_1000 |
   88|  3.02M|          OVERLONG_4,
   89|       |      // ________ 1001____
   90|  3.02M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | OVERLONG_3 | TOO_LARGE,
   91|       |      // ________ 101_____
   92|  3.02M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | SURROGATE | TOO_LARGE,
   93|  3.02M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | SURROGATE | TOO_LARGE,
   94|       |
   95|       |      // ________ 11______
   96|  3.02M|      TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT);
   97|  3.02M|  return (byte_1_high & byte_1_low & byte_2_high);
   98|  3.02M|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation23check_multibyte_lengthsENS1_4simd5simd8IhEES5_S5_:
  102|  3.02M|                        const simd8<uint8_t> sc) {
  103|  3.02M|  simd8<uint8_t> prev2 = input.prev<2>(prev_input);
  104|  3.02M|  simd8<uint8_t> prev3 = input.prev<3>(prev_input);
  105|  3.02M|  simd8<uint8_t> must23 =
  106|  3.02M|      simd8<uint8_t>(must_be_2_3_continuation(prev2, prev3));
  107|  3.02M|  simd8<uint8_t> must23_80 = must23 & uint8_t(0x80);
  108|  3.02M|  return must23_80 ^ sc;
  109|  3.02M|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation13is_incompleteENS1_4simd5simd8IhEE:
  115|  1.51M|simdutf_really_inline simd8<uint8_t> is_incomplete(const simd8<uint8_t> input) {
  116|       |  // If the previous input's last 3 bytes match this, they're too short (they
  117|       |  // ended at EOF):
  118|       |  // ... 1111____ 111_____ 11______
  119|  1.51M|  static const uint8_t max_array[32] = {255,
  120|  1.51M|                                        255,
  121|  1.51M|                                        255,
  122|  1.51M|                                        255,
  123|  1.51M|                                        255,
  124|  1.51M|                                        255,
  125|  1.51M|                                        255,
  126|  1.51M|                                        255,
  127|  1.51M|                                        255,
  128|  1.51M|                                        255,
  129|  1.51M|                                        255,
  130|  1.51M|                                        255,
  131|  1.51M|                                        255,
  132|  1.51M|                                        255,
  133|  1.51M|                                        255,
  134|  1.51M|                                        255,
  135|  1.51M|                                        255,
  136|  1.51M|                                        255,
  137|  1.51M|                                        255,
  138|  1.51M|                                        255,
  139|  1.51M|                                        255,
  140|  1.51M|                                        255,
  141|  1.51M|                                        255,
  142|  1.51M|                                        255,
  143|  1.51M|                                        255,
  144|  1.51M|                                        255,
  145|  1.51M|                                        255,
  146|  1.51M|                                        255,
  147|  1.51M|                                        255,
  148|  1.51M|                                        0b11110000u - 1,
  149|  1.51M|                                        0b11100000u - 1,
  150|  1.51M|                                        0b11000000u - 1};
  151|  1.51M|  const simd8<uint8_t> max_value(
  152|  1.51M|      &max_array[sizeof(max_array) - sizeof(simd8<uint8_t>)]);
  153|  1.51M|  return input.gt_bits(max_value);
  154|  1.51M|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation12utf8_checker9check_eofEv:
  181|  2.25k|  simdutf_really_inline void check_eof() {
  182|       |    // If the previous block had incomplete UTF-8 characters at the end, an
  183|       |    // ASCII block can't possibly finish them.
  184|  2.25k|    this->error |= this->prev_incomplete;
  185|  2.25k|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_115utf8_validation12utf8_checker6errorsEv:
  212|  2.25k|  simdutf_really_inline bool errors() const {
  213|  2.25k|    return this->error.any_bits_set_anywhere();
  214|  2.25k|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation12utf8_checker16check_next_inputERKNS1_4simd8simd8x64IhEE:
  187|  1.70M|  simdutf_really_inline void check_next_input(const simd8x64<uint8_t> &input) {
  188|  1.70M|    if (simdutf_likely(is_ascii(input))) {
  ------------------
  |  |   90|  1.70M|    #define simdutf_likely(x) __builtin_expect(!!(x), 1)
  |  |  ------------------
  |  |  |  Branch (90:31): [True: 193k, False: 1.51M]
  |  |  ------------------
  ------------------
  189|   193k|      this->error |= this->prev_incomplete;
  190|  1.51M|    } else {
  191|       |      // you might think that a for-loop would work, but under Visual Studio, it
  192|       |      // is not good enough.
  193|  1.51M|      static_assert((simd8x64<uint8_t>::NUM_CHUNKS == 2) ||
  194|  1.51M|                        (simd8x64<uint8_t>::NUM_CHUNKS == 4),
  195|  1.51M|                    "We support either two or four chunks per 64-byte block.");
  196|       |      if constexpr (simd8x64<uint8_t>::NUM_CHUNKS == 2) {
  197|       |        this->check_utf8_bytes(input.chunks[0], this->prev_input_block);
  198|       |        this->check_utf8_bytes(input.chunks[1], input.chunks[0]);
  199|  1.51M|      } else if constexpr (simd8x64<uint8_t>::NUM_CHUNKS == 4) {
  200|  1.51M|        this->check_utf8_bytes(input.chunks[0], this->prev_input_block);
  201|  1.51M|        this->check_utf8_bytes(input.chunks[1], input.chunks[0]);
  202|  1.51M|        this->check_utf8_bytes(input.chunks[2], input.chunks[1]);
  203|  1.51M|        this->check_utf8_bytes(input.chunks[3], input.chunks[2]);
  204|  1.51M|      }
  205|  1.51M|      this->prev_incomplete =
  206|  1.51M|          is_incomplete(input.chunks[simd8x64<uint8_t>::NUM_CHUNKS - 1]);
  207|  1.51M|      this->prev_input_block = input.chunks[simd8x64<uint8_t>::NUM_CHUNKS - 1];
  208|  1.51M|    }
  209|  1.70M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation12utf8_checker16check_utf8_bytesENS1_4simd5simd8IhEES6_:
  169|  6.05M|                                              const simd8<uint8_t> prev_input) {
  170|       |    // Flip prev1...prev3 so we can easily determine if they are 2+, 3+ or 4+
  171|       |    // lead bytes (2, 3, 4-byte leads become large positive numbers instead of
  172|       |    // small negative numbers)
  173|  6.05M|    simd8<uint8_t> prev1 = input.prev<1>(prev_input);
  174|  6.05M|    simd8<uint8_t> sc = check_special_cases(input, prev1);
  175|  6.05M|    this->error |= check_multibyte_lengths(input, prev_input, sc);
  176|  6.05M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation19check_special_casesENS1_4simd5simd8IhEES5_:
    9|  6.05M|check_special_cases(const simd8<uint8_t> input, const simd8<uint8_t> prev1) {
   10|       |  // Bit 0 = Too Short (lead byte/ASCII followed by lead byte/ASCII)
   11|       |  // Bit 1 = Too Long (ASCII followed by continuation)
   12|       |  // Bit 2 = Overlong 3-byte
   13|       |  // Bit 4 = Surrogate
   14|       |  // Bit 5 = Overlong 2-byte
   15|       |  // Bit 7 = Two Continuations
   16|  6.05M|  constexpr const uint8_t TOO_SHORT = 1 << 0;  // 11______ 0_______
   17|       |                                               // 11______ 11______
   18|  6.05M|  constexpr const uint8_t TOO_LONG = 1 << 1;   // 0_______ 10______
   19|  6.05M|  constexpr const uint8_t OVERLONG_3 = 1 << 2; // 11100000 100_____
   20|  6.05M|  constexpr const uint8_t SURROGATE = 1 << 4;  // 11101101 101_____
   21|  6.05M|  constexpr const uint8_t OVERLONG_2 = 1 << 5; // 1100000_ 10______
   22|  6.05M|  constexpr const uint8_t TWO_CONTS = 1 << 7;  // 10______ 10______
   23|  6.05M|  constexpr const uint8_t TOO_LARGE = 1 << 3;  // 11110100 1001____
   24|       |                                               // 11110100 101_____
   25|       |                                               // 11110101 1001____
   26|       |                                               // 11110101 101_____
   27|       |                                               // 1111011_ 1001____
   28|       |                                               // 1111011_ 101_____
   29|       |                                               // 11111___ 1001____
   30|       |                                               // 11111___ 101_____
   31|  6.05M|  constexpr const uint8_t TOO_LARGE_1000 = 1 << 6;
   32|       |  // 11110101 1000____
   33|       |  // 1111011_ 1000____
   34|       |  // 11111___ 1000____
   35|  6.05M|  constexpr const uint8_t OVERLONG_4 = 1 << 6; // 11110000 1000____
   36|       |
   37|  6.05M|  const simd8<uint8_t> byte_1_high = prev1.shr<4>().lookup_16<uint8_t>(
   38|       |      // 0_______ ________ <ASCII in byte 1>
   39|  6.05M|      TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG, TOO_LONG,
   40|  6.05M|      TOO_LONG,
   41|       |      // 10______ ________ <continuation in byte 1>
   42|  6.05M|      TWO_CONTS, TWO_CONTS, TWO_CONTS, TWO_CONTS,
   43|       |      // 1100____ ________ <two byte lead in byte 1>
   44|  6.05M|      TOO_SHORT | OVERLONG_2,
   45|       |      // 1101____ ________ <two byte lead in byte 1>
   46|  6.05M|      TOO_SHORT,
   47|       |      // 1110____ ________ <three byte lead in byte 1>
   48|  6.05M|      TOO_SHORT | OVERLONG_3 | SURROGATE,
   49|       |      // 1111____ ________ <four+ byte lead in byte 1>
   50|  6.05M|      TOO_SHORT | TOO_LARGE | TOO_LARGE_1000 | OVERLONG_4);
   51|  6.05M|  constexpr const uint8_t CARRY =
   52|  6.05M|      TOO_SHORT | TOO_LONG | TWO_CONTS; // These all have ____ in byte 1 .
   53|  6.05M|  const simd8<uint8_t> byte_1_low =
   54|  6.05M|      (prev1 & 0x0F)
   55|  6.05M|          .lookup_16<uint8_t>(
   56|       |              // ____0000 ________
   57|  6.05M|              CARRY | OVERLONG_3 | OVERLONG_2 | OVERLONG_4,
   58|       |              // ____0001 ________
   59|  6.05M|              CARRY | OVERLONG_2,
   60|       |              // ____001_ ________
   61|  6.05M|              CARRY, CARRY,
   62|       |
   63|       |              // ____0100 ________
   64|  6.05M|              CARRY | TOO_LARGE,
   65|       |              // ____0101 ________
   66|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   67|       |              // ____011_ ________
   68|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   69|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   70|       |
   71|       |              // ____1___ ________
   72|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   73|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   74|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   75|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   76|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   77|       |              // ____1101 ________
   78|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000 | SURROGATE,
   79|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000,
   80|  6.05M|              CARRY | TOO_LARGE | TOO_LARGE_1000);
   81|  6.05M|  const simd8<uint8_t> byte_2_high = input.shr<4>().lookup_16<uint8_t>(
   82|       |      // ________ 0_______ <ASCII in byte 2>
   83|  6.05M|      TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT,
   84|  6.05M|      TOO_SHORT, TOO_SHORT,
   85|       |
   86|       |      // ________ 1000____
   87|  6.05M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | OVERLONG_3 | TOO_LARGE_1000 |
   88|  6.05M|          OVERLONG_4,
   89|       |      // ________ 1001____
   90|  6.05M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | OVERLONG_3 | TOO_LARGE,
   91|       |      // ________ 101_____
   92|  6.05M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | SURROGATE | TOO_LARGE,
   93|  6.05M|      TOO_LONG | OVERLONG_2 | TWO_CONTS | SURROGATE | TOO_LARGE,
   94|       |
   95|       |      // ________ 11______
   96|  6.05M|      TOO_SHORT, TOO_SHORT, TOO_SHORT, TOO_SHORT);
   97|  6.05M|  return (byte_1_high & byte_1_low & byte_2_high);
   98|  6.05M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation23check_multibyte_lengthsENS1_4simd5simd8IhEES5_S5_:
  102|  6.05M|                        const simd8<uint8_t> sc) {
  103|  6.05M|  simd8<uint8_t> prev2 = input.prev<2>(prev_input);
  104|  6.05M|  simd8<uint8_t> prev3 = input.prev<3>(prev_input);
  105|  6.05M|  simd8<uint8_t> must23 =
  106|  6.05M|      simd8<uint8_t>(must_be_2_3_continuation(prev2, prev3));
  107|  6.05M|  simd8<uint8_t> must23_80 = must23 & uint8_t(0x80);
  108|  6.05M|  return must23_80 ^ sc;
  109|  6.05M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation13is_incompleteENS1_4simd5simd8IhEE:
  115|  1.51M|simdutf_really_inline simd8<uint8_t> is_incomplete(const simd8<uint8_t> input) {
  116|       |  // If the previous input's last 3 bytes match this, they're too short (they
  117|       |  // ended at EOF):
  118|       |  // ... 1111____ 111_____ 11______
  119|  1.51M|  static const uint8_t max_array[32] = {255,
  120|  1.51M|                                        255,
  121|  1.51M|                                        255,
  122|  1.51M|                                        255,
  123|  1.51M|                                        255,
  124|  1.51M|                                        255,
  125|  1.51M|                                        255,
  126|  1.51M|                                        255,
  127|  1.51M|                                        255,
  128|  1.51M|                                        255,
  129|  1.51M|                                        255,
  130|  1.51M|                                        255,
  131|  1.51M|                                        255,
  132|  1.51M|                                        255,
  133|  1.51M|                                        255,
  134|  1.51M|                                        255,
  135|  1.51M|                                        255,
  136|  1.51M|                                        255,
  137|  1.51M|                                        255,
  138|  1.51M|                                        255,
  139|  1.51M|                                        255,
  140|  1.51M|                                        255,
  141|  1.51M|                                        255,
  142|  1.51M|                                        255,
  143|  1.51M|                                        255,
  144|  1.51M|                                        255,
  145|  1.51M|                                        255,
  146|  1.51M|                                        255,
  147|  1.51M|                                        255,
  148|  1.51M|                                        0b11110000u - 1,
  149|  1.51M|                                        0b11100000u - 1,
  150|  1.51M|                                        0b11000000u - 1};
  151|  1.51M|  const simd8<uint8_t> max_value(
  152|  1.51M|      &max_array[sizeof(max_array) - sizeof(simd8<uint8_t>)]);
  153|  1.51M|  return input.gt_bits(max_value);
  154|  1.51M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation12utf8_checker9check_eofEv:
  181|  2.25k|  simdutf_really_inline void check_eof() {
  182|       |    // If the previous block had incomplete UTF-8 characters at the end, an
  183|       |    // ASCII block can't possibly finish them.
  184|  2.25k|    this->error |= this->prev_incomplete;
  185|  2.25k|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_115utf8_validation12utf8_checker6errorsEv:
  212|  2.25k|  simdutf_really_inline bool errors() const {
  213|  2.25k|    return this->error.any_bits_set_anywhere();
  214|  2.25k|  }

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation21generic_validate_utf8EPKcm:
   27|  2.25k|bool generic_validate_utf8(const char *input, size_t length) {
   28|  2.25k|  return generic_validate_utf8<utf8_checker>(
   29|  2.25k|      reinterpret_cast<const uint8_t *>(input), length);
   30|  2.25k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_115utf8_validation21generic_validate_utf8INS2_12utf8_checkerEEEbPKhm:
   10|  2.25k|bool generic_validate_utf8(const uint8_t *input, size_t length) {
   11|  2.25k|  checker c{};
   12|  2.25k|  buf_block_reader<64> reader(input, length);
   13|  1.70M|  while (reader.has_full_block()) {
  ------------------
  |  Branch (13:10): [True: 1.70M, False: 2.25k]
  ------------------
   14|  1.70M|    simd::simd8x64<uint8_t> in(reader.full_block());
   15|  1.70M|    c.check_next_input(in);
   16|  1.70M|    reader.advance();
   17|  1.70M|  }
   18|  2.25k|  uint8_t block[64]{};
   19|  2.25k|  reader.get_remainder(block);
   20|  2.25k|  simd::simd8x64<uint8_t> in(block);
   21|  2.25k|  c.check_next_input(in);
   22|  2.25k|  reader.advance();
   23|  2.25k|  c.check_eof();
   24|  2.25k|  return !c.errors();
   25|  2.25k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation21generic_validate_utf8EPKcm:
   27|  2.25k|bool generic_validate_utf8(const char *input, size_t length) {
   28|  2.25k|  return generic_validate_utf8<utf8_checker>(
   29|  2.25k|      reinterpret_cast<const uint8_t *>(input), length);
   30|  2.25k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_115utf8_validation21generic_validate_utf8INS2_12utf8_checkerEEEbPKhm:
   10|  2.25k|bool generic_validate_utf8(const uint8_t *input, size_t length) {
   11|  2.25k|  checker c{};
   12|  2.25k|  buf_block_reader<64> reader(input, length);
   13|  1.70M|  while (reader.has_full_block()) {
  ------------------
  |  Branch (13:10): [True: 1.70M, False: 2.25k]
  ------------------
   14|  1.70M|    simd::simd8x64<uint8_t> in(reader.full_block());
   15|  1.70M|    c.check_next_input(in);
   16|  1.70M|    reader.advance();
   17|  1.70M|  }
   18|  2.25k|  uint8_t block[64]{};
   19|  2.25k|  reader.get_remainder(block);
   20|  2.25k|  simd::simd8x64<uint8_t> in(block);
   21|  2.25k|  c.check_next_input(in);
   22|  2.25k|  reader.advance();
   23|  2.25k|  c.check_eof();
   24|  2.25k|  return !c.errors();
   25|  2.25k|}

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_138avx2_convert_utf16_to_utf8_with_errorsILNS_10endiannessE0EEENSt3__14pairINS_6resultEPcEEPKDsmS7_:
  333|   771k|                                       char *utf8_output) {
  334|   771k|  const char16_t *start = buf;
  335|   771k|  const char16_t *end = buf + len;
  336|       |
  337|   771k|  const __m256i v_0000 = _mm256_setzero_si256();
  338|   771k|  const __m256i v_f800 = _mm256_set1_epi16((int16_t)0xf800);
  339|   771k|  const __m256i v_d800 = _mm256_set1_epi16((int16_t)0xd800);
  340|   771k|  const __m256i v_c080 = _mm256_set1_epi16((int16_t)0xc080);
  341|   771k|  const size_t safety_margin =
  342|   771k|      12; // to avoid overruns, see issue
  343|       |          // https://github.com/simdutf/simdutf/issues/92
  344|       |
  345|  2.23M|  while (end - buf >= std::ptrdiff_t(16 + safety_margin)) {
  ------------------
  |  Branch (345:10): [True: 2.23M, False: 3.56k]
  ------------------
  346|  2.23M|    __m256i in = _mm256_loadu_si256((__m256i *)buf);
  347|  2.23M|    if (big_endian) {
  ------------------
  |  Branch (347:9): [Folded, False: 2.23M]
  ------------------
  348|      0|      const __m256i swap = _mm256_setr_epi8(
  349|      0|          1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14, 17, 16, 19, 18,
  350|      0|          21, 20, 23, 22, 25, 24, 27, 26, 29, 28, 31, 30);
  351|      0|      in = _mm256_shuffle_epi8(in, swap);
  352|      0|    }
  353|       |    // a single 16-bit UTF-16 word can yield 1, 2 or 3 UTF-8 bytes
  354|  2.23M|    const __m256i v_ff80 = _mm256_set1_epi16((int16_t)0xff80);
  355|  2.23M|    if (_mm256_testz_si256(in, v_ff80)) { // ASCII fast path!!!!
  ------------------
  |  Branch (355:9): [True: 405k, False: 1.82M]
  ------------------
  356|       |      // 1. pack the bytes
  357|   405k|      const __m128i utf8_packed = _mm_packus_epi16(
  358|   405k|          _mm256_castsi256_si128(in), _mm256_extractf128_si256(in, 1));
  359|       |      // 2. store (16 bytes)
  360|   405k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
  361|       |      // 3. adjust pointers
  362|   405k|      buf += 16;
  363|   405k|      utf8_output += 16;
  364|   405k|      continue; // we are done for this round!
  365|   405k|    }
  366|       |    // no bits set above 7th bit
  367|  1.82M|    const __m256i one_byte_bytemask =
  368|  1.82M|        _mm256_cmpeq_epi16(_mm256_and_si256(in, v_ff80), v_0000);
  369|  1.82M|    const uint32_t one_byte_bitmask =
  370|  1.82M|        static_cast<uint32_t>(_mm256_movemask_epi8(one_byte_bytemask));
  371|       |
  372|       |    // no bits set above 11th bit
  373|  1.82M|    const __m256i one_or_two_bytes_bytemask =
  374|  1.82M|        _mm256_cmpeq_epi16(_mm256_and_si256(in, v_f800), v_0000);
  375|  1.82M|    const uint32_t one_or_two_bytes_bitmask =
  376|  1.82M|        static_cast<uint32_t>(_mm256_movemask_epi8(one_or_two_bytes_bytemask));
  377|  1.82M|    if (one_or_two_bytes_bitmask == 0xffffffff) {
  ------------------
  |  Branch (377:9): [True: 9.05k, False: 1.81M]
  ------------------
  378|       |
  379|       |      // 1. prepare 2-byte values
  380|       |      // input 16-bit word : [0000|0aaa|aabb|bbbb] x 8
  381|       |      // expected output   : [110a|aaaa|10bb|bbbb] x 8
  382|  9.05k|      const __m256i v_1f00 = _mm256_set1_epi16((int16_t)0x1f00);
  383|  9.05k|      const __m256i v_003f = _mm256_set1_epi16((int16_t)0x003f);
  384|       |
  385|       |      // t0 = [000a|aaaa|bbbb|bb00]
  386|  9.05k|      const __m256i t0 = _mm256_slli_epi16(in, 2);
  387|       |      // t1 = [000a|aaaa|0000|0000]
  388|  9.05k|      const __m256i t1 = _mm256_and_si256(t0, v_1f00);
  389|       |      // t2 = [0000|0000|00bb|bbbb]
  390|  9.05k|      const __m256i t2 = _mm256_and_si256(in, v_003f);
  391|       |      // t3 = [000a|aaaa|00bb|bbbb]
  392|  9.05k|      const __m256i t3 = _mm256_or_si256(t1, t2);
  393|       |      // t4 = [110a|aaaa|10bb|bbbb]
  394|  9.05k|      const __m256i t4 = _mm256_or_si256(t3, v_c080);
  395|       |
  396|       |      // 2. merge ASCII and 2-byte codewords
  397|  9.05k|      const __m256i utf8_unpacked =
  398|  9.05k|          _mm256_blendv_epi8(t4, in, one_byte_bytemask);
  399|       |
  400|       |      // 3. prepare bitmask for 8-bit lookup
  401|  9.05k|      const uint32_t M0 = one_byte_bitmask & 0x55555555;
  402|  9.05k|      const uint32_t M1 = M0 >> 7;
  403|  9.05k|      const uint32_t M2 = (M1 | M0) & 0x00ff00ff;
  404|       |      // 4. pack the bytes
  405|       |
  406|  9.05k|      const uint8_t *row =
  407|  9.05k|          &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
  408|  9.05k|      const uint8_t *row_2 =
  409|  9.05k|          &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2 >>
  410|  9.05k|                                                                       16)][0];
  411|       |
  412|  9.05k|      const __m128i shuffle = _mm_loadu_si128((__m128i *)(row + 1));
  413|  9.05k|      const __m128i shuffle_2 = _mm_loadu_si128((__m128i *)(row_2 + 1));
  414|       |
  415|  9.05k|      const __m256i utf8_packed = _mm256_shuffle_epi8(
  416|  9.05k|          utf8_unpacked, _mm256_setr_m128i(shuffle, shuffle_2));
  ------------------
  |  |    7|  9.05k|      _mm256_permute2f128_si256(_mm256_castsi128_si256(xmm1),                  \
  |  |    8|  9.05k|                                _mm256_castsi128_si256(xmm2), 2)
  ------------------
  417|       |      // 5. store bytes
  418|  9.05k|      _mm_storeu_si128((__m128i *)utf8_output,
  419|  9.05k|                       _mm256_castsi256_si128(utf8_packed));
  420|  9.05k|      utf8_output += row[0];
  421|  9.05k|      _mm_storeu_si128((__m128i *)utf8_output,
  422|  9.05k|                       _mm256_extractf128_si256(utf8_packed, 1));
  423|  9.05k|      utf8_output += row_2[0];
  424|       |
  425|       |      // 6. adjust pointers
  426|  9.05k|      buf += 16;
  427|  9.05k|      continue;
  428|  9.05k|    }
  429|       |    // 1. Check if there are any surrogate word in the input chunk.
  430|       |    //    We have also deal with situation when there is a surrogate word
  431|       |    //    at the end of a chunk.
  432|  1.81M|    const __m256i surrogates_bytemask =
  433|  1.81M|        _mm256_cmpeq_epi16(_mm256_and_si256(in, v_f800), v_d800);
  434|       |
  435|       |    // bitmask = 0x0000 if there are no surrogates
  436|       |    //         = 0xc000 if the last word is a surrogate
  437|  1.81M|    const uint32_t surrogates_bitmask =
  438|  1.81M|        static_cast<uint32_t>(_mm256_movemask_epi8(surrogates_bytemask));
  439|       |    // It might seem like checking for surrogates_bitmask == 0xc000 could help.
  440|       |    // However, it is likely an uncommon occurrence.
  441|  1.81M|    if (surrogates_bitmask == 0x00000000) {
  ------------------
  |  Branch (441:9): [True: 1.04M, False: 775k]
  ------------------
  442|       |      // case: code units from register produce either 1, 2 or 3 UTF-8 bytes
  443|  1.04M|      const __m256i dup_even = _mm256_setr_epi16(
  444|  1.04M|          0x0000, 0x0202, 0x0404, 0x0606, 0x0808, 0x0a0a, 0x0c0c, 0x0e0e,
  445|  1.04M|          0x0000, 0x0202, 0x0404, 0x0606, 0x0808, 0x0a0a, 0x0c0c, 0x0e0e);
  446|       |
  447|       |      /* In this branch we handle three cases:
  448|       |         1. [0000|0000|0ccc|cccc] => [0ccc|cccc]                           -
  449|       |        single UFT-8 byte
  450|       |         2. [0000|0bbb|bbcc|cccc] => [110b|bbbb], [10cc|cccc]              - two
  451|       |        UTF-8 bytes
  452|       |         3. [aaaa|bbbb|bbcc|cccc] => [1110|aaaa], [10bb|bbbb], [10cc|cccc] -
  453|       |        three UTF-8 bytes
  454|       |
  455|       |        We expand the input word (16-bit) into two code units (32-bit), thus
  456|       |        we have room for four bytes. However, we need five distinct bit
  457|       |        layouts. Note that the last byte in cases #2 and #3 is the same.
  458|       |
  459|       |        We precompute byte 1 for case #1 and the common byte for cases #2 & #3
  460|       |        in register t2.
  461|       |
  462|       |        We precompute byte 1 for case #3 and -- **conditionally** -- precompute
  463|       |        either byte 1 for case #2 or byte 2 for case #3. Note that they
  464|       |        differ by exactly one bit.
  465|       |
  466|       |        Finally from these two code units we build proper UTF-8 sequence, taking
  467|       |        into account the case (i.e, the number of bytes to write).
  468|       |      */
  469|       |      /**
  470|       |       * Given [aaaa|bbbb|bbcc|cccc] our goal is to produce:
  471|       |       * t2 => [0ccc|cccc] [10cc|cccc]
  472|       |       * s4 => [1110|aaaa] ([110b|bbbb] OR [10bb|bbbb])
  473|       |       */
  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  475|       |      // [aaaa|bbbb|bbcc|cccc] => [bbcc|cccc|bbcc|cccc]
  476|  1.04M|      const __m256i t0 = _mm256_shuffle_epi8(in, dup_even);
  477|       |      // [bbcc|cccc|bbcc|cccc] => [00cc|cccc|0bcc|cccc]
  478|  1.04M|      const __m256i t1 = _mm256_and_si256(t0, simdutf_vec(0b0011111101111111));
  ------------------
  |  |  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  479|       |      // [00cc|cccc|0bcc|cccc] => [10cc|cccc|0bcc|cccc]
  480|  1.04M|      const __m256i t2 = _mm256_or_si256(t1, simdutf_vec(0b1000000000000000));
  ------------------
  |  |  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  481|       |
  482|       |      // [aaaa|bbbb|bbcc|cccc] =>  [0000|aaaa|bbbb|bbcc]
  483|  1.04M|      const __m256i s0 = _mm256_srli_epi16(in, 4);
  484|       |      // [0000|aaaa|bbbb|bbcc] => [0000|aaaa|bbbb|bb00]
  485|  1.04M|      const __m256i s1 = _mm256_and_si256(s0, simdutf_vec(0b0000111111111100));
  ------------------
  |  |  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  486|       |      // [0000|aaaa|bbbb|bb00] => [00bb|bbbb|0000|aaaa]
  487|  1.04M|      const __m256i s2 = _mm256_maddubs_epi16(s1, simdutf_vec(0x0140));
  ------------------
  |  |  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  488|       |      // [00bb|bbbb|0000|aaaa] => [11bb|bbbb|1110|aaaa]
  489|  1.04M|      const __m256i s3 = _mm256_or_si256(s2, simdutf_vec(0b1100000011100000));
  ------------------
  |  |  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  490|  1.04M|      const __m256i m0 = _mm256_andnot_si256(one_or_two_bytes_bytemask,
  491|  1.04M|                                             simdutf_vec(0b0100000000000000));
  ------------------
  |  |  474|  1.04M|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  492|  1.04M|      const __m256i s4 = _mm256_xor_si256(s3, m0);
  493|  1.04M|#undef simdutf_vec
  494|       |
  495|       |      // 4. expand code units 16-bit => 32-bit
  496|  1.04M|      const __m256i out0 = _mm256_unpacklo_epi16(t2, s4);
  497|  1.04M|      const __m256i out1 = _mm256_unpackhi_epi16(t2, s4);
  498|       |
  499|       |      // 5. compress 32-bit code units into 1, 2 or 3 bytes -- 2 x shuffle
  500|  1.04M|      const uint32_t mask = (one_byte_bitmask & 0x55555555) |
  501|  1.04M|                            (one_or_two_bytes_bitmask & 0xaaaaaaaa);
  502|       |      // Due to the wider registers, the following path is less likely to be
  503|       |      // useful.
  504|       |      /*if(mask == 0) {
  505|       |        // We only have three-byte code units. Use fast path.
  506|       |        const __m256i shuffle =
  507|       |      _mm256_setr_epi8(2,3,1,6,7,5,10,11,9,14,15,13,-1,-1,-1,-1,
  508|       |      2,3,1,6,7,5,10,11,9,14,15,13,-1,-1,-1,-1); const __m256i utf8_0 =
  509|       |      _mm256_shuffle_epi8(out0, shuffle); const __m256i utf8_1 =
  510|       |      _mm256_shuffle_epi8(out1, shuffle);
  511|       |        _mm_storeu_si128((__m128i*)utf8_output, _mm256_castsi256_si128(utf8_0));
  512|       |        utf8_output += 12;
  513|       |        _mm_storeu_si128((__m128i*)utf8_output, _mm256_castsi256_si128(utf8_1));
  514|       |        utf8_output += 12;
  515|       |        _mm_storeu_si128((__m128i*)utf8_output,
  516|       |      _mm256_extractf128_si256(utf8_0,1)); utf8_output += 12;
  517|       |        _mm_storeu_si128((__m128i*)utf8_output,
  518|       |      _mm256_extractf128_si256(utf8_1,1)); utf8_output += 12; buf += 16;
  519|       |        continue;
  520|       |      }*/
  521|  1.04M|      const uint8_t mask0 = uint8_t(mask);
  522|  1.04M|      const uint8_t *row0 =
  523|  1.04M|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
  524|  1.04M|      const __m128i shuffle0 = _mm_loadu_si128((__m128i *)(row0 + 1));
  525|  1.04M|      const __m128i utf8_0 =
  526|  1.04M|          _mm_shuffle_epi8(_mm256_castsi256_si128(out0), shuffle0);
  527|       |
  528|  1.04M|      const uint8_t mask1 = static_cast<uint8_t>(mask >> 8);
  529|  1.04M|      const uint8_t *row1 =
  530|  1.04M|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
  531|  1.04M|      const __m128i shuffle1 = _mm_loadu_si128((__m128i *)(row1 + 1));
  532|  1.04M|      const __m128i utf8_1 =
  533|  1.04M|          _mm_shuffle_epi8(_mm256_castsi256_si128(out1), shuffle1);
  534|       |
  535|  1.04M|      const uint8_t mask2 = static_cast<uint8_t>(mask >> 16);
  536|  1.04M|      const uint8_t *row2 =
  537|  1.04M|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
  538|  1.04M|      const __m128i shuffle2 = _mm_loadu_si128((__m128i *)(row2 + 1));
  539|  1.04M|      const __m128i utf8_2 =
  540|  1.04M|          _mm_shuffle_epi8(_mm256_extractf128_si256(out0, 1), shuffle2);
  541|       |
  542|  1.04M|      const uint8_t mask3 = static_cast<uint8_t>(mask >> 24);
  543|  1.04M|      const uint8_t *row3 =
  544|  1.04M|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
  545|  1.04M|      const __m128i shuffle3 = _mm_loadu_si128((__m128i *)(row3 + 1));
  546|  1.04M|      const __m128i utf8_3 =
  547|  1.04M|          _mm_shuffle_epi8(_mm256_extractf128_si256(out1, 1), shuffle3);
  548|       |
  549|  1.04M|      _mm_storeu_si128((__m128i *)utf8_output, utf8_0);
  550|  1.04M|      utf8_output += row0[0];
  551|  1.04M|      _mm_storeu_si128((__m128i *)utf8_output, utf8_1);
  552|  1.04M|      utf8_output += row1[0];
  553|  1.04M|      _mm_storeu_si128((__m128i *)utf8_output, utf8_2);
  554|  1.04M|      utf8_output += row2[0];
  555|  1.04M|      _mm_storeu_si128((__m128i *)utf8_output, utf8_3);
  556|  1.04M|      utf8_output += row3[0];
  557|  1.04M|      buf += 16;
  558|       |      // surrogate pair(s) in a register
  559|  1.04M|    } else {
  560|       |      // Let us do a scalar fallback.
  561|       |      // It may seem wasteful to use scalar code, but being efficient with SIMD
  562|       |      // in the presence of surrogate pairs may require non-trivial tables.
  563|   775k|      size_t forward = 15;
  564|   775k|      size_t k = 0;
  565|   775k|      if (size_t(end - buf) < forward + 1) {
  ------------------
  |  Branch (565:11): [True: 0, False: 775k]
  ------------------
  566|      0|        forward = size_t(end - buf - 1);
  567|      0|      }
  568|  2.35M|      for (; k < forward; k++) {
  ------------------
  |  Branch (568:14): [True: 2.34M, False: 7.05k]
  ------------------
  569|  2.34M|        uint16_t word = scalar::utf16::swap_if_needed<big_endian>(buf[k]);
  570|  2.34M|        if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (570:13): [True: 121k, False: 2.22M]
  ------------------
  571|   121k|          *utf8_output++ = char(word);
  572|  2.22M|        } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (572:20): [True: 73.6k, False: 2.15M]
  ------------------
  573|  73.6k|          *utf8_output++ = char((word >> 6) | 0b11000000);
  574|  73.6k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  575|  2.15M|        } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (575:20): [True: 1.23M, False: 918k]
  ------------------
  576|  1.23M|          *utf8_output++ = char((word >> 12) | 0b11100000);
  577|  1.23M|          *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  578|  1.23M|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  579|  1.23M|        } else {
  580|       |          // must be a surrogate pair
  581|   918k|          uint16_t diff = uint16_t(word - 0xD800);
  582|   918k|          uint16_t next_word =
  583|   918k|              scalar::utf16::swap_if_needed<big_endian>(buf[k + 1]);
  584|   918k|          k++;
  585|   918k|          uint16_t diff2 = uint16_t(next_word - 0xDC00);
  586|   918k|          if ((diff | diff2) > 0x3FF) {
  ------------------
  |  Branch (586:15): [True: 768k, False: 150k]
  ------------------
  587|   768k|            return std::make_pair(
  588|   768k|                result(error_code::SURROGATE, buf - start + k - 1),
  589|   768k|                utf8_output);
  590|   768k|          }
  591|   150k|          uint32_t value = (diff << 10) + diff2 + 0x10000;
  592|   150k|          *utf8_output++ = char((value >> 18) | 0b11110000);
  593|   150k|          *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  594|   150k|          *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  595|   150k|          *utf8_output++ = char((value & 0b111111) | 0b10000000);
  596|   150k|        }
  597|  2.34M|      }
  598|  7.05k|      buf += k;
  599|  7.05k|    }
  600|  1.81M|  } // while
  601|  3.56k|  return std::make_pair(result(error_code::SUCCESS, buf - start), utf8_output);
  602|   771k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_138avx2_convert_utf16_to_utf8_with_errorsILNS_10endiannessE1EEENSt3__14pairINS_6resultEPcEEPKDsmS7_:
  333|   534k|                                       char *utf8_output) {
  334|   534k|  const char16_t *start = buf;
  335|   534k|  const char16_t *end = buf + len;
  336|       |
  337|   534k|  const __m256i v_0000 = _mm256_setzero_si256();
  338|   534k|  const __m256i v_f800 = _mm256_set1_epi16((int16_t)0xf800);
  339|   534k|  const __m256i v_d800 = _mm256_set1_epi16((int16_t)0xd800);
  340|   534k|  const __m256i v_c080 = _mm256_set1_epi16((int16_t)0xc080);
  341|   534k|  const size_t safety_margin =
  342|   534k|      12; // to avoid overruns, see issue
  343|       |          // https://github.com/simdutf/simdutf/issues/92
  344|       |
  345|  1.74M|  while (end - buf >= std::ptrdiff_t(16 + safety_margin)) {
  ------------------
  |  Branch (345:10): [True: 1.74M, False: 3.77k]
  ------------------
  346|  1.74M|    __m256i in = _mm256_loadu_si256((__m256i *)buf);
  347|  1.74M|    if (big_endian) {
  ------------------
  |  Branch (347:9): [True: 1.74M, Folded]
  ------------------
  348|  1.74M|      const __m256i swap = _mm256_setr_epi8(
  349|  1.74M|          1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14, 17, 16, 19, 18,
  350|  1.74M|          21, 20, 23, 22, 25, 24, 27, 26, 29, 28, 31, 30);
  351|  1.74M|      in = _mm256_shuffle_epi8(in, swap);
  352|  1.74M|    }
  353|       |    // a single 16-bit UTF-16 word can yield 1, 2 or 3 UTF-8 bytes
  354|  1.74M|    const __m256i v_ff80 = _mm256_set1_epi16((int16_t)0xff80);
  355|  1.74M|    if (_mm256_testz_si256(in, v_ff80)) { // ASCII fast path!!!!
  ------------------
  |  Branch (355:9): [True: 402k, False: 1.34M]
  ------------------
  356|       |      // 1. pack the bytes
  357|   402k|      const __m128i utf8_packed = _mm_packus_epi16(
  358|   402k|          _mm256_castsi256_si128(in), _mm256_extractf128_si256(in, 1));
  359|       |      // 2. store (16 bytes)
  360|   402k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
  361|       |      // 3. adjust pointers
  362|   402k|      buf += 16;
  363|   402k|      utf8_output += 16;
  364|   402k|      continue; // we are done for this round!
  365|   402k|    }
  366|       |    // no bits set above 7th bit
  367|  1.34M|    const __m256i one_byte_bytemask =
  368|  1.34M|        _mm256_cmpeq_epi16(_mm256_and_si256(in, v_ff80), v_0000);
  369|  1.34M|    const uint32_t one_byte_bitmask =
  370|  1.34M|        static_cast<uint32_t>(_mm256_movemask_epi8(one_byte_bytemask));
  371|       |
  372|       |    // no bits set above 11th bit
  373|  1.34M|    const __m256i one_or_two_bytes_bytemask =
  374|  1.34M|        _mm256_cmpeq_epi16(_mm256_and_si256(in, v_f800), v_0000);
  375|  1.34M|    const uint32_t one_or_two_bytes_bitmask =
  376|  1.34M|        static_cast<uint32_t>(_mm256_movemask_epi8(one_or_two_bytes_bytemask));
  377|  1.34M|    if (one_or_two_bytes_bitmask == 0xffffffff) {
  ------------------
  |  Branch (377:9): [True: 9.08k, False: 1.33M]
  ------------------
  378|       |
  379|       |      // 1. prepare 2-byte values
  380|       |      // input 16-bit word : [0000|0aaa|aabb|bbbb] x 8
  381|       |      // expected output   : [110a|aaaa|10bb|bbbb] x 8
  382|  9.08k|      const __m256i v_1f00 = _mm256_set1_epi16((int16_t)0x1f00);
  383|  9.08k|      const __m256i v_003f = _mm256_set1_epi16((int16_t)0x003f);
  384|       |
  385|       |      // t0 = [000a|aaaa|bbbb|bb00]
  386|  9.08k|      const __m256i t0 = _mm256_slli_epi16(in, 2);
  387|       |      // t1 = [000a|aaaa|0000|0000]
  388|  9.08k|      const __m256i t1 = _mm256_and_si256(t0, v_1f00);
  389|       |      // t2 = [0000|0000|00bb|bbbb]
  390|  9.08k|      const __m256i t2 = _mm256_and_si256(in, v_003f);
  391|       |      // t3 = [000a|aaaa|00bb|bbbb]
  392|  9.08k|      const __m256i t3 = _mm256_or_si256(t1, t2);
  393|       |      // t4 = [110a|aaaa|10bb|bbbb]
  394|  9.08k|      const __m256i t4 = _mm256_or_si256(t3, v_c080);
  395|       |
  396|       |      // 2. merge ASCII and 2-byte codewords
  397|  9.08k|      const __m256i utf8_unpacked =
  398|  9.08k|          _mm256_blendv_epi8(t4, in, one_byte_bytemask);
  399|       |
  400|       |      // 3. prepare bitmask for 8-bit lookup
  401|  9.08k|      const uint32_t M0 = one_byte_bitmask & 0x55555555;
  402|  9.08k|      const uint32_t M1 = M0 >> 7;
  403|  9.08k|      const uint32_t M2 = (M1 | M0) & 0x00ff00ff;
  404|       |      // 4. pack the bytes
  405|       |
  406|  9.08k|      const uint8_t *row =
  407|  9.08k|          &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
  408|  9.08k|      const uint8_t *row_2 =
  409|  9.08k|          &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2 >>
  410|  9.08k|                                                                       16)][0];
  411|       |
  412|  9.08k|      const __m128i shuffle = _mm_loadu_si128((__m128i *)(row + 1));
  413|  9.08k|      const __m128i shuffle_2 = _mm_loadu_si128((__m128i *)(row_2 + 1));
  414|       |
  415|  9.08k|      const __m256i utf8_packed = _mm256_shuffle_epi8(
  416|  9.08k|          utf8_unpacked, _mm256_setr_m128i(shuffle, shuffle_2));
  ------------------
  |  |    7|  9.08k|      _mm256_permute2f128_si256(_mm256_castsi128_si256(xmm1),                  \
  |  |    8|  9.08k|                                _mm256_castsi128_si256(xmm2), 2)
  ------------------
  417|       |      // 5. store bytes
  418|  9.08k|      _mm_storeu_si128((__m128i *)utf8_output,
  419|  9.08k|                       _mm256_castsi256_si128(utf8_packed));
  420|  9.08k|      utf8_output += row[0];
  421|  9.08k|      _mm_storeu_si128((__m128i *)utf8_output,
  422|  9.08k|                       _mm256_extractf128_si256(utf8_packed, 1));
  423|  9.08k|      utf8_output += row_2[0];
  424|       |
  425|       |      // 6. adjust pointers
  426|  9.08k|      buf += 16;
  427|  9.08k|      continue;
  428|  9.08k|    }
  429|       |    // 1. Check if there are any surrogate word in the input chunk.
  430|       |    //    We have also deal with situation when there is a surrogate word
  431|       |    //    at the end of a chunk.
  432|  1.33M|    const __m256i surrogates_bytemask =
  433|  1.33M|        _mm256_cmpeq_epi16(_mm256_and_si256(in, v_f800), v_d800);
  434|       |
  435|       |    // bitmask = 0x0000 if there are no surrogates
  436|       |    //         = 0xc000 if the last word is a surrogate
  437|  1.33M|    const uint32_t surrogates_bitmask =
  438|  1.33M|        static_cast<uint32_t>(_mm256_movemask_epi8(surrogates_bytemask));
  439|       |    // It might seem like checking for surrogates_bitmask == 0xc000 could help.
  440|       |    // However, it is likely an uncommon occurrence.
  441|  1.33M|    if (surrogates_bitmask == 0x00000000) {
  ------------------
  |  Branch (441:9): [True: 797k, False: 535k]
  ------------------
  442|       |      // case: code units from register produce either 1, 2 or 3 UTF-8 bytes
  443|   797k|      const __m256i dup_even = _mm256_setr_epi16(
  444|   797k|          0x0000, 0x0202, 0x0404, 0x0606, 0x0808, 0x0a0a, 0x0c0c, 0x0e0e,
  445|   797k|          0x0000, 0x0202, 0x0404, 0x0606, 0x0808, 0x0a0a, 0x0c0c, 0x0e0e);
  446|       |
  447|       |      /* In this branch we handle three cases:
  448|       |         1. [0000|0000|0ccc|cccc] => [0ccc|cccc]                           -
  449|       |        single UFT-8 byte
  450|       |         2. [0000|0bbb|bbcc|cccc] => [110b|bbbb], [10cc|cccc]              - two
  451|       |        UTF-8 bytes
  452|       |         3. [aaaa|bbbb|bbcc|cccc] => [1110|aaaa], [10bb|bbbb], [10cc|cccc] -
  453|       |        three UTF-8 bytes
  454|       |
  455|       |        We expand the input word (16-bit) into two code units (32-bit), thus
  456|       |        we have room for four bytes. However, we need five distinct bit
  457|       |        layouts. Note that the last byte in cases #2 and #3 is the same.
  458|       |
  459|       |        We precompute byte 1 for case #1 and the common byte for cases #2 & #3
  460|       |        in register t2.
  461|       |
  462|       |        We precompute byte 1 for case #3 and -- **conditionally** -- precompute
  463|       |        either byte 1 for case #2 or byte 2 for case #3. Note that they
  464|       |        differ by exactly one bit.
  465|       |
  466|       |        Finally from these two code units we build proper UTF-8 sequence, taking
  467|       |        into account the case (i.e, the number of bytes to write).
  468|       |      */
  469|       |      /**
  470|       |       * Given [aaaa|bbbb|bbcc|cccc] our goal is to produce:
  471|       |       * t2 => [0ccc|cccc] [10cc|cccc]
  472|       |       * s4 => [1110|aaaa] ([110b|bbbb] OR [10bb|bbbb])
  473|       |       */
  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  475|       |      // [aaaa|bbbb|bbcc|cccc] => [bbcc|cccc|bbcc|cccc]
  476|   797k|      const __m256i t0 = _mm256_shuffle_epi8(in, dup_even);
  477|       |      // [bbcc|cccc|bbcc|cccc] => [00cc|cccc|0bcc|cccc]
  478|   797k|      const __m256i t1 = _mm256_and_si256(t0, simdutf_vec(0b0011111101111111));
  ------------------
  |  |  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  479|       |      // [00cc|cccc|0bcc|cccc] => [10cc|cccc|0bcc|cccc]
  480|   797k|      const __m256i t2 = _mm256_or_si256(t1, simdutf_vec(0b1000000000000000));
  ------------------
  |  |  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  481|       |
  482|       |      // [aaaa|bbbb|bbcc|cccc] =>  [0000|aaaa|bbbb|bbcc]
  483|   797k|      const __m256i s0 = _mm256_srli_epi16(in, 4);
  484|       |      // [0000|aaaa|bbbb|bbcc] => [0000|aaaa|bbbb|bb00]
  485|   797k|      const __m256i s1 = _mm256_and_si256(s0, simdutf_vec(0b0000111111111100));
  ------------------
  |  |  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  486|       |      // [0000|aaaa|bbbb|bb00] => [00bb|bbbb|0000|aaaa]
  487|   797k|      const __m256i s2 = _mm256_maddubs_epi16(s1, simdutf_vec(0x0140));
  ------------------
  |  |  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  488|       |      // [00bb|bbbb|0000|aaaa] => [11bb|bbbb|1110|aaaa]
  489|   797k|      const __m256i s3 = _mm256_or_si256(s2, simdutf_vec(0b1100000011100000));
  ------------------
  |  |  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  490|   797k|      const __m256i m0 = _mm256_andnot_si256(one_or_two_bytes_bytemask,
  491|   797k|                                             simdutf_vec(0b0100000000000000));
  ------------------
  |  |  474|   797k|#define simdutf_vec(x) _mm256_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  492|   797k|      const __m256i s4 = _mm256_xor_si256(s3, m0);
  493|   797k|#undef simdutf_vec
  494|       |
  495|       |      // 4. expand code units 16-bit => 32-bit
  496|   797k|      const __m256i out0 = _mm256_unpacklo_epi16(t2, s4);
  497|   797k|      const __m256i out1 = _mm256_unpackhi_epi16(t2, s4);
  498|       |
  499|       |      // 5. compress 32-bit code units into 1, 2 or 3 bytes -- 2 x shuffle
  500|   797k|      const uint32_t mask = (one_byte_bitmask & 0x55555555) |
  501|   797k|                            (one_or_two_bytes_bitmask & 0xaaaaaaaa);
  502|       |      // Due to the wider registers, the following path is less likely to be
  503|       |      // useful.
  504|       |      /*if(mask == 0) {
  505|       |        // We only have three-byte code units. Use fast path.
  506|       |        const __m256i shuffle =
  507|       |      _mm256_setr_epi8(2,3,1,6,7,5,10,11,9,14,15,13,-1,-1,-1,-1,
  508|       |      2,3,1,6,7,5,10,11,9,14,15,13,-1,-1,-1,-1); const __m256i utf8_0 =
  509|       |      _mm256_shuffle_epi8(out0, shuffle); const __m256i utf8_1 =
  510|       |      _mm256_shuffle_epi8(out1, shuffle);
  511|       |        _mm_storeu_si128((__m128i*)utf8_output, _mm256_castsi256_si128(utf8_0));
  512|       |        utf8_output += 12;
  513|       |        _mm_storeu_si128((__m128i*)utf8_output, _mm256_castsi256_si128(utf8_1));
  514|       |        utf8_output += 12;
  515|       |        _mm_storeu_si128((__m128i*)utf8_output,
  516|       |      _mm256_extractf128_si256(utf8_0,1)); utf8_output += 12;
  517|       |        _mm_storeu_si128((__m128i*)utf8_output,
  518|       |      _mm256_extractf128_si256(utf8_1,1)); utf8_output += 12; buf += 16;
  519|       |        continue;
  520|       |      }*/
  521|   797k|      const uint8_t mask0 = uint8_t(mask);
  522|   797k|      const uint8_t *row0 =
  523|   797k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
  524|   797k|      const __m128i shuffle0 = _mm_loadu_si128((__m128i *)(row0 + 1));
  525|   797k|      const __m128i utf8_0 =
  526|   797k|          _mm_shuffle_epi8(_mm256_castsi256_si128(out0), shuffle0);
  527|       |
  528|   797k|      const uint8_t mask1 = static_cast<uint8_t>(mask >> 8);
  529|   797k|      const uint8_t *row1 =
  530|   797k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
  531|   797k|      const __m128i shuffle1 = _mm_loadu_si128((__m128i *)(row1 + 1));
  532|   797k|      const __m128i utf8_1 =
  533|   797k|          _mm_shuffle_epi8(_mm256_castsi256_si128(out1), shuffle1);
  534|       |
  535|   797k|      const uint8_t mask2 = static_cast<uint8_t>(mask >> 16);
  536|   797k|      const uint8_t *row2 =
  537|   797k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
  538|   797k|      const __m128i shuffle2 = _mm_loadu_si128((__m128i *)(row2 + 1));
  539|   797k|      const __m128i utf8_2 =
  540|   797k|          _mm_shuffle_epi8(_mm256_extractf128_si256(out0, 1), shuffle2);
  541|       |
  542|   797k|      const uint8_t mask3 = static_cast<uint8_t>(mask >> 24);
  543|   797k|      const uint8_t *row3 =
  544|   797k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
  545|   797k|      const __m128i shuffle3 = _mm_loadu_si128((__m128i *)(row3 + 1));
  546|   797k|      const __m128i utf8_3 =
  547|   797k|          _mm_shuffle_epi8(_mm256_extractf128_si256(out1, 1), shuffle3);
  548|       |
  549|   797k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_0);
  550|   797k|      utf8_output += row0[0];
  551|   797k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_1);
  552|   797k|      utf8_output += row1[0];
  553|   797k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_2);
  554|   797k|      utf8_output += row2[0];
  555|   797k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_3);
  556|   797k|      utf8_output += row3[0];
  557|   797k|      buf += 16;
  558|       |      // surrogate pair(s) in a register
  559|   797k|    } else {
  560|       |      // Let us do a scalar fallback.
  561|       |      // It may seem wasteful to use scalar code, but being efficient with SIMD
  562|       |      // in the presence of surrogate pairs may require non-trivial tables.
  563|   535k|      size_t forward = 15;
  564|   535k|      size_t k = 0;
  565|   535k|      if (size_t(end - buf) < forward + 1) {
  ------------------
  |  Branch (565:11): [True: 0, False: 535k]
  ------------------
  566|      0|        forward = size_t(end - buf - 1);
  567|      0|      }
  568|  1.48M|      for (; k < forward; k++) {
  ------------------
  |  Branch (568:14): [True: 1.48M, False: 5.18k]
  ------------------
  569|  1.48M|        uint16_t word = scalar::utf16::swap_if_needed<big_endian>(buf[k]);
  570|  1.48M|        if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (570:13): [True: 99.5k, False: 1.38M]
  ------------------
  571|  99.5k|          *utf8_output++ = char(word);
  572|  1.38M|        } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (572:20): [True: 52.8k, False: 1.33M]
  ------------------
  573|  52.8k|          *utf8_output++ = char((word >> 6) | 0b11000000);
  574|  52.8k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  575|  1.33M|        } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (575:20): [True: 707k, False: 623k]
  ------------------
  576|   707k|          *utf8_output++ = char((word >> 12) | 0b11100000);
  577|   707k|          *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  578|   707k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  579|   707k|        } else {
  580|       |          // must be a surrogate pair
  581|   623k|          uint16_t diff = uint16_t(word - 0xD800);
  582|   623k|          uint16_t next_word =
  583|   623k|              scalar::utf16::swap_if_needed<big_endian>(buf[k + 1]);
  584|   623k|          k++;
  585|   623k|          uint16_t diff2 = uint16_t(next_word - 0xDC00);
  586|   623k|          if ((diff | diff2) > 0x3FF) {
  ------------------
  |  Branch (586:15): [True: 530k, False: 92.6k]
  ------------------
  587|   530k|            return std::make_pair(
  588|   530k|                result(error_code::SURROGATE, buf - start + k - 1),
  589|   530k|                utf8_output);
  590|   530k|          }
  591|  92.6k|          uint32_t value = (diff << 10) + diff2 + 0x10000;
  592|  92.6k|          *utf8_output++ = char((value >> 18) | 0b11110000);
  593|  92.6k|          *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  594|  92.6k|          *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  595|  92.6k|          *utf8_output++ = char((value & 0b111111) | 0b10000000);
  596|  92.6k|        }
  597|  1.48M|      }
  598|  5.18k|      buf += k;
  599|  5.18k|    }
  600|  1.33M|  } // while
  601|  3.77k|  return std::make_pair(result(error_code::SUCCESS, buf - start), utf8_output);
  602|   534k|}

_ZNK7simdutf7haswell14implementation13validate_utf8EPKcm:
  266|  2.25k|implementation::validate_utf8(const char *buf, size_t len) const noexcept {
  267|  2.25k|  return haswell::utf8_validation::generic_validate_utf8(buf, len);
  268|  2.25k|}
_ZNK7simdutf7haswell14implementation35convert_utf16le_to_utf8_with_errorsEPKDsmPc:
  721|   771k|    const char16_t *buf, size_t len, char *utf8_output) const noexcept {
  722|       |  // ret.first.count is always the position in the buffer, not the number of
  723|       |  // code units written even if finished
  724|   771k|  std::pair<result, char *> ret =
  725|   771k|      haswell::avx2_convert_utf16_to_utf8_with_errors<endianness::LITTLE>(
  726|   771k|          buf, len, utf8_output);
  727|   771k|  if (ret.first.error) {
  ------------------
  |  Branch (727:7): [True: 768k, False: 3.56k]
  ------------------
  728|   768k|    return ret.first;
  729|   768k|  } // Can return directly since scalar fallback already found correct
  730|       |    // ret.first.count
  731|  3.56k|  if (ret.first.count != len) { // All good so far, but not finished
  ------------------
  |  Branch (731:7): [True: 3.56k, False: 0]
  ------------------
  732|  3.56k|    result scalar_res =
  733|  3.56k|        scalar::utf16_to_utf8::convert_with_errors<endianness::LITTLE>(
  734|  3.56k|            buf + ret.first.count, len - ret.first.count, ret.second);
  735|  3.56k|    if (scalar_res.error) {
  ------------------
  |  Branch (735:9): [True: 2.76k, False: 800]
  ------------------
  736|  2.76k|      scalar_res.count += ret.first.count;
  737|  2.76k|      return scalar_res;
  738|  2.76k|    } else {
  739|    800|      ret.second += scalar_res.count;
  740|    800|    }
  741|  3.56k|  }
  742|    800|  ret.first.count =
  743|    800|      ret.second -
  744|    800|      utf8_output; // Set count to the number of 8-bit code units written
  745|    800|  return ret.first;
  746|  3.56k|}
_ZNK7simdutf7haswell14implementation35convert_utf16be_to_utf8_with_errorsEPKDsmPc:
  749|   534k|    const char16_t *buf, size_t len, char *utf8_output) const noexcept {
  750|       |  // ret.first.count is always the position in the buffer, not the number of
  751|       |  // code units written even if finished
  752|   534k|  std::pair<result, char *> ret =
  753|   534k|      haswell::avx2_convert_utf16_to_utf8_with_errors<endianness::BIG>(
  754|   534k|          buf, len, utf8_output);
  755|   534k|  if (ret.first.error) {
  ------------------
  |  Branch (755:7): [True: 530k, False: 3.77k]
  ------------------
  756|   530k|    return ret.first;
  757|   530k|  } // Can return directly since scalar fallback already found correct
  758|       |    // ret.first.count
  759|  3.77k|  if (ret.first.count != len) { // All good so far, but not finished
  ------------------
  |  Branch (759:7): [True: 3.77k, False: 0]
  ------------------
  760|  3.77k|    result scalar_res =
  761|  3.77k|        scalar::utf16_to_utf8::convert_with_errors<endianness::BIG>(
  762|  3.77k|            buf + ret.first.count, len - ret.first.count, ret.second);
  763|  3.77k|    if (scalar_res.error) {
  ------------------
  |  Branch (763:9): [True: 2.96k, False: 807]
  ------------------
  764|  2.96k|      scalar_res.count += ret.first.count;
  765|  2.96k|      return scalar_res;
  766|  2.96k|    } else {
  767|    807|      ret.second += scalar_res.count;
  768|    807|    }
  769|  3.77k|  }
  770|    807|  ret.first.count =
  771|    807|      ret.second -
  772|    807|      utf8_output; // Set count to the number of 8-bit code units written
  773|    807|  return ret.first;
  774|  3.77k|}
_ZNK7simdutf7haswell14implementation24utf8_length_from_utf16leEPKDsm:
 1131|   771k|    const char16_t *input, size_t length) const noexcept {
 1132|   771k|  return utf16::utf8_length_from_utf16_bytemask<endianness::LITTLE>(input,
 1133|   771k|                                                                    length);
 1134|   771k|}
_ZNK7simdutf7haswell14implementation24utf8_length_from_utf16beEPKDsm:
 1137|   533k|    const char16_t *input, size_t length) const noexcept {
 1138|   533k|  return utf16::utf8_length_from_utf16_bytemask<endianness::BIG>(input, length);
 1139|   533k|}
_ZNK7simdutf7haswell14implementation41utf8_length_from_utf16le_with_replacementEPKDsm:
 1161|  1.12k|    const char16_t *input, size_t length) const noexcept {
 1162|  1.12k|  return utf16::utf8_length_from_utf16_with_replacement<endianness::LITTLE>(
 1163|  1.12k|      input, length);
 1164|  1.12k|}
_ZNK7simdutf7haswell14implementation41utf8_length_from_utf16be_with_replacementEPKDsm:
 1168|  1.12k|    const char16_t *input, size_t length) const noexcept {
 1169|  1.12k|  return utf16::utf8_length_from_utf16_with_replacement<endianness::BIG>(
 1170|  1.12k|      input, length);
 1171|  1.12k|}
_ZNK7simdutf7haswell14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPc:
 1175|  1.12k|    const char16_t *input, size_t length, char *utf8_buffer) const noexcept {
 1176|  1.12k|  return utf16_to_utf8::convert_with_replacement_via(
 1177|  1.12k|      [this](const char16_t *b, size_t l, char *o) {
 1178|  1.12k|        return this->convert_utf16le_to_utf8_with_errors(b, l, o);
 1179|  1.12k|      },
 1180|  1.12k|      [this](const char16_t *b, size_t l) {
 1181|  1.12k|        return this->utf8_length_from_utf16le(b, l);
 1182|  1.12k|      },
 1183|  1.12k|      input, length, utf8_buffer);
 1184|  1.12k|}
_ZNK7simdutf7haswell14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPc:
 1188|  1.12k|    const char16_t *input, size_t length, char *utf8_buffer) const noexcept {
 1189|  1.12k|  return utf16_to_utf8::convert_with_replacement_via(
 1190|  1.12k|      [this](const char16_t *b, size_t l, char *o) {
 1191|  1.12k|        return this->convert_utf16be_to_utf8_with_errors(b, l, o);
 1192|  1.12k|      },
 1193|  1.12k|      [this](const char16_t *b, size_t l) {
 1194|  1.12k|        return this->utf8_length_from_utf16be(b, l);
 1195|  1.12k|      },
 1196|  1.12k|      input, length, utf8_buffer);
 1197|  1.12k|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_18is_asciiERKNS1_4simd8simd8x64IhEE:
   13|  1.70M|simdutf_really_inline bool is_ascii(const simd8x64<uint8_t> &input) {
   14|  1.70M|  return input.reduce_or().is_ascii();
   15|  1.70M|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_124must_be_2_3_continuationENS1_4simd5simd8IhEES4_:
   22|  3.02M|                         const simd8<uint8_t> prev3) {
   23|  3.02M|  simd8<uint8_t> is_third_byte =
   24|  3.02M|      prev2.saturating_sub(0xe0u - 0x80); // Only 111_____ will be > 0x80
   25|  3.02M|  simd8<uint8_t> is_fourth_byte =
   26|  3.02M|      prev3.saturating_sub(0xf0u - 0x80); // Only 1111____ will be > 0x80
   27|  3.02M|  return simd8<bool>(is_third_byte | is_fourth_byte);
   28|  3.02M|}
simdutf.cpp:_ZZNK7simdutf7haswell14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPcENK3$_0clES3_mS4_:
 1177|   771k|      [this](const char16_t *b, size_t l, char *o) {
 1178|   771k|        return this->convert_utf16le_to_utf8_with_errors(b, l, o);
 1179|   771k|      },
simdutf.cpp:_ZZNK7simdutf7haswell14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPcENK3$_1clES3_m:
 1180|   771k|      [this](const char16_t *b, size_t l) {
 1181|   771k|        return this->utf8_length_from_utf16le(b, l);
 1182|   771k|      },
simdutf.cpp:_ZZNK7simdutf7haswell14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPcENK3$_0clES3_mS4_:
 1190|   534k|      [this](const char16_t *b, size_t l, char *o) {
 1191|   534k|        return this->convert_utf16be_to_utf8_with_errors(b, l, o);
 1192|   534k|      },
simdutf.cpp:_ZZNK7simdutf7haswell14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPcENK3$_1clES3_m:
 1193|   533k|      [this](const char16_t *b, size_t l) {
 1194|   533k|        return this->utf8_length_from_utf16be(b, l);
 1195|   533k|      },

_ZNK7simdutf14implementation27supported_by_runtime_systemEv:
   64|      8|bool implementation::supported_by_runtime_system() const {
   65|      8|  uint32_t required_instruction_sets = this->required_instruction_sets();
   66|      8|  uint32_t supported_instruction_sets =
   67|      8|      internal::detect_supported_architectures();
   68|      8|  return ((supported_instruction_sets & required_instruction_sets) ==
   69|      8|          required_instruction_sets);
   70|      8|}
_ZNK7simdutf8internal29available_implementation_list5beginEv:
 1503|      1|available_implementation_list::begin() const noexcept {
 1504|      1|  return internal::get_available_implementation_pointers().begin();
 1505|      1|}
_ZNK7simdutf8internal29available_implementation_list3endEv:
 1507|      1|available_implementation_list::end() const noexcept {
 1508|      1|  return internal::get_available_implementation_pointers().end();
 1509|      1|}
_ZN7simdutf29get_available_implementationsEv:
 1558|      1|get_available_implementations() {
 1559|      1|#if !SIMDUTF_USE_STATIC_INITIALIZATION
 1560|      1|  static const internal::available_implementation_list
 1561|      1|      available_implementations_instance{};
 1562|      1|#endif
 1563|      1|  return available_implementations_instance;
 1564|      1|}
simdutf.cpp:_ZN7simdutf8internalL37get_available_implementation_pointersEv:
  933|      2|get_available_implementation_pointers() {
  934|      2|#if !SIMDUTF_USE_STATIC_INITIALIZATION
  935|      2|  static const std::initializer_list<const implementation *>
  936|      2|      available_implementation_pointers{
  937|      2|  #if SIMDUTF_IMPLEMENTATION_ICELAKE
  938|      2|          get_icelake_singleton(),
  939|      2|  #endif
  940|      2|  #if SIMDUTF_IMPLEMENTATION_HASWELL
  941|      2|          get_haswell_singleton(),
  942|      2|  #endif
  943|      2|  #if SIMDUTF_IMPLEMENTATION_WESTMERE
  944|      2|          get_westmere_singleton(),
  945|      2|  #endif
  946|       |  #if SIMDUTF_IMPLEMENTATION_ARM64
  947|       |          get_arm64_singleton(),
  948|       |  #endif
  949|       |  #if SIMDUTF_IMPLEMENTATION_PPC64
  950|       |          get_ppc64_singleton(),
  951|       |  #endif
  952|       |  #if SIMDUTF_IMPLEMENTATION_RVV
  953|       |          get_rvv_singleton(),
  954|       |  #endif
  955|       |  #if SIMDUTF_IMPLEMENTATION_LASX
  956|       |          get_lasx_singleton(),
  957|       |  #endif
  958|       |  #if SIMDUTF_IMPLEMENTATION_LSX
  959|       |          get_lsx_singleton(),
  960|       |  #endif
  961|      2|  #if SIMDUTF_IMPLEMENTATION_FALLBACK
  962|      2|          get_fallback_singleton(),
  963|      2|  #endif
  964|      2|      };
  965|      2|#endif
  966|      2|  return available_implementation_pointers;
  967|      2|}
simdutf.cpp:_ZN7simdutf8internalL21get_icelake_singletonEv:
  157|      1|static const icelake::implementation *get_icelake_singleton() {
  158|      1|  #if !SIMDUTF_USE_STATIC_INITIALIZATION
  159|      1|  static const icelake::implementation icelake_singleton{};
  160|      1|  #endif
  161|      1|  return &icelake_singleton;
  162|      1|}
simdutf.cpp:_ZN7simdutf8internalL21get_haswell_singletonEv:
  168|      1|static const haswell::implementation *get_haswell_singleton() {
  169|      1|  #if !SIMDUTF_USE_STATIC_INITIALIZATION
  170|      1|  static const haswell::implementation haswell_singleton{};
  171|      1|  #endif
  172|      1|  return &haswell_singleton;
  173|      1|}
simdutf.cpp:_ZN7simdutf8internalL22get_westmere_singletonEv:
  179|      1|static const westmere::implementation *get_westmere_singleton() {
  180|      1|  #if !SIMDUTF_USE_STATIC_INITIALIZATION
  181|      1|  static const westmere::implementation westmere_singleton{};
  182|      1|  #endif
  183|      1|  return &westmere_singleton;
  184|      1|}
simdutf.cpp:_ZN7simdutf8internalL22get_fallback_singletonEv:
  245|      1|static const fallback::implementation *get_fallback_singleton() {
  246|      1|  #if !SIMDUTF_USE_STATIC_INITIALIZATION
  247|      1|  static const fallback::implementation fallback_singleton{};
  248|      1|  #endif
  249|      1|  return &fallback_singleton;
  250|      1|}

_ZN7simdutf8fallback14implementationC2Ev:
   16|      1|      : simdutf::implementation("fallback", "Generic fallback implementation",
   17|      1|                                0) {}

_ZN7simdutf7haswell14implementationC2Ev:
   16|      1|      : simdutf::implementation("haswell", "Intel/AMD AVX2",
   17|      1|                                internal::instruction_set::AVX2 |
   18|      1|                                    internal::instruction_set::BMI1 |
   19|      1|                                    internal::instruction_set::BMI2) {}

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5simd8IhEC2Ev:
  191|  6.76k|  simdutf_really_inline simd8() : base8_numeric<uint8_t>() {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhEC2Ev:
  124|  6.76k|  simdutf_really_inline base8_numeric() : base8<T>() {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEEC2Ev:
   71|  6.76k|  simdutf_really_inline base8() : base<simd8<T>>() {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEC2Ev:
   14|  6.76k|  simdutf_really_inline base() : value{__m256i()} {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd8simd8x64IhE9reduce_orEv:
  294|  1.70M|  simdutf_really_inline simd8<T> reduce_or() const {
  295|  1.70M|    return this->chunks[0] | this->chunks[1];
  296|  1.70M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEorES5_:
   50|  7.95M|  simdutf_really_inline Child operator|(const Child other) const {
   51|  7.95M|    return _mm256_or_si256(*this, other);
   52|  7.95M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5simd8IhEC2EDv4_x:
  193|  96.0M|      : base8_numeric<uint8_t>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhEC2EDv4_x:
  126|  96.0M|      : base8<T>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEEC2EDv4_x:
   73|  96.0M|  simdutf_really_inline base8(const __m256i _value) : base<simd8<T>>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEC2EDv4_x:
   17|  96.0M|  simdutf_really_inline base(const __m256i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5simd8IhE8is_asciiEv:
  234|  1.70M|  simdutf_really_inline bool is_ascii() const {
  235|  1.70M|    return _mm256_movemask_epi8(*this) == 0;
  236|  1.70M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEoRES5_:
   59|  3.22M|  simdutf_really_inline Child &operator|=(const Child other) {
   60|  3.22M|    auto this_cast = static_cast<Child *>(this);
   61|  3.22M|    *this_cast = *this_cast | other;
   62|  3.22M|    return *this_cast;
   63|  3.22M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEE4prevILi1EEENS4_IhEES8_:
   83|  3.02M|  simdutf_really_inline simd8<T> prev(const simd8<T> prev_chunk) const {
   84|       |    return _mm256_alignr_epi8(
   85|  3.02M|        *this, _mm256_permute2x128_si256(prev_chunk, *this, 0x21), 16 - N);
   86|  3.02M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5simd8IhE3shrILi4EEES4_v:
  245|  6.05M|  template <int N> simdutf_really_inline simd8<uint8_t> shr() const {
  246|  6.05M|    return simd8<uint8_t>(_mm256_srli_epi16(*this, N)) & uint8_t(0xFFu >> N);
  247|  6.05M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhE9lookup_16IhEENS2_5simd8IT_EES7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_:
  157|  9.07M|            L replace15) const {
  158|  9.07M|    return lookup_16(simd8<L>::repeat_16(
  159|  9.07M|        replace0, replace1, replace2, replace3, replace4, replace5, replace6,
  160|  9.07M|        replace7, replace8, replace9, replace10, replace11, replace12,
  161|  9.07M|        replace13, replace14, replace15));
  162|  9.07M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhE9lookup_16IhEENS2_5simd8IT_EES8_:
  148|  9.07M|  simdutf_really_inline simd8<L> lookup_16(simd8<L> lookup_table) const {
  149|  9.07M|    return _mm256_shuffle_epi8(lookup_table, *this);
  150|  9.07M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhE9repeat_16Ehhhhhhhhhhhhhhhh:
  118|  9.07M|                                                  T v14, T v15) {
  119|  9.07M|    return simd8<T>(v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13,
  120|  9.07M|                    v14, v15, v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11,
  121|  9.07M|                    v12, v13, v14, v15);
  122|  9.07M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5simd8IhEC2Ehhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh:
  207|  9.07M|      : simd8(_mm256_setr_epi8(v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11,
  208|  9.07M|                               v12, v13, v14, v15, v16, v17, v18, v19, v20, v21,
  209|  9.07M|                               v22, v23, v24, v25, v26, v27, v28, v29, v30,
  210|  9.07M|                               v31)) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5simd8IhEC2Eh:
  195|  18.1M|  simdutf_really_inline simd8(uint8_t _value) : simd8(splat(_value)) {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEE4prevILi2EEENS4_IhEES8_:
   83|  3.02M|  simdutf_really_inline simd8<T> prev(const simd8<T> prev_chunk) const {
   84|       |    return _mm256_alignr_epi8(
   85|  3.02M|        *this, _mm256_permute2x128_si256(prev_chunk, *this, 0x21), 16 - N);
   86|  3.02M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEE4prevILi3EEENS4_IhEES8_:
   83|  3.02M|  simdutf_really_inline simd8<T> prev(const simd8<T> prev_chunk) const {
   84|       |    return _mm256_alignr_epi8(
   85|  3.02M|        *this, _mm256_permute2x128_si256(prev_chunk, *this, 0x21), 16 - N);
   86|  3.02M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5simd8IhE14saturating_subES4_:
  214|  7.56M|  saturating_sub(const simd8<uint8_t> other) const {
  215|  7.56M|    return _mm256_subs_epu8(*this, other);
  216|  7.56M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5simd8IbEC2EDv4_x:
   95|  3.02M|  simdutf_really_inline simd8(const __m256i _value) : base8<bool>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5base8IbNS2_5simd8IbEEEC2EDv4_x:
   73|  3.02M|  simdutf_really_inline base8(const __m256i _value) : base<simd8<T>>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IbEEEC2EDv4_x:
   17|  3.02M|  simdutf_really_inline base(const __m256i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IbEEEcvRKDv4_xEv:
   19|  3.02M|  simdutf_really_inline operator const __m256i &() const { return this->value; }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEeoES5_:
   56|  3.02M|  simdutf_really_inline Child operator^(const Child other) const {
   57|  3.02M|    return _mm256_xor_si256(*this, other);
   58|  3.02M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd5simd8IhEC2EPKh:
  197|  1.51M|  simdutf_really_inline simd8(const uint8_t values[32]) : simd8(load(values)) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhE4loadEPKh:
  111|  4.92M|  static simdutf_really_inline simd8<T> load(const T values[32]) {
  112|  4.92M|    return _mm256_loadu_si256(reinterpret_cast<const __m256i *>(values));
  113|  4.92M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5simd8IhE7gt_bitsES4_:
  225|  1.51M|  gt_bits(const simd8<uint8_t> other) const {
  226|  1.51M|    return this->saturating_sub(other);
  227|  1.51M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_6simd16ItEEEC2EDv4_x:
   17|  79.1M|  simdutf_really_inline base(const __m256i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_6simd16ItEEEcvRKDv4_xEv:
   19|  76.5M|  simdutf_really_inline operator const __m256i &() const { return this->value; }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5simd8IhE21any_bits_set_anywhereEv:
  241|  2.25k|  simdutf_really_inline bool any_bits_set_anywhere() const {
  242|  2.25k|    return !bits_not_set_anywhere();
  243|  2.25k|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd5simd8IhE21bits_not_set_anywhereEv:
  237|  2.25k|  simdutf_really_inline bool bits_not_set_anywhere() const {
  238|  2.25k|    return _mm256_testz_si256(*this, *this);
  239|  2.25k|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_6simd16IbEEEC2EDv4_x:
   17|  6.02M|  simdutf_really_inline base(const __m256i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_6simd16IbEEEcvRKDv4_xEv:
   19|  8.95M|  simdutf_really_inline operator const __m256i &() const { return this->value; }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd13base8_numericIhE5splatEh:
  105|  18.1M|  static simdutf_really_inline simd8<T> splat(T _value) {
  106|  18.1M|    return _mm256_set1_epi8(_value);
  107|  18.1M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEcvRKDv4_xEv:
   19|   129M|  simdutf_really_inline operator const __m256i &() const { return this->value; }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEanES5_:
   53|  18.1M|  simdutf_really_inline Child operator&(const Child other) const {
   54|  18.1M|    return _mm256_and_si256(*this, other);
   55|  18.1M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd8simd8x64IhEC2EPKh:
  274|  1.70M|      : chunks{simd8<T>::load(ptr),
  275|  1.70M|               simd8<T>::load(ptr + sizeof(simd8<T>) / sizeof(T))} {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_6simd16ItEEEanES5_:
   53|  15.8M|  simdutf_really_inline Child operator&(const Child other) const {
   54|  15.8M|    return _mm256_and_si256(*this, other);
   55|  15.8M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd4baseINS2_6simd16IbEEEeoES5_:
   56|   318k|  simdutf_really_inline Child operator^(const Child other) const {
   57|   318k|    return _mm256_xor_si256(*this, other);
   58|   318k|  }

simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd6simd16ItEC2EDv4_x:
   97|  79.1M|      : base16_numeric<uint16_t>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd14base16_numericItEC2EDv4_x:
   73|  79.1M|      : base16<T>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd6base16ItNS2_6simd16IbEEEC2EDv4_x:
   20|  79.1M|      : base<simd16<T>>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd14base16_numericItE4loadEPKt:
   66|  5.39M|  static simdutf_really_inline simd16<T> load(const T values[8]) {
   67|  5.39M|    return _mm256_loadu_si256(reinterpret_cast<const __m256i *>(values));
   68|  5.39M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd6simd16ItE10swap_bytesEv:
  139|  2.33M|  simdutf_really_inline simd16<uint16_t> swap_bytes() const {
  140|  2.33M|    const __m256i swap = _mm256_setr_epi8(
  141|  2.33M|        1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14, 17, 16, 19, 18,
  142|  2.33M|        21, 20, 23, 22, 25, 24, 27, 26, 29, 28, 31, 30);
  143|  2.33M|    return _mm256_shuffle_epi8(*this, swap);
  144|  2.33M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd14base16_numericItE5splatEt:
   58|  22.8M|  static simdutf_really_inline simd16<T> splat(T _value) {
   59|  22.8M|    return _mm256_set1_epi16(_value);
   60|  22.8M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simdeqENS2_6simd16ItEES4_:
   26|  5.71M|                                               const simd16<T> rhs) {
   27|  5.71M|    return _mm256_cmpeq_epi16(lhs, rhs);
   28|  5.71M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd6simd16IbEC2EDv4_x:
   45|  6.02M|  simdutf_really_inline simd16(const __m256i _value) : base16<bool>(_value) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd6base16IbNS2_6simd16IbEEEC2EDv4_x:
   20|  6.02M|      : base<simd16<T>>(_value) {}
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd6simd16IbE10to_bitmaskEv:
   50|  2.92M|  simdutf_really_inline bitmask_type to_bitmask() const {
   51|  2.92M|    return _mm256_movemask_epi8(*this);
   52|  2.92M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd6simd16ItEC2Et:
  100|  21.5M|  simdutf_really_inline simd16(uint16_t _value) : simd16(splat(_value)) {}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd14base16_numericItE4zeroEv:
   62|  1.30M|  static simdutf_really_inline simd16<T> zero() {
   63|  1.30M|    return _mm256_setzero_si256();
   64|  1.30M|  }
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd3minENS2_6simd16ItEES4_:
  259|  10.4M|simd16<uint16_t> min(const simd16<uint16_t> a, simd16<uint16_t> b) {
  260|  10.4M|  return _mm256_min_epu16(a.value, b.value);
  261|  10.4M|}
simdutf.cpp:_ZN7simdutf7haswell12_GLOBAL__N_14simd14base16_numericItEpLENS2_6simd16ItEE:
   87|  15.5M|  simdutf_really_inline simd16<T> &operator+=(const simd16<T> other) {
   88|  15.5M|    *this = *this + other;
   89|  15.5M|    return *static_cast<simd16<T> *>(this);
   90|  15.5M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd14base16_numericItEplENS2_6simd16ItEE:
   84|  15.5M|  simdutf_really_inline simd16<T> operator+(const simd16<T> other) const {
   85|  15.5M|    return _mm256_add_epi16(*this, other);
   86|  15.5M|  }
simdutf.cpp:_ZNK7simdutf7haswell12_GLOBAL__N_14simd6simd16ItE3sumEv:
  170|  1.30M|  simdutf_really_inline uint64_t sum() const {
  171|  1.30M|    const auto lo_u16 = _mm256_and_si256(value, _mm256_set1_epi32(0x0000ffff));
  172|  1.30M|    const auto hi_u16 = _mm256_srli_epi32(value, 16);
  173|  1.30M|    const auto sum_u32 = _mm256_add_epi32(lo_u16, hi_u16);
  174|       |
  175|  1.30M|    const auto lo_u32 =
  176|  1.30M|        _mm256_and_si256(sum_u32, _mm256_set1_epi64x(0xffffffff));
  177|  1.30M|    const auto hi_u32 = _mm256_srli_epi64(sum_u32, 32);
  178|  1.30M|    const auto sum_u64 = _mm256_add_epi64(lo_u32, hi_u32);
  179|       |
  180|  1.30M|    return uint64_t(_mm256_extract_epi64(sum_u64, 0)) +
  181|  1.30M|           uint64_t(_mm256_extract_epi64(sum_u64, 1)) +
  182|  1.30M|           uint64_t(_mm256_extract_epi64(sum_u64, 2)) +
  183|       |           uint64_t(_mm256_extract_epi64(sum_u64, 3));
  184|  1.30M|  }

_ZN7simdutf7icelake14implementationC2Ev:
   16|      1|      : simdutf::implementation(
   17|      1|            "icelake",
   18|      1|            "Intel AVX512 (AVX-512BW, AVX-512CD, AVX-512VL, AVX-512VBMI2 "
   19|      1|            "extensions)",
   20|      1|            internal::instruction_set::AVX2 | internal::instruction_set::BMI1 |
   21|      1|                internal::instruction_set::BMI2 |
   22|      1|                internal::instruction_set::AVX512BW |
   23|      1|                internal::instruction_set::AVX512CD |
   24|      1|                internal::instruction_set::AVX512VL |
   25|      1|                internal::instruction_set::AVX512VBMI2 |
   26|      1|                internal::instruction_set::AVX512VPOPCNTDQ) {}

_ZN7simdutf8westmere14implementationC2Ev:
   18|      1|      : simdutf::implementation("westmere", "Intel/AMD SSE4.2",
   19|      1|                                internal::instruction_set::SSE42) {}

simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5simd8IhEC2Ev:
  183|  6.76k|  simdutf_really_inline simd8() : base8_numeric<uint8_t>() {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhEC2Ev:
  118|  6.76k|  simdutf_really_inline base8_numeric() : base8<T>() {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEEC2Ev:
   68|  6.76k|  simdutf_really_inline base8() : base<simd8<T>>() {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEC2Ev:
   13|  6.76k|  simdutf_really_inline base() : value{__m128i()} {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd8simd8x64IhE9reduce_orEv:
  290|  1.70M|  simdutf_really_inline simd8<T> reduce_or() const {
  291|  1.70M|    return (this->chunks[0] | this->chunks[1]) |
  292|  1.70M|           (this->chunks[2] | this->chunks[3]);
  293|  1.70M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEorES5_:
   42|  17.4M|  simdutf_really_inline Child operator|(const Child other) const {
   43|  17.4M|    return _mm_or_si128(*this, other);
   44|  17.4M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5simd8IhEC2EDv2_x:
  185|   190M|      : base8_numeric<uint8_t>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhEC2EDv2_x:
  120|   190M|      : base8<T>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEEC2EDv2_x:
   69|   190M|  simdutf_really_inline base8(const __m128i _value) : base<simd8<T>>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEC2EDv2_x:
   16|   190M|  simdutf_really_inline base(const __m128i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5simd8IhE8is_asciiEv:
  228|  1.70M|  simdutf_really_inline bool is_ascii() const {
  229|  1.70M|    return _mm_movemask_epi8(*this) == 0;
  230|  1.70M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEoRES5_:
   51|  6.24M|  simdutf_really_inline Child &operator|=(const Child other) {
   52|  6.24M|    auto this_cast = static_cast<Child *>(this);
   53|  6.24M|    *this_cast = *this_cast | other;
   54|  6.24M|    return *this_cast;
   55|  6.24M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEE4prevILi1EEENS4_IhEES8_:
   79|  6.05M|  simdutf_really_inline simd8<T> prev(const simd8<T> prev_chunk) const {
   80|       |    return _mm_alignr_epi8(*this, prev_chunk, 16 - N);
   81|  6.05M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5simd8IhE3shrILi4EEES4_v:
  238|  12.1M|  template <int N> simdutf_really_inline simd8<uint8_t> shr() const {
  239|  12.1M|    return simd8<uint8_t>(_mm_srli_epi16(*this, N)) & uint8_t(0xFFu >> N);
  240|  12.1M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhE9lookup_16IhEENS2_5simd8IT_EES7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_S7_:
  151|  18.1M|            L replace15) const {
  152|  18.1M|    return lookup_16(simd8<L>::repeat_16(
  153|  18.1M|        replace0, replace1, replace2, replace3, replace4, replace5, replace6,
  154|  18.1M|        replace7, replace8, replace9, replace10, replace11, replace12,
  155|  18.1M|        replace13, replace14, replace15));
  156|  18.1M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhE9lookup_16IhEENS2_5simd8IT_EES8_:
  142|  18.1M|  simdutf_really_inline simd8<L> lookup_16(simd8<L> lookup_table) const {
  143|  18.1M|    return _mm_shuffle_epi8(lookup_table, *this);
  144|  18.1M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhE9repeat_16Ehhhhhhhhhhhhhhhh:
  113|  18.1M|                                                  T v14, T v15) {
  114|  18.1M|    return simd8<T>(v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13,
  115|  18.1M|                    v14, v15);
  116|  18.1M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5simd8IhEC2Ehhhhhhhhhhhhhhhh:
  196|  18.1M|      : simd8(_mm_setr_epi8(v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11,
  197|  18.1M|                            v12, v13, v14, v15)) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5simd8IhEC2Eh:
  188|  36.3M|  simdutf_really_inline simd8(uint8_t _value) : simd8(splat(_value)) {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEE4prevILi2EEENS4_IhEES8_:
   79|  6.05M|  simdutf_really_inline simd8<T> prev(const simd8<T> prev_chunk) const {
   80|       |    return _mm_alignr_epi8(*this, prev_chunk, 16 - N);
   81|  6.05M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5base8IhNS2_5simd8IbEEE4prevILi3EEENS4_IhEES8_:
   79|  6.05M|  simdutf_really_inline simd8<T> prev(const simd8<T> prev_chunk) const {
   80|       |    return _mm_alignr_epi8(*this, prev_chunk, 16 - N);
   81|  6.05M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5simd8IhE14saturating_subES4_:
  201|  13.6M|  saturating_sub(const simd8<uint8_t> other) const {
  202|  13.6M|    return _mm_subs_epu8(*this, other);
  203|  13.6M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5simd8IbEC2EDv2_x:
   91|  6.05M|  simdutf_really_inline simd8(const __m128i _value) : base8<bool>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5base8IbNS2_5simd8IbEEEC2EDv2_x:
   69|  6.05M|  simdutf_really_inline base8(const __m128i _value) : base<simd8<T>>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IbEEEC2EDv2_x:
   16|  6.05M|  simdutf_really_inline base(const __m128i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IbEEEcvRKDv2_xEv:
   18|  6.05M|  simdutf_really_inline operator const __m128i &() const { return this->value; }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEeoES5_:
   48|  6.05M|  simdutf_really_inline Child operator^(const Child other) const {
   49|  6.05M|    return _mm_xor_si128(*this, other);
   50|  6.05M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd5simd8IhEC2EPKh:
  190|  1.51M|  simdutf_really_inline simd8(const uint8_t *values) : simd8(load(values)) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhE4loadEPKh:
  106|  8.33M|  static simdutf_really_inline simd8<T> load(const T values[16]) {
  107|  8.33M|    return _mm_loadu_si128(reinterpret_cast<const __m128i *>(values));
  108|  8.33M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5simd8IhE7gt_bitsES4_:
  212|  1.51M|  gt_bits(const simd8<uint8_t> other) const {
  213|  1.51M|    return this->saturating_sub(other);
  214|  1.51M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_6simd16ItEEEC2EDv2_x:
   16|   155M|  simdutf_really_inline base(const __m128i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_6simd16ItEEEcvRKDv2_xEv:
   18|   153M|  simdutf_really_inline operator const __m128i &() const { return this->value; }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5simd8IhE21any_bits_set_anywhereEv:
  235|  2.25k|  simdutf_really_inline bool any_bits_set_anywhere() const {
  236|  2.25k|    return !bits_not_set_anywhere();
  237|  2.25k|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd5simd8IhE21bits_not_set_anywhereEv:
  232|  2.25k|  simdutf_really_inline bool bits_not_set_anywhere() const {
  233|  2.25k|    return _mm_testz_si128(*this, *this);
  234|  2.25k|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_6simd16IbEEEC2EDv2_x:
   16|  11.7M|  simdutf_really_inline base(const __m128i _value) : value(_value) {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_6simd16IbEEEcvRKDv2_xEv:
   18|  17.6M|  simdutf_really_inline operator const __m128i &() const { return this->value; }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd13base8_numericIhE5splatEh:
  102|  36.3M|  static simdutf_really_inline simd8<T> splat(T _value) {
  103|  36.3M|    return _mm_set1_epi8(_value);
  104|  36.3M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEcvRKDv2_xEv:
   18|   239M|  simdutf_really_inline operator const __m128i &() const { return this->value; }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_5simd8IhEEEanES5_:
   45|  36.3M|  simdutf_really_inline Child operator&(const Child other) const {
   46|  36.3M|    return _mm_and_si128(*this, other);
   47|  36.3M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd8simd8x64IhEC2EPKh:
  270|  1.70M|      : chunks{simd8<T>::load(ptr),
  271|  1.70M|               simd8<T>::load(ptr + sizeof(simd8<T>) / sizeof(T)),
  272|  1.70M|               simd8<T>::load(ptr + 2 * sizeof(simd8<T>) / sizeof(T)),
  273|  1.70M|               simd8<T>::load(ptr + 3 * sizeof(simd8<T>) / sizeof(T))} {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_6simd16ItEEEanES5_:
   45|  31.7M|  simdutf_really_inline Child operator&(const Child other) const {
   46|  31.7M|    return _mm_and_si128(*this, other);
   47|  31.7M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd4baseINS2_6simd16IbEEEeoES5_:
   48|   505k|  simdutf_really_inline Child operator^(const Child other) const {
   49|   505k|    return _mm_xor_si128(*this, other);
   50|   505k|  }

simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd6simd16ItEC2EDv2_x:
   79|   155M|      : base16_numeric<uint16_t>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd14base16_numericItEC2EDv2_x:
   54|   155M|      : base16<T>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd6base16ItNS2_6simd16IbEEEC2EDv2_x:
    8|   155M|      : base<simd16<T>>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd14base16_numericItE4loadEPKt:
   47|  10.7M|  static simdutf_really_inline simd16<T> load(const T values[8]) {
   48|  10.7M|    return _mm_loadu_si128(reinterpret_cast<const __m128i *>(values));
   49|  10.7M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd6simd16ItE10swap_bytesEv:
  121|  4.65M|  simdutf_really_inline simd16<uint16_t> swap_bytes() const {
  122|  4.65M|    const __m128i swap =
  123|  4.65M|        _mm_setr_epi8(1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14);
  124|  4.65M|    return _mm_shuffle_epi8(*this, swap);
  125|  4.65M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd14base16_numericItE5splatEt:
   41|  44.3M|  static simdutf_really_inline simd16<T> splat(T _value) {
   42|  44.3M|    return _mm_set1_epi16(_value);
   43|  44.3M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simdeqENS2_6simd16ItEES4_:
   11|  11.2M|                                               const simd16<T> rhs) {
   12|  11.2M|    return _mm_cmpeq_epi16(lhs, rhs);
   13|  11.2M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd6simd16IbEC2EDv2_x:
   28|  11.7M|  simdutf_really_inline simd16(const __m128i _value) : base16<bool>(_value) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd6base16IbNS2_6simd16IbEEEC2EDv2_x:
    8|  11.7M|      : base<simd16<T>>(_value) {}
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd6simd16IbE10to_bitmaskEv:
   33|  5.84M|  simdutf_really_inline int to_bitmask() const {
   34|  5.84M|    return _mm_movemask_epi8(*this);
   35|  5.84M|  }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd6simd16ItEC2Et:
   82|  43.0M|  simdutf_really_inline simd16(uint16_t _value) : simd16(splat(_value)) {}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd14base16_numericItE4zeroEv:
   45|  1.30M|  static simdutf_really_inline simd16<T> zero() { return _mm_setzero_si128(); }
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd3minENS2_6simd16ItEES4_:
  240|  21.0M|simd16<uint16_t> min(const simd16<uint16_t> a, simd16<uint16_t> b) {
  241|  21.0M|  return _mm_min_epu16(a.value, b.value);
  242|  21.0M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_14simd14base16_numericItEpLENS2_6simd16ItEE:
   68|  31.2M|  simdutf_really_inline simd16<T> &operator+=(const simd16<T> other) {
   69|  31.2M|    *this = *this + other;
   70|  31.2M|    return *static_cast<simd16<T> *>(this);
   71|  31.2M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd14base16_numericItEplENS2_6simd16ItEE:
   65|  31.2M|  simdutf_really_inline simd16<T> operator+(const simd16<T> other) const {
   66|  31.2M|    return _mm_add_epi16(*this, other);
   67|  31.2M|  }
simdutf.cpp:_ZNK7simdutf8westmere12_GLOBAL__N_14simd6simd16ItE3sumEv:
  134|  1.30M|  simdutf_really_inline uint64_t sum() const {
  135|  1.30M|    const auto lo_u16 = _mm_and_si128(value, _mm_set1_epi32(0x0000ffff));
  136|  1.30M|    const auto hi_u16 = _mm_srli_epi32(value, 16);
  137|  1.30M|    const auto sum_u32 = _mm_add_epi32(lo_u16, hi_u16);
  138|       |
  139|  1.30M|    const auto lo_u32 = _mm_and_si128(sum_u32, _mm_set1_epi64x(0xffffffff));
  140|  1.30M|    const auto hi_u32 = _mm_srli_epi64(sum_u32, 32);
  141|  1.30M|    const auto sum_u64 = _mm_add_epi64(lo_u32, hi_u32);
  142|       |
  143|  1.30M|    return uint64_t(_mm_extract_epi64(sum_u64, 0)) +
  144|       |           uint64_t(_mm_extract_epi64(sum_u64, 1));
  145|  1.30M|  }

_ZNK7simdutf8westmere14implementation13validate_utf8EPKcm:
  299|  2.25k|implementation::validate_utf8(const char *buf, size_t len) const noexcept {
  300|  2.25k|  return westmere::utf8_validation::generic_validate_utf8(buf, len);
  301|  2.25k|}
_ZNK7simdutf8westmere14implementation35convert_utf16le_to_utf8_with_errorsEPKDsmPc:
  749|   771k|    const char16_t *buf, size_t len, char *utf8_output) const noexcept {
  750|       |  // ret.first.count is always the position in the buffer, not the number of
  751|       |  // code units written even if finished
  752|   771k|  std::pair<result, char *> ret =
  753|   771k|      westmere::sse_convert_utf16_to_utf8_with_errors<endianness::LITTLE>(
  754|   771k|          buf, len, utf8_output);
  755|   771k|  if (ret.first.error) {
  ------------------
  |  Branch (755:7): [True: 768k, False: 3.57k]
  ------------------
  756|   768k|    return ret.first;
  757|   768k|  } // Can return directly since scalar fallback already found correct
  758|       |    // ret.first.count
  759|  3.57k|  if (ret.first.count != len) { // All good so far, but not finished
  ------------------
  |  Branch (759:7): [True: 3.57k, False: 0]
  ------------------
  760|  3.57k|    result scalar_res =
  761|  3.57k|        scalar::utf16_to_utf8::convert_with_errors<endianness::LITTLE>(
  762|  3.57k|            buf + ret.first.count, len - ret.first.count, ret.second);
  763|  3.57k|    if (scalar_res.error) {
  ------------------
  |  Branch (763:9): [True: 2.77k, False: 800]
  ------------------
  764|  2.77k|      scalar_res.count += ret.first.count;
  765|  2.77k|      return scalar_res;
  766|  2.77k|    } else {
  767|    800|      ret.second += scalar_res.count;
  768|    800|    }
  769|  3.57k|  }
  770|    800|  ret.first.count =
  771|    800|      ret.second -
  772|    800|      utf8_output; // Set count to the number of 8-bit code units written
  773|    800|  return ret.first;
  774|  3.57k|}
_ZNK7simdutf8westmere14implementation35convert_utf16be_to_utf8_with_errorsEPKDsmPc:
  777|   534k|    const char16_t *buf, size_t len, char *utf8_output) const noexcept {
  778|       |  // ret.first.count is always the position in the buffer, not the number of
  779|       |  // code units written even if finished
  780|   534k|  std::pair<result, char *> ret =
  781|   534k|      westmere::sse_convert_utf16_to_utf8_with_errors<endianness::BIG>(
  782|   534k|          buf, len, utf8_output);
  783|   534k|  if (ret.first.error) {
  ------------------
  |  Branch (783:7): [True: 530k, False: 3.78k]
  ------------------
  784|   530k|    return ret.first;
  785|   530k|  } // Can return directly since scalar fallback already found correct
  786|       |    // ret.first.count
  787|  3.78k|  if (ret.first.count != len) { // All good so far, but not finished
  ------------------
  |  Branch (787:7): [True: 3.78k, False: 0]
  ------------------
  788|  3.78k|    result scalar_res =
  789|  3.78k|        scalar::utf16_to_utf8::convert_with_errors<endianness::BIG>(
  790|  3.78k|            buf + ret.first.count, len - ret.first.count, ret.second);
  791|  3.78k|    if (scalar_res.error) {
  ------------------
  |  Branch (791:9): [True: 2.98k, False: 807]
  ------------------
  792|  2.98k|      scalar_res.count += ret.first.count;
  793|  2.98k|      return scalar_res;
  794|  2.98k|    } else {
  795|    807|      ret.second += scalar_res.count;
  796|    807|    }
  797|  3.78k|  }
  798|    807|  ret.first.count =
  799|    807|      ret.second -
  800|    807|      utf8_output; // Set count to the number of 8-bit code units written
  801|    807|  return ret.first;
  802|  3.78k|}
_ZNK7simdutf8westmere14implementation24utf8_length_from_utf16leEPKDsm:
 1158|   771k|    const char16_t *input, size_t length) const noexcept {
 1159|   771k|  return utf16::utf8_length_from_utf16_bytemask<endianness::LITTLE>(input,
 1160|   771k|                                                                    length);
 1161|   771k|}
_ZNK7simdutf8westmere14implementation24utf8_length_from_utf16beEPKDsm:
 1164|   533k|    const char16_t *input, size_t length) const noexcept {
 1165|   533k|  return utf16::utf8_length_from_utf16_bytemask<endianness::BIG>(input, length);
 1166|   533k|}
_ZNK7simdutf8westmere14implementation41utf8_length_from_utf16le_with_replacementEPKDsm:
 1250|  1.12k|    const char16_t *input, size_t length) const noexcept {
 1251|  1.12k|  return utf16::utf8_length_from_utf16_with_replacement<endianness::LITTLE>(
 1252|  1.12k|      input, length);
 1253|  1.12k|}
_ZNK7simdutf8westmere14implementation41utf8_length_from_utf16be_with_replacementEPKDsm:
 1257|  1.12k|    const char16_t *input, size_t length) const noexcept {
 1258|  1.12k|  return utf16::utf8_length_from_utf16_with_replacement<endianness::BIG>(
 1259|  1.12k|      input, length);
 1260|  1.12k|}
_ZNK7simdutf8westmere14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPc:
 1264|  1.12k|    const char16_t *input, size_t length, char *utf8_buffer) const noexcept {
 1265|  1.12k|  return utf16_to_utf8::convert_with_replacement_via(
 1266|  1.12k|      [this](const char16_t *b, size_t l, char *o) {
 1267|  1.12k|        return this->convert_utf16le_to_utf8_with_errors(b, l, o);
 1268|  1.12k|      },
 1269|  1.12k|      [this](const char16_t *b, size_t l) {
 1270|  1.12k|        return this->utf8_length_from_utf16le(b, l);
 1271|  1.12k|      },
 1272|  1.12k|      input, length, utf8_buffer);
 1273|  1.12k|}
_ZNK7simdutf8westmere14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPc:
 1277|  1.12k|    const char16_t *input, size_t length, char *utf8_buffer) const noexcept {
 1278|  1.12k|  return utf16_to_utf8::convert_with_replacement_via(
 1279|  1.12k|      [this](const char16_t *b, size_t l, char *o) {
 1280|  1.12k|        return this->convert_utf16be_to_utf8_with_errors(b, l, o);
 1281|  1.12k|      },
 1282|  1.12k|      [this](const char16_t *b, size_t l) {
 1283|  1.12k|        return this->utf8_length_from_utf16be(b, l);
 1284|  1.12k|      },
 1285|  1.12k|      input, length, utf8_buffer);
 1286|  1.12k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_18is_asciiERKNS1_4simd8simd8x64IhEE:
   13|  1.70M|simdutf_really_inline bool is_ascii(const simd8x64<uint8_t> &input) {
   14|  1.70M|  return input.reduce_or().is_ascii();
   15|  1.70M|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_124must_be_2_3_continuationENS1_4simd5simd8IhEES4_:
   22|  6.05M|                         const simd8<uint8_t> prev3) {
   23|  6.05M|  simd8<uint8_t> is_third_byte =
   24|  6.05M|      prev2.saturating_sub(0xe0u - 0x80); // Only 111_____ will be >= 0x80
   25|  6.05M|  simd8<uint8_t> is_fourth_byte =
   26|  6.05M|      prev3.saturating_sub(0xf0u - 0x80); // Only 1111____ will be >= 0x80
   27|  6.05M|  return simd8<bool>(is_third_byte | is_fourth_byte);
   28|  6.05M|}
simdutf.cpp:_ZZNK7simdutf8westmere14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPcENK3$_0clES3_mS4_:
 1266|   771k|      [this](const char16_t *b, size_t l, char *o) {
 1267|   771k|        return this->convert_utf16le_to_utf8_with_errors(b, l, o);
 1268|   771k|      },
simdutf.cpp:_ZZNK7simdutf8westmere14implementation40convert_utf16le_to_utf8_with_replacementEPKDsmPcENK3$_1clES3_m:
 1269|   771k|      [this](const char16_t *b, size_t l) {
 1270|   771k|        return this->utf8_length_from_utf16le(b, l);
 1271|   771k|      },
simdutf.cpp:_ZZNK7simdutf8westmere14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPcENK3$_0clES3_mS4_:
 1279|   534k|      [this](const char16_t *b, size_t l, char *o) {
 1280|   534k|        return this->convert_utf16be_to_utf8_with_errors(b, l, o);
 1281|   534k|      },
simdutf.cpp:_ZZNK7simdutf8westmere14implementation40convert_utf16be_to_utf8_with_replacementEPKDsmPcENK3$_1clES3_m:
 1282|   533k|      [this](const char16_t *b, size_t l) {
 1283|   533k|        return this->utf8_length_from_utf16be(b, l);
 1284|   533k|      },

simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_18internal8westmere26write_v_u16_11bits_to_utf8EDv2_xRPcS4_t:
   10|  49.1k|                                       const uint16_t one_byte_bitmask) {
   11|       |  // 0b1100_0000_1000_0000
   12|  49.1k|  const __m128i v_c080 = _mm_set1_epi16((int16_t)0xc080);
   13|       |  // 0b0001_1111_0000_0000
   14|  49.1k|  const __m128i v_1f00 = _mm_set1_epi16((int16_t)0x1f00);
   15|       |  // 0b0000_0000_0011_1111
   16|  49.1k|  const __m128i v_003f = _mm_set1_epi16((int16_t)0x003f);
   17|       |
   18|       |  // 1. prepare 2-byte values
   19|       |  // input 16-bit word : [0000|0aaa|aabb|bbbb] x 8
   20|       |  // expected output   : [110a|aaaa|10bb|bbbb] x 8
   21|       |
   22|       |  // t0 = [000a|aaaa|bbbb|bb00]
   23|  49.1k|  const __m128i t0 = _mm_slli_epi16(v_u16, 2);
   24|       |  // t1 = [000a|aaaa|0000|0000]
   25|  49.1k|  const __m128i t1 = _mm_and_si128(t0, v_1f00);
   26|       |  // t2 = [0000|0000|00bb|bbbb]
   27|  49.1k|  const __m128i t2 = _mm_and_si128(v_u16, v_003f);
   28|       |  // t3 = [000a|aaaa|00bb|bbbb]
   29|  49.1k|  const __m128i t3 = _mm_or_si128(t1, t2);
   30|       |  // t4 = [110a|aaaa|10bb|bbbb]
   31|  49.1k|  const __m128i t4 = _mm_or_si128(t3, v_c080);
   32|       |
   33|       |  // 2. merge ASCII and 2-byte codewords
   34|  49.1k|  const __m128i utf8_unpacked = _mm_blendv_epi8(t4, v_u16, one_byte_bytemask);
   35|       |
   36|       |  // 3. prepare bitmask for 8-bit lookup
   37|       |  //    one_byte_bitmask = hhggffeeddccbbaa -- the bits are doubled (h - MSB, a
   38|       |  //    - LSB)
   39|  49.1k|  const uint16_t m0 = one_byte_bitmask & 0x5555;      // m0 = 0h0g0f0e0d0c0b0a
   40|  49.1k|  const uint16_t m1 = static_cast<uint16_t>(m0 >> 7); // m1 = 00000000h0g0f0e0
   41|  49.1k|  const uint8_t m2 = static_cast<uint8_t>((m0 | m1) & 0xff); // m2 = hdgcfbea
   42|       |  // 4. pack the bytes
   43|  49.1k|  const uint8_t *row =
   44|  49.1k|      &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
   45|  49.1k|  const __m128i shuffle = _mm_loadu_si128((__m128i *)(row + 1));
   46|  49.1k|  const __m128i utf8_packed = _mm_shuffle_epi8(utf8_unpacked, shuffle);
   47|       |
   48|       |  // 5. store bytes
   49|  49.1k|  _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
   50|       |
   51|       |  // 6. adjust pointers
   52|  49.1k|  utf8_output += row[0];
   53|  49.1k|}

simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_137sse_convert_utf16_to_utf8_with_errorsILNS_10endiannessE0EEENSt3__14pairINS_6resultEPcEEPKDsmS7_:
  285|   771k|                                      char *utf8_output) {
  286|   771k|  const char16_t *start = buf;
  287|   771k|  const char16_t *end = buf + len;
  288|       |
  289|   771k|  const __m128i v_0000 = _mm_setzero_si128();
  290|   771k|  const __m128i v_f800 = _mm_set1_epi16((int16_t)0xf800);
  291|   771k|  const __m128i v_d800 = _mm_set1_epi16((int16_t)0xd800);
  292|   771k|  const size_t safety_margin =
  293|   771k|      12; // to avoid overruns, see issue
  294|       |          // https://github.com/simdutf/simdutf/issues/92
  295|       |
  296|  3.32M|  while (end - buf >= std::ptrdiff_t(16 + safety_margin)) {
  ------------------
  |  Branch (296:10): [True: 3.32M, False: 3.57k]
  ------------------
  297|  3.32M|    __m128i in = _mm_loadu_si128((__m128i *)buf);
  298|  3.32M|    if (big_endian) {
  ------------------
  |  Branch (298:9): [Folded, False: 3.32M]
  ------------------
  299|      0|      const __m128i swap =
  300|      0|          _mm_setr_epi8(1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14);
  301|      0|      in = _mm_shuffle_epi8(in, swap);
  302|      0|    }
  303|       |    // a single 16-bit UTF-16 word can yield 1, 2 or 3 UTF-8 bytes
  304|  3.32M|    const __m128i v_ff80 = _mm_set1_epi16((int16_t)0xff80);
  305|  3.32M|    if (_mm_testz_si128(in, v_ff80)) { // ASCII fast path!!!!
  ------------------
  |  Branch (305:9): [True: 422k, False: 2.90M]
  ------------------
  306|   422k|      __m128i nextin = _mm_loadu_si128((__m128i *)buf + 1);
  307|   422k|      if (big_endian) {
  ------------------
  |  Branch (307:11): [Folded, False: 422k]
  ------------------
  308|      0|        const __m128i swap =
  309|      0|            _mm_setr_epi8(1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14);
  310|      0|        nextin = _mm_shuffle_epi8(nextin, swap);
  311|      0|      }
  312|   422k|      if (!_mm_testz_si128(nextin, v_ff80)) {
  ------------------
  |  Branch (312:11): [True: 11.5k, False: 411k]
  ------------------
  313|       |        // 1. pack the bytes
  314|       |        // obviously suboptimal.
  315|  11.5k|        const __m128i utf8_packed = _mm_packus_epi16(in, in);
  316|       |        // 2. store (16 bytes)
  317|  11.5k|        _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
  318|       |        // 3. adjust pointers
  319|  11.5k|        buf += 8;
  320|  11.5k|        utf8_output += 8;
  321|  11.5k|        in = nextin;
  322|   411k|      } else {
  323|       |        // 1. pack the bytes
  324|       |        // obviously suboptimal.
  325|   411k|        const __m128i utf8_packed = _mm_packus_epi16(in, nextin);
  326|       |        // 2. store (16 bytes)
  327|   411k|        _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
  328|       |        // 3. adjust pointers
  329|   411k|        buf += 16;
  330|   411k|        utf8_output += 16;
  331|   411k|        continue; // we are done for this round!
  332|   411k|      }
  333|   422k|    }
  334|       |
  335|       |    // no bits set above 7th bit
  336|  2.91M|    const __m128i one_byte_bytemask =
  337|  2.91M|        _mm_cmpeq_epi16(_mm_and_si128(in, v_ff80), v_0000);
  338|  2.91M|    const uint16_t one_byte_bitmask =
  339|  2.91M|        static_cast<uint16_t>(_mm_movemask_epi8(one_byte_bytemask));
  340|       |
  341|       |    // no bits set above 11th bit
  342|  2.91M|    const __m128i one_or_two_bytes_bytemask =
  343|  2.91M|        _mm_cmpeq_epi16(_mm_and_si128(in, v_f800), v_0000);
  344|  2.91M|    const uint16_t one_or_two_bytes_bitmask =
  345|  2.91M|        static_cast<uint16_t>(_mm_movemask_epi8(one_or_two_bytes_bytemask));
  346|       |
  347|  2.91M|    if (one_or_two_bytes_bitmask == 0xffff) {
  ------------------
  |  Branch (347:9): [True: 26.3k, False: 2.88M]
  ------------------
  348|  26.3k|      internal::westmere::write_v_u16_11bits_to_utf8(
  349|  26.3k|          in, utf8_output, one_byte_bytemask, one_byte_bitmask);
  350|  26.3k|      buf += 8;
  351|  26.3k|      continue;
  352|  26.3k|    }
  353|       |
  354|       |    // 1. Check if there are any surrogate word in the input chunk.
  355|       |    //    We have also deal with situation when there is a surrogate word
  356|       |    //    at the end of a chunk.
  357|  2.88M|    const __m128i surrogates_bytemask =
  358|  2.88M|        _mm_cmpeq_epi16(_mm_and_si128(in, v_f800), v_d800);
  359|       |
  360|       |    // bitmask = 0x0000 if there are no surrogates
  361|       |    //         = 0xc000 if the last word is a surrogate
  362|  2.88M|    const uint16_t surrogates_bitmask =
  363|  2.88M|        static_cast<uint16_t>(_mm_movemask_epi8(surrogates_bytemask));
  364|       |    // It might seem like checking for surrogates_bitmask == 0xc000 could help.
  365|       |    // However, it is likely an uncommon occurrence.
  366|  2.88M|    if (surrogates_bitmask == 0x0000) {
  ------------------
  |  Branch (366:9): [True: 2.11M, False: 769k]
  ------------------
  367|       |      // case: code units from register produce either 1, 2 or 3 UTF-8 bytes
  368|  2.11M|      const __m128i dup_even = _mm_setr_epi16(0x0000, 0x0202, 0x0404, 0x0606,
  369|  2.11M|                                              0x0808, 0x0a0a, 0x0c0c, 0x0e0e);
  370|       |
  371|       |      /* In this branch we handle three cases:
  372|       |         1. [0000|0000|0ccc|cccc] => [0ccc|cccc]                           -
  373|       |        single UFT-8 byte
  374|       |         2. [0000|0bbb|bbcc|cccc] => [110b|bbbb], [10cc|cccc]              - two
  375|       |        UTF-8 bytes
  376|       |         3. [aaaa|bbbb|bbcc|cccc] => [1110|aaaa], [10bb|bbbb], [10cc|cccc] -
  377|       |        three UTF-8 bytes
  378|       |
  379|       |        We expand the input word (16-bit) into two code units (32-bit), thus
  380|       |        we have room for four bytes. However, we need five distinct bit
  381|       |        layouts. Note that the last byte in cases #2 and #3 is the same.
  382|       |
  383|       |        We precompute byte 1 for case #1 and the common byte for cases #2 & #3
  384|       |        in register t2.
  385|       |
  386|       |        We precompute byte 1 for case #3 and -- **conditionally** -- precompute
  387|       |        either byte 1 for case #2 or byte 2 for case #3. Note that they
  388|       |        differ by exactly one bit.
  389|       |
  390|       |        Finally from these two code units we build proper UTF-8 sequence, taking
  391|       |        into account the case (i.e, the number of bytes to write).
  392|       |      */
  393|       |      /**
  394|       |       * Given [aaaa|bbbb|bbcc|cccc] our goal is to produce:
  395|       |       * t2 => [0ccc|cccc] [10cc|cccc]
  396|       |       * s4 => [1110|aaaa] ([110b|bbbb] OR [10bb|bbbb])
  397|       |       */
  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  399|       |      // [aaaa|bbbb|bbcc|cccc] => [bbcc|cccc|bbcc|cccc]
  400|  2.11M|      const __m128i t0 = _mm_shuffle_epi8(in, dup_even);
  401|       |      // [bbcc|cccc|bbcc|cccc] => [00cc|cccc|0bcc|cccc]
  402|  2.11M|      const __m128i t1 = _mm_and_si128(t0, simdutf_vec(0b0011111101111111));
  ------------------
  |  |  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  403|       |      // [00cc|cccc|0bcc|cccc] => [10cc|cccc|0bcc|cccc]
  404|  2.11M|      const __m128i t2 = _mm_or_si128(t1, simdutf_vec(0b1000000000000000));
  ------------------
  |  |  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  405|       |
  406|       |      // [aaaa|bbbb|bbcc|cccc] =>  [0000|aaaa|bbbb|bbcc]
  407|  2.11M|      const __m128i s0 = _mm_srli_epi16(in, 4);
  408|       |      // [0000|aaaa|bbbb|bbcc] => [0000|aaaa|bbbb|bb00]
  409|  2.11M|      const __m128i s1 = _mm_and_si128(s0, simdutf_vec(0b0000111111111100));
  ------------------
  |  |  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  410|       |      // [0000|aaaa|bbbb|bb00] => [00bb|bbbb|0000|aaaa]
  411|  2.11M|      const __m128i s2 = _mm_maddubs_epi16(s1, simdutf_vec(0x0140));
  ------------------
  |  |  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  412|       |      // [00bb|bbbb|0000|aaaa] => [11bb|bbbb|1110|aaaa]
  413|  2.11M|      const __m128i s3 = _mm_or_si128(s2, simdutf_vec(0b1100000011100000));
  ------------------
  |  |  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  414|  2.11M|      const __m128i m0 = _mm_andnot_si128(one_or_two_bytes_bytemask,
  415|  2.11M|                                          simdutf_vec(0b0100000000000000));
  ------------------
  |  |  398|  2.11M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  416|  2.11M|      const __m128i s4 = _mm_xor_si128(s3, m0);
  417|  2.11M|#undef simdutf_vec
  418|       |
  419|       |      // 4. expand code units 16-bit => 32-bit
  420|  2.11M|      const __m128i out0 = _mm_unpacklo_epi16(t2, s4);
  421|  2.11M|      const __m128i out1 = _mm_unpackhi_epi16(t2, s4);
  422|       |
  423|       |      // 5. compress 32-bit code units into 1, 2 or 3 bytes -- 2 x shuffle
  424|  2.11M|      const uint16_t mask =
  425|  2.11M|          (one_byte_bitmask & 0x5555) | (one_or_two_bytes_bitmask & 0xaaaa);
  426|  2.11M|      if (mask == 0) {
  ------------------
  |  Branch (426:11): [True: 1.75M, False: 357k]
  ------------------
  427|       |        // We only have three-byte code units. Use fast path.
  428|  1.75M|        const __m128i shuffle = _mm_setr_epi8(2, 3, 1, 6, 7, 5, 10, 11, 9, 14,
  429|  1.75M|                                              15, 13, -1, -1, -1, -1);
  430|  1.75M|        const __m128i utf8_0 = _mm_shuffle_epi8(out0, shuffle);
  431|  1.75M|        const __m128i utf8_1 = _mm_shuffle_epi8(out1, shuffle);
  432|  1.75M|        _mm_storeu_si128((__m128i *)utf8_output, utf8_0);
  433|  1.75M|        utf8_output += 12;
  434|  1.75M|        _mm_storeu_si128((__m128i *)utf8_output, utf8_1);
  435|  1.75M|        utf8_output += 12;
  436|  1.75M|        buf += 8;
  437|  1.75M|        continue;
  438|  1.75M|      }
  439|   357k|      const uint8_t mask0 = uint8_t(mask);
  440|       |
  441|   357k|      const uint8_t *row0 =
  442|   357k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
  443|   357k|      const __m128i shuffle0 = _mm_loadu_si128((__m128i *)(row0 + 1));
  444|   357k|      const __m128i utf8_0 = _mm_shuffle_epi8(out0, shuffle0);
  445|       |
  446|   357k|      const uint8_t mask1 = static_cast<uint8_t>(mask >> 8);
  447|       |
  448|   357k|      const uint8_t *row1 =
  449|   357k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
  450|   357k|      const __m128i shuffle1 = _mm_loadu_si128((__m128i *)(row1 + 1));
  451|   357k|      const __m128i utf8_1 = _mm_shuffle_epi8(out1, shuffle1);
  452|       |
  453|   357k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_0);
  454|   357k|      utf8_output += row0[0];
  455|   357k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_1);
  456|   357k|      utf8_output += row1[0];
  457|       |
  458|   357k|      buf += 8;
  459|       |      // surrogate pair(s) in a register
  460|   769k|    } else {
  461|       |      // Let us do a scalar fallback.
  462|       |      // It may seem wasteful to use scalar code, but being efficient with SIMD
  463|       |      // in the presence of surrogate pairs may require non-trivial tables.
  464|   769k|      size_t forward = 15;
  465|   769k|      size_t k = 0;
  466|   769k|      if (size_t(end - buf) < forward + 1) {
  ------------------
  |  Branch (466:11): [True: 0, False: 769k]
  ------------------
  467|      0|        forward = size_t(end - buf - 1);
  468|      0|      }
  469|  1.87M|      for (; k < forward; k++) {
  ------------------
  |  Branch (469:14): [True: 1.86M, False: 1.60k]
  ------------------
  470|  1.86M|        uint16_t word = scalar::utf16::swap_if_needed<big_endian>(buf[k]);
  471|  1.86M|        if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (471:13): [True: 85.3k, False: 1.78M]
  ------------------
  472|  85.3k|          *utf8_output++ = char(word);
  473|  1.78M|        } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (473:20): [True: 50.8k, False: 1.73M]
  ------------------
  474|  50.8k|          *utf8_output++ = char((word >> 6) | 0b11000000);
  475|  50.8k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  476|  1.73M|        } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (476:20): [True: 814k, False: 918k]
  ------------------
  477|   814k|          *utf8_output++ = char((word >> 12) | 0b11100000);
  478|   814k|          *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  479|   814k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  480|   918k|        } else {
  481|       |          // must be a surrogate pair
  482|   918k|          uint16_t diff = uint16_t(word - 0xD800);
  483|   918k|          uint16_t next_word =
  484|   918k|              scalar::utf16::swap_if_needed<big_endian>(buf[k + 1]);
  485|   918k|          k++;
  486|   918k|          uint16_t diff2 = uint16_t(next_word - 0xDC00);
  487|   918k|          if ((diff | diff2) > 0x3FF) {
  ------------------
  |  Branch (487:15): [True: 768k, False: 150k]
  ------------------
  488|   768k|            return std::make_pair(
  489|   768k|                result(error_code::SURROGATE, buf - start + k - 1),
  490|   768k|                utf8_output);
  491|   768k|          }
  492|   150k|          uint32_t value = (diff << 10) + diff2 + 0x10000;
  493|   150k|          *utf8_output++ = char((value >> 18) | 0b11110000);
  494|   150k|          *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  495|   150k|          *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  496|   150k|          *utf8_output++ = char((value & 0b111111) | 0b10000000);
  497|   150k|        }
  498|  1.86M|      }
  499|  1.60k|      buf += k;
  500|  1.60k|    }
  501|  2.88M|  } // while
  502|       |
  503|  3.57k|  return std::make_pair(result(error_code::SUCCESS, buf - start), utf8_output);
  504|   771k|}
simdutf.cpp:_ZN7simdutf8westmere12_GLOBAL__N_137sse_convert_utf16_to_utf8_with_errorsILNS_10endiannessE1EEENSt3__14pairINS_6resultEPcEEPKDsmS7_:
  285|   534k|                                      char *utf8_output) {
  286|   534k|  const char16_t *start = buf;
  287|   534k|  const char16_t *end = buf + len;
  288|       |
  289|   534k|  const __m128i v_0000 = _mm_setzero_si128();
  290|   534k|  const __m128i v_f800 = _mm_set1_epi16((int16_t)0xf800);
  291|   534k|  const __m128i v_d800 = _mm_set1_epi16((int16_t)0xd800);
  292|   534k|  const size_t safety_margin =
  293|   534k|      12; // to avoid overruns, see issue
  294|       |          // https://github.com/simdutf/simdutf/issues/92
  295|       |
  296|  2.55M|  while (end - buf >= std::ptrdiff_t(16 + safety_margin)) {
  ------------------
  |  Branch (296:10): [True: 2.55M, False: 3.78k]
  ------------------
  297|  2.55M|    __m128i in = _mm_loadu_si128((__m128i *)buf);
  298|  2.55M|    if (big_endian) {
  ------------------
  |  Branch (298:9): [True: 2.55M, Folded]
  ------------------
  299|  2.55M|      const __m128i swap =
  300|  2.55M|          _mm_setr_epi8(1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14);
  301|  2.55M|      in = _mm_shuffle_epi8(in, swap);
  302|  2.55M|    }
  303|       |    // a single 16-bit UTF-16 word can yield 1, 2 or 3 UTF-8 bytes
  304|  2.55M|    const __m128i v_ff80 = _mm_set1_epi16((int16_t)0xff80);
  305|  2.55M|    if (_mm_testz_si128(in, v_ff80)) { // ASCII fast path!!!!
  ------------------
  |  Branch (305:9): [True: 431k, False: 2.12M]
  ------------------
  306|   431k|      __m128i nextin = _mm_loadu_si128((__m128i *)buf + 1);
  307|   431k|      if (big_endian) {
  ------------------
  |  Branch (307:11): [True: 431k, Folded]
  ------------------
  308|   431k|        const __m128i swap =
  309|   431k|            _mm_setr_epi8(1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 13, 12, 15, 14);
  310|   431k|        nextin = _mm_shuffle_epi8(nextin, swap);
  311|   431k|      }
  312|   431k|      if (!_mm_testz_si128(nextin, v_ff80)) {
  ------------------
  |  Branch (312:11): [True: 20.0k, False: 411k]
  ------------------
  313|       |        // 1. pack the bytes
  314|       |        // obviously suboptimal.
  315|  20.0k|        const __m128i utf8_packed = _mm_packus_epi16(in, in);
  316|       |        // 2. store (16 bytes)
  317|  20.0k|        _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
  318|       |        // 3. adjust pointers
  319|  20.0k|        buf += 8;
  320|  20.0k|        utf8_output += 8;
  321|  20.0k|        in = nextin;
  322|   411k|      } else {
  323|       |        // 1. pack the bytes
  324|       |        // obviously suboptimal.
  325|   411k|        const __m128i utf8_packed = _mm_packus_epi16(in, nextin);
  326|       |        // 2. store (16 bytes)
  327|   411k|        _mm_storeu_si128((__m128i *)utf8_output, utf8_packed);
  328|       |        // 3. adjust pointers
  329|   411k|        buf += 16;
  330|   411k|        utf8_output += 16;
  331|   411k|        continue; // we are done for this round!
  332|   411k|      }
  333|   431k|    }
  334|       |
  335|       |    // no bits set above 7th bit
  336|  2.14M|    const __m128i one_byte_bytemask =
  337|  2.14M|        _mm_cmpeq_epi16(_mm_and_si128(in, v_ff80), v_0000);
  338|  2.14M|    const uint16_t one_byte_bitmask =
  339|  2.14M|        static_cast<uint16_t>(_mm_movemask_epi8(one_byte_bytemask));
  340|       |
  341|       |    // no bits set above 11th bit
  342|  2.14M|    const __m128i one_or_two_bytes_bytemask =
  343|  2.14M|        _mm_cmpeq_epi16(_mm_and_si128(in, v_f800), v_0000);
  344|  2.14M|    const uint16_t one_or_two_bytes_bitmask =
  345|  2.14M|        static_cast<uint16_t>(_mm_movemask_epi8(one_or_two_bytes_bytemask));
  346|       |
  347|  2.14M|    if (one_or_two_bytes_bitmask == 0xffff) {
  ------------------
  |  Branch (347:9): [True: 22.8k, False: 2.12M]
  ------------------
  348|  22.8k|      internal::westmere::write_v_u16_11bits_to_utf8(
  349|  22.8k|          in, utf8_output, one_byte_bytemask, one_byte_bitmask);
  350|  22.8k|      buf += 8;
  351|  22.8k|      continue;
  352|  22.8k|    }
  353|       |
  354|       |    // 1. Check if there are any surrogate word in the input chunk.
  355|       |    //    We have also deal with situation when there is a surrogate word
  356|       |    //    at the end of a chunk.
  357|  2.12M|    const __m128i surrogates_bytemask =
  358|  2.12M|        _mm_cmpeq_epi16(_mm_and_si128(in, v_f800), v_d800);
  359|       |
  360|       |    // bitmask = 0x0000 if there are no surrogates
  361|       |    //         = 0xc000 if the last word is a surrogate
  362|  2.12M|    const uint16_t surrogates_bitmask =
  363|  2.12M|        static_cast<uint16_t>(_mm_movemask_epi8(surrogates_bytemask));
  364|       |    // It might seem like checking for surrogates_bitmask == 0xc000 could help.
  365|       |    // However, it is likely an uncommon occurrence.
  366|  2.12M|    if (surrogates_bitmask == 0x0000) {
  ------------------
  |  Branch (366:9): [True: 1.58M, False: 531k]
  ------------------
  367|       |      // case: code units from register produce either 1, 2 or 3 UTF-8 bytes
  368|  1.58M|      const __m128i dup_even = _mm_setr_epi16(0x0000, 0x0202, 0x0404, 0x0606,
  369|  1.58M|                                              0x0808, 0x0a0a, 0x0c0c, 0x0e0e);
  370|       |
  371|       |      /* In this branch we handle three cases:
  372|       |         1. [0000|0000|0ccc|cccc] => [0ccc|cccc]                           -
  373|       |        single UFT-8 byte
  374|       |         2. [0000|0bbb|bbcc|cccc] => [110b|bbbb], [10cc|cccc]              - two
  375|       |        UTF-8 bytes
  376|       |         3. [aaaa|bbbb|bbcc|cccc] => [1110|aaaa], [10bb|bbbb], [10cc|cccc] -
  377|       |        three UTF-8 bytes
  378|       |
  379|       |        We expand the input word (16-bit) into two code units (32-bit), thus
  380|       |        we have room for four bytes. However, we need five distinct bit
  381|       |        layouts. Note that the last byte in cases #2 and #3 is the same.
  382|       |
  383|       |        We precompute byte 1 for case #1 and the common byte for cases #2 & #3
  384|       |        in register t2.
  385|       |
  386|       |        We precompute byte 1 for case #3 and -- **conditionally** -- precompute
  387|       |        either byte 1 for case #2 or byte 2 for case #3. Note that they
  388|       |        differ by exactly one bit.
  389|       |
  390|       |        Finally from these two code units we build proper UTF-8 sequence, taking
  391|       |        into account the case (i.e, the number of bytes to write).
  392|       |      */
  393|       |      /**
  394|       |       * Given [aaaa|bbbb|bbcc|cccc] our goal is to produce:
  395|       |       * t2 => [0ccc|cccc] [10cc|cccc]
  396|       |       * s4 => [1110|aaaa] ([110b|bbbb] OR [10bb|bbbb])
  397|       |       */
  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  399|       |      // [aaaa|bbbb|bbcc|cccc] => [bbcc|cccc|bbcc|cccc]
  400|  1.58M|      const __m128i t0 = _mm_shuffle_epi8(in, dup_even);
  401|       |      // [bbcc|cccc|bbcc|cccc] => [00cc|cccc|0bcc|cccc]
  402|  1.58M|      const __m128i t1 = _mm_and_si128(t0, simdutf_vec(0b0011111101111111));
  ------------------
  |  |  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  403|       |      // [00cc|cccc|0bcc|cccc] => [10cc|cccc|0bcc|cccc]
  404|  1.58M|      const __m128i t2 = _mm_or_si128(t1, simdutf_vec(0b1000000000000000));
  ------------------
  |  |  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  405|       |
  406|       |      // [aaaa|bbbb|bbcc|cccc] =>  [0000|aaaa|bbbb|bbcc]
  407|  1.58M|      const __m128i s0 = _mm_srli_epi16(in, 4);
  408|       |      // [0000|aaaa|bbbb|bbcc] => [0000|aaaa|bbbb|bb00]
  409|  1.58M|      const __m128i s1 = _mm_and_si128(s0, simdutf_vec(0b0000111111111100));
  ------------------
  |  |  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  410|       |      // [0000|aaaa|bbbb|bb00] => [00bb|bbbb|0000|aaaa]
  411|  1.58M|      const __m128i s2 = _mm_maddubs_epi16(s1, simdutf_vec(0x0140));
  ------------------
  |  |  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  412|       |      // [00bb|bbbb|0000|aaaa] => [11bb|bbbb|1110|aaaa]
  413|  1.58M|      const __m128i s3 = _mm_or_si128(s2, simdutf_vec(0b1100000011100000));
  ------------------
  |  |  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  414|  1.58M|      const __m128i m0 = _mm_andnot_si128(one_or_two_bytes_bytemask,
  415|  1.58M|                                          simdutf_vec(0b0100000000000000));
  ------------------
  |  |  398|  1.58M|#define simdutf_vec(x) _mm_set1_epi16(static_cast<uint16_t>(x))
  ------------------
  416|  1.58M|      const __m128i s4 = _mm_xor_si128(s3, m0);
  417|  1.58M|#undef simdutf_vec
  418|       |
  419|       |      // 4. expand code units 16-bit => 32-bit
  420|  1.58M|      const __m128i out0 = _mm_unpacklo_epi16(t2, s4);
  421|  1.58M|      const __m128i out1 = _mm_unpackhi_epi16(t2, s4);
  422|       |
  423|       |      // 5. compress 32-bit code units into 1, 2 or 3 bytes -- 2 x shuffle
  424|  1.58M|      const uint16_t mask =
  425|  1.58M|          (one_byte_bitmask & 0x5555) | (one_or_two_bytes_bitmask & 0xaaaa);
  426|  1.58M|      if (mask == 0) {
  ------------------
  |  Branch (426:11): [True: 1.41M, False: 176k]
  ------------------
  427|       |        // We only have three-byte code units. Use fast path.
  428|  1.41M|        const __m128i shuffle = _mm_setr_epi8(2, 3, 1, 6, 7, 5, 10, 11, 9, 14,
  429|  1.41M|                                              15, 13, -1, -1, -1, -1);
  430|  1.41M|        const __m128i utf8_0 = _mm_shuffle_epi8(out0, shuffle);
  431|  1.41M|        const __m128i utf8_1 = _mm_shuffle_epi8(out1, shuffle);
  432|  1.41M|        _mm_storeu_si128((__m128i *)utf8_output, utf8_0);
  433|  1.41M|        utf8_output += 12;
  434|  1.41M|        _mm_storeu_si128((__m128i *)utf8_output, utf8_1);
  435|  1.41M|        utf8_output += 12;
  436|  1.41M|        buf += 8;
  437|  1.41M|        continue;
  438|  1.41M|      }
  439|   176k|      const uint8_t mask0 = uint8_t(mask);
  440|       |
  441|   176k|      const uint8_t *row0 =
  442|   176k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
  443|   176k|      const __m128i shuffle0 = _mm_loadu_si128((__m128i *)(row0 + 1));
  444|   176k|      const __m128i utf8_0 = _mm_shuffle_epi8(out0, shuffle0);
  445|       |
  446|   176k|      const uint8_t mask1 = static_cast<uint8_t>(mask >> 8);
  447|       |
  448|   176k|      const uint8_t *row1 =
  449|   176k|          &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
  450|   176k|      const __m128i shuffle1 = _mm_loadu_si128((__m128i *)(row1 + 1));
  451|   176k|      const __m128i utf8_1 = _mm_shuffle_epi8(out1, shuffle1);
  452|       |
  453|   176k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_0);
  454|   176k|      utf8_output += row0[0];
  455|   176k|      _mm_storeu_si128((__m128i *)utf8_output, utf8_1);
  456|   176k|      utf8_output += row1[0];
  457|       |
  458|   176k|      buf += 8;
  459|       |      // surrogate pair(s) in a register
  460|   531k|    } else {
  461|       |      // Let us do a scalar fallback.
  462|       |      // It may seem wasteful to use scalar code, but being efficient with SIMD
  463|       |      // in the presence of surrogate pairs may require non-trivial tables.
  464|   531k|      size_t forward = 15;
  465|   531k|      size_t k = 0;
  466|   531k|      if (size_t(end - buf) < forward + 1) {
  ------------------
  |  Branch (466:11): [True: 0, False: 531k]
  ------------------
  467|      0|        forward = size_t(end - buf - 1);
  468|      0|      }
  469|  1.19M|      for (; k < forward; k++) {
  ------------------
  |  Branch (469:14): [True: 1.19M, False: 987]
  ------------------
  470|  1.19M|        uint16_t word = scalar::utf16::swap_if_needed<big_endian>(buf[k]);
  471|  1.19M|        if ((word & 0xFF80) == 0) {
  ------------------
  |  Branch (471:13): [True: 61.0k, False: 1.13M]
  ------------------
  472|  61.0k|          *utf8_output++ = char(word);
  473|  1.13M|        } else if ((word & 0xF800) == 0) {
  ------------------
  |  Branch (473:20): [True: 38.8k, False: 1.09M]
  ------------------
  474|  38.8k|          *utf8_output++ = char((word >> 6) | 0b11000000);
  475|  38.8k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  476|  1.09M|        } else if ((word & 0xF800) != 0xD800) {
  ------------------
  |  Branch (476:20): [True: 473k, False: 623k]
  ------------------
  477|   473k|          *utf8_output++ = char((word >> 12) | 0b11100000);
  478|   473k|          *utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
  479|   473k|          *utf8_output++ = char((word & 0b111111) | 0b10000000);
  480|   623k|        } else {
  481|       |          // must be a surrogate pair
  482|   623k|          uint16_t diff = uint16_t(word - 0xD800);
  483|   623k|          uint16_t next_word =
  484|   623k|              scalar::utf16::swap_if_needed<big_endian>(buf[k + 1]);
  485|   623k|          k++;
  486|   623k|          uint16_t diff2 = uint16_t(next_word - 0xDC00);
  487|   623k|          if ((diff | diff2) > 0x3FF) {
  ------------------
  |  Branch (487:15): [True: 530k, False: 92.6k]
  ------------------
  488|   530k|            return std::make_pair(
  489|   530k|                result(error_code::SURROGATE, buf - start + k - 1),
  490|   530k|                utf8_output);
  491|   530k|          }
  492|  92.6k|          uint32_t value = (diff << 10) + diff2 + 0x10000;
  493|  92.6k|          *utf8_output++ = char((value >> 18) | 0b11110000);
  494|  92.6k|          *utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
  495|  92.6k|          *utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
  496|  92.6k|          *utf8_output++ = char((value & 0b111111) | 0b10000000);
  497|  92.6k|        }
  498|  1.19M|      }
  499|    987|      buf += k;
  500|    987|    }
  501|  2.12M|  } // while
  502|       |
  503|  3.78k|  return std::make_pair(result(error_code::SUCCESS, buf - start), utf8_output);
  504|   534k|}