Home
last modified time | relevance | path

Searched refs:keys (Results 3101 - 3125 of 3215) sorted by relevance

1...<<121122123124125126127128129

/third_party/googletest/googletest/scripts/
H A Dupload.py716 for filename in patches.keys():
/third_party/libbpf/include/uapi/linux/
H A Dbpf.h622 * The *keys* and *values* are output parameters which must point
624 * and value size of the map *map_fd*. The *keys* buffer must be
637 * user buffer, with the keys copied into *keys* and the values
647 * May set *errno* to **ENOSPC** to indicate that *keys* or
662 * *count* elements may be deleted without returning the keys
673 * The *keys* and *values* are input parameters which must point
675 * and value size of the map *map_fd*. The *keys* buffer must be
679 * Each element specified in *keys* is sequentially updated to the
724 * The *keys* paramete
1421 __aligned_u64 keys; global() member
[all...]
/third_party/node/test/parallel/
H A Dtest-buffer-alloc.js1049 const a = [...Array(128).keys()]; // [0, 1, 2, 3, ... 126, 127]
/third_party/node/deps/v8/tools/mb/
H A Dmb.py889 # of key-value pairs, and de-dup the keys if need be so that only
1086 [int(x) for x in builds.keys() if "text" in builds[x] and
/third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/
H A Dcommand.js1633 Object.keys(option.implied)
/third_party/nghttp2/src/
H A Dshrpx_config.h621 std::vector<TicketKey> keys; member
/third_party/node/deps/npm/node_modules/lru-cache/dist/commonjs/
H A Dindex.js78 // else to hold that many keys and values. Just filling the memory with
614 * Return a generator yielding the keys in the cache,
617 *keys() {
627 * Inverse order version of {@link LRUCache.keys}
629 * Return a generator yielding the keys in the cache,
/third_party/node/deps/npm/node_modules/lru-cache/dist/esm/
H A Dindex.js75 // else to hold that many keys and values. Just filling the memory with
611 * Return a generator yielding the keys in the cache,
614 *keys() {
624 * Inverse order version of {@link LRUCache.keys}
626 * Return a generator yielding the keys in the cache,
/third_party/node/deps/v8/src/heap/
H A Dfactory.h180 Handle<EnumCache> NewEnumCache(Handle<FixedArray> keys,
233 // One-byte strings are pretenured when used as keys in the SourceCodeCache.
H A Dobject-stats.cc897 RecordSimpleVirtualObjectStats(array, enum_cache.keys(), in RecordVirtualMapDetails()
/third_party/python/Lib/http/
H A Dclient.py197 for line in self.keys():
/third_party/python/Lib/
H A Ddifflib.py288 for elt in b2j.keys():
291 for elt in junk: # separate loop avoids separate list of keys
376 # b2j has no junk keys, the loop is skipped if a[i] is junk
/third_party/python/Lib/tkinter/
H A Dttk.py190 # will format specific keys according to Tcl code
476 keys 'configure', 'map', 'layout' and 'element create' and they
1602 next(iter(kwargs.keys()))))
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DYAMLTraits.h272 /// to/from a YAML mapping in the case where the names of the keys are not known
770 virtual std::vector<StringRef> keys() = 0; in needsQuotes()
1100 for (StringRef key : io.keys()) in needsQuotes()
1385 /// as the keys in the document. in needsQuotes()
1412 std::vector<StringRef> keys() override; in needsQuotes()
1559 std::vector<StringRef> keys() override;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/
H A DInstrProfReader.cpp674 for (StringRef Name : Underlying.HashTable->keys()) {
726 /// Mapping from mangled name keys to the name used for the key in the
/third_party/python/Lib/test/
H A Dtest_copy.py731 self._keys = list(d.keys())
/third_party/python/Mac/BuildScript/
H A Dbuild-installer.py141 UNIVERSALOPTS = tuple(universal_opts_map.keys())
/third_party/python/Lib/test/test_importlib/source/
H A Dtest_file_loader.py133 "{0}".format(list(module.__dict__.keys())))
/third_party/python/Lib/xmlrpc/
H A Dclient.py531 if type_ in self.dispatch.keys():
771 dispatch["name"] = end_string # struct keys are always strings
/kernel/linux/linux-5.10/drivers/net/ethernet/broadcom/bnxt/
H A Dbnxt.c4882 struct flow_keys *keys = &fltr->fkeys; in bnxt_hwrm_cfa_ntuple_filter_alloc() local
4903 req.ip_protocol = keys->basic.ip_proto; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4905 if (keys->basic.n_proto == htons(ETH_P_IPV6)) { in bnxt_hwrm_cfa_ntuple_filter_alloc()
4912 keys->addrs.v6addrs.src; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4914 keys->addrs.v6addrs.dst; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4920 req.src_ipaddr[0] = keys->addrs.v4addrs.src; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4922 req.dst_ipaddr[0] = keys->addrs.v4addrs.dst; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4925 if (keys->control.flags & FLOW_DIS_ENCAPSULATION) { in bnxt_hwrm_cfa_ntuple_filter_alloc()
4931 req.src_port = keys->ports.src; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4933 req.dst_port = keys in bnxt_hwrm_cfa_ntuple_filter_alloc()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/broadcom/bnxt/
H A Dbnxt.c4954 struct flow_keys *keys = &fltr->fkeys; in bnxt_hwrm_cfa_ntuple_filter_alloc() local
4978 req->ip_protocol = keys->basic.ip_proto; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4980 if (keys->basic.n_proto == htons(ETH_P_IPV6)) { in bnxt_hwrm_cfa_ntuple_filter_alloc()
4987 keys->addrs.v6addrs.src; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4989 keys->addrs.v6addrs.dst; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4995 req->src_ipaddr[0] = keys->addrs.v4addrs.src; in bnxt_hwrm_cfa_ntuple_filter_alloc()
4997 req->dst_ipaddr[0] = keys->addrs.v4addrs.dst; in bnxt_hwrm_cfa_ntuple_filter_alloc()
5000 if (keys->control.flags & FLOW_DIS_ENCAPSULATION) { in bnxt_hwrm_cfa_ntuple_filter_alloc()
5006 req->src_port = keys->ports.src; in bnxt_hwrm_cfa_ntuple_filter_alloc()
5008 req->dst_port = keys in bnxt_hwrm_cfa_ntuple_filter_alloc()
[all...]
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs1360 let mut keys: Vec<_> = (0..n).map(|_| rng.gen::<usize>() % n).collect(); variables
1362 for &k in &keys {
1366 keys.shuffle(&mut rng);
1371 let t = map.get(&keys[i]);
1582 // The returned map has small keys and values.
1583 // Benchmarks on it have a counterpart in set.rs with the same keys and no values at all.
1588 // The returned map has small keys and large values.
22294 /// significantly faster, as it does not recompute element keys.
29200 /// a `BTreeMap`, both iterators should produce keys in strictly ascending
29201 /// order, each greater than all keys i
31912 pub fn keys(&self) -> Keys<'_, K, V> { keys() functions
35662 let mut keys = self.keys(); assert_strictly_ascending() variables
37197 fn keys<T: Sync>(v: &BTreeMap<T, T>) -> impl Sync + '_ { drain_filter() functions
37266 fn keys<T: Send + Sync>(v: &BTreeMap<T, T>) -> impl Send + '_ { iter() functions
38299 pub fn keys(&self) -> &[K] { keys() functions
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Ddisk-io.c126 * Lockdep class keys for extent_buffer->lock's in this root. For a given
131 * other and they require separate keysets. As lockdep keys should be
157 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1]; member
193 BUG_ON(level >= ARRAY_SIZE(ks->keys)); in btrfs_set_buffer_lockdep_class()
201 &ks->keys[level], ks->names[level]); in btrfs_set_buffer_lockdep_class()
/kernel/linux/linux-5.10/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_main.c9407 off = cls->knode.sel->keys[i].off; in ixgbe_clsu32_build_input()
9408 val = cls->knode.sel->keys[i].val; in ixgbe_clsu32_build_input()
9409 m = cls->knode.sel->keys[i].mask; in ixgbe_clsu32_build_input()
9422 if (nexthdr->off == cls->knode.sel->keys[i].off && in ixgbe_clsu32_build_input()
9424 (__force u32)cls->knode.sel->keys[i].val && in ixgbe_clsu32_build_input()
9426 (__force u32)cls->knode.sel->keys[i].mask) in ixgbe_clsu32_build_input()
/kernel/linux/linux-6.6/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_main.c9498 off = cls->knode.sel->keys[i].off; in ixgbe_clsu32_build_input()
9499 val = cls->knode.sel->keys[i].val; in ixgbe_clsu32_build_input()
9500 m = cls->knode.sel->keys[i].mask; in ixgbe_clsu32_build_input()
9513 if (nexthdr->off == cls->knode.sel->keys[i].off && in ixgbe_clsu32_build_input()
9515 (__force u32)cls->knode.sel->keys[i].val && in ixgbe_clsu32_build_input()
9517 (__force u32)cls->knode.sel->keys[i].mask) in ixgbe_clsu32_build_input()

Completed in 127 milliseconds

1...<<121122123124125126127128129