/fs/squashfs/ |
H A D | file.c | 100 int skip) 108 TRACE("empty_meta_index: offset %d, skip %d\n", offset, skip); 150 meta->skip = skip; 216 * entry[1] maps index x + skip, entry[2] maps index x + 2 * skip, and so on. 217 * The larger the file, the greater the skip factor. The skip factor is 220 * If the skip facto 99 empty_meta_index(struct inode *inode, int offset, int skip) argument 225 int skip = blocks / ((SQUASHFS_META_ENTRIES + 1) local 240 int skip = calculate_skip(i_size_read(inode) >> msblk->block_log); local [all...] |
H A D | squashfs_fs.h | 229 unsigned short skip; member in struct:meta_index
|
/fs/isofs/ |
H A D | rock.h | 10 unsigned char skip; member in struct:SU_SP_s
|
H A D | rock.c | 47 ISOFS_SB(inode->i_sb)->s_rock_offset = rr->u.SP.skip;
|
/fs/reiserfs/ |
H A D | xattr.c | 527 size_t skip = 0; local 547 skip = file_pos = sizeof(struct reiserfs_xattr_header); 548 if (chunk + skip > PAGE_CACHE_SIZE) 549 chunk = PAGE_CACHE_SIZE - skip; 556 err = __reiserfs_write_begin(page, page_offset, chunk + skip); 559 memcpy(data + skip, buffer + buffer_pos, chunk); 562 skip); 569 skip = 0; 675 size_t skip = 0; local 693 skip [all...] |
/fs/fat/ |
H A D | file.c | 223 /* Free all clusters after the skip'th cluster. */ 224 static int fat_free(struct inode *inode, int skip) argument 239 if (!skip) { 256 if (skip) { 260 ret = fat_get_cluster(inode, skip - 1, &fclus, &dclus); 287 inode->i_blocks = skip << (MSDOS_SB(sb)->cluster_bits - 9);
|
/fs/jfs/ |
H A D | jfs_xtree.c | 699 int skip; /* index of entry of insertion */ local 729 skip = split->index; 731 if (skip < nextindex) 732 memmove(&sp->xad[skip + 1], &sp->xad[skip], 733 (nextindex - skip) * sizeof(xad_t)); 736 xad = &sp->xad[skip]; 748 min(skip, (int)xtlck->lwm.offset) : skip; 844 skip 970 int skip, maxentry, middle, righthalf, n; local 1232 int skip, nextindex; local [all...] |
H A D | jfs_dtree.c | 942 int skip; /* index of entry of insertion */ local 1149 skip = parent->index + 1; 1183 if ((sp->header.flag & BT_ROOT && skip > 1) || 1184 sp->header.prev != 0 || skip > 1) { 1235 split->index = skip; /* index at insert */ 1278 n = skip >> L2DTSLOTSIZE; 1286 dtInsertEntry(sp, skip, &key, data, &dtlck); 1344 int skip, nextindex, half, left, nxt, off, si; local 1437 * a entry to it (skip is maxentry), it's likely that the access is 1504 skip [all...] |
H A D | jfs_metapage.c | 476 goto skip; 480 skip:
|
/fs/hfs/ |
H A D | brec.c | 117 goto skip; 129 skip: 210 goto skip; 222 skip: 384 goto skip; 412 skip:
|
/fs/hfsplus/ |
H A D | brec.c | 117 goto skip; 129 skip: 214 goto skip; 226 skip: 389 goto skip; 418 skip:
|
/fs/btrfs/ |
H A D | uuid-tree.c | 297 goto skip; 304 goto skip; 340 skip:
|
H A D | ioctl.c | 899 * file you want to defrag, we return 0 to let you know to skip this 1047 u64 *last_len, u64 *skip, u64 *defrag_end, 1061 *skip = 0; 1094 *skip = extent_map_end(em); 1268 u64 skip = 0; local 1367 extent_thresh, &last_len, &skip, 1372 * the should_defrag function tells us how much to skip 1375 next = DIV_ROUND_UP(skip, PAGE_CACHE_SIZE); 3448 u64 skip = 0; local 3453 skip 1046 should_defrag_range(struct inode *inode, u64 start, u32 thresh, u64 *last_len, u64 *skip, u64 *defrag_end, int compress) argument [all...] |
H A D | scrub.c | 2403 /* for raid56, we skip parity stripe */ 2410 goto skip; 2586 skip: 2721 goto skip; 2736 goto skip; 2796 skip:
|
/fs/ubifs/ |
H A D | recovery.c | 474 int skip, dlen = le32_to_cpu(ch->len); local 477 skip = ALIGN(offs + UBIFS_CH_SZ, c->max_write_size) - offs; 478 if (is_empty(buf + skip, len - skip)) 488 /* Now we know the corrupt node's length we can skip over it */ 489 skip = ALIGN(offs + dlen, c->max_write_size) - offs; 491 if (is_empty(buf + skip, len - skip)) 493 dbg_rcvry("unexpected data at %d:%d", lnum, offs + skip);
|
/fs/ext4/ |
H A D | mmp.c | 305 goto skip; 335 skip:
|
/fs/ocfs2/ |
H A D | move_extents.c | 737 u32 threshold, int *skip) 746 * XXX: skip a large extent. 748 *skip = 1; 766 int ret = 0, flags, do_defrag, skip = 0; local 837 * - skip the hole of course 849 defrag_thresh, &skip); 851 * skip large extents 853 if (skip) { 854 skip = 0; 736 ocfs2_calc_extent_defrag_len(u32 *alloc_size, u32 *len_defraged, u32 threshold, int *skip) argument
|
/fs/logfs/ |
H A D | logfs.h | 653 static inline __be32 logfs_crc32(void *data, size_t len, size_t skip) argument 655 return cpu_to_be32(crc32(~0, data+skip, len-skip));
|
H A D | readwrite.c | 365 static unsigned long __get_bits(u64 val, int skip, int no) argument 369 ret >>= skip * no; 375 static unsigned long get_bits(u64 val, level_t skip) argument 377 return __get_bits(val, (__force int)skip, LOGFS_BLOCK_BITS);
|
/fs/gfs2/ |
H A D | rgrp.c | 1569 * If we have a minimum extent length, then skip over any extent 1580 * and skip if parts of it are already reserved 1726 * @skip: block address we should explicitly not unlink 1732 static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip) argument 1757 if (block == skip) 1873 u32 skip; local 1875 get_random_bytes(&skip, sizeof(skip)); 1876 return skip % sdp->sd_rgrps; 1909 u32 skip local [all...] |
/fs/jffs2/ |
H A D | debug.c | 739 int skip; local 744 i = skip = offs % JFFS2_BUFDUMP_BYTES_PER_LINE; 747 if (skip != 0) 750 while (skip--)
|
H A D | scan.c | 253 skip a little and align it. */ 255 uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize; local 258 __func__, skip); 260 jffs2_scan_dirty_space(c, c->nextblock, skip);
|
/fs/f2fs/ |
H A D | super.c | 448 * In addition, EIO will skip do checkpoint, we need this as well. 641 * so skip checking GC and FLUSH_MERGE conditions. 644 goto skip; 675 skip:
|
H A D | node.c | 1159 * we should not skip writing node pages. 1770 goto skip; 1783 skip:
|
/fs/ocfs2/dlm/ |
H A D | dlmmaster.c | 2945 int ret, skip, status = 0; local 2962 /* We could race exit domain. If exited, skip. */ 2964 skip = (!test_bit(nodenum, dlm->domain_map)); 2966 if (skip) {
|