| /kernel/linux/linux-5.10/arch/x86/events/amd/ |
| H A D | ibs.c | 922 int nodes; in setup_ibs_ctl() local 925 nodes = 0; in setup_ibs_ctl() 933 ++nodes; in setup_ibs_ctl() 945 if (!nodes) { in setup_ibs_ctl() 956 * success we initialize all nodes with this offset. This updates then
|
| /kernel/linux/linux-5.10/net/qrtr/ |
| H A D | ns.c | 18 static RADIX_TREE(nodes, GFP_KERNEL); 75 node = radix_tree_lookup(&nodes, node_id); in node_get() 86 if (radix_tree_insert(&nodes, node_id, node)) { in node_get() 614 radix_tree_for_each_slot(node_slot, &nodes, &node_iter, 0) { in ctrl_cmd_new_lookup()
|
| /kernel/linux/linux-5.10/sound/pci/hda/ |
| H A D | hda_proc.c | 743 int i, nodes; in print_codec_info() local 759 nodes = snd_hda_get_sub_nodes(codec, fg, &nid); in print_codec_info() 760 if (! nid || nodes < 0) { in print_codec_info() 770 for (i = 0; i < nodes; i++, nid++) { in print_codec_info()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | replay.c | 42 * sorts the replay list in nodes sequence number order, and then inserts all 583 * with the authentication nodes on this LEB. Authentication nodes are written 587 * because a powercut happened when some nodes were written but not the 588 * corresponding authentication node. This function returns the number of nodes 604 list_for_each_entry(snod, &sleb->nodes, list) { in authenticate_sleb() 636 * A powercut can happen when some nodes were written, but not yet in authenticate_sleb() 642 dbg_mnt("%d unauthenticated nodes found on LEB %d, Ignoring them", in authenticate_sleb() 646 dbg_mnt("%d unauthenticated nodes found on non-last LEB %d", in authenticate_sleb() 662 * This function replays bud @bud, recovers it if needed, and adds all nodes [all...] |
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | replay.c | 42 * sorts the replay list in nodes sequence number order, and then inserts all 583 * with the authentication nodes on this LEB. Authentication nodes are written 587 * because a powercut happened when some nodes were written but not the 588 * corresponding authentication node. This function returns the number of nodes 604 list_for_each_entry(snod, &sleb->nodes, list) { in authenticate_sleb() 636 * A powercut can happen when some nodes were written, but not yet in authenticate_sleb() 642 dbg_mnt("%d unauthenticated nodes found on LEB %d, Ignoring them", in authenticate_sleb() 646 dbg_mnt("%d unauthenticated nodes found on non-last LEB %d", in authenticate_sleb() 662 * This function replays bud @bud, recovers it if needed, and adds all nodes [all...] |
| /kernel/linux/linux-6.6/drivers/interconnect/qcom/ |
| H A D | msm8939.c | 1284 .nodes = msm8939_snoc_nodes, 1305 .nodes = msm8939_snoc_mm_nodes, 1334 .nodes = msm8939_bimc_nodes, 1406 .nodes = msm8939_pcnoc_nodes,
|
| H A D | qcs404.c | 987 .nodes = qcs404_bimc_nodes, 1042 .nodes = qcs404_pcnoc_nodes, 1071 .nodes = qcs404_snoc_nodes,
|
| /kernel/linux/linux-6.6/sound/pci/hda/ |
| H A D | hda_proc.c | 779 int i, nodes; in print_codec_info() local 795 nodes = snd_hda_get_sub_nodes(codec, fg, &nid); in print_codec_info() 796 if (! nid || nodes < 0) { in print_codec_info() 806 for (i = 0; i < nodes; i++, nid++) { in print_codec_info()
|
| /kernel/linux/linux-6.6/arch/powerpc/lib/ |
| H A D | qspinlock.c | 25 struct qnode nodes[MAX_NODES]; member 278 struct qnode *qnode = &qnodesp->nodes[idx]; in get_tail_qnode() 569 node = &qnodesp->nodes[idx]; in queued_spin_lock_mcs_queue()
|
| /kernel/linux/linux-5.10/drivers/md/persistent-data/ |
| H A D | dm-btree.h | 55 * because previously-shared btree nodes have now diverged. 200 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; member
|
| /kernel/linux/linux-5.10/net/tipc/ |
| H A D | name_table.h | 99 * - used by name_distr to send bulk updates to new nodes 124 u32 upper, struct tipc_nlist *nodes);
|
| /kernel/linux/linux-5.10/drivers/staging/media/ipu3/ |
| H A D | ipu3.h | 20 * master queue, the driver queues a buffer also to all other active nodes. 21 * If user space hasn't provided a buffer to all other video nodes first, 113 struct imgu_video_device nodes[IMGU_NODE_NUM]; member
|
| /kernel/linux/linux-6.6/drivers/staging/media/ipu3/ |
| H A D | ipu3.h | 20 * master queue, the driver queues a buffer also to all other active nodes. 21 * If user space hasn't provided a buffer to all other video nodes first, 108 struct imgu_video_device nodes[IMGU_NODE_NUM]; member
|
| /kernel/linux/linux-6.6/drivers/scsi/elx/efct/ |
| H A D | efct_xport.h | 121 /* number of allocated nodes */ 125 /* array of pointers to nodes */ 126 struct efc_node **nodes; member
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/wangxun/txgbe/ |
| H A D | txgbe_type.h | 182 struct txgbe_nodes nodes; member
|
| /kernel/linux/linux-6.6/certs/ |
| H A D | Makefile | 48 cmd_gen_key = openssl req -new -nodes -utf8 -$(CONFIG_MODULE_SIG_HASH) -days 36500 \
|
| /kernel/linux/linux-6.6/drivers/md/persistent-data/ |
| H A D | dm-btree.h | 56 * because previously-shared btree nodes have now diverged. 201 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; member
|
| /kernel/linux/linux-6.6/net/tipc/ |
| H A D | name_table.h | 97 * - used by name_distr to send bulk updates to new nodes 120 struct tipc_nlist *nodes);
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | common-node-cache.h | 22 // Bundles various caches for common nodes. 85 // Return all nodes from the cache. 86 void GetCachedNodes(ZoneVector<Node*>* nodes);
|
| H A D | state-values-utils.h | 43 // ValueArray - array of nodes ({node} has to be nullptr). 69 Node* GetValuesNodeFromCache(Node** nodes, size_t count, 100 // Returns the number of empty nodes that were skipped over.
|
| H A D | js-graph.h | 77 // Adds all the cached nodes to the given list. 78 void GetCachedNodes(NodeVector* nodes); 80 // Cached global nodes.
|
| /third_party/python/Lib/lib2to3/ |
| H A D | btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further 6 matching. This reduces significantly the number of candidate nodes.""" 33 self.nodes = [self.root] 91 recheck the nodes
|
| /third_party/rust/crates/regex/regex-syntax/src/hir/ |
| H A D | visitor.rs | 27 /// nodes. 33 /// `Hir` nodes. 38 /// This method is called between child nodes of an alternation. 66 /// A stack of `Hir` nodes. This is roughly analogous to the call stack 85 /// The remaining child nodes to visit (which may be empty). 93 /// The remaining child nodes to visit (which may be empty). 140 // Otherwise, we've finished visiting all the child nodes for in visit() 148 /// and only if there are child nodes in the HIR). Otherwise, return None.
|
| /kernel/linux/linux-5.10/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
| H A D | fwsignal.c | 447 struct brcmf_fws_mac_descriptor nodes[BRCMF_FWS_MAC_DESC_TABLE_SIZE]; member 736 entry = &fws->desc.nodes[0]; in brcmf_fws_macdesc_lookup() 737 for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) { in brcmf_fws_macdesc_lookup() 847 /* cleanup individual nodes */ in brcmf_fws_cleanup() 848 table = &fws->desc.nodes[0]; in brcmf_fws_cleanup() 849 for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) in brcmf_fws_cleanup() 997 entry = &fws->desc.nodes[mac_handle & 0x1F]; in brcmf_fws_macdesc_indicate() 1054 entry = &fws->desc.nodes[mac_handle & 0x1F]; in brcmf_fws_macdesc_state_indicate() 1128 entry = &fws->desc.nodes[data[1] & 0x1F]; in brcmf_fws_request_indicate()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | super.c | 1017 root_ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_get_subvol_name_from_objectid() 1019 len = btrfs_root_ref_name_len(path->nodes[0], root_ref); in btrfs_get_subvol_name_from_objectid() 1025 read_extent_buffer(path->nodes[0], ptr + 1, in btrfs_get_subvol_name_from_objectid() 1028 dirid = btrfs_root_ref_dirid(path->nodes[0], root_ref); in btrfs_get_subvol_name_from_objectid() 1057 inode_ref = btrfs_item_ptr(path->nodes[0], in btrfs_get_subvol_name_from_objectid() 1060 len = btrfs_inode_ref_name_len(path->nodes[0], in btrfs_get_subvol_name_from_objectid() 1067 read_extent_buffer(path->nodes[0], ptr + 1, in btrfs_get_subvol_name_from_objectid() 1127 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location); in get_default_subvol_objectid()
|