Home
last modified time | relevance | path

Searched refs:names (Results 326 - 350 of 1332) sorted by relevance

1...<<11121314151617181920>>...54

/kernel/linux/linux-6.6/scripts/
H A Dcheck-sysctl-docs23 # children: maps ctl_table names and procnames to child ctl_table names
25 # entries: maps ctl_table names and procnames to counts (so
28 # files: maps procnames to source file names
29 # paths: maps ctl_path names to paths
125 match($0, /.procname[\t ]*=[\t ]*"([^"]+)"/, names)
127 curentry = curentry "/" names[1]
129 curentry = names[1]
136 match($0, /.procname[\t ]*=[\t ]*"([^"]+)"/, names)
137 curentry = names[
[all...]
/third_party/node/test/fixtures/wpt/user-timing/resources/
H A Duser-timing-helper.js11 assert_equals(actualEntrySet.size, actualEntries.length, `Actual entry names are not unique: ${JSON.stringify(actualEntries)}`);
13 assert_equals(expectedEntrySet.size, expectedEntries.length, `Expected entry names are not unique: ${JSON.stringify(expectedEntries)}`);
/third_party/rust/crates/clap/src/builder/
H A Dpossible_value.rs139 pub fn aliases(mut self, names: impl IntoIterator<Item = impl Into<Str>>) -> Self { in aliases()
140 self.aliases.extend(names.into_iter().map(|a| a.into())); in aliases()
/third_party/python/Tools/scripts/
H A Dfinddiv.py72 names = os.listdir(dir)
77 for name in names:
H A Dlinktree.py53 names = os.listdir(old)
57 for name in names:
/third_party/python/Lib/lib2to3/fixes/
H A Dfix_import.py19 def traverse_imports(names):
21 Walks over all the names imported in a dotted_as_names node.
23 pending = [names]
/third_party/skia/third_party/externals/swiftshader/src/Common/
H A DConfigurator.hpp57 std::vector<std::string> names; member
62 std::vector<std::string> names; member in sw::Configurator
/third_party/skia/third_party/externals/swiftshader/src/System/
H A DConfigurator.hpp57 std::vector<std::string> names; member
62 std::vector<std::string> names; member in sw::Configurator
/third_party/python/Lib/lib2to3/tests/
H A Dpytree_idempotency.py57 names = os.listdir(dir)
61 for name in names:
/third_party/node/deps/openssl/openssl/apps/
H A Dspeed.c275 static const char *names[ALGOR_NUM] = { variable
1833 if (!have_md(names[i])) in speed_main()
1837 if (!have_cipher(names[i])) in speed_main()
1882 print_message(names[D_MD2], c[D_MD2][testnum], lengths[testnum], in speed_main()
1895 print_message(names[D_MDC2], c[D_MDC2][testnum], lengths[testnum], in speed_main()
1908 print_message(names[D_MD4], c[D_MD4][testnum], lengths[testnum], in speed_main()
1921 print_message(names[D_MD5], c[D_MD5][testnum], lengths[testnum], in speed_main()
1934 print_message(names[D_SHA1], c[D_SHA1][testnum], lengths[testnum], in speed_main()
1947 print_message(names[D_SHA256], c[D_SHA256][testnum], in speed_main()
1960 print_message(names[D_SHA51 in speed_main()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/impl/
H A DPeriodFormatterData.java169 String[] names = useMedium ? dr.mediumNames : dr.shortNames; in appendUnit()
170 if (names == null || names[px] == null) { in appendUnit()
171 names = useMedium ? dr.shortNames : dr.mediumNames; in appendUnit()
173 if (names != null && names[px] != null) { in appendUnit()
175 names[px], last, sb); // omit suffix, ok? in appendUnit()
279 // only custom names we have for now in appendCount()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/duration/impl/
H A DPeriodFormatterData.java171 String[] names = useMedium ? dr.mediumNames : dr.shortNames; in appendUnit()
172 if (names == null || names[px] == null) { in appendUnit()
173 names = useMedium ? dr.shortNames : dr.mediumNames; in appendUnit()
175 if (names != null && names[px] != null) { in appendUnit()
177 names[px], last, sb); // omit suffix, ok? in appendUnit()
281 // only custom names we have for now in appendCount()
/third_party/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/docs/
H A DCodeMangler.java43 private boolean nonames; // true if no names in header
45 private ArrayList names; // files/directories to process field in CodeMangler
86 names = new ArrayList(); in CodeMangler()
174 names.add(arg); in CodeMangler()
236 if (names.isEmpty()) { in CodeMangler()
237 names.add("."); in CodeMangler()
262 return process("", (String[])names.toArray(new String[names.size()])); in run()
/third_party/skia/third_party/externals/freetype/src/base/
H A Dftmac.c54 codes to ps glyph names to glyph ID's...)
441 unsigned char* names[64]; in parse_fond() local
454 names[i] = p; in parse_fond()
455 p += names[i][0]; in parse_fond()
460 size_t ps_name_len = (size_t)names[0][0]; in parse_fond()
465 ft_memcpy(ps_name, names[0] + 1, ps_name_len); in parse_fond()
471 unsigned char* suffixes = names[style->indexes[face_index] - 1]; in parse_fond()
480 if ( j < string_count && ( s = names[j] ) != NULL ) in parse_fond()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/format/
H A DRbnfTest.java144 String[] names = fmt3.getRuleSetNames(); in TestCoverage()
164 str = fmt3.format(2.3, names[0]); in TestCoverage()
174 str = fmt3.format(123L, names[0]); in TestCoverage()
1058 /* display names in "en_US" locale*/ in TestRuleSetDisplayName()
1060 /* display names in "zh_Hans" locale*/ in TestRuleSetDisplayName()
1062 /* display names in a fake locale*/ in TestRuleSetDisplayName()
1118 String[] names = { in TestAllLocales()
1128 for (int j = 0; j < names.length; ++j) { in TestAllLocales()
1145 logln(loc.getName() + names[j] + "success format: " + n + " -> " + s); in TestAllLocales()
1154 logln(loc.getName() + names[ in TestAllLocales()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
H A DRbnfTest.java141 String[] names = fmt3.getRuleSetNames(); in TestCoverage()
161 str = fmt3.format(2.3, names[0]); in TestCoverage()
171 str = fmt3.format(123L, names[0]); in TestCoverage()
1114 /* display names in "en_US" locale*/ in TestRuleSetDisplayName()
1116 /* display names in "zh_Hans" locale*/ in TestRuleSetDisplayName()
1118 /* display names in a fake locale*/ in TestRuleSetDisplayName()
1174 String[] names = { in TestAllLocales()
1188 for (int j = 0; j < names.length; ++j) { in TestAllLocales()
1205 logln(loc.getName() + names[j] + "success format: " + n + " -> " + s); in TestAllLocales()
1213 logln(loc.getName() + names[ in TestAllLocales()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dpm_opp.h145 struct opp_table *dev_pm_opp_set_regulators(struct device *dev, const char * const names[], unsigned int count);
151 struct opp_table *dev_pm_opp_attach_genpd(struct device *dev, const char **names, struct device ***virt_devs);
316 static inline struct opp_table *dev_pm_opp_set_regulators(struct device *dev, const char * const names[], unsigned int count) in dev_pm_opp_set_regulators() argument
330 static inline struct opp_table *dev_pm_opp_attach_genpd(struct device *dev, const char **names, struct device ***virt_devs) in dev_pm_opp_attach_genpd() argument
/third_party/gn/src/base/
H A Dlogging.cc113 const char* names);
117 const char* names);
121 const char* names);
125 const char* names);
/third_party/icu/icu4c/source/common/
H A Ducmndata.cpp124 offsetTOCPrefixBinarySearch(const char *s, const char *names, in offsetTOCPrefixBinarySearch() argument
141 * At the same time, we find if s is one of the start and (limit-1) names, in offsetTOCPrefixBinarySearch()
144 if(0==strcmpAfterPrefix(s, names+toc[0].nameOffset, &startPrefixLength)) { in offsetTOCPrefixBinarySearch()
149 if(0==strcmpAfterPrefix(s, names+toc[limit].nameOffset, &limitPrefixLength)) { in offsetTOCPrefixBinarySearch()
155 int32_t cmp=strcmpAfterPrefix(s, names+toc[i].nameOffset, &prefixLength); in offsetTOCPrefixBinarySearch()
186 * At the same time, we find if s is one of the start and (limit-1) names, in pointerTOCPrefixBinarySearch()
/third_party/nghttp2/src/
H A Dshrpx_tls_test.cc80 constexpr StringRef names[] = { in test_shrpx_tls_create_lookup_tree() local
86 num = array_size(names); in test_shrpx_tls_create_lookup_tree()
90 tree->add_cert(names[idx], idx); in test_shrpx_tls_create_lookup_tree()
93 CU_ASSERT((ssize_t)i == tree->lookup(names[i])); in test_shrpx_tls_create_lookup_tree()
/third_party/node/deps/icu-small/source/common/
H A Ducmndata.cpp124 offsetTOCPrefixBinarySearch(const char *s, const char *names, in offsetTOCPrefixBinarySearch() argument
141 * At the same time, we find if s is one of the start and (limit-1) names, in offsetTOCPrefixBinarySearch()
144 if(0==strcmpAfterPrefix(s, names+toc[0].nameOffset, &startPrefixLength)) { in offsetTOCPrefixBinarySearch()
149 if(0==strcmpAfterPrefix(s, names+toc[limit].nameOffset, &limitPrefixLength)) { in offsetTOCPrefixBinarySearch()
155 int32_t cmp=strcmpAfterPrefix(s, names+toc[i].nameOffset, &prefixLength); in offsetTOCPrefixBinarySearch()
186 * At the same time, we find if s is one of the start and (limit-1) names, in pointerTOCPrefixBinarySearch()
/third_party/musl/libc-test/src/functionalext/unittest/
H A Dunit_test_ldso_ns_config.c495 sections.names = (char**)calloc(sections.size, sizeof *sections.names); in ns_config_test_0320()
499 if (sections.names){ in ns_config_test_0320()
500 free(sections.names); in ns_config_test_0320()
/third_party/python/Tools/c-analyzer/c_analyzer/
H A Dinfo.py168 names = set(super().__dir__())
169 names.update(self._extra)
170 names.remove('_locked')
171 return sorted(names)
/third_party/python/Lib/
H A Dcmd.py310 names = self.get_names()
314 for name in names:
317 names.sort()
320 for name in names:
/third_party/skia/third_party/externals/icu/source/common/
H A Ducmndata.cpp124 offsetTOCPrefixBinarySearch(const char *s, const char *names, in offsetTOCPrefixBinarySearch() argument
141 * At the same time, we find if s is one of the start and (limit-1) names, in offsetTOCPrefixBinarySearch()
144 if(0==strcmpAfterPrefix(s, names+toc[0].nameOffset, &startPrefixLength)) { in offsetTOCPrefixBinarySearch()
149 if(0==strcmpAfterPrefix(s, names+toc[limit].nameOffset, &limitPrefixLength)) { in offsetTOCPrefixBinarySearch()
155 int32_t cmp=strcmpAfterPrefix(s, names+toc[i].nameOffset, &prefixLength); in offsetTOCPrefixBinarySearch()
186 * At the same time, we find if s is one of the start and (limit-1) names, in pointerTOCPrefixBinarySearch()

Completed in 22 milliseconds

1...<<11121314151617181920>>...54