Home
last modified time | relevance | path

Searched refs:lp (Results 1 – 21 of 21) sorted by relevance

/fs/ubifs/
Dfind.c225 const struct ubifs_lprops *lp = NULL, *idx_lp = NULL; in ubifs_find_dirty_leb() local
252 lp = ubifs_fast_find_empty(c); in ubifs_find_dirty_leb()
253 if (lp) in ubifs_find_dirty_leb()
257 lp = ubifs_fast_find_freeable(c); in ubifs_find_dirty_leb()
258 if (lp) in ubifs_find_dirty_leb()
293 lp = heap->arr[0]; in ubifs_find_dirty_leb()
294 if (lp->dirty + lp->free < min_space) in ubifs_find_dirty_leb()
295 lp = NULL; in ubifs_find_dirty_leb()
299 if (idx_lp && lp) { in ubifs_find_dirty_leb()
300 if (idx_lp->free + idx_lp->dirty >= lp->free + lp->dirty) in ubifs_find_dirty_leb()
[all …]
Dgc.c491 int ubifs_garbage_collect_leb(struct ubifs_info *c, struct ubifs_lprops *lp) in ubifs_garbage_collect_leb() argument
496 int err = 0, lnum = lp->lnum; in ubifs_garbage_collect_leb()
503 if (lp->free + lp->dirty == c->leb_size) { in ubifs_garbage_collect_leb()
505 dbg_gc("LEB %d is free, return it", lp->lnum); in ubifs_garbage_collect_leb()
506 ubifs_assert(c, !(lp->flags & LPROPS_INDEX)); in ubifs_garbage_collect_leb()
508 if (lp->free != c->leb_size) { in ubifs_garbage_collect_leb()
517 err = ubifs_change_one_lp(c, lp->lnum, c->leb_size, in ubifs_garbage_collect_leb()
522 err = ubifs_leb_unmap(c, lp->lnum); in ubifs_garbage_collect_leb()
549 lnum, lp->free, lp->dirty); in ubifs_garbage_collect_leb()
585 lnum, lp->free, lp->dirty); in ubifs_garbage_collect_leb()
[all …]
Dlprops.c185 struct ubifs_lprops *lp; in add_to_lpt_heap() local
187 lp = heap->arr[cpos]; in add_to_lpt_heap()
188 lp->flags &= ~LPROPS_CAT_MASK; in add_to_lpt_heap()
189 lp->flags |= LPROPS_UNCAT; in add_to_lpt_heap()
190 list_add(&lp->list, &c->uncat_list); in add_to_lpt_heap()
521 const struct ubifs_lprops *lp, in ubifs_change_lp() argument
529 struct ubifs_lprops *lprops = (struct ubifs_lprops *)lp; in ubifs_change_lp()
653 const struct ubifs_lprops *lp; in ubifs_change_one_lp() local
657 lp = ubifs_lpt_lookup_dirty(c, lnum); in ubifs_change_one_lp()
658 if (IS_ERR(lp)) { in ubifs_change_one_lp()
[all …]
Dreplay.c90 const struct ubifs_lprops *lp; in set_bud_lprops() local
95 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); in set_bud_lprops()
96 if (IS_ERR(lp)) { in set_bud_lprops()
97 err = PTR_ERR(lp); in set_bud_lprops()
101 dirty = lp->dirty; in set_bud_lprops()
102 if (b->bud->start == 0 && (lp->free != c->leb_size || lp->dirty != 0)) { in set_bud_lprops()
123 lp->free, lp->dirty); in set_bud_lprops()
125 lp->free, lp->dirty); in set_bud_lprops()
126 dirty -= c->leb_size - lp->free; in set_bud_lprops()
136 b->bud->lnum, lp->free, lp->dirty, b->free, in set_bud_lprops()
[all …]
Ddebug.c643 void ubifs_dump_lprop(const struct ubifs_info *c, const struct ubifs_lprops *lp) in ubifs_dump_lprop() argument
649 spc = lp->free + lp->dirty; in ubifs_dump_lprop()
655 if (lp->flags & LPROPS_INDEX) in ubifs_dump_lprop()
657 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, in ubifs_dump_lprop()
658 lp->flags); in ubifs_dump_lprop()
661 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, in ubifs_dump_lprop()
662 dark, dead, (int)(spc / UBIFS_MAX_NODE_SZ), lp->flags); in ubifs_dump_lprop()
664 if (lp->flags & LPROPS_TAKEN) { in ubifs_dump_lprop()
665 if (lp->flags & LPROPS_INDEX) in ubifs_dump_lprop()
672 if (lp->flags & LPROPS_INDEX) { in ubifs_dump_lprop()
[all …]
Drecovery.c1161 struct ubifs_lprops lp; in ubifs_rcvry_gc_commit() local
1170 err = ubifs_find_dirty_leb(c, &lp, wbuf->offs, 2); in ubifs_rcvry_gc_commit()
1179 ubifs_assert(c, !(lp.flags & LPROPS_INDEX)); in ubifs_rcvry_gc_commit()
1180 ubifs_assert(c, lp.free + lp.dirty >= wbuf->offs); in ubifs_rcvry_gc_commit()
1191 dbg_rcvry("GC'ing LEB %d", lp.lnum); in ubifs_rcvry_gc_commit()
1193 err = ubifs_garbage_collect_leb(c, &lp); in ubifs_rcvry_gc_commit()
1216 dbg_rcvry("allocated LEB %d for GC", lp.lnum); in ubifs_rcvry_gc_commit()
Dtnc_commit.c295 struct ubifs_lprops lp; in layout_leb_in_gaps() local
298 err = ubifs_read_one_lp(c, lnum, &lp); in layout_leb_in_gaps()
301 if (lp.free == c->leb_size) { in layout_leb_in_gaps()
Dubifs.h1924 int ubifs_garbage_collect_leb(struct ubifs_info *c, struct ubifs_lprops *lp);
1975 const struct ubifs_lprops *lp,
1990 int ubifs_read_one_lp(struct ubifs_info *c, int lnum, struct ubifs_lprops *lp);
Ddebug.h250 const struct ubifs_lprops *lp);
Dlpt.c2261 struct ubifs_lprops *lp, *lprops = &pnode->lprops[i]; in dbg_chk_pnode() local
2336 list_for_each_entry(lp, list, list) in dbg_chk_pnode()
2337 if (lprops == lp) { in dbg_chk_pnode()
/fs/jfs/
Djfs_logmgr.c349 struct logpage *lp; /* dst log page */ in lmWriteRecord() local
368 lp = (struct logpage *) bp->l_ldata; in lmWriteRecord()
419 lp = (struct logpage *) bp->l_ldata; in lmWriteRecord()
432 dst = (caddr_t) lp + dstoffset; in lmWriteRecord()
444 lp = (struct logpage *) bp->l_ldata; in lmWriteRecord()
455 lvd = (struct lvd *) ((caddr_t) lp + dstoffset); in lmWriteRecord()
480 dst = (caddr_t) lp + dstoffset; in lmWriteRecord()
540 lp = (struct logpage *) bp->l_ldata; in lmWriteRecord()
562 struct logpage *lp; in lmNextPage() local
572 lp = (struct logpage *) bp->l_ldata; in lmNextPage()
[all …]
Djfs_dmap.c2928 int lp, pp, k; in dbAdjTree() local
2935 lp = leafno + le32_to_cpu(tp->dmt_leafidx); in dbAdjTree()
2937 if (WARN_ON_ONCE(lp >= size || lp < 0)) in dbAdjTree()
2943 if (tp->dmt_stree[lp] == newval) in dbAdjTree()
2948 tp->dmt_stree[lp] = newval; in dbAdjTree()
2956 lp = ((lp - 1) & ~0x03) + 1; in dbAdjTree()
2960 pp = (lp - 1) >> 2; in dbAdjTree()
2964 max = TREEMAX(&tp->dmt_stree[lp]); in dbAdjTree()
2978 lp = pp; in dbAdjTree()
Djfs_dtree.c169 static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp,
934 dtpage_t *lp; /* left child page */ in dtSplitUp() local
1125 lp = sp; in dtSplitUp()
1179 rc = ciGetLeafPrefixKey(lp, in dtSplitUp()
1180 lp->header.nextindex-1, in dtSplitUp()
2443 dtpage_t *p, *pp, *rp = 0, *lp= 0; in dtRelocate() local
2503 DT_GETPAGE(ip, prevbn, lmp, PSIZE, lp, rc); in dtRelocate()
2528 lp->header.next = cpu_to_le64(nxaddr); in dtRelocate()
3767 static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp, in ciGetLeafPrefixKey() argument
3788 dtGetKey(lp, li, &lkey, flag); in ciGetLeafPrefixKey()
Djfs_xtree.c2555 xtpage_t *p, *pp, *rp, *lp; /* base B+-tree index page */ in xtRelocate() local
2729 XT_GETPAGE(ip, prevbn, lmp, PSIZE, lp, rc); in xtRelocate()
2747 lp->header.next = cpu_to_le64(nxaddr); in xtRelocate()
/fs/xfs/scrub/
Dbitmap.c103 struct list_head *lp; in xbitmap_disunion() local
129 lp = bitmap->list.next; in xbitmap_disunion()
130 while (lp != &bitmap->list) { in xbitmap_disunion()
131 br = list_entry(lp, struct xbitmap_range, list); in xbitmap_disunion()
143 lp = lp->next; in xbitmap_disunion()
171 lp = lp->next; in xbitmap_disunion()
175 lp = lp->next; in xbitmap_disunion()
195 lp = lp->next; in xbitmap_disunion()
/fs/nfsd/
Dnfs4layouts.c406 struct nfs4_layout *lp, *new = NULL; in nfsd4_insert_layout() local
414 list_for_each_entry(lp, &ls->ls_layouts, lo_perstate) { in nfsd4_insert_layout()
415 if (layouts_try_merge(&lp->lo_seg, seg)) in nfsd4_insert_layout()
424 memcpy(&new->lo_seg, seg, sizeof(lp->lo_seg)); in nfsd4_insert_layout()
432 list_for_each_entry(lp, &ls->ls_layouts, lo_perstate) { in nfsd4_insert_layout()
433 if (layouts_try_merge(&lp->lo_seg, seg)) in nfsd4_insert_layout()
454 struct nfs4_layout *lp = list_first_entry(reaplist, in nfsd4_free_layouts() local
457 list_del(&lp->lo_perstate); in nfsd4_free_layouts()
458 nfs4_put_stid(&lp->lo_state->ls_stid); in nfsd4_free_layouts()
459 kmem_cache_free(nfs4_layout_cache, lp); in nfsd4_free_layouts()
[all …]
/fs/gfs2/
Ddir.c916 __be64 *lp; in dir_make_exhash() local
973 lp = (__be64 *)(dibh->b_data + sizeof(struct gfs2_dinode)); in dir_make_exhash()
975 for (x = sdp->sd_hash_ptrs; x--; lp++) in dir_make_exhash()
976 *lp = cpu_to_be64(bn); in dir_make_exhash()
1009 __be64 *lp; in dir_split_leaf() local
1055 lp = kmalloc_array(half_len, sizeof(__be64), GFP_NOFS); in dir_split_leaf()
1056 if (!lp) { in dir_split_leaf()
1063 lp[x] = cpu_to_be64(bn); in dir_split_leaf()
1067 error = gfs2_dir_write_data(dip, (char *)lp, start * sizeof(u64), in dir_split_leaf()
1075 kfree(lp); in dir_split_leaf()
[all …]
/fs/xfs/
Dxfs_dquot_item.c215 struct xfs_dq_logitem *lp = &dqp->q_logitem; in xfs_qm_dquot_logitem_init() local
217 xfs_log_item_init(dqp->q_mount, &lp->qli_item, XFS_LI_DQUOT, in xfs_qm_dquot_logitem_init()
219 lp->qli_dquot = dqp; in xfs_qm_dquot_logitem_init()
Dxfs_inode.c449 struct xfs_log_item *lp; in xfs_lock_inodes() local
488 lp = &ips[j]->i_itemp->ili_item; in xfs_lock_inodes()
489 if (lp && test_bit(XFS_LI_IN_AIL, &lp->li_flags)) in xfs_lock_inodes()
554 struct xfs_log_item *lp; in xfs_lock_two_inodes() local
588 lp = &ip0->i_itemp->ili_item; in xfs_lock_two_inodes()
589 if (lp && test_bit(XFS_LI_IN_AIL, &lp->li_flags)) { in xfs_lock_two_inodes()
/fs/xfs/libxfs/
Dxfs_dir2.h224 xfs_dir2_leaf_tail_p(struct xfs_da_geometry *geo, struct xfs_dir2_leaf *lp) in xfs_dir2_leaf_tail_p() argument
227 ((char *)lp + geo->blksize - in xfs_dir2_leaf_tail_p()
/fs/nfs/
Dpnfs.c1673 struct pnfs_layout_segment *lp, *tmp; in pnfs_generic_layout_insert_lseg() local
1677 list_for_each_entry_safe(lp, tmp, &lo->plh_segs, pls_list) { in pnfs_generic_layout_insert_lseg()
1678 if (test_bit(NFS_LSEG_VALID, &lp->pls_flags) == 0) in pnfs_generic_layout_insert_lseg()
1680 if (do_merge(lseg, lp)) { in pnfs_generic_layout_insert_lseg()
1681 mark_lseg_invalid(lp, free_me); in pnfs_generic_layout_insert_lseg()
1684 if (is_after(&lseg->pls_range, &lp->pls_range)) in pnfs_generic_layout_insert_lseg()
1686 list_add_tail(&lseg->pls_list, &lp->pls_list); in pnfs_generic_layout_insert_lseg()
1692 lp, lp->pls_range.iomode, lp->pls_range.offset, in pnfs_generic_layout_insert_lseg()
1693 lp->pls_range.length); in pnfs_generic_layout_insert_lseg()