Lines Matching defs:tables
374 // Repeat 16 values as many times as necessary (usually for lookup tables)
546 // Repeat 16 values as many times as necessary (usually for lookup tables)
1764 // Repeat 16 values as many times as necessary (usually for lookup tables)
1837 // Repeat 16 values as many times as necessary (usually for lookup tables)
1878 // Repeat 16 values as many times as necessary (usually for lookup tables)
2670 // Repeat 16 values as many times as necessary (usually for lookup tables)
2734 // Repeat 16 values as many times as necessary (usually for lookup tables)
2772 // Repeat 16 values as many times as necessary (usually for lookup tables)
3117 // Repeat 16 values as many times as necessary (usually for lookup tables)
3592 // Repeat 16 values as many times as necessary (usually for lookup tables)
3667 // Repeat 16 values as many times as necessary (usually for lookup tables)
3715 // Repeat 16 values as many times as necessary (usually for lookup tables)
5704 // The large tables should be included once and they
5706 /* begin file src/tables/utf8_to_utf16_tables.h */
5713 namespace tables {
10038 } // tables namespace
10043 /* end file src/tables/utf8_to_utf16_tables.h */
10044 /* begin file src/tables/utf16_to_utf8_tables.h */
10051 namespace tables {
10575 } // tables namespace
10580 /* end file src/tables/utf16_to_utf8_tables.h */
10581 // End of tables.
12654 uint8x16_t sh = vld1q_u8(reinterpret_cast<const uint8_t*>(simdutf::tables::utf8_to_utf16::shufutf8[shufutf8_idx]));
13140 &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
13211 // the lookup tables. Also 12 is nicely divisible by two and three.
13262 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
13265 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
13282 uint8x16_t sh = vld1q_u8(reinterpret_cast<const uint8_t*>(simdutf::tables::utf8_to_utf16::shufutf8[idx]));
13377 uint8x16_t sh = vld1q_u8(reinterpret_cast<const uint8_t*>(simdutf::tables::utf8_to_utf16::shufutf8[idx]));
13470 // the lookup tables. Also 12 is nicely divisible by two and three.
13485 // Ideally the compiler can keep the tables in registers.
13516 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
13518 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
13533 uint8x16_t sh = vld1q_u8(reinterpret_cast<const uint8_t*>(simdutf::tables::utf8_to_utf16::shufutf8[idx]));
13595 uint8x16_t sh = vld1q_u8(reinterpret_cast<const uint8_t*>(simdutf::tables::utf8_to_utf16::shufutf8[idx]));
13646 // the lookup tables. Also 12 is nicely divisible by two and three.
13666 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
13669 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
13681 uint8x16_t sh = vld1q_u8(reinterpret_cast<const uint8_t*>(simdutf::tables::utf8_to_utf16::shufutf8[idx]));
13806 - We need two 256-entry tables that have 8704 bytes in total.
13886 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
14002 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
14007 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
14021 // in the presence of surrogate pairs may require non-trivial tables.
14140 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
14256 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
14261 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
14275 // in the presence of surrogate pairs may require non-trivial tables.
14358 - We need two 256-entry tables that have 8704 bytes in total.
14389 // in the presence of surrogate pairs may require non-trivial tables.
14447 // in the presence of surrogate pairs may require non-trivial tables.
14595 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
14709 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
14714 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
14729 // in the presence of surrogate pairs may require non-trivial tables.
14828 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
14948 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
14953 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
14968 // in the presence of surrogate pairs may require non-trivial tables.
19887 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
19888 const uint8_t* row_2 = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2>>16)][0];
19986 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
19991 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
19996 const uint8_t* row2 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
20002 const uint8_t* row3 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
20019 // may require large, non-trivial tables?
20132 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
20133 const uint8_t* row_2 = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2>>16)][0];
20236 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
20241 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
20246 const uint8_t* row2 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
20252 const uint8_t* row3 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
20269 // may require large, non-trivial tables?
22547 &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
22549 &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2 >> 16)]
22631 // depends on "tables/utf8_to_utf16_tables.h"
22644 // the lookup tables. Also 12 is nicely divisible by two and three.
22704 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
22706 simdutf::tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
22714 _mm_loadu_si128((const __m128i *)simdutf::tables::utf8_to_utf16::shufutf8[idx]);
22725 _mm_loadu_si128((const __m128i *)simdutf::tables::utf8_to_utf16::shufutf8[idx]);
22752 _mm_loadu_si128((const __m128i *)simdutf::tables::utf8_to_utf16::shufutf8[idx]);
22813 // depends on "tables/utf8_to_utf16_tables.h"
22825 // the lookup tables. Also 12 is nicely divisible by two and three.
22877 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
22879 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
22887 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
22898 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
22915 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
23074 - We need two 256-entry tables that have 8704 bytes in total.
23145 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
23146 const uint8_t* row_2 = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2>>16)][0];
23248 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
23253 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
23258 const uint8_t* row2 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
23264 const uint8_t* row3 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
23281 // in the presence of surrogate pairs may require non-trivial tables.
23388 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
23389 const uint8_t* row_2 = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2>>16)][0];
23491 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
23496 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
23501 const uint8_t* row2 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
23507 const uint8_t* row3 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
23524 // in the presence of surrogate pairs may require non-trivial tables.
23606 - We need two 256-entry tables that have 8704 bytes in total.
23648 // in the presence of surrogate pairs may require non-trivial tables.
23716 // in the presence of surrogate pairs may require non-trivial tables.
23906 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
23907 const uint8_t* row_2 = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2>>16)][0];
24005 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
24010 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
24015 const uint8_t* row2 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
24021 const uint8_t* row3 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
24038 // may require large, non-trivial tables?
24151 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2)][0];
24152 const uint8_t* row_2 = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[uint8_t(M2>>16)][0];
24255 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
24260 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
24265 const uint8_t* row2 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask2][0];
24271 const uint8_t* row3 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask3][0];
24288 // may require large, non-trivial tables?
24452 // depends on "tables/utf8_to_utf16_tables.h"
24463 // the lookup tables. Also 12 is nicely divisible by two and three.
24498 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
24500 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
24510 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
28465 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
29106 // depends on "tables/utf8_to_utf16_tables.h"
29119 // the lookup tables. Also 12 is nicely divisible by two and three.
29181 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
29183 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
29191 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29202 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29229 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29290 // depends on "tables/utf8_to_utf16_tables.h"
29302 // the lookup tables. Also 12 is nicely divisible by two and three.
29357 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
29359 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
29367 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29378 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29395 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29420 // depends on "tables/utf8_to_utf16_tables.h"
29432 // the lookup tables. Also 12 is nicely divisible by two and three.
29450 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][0];
29452 tables::utf8_to_utf16::utf8bigindex[input_utf8_end_of_code_point_mask][1];
29462 _mm_loadu_si128((const __m128i *)tables::utf8_to_utf16::shufutf8[idx]);
29585 - We need two 256-entry tables that have 8704 bytes in total.
29733 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
29739 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
29753 // in the presence of surrogate pairs may require non-trivial tables.
29937 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
29943 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
29957 // in the presence of surrogate pairs may require non-trivial tables.
30040 - We need two 256-entry tables that have 8704 bytes in total.
30082 // in the presence of surrogate pairs may require non-trivial tables.
30150 // in the presence of surrogate pairs may require non-trivial tables.
30366 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
30456 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
30462 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
30476 // in the presence of surrogate pairs may require non-trivial tables.
30622 const uint8_t* row = &simdutf::tables::utf16_to_utf8::pack_1_2_utf8_bytes[m2][0];
30718 const uint8_t* row0 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask0][0];
30724 const uint8_t* row1 = &simdutf::tables::utf16_to_utf8::pack_1_2_3_utf8_bytes[mask1][0];
30738 // in the presence of surrogate pairs may require non-trivial tables.