/linux-master/fs/btrfs/ |
H A D | file.c | 193 * it is either truncated or split. Anything entirely inside the range 598 * part of extent is marked as written, the extent will be split into 617 u64 split; local 629 split = start; 632 key.offset = split; 725 split = end; 727 new_key.offset = split; 743 split - key.offset); 749 btrfs_set_file_extent_offset(leaf, fi, split - orig_offset); 751 extent_end - split); [all...] |
H A D | inode.c | 1387 * not be split into smaller extents, otherwise relocation breaks and 2326 struct extent_state *orig, u64 split) 2346 new_size = orig->end - split + 1; 2348 new_size = split - orig->start; 2616 /* No need to split if the ordered extent covers the entire bio. */ 2624 * Don't split the extent_map for NOCOW extents, as we're writing into 7844 * Check if we are doing a partial write. If we are, we need to split 2325 btrfs_split_delalloc_extent(struct btrfs_inode *inode, struct extent_state *orig, u64 split) argument
|
/linux-master/fs/ceph/ |
H A D | snap.c | 1023 u64 split; local 1044 split = le64_to_cpu(h->split); /* non-zero if we are splitting an 1051 doutc(cl, "from mds%d op %s split %llx tracelen %d\n", mds, 1052 ceph_snap_op_name(op), split, trace_len); 1061 * A "split" breaks part of an existing realm off into 1076 realm = ceph_lookup_snap_realm(mdsc, split); 1078 realm = ceph_create_snap_realm(mdsc, split); 1102 * a race (due to another split notifications 1113 doutc(cl, " will move %p %llx.%llx to split real [all...] |
/linux-master/fs/erofs/ |
H A D | zdata.c | 962 unsigned int cur, end, len, split; local 966 split = 0; 980 /* bump split parts first to avoid several separate cases */ 981 ++split; 1015 exclusive = (!cur && ((split <= 1) || (tight && bs == fs)));
|
/linux-master/fs/ext4/ |
H A D | extents.c | 41 #define EXT4_EXT_MAY_ZEROOUT 0x1 /* safe to zeroout if split fails \ 90 ext4_lblk_t split, 821 * we get such a leaf in split/add case 1047 * - makes decision where to split 1048 * - moves remaining extents and index entries (right to the split point) 1072 /* make decision: where to split? */ 1075 /* if current leaf will be split, then we should use 1076 * border from split point */ 1083 ext_debug(inode, "leaf will be split." 1450 * in all other cases we have to split th 3152 ext4_split_extent_at(handle_t *handle, struct inode *inode, struct ext4_ext_path **ppath, ext4_lblk_t split, int split_flag, int flags) argument 5637 int split = 0; local [all...] |
H A D | namei.c | 1985 unsigned split, move, size; local 2023 /* Ensure that neither split block is over half full */ 2034 * map index at which we will split 2037 * split it in half by count; each resulting block will have at least 2041 split = count - move; 2043 split = count/2; 2045 hash2 = map[split].hash; 2046 continued = hash2 == map[split - 1].hash; 2049 hash2, split, count-split)); [all...] |
/linux-master/fs/jfs/ |
H A D | jfs_dtree.c | 32 * it is extended rather than split (its size is doubled), 33 * until its length becoms 4 KBytes, from then the extent is split 63 * (e.g., if split occurs <abc> and <aBd>, <ABD> trather than <aB> 64 * should be made the router key for the split) 101 /* dtree split parameter */ 140 struct dtsplit * split, struct btstack * btstack); 142 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split, 146 struct dtsplit * split, struct btstack * btstack); 149 struct dtsplit * split, struct metapage ** rmpp); 602 /* init level count for max pages to split */ 822 struct dtsplit split; /* split information */ local 923 dtSplitUp(tid_t tid, struct inode *ip, struct dtsplit * split, struct btstack * btstack) argument 1323 dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split, struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rpxdp) argument 1635 dtExtendPage(tid_t tid, struct inode *ip, struct dtsplit * split, struct btstack * btstack) argument 1868 dtSplitRoot(tid_t tid, struct inode *ip, struct dtsplit * split, struct metapage ** rmpp) argument [all...] |
H A D | jfs_xtree.c | 96 uint split; member in struct:__anon1486 109 struct xtsplit * split, struct btstack * btstack); 111 static int xtSplitPage(tid_t tid, struct inode *ip, struct xtsplit * split, 115 struct xtsplit * split, struct metapage ** rmpp); 227 int nsplit = 0; /* number of pages to split */ 324 /* compute number of pages to split */ 371 /* compute number of pages to split */ 429 /* compute number of pages to split */ 471 /* update number of pages to split */ 524 struct xtsplit split; /* spli local 664 xtSplitUp(tid_t tid, struct inode *ip, struct xtsplit * split, struct btstack * btstack) argument 934 xtSplitPage(tid_t tid, struct inode *ip, struct xtsplit * split, struct metapage ** rmpp, s64 * rbnp) argument 1201 xtSplitRoot(tid_t tid, struct inode *ip, struct xtsplit * split, struct metapage ** rmpp) argument 1348 struct xtsplit split; /* split information */ local 1507 struct xtsplit split; /* split information */ local 1953 struct xtsplit split; /* split information */ local [all...] |
/linux-master/fs/nfs/blocklayout/ |
H A D | extent_tree.c | 297 struct pnfs_block_extent *split; local 301 split = kmemdup(new, sizeof(*new), GFP_ATOMIC); 302 if (!split) { 307 split->be_length = be->be_f_offset - split->be_f_offset; 308 split->be_device = nfs4_get_deviceid(new->be_device); 309 __ext_tree_insert(root, split, true); 381 sector_t split) 390 be->be_length = split - be->be_f_offset; 392 new->be_f_offset = split; 380 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, sector_t split) argument [all...] |
/linux-master/fs/ocfs2/ |
H A D | alloc.c | 2369 enum ocfs2_split_type split, 2446 if (split == SPLIT_NONE && 2489 if (split != SPLIT_NONE && 2495 * slot. If we're doing an extent split 2497 * check that the extent to be split wasn't 3831 enum ocfs2_split_type split, 3840 if (split == SPLIT_LEFT) { 4080 enum ocfs2_split_type split) 4110 if (split == SPLIT_LEFT) { 4112 * It's a left split 2367 ocfs2_rotate_tree_right(handle_t *handle, struct ocfs2_extent_tree *et, enum ocfs2_split_type split, u32 insert_cpos, struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) argument 3830 ocfs2_subtract_from_rec(struct super_block *sb, enum ocfs2_split_type split, struct ocfs2_extent_rec *rec, struct ocfs2_extent_rec *split_rec) argument 4076 ocfs2_split_record(struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, struct ocfs2_extent_rec *split_rec, enum ocfs2_split_type split) argument [all...] |
H A D | refcounttree.c | 1469 * find the split cpos easily. 1850 * If we just need to split the header or tail clusters, 1851 * no more recs are needed, just split is OK. 1864 * We need one more rec if we split in the middle and the new rec have 1929 * If we have "len", the we will split in the tail and move it 1942 * If the split pos isn't the same as the original one, we need to 1943 * split in the head. 2012 * 3. If we are in the middle of one extent record, split 2190 struct ocfs2_refcount_rec split = *rec; local 2191 split [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_btree.c | 2865 XFS_BTREE_STATS_INC(cur, split); 3075 * BMBT split requests often come in with little stack to work on so we push 3290 * and the new block generated when it was split. We don't know which 3651 * A multi-level split of the tree on insert will invalidate the original 3663 union xfs_btree_ptr nptr; /* new block number (split result) */ 3664 struct xfs_btree_cur *ncur; /* new cursor (split result) */ 3683 * Stop when we don't get a split block, that must mean that 4885 * blocks in the space, and there's no more free space to split the tree any
|
/linux-master/fs/xfs/ |
H A D | xfs_log.c | 1938 * to split it up into two bios, so that we can continue at the start. 1941 struct bio *split; local 1943 split = bio_split(&iclog->ic_bio, log->l_logBBsize - bno, 1945 bio_chain(split, &iclog->ic_bio); 1946 submit_bio(split); 2069 /* Do we need to split this write into 2 parts? */ 2854 * split log writes, on the second, we shut down the file system and 3425 * and then there are LR hdrs, split-recs and roundoff at end of syncs. 3457 * Furthermore - the addition of op headers for split-recs might 3472 /* for split [all...] |
/linux-master/include/linux/ceph/ |
H A D | ceph_fs.h | 560 /* one for each node split */ 888 __le64 split; /* ino to split off, if any */ member in struct:ceph_mds_snap_head 893 /* followed by split ino list, then split realms, then the trace blob */
|
/linux-master/include/linux/ |
H A D | vdpa.h | 40 * struct vdpa_vq_state_split - vDPA split virtqueue state 63 struct vdpa_vq_state_split split; member in union:vdpa_vq_state::__anon158 156 * @data for split virtqueue:
|
/linux-master/include/net/ |
H A D | devlink.h | 28 u32 port_number; /* Same value as "split group". 32 u32 split_subport_number; /* If the port is split, this is the number of subport. */ 78 * @split: indicates if this is split port 79 * @splittable: indicates if the port can be split. 88 u8 split:1, member in struct:devlink_port_attrs 1552 * @port_split: Callback used to split the port into multiple ones.
|
/linux-master/include/soc/fsl/qe/ |
H A D | qe.h | 271 u8 split; /* 0 = shared I-RAM, 1 = split I-RAM */ member in struct:qe_firmware
|
/linux-master/include/uapi/linux/ |
H A D | vduse.h | 138 * struct vduse_vq_state_split - split virtqueue state 166 * @split: split virtqueue state 179 struct vduse_vq_state_split split; member in union:vduse_vq_info::__anon46 278 * @split: split virtqueue state 284 struct vduse_vq_state_split split; member in union:vduse_vq_state::__anon47
|
/linux-master/kernel/sched/ |
H A D | core.c | 5074 __splice_balance_callbacks(struct rq *rq, bool split) argument 5090 if (split && head == &balance_push_callback)
|
/linux-master/kernel/trace/ |
H A D | trace_events_user.c | 2040 char **split; local 2057 /* We do a normal split afterwards */ 2058 split = argv_split(GFP_KERNEL, fixed, argc); 2063 return split;
|
/linux-master/lib/ |
H A D | build_OID_registry | 56 my @components = split(/[.]/, $oid); 96 my @components = split(/[.]/, $oids[$i]);
|
H A D | dynamic_debug.c | 325 pr_info("split into words:"); 572 char *split; local 575 for (i = 0; query; query = split) { 576 split = strpbrk(query, ";\n"); 577 if (split) 578 *split++ = '\0';
|
H A D | maple_tree.c | 1800 * @split: the potential split location 1805 static inline bool mab_middle_node(struct maple_big_node *b_node, int split, argument 1813 if (!b_node->slot[split] && (size >= 2 * slot_count - 1)) 1820 * mab_no_null_split() - ensure the split doesn't fall on a NULL 1822 * @split: the suggested split location 1825 * Return: the split location. 1828 unsigned char split, unsigned char slot_count) 1830 if (!b_node->slot[split]) { 1827 mab_no_null_split(struct maple_big_node *b_node, unsigned char split, unsigned char slot_count) argument 1856 int split = b_end / 2; /* Assume equal split. */ local 2371 unsigned char split = 0; local 2423 mas_set_split_parent(struct ma_state *mas, struct maple_enode *left, struct maple_enode *right, unsigned char *slot, unsigned char split) argument 2448 mte_mid_split_check(struct maple_enode **l, struct maple_enode **r, struct maple_enode *right, unsigned char slot, unsigned char *split, unsigned char mid_split) argument 2474 mast_set_split_parents(struct maple_subtree_state *mast, struct maple_enode *left, struct maple_enode *middle, struct maple_enode *right, unsigned char split, unsigned char mid_split) argument 2663 mast_cp_to_nodes(struct maple_subtree_state *mast, struct maple_enode *left, struct maple_enode *middle, struct maple_enode *right, unsigned char split, unsigned char mid_split) argument 2832 unsigned char split, mid_split; local 3020 unsigned char offset, tmp, split = mt_slots[mt] / 2; local 3173 unsigned char split; local 3212 mast_split_data(struct maple_subtree_state *mast, struct ma_state *mas, unsigned char split) argument 3249 unsigned char end, space, split; local 3317 unsigned char mid_split, split = 0; local [all...] |
H A D | sg_split.c | 81 struct sg_splitter *split; local 83 for (i = 0, split = splitters; i < nb_splits; i++, split++) { 84 in_sg = split->in_sg0; 85 out_sg = split->out_sg; 86 for (j = 0; j < split->nents; j++, out_sg++) { 89 out_sg->offset += split->skip_sg0; 90 out_sg->length -= split->skip_sg0; 98 out_sg[-1].length = split->length_last_sg; 107 struct sg_splitter *split; local [all...] |
/linux-master/lib/zstd/compress/ |
H A D | zstd_compress_internal.h | 245 BYTE const* split; member in struct:__anon199
|