Home
last modified time | relevance | path

Searched refs:back (Results 1 – 25 of 26) sorted by relevance

12

/fs/bcachefs/
A Dfifo.h9 size_t front, back, size, mask; \
22 (fifo)->front = (fifo)->back = 0; \
39 swap((l)->back, (r)->back); \
53 #define fifo_used(fifo) (((fifo)->back - (fifo)->front))
56 #define fifo_empty(fifo) ((fifo)->front == (fifo)->back)
60 #define fifo_peek_back(fifo) ((fifo)->data[((fifo)->back - 1) & (fifo)->mask])
64 ? (fifo)->front : (fifo)->back) & ~(fifo)->mask) + \
71 (fifo_full((f)) ? NULL : &(f)->data[(f)->back++ & (f)->mask])
104 (i) = (fifo)->data[--(fifo)->back & (fifo)->mask]; \
116 ((_iter != (_fifo)->back) && \
[all …]
A Djournal_reclaim.h30 EBUG_ON(seq < j->pin.front || seq >= j->pin.back); in journal_seq_pin()
A Djournal_types.h253 u64 front, back, size, mask; member
A Djournal_reclaim.c968 if (seq >= j->pin.back) in bch2_journal_flush_device_pins()
1001 if (*seq >= j->pin.back) { in bch2_journal_seq_pins_to_text()
A Djournal.c470 BUG_ON(j->pin.back - 1 != atomic64_read(&j->seq)); in journal_entry_open()
1526 j->pin.back = cur_seq; in bch2_fs_journal_start()
/fs/erofs/
A Dnamei.c50 int head, back; in find_target_dirent() local
56 back = ndirents - 1; in find_target_dirent()
59 while (head <= back) { in find_target_dirent()
60 const int mid = head + (back - head) / 2; in find_target_dirent()
81 back = mid - 1; in find_target_dirent()
93 int head = 0, back = erofs_iblks(dir) - 1; in erofs_find_target_block() local
97 while (head <= back) { in erofs_find_target_block()
98 const int mid = head + (back - head) / 2; in erofs_find_target_block()
135 back = mid - 1; in erofs_find_target_block()
/fs/xfs/libxfs/
A Dxfs_da_btree.c150 to->back = be32_to_cpu(from3->hdr.info.hdr.back); in xfs_da3_node_hdr_from_disk()
158 to->back = be32_to_cpu(from->hdr.info.back); in xfs_da3_node_hdr_from_disk()
178 to3->hdr.info.hdr.back = cpu_to_be32(from->back); in xfs_da3_node_hdr_to_disk()
185 to->hdr.info.back = cpu_to_be32(from->back); in xfs_da3_node_hdr_to_disk()
698 if (node->hdr.info.back) { in xfs_da3_split()
1226 ASSERT(!blkinfo->back); in xfs_da_blkinfo_onlychild_validate()
1384 blkno = nodehdr.back; in xfs_da3_node_toosmall()
1942 new_info->back = old_info->back; in xfs_da3_blk_link()
1943 if (old_info->back) { in xfs_da3_blk_link()
2037 save_info->back = drop_info->back; in xfs_da3_blk_unlink()
[all …]
A Dxfs_dir2_leaf.c45 to->back = be32_to_cpu(from3->hdr.info.hdr.back); in xfs_dir2_leaf_hdr_from_disk()
55 to->back = be32_to_cpu(from->hdr.info.back); in xfs_dir2_leaf_hdr_from_disk()
79 to3->hdr.info.hdr.back = cpu_to_be32(from->back); in xfs_dir2_leaf_hdr_to_disk()
88 to->hdr.info.back = cpu_to_be32(from->back); in xfs_dir2_leaf_hdr_to_disk()
A Dxfs_attr_leaf.c167 to->back = be32_to_cpu(hdr3->info.hdr.back); in xfs_attr3_leaf_hdr_from_disk()
181 to->back = be32_to_cpu(from->hdr.info.back); in xfs_attr3_leaf_hdr_from_disk()
209 hdr3->info.hdr.back = cpu_to_be32(from->back); in xfs_attr3_leaf_hdr_to_disk()
224 to->hdr.info.back = cpu_to_be32(from->back); in xfs_attr3_leaf_hdr_to_disk()
2067 forward = ichdr.forw < ichdr.back; in xfs_attr3_leaf_toosmall()
2073 blkno = ichdr.back; in xfs_attr3_leaf_toosmall()
2347 tmphdr.back = savehdr.back; in xfs_attr3_leaf_unbalance()
A Dxfs_attr_leaf.h23 uint32_t back; member
A Dxfs_da_btree.h150 uint32_t back; member
A Dxfs_dir2_priv.h17 uint32_t back; member
A Dxfs_da_format.h23 __be32 back; /* following block in list */ member
/fs/f2fs/
A Dextent_cache.c149 static bool __is_extent_mergeable(struct extent_info *back, in __is_extent_mergeable() argument
154 if (back->c_len && back->len != back->c_len) in __is_extent_mergeable()
159 return (back->fofs + back->len == front->fofs && in __is_extent_mergeable()
160 back->blk + back->len == front->blk); in __is_extent_mergeable()
162 return (back->fofs + back->len == front->fofs && in __is_extent_mergeable()
163 abs(back->age - front->age) <= SAME_AGE_REGION && in __is_extent_mergeable()
164 abs(back->last_blocks - front->last_blocks) <= in __is_extent_mergeable()
171 struct extent_info *back, enum extent_type type) in __is_back_mergeable() argument
173 return __is_extent_mergeable(back, cur, type); in __is_back_mergeable()
A DKconfig100 multiple back-end compression algorithms are supported.
A Df2fs.h928 static inline bool __is_discard_mergeable(struct discard_info *back, in __is_discard_mergeable() argument
931 return (back->lstart + back->len == front->lstart) && in __is_discard_mergeable()
932 (back->len + front->len <= max_len); in __is_discard_mergeable()
936 struct discard_info *back, unsigned int max_len) in __is_discard_back_mergeable() argument
938 return __is_discard_mergeable(back, cur, max_len); in __is_discard_back_mergeable()
/fs/xfs/scrub/
A Ddabtree.c299 xfs_dablk_t back; in xchk_da_btree_block_check_siblings() local
303 back = be32_to_cpu(hdr->back); in xchk_da_btree_block_check_siblings()
307 if (forw != 0 || back != 0) in xchk_da_btree_block_check_siblings()
316 error = xchk_da_btree_block_check_sibling(ds, level, 0, back); in xchk_da_btree_block_check_siblings()
/fs/jfs/
A Djfs_imap.c852 int back, fwd; in diFree() local
1027 fwd = back = -1; in diFree()
1063 if ((rc = diIAGRead(imap, back, &bmp))) in diFree()
1089 else if (inofreefwd == back) in diFree()
1103 else if (inofreeback == back) in diFree()
1145 if (back >= 0) in diFree()
2157 int agno, iagno, fwd, back, freei = 0, sword, rc; in diNewExt() local
2203 if ((rc = diIAGRead(imap, back, &bmp))) in diNewExt()
2214 fwd = back = -1; in diNewExt()
2237 } else if (freei == back) { in diNewExt()
[all …]
/fs/ufs/
A Dballoc.c850 int i, start, end, forw, back; in ufs_clusteracct() local
883 back = start - i; in ufs_clusteracct()
889 i = back + forw + 1; in ufs_clusteracct()
893 if (back > 0) in ufs_clusteracct()
894 fs32_sub(sb, (__fs32*)ubh_get_addr(UCPI_UBH(ucpi), ucpi->c_clustersumoff + (back << 2)), cnt); in ufs_clusteracct()
A DKconfig37 experimental, so you should back up your UFS partitions beforehand.
/fs/coda/
A DKconfig12 persistent client caches and write back caching.
/fs/nilfs2/
A DKconfig19 periods until they are changed back to checkpoints. Each
/fs/verity/
A DKconfig26 data each time it is paged back in, which provides better
/fs/pstore/
A DKconfig77 buffer in RAM where it can be read back at some later point.
99 where it can be read back at some later point.
/fs/jffs2/
A DKconfig50 This causes JFFS2 to read back every page written through the

Completed in 78 milliseconds

12