Home
last modified time | relevance | path

Searched refs:nodes (Results 376 - 400 of 924) sorted by relevance

1...<<11121314151617181920>>...37

/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbtree.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
367 * flush, and writes appending to leaf nodes aren't blocking anything so in do_btree_node_write()
689 * It's _really_ critical that we don't free too many btree nodes - we in bch_mca_scan()
904 * We can only have one thread cannibalizing other cached btree nodes at a time,
932 * the list. Check if there's any freed nodes there: in mca_alloc()
1231 * ptr_invalid() can't return true for the keys that mark btree nodes as in __bch_btree_mark_key()
1310 gc->nodes++; in btree_gc_mark_node()
1359 unsigned int i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1373 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes] in btree_gc_coalesce()
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/apic/
H A Dapic_numachip.c173 u32 nodes = 1; in fixup_cpu_id() local
177 /* Account for nodes per socket in multi-core-module processors */ in fixup_cpu_id()
180 nodes = ((val >> 3) & 7) + 1; in fixup_cpu_id()
183 c->phys_proc_id = node / nodes; in fixup_cpu_id()
/kernel/linux/linux-6.6/arch/x86/kernel/apic/
H A Dapic_numachip.c162 u32 nodes = 1; in fixup_cpu_id() local
166 /* Account for nodes per socket in multi-core-module processors */ in fixup_cpu_id()
169 nodes = ((val >> 3) & 7) + 1; in fixup_cpu_id()
172 c->phys_proc_id = node / nodes; in fixup_cpu_id()
/kernel/linux/linux-6.6/drivers/interconnect/imx/
H A Dimx8mp.c185 static struct imx_icc_node_desc nodes[] = { variable
239 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes), noc_setting_nodes); in imx8mp_icc_probe()
/third_party/mesa3d/src/egl/main/
H A Degldevice.c227 return dev->device->nodes[DRM_NODE_RENDER]; in _eglGetDRMDeviceRenderNode()
254 return dev->device->nodes[DRM_NODE_PRIMARY]; in _eglQueryDeviceStringEXT()
266 return dev->device ? dev->device->nodes[DRM_NODE_RENDER] : NULL; in _eglQueryDeviceStringEXT()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dindex.js106 // Get the actual nodes corresponding to a root node's child workspaces,
115 const nodes = []
131 nodes.push(node)
134 return nodes
137 // returns a set of workspace nodes and all their deps
/third_party/node/deps/v8/src/compiler/
H A Djs-graph.cc100 void JSGraph::GetCachedNodes(NodeVector* nodes) { in GetCachedNodes() argument
101 cache_.GetCachedNodes(nodes); in GetCachedNodes()
103 if (name##_) nodes->push_back(name##_); in GetCachedNodes()
H A Dloop-analysis.h42 // Represents a loop in the tree of loops, including the header nodes,
110 // Return a range which can iterate over the header nodes of {loop}.
119 // Return a range which can iterate over the body nodes of {loop}.
125 // Return a range which can iterate over the body nodes of {loop}.
131 // Return a range which can iterate over the nodes of {loop}.
183 // Find all nodes in the loop headed by {loop_header} if it contains no nested
186 // marked with LoopExit, LoopExitEffect, LoopExitValue, or End nodes.
188 // 1) the loop size (in graph nodes) exceeds {max_size},
197 // Copies a range of nodes any number of times.
200 // {max}: The maximum number of nodes tha
223 CopyNodes(Graph* graph, Zone* tmp_zone_, Node* dead, base::iterator_range<InputIterator> nodes, SourcePositionTable* source_positions, NodeOriginTable* node_origins) CopyNodes() argument
[all...]
/third_party/mesa3d/src/util/tests/
H A Ddag_test.cpp79 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes) in init_nodes() argument
82 dag_init_node(dag, static_cast<struct dag_node *>(&nodes[i])); in init_nodes()
83 nodes[i].val = i; in init_nodes()
/third_party/skia/third_party/externals/angle2/src/tests/deqp_support/
H A DtcuRandomOrderExecutor.cpp94 static TestNode *findNodeByName(vector<TestNode *> &nodes, const std::string &name) in findNodeByName() argument
96 for (vector<TestNode *>::const_iterator node = nodes.begin(); node != nodes.end(); ++node) in findNodeByName()
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/bloat/
H A Dwebtreemap.js15 // Size of border around nodes.
99 // Given a list of rectangles |nodes|, the 1-d space available
105 function selectSpan(nodes, space, start) {
109 var node = nodes[start];
114 for (var end = start; node = nodes[end]; ++end) {
/kernel/linux/linux-5.10/fs/btrfs/
H A Dref-verify.c437 struct extent_buffer *leaf = path->nodes[0]; in process_extent_item()
501 struct extent_buffer *leaf = path->nodes[0]; in process_leaf()
563 block_bytenr = btrfs_node_blockptr(path->nodes[level], in walk_down_tree()
565 gen = btrfs_node_ptr_generation(path->nodes[level], in walk_down_tree()
567 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in walk_down_tree()
579 path->nodes[level-1] = eb; in walk_down_tree()
598 if (!path->nodes[l]) in walk_up_tree()
603 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree()
608 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree()
609 free_extent_buffer(path->nodes[ in walk_up_tree()
[all...]
H A Ddelayed-inode.h27 * Used for delayed nodes which is waiting to be dealt with by the
34 int nodes; /* for delayed nodes */ member
49 * Used to add the node into the prepare list, the nodes in this list
81 delayed_root->nodes = 0; in btrfs_init_delayed_root()
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_device.c581 knode = kfd->nodes[i]; in kfd_cleanup_nodes()
588 kfd->nodes[i] = NULL; in kfd_cleanup_nodes()
649 "KFD num nodes cannot be 0, num_xcc_in_node: %d\n", in kgd2kfd_device_init()
758 dev_info(kfd_device, "Total number of KFD nodes to be created: %d\n", in kgd2kfd_device_init()
761 /* Allocate the KFD nodes */ in kgd2kfd_device_init()
825 kfd->nodes[i] = node; in kgd2kfd_device_init()
860 /* Cleanup KFD nodes */ in kgd2kfd_device_exit()
881 node = kfd->nodes[i]; in kgd2kfd_pre_reset()
889 kfd_signal_reset_event(kfd->nodes[i]); in kgd2kfd_pre_reset()
910 ret = kfd_resume(kfd->nodes[ in kgd2kfd_post_reset()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dloop_dependence.cpp71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
91 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
93 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
99 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
103 return nodes; in GetAllTopLevelRecurrences()
109 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
111 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
117 nodes.insert(nodes in GetAllTopLevelConstants()
124 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dloop_dependence.cpp71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
91 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
93 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
99 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
103 return nodes; in GetAllTopLevelRecurrences()
109 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
111 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
117 nodes.insert(nodes in GetAllTopLevelConstants()
124 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dloop_dependence.cpp69 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
89 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
91 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
97 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
101 return nodes; in GetAllTopLevelRecurrences()
107 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
109 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
115 nodes.insert(nodes in GetAllTopLevelConstants()
122 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.c866 topology_info_input->nodes[i].node_id = topology->nodes[i].node_id; in psp_xgmi_get_topology_info()
867 topology_info_input->nodes[i].num_hops = topology->nodes[i].num_hops; in psp_xgmi_get_topology_info()
868 topology_info_input->nodes[i].is_sharing_enabled = topology->nodes[i].is_sharing_enabled; in psp_xgmi_get_topology_info()
869 topology_info_input->nodes[i].sdma_engine = topology->nodes[i].sdma_engine; in psp_xgmi_get_topology_info()
881 topology->nodes[i].node_id = topology_info_output->nodes[ in psp_xgmi_get_topology_info()
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A Dkernel_feat.py40 from docutils import nodes, statemachine namespace
117 node = nodes.section()
H A Dkernel_abi.py42 from docutils import nodes, statemachine namespace
97 node = nodes.section()
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-internal.h67 struct dm_block *nodes[2]; member
80 struct dm_block *nodes[2]; member
/kernel/linux/linux-5.10/include/linux/
H A Dinterconnect-provider.h31 * @num_nodes: number of nodes in this device
32 * @nodes: array of pointers to the nodes in this device
36 struct icc_node *nodes[]; member
47 * @nodes: internal list of the interconnect provider nodes
53 * @xlate: provider-specific callback for mapping nodes from phandle arguments
62 struct list_head nodes; member
82 * @num_links: number of links to other interconnect nodes
84 * @node_list: the list entry in the parent provider's "nodes" lis
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Ddelayed-inode.h28 * Used for delayed nodes which is waiting to be dealt with by the
35 int nodes; /* for delayed nodes */ member
50 * Used to add the node into the prepare list, the nodes in this list
106 delayed_root->nodes = 0; in btrfs_init_delayed_root()
/kernel/linux/linux-6.6/include/linux/
H A Dinterconnect-provider.h31 * @num_nodes: number of nodes in this device
32 * @nodes: array of pointers to the nodes in this device
36 struct icc_node *nodes[] __counted_by(num_nodes);
47 * @nodes: internal list of the interconnect provider nodes
53 * @xlate: provider-specific callback for mapping nodes from phandle arguments
62 struct list_head nodes; member
82 * @num_links: number of links to other interconnect nodes
84 * @node_list: the list entry in the parent provider's "nodes" lis
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-internal.h68 struct dm_block *nodes[2]; member
81 struct dm_block *nodes[2]; member

Completed in 18 milliseconds

1...<<11121314151617181920>>...37