Home
last modified time | relevance | path

Searched refs:ARRAY_LENGTH (Results 1 - 25 of 91) sorted by relevance

1234

/third_party/skia/third_party/externals/harfbuzz/src/
H A Dtest-number.cc102 assert (ARRAY_LENGTH (str) == 4); in main()
103 const char *end = str + ARRAY_LENGTH (str); in main()
115 assert (ARRAY_LENGTH (str) == 5); in main()
116 const char *end = str + ARRAY_LENGTH (str); in main()
128 assert (ARRAY_LENGTH (str) == 5); in main()
129 const char *end = str + ARRAY_LENGTH (str); in main()
141 const char *end = str + ARRAY_LENGTH (str); in main()
153 const char *end = str + ARRAY_LENGTH (str) - 1; in main()
165 const char *end = str + ARRAY_LENGTH (str) - 1; in main()
177 const char *end = str + ARRAY_LENGTH (st in main()
[all...]
H A Dhb-buffer-serialize.cc148 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), "%u", info[i].codepoint)); in _hb_buffer_serialize_glyphs_json()
151 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"cl\":%u", info[i].cluster)); in _hb_buffer_serialize_glyphs_json()
156 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"dx\":%d,\"dy\":%d", in _hb_buffer_serialize_glyphs_json()
159 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"ax\":%d,\"ay\":%d", in _hb_buffer_serialize_glyphs_json()
166 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"fl\":%u", info[i].mask & HB_GLYPH_FLAG_DEFINED)); in _hb_buffer_serialize_glyphs_json()
173 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"xb\":%d,\"yb\":%d", in _hb_buffer_serialize_glyphs_json()
175 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"w\":%d,\"h\":%d", in _hb_buffer_serialize_glyphs_json()
230 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), "%u", info[i].codepoint)); in _hb_buffer_serialize_unicode_json()
233 p += hb_max (0, snprintf (p, ARRAY_LENGTH (b) - (p - b), ",\"cl\":%u", info[i].cluster)); in _hb_buffer_serialize_unicode_json()
292 p += hb_max (0, snprintf (p, ARRAY_LENGTH ( in _hb_buffer_serialize_glyphs_text()
[all...]
H A Dhb-ucd.cc141 ARRAY_LENGTH (_hb_ucd_dm2_u32_map), in hb_ucd_compose()
152 ARRAY_LENGTH (_hb_ucd_dm2_u64_map), in hb_ucd_compose()
176 if (i < ARRAY_LENGTH (_hb_ucd_dm1_p0_map) + ARRAY_LENGTH (_hb_ucd_dm1_p2_map)) in hb_ucd_decompose()
178 if (i < ARRAY_LENGTH (_hb_ucd_dm1_p0_map)) in hb_ucd_decompose()
182 i -= ARRAY_LENGTH (_hb_ucd_dm1_p0_map); in hb_ucd_decompose()
188 i -= ARRAY_LENGTH (_hb_ucd_dm1_p0_map) + ARRAY_LENGTH (_hb_ucd_dm1_p2_map); in hb_ucd_decompose()
190 if (i < ARRAY_LENGTH (_hb_ucd_dm2_u32_map)) in hb_ucd_decompose()
197 i -= ARRAY_LENGTH (_hb_ucd_dm2_u32_ma in hb_ucd_decompose()
[all...]
H A Dhb-subset-input.cc86 input->sets.drop_tables->add_array (default_drop_tables, ARRAY_LENGTH (default_drop_tables)); in hb_subset_input_create_or_fail()
102 ARRAY_LENGTH (default_no_subset_tables)); in hb_subset_input_create_or_fail()
191 input->sets.layout_features->add_array (default_layout_features, ARRAY_LENGTH (default_layout_features)); in hb_subset_input_create_or_fail()
H A Dhb-pool.hh84 for (unsigned i = 0; i < ARRAY_LENGTH (arrayZ) - 1; i++) in thread()
87 * (T**) &arrayZ[ARRAY_LENGTH (arrayZ) - 1] = nullptr; in thread()
H A Dhb-ot-cff1-table.cc218 if (sid < ARRAY_LENGTH (standard_encoding_to_code)) in lookup_standard_encoding_for_code()
226 if (sid < ARRAY_LENGTH (expert_encoding_to_code)) in lookup_expert_encoding_for_code()
234 if (glyph < ARRAY_LENGTH (expert_charset_to_sid)) in lookup_expert_charset_for_sid()
242 if (glyph < ARRAY_LENGTH (expert_subset_charset_to_sid)) in lookup_expert_subset_charset_for_sid()
262 if (code < ARRAY_LENGTH (standard_encoding_to_sid)) in lookup_standard_encoding_for_sid()
H A Dhb-cff-interp-dict-common.hh91 for (unsigned i = 0, count = 0; count < ARRAY_LENGTH (buf); ++i, ++count) in parse_bcd()
120 if (unlikely (count == ARRAY_LENGTH (buf))) break; in parse_bcd()
H A Dhb-ot-shape-complex-arabic-fallback.hh116 for (unsigned int first_glyph_idx = 0; first_glyph_idx < ARRAY_LENGTH (first_glyphs); first_glyph_idx++) in arabic_fallback_synthesize_lookup_ligature()
136 for (unsigned int second_glyph_idx = 0; second_glyph_idx < ARRAY_LENGTH (ligature_table[0].ligatures); second_glyph_idx++) in arabic_fallback_synthesize_lookup_ligature()
269 for (unsigned int i = 0; i < ARRAY_LENGTH(arabic_fallback_features) ; i++) in arabic_fallback_plan_init_unicode()
/third_party/qrcodegen/c/
H A Dqrcodegen-test.c38 #define ARRAY_LENGTH(name) (sizeof(name) / sizeof(name[0])) macro
230 for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { in testGetNumDataCodewords()
254 for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { in testGetNumRawDataModules()
299 uint8_t remainder[ARRAY_LENGTH(generator)]; in testReedSolomonComputeRemainder()
300 reedSolomonComputeDivisor(ARRAY_LENGTH(generator), generator); in testReedSolomonComputeRemainder()
301 reedSolomonComputeRemainder(data, 0, generator, ARRAY_LENGTH(generator), remainder); in testReedSolomonComputeRemainder()
310 uint8_t remainder[ARRAY_LENGTH(generator)]; in testReedSolomonComputeRemainder()
311 reedSolomonComputeDivisor(ARRAY_LENGTH(generator), generator); in testReedSolomonComputeRemainder()
312 reedSolomonComputeRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generato in testReedSolomonComputeRemainder()
[all...]
/third_party/node/test/node-api/test_threadsafe_function/
H A Dtest.js13 })(binding.ARRAY_LENGTH);
87 if (callCount === binding.ARRAY_LENGTH) {
102 quitAfter: binding.ARRAY_LENGTH,
113 quitAfter: binding.ARRAY_LENGTH,
122 quitAfter: binding.ARRAY_LENGTH,
131 quitAfter: binding.ARRAY_LENGTH,
218 maxQueueSize: binding.ARRAY_LENGTH >>> 1,
219 quitAfter: binding.ARRAY_LENGTH,
H A Dbinding.c10 #define ARRAY_LENGTH 10000 macro
27 static int ints[ARRAY_LENGTH];
72 for (index = ARRAY_LENGTH - 1; index > -1 && !queue_was_closing; index--) { in data_source_thread()
304 for (index = 0; index < ARRAY_LENGTH; index++) { in Init()
308 napi_create_uint32(env, ARRAY_LENGTH, &js_array_length); in Init()
313 "ARRAY_LENGTH", in Init()
/third_party/libevdev/libevdev/
H A Dlibevdev-names.c68 entry = lookup_name(ev_names, ARRAY_LENGTH(ev_names), &lookup); in libevdev_event_type_from_name_n()
89 for (i = 0; i < ARRAY_LENGTH(ev_names); ++i) { in type_from_prefix()
124 entry = lookup_name(code_names, ARRAY_LENGTH(code_names), &lookup); in libevdev_event_code_from_name_n()
147 entry = lookup_name(tool_type_names, ARRAY_LENGTH(tool_type_names), &lookup); in libevdev_event_value_from_name_n()
167 entry = lookup_name(prop_names, ARRAY_LENGTH(prop_names), &lookup); in libevdev_property_from_name_n()
188 entry = lookup_name(code_names, ARRAY_LENGTH(code_names), &lookup); in libevdev_event_code_from_code_name_n()
210 entry = lookup_name(code_names, ARRAY_LENGTH(code_names), &lookup); in libevdev_event_type_from_code_name_n()
/third_party/libinput/src/
H A Dutil-macros.h30 #define ARRAY_LENGTH(a) (sizeof (a) / sizeof (a)[0]) macro
37 _elem < (_arr) + ARRAY_LENGTH(_arr); \
/third_party/icu/icu4c/source/test/intltest/
H A Dtstnorm.cpp28 #define ARRAY_LENGTH(array) UPRV_LENGTHOF(array) macro
173 for (i = 0; i < ARRAY_LENGTH(canonTests); i++) { in TestPrevious()
179 for (i = 0; i < ARRAY_LENGTH(canonTests); i++) { in TestPrevious()
189 iterateTest(norm, canonTests, ARRAY_LENGTH(canonTests), 1); in TestDecomp()
190 staticTest(UNORM_NFD, 0, canonTests, ARRAY_LENGTH(canonTests), 1); in TestDecomp()
197 iterateTest(norm, compatTests, ARRAY_LENGTH(compatTests), 1); in TestCompatDecomp()
200 compatTests, ARRAY_LENGTH(compatTests), 1); in TestCompatDecomp()
207 iterateTest(norm, canonTests, ARRAY_LENGTH(canonTests), 2); in TestCanonCompose()
210 ARRAY_LENGTH(canonTests), 2); in TestCanonCompose()
217 iterateTest(norm, compatTests, ARRAY_LENGTH(compatTest in TestCompatCompose()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/number/
H A DLongNameHandler.java33 private static final int ARRAY_LENGTH = StandardPlural.COUNT + 2; field in LongNameHandler
84 // NOTE: outArray MUST have at least ARRAY_LENGTH entries. No bounds checking is performed.
178 String[] measureData = new String[ARRAY_LENGTH]; in getUnitDisplayName()
188 String[] simpleFormats = new String[ARRAY_LENGTH]; in forCurrencyLongNames()
216 String[] simpleFormats = new String[ARRAY_LENGTH]; in forMeasureUnit()
233 String[] primaryData = new String[ARRAY_LENGTH]; in forCompoundUnit()
235 String[] secondaryData = new String[ARRAY_LENGTH]; in forCompoundUnit()
/third_party/libinput/test/
H A Dtest-keyboard.c35 const int num_devices = ARRAY_LENGTH(devices); in START_TEST()
183 int events[2 * (ARRAY_LENGTH(keys) + 1)]; in START_TEST()
190 while (i < 2 * ARRAY_LENGTH(keys)) { in START_TEST()
207 for (i = 0; i < ARRAY_LENGTH(keys); ++i) { in START_TEST()
244 for (i = 0; i < ARRAY_LENGTH(keys); ++i) { in START_TEST()
256 for (i = 0; i < ARRAY_LENGTH(keys); ++i) { in START_TEST()
/third_party/icu/icu4c/source/i18n/
H A Dnumber_longnames.cpp49 constexpr int32_t ARRAY_LENGTH = StandardPlural::Form::COUNT + 3; member
120 // The `strings` array must have ARRAY_LENGTH items: one corresponding to each
250 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
255 for (int32_t i = 0; i < ARRAY_LENGTH; i++) { in InflectedPluralSink()
378 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
382 for (int32_t i = 0; i < ARRAY_LENGTH; i++) { in PluralTableSink()
417 * @param outArray must be of fixed length ARRAY_LENGTH.
516 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH.
930 UnicodeString simpleFormats[ARRAY_LENGTH]; in forMeasureUnit()
1009 UnicodeString numeratorUnitData[ARRAY_LENGTH]; in forArbitraryUnit()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dnumber_longnames.cpp49 constexpr int32_t ARRAY_LENGTH = StandardPlural::Form::COUNT + 3; member
120 // The `strings` array must have ARRAY_LENGTH items: one corresponding to each
250 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
255 for (int32_t i = 0; i < ARRAY_LENGTH; i++) { in InflectedPluralSink()
378 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
382 for (int32_t i = 0; i < ARRAY_LENGTH; i++) { in PluralTableSink()
417 * @param outArray must be of fixed length ARRAY_LENGTH.
516 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH.
930 UnicodeString simpleFormats[ARRAY_LENGTH]; in forMeasureUnit()
1009 UnicodeString numeratorUnitData[ARRAY_LENGTH]; in forArbitraryUnit()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dnumber_longnames.cpp49 constexpr int32_t ARRAY_LENGTH = StandardPlural::Form::COUNT + 3; member
120 // The `strings` array must have ARRAY_LENGTH items: one corresponding to each
250 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
255 for (int32_t i = 0; i < ARRAY_LENGTH; i++) { in InflectedPluralSink()
389 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
393 for (int32_t i = 0; i < ARRAY_LENGTH; i++) { in PluralTableSink()
432 * @param outArray must be of fixed length ARRAY_LENGTH.
518 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH.
932 UnicodeString simpleFormats[ARRAY_LENGTH]; in forMeasureUnit()
1011 UnicodeString numeratorUnitData[ARRAY_LENGTH]; in forArbitraryUnit()
[all...]
/third_party/skia/third_party/externals/harfbuzz/util/
H A Dfont-options.hh110 for (unsigned int i = 0; i < ARRAY_LENGTH (supported_font_funcs); i++) in post_parse()
119 for (unsigned int i = 0; i < ARRAY_LENGTH (supported_font_funcs); i++) in post_parse()
241 for (unsigned int i = 1; i < ARRAY_LENGTH (supported_font_funcs); i++) in add_options()
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/postmortem/
H A DvktPostmortemDeviceFaultTests.cpp40 #define ARRAY_LENGTH(a_) std::extent<decltype(a_)>::value macro
292 info.addressType = addressTypes[ i % ARRAY_LENGTH(addressTypes) ];
293 info.addressPrecision = addressPrecisions[ i % ARRAY_LENGTH(addressPrecisions) ];
307 info.vendorFaultCode = vendorFaultCodes[ i % ARRAY_LENGTH(vendorFaultCodes) ];
308 info.vendorFaultData = (i + 1) % ARRAY_LENGTH(vendorFaultCodes);
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/postmortem/
H A DvktPostmortemDeviceFaultTests.cpp40 #define ARRAY_LENGTH(a_) std::extent<decltype(a_)>::value macro
292 info.addressType = addressTypes[ i % ARRAY_LENGTH(addressTypes) ];
293 info.addressPrecision = addressPrecisions[ i % ARRAY_LENGTH(addressPrecisions) ];
307 info.vendorFaultCode = vendorFaultCodes[ i % ARRAY_LENGTH(vendorFaultCodes) ];
308 info.vendorFaultData = (i + 1) % ARRAY_LENGTH(vendorFaultCodes);
/third_party/libevdev/test/
H A Dtest-libevdev-events.c361 ARRAY_LENGTH(abs), abs, in START_TEST()
415 ARRAY_LENGTH(abs), abs, in START_TEST()
500 ARRAY_LENGTH(abs), abs, in START_TEST()
675 ARRAY_LENGTH(abs), abs, in START_TEST()
830 ARRAY_LENGTH(abs), abs, in START_TEST()
1028 ARRAY_LENGTH(abs), abs, in START_TEST()
1245 test_create_abs_device(&uidev, &dev, ARRAY_LENGTH(abs), abs, -1); in START_TEST()
1322 ARRAY_LENGTH(abs), abs, in START_TEST()
1361 ARRAY_LENGTH(abs), abs, in START_TEST()
1431 ARRAY_LENGTH(ab in START_TEST()
[all...]
/third_party/mbedtls/library/
H A Dcommon.h64 /** \def ARRAY_LENGTH
71 /* A correct implementation of ARRAY_LENGTH, but which silently gives
93 #define ARRAY_LENGTH(array) \ macro
100 #define ARRAY_LENGTH(array) ARRAY_LENGTH_UNSAFE(array) macro
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/
H A DLongNameHandler.java42 static final int ARRAY_LENGTH = StandardPlural.COUNT + i++; field in LongNameHandler
174 // NOTE: outArray MUST have a length of at least ARRAY_LENGTH. No bounds
180 for (int i = 0; i < ARRAY_LENGTH; i++) { in InflectedPluralSink()
305 // NOTE: outArray MUST have at least ARRAY_LENGTH entries. No bounds
347 // NOTE: outArray MUST have at least ARRAY_LENGTH entries. No bounds checking is performed.
767 String[] measureData = new String[ARRAY_LENGTH]; in getUnitDisplayName()
777 String[] simpleFormats = new String[ARRAY_LENGTH]; in forCurrencyLongNames()
814 String[] simpleFormats = new String[ARRAY_LENGTH]; in forMeasureUnit()
876 String[] numeratorUnitData = new String[ARRAY_LENGTH]; in forArbitraryUnit()
881 String[] denominatorUnitData = new String[ARRAY_LENGTH]; in forArbitraryUnit()
[all...]

Completed in 22 milliseconds

1234