Home
last modified time | relevance | path

Searched refs:keys (Results 26 - 50 of 1266) sorted by relevance

12345678910>>...51

/third_party/node/deps/npm/node_modules/graceful-fs/
H A Dlegacy-streams.js30 var keys = Object.keys(options);
31 for (var index = 0, length = keys.length; index < length; index++) {
32 var key = keys[index];
92 var keys = Object.keys(options);
93 for (var index = 0, length = keys.length; index < length; index++) {
94 var key = keys[index];
/third_party/toybox/toys/pending/
H A Dgetfattr.c37 char *keys, *key; in do_getfattr() local
45 // Collect the keys. in do_getfattr()
48 keys = xmalloc(keys_len); in do_getfattr()
49 if (lister(file, keys, keys_len) == keys_len) break; in do_getfattr()
50 free(keys); in do_getfattr()
55 // Sort the keys. in do_getfattr()
56 for (key = keys, key_count = 0; key-keys < keys_len; key += strlen(key)+1) in do_getfattr()
59 for (key = keys, i = 0; key-keys < keys_le in do_getfattr()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/eap_common/
H A Deap_ikev2_common.c18 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys, in eap_ikev2_derive_keymat() argument
27 if (keys->SK_d == NULL || i_nonce == NULL || r_nonce == NULL) in eap_ikev2_derive_keymat()
37 if (ikev2_prf_plus(prf, keys->SK_d, keys->SK_d_len, nonces, nlen, in eap_ikev2_derive_keymat()
68 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys, in eap_ikev2_validate_icv() argument
75 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar; in eap_ikev2_validate_icv()
96 if (ikev2_integ_hash(integ_alg, SK_a, keys->SK_integ_len, in eap_ikev2_validate_icv()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/eap_common/
H A Deap_ikev2_common.c18 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys, in eap_ikev2_derive_keymat() argument
27 if (keys->SK_d == NULL || i_nonce == NULL || r_nonce == NULL) in eap_ikev2_derive_keymat()
37 if (ikev2_prf_plus(prf, keys->SK_d, keys->SK_d_len, nonces, nlen, in eap_ikev2_derive_keymat()
68 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys, in eap_ikev2_validate_icv() argument
75 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar; in eap_ikev2_validate_icv()
96 if (ikev2_integ_hash(integ_alg, SK_a, keys->SK_integ_len, in eap_ikev2_validate_icv()
/third_party/libinput/tools/
H A Dlibinput-record-verify-yaml.py44 def dict_key_crosscheck(self, d, keys):
45 """Check that each key in d is in keys, and that each key is in d"""
46 self.assertEqual(sorted(d.keys()), sorted(keys))
292 keys = ["type", "seat", "logical_seat"]
294 self.dict_key_crosscheck(e, keys)
299 keys = ["type", "time", "delta", "unaccel"]
301 self.dict_key_crosscheck(e, keys)
314 keys = ["type", "time", "button", "state", "seat_count"]
316 self.dict_key_crosscheck(e, keys)
[all...]
/third_party/lzma/Asm/x86/
H A DAesOpt.asm87 keys equ REG_PARAM_0 ; r1 define
196 mov keys, [r4 + aes_OFFS]
209 mov ksize_x, [keys + 16]
232 op state, [keys + offs]
237 movdqa key, [keys + offs]
272 movdqa iv, [keys]
273 add keys, 32
275 movdqa key0, [keys + 1 * ksize_r]
276 movdqa key_last, [keys]
340 movdqa [keys
[all...]
/third_party/node/test/fixtures/wpt/common/
H A Dsubset-tests-by-key.js6 var keys = {};
18 // test.html?get-keys
19 match = /(?:^\?|&)get-keys(&get-counts)?(?:&|$)/.exec(location.search);
31 for (var key in keys) {
34 meta = meta.replace("%s", keys[key]);
70 if (collectCounts && key in keys) {
71 keys[key]++;
73 keys[key] = 1;
/third_party/ltp/pan/
H A Dsymbol.c190 * add new keys for sub-trees until key list is exhausted;
196 const char **keys; /* key split into a 2d string array */ in sym_put() local
206 keys = splitstr(key, ",", NULL); in sym_put()
208 if (keys == NULL) { in sym_put()
213 for (kk = (char **)keys, csym = sym; in sym_put()
222 splitstr_free(keys); in sym_put()
227 splitstr_free(keys); in sym_put()
234 splitstr_free(keys); in sym_put()
255 splitstr_free(keys); in sym_put()
268 const char **keys; /* ke in sym_get() local
[all...]
H A Dreporter.c68 * I could get a key (tag), get it's sub-keys (TCIDs), then get the key
181 static int scanner_test_end(SYM alltags, SYM ctag, SYM keys) in scanner_test_end() argument
189 if (alltags == NULL || keys == NULL || ctag == NULL) in scanner_test_end()
192 /* insert keys into tag */ in scanner_test_end()
193 sym_put(ctag, "_keys", (void *)keys, 0); in scanner_test_end()
196 if ((tag = (char *)sym_get(keys, "tag")) == NULL) { in scanner_test_end()
201 sym_put(keys, "tag", strdup(tagname), 0); in scanner_test_end()
211 (char *)sym_get(keys, "initiation_status")) != NULL) { in scanner_test_end()
239 static int iscanner_test_end(SYM alltags, SYM ctag, SYM keys) in iscanner_test_end() argument
241 if (alltags == NULL || keys in iscanner_test_end()
[all...]
/third_party/python/Objects/
H A Dlistobject.c1086 /* A sortslice contains a pointer to an array of keys and a pointer to
1087 * an array of corresponding values. In other words, keys[i]
1088 * corresponds with values[i]. If values == NULL, then the keys are
1091 * Several convenience routines are provided here, so that keys and
1096 PyObject **keys; member
1103 s1->keys[i] = s2->keys[j]; in sortslice_copy()
1111 *dst->keys++ = *src->keys++; in sortslice_copy_incr()
1119 *dst->keys in sortslice_copy_decr()
2280 PyObject **keys; list_sort_impl() local
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dranden.cc40 // We combine these three ideas and also change Simpira's subround keys from
49 const void* keys; member
60 tmp.keys = RandenHwAes::GetKeys(); in GetRandenState()
63 tmp.keys = RandenSlow::GetKeys(); in GetRandenState()
68 tmp.keys = RandenHwAes::GetKeys(); in GetRandenState()
72 tmp.keys = RandenSlow::GetKeys(); in GetRandenState()
83 keys_ = tmp.keys; in Randen()
/third_party/node/test/es-module/
H A Dtest-esm-data-urls.js17 assert.deepStrictEqual(Object.keys(ns), ['default']);
37 assert.deepStrictEqual(Object.keys(ns), ['default']);
44 assert.deepStrictEqual(Object.keys(ns), ['default']);
51 assert.deepStrictEqual(Object.keys(ns), ['default']);
58 assert.deepStrictEqual(Object.keys(ns), ['default']);
64 assert.deepStrictEqual(Object.keys(ns), ['default']);
71 assert.deepStrictEqual(Object.keys(ns), ['default']);
86 assert.deepStrictEqual(Object.keys(ns), ['default']);
93 assert.deepStrictEqual(Object.keys(ns), ['default']);
/third_party/mbedtls/library/
H A Dssl_ticket.c69 mbedtls_ssl_ticket_key *key = ctx->keys + index; in ssl_ticket_gen_key()
115 * Rotate/generate keys if necessary
123 mbedtls_ssl_ticket_key * const key = ctx->keys + ctx->active; in ssl_ticket_update_keys()
140 if ((status = psa_destroy_key(ctx->keys[ctx->active].key)) != PSA_SUCCESS) { in ssl_ticket_update_keys()
160 mbedtls_ssl_ticket_key * const key = ctx->keys + idx; in mbedtls_ssl_ticket_rotate()
260 ctx->keys[0].alg = alg; in mbedtls_ssl_ticket_setup()
261 ctx->keys[0].key_type = key_type; in mbedtls_ssl_ticket_setup()
262 ctx->keys[0].key_bits = key_bits; in mbedtls_ssl_ticket_setup()
264 ctx->keys[1].alg = alg; in mbedtls_ssl_ticket_setup()
265 ctx->keys[ in mbedtls_ssl_ticket_setup()
[all...]
/third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/
H A DMapFieldTest.cs331 // Surprising, but IDictionary.Contains is only about keys. in IDictionary_Contains()
432 var keys = map.Keys; in KeysReturnsLiveView()
433 CollectionAssert.AreEqual(new string[0], keys); in KeysReturnsLiveView()
436 CollectionAssert.AreEqual(new[] { "foo", "x" }, keys); in KeysReturnsLiveView()
450 // Just test keys - we know the implementation is the same for values
455 var keys = map.Keys; in ViewsAreReadOnly()
456 Assert.IsTrue(keys.IsReadOnly); in ViewsAreReadOnly()
457 Assert.Throws<NotSupportedException>(() => keys.Clear()); in ViewsAreReadOnly()
458 Assert.Throws<NotSupportedException>(() => keys.Remove("a")); in ViewsAreReadOnly()
459 Assert.Throws<NotSupportedException>(() => keys in ViewsAreReadOnly()
[all...]
/drivers/peripheral/power/interfaces/hdi_service/src/
H A Dpower_config.cpp119 bool PowerConfig::SplitKey(const std::string& key, std::vector<std::string>& keys) const in SplitKey()
121 SplitStr(TrimStr(key), ".", keys); in SplitKey() local
122 return (keys.size() < MIN_DEPTH || keys.size() > MAX_DEPTH) ? false : true; in SplitKey()
127 std::vector<std::string> keys; in GetValue() local
128 if (!SplitKey(key, keys)) { in GetValue()
133 std::string firstKey = keys[MAP_KEY_INDEX]; in GetValue()
136 HDF_LOGW("Value is empty. key=%{public}s", keys[MAP_KEY_INDEX].c_str()); in GetValue()
140 for (size_t i = 1; i < keys.size(); ++i) { in GetValue()
141 if (!value.isObject() || !value.isMember(keys[ in GetValue()
[all...]
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/Retired/
H A DcheckLinks.py42 if (curFile not in emittedPrefix.keys()):
76 if (value in dict.keys()):
231 if (tag in protos.keys()):
242 if (tag in structs.keys()):
263 if (value not in protos.keys()):
266 if (value not in structs.keys() and
267 value not in handles.keys()):
270 if (value not in consts.keys() and value not in defines.keys()):
273 if (value not in enums.keys() an
[all...]
/third_party/nghttp2/contrib/
H A Dtlsticketupdate.go51 var interval = flag.Int("interval", 3600, "interval to update TLS ticket keys")
67 keys := [][]byte{
78 for _, key := range keys {
95 // rotate keys. the last key is now encryption key.
99 // keep at most past 11 keys as decryption only key
100 n := len(keys) + 1
105 newKeys[0] = keys[len(keys)-1]
106 copy(newKeys[1:], keys[0:n-2])
109 keys
[all...]
/third_party/node/deps/npm/lib/commands/
H A Dview.js48 pckmnt.versions = Object.keys(pckmnt.versions).sort(semver.compareLoose)
55 Object.keys(d).forEach((k) => {
109 data.map((v) => this.prettyView(pckmnt, v[Object.keys(v)[0]]['']))
161 data.map((v) => this.prettyView(pckmnt, v[Object.keys(v)[0]]['']))
176 if (Object.keys(results).length > 0) {
214 pckmnt.versions = Object.keys(versions).filter(v => {
227 Object.keys(versions).forEach((v) => {
261 const versions = Object.keys(data)
269 const fields = Object.keys(data[v])
306 if (msgJson.length && Object.keys(msgJso
[all...]
/third_party/typescript/tests/baselines/reference/
H A DliteralTypeWidening.js114 export function Set<K extends string>(...keys: K[]): Record<K, true | undefined> {
116 keys.forEach(key => result[key] = true)
120 export function keys<K extends string, V>(obj: Record<K, V>): K[] {
121 return Object.keys(obj) as K[]
128 export const langCodes = keys(langCodeSet)
173 exports.langCodes = exports.keys = exports.Set = void 0;
257 var keys = [];
259 keys[_i] = arguments[_i];
262 keys.forEach(function (key) { return result[key] = true; });
266 function keys(ob
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeKey.java45 * multiple possible lengths for a single range prefix. Range keys are particularly useful as
46 * unique "row keys" when representing range trees as tabular data.
51 * Order by prefix first and then minimum length. For row keys representing disjoint ranges, this
73 * Decomposes the given range tree into a sorted sequence of keys, representing the same digit
74 * sequences. The resulting keys form a disjoint covering of the original range set, and no
75 * two keys will contain the same prefix (but prefixes of keys may overlap, even if the ranges
79 List<RangeKey> keys = new ArrayList<>(); in decompose()
80 // The ALLOW_EDGE_SPLITTING strategy works best for the case of generating row keys because it in decompose()
90 KeyVisitor.visit(f, keys); in decompose()
102 visit(RangeTree tree, List<RangeKey> keys) visit() argument
119 private final List<RangeKey> keys; global() field in RangeKey.KeyVisitor
126 KeyVisitor(List<RangeKey> keys) KeyVisitor() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/metal/
H A Dgen_mtl_format_table.py387 for angle_format in sorted(angle_to_mtl.keys()):
389 for angle_format in sorted(angle_override.keys()):
394 for angle_format in sorted(mac_specific_map.keys()):
397 for angle_format in sorted(mac_override.keys()):
400 for angle_format in sorted(mac_override_bc1.keys()):
409 for angle_format in sorted(mac_override_es3.keys()):
417 for angle_format in sorted(ios_specific_map.keys()):
420 for angle_format in sorted(ios_override.keys()):
423 for angle_format in sorted(astc_tpl_map.keys()):
429 for angle_format in sorted(ios_specific_map.keys())
[all...]
/third_party/python/Lib/test/
H A Dmapping_tests.py53 knownkey = list(self.other.keys())[0]
71 # keys(), items(), iterkeys() ...
77 check_iterandlist(iter(d.keys()), list(d.keys()),
78 self.reference.keys())
79 check_iterandlist(iter(d), list(d.keys()), self.reference.keys())
98 for key in self.reference.keys():
144 self.assertEqual(list(d.keys()), [])
146 self.assertIn(list(self.inmapping.keys())[
202 def keys(self): global() member in BasicTestMappingProtocol.test_update.SimpleUserDict
216 def keys(self): global() member in BasicTestMappingProtocol.test_update.FailingUserDict
223 def keys(self): global() member in BasicTestMappingProtocol.test_update.FailingUserDict
240 def keys(self): global() member in BasicTestMappingProtocol.test_update.FailingUserDict
415 def keys(self): global() member in TestMappingProtocol.test_update.SimpleUserDict
[all...]
/third_party/jerryscript/tests/jerry/es2015/
H A Dproxy_own_keys.js44 Object.keys(proxy);
81 array_check(Object.keys(proxy), ["foo", "bar"]);
88 array_check(Object.keys(proxy), ["prop1", "prop2"]);
151 // test with duplicated keys
163 // test with lots of keys
184 var keys = ["foo"]; variable
188 return keys;
201 keys = ["nonconf"];
205 keys = ["foo", "nonconf"];
214 keys
[all...]
/third_party/python/Lib/idlelib/
H A Ddebugobj.py44 keys = dir(self.object)
46 for key in keys:
79 def keys(self): member in SequenceTreeItem
83 for key in self.keys():
95 def keys(self): member in DictTreeItem
96 keys = list(self.object.keys())
98 keys.sort()
101 return keys
/third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/
H A DMapFieldTest.cs332 // Surprising, but IDictionary.Contains is only about keys. in IDictionary_Contains()
433 var keys = map.Keys; in KeysReturnsLiveView()
434 CollectionAssert.AreEqual(new string[0], keys); in KeysReturnsLiveView()
437 CollectionAssert.AreEqual(new[] { "foo", "x" }, keys); in KeysReturnsLiveView()
451 // Just test keys - we know the implementation is the same for values
456 var keys = map.Keys; in ViewsAreReadOnly()
457 Assert.IsTrue(keys.IsReadOnly); in ViewsAreReadOnly()
458 Assert.Throws<NotSupportedException>(() => keys.Clear()); in ViewsAreReadOnly()
459 Assert.Throws<NotSupportedException>(() => keys.Remove("a")); in ViewsAreReadOnly()
460 Assert.Throws<NotSupportedException>(() => keys in ViewsAreReadOnly()
[all...]

Completed in 15 milliseconds

12345678910>>...51