Home
last modified time | relevance | path

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

1...<<11121314151617181920>>...34

/kernel/linux/linux-5.10/fs/btrfs/
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-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
H A Ddm-btree.c550 * Redistributes entries between two btree nodes to make them
579 * Redistribute entries between three nodes. Assumes the central
625 * Splits a node by creating a sibling node and shifting half the nodes
693 s->nodes[1] = left; in split_one_into_two()
696 s->nodes[1] = right; in split_one_into_two()
734 * Splits two nodes into three. This is more work, but results in fuller
735 * nodes, so saves metadata space.
801 s->nodes[1] = left; in split_two_into_three()
805 s->nodes[1] = middle; in split_two_into_three()
809 s->nodes[ in split_two_into_three()
[all...]
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.h43 /* NGTCP2_KSL_MAX_NBLK is the maximum number of nodes which a single
46 /* NGTCP2_KSL_MIN_NBLK is the minimum number of nodes which a single
90 /* n is the number of nodes this object contains in nodes. */
92 /* leaf is nonzero if this block contains leaf nodes. */
96 /* nodes is a buffer to contain NGTCP2_KSL_MAX_NBLK
101 uint8_t nodes[1]; member
123 * ngtcp2_ksl_it is a forward iterator to iterate nodes.
228 * ngtcp2_ksl_update_key replaces the key of nodes which has |old_key|
264 ((ngtcp2_ksl_node *)(void *)((BLK)->nodes
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.h44 /* NGHTTP3_KSL_MAX_NBLK is the maximum number of nodes which a single
47 /* NGHTTP3_KSL_MIN_NBLK is the minimum number of nodes which a single
92 /* n is the number of nodes this object contains in nodes. */
94 /* leaf is nonzero if this block contains leaf nodes. */
98 /* nodes is a buffer to contain NGHTTP3_KSL_MAX_NBLK
103 uint8_t nodes[1]; member
125 * nghttp3_ksl_it is a forward iterator to iterate nodes.
230 * nghttp3_ksl_update_key replaces the key of nodes which has |old_key|
266 ((nghttp3_ksl_node *)(void *)((BLK)->nodes
[all...]
/third_party/mesa3d/src/tool/pps/
H A Dpps_device.cc78 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR); in create_all()
104 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR); in create()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaBuilder.java62 /** Adds a new path between the given source and target (all intermediate nodes are new). */
74 * Adds a new path between the given source and target nodes, along with an epsilon edge from the
83 checkArgument(graph.nodes().contains(s), "missing source node"); in addEpsilon()
84 checkArgument(graph.nodes().contains(s), "missing target node"); in addEpsilon()
/kernel/linux/linux-5.10/include/trace/events/
H A Dbcache.h298 TP_PROTO(unsigned nodes),
299 TP_ARGS(nodes),
302 __field(unsigned, nodes )
306 __entry->nodes = nodes;
309 TP_printk("coalesced %u nodes", __entry->nodes)
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DStringTrieBuilder.java95 // In either case we need to fix-up linear-match nodes (for their maximum length) in buildImpl()
96 // and branch nodes (turning dynamic branch nodes into trees of in buildImpl()
97 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for in buildImpl()
98 // nodes other than final values. in buildImpl()
113 // Then we call root.register() to turn it into a tree of nodes in buildImpl()
129 nodes.clear(); in clearImpl()
146 Node oldNode=nodes.get(newNode); in registerNode()
152 oldNode=nodes.put(newNode, newNode); in registerNode()
168 Node oldNode=nodes in registerFinalValue()
891 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); global() field in StringTrieBuilder
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DStringTrieBuilder.java94 // In either case we need to fix-up linear-match nodes (for their maximum length) in buildImpl()
95 // and branch nodes (turning dynamic branch nodes into trees of in buildImpl()
96 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for in buildImpl()
97 // nodes other than final values. in buildImpl()
112 // Then we call root.register() to turn it into a tree of nodes in buildImpl()
128 nodes.clear(); in clearImpl()
145 Node oldNode=nodes.get(newNode); in registerNode()
151 oldNode=nodes.put(newNode, newNode); in registerNode()
167 Node oldNode=nodes in registerFinalValue()
890 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); global() field in StringTrieBuilder
[all...]
/third_party/nghttp2/doc/_exts/rubydomain/
H A Drubydomain.py14 from docutils import nodes namespace
24 from sphinx.util.nodes import make_refnode
97 Transform a Ruby signature into RST nodes.
404 targetnode = nodes.target('', '', ids=['module-' + modname], ismod=True)
410 node = nodes.paragraph()
411 node += nodes.emphasis('', _('Platforms: '))
412 node += nodes.Text(platform, platform)
426 # http://www.sphinx-doc.org/en/stable/extdev/nodes.html#sphinx.addnodes.index
/kernel/linux/linux-6.6/tools/perf/util/
H A Dheader.c702 struct numa_topology_node *n = &tp->nodes[i]; in write_numa_topology()
957 struct hybrid_topology_node *n = &tp->nodes[i]; in write_hybrid_topology()
1411 struct memory_node *nodes = NULL; in build_mem_topology() local
1437 reallocarray(nodes, cnt + 4, sizeof(*nodes)); in build_mem_topology()
1440 pr_err("Failed to write MEM_TOPOLOGY, size %zd nodes\n", size); in build_mem_topology()
1444 nodes = new_nodes; in build_mem_topology()
1447 ret = memory_node__read(&nodes[cnt], idx); in build_mem_topology()
1455 *nodesp = nodes; in build_mem_topology()
1456 qsort(nodes, cn in build_mem_topology()
1481 struct memory_node *nodes = NULL; write_mem_topology() local
2247 struct memory_node *nodes; print_mem_topology() local
2711 struct numa_node *nodes, *n; process_numa_topology() local
2975 struct memory_node *nodes; process_mem_topology() local
3070 struct hybrid_node *nodes, *n; process_hybrid_topology() local
[all...]
/kernel/linux/linux-5.10/fs/unicode/
H A Dmkutf8data.c113 * Internal nodes are one byte for the node itself, and up to three
128 * Due to the way utf8 works, there cannot be branching nodes with
129 * NEXTBYTE set, and moreover those nodes always have a righthand
424 int nodes, singletons, leaves; in tree_walk() local
426 nodes = singletons = leaves = 0; in tree_walk()
444 nodes += 1; in tree_walk()
485 printf("nodes %d leaves %d singletons %d\n", in tree_walk()
486 nodes, leaves, singletons); in tree_walk()
638 * Prune internal nodes.
641 * been collapsed. There are still internal nodes tha
1198 int nodes[4]; emit() local
[all...]
/kernel/linux/linux-6.6/fs/unicode/
H A Dmkutf8data.c113 * Internal nodes are one byte for the node itself, and up to three
128 * Due to the way utf8 works, there cannot be branching nodes with
129 * NEXTBYTE set, and moreover those nodes always have a righthand
424 int nodes, singletons, leaves; in tree_walk() local
426 nodes = singletons = leaves = 0; in tree_walk()
444 nodes += 1; in tree_walk()
485 printf("nodes %d leaves %d singletons %d\n", in tree_walk()
486 nodes, leaves, singletons); in tree_walk()
638 * Prune internal nodes.
641 * been collapsed. There are still internal nodes tha
1198 int nodes[4]; emit() local
[all...]
/third_party/selinux/libsepol/src/
H A Dnode_internal.h5 #include <sepol/nodes.h>
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dptp.c32 struct mlx5e_ptp_port_ts_cqe_tracker *nodes; member
41 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata]; in mlx5e_ptp_port_ts_cqe_list_add()
53 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata]; in mlx5e_ptp_port_ts_cqe_list_remove()
191 if (likely(pending_cqe_list->nodes[metadata_id].inuse)) { in mlx5e_ptp_handle_ts_cqe()
389 cqe_list->nodes = kvzalloc_node(array_size(db_sz, sizeof(*cqe_list->nodes)), in mlx5e_ptp_alloc_traffic_db()
391 if (!cqe_list->nodes) in mlx5e_ptp_alloc_traffic_db()
404 cqe_list->nodes[md].metadata_id = md; in mlx5e_ptp_alloc_traffic_db()
421 kvfree(cqe_list->nodes); in mlx5e_ptp_alloc_traffic_db()
443 kvfree(ptpsq->ts_cqe_pending_list->nodes); in mlx5e_ptp_free_traffic_db()
[all...]
/kernel/linux/linux-6.6/fs/ntfs3/
H A Dindex.c661 struct indx_node *n = fnd->nodes[i]; in fnd_clear()
667 fnd->nodes[i] = NULL; in fnd_clear()
678 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes)) in fnd_push()
680 fnd->nodes[i] = n; in fnd_push()
692 n = fnd->nodes[i]; in fnd_pop()
693 fnd->nodes[i] = NULL; in fnd_pop()
1230 n = fnd->nodes[level - 1]; in indx_find_sort()
1292 n = fnd->nodes[level - 1]; in indx_find_sort()
1368 n = fnd->nodes[fnd->level - 1]; in indx_find_raw()
1789 struct indx_node *n1 = fnd->nodes[leve in indx_insert_into_buffer()
[all...]
/third_party/ltp/testcases/kernel/include/
H A Dnuma_helper.h34 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes);
/kernel/linux/linux-5.10/Documentation/sphinx/
H A Dkernel_abi.py44 from docutils import nodes, statemachine namespace
142 node = nodes.section()
/test/xts/acts/
H A Dget_dependency.py86 def get_all_dependencies(nodes, dependencies):
101 for node in nodes:
/third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_spread_test/
H A Dcpuset_memory_spread_testset.sh37 # In general, the cache hog will use more than 10000 kb slab space on the nodes
38 # on which it is running. The other nodes' slab space has littler change.(less
290 while read spread cpus nodes exp_nodes
292 base_test "$spread" "$cpus" "$nodes" "$exp_nodes"
301 # while read spread cpus nodes exp_nodes
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/
H A Ddifferential_fuzz_mutator.js136 printVariables(path, nodes) {
138 for (const node of nodes) {
176 // original source files. We detect the dummy no-op nodes that were

Completed in 22 milliseconds

1...<<11121314151617181920>>...34