Searched refs:gap (Results 1 – 10 of 10) sorted by relevance
| /fs/bcachefs/ |
| A D | btree_journal_iter.c | 23 BUG_ON(pos >= keys->gap && pos < keys->gap + gap_size); in pos_to_idx()
25 if (pos >= keys->gap) in pos_to_idx()
34 if (idx >= keys->gap) in idx_to_pos()
210 BUG_ON(iter->idx >= keys->gap && in journal_iter_verify()
241 iter->idx = keys->gap - 1; in journal_iters_fix()
287 if (idx > keys->gap) in bch2_journal_key_insert_take()
290 size_t old_gap = keys->gap; in bch2_journal_key_insert_take()
316 keys->gap = keys->nr; in bch2_journal_key_insert_take()
324 keys->data[keys->gap++] = n; in bch2_journal_key_insert_take()
778 keys->gap = keys->nr; in bch2_journal_keys_sort()
[all …]
|
| A D | btree_journal_iter_types.h | 31 size_t gap; member
|
| A D | util.h | 605 BUG_ON((_d)->gap > (_d)->nr); \
608 (_d)->nr, (_d)->size, (_d)->gap, _new_gap); \
609 (_d)->gap = _new_gap; \
|
| A D | btree_io.c | 1621 bool gap = false; in CLOSURE_CALLBACK() local
1648 if (!gap) in CLOSURE_CALLBACK()
1650 gap = true; in CLOSURE_CALLBACK()
|
| A D | disk_accounting.c | 845 keys->gap = keys->nr = dst - keys->data; in bch2_accounting_read()
|
| /fs/proc/ |
| A D | stat.c | 57 static void show_irq_gap(struct seq_file *p, unsigned int gap) in show_irq_gap() argument
61 while (gap > 0) { in show_irq_gap()
64 inc = min_t(unsigned int, gap, ARRAY_SIZE(zeros) / 2); in show_irq_gap()
66 gap -= inc; in show_irq_gap()
|
| /fs/ubifs/ |
| A D | orphan.c | 218 int avail_lebs, avail, gap; in avail_orphs() local
223 gap = c->leb_size - c->ohead_offs; in avail_orphs()
224 if (gap >= UBIFS_ORPH_NODE_SZ + sizeof(__le64)) in avail_orphs()
225 avail += (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64); in avail_orphs()
291 int gap, err, len, cnt, i; in write_orph_node() local
294 gap = c->leb_size - c->ohead_offs; in write_orph_node()
295 if (gap < UBIFS_ORPH_NODE_SZ + sizeof(__le64)) { in write_orph_node()
298 gap = c->leb_size; in write_orph_node()
308 cnt = (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64); in write_orph_node()
|
| /fs/netfs/ |
| A D | buffered_write.c | 61 size_t gap; in netfs_update_i_size() local
80 gap = SECTOR_SIZE - (i_size & (SECTOR_SIZE - 1)); in netfs_update_i_size()
81 if (copied > gap) { in netfs_update_i_size()
82 add = DIV_ROUND_UP(copied - gap, SECTOR_SIZE); in netfs_update_i_size()
|
| /fs/ntfs3/ |
| A D | run.c | 196 CLST gap; in run_lookup_entry() local
211 gap = vcn - r->vcn; in run_lookup_entry()
212 if (r->len <= gap) in run_lookup_entry()
215 *lcn = r->lcn == SPARSE_LCN ? SPARSE_LCN : (r->lcn + gap); in run_lookup_entry()
218 *len = r->len - gap; in run_lookup_entry()
|
| /fs/nfs/ |
| A D | inode.c | 1997 if (end == nfsi->ooo->gap[i].start) in nfs_ooo_merge()
1998 end = nfsi->ooo->gap[i].end; in nfs_ooo_merge()
1999 else if (start == nfsi->ooo->gap[i].end) in nfs_ooo_merge()
2000 start = nfsi->ooo->gap[i].start; in nfs_ooo_merge()
2005 nfsi->ooo->gap[i] = nfsi->ooo->gap[cnt]; in nfs_ooo_merge()
2009 if (cnt >= ARRAY_SIZE(nfsi->ooo->gap)) { in nfs_ooo_merge()
2015 nfsi->ooo->gap[cnt].start = start; in nfs_ooo_merge()
2016 nfsi->ooo->gap[cnt].end = end; in nfs_ooo_merge()
2302 nfsi->ooo->gap[0].end == inode_peek_iversion_raw(inode)) { in nfs_update_inode()
2306 inode_set_iversion_raw(inode, nfsi->ooo->gap[0].start); in nfs_update_inode()
|
Completed in 37 milliseconds