/linux-master/drivers/md/persistent-data/ |
H A D | dm-btree.c | 550 * 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; 696 s->nodes[1] = right; 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; 805 s->nodes[1] = middle; 809 s->nodes[ [all...] |
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 in struct:dm_btree_cursor
|
/linux-master/fs/btrfs/ |
H A D | xattr.c | 52 leaf = path->nodes[0]; 145 btrfs_assert_tree_write_locked(path->nodes[0]); 173 struct extent_buffer *leaf = path->nodes[0]; 310 leaf = path->nodes[0];
|
H A D | delayed-inode.h | 36 * Used for delayed nodes which is waiting to be dealt with by the 43 int nodes; /* for delayed nodes */ member in struct:btrfs_delayed_root 58 * Used to add the node into the prepare list, the nodes in this list
|
H A D | verity.c | 149 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 257 leaf = path->nodes[0]; 335 leaf = path->nodes[0]; 392 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
|
H A D | defrag.c | 504 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later 514 if (!path->nodes[1]) { 525 path->nodes[1], 0, 541 path->slots[1] = btrfs_header_nritems(path->nodes[1]); 617 * will not visit leaves and nodes with a generation smaller than given 658 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) { 664 ASSERT(btrfs_header_nritems(path.nodes[0])); 665 path.slots[0] = btrfs_header_nritems(path.nodes[0]) - 1; 667 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); 675 btrfs_item_key_to_cpu(path.nodes[ [all...] |
H A D | raid-stripe-tree.c | 51 leaf = path->nodes[0]; 192 leaf = path->nodes[0];
|
H A D | locking.c | 28 * Lock-nesting across peer nodes is always done with the immediate parent 233 * btrfs_search_slot will keep the lock held on higher nodes in a few corner 246 if (!path->nodes[i]) 250 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]);
|
H A D | backref.c | 488 eb = path->nodes[level]; 505 eb = path->nodes[0]; 516 eb = path->nodes[0]; 605 * other tree nodes. This happens when qgroups does backref walks when 677 eb = path->nodes[level]; 684 eb = path->nodes[level]; 728 * New backrefs (i.e., for parent nodes) are added to the appropriate 1032 leaf = path->nodes[0]; 1168 leaf = path->nodes[0]; 1299 * If the node at this level is shared, than all nodes belo [all...] |
/linux-master/tools/testing/selftests/bpf/ |
H A D | verify_sig_setup.sh | 41 openssl req -new -nodes -utf8 -sha256 -days 36500 \
|
/linux-master/drivers/interconnect/qcom/ |
H A D | icc-rpm.h | 93 * struct qcom_icc_node - Qualcomm specific interconnect nodes 96 * @links: an array of nodes where we can go next while traversing 129 struct qcom_icc_node * const *nodes; member in struct:qcom_icc_desc
|
H A D | icc-rpm.c | 321 * qcom_icc_bus_aggregate - calculate bus clock rates by traversing all nodes 333 * Iterate nodes on the provider, aggregate bandwidth requests for 336 list_for_each_entry(node, &provider->nodes, node_list) { 469 qnodes = desc->nodes; 502 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), 598 data->nodes[i] = node;
|
/linux-master/drivers/hwmon/ |
H A D | applesmc.c | 109 struct applesmc_dev_attr *nodes; /* dynamic node array */ member in struct:applesmc_node_group 1124 for (grp = groups; grp->nodes; grp++) { 1125 for (node = grp->nodes; node->sda.dev_attr.attr.name; node++) 1128 kfree(grp->nodes); 1129 grp->nodes = NULL; 1144 grp->nodes = kcalloc(num + 1, sizeof(*node), GFP_KERNEL); 1145 if (!grp->nodes) { 1150 node = &grp->nodes[i];
|
/linux-master/drivers/clk/zynqmp/ |
H A D | pll.c | 308 * @nodes: Clock topology node 315 const struct clock_topology *nodes) 325 init.flags = zynqmp_clk_map_common_ccf_flags(nodes->flag); 312 zynqmp_clk_register_pll(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) argument
|
/linux-master/Documentation/sphinx/ |
H A D | cdomain.py | 35 from docutils import nodes namespace 185 param += nodes.emphasis(argname, argname) 194 """Transform a C signature into RST nodes."""
|
/linux-master/fs/unicode/ |
H A D | mkutf8data.c | 113 * 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; local 426 nodes = singletons = leaves = 0; 444 nodes += 1; 485 printf("nodes %d leaves %d singletons %d\n", 486 nodes, leaves, singletons); 638 * Prune internal nodes. 641 * been collapsed. There are still internal nodes tha 1198 int nodes[4]; local [all...] |
/linux-master/drivers/base/regmap/ |
H A D | regcache-rbtree.c | 140 int nodes = 0; local 159 nodes++; 163 if (nodes) 164 average = registers / nodes; 168 seq_printf(s, "%d nodes, %d registers, average %d registers, used %zu bytes\n", 169 nodes, registers, average, mem_size);
|
/linux-master/fs/ntfs3/ |
H A D | index.c | 661 struct indx_node *n = fnd->nodes[i]; 667 fnd->nodes[i] = NULL; 678 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes)) 680 fnd->nodes[i] = n; 692 n = fnd->nodes[i]; 693 fnd->nodes[i] = NULL; 1230 n = fnd->nodes[level - 1]; 1292 n = fnd->nodes[level - 1]; 1368 n = fnd->nodes[fnd->level - 1]; 1789 struct indx_node *n1 = fnd->nodes[leve [all...] |
/linux-master/fs/ubifs/ |
H A D | recovery.c | 447 * no_more_nodes - determine if there are no more nodes in a buffer. 497 if (!list_empty(&sleb->nodes)) { 500 snod = list_entry(sleb->nodes.prev, 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)) { 568 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, 586 * @offs: offset of dropped nodes is returned here 595 if (!list_empty(&sleb->nodes)) { [all...] |
/linux-master/drivers/md/ |
H A D | md-cluster.c | 469 * The bitmaps are not same for different nodes 475 * different nodes are match up well. 739 * 4. Upconverts ack lock resource from CR to EX. This forces the BAST on other nodes 740 * and the other nodes read the message. The thread will wait here until all other 741 * nodes have released ack lock resource. 867 static int join(struct mddev *mddev, int nodes) argument 895 if (nodes < cinfo->slot_number) { 897 cinfo->slot_number, nodes); 1144 * We need to ensure all the nodes can grow to a larger 1151 for (i = 0; i < mddev->bitmap_info.nodes; [all...] |
H A D | md-bitmap.h | 136 __le32 nodes; /* 68 the maximum number of nodes in cluster. */ member in struct:bitmap_super_s
|
/linux-master/drivers/vfio/ |
H A D | vfio_main.c | 986 /* Empty list or no nodes to combine */ 1013 struct interval_tree_node *nodes; local 1038 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), 1040 if (!nodes) 1060 nodes[i].start = range.iova; 1061 nodes[i].last = range.iova + range.length - 1; 1062 if (interval_tree_iter_first(&root, nodes[i].start, 1063 nodes[i].last)) { 1068 interval_tree_insert(nodes + i, &root); 1082 kfree(nodes); [all...] |
/linux-master/fs/jffs2/ |
H A D | erase.c | 214 /* Walk the inode's list once, removing any nodes from this eraseblock */ 221 prev = &ic->nodes; 249 jffs2_dbg(1, "Removed nodes in range 0x%08x-0x%08x from ino #%u\n", 257 this = ic->nodes; 282 if (ic->nodes == (void *)ic && ic->pino_nlink == 0)
|
/linux-master/kernel/power/ |
H A D | snapshot.c | 365 * two linked lists for the nodes of the tree, one for the inner nodes and 366 * one for the leave nodes. The linked leave nodes are used for fast linear 379 * struct rtree_node is a wrapper struct to link the nodes 394 struct list_head nodes; /* Radix Tree inner nodes */ member in struct:mem_zone_bm_rtree 438 * This function is used to allocate inner nodes as well as the 439 * leave nodes of the radix tree. It also adds the node to the 464 * The leave nodes nee 1230 unsigned int rtree, nodes; local [all...] |
/linux-master/net/qrtr/ |
H A D | ns.c | 19 static DEFINE_XARRAY(nodes); 76 node = xa_load(&nodes, node_id); 88 if (xa_store(&nodes, node_id, node, GFP_KERNEL)) { 547 xa_for_each(&nodes, node_idx, node) {
|