Home
last modified time | relevance | path

Searched refs:nodes (Results 601 - 625 of 924) sorted by relevance

1...<<21222324252627282930>>...37

/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree.h56 * 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 Dname_table.h97 * - 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 Dcommon-node-cache.h22 // Bundles various caches for common nodes.
85 // Return all nodes from the cache.
86 void GetCachedNodes(ZoneVector<Node*>* nodes);
H A Dstate-values-utils.h43 // 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 Djs-graph.h77 // Adds all the cached nodes to the given list.
78 void GetCachedNodes(NodeVector* nodes);
80 // Cached global nodes.
H A Dcode-assembler.cc1079 // implicit nodes are target and optionally context. in CallStubN()
1200 Node* nodes[] = {target, args...}; in TailCallBytecodeDispatch() local
1201 CHECK_EQ(descriptor.GetParameterCount() + 1, arraysize(nodes)); in TailCallBytecodeDispatch()
1202 raw_assembler()->TailCallN(call_descriptor, arraysize(nodes), nodes); in TailCallBytecodeDispatch()
1221 Node* nodes[] = {code, function, new_target, arg_count, context}; in TailCallJSCode() local
1222 CHECK_EQ(descriptor.GetParameterCount() + 2, arraysize(nodes)); in TailCallJSCode()
1223 raw_assembler()->TailCallN(call_descriptor, arraysize(nodes), nodes); in TailCallJSCode()
1526 // merge and phi nodes hav in MergeVariables()
[all...]
/third_party/python/Lib/lib2to3/
H A Dbtm_matcher.py5 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 Dvisitor.rs27 /// 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-6.6/fs/btrfs/
H A Dinode.c170 eb = warn->path.nodes[0]; in data_reloc_print_warning_inode()
271 eb = path.nodes[0]; in print_data_reloc_error()
540 leaf = path->nodes[0]; in insert_inline_extent()
1845 * if path->nodes[0] is NULL or not if it needs to use the path afterwards.
1857 struct extent_buffer *leaf = path->nodes[0]; in can_nocow_file_extent()
2015 leaf = path->nodes[0]; in run_delalloc_nocow()
2025 leaf = path->nodes[0]; in run_delalloc_nocow()
2032 leaf = path->nodes[0]; in run_delalloc_nocow()
2113 if (!path->nodes[0]) in run_delalloc_nocow()
2909 leaf = path->nodes[ in insert_reserved_file_extent()
[all...]
H A Dsuper.c1017 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()
H A Ddelayed-inode.c177 root->nodes++; in btrfs_queue_delayed_node()
189 root->nodes--; in btrfs_dequeue_delayed_node()
757 data_ptr = btrfs_item_ptr(path->nodes[0], path->slots[0], char); in btrfs_insert_delayed_item()
758 write_extent_buffer(path->nodes[0], &curr->data, in btrfs_insert_delayed_item()
843 struct extent_buffer *leaf = path->nodes[0]; in btrfs_batch_delete_items()
1028 leaf = path->nodes[0]; in __btrfs_update_delayed_inode()
1085 leaf = path->nodes[0]; in __btrfs_update_delayed_inode()
1172 ASSERT(path->nodes[0] == NULL); in __btrfs_run_delayed_items()
2152 * nodes) and we don't want to do such change because we don't create or in btrfs_log_get_delayed_items()
2195 * nodes) an in btrfs_log_put_delayed_items()
[all...]
/kernel/linux/linux-5.10/arch/x86/events/amd/
H A Dibs.c922 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 Dns.c18 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 Dhda_proc.c743 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 Dreplay.c42 * 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 Dreplay.c42 * 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 Dmsm8939.c1284 .nodes = msm8939_snoc_nodes,
1305 .nodes = msm8939_snoc_mm_nodes,
1334 .nodes = msm8939_bimc_nodes,
1406 .nodes = msm8939_pcnoc_nodes,
H A Dqcs404.c987 .nodes = qcs404_bimc_nodes,
1042 .nodes = qcs404_pcnoc_nodes,
1071 .nodes = qcs404_snoc_nodes,
H A Dmsm8996.c1815 .nodes = a0noc_nodes,
1838 .nodes = a1noc_nodes,
1860 .nodes = a2noc_nodes,
1889 .nodes = bimc_nodes,
1948 .nodes = cnoc_nodes,
2002 .nodes = mnoc_nodes,
2041 .nodes = pnoc_nodes,
2086 .nodes = snoc_nodes,
/kernel/linux/linux-6.6/sound/pci/hda/
H A Dhda_proc.c779 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 Dqspinlock.c25 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/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dfwsignal.c447 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/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dfwsignal.c447 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/drivers/net/ethernet/hisilicon/hns3/hns3pf/
H A Dhclge_debugfs.c932 struct hclge_tm_nodes_cmd *nodes; in hclge_dbg_dump_tm_nodes() local
941 "failed to dump tm nodes, ret = %d\n", ret); in hclge_dbg_dump_tm_nodes()
945 nodes = (struct hclge_tm_nodes_cmd *)desc.data; in hclge_dbg_dump_tm_nodes()
949 nodes->pg_base_id, nodes->pg_num); in hclge_dbg_dump_tm_nodes()
951 nodes->pri_base_id, nodes->pri_num); in hclge_dbg_dump_tm_nodes()
953 le16_to_cpu(nodes->qset_base_id), in hclge_dbg_dump_tm_nodes()
954 le16_to_cpu(nodes->qset_num)); in hclge_dbg_dump_tm_nodes()
956 le16_to_cpu(nodes in hclge_dbg_dump_tm_nodes()
[all...]
/foundation/graphic/graphic_2d/rosen/modules/render_service_profiler/
H A Drs_profiler_base.cpp346 // remove all nodes belong to given pid (by matching higher 32 bits of node id) in FilterForPlayback()
454 std::vector<std::shared_ptr<RSRenderNode>> nodes; in MarshalNodes() local
455 nodes.emplace_back(rootRenderNode); in MarshalNodes()
462 nodes.emplace_back(node); in MarshalNodes()
467 const uint32_t nodeCount = nodes.size(); in MarshalNodes()
469 for (const auto& node : nodes) { // no nullptr in nodes, omit check in MarshalNodes()

Completed in 47 milliseconds

1...<<21222324252627282930>>...37