/fs/afs/ |
H A D | write.c | 139 candidate->first = candidate->last = index; 197 ASSERTRANGE(wb->first, <=, index, <=, wb->last); 198 if (index == wb->first && from < wb->offset_first) 208 _debug("append into %lx-%lx", wb->first, wb->last); 279 pgoff_t first, pgoff_t last) 285 vnode->fid.vid, vnode->fid.vnode, first, last); 290 _debug("kill %lx-%lx", first, last); 292 count = last - first + 1; 296 first, count, pv.pages); 307 } while (first < las 278 afs_kill_pages(struct afs_vnode *vnode, bool error, pgoff_t first, pgoff_t last) argument 322 pgoff_t start, first, last; local 577 pgoff_t first = call->first, last = call->last; local [all...] |
H A D | rxrpc.c | 278 pgoff_t first = call->first, last = call->last; local 287 _debug("attach %lx-%lx", first, last); 289 count = last - first + 1; 292 n = find_get_pages_contig(call->mapping, first, count, pages); 299 if (first + loop >= last) 315 if (first + loop >= last) 323 first += count; 329 } while (first <= last); 738 /* the operation ID forms the first fou [all...] |
H A D | cache.c | 374 pgoff_t first; local 381 first = 0; 386 first, 394 first = pvec.pages[nr_pages - 1]->index + 1;
|
/fs/ |
H A D | fs_pin.c | 42 p = ACCESS_ONCE(m->mnt_pins.first); 64 p = ACCESS_ONCE(sb->s_pins.first);
|
/fs/reiserfs/ |
H A D | lbalance.c | 36 * length of all record to be copied and first byte of 52 /* when copy last to first, dest buffer can contain 0 items */ 59 * if there are no items in dest or the first/last item in 128 * Copy the first (if last_first == FIRST_TO_LAST) or last 147 * if ( DEST is empty or first item of SOURCE and last item of 174 * copy part of the body of the first item of SOURCE 196 * merge first item (or its part) of src buffer with the last 217 * (DEST is empty or last item of SOURCE and first item of DEST 244 * begin of the body of the first item of the DEST; part defined 246 * change first ite 310 leaf_copy_items_entirely(struct buffer_info *dest_bi, struct buffer_head *src, int last_first, int first, int cpy_num) argument 827 leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first, int del_num, int del_bytes) argument 1240 leaf_delete_items_entirely(struct buffer_info *bi, int first, int del_num) argument [all...] |
H A D | prints.c | 423 static int print_internal(struct buffer_head *bh, int first, int last) argument 435 if (first == -1) { 439 from = first; 458 static int print_leaf(struct buffer_head *bh, int print_mode, int first, argument 485 if (first < 0 || first > nr - 1) 488 from = first; 567 printk("Journal block (first) %d\n", sb_jp_journal_1st_block(rs)); 592 /* ..., int print_mode, int first, int last) */ 596 int mode, first, las local [all...] |
H A D | bitmap.c | 175 /* search for a first zero bit -- beginning of a window */ 190 /* first zero bit found; we check next bits */ 675 static void print_sep(struct seq_file *seq, int *first) argument 677 if (!*first) 680 *first = 0; 685 int first = 1; local 694 print_sep(seq, &first); 702 print_sep(seq, &first); 710 print_sep(seq, &first); 714 print_sep(seq, &first); [all...] |
H A D | item_ops.c | 46 printk("\tmode | size | nlinks | first direct | mtime\n"); 88 static int sd_part_size(struct virtual_item *vi, int first, int count) argument 180 static int direct_part_size(struct virtual_item *vi, int first, int count) argument 226 /* if it is not first item of the body, then it is mergeable */ 319 * return size in bytes of 'units' units. If first == 0 - calculate 322 static int indirect_part_size(struct virtual_item *vi, int first, int units) argument 588 static int direntry_part_size(struct virtual_item *vi, int first, int count) argument 595 if (first == 0) 706 static int errcatch_part_size(struct virtual_item *vi, int first, int count) argument
|
/fs/xfs/libxfs/ |
H A D | xfs_rtbitmap.c | 82 * Searching backward from start to limit, find the first block whose 99 xfs_rtblock_t firstbit; /* first useful bit in the word */ 117 * Get the first word's index & point to it. 134 * Calculate first (leftmost) bit number to look at, 229 * Calculate first (leftmost) bit number to look at, 257 * Searching forward from start to limit, find the first block whose 292 * Get the first word's index & point to it. 470 * If there was an old one, get rid of it first. 489 uint first = (uint)((char *)sp - (char *)bp->b_addr); local 492 xfs_trans_log_buf(tp, bp, first, firs 531 xfs_rtword_t *first; /* first used word in the buffer */ local [all...] |
H A D | xfs_sb.c | 133 * search from @first to find the next perag with the given tag set. 138 xfs_agnumber_t first, 147 (void **)&pag, first, 1, tag); 548 int first; local 561 first = xfs_sb_info[f].offset; 562 size = xfs_sb_info[f + 1].offset - first; 567 memcpy(to_ptr + first, from_ptr + first, size); 571 *(__be16 *)(to_ptr + first) = 572 cpu_to_be16(*(__u16 *)(from_ptr + first)); 136 xfs_perag_get_tag( struct xfs_mount *mp, xfs_agnumber_t first, int tag) argument 831 int first; local [all...] |
H A D | xfs_dir2.h | 125 xfs_fsblock_t *first, 132 xfs_fsblock_t *first, 136 xfs_fsblock_t *first,
|
H A D | xfs_dir2.c | 249 xfs_fsblock_t *first, /* bmap's firstblock */ 276 args->firstblock = first; 423 xfs_fsblock_t *first, /* bmap's firstblock */ 445 args->firstblock = first; 485 xfs_fsblock_t *first, /* bmap's firstblock */ 510 args->firstblock = first; 244 xfs_dir_createname( xfs_trans_t *tp, xfs_inode_t *dp, struct xfs_name *name, xfs_ino_t inum, xfs_fsblock_t *first, xfs_bmap_free_t *flist, xfs_extlen_t total) argument 418 xfs_dir_removename( xfs_trans_t *tp, xfs_inode_t *dp, struct xfs_name *name, xfs_ino_t ino, xfs_fsblock_t *first, xfs_bmap_free_t *flist, xfs_extlen_t total) argument 480 xfs_dir_replace( xfs_trans_t *tp, xfs_inode_t *dp, struct xfs_name *name, xfs_ino_t inum, xfs_fsblock_t *first, xfs_bmap_free_t *flist, xfs_extlen_t total) argument
|
/fs/cifs/ |
H A D | cache.c | 299 pgoff_t first; local 303 first = 0; 309 cifsi->vfs_inode.i_mapping, first, 317 first = pvec.pages[nr_pages - 1]->index + 1;
|
/fs/nfs/ |
H A D | fscache-index.c | 265 pgoff_t first; local 269 first = 0; 277 first, 285 first = pvec.pages[nr_pages - 1]->index + 1;
|
/fs/logfs/ |
H A D | super.c | 248 /* read first superblock */ 362 struct page *first, *last; local 364 first = super->s_devops->find_first_sb(sb, &super->s_sb_ofs[0]); 365 if (!first || IS_ERR(first)) 369 page_cache_release(first); 373 if (!logfs_check_ds(page_address(first))) { 375 return first; 380 page_cache_release(first); 385 page_cache_release(first); [all...] |
/fs/nilfs2/ |
H A D | dat.c | 439 __u64 first, last; local 451 first = vinfo->vi_vblocknr; 452 do_div(first, entries_per_block); 453 first *= entries_per_block; 454 last = first + entries_per_block - 1; 456 j < nvi && vinfo->vi_vblocknr >= first &&
|
/fs/9p/ |
H A D | cache.c | 158 pgoff_t first; local 162 first = 0; 166 first, 174 first = pvec.pages[nr_pages - 1]->index + 1;
|
/fs/ceph/ |
H A D | cache.c | 150 pgoff_t first; local 154 first = 0; 159 nr_pages = pagevec_lookup(&pvec, ci->vfs_inode.i_mapping, first, 168 first = pvec.pages[nr_pages - 1]->index + 1; 399 /* The first load is verifed cookie open time */
|
/fs/ext4/ |
H A D | block_validity.c | 126 int first = 1; local 132 printk("%s%llu-%llu", first ? "" : ", ", 134 first = 0;
|
/fs/notify/ |
H A D | fsnotify.c | 46 * Given an inode, first check if we care what happens to our children. Inotify 221 inode_node = srcu_dereference(to_tell->i_fsnotify_marks.first, 226 vfsmount_node = srcu_dereference(mnt->mnt_fsnotify_marks.first, 228 inode_node = srcu_dereference(to_tell->i_fsnotify_marks.first,
|
/fs/xfs/ |
H A D | xfs_buf_item.c | 78 * and the first dirty region. 304 * given log buf item. It fills the first entry with a buf log 764 * the first. If we do already have one, there is 810 * Mark bytes first through last inclusive as dirty in the buf 815 uint first, 832 first_bit = first >> XFS_BLF_SHIFT; 841 * Get a pointer to the first word in the bitmap 848 * Calculate the starting bit in the first word. 853 * First set any bits in the first word of our range. 891 * Mark bytes first throug 814 xfs_buf_item_log_segment( uint first, uint last, uint *map) argument 895 xfs_buf_item_log( xfs_buf_log_item_t *bip, uint first, uint last) argument [all...] |
/fs/ext3/ |
H A D | xattr.c | 518 struct ext3_xattr_entry *first; member in struct:ext3_xattr_search 532 last = s->first; 591 last = s->first; 659 bs->s.first = BFIRST(bs->bh); 661 bs->s.here = bs->s.first; 705 if (!IS_LAST_ENTRY(s->first)) 735 s->first = ENTRY(header(s->base)+1); 750 s->first = ENTRY(header(s->base)+1); 760 if (!IS_LAST_ENTRY(s->first)) 764 if (!IS_LAST_ENTRY(s->first)) { [all...] |
/fs/befs/ |
H A D | btree.c | 42 * The first thing in the tree is the tree superblock. It tells you 68 * After figuring out the first, it becomes obvious that internal nodes have 186 * Note: node->bh must be NULL when this function called first 328 * If no exact match, finds first key in node that is greater 342 int first, last, mid; local 368 first = 0; 370 while (last >= first) { 371 mid = (last + first) / 2; 372 befs_debug(sb, "first: %d, last: %d, mid: %d", first, las [all...] |
/fs/gfs2/ |
H A D | trace_gfs2.h | 199 TP_PROTO(const struct gfs2_holder *gh, int first), 201 TP_ARGS(gh, first), 207 __field( int, first ) 215 __entry->first = first; 222 __entry->first ? "first": "other",
|
/fs/efs/ |
H A D | inode.c | 202 int cur, last, first = 1; local 210 /* first check the last extent we returned */ 249 * also compute ibase: i.e. the number of the first 274 if (first || lastblock != iblock) { 285 first = 0;
|