Home
last modified time | relevance | path

Searched refs:nodes (Results 526 - 550 of 924) sorted by relevance

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

/kernel/linux/linux-6.6/fs/ubifs/
H A Drecovery.c447 * no_more_nodes - determine if there are no more nodes in a buffer.
497 if (!list_empty(&sleb->nodes)) { in fix_unclean_leb()
500 snod = list_entry(sleb->nodes.prev, in fix_unclean_leb()
555 * drop_last_group - drop the last group of nodes.
557 * @offs: offset of dropped nodes is returned here
560 * group of nodes of the scanned LEB.
564 while (!list_empty(&sleb->nodes)) { in drop_last_group()
568 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_group()
586 * @offs: offset of dropped nodes is returned here
595 if (!list_empty(&sleb->nodes)) { in drop_last_node()
[all...]
/kernel/linux/linux-5.10/fs/hpfs/
H A Danode.c406 int i, j, nodes; in hpfs_truncate_btree() local
428 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
438 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
453 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
472 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
/kernel/linux/linux-5.10/fs/dlm/
H A Dconfig.c26 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/nodeid
27 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/weight
456 config_group_init_type_name(&nds->ns_group, "nodes", &nodes_type); in make_space()
839 struct dlm_config_node *nodes, *node; in dlm_config_nodes() local
855 nodes = kcalloc(count, sizeof(struct dlm_config_node), GFP_NOFS); in dlm_config_nodes()
856 if (!nodes) { in dlm_config_nodes()
861 node = nodes; in dlm_config_nodes()
873 *nodes_out = nodes; in dlm_config_nodes()
/kernel/linux/linux-6.6/fs/hpfs/
H A Danode.c406 int i, j, nodes; in hpfs_truncate_btree() local
428 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
438 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
453 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
472 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
/kernel/linux/linux-6.6/fs/dlm/
H A Dconfig.c27 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/nodeid
28 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/weight
477 config_group_init_type_name(&nds->ns_group, "nodes", &nodes_type); in make_space()
869 struct dlm_config_node *nodes, *node; in dlm_config_nodes() local
885 nodes = kcalloc(count, sizeof(struct dlm_config_node), GFP_NOFS); in dlm_config_nodes()
886 if (!nodes) { in dlm_config_nodes()
891 node = nodes; in dlm_config_nodes()
903 *nodes_out = nodes; in dlm_config_nodes()
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_priv.h361 struct kfd_node *nodes[MAX_KFD_NODES]; member
1132 return dev->nodes[0]; in kfd_node_by_irq_ids()
1135 if (kfd_irq_is_from_node(dev->nodes[i], node_id, vmid)) in kfd_node_by_irq_ids()
1136 return dev->nodes[i]; in kfd_node_by_irq_ids()
1505 return (node == node->kfd->nodes[0]); in kfd_is_first_node()
/third_party/ffmpeg/libavcodec/
H A Dvp6.c256 /* nodes must ascend by count, but with descending symbol order */
266 Node nodes[2*VP6_MAX_HUFF_SIZE], *tmp = &nodes[size]; in vp6_build_huff_tree() local
274 nodes[map[2*i ]].count = a + !a; in vp6_build_huff_tree()
275 nodes[map[2*i+1]].count = b + !b; in vp6_build_huff_tree()
281 nodes, vp6_huff_cmp, in vp6_build_huff_tree()
/third_party/node/deps/v8/third_party/jinja2/
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/node/tools/inspector_protocol/jinja2/
H A Denvironment.py15 from jinja2 import nodes namespace
24 from jinja2.nodes import EvalContext
482 tree of nodes is used by the compiler to convert the template into
634 body = [nodes.Assign(nodes.Name('result', 'store'), expr, lineno=1)]
635 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/ninja/src/
H A Dmanifest_parser_test.cc1053 EXPECT_EQ("could not determine root nodes of build graph", err); in TEST_F()
1068 vector<Node*> nodes = state.DefaultNodes(&err); in TEST_F() local
1070 ASSERT_EQ(3u, nodes.size()); in TEST_F()
1071 EXPECT_EQ("a", nodes[0]->path()); in TEST_F()
1072 EXPECT_EQ("b", nodes[1]->path()); in TEST_F()
1073 EXPECT_EQ("c", nodes[2]->path()); in TEST_F()
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-regalloc.cc42 // Conditional control nodes don't cause holes themselves. So, the nearest in NearestPostDominatingHole()
90 // Compute, for all forward control nodes (i.e. excluding Return and JumpLoop) a
113 // tree, up to nodes which are holes (in this example, A, D, F and H).
302 node_it_ = block->nodes().begin(); in AllocateRegisters()
303 for (; node_it_ != block->nodes().end(); ++node_it_) { in AllocateRegisters()
573 (*block_it_)->nodes().Add(gap_move); in AddMoveBeforeCurrentNode()
574 node_it_ = (*block_it_)->nodes().end(); in AddMoveBeforeCurrentNode()
576 DCHECK_NE(node_it_, (*block_it_)->nodes().end()); in AddMoveBeforeCurrentNode()
/third_party/skia/third_party/externals/jinja2/
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_mask_util.cc265 // by all leaf nodes descended from "node" to mask.
269 // Merge all leaf nodes of a sub-tree to another tree.
364 std::vector<Node*> nodes(parts.size()); in RemovePath()
369 nodes[i] = node; in RemovePath()
377 // If add any new nodes, cleanup. in RemovePath()
403 delete nodes[i]->children[parts[i]]; in RemovePath()
404 nodes[i]->children.erase(parts[i]); in RemovePath()
405 if (!nodes[i]->children.empty()) { in RemovePath()
432 // Now we found a matching node with the given path. Add all leaf nodes in IntersectPath()
/foundation/arkui/ace_engine/frameworks/core/components_ng/base/
H A Dinspector.h53 static void GetOffScreenTreeNodes(InspectorTreeMap& nodes);
/foundation/window/window_manager/wmserver/include/
H A Ddisplay_zoom_controller.h36 void ClearZoomTransform(std::vector<sptr<WindowNode>> nodes);
/kernel/linux/linux-5.10/include/uapi/linux/
H A Dscif_ioctl.h188 * @nodes: pointer to an array of node_ids
193 __u64 nodes; member
/kernel/linux/linux-5.10/fs/btrfs/
H A Dulist.h41 struct list_head nodes; member
/kernel/linux/linux-6.6/fs/btrfs/
H A Dulist.h41 struct list_head nodes; member
/kernel/linux/linux-6.6/include/uapi/linux/
H A Dscif_ioctl.h188 * @nodes: pointer to an array of node_ids
193 __u64 nodes; member
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dicc-rpm.h89 * struct qcom_icc_node - Qualcomm specific interconnect nodes
92 * @links: an array of nodes where we can go next while traversing
117 struct qcom_icc_node * const *nodes; member
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/
H A Dverify_sig_setup.sh41 openssl req -new -nodes -utf8 -sha256 -days 36500 \
/kernel/linux/patches/linux-4.19/prebuilts/usr/include/linux/
H A Dscif_ioctl.h59 __u64 nodes; member
/kernel/linux/patches/linux-5.10/prebuilts/usr/include/linux/
H A Dscif_ioctl.h72 __u64 nodes; member
/kernel/linux/patches/linux-6.6/prebuilts/usr/include/linux/
H A Dscif_ioctl.h72 __u64 nodes; member
/third_party/jinja2/
H A Dvisitor.py1 """API for traversing the AST nodes. Implemented by the compiler and
6 from .nodes import Node
21 Per default the visitor functions for the nodes are ``'visit_'`` +
51 """Walks the abstract syntax tree and allows modifications of nodes.

Completed in 22 milliseconds

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