| /fs/nilfs2/ |
| D | recovery.c | 105 struct buffer_head *bhs, u32 *sum, in nilfs_compute_checksum() argument
131 *sum = crc; in nilfs_compute_checksum()
194 struct nilfs_segment_summary **sum) in nilfs_read_log_header() argument
200 *sum = (struct nilfs_segment_summary *)bh_sum->b_data; in nilfs_read_log_header()
213 struct nilfs_segment_summary *sum) in nilfs_validate_log() argument
220 if (le32_to_cpu(sum->ss_magic) != NILFS_SEGSUM_MAGIC) in nilfs_validate_log()
224 if (le64_to_cpu(sum->ss_seq) != seg_seq) in nilfs_validate_log()
227 nblock = le32_to_cpu(sum->ss_nblocks); in nilfs_validate_log()
234 if (nilfs_compute_checksum(nilfs, bh_sum, &crc, sizeof(sum->ss_datasum), in nilfs_validate_log()
240 if (crc != le32_to_cpu(sum->ss_datasum)) in nilfs_validate_log()
[all …]
|
| D | the_nilfs.c | 426 static unsigned char sum[4]; in nilfs_valid_sb() local
438 crc = crc32_le(crc, sum, 4); in nilfs_valid_sb()
|
| /fs/f2fs/ |
| D | segment.c | 260 struct f2fs_summary *sum, unsigned short offset) in __add_sum_entry() argument
265 memcpy(addr, sum, sizeof(struct f2fs_summary)); in __add_sum_entry()
827 struct f2fs_summary *sum, enum page_type p_type) in do_write_page() argument
847 __add_sum_entry(sbi, type, sum, curseg->next_blkoff); in do_write_page()
884 struct f2fs_summary sum; in write_node_page() local
885 set_summary(&sum, nid, 0, 0); in write_node_page()
886 do_write_page(sbi, page, old_blkaddr, new_blkaddr, &sum, NODE); in write_node_page()
894 struct f2fs_summary sum; in write_data_page() local
899 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version); in write_data_page()
902 new_blkaddr, &sum, DATA); in write_data_page()
[all …]
|
| D | gc.c | 380 struct f2fs_summary *sum, unsigned int segno, int gc_type) in gc_node_segment() argument
387 entry = sum; in gc_node_segment()
470 static int check_dnode(struct f2fs_sb_info *sbi, struct f2fs_summary *sum, in check_dnode() argument
478 nid = le32_to_cpu(sum->nid); in check_dnode()
479 ofs_in_node = le16_to_cpu(sum->ofs_in_node); in check_dnode()
487 if (sum->version != dni->version) { in check_dnode()
536 static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum, in gc_data_segment() argument
548 entry = sum; in gc_data_segment()
641 struct f2fs_summary_block *sum; in do_garbage_collect() local
651 sum = page_address(sum_page); in do_garbage_collect()
[all …]
|
| D | recovery.c | 196 struct f2fs_summary sum; in check_index_in_prev_nodes() local
212 sum = curseg->sum_blk->entries[blkoff]; in check_index_in_prev_nodes()
221 sum = sum_node->entries[blkoff]; in check_index_in_prev_nodes()
226 node_page = get_node_page(sbi, le32_to_cpu(sum.nid)); in check_index_in_prev_nodes()
228 le16_to_cpu(sum.ofs_in_node); in check_index_in_prev_nodes()
246 struct f2fs_summary sum; in do_recover_data() local
288 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version); in do_recover_data()
291 recover_data_page(sbi, NULL, &sum, src, dest); in do_recover_data()
298 set_summary(&sum, dn.nid, 0, 0); in do_recover_data()
307 recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr); in do_recover_data()
|
| D | hash.c | 30 __u32 sum = 0; in TEA_transform() local
36 sum += DELTA; in TEA_transform()
37 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); in TEA_transform()
38 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); in TEA_transform()
|
| D | node.c | 269 struct f2fs_summary_block *sum = curseg->sum_blk; in get_node_info() local
294 i = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 0); in get_node_info()
296 ne = nat_in_journal(sum, i); in get_node_info()
1337 struct f2fs_summary_block *sum = curseg->sum_blk; in build_free_nids() local
1367 for (i = 0; i < nats_in_cursum(sum); i++) { in build_free_nids()
1368 block_t addr = le32_to_cpu(nat_in_journal(sum, i).block_addr); in build_free_nids()
1369 nid = le32_to_cpu(nid_in_journal(sum, i)); in build_free_nids()
1457 struct f2fs_summary *sum, struct node_info *ni, in recover_node_page() argument
1460 rewrite_node_page(sbi, page, sum, ni->blk_addr, new_blkaddr); in recover_node_page()
1504 unsigned int segno, struct f2fs_summary_block *sum) in restore_node_summary() argument
[all …]
|
| D | f2fs.h | 84 #define nats_in_cursum(sum) (le16_to_cpu(sum->n_nats)) argument
85 #define sits_in_cursum(sum) (le16_to_cpu(sum->n_sits)) argument
87 #define nat_in_journal(sum, i) (sum->nat_j.entries[i].ne) argument
88 #define nid_in_journal(sum, i) (sum->nat_j.entries[i].nid) argument
89 #define sit_in_journal(sum, i) (sum->sit_j.entries[i].se) argument
90 #define segno_in_journal(sum, i) (sum->sit_j.entries[i].segno) argument
|
| D | segment.h | 604 static inline void set_summary(struct f2fs_summary *sum, nid_t nid, in set_summary() argument
607 sum->nid = cpu_to_le32(nid); in set_summary()
608 sum->ofs_in_node = cpu_to_le16(ofs_in_node); in set_summary()
609 sum->version = version; in set_summary()
|
| /fs/befs/ |
| D | datastream.c | 250 befs_blocknr_t sum; in befs_find_brun_direct() local
262 for (i = 0, sum = 0; i < BEFS_NUM_DIRECT_BLOCKS; in befs_find_brun_direct()
263 sum += array[i].len, i++) { in befs_find_brun_direct()
264 if (blockno >= sum && blockno < sum + (array[i].len)) { in befs_find_brun_direct()
265 int offset = blockno - sum; in befs_find_brun_direct()
309 befs_blocknr_t sum = 0; in befs_find_brun_indirect() local
340 if (search_blk >= sum && search_blk < sum + len) { in befs_find_brun_indirect()
341 int offset = search_blk - sum; in befs_find_brun_indirect()
356 sum += len; in befs_find_brun_indirect()
|
| /fs/btrfs/ |
| D | file-item.c | 160 u32 sum[16]; in __btrfs_lookup_bio_sums() local
198 len = min_t(int, ARRAY_SIZE(sum), bio->bi_vcnt - bio_index); in __btrfs_lookup_bio_sums()
201 count = btrfs_find_ordered_sum(inode, offset, disk_bytenr, sum, in __btrfs_lookup_bio_sums()
217 sum[0] = 0; in __btrfs_lookup_bio_sums()
255 read_extent_buffer(path->nodes[0], sum, in __btrfs_lookup_bio_sums()
260 memcpy(dst, sum, count * csum_size); in __btrfs_lookup_bio_sums()
264 extent_cache_csums_dio(io_tree, offset, sum, in __btrfs_lookup_bio_sums()
267 extent_cache_csums(io_tree, bio, bio_index, sum, in __btrfs_lookup_bio_sums()
389 §or_sum->sum, in btrfs_lookup_csums_range()
474 sector_sum->sum = ~(u32)0; in btrfs_csum_one_bio()
[all …]
|
| D | ordered-data.c | 270 struct btrfs_ordered_sum *sum) in btrfs_add_ordered_sum() argument
276 list_add_tail(&sum->list, &entry->list); in btrfs_add_ordered_sum()
277 WARN_ON(entry->csum_bytes_left < sum->len); in btrfs_add_ordered_sum()
278 entry->csum_bytes_left -= sum->len; in btrfs_add_ordered_sum()
483 struct btrfs_ordered_sum *sum; in btrfs_put_ordered_extent() local
492 sum = list_entry(cur, struct btrfs_ordered_sum, list); in btrfs_put_ordered_extent()
493 list_del(&sum->list); in btrfs_put_ordered_extent()
494 kfree(sum); in btrfs_put_ordered_extent()
989 u32 *sum, int len) in btrfs_find_ordered_sum() argument
1015 sum[index] = sector_sums[i].sum; in btrfs_find_ordered_sum()
|
| D | ordered-data.h | 38 u32 sum; member
186 struct btrfs_ordered_sum *sum);
200 u32 *sum, int len);
|
| D | scrub.c | 310 struct btrfs_ordered_sum *sum; in scrub_free_csums() local
311 sum = list_first_entry(&sctx->csum_list, in scrub_free_csums()
313 list_del(&sum->list); in scrub_free_csums()
314 kfree(sum); in scrub_free_csums()
2128 struct btrfs_ordered_sum *sum = NULL; in scrub_find_csum() local
2134 sum = list_first_entry(&sctx->csum_list, in scrub_find_csum()
2136 if (sum->bytenr > logical) in scrub_find_csum()
2138 if (sum->bytenr + sum->len > logical) in scrub_find_csum()
2142 list_del(&sum->list); in scrub_find_csum()
2143 kfree(sum); in scrub_find_csum()
[all …]
|
| /fs/proc/ |
| D | stat.c | 86 u64 sum = 0; in show_stat() local
108 sum += kstat_cpu_irqs_sum(i); in show_stat()
109 sum += arch_irq_stat_cpu(i); in show_stat()
118 sum += arch_irq_stat(); in show_stat()
158 seq_printf(p, "intr %llu", (unsigned long long)sum); in show_stat()
|
| /fs/reiserfs/ |
| D | hashes.c | 32 u32 sum = 0; \
41 sum += DELTA; \
42 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
43 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); \
|
| /fs/ext4/ |
| D | hash.c | 21 __u32 sum = 0; in TEA_transform() local
27 sum += DELTA; in TEA_transform()
28 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); in TEA_transform()
29 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); in TEA_transform()
|
| /fs/ext3/ |
| D | hash.c | 19 __u32 sum = 0; in TEA_transform() local
25 sum += DELTA; in TEA_transform()
26 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); in TEA_transform()
27 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); in TEA_transform()
|
| /fs/xfs/ |
| D | xfs_rtalloc.c | 600 xfs_suminfo_t sum; /* summary information for extents */ in xfs_rtallocate_extent_size() local
621 &sum); in xfs_rtallocate_extent_size()
628 if (!sum) in xfs_rtallocate_extent_size()
680 &sum); in xfs_rtallocate_extent_size()
687 if (!sum) in xfs_rtallocate_extent_size()
818 xfs_suminfo_t sum; /* summary data */ in xfs_rtany_summary() local
827 error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum); in xfs_rtany_summary()
834 if (sum) { in xfs_rtany_summary()
1089 xfs_suminfo_t sum; /* summary data */ in xfs_rtcopy_summary() local
1098 &sumbno, &sum); in xfs_rtcopy_summary()
[all …]
|
| /fs/omfs/ |
| D | bitmap.c | 10 unsigned long sum = 0; in omfs_count_free() local
15 sum += nbits - bitmap_weight(sbi->s_imap[i], nbits); in omfs_count_free()
17 return sum; in omfs_count_free()
|
| /fs/minix/ |
| D | bitmap.c | 28 __u32 sum = 0; in count_free() local
35 sum += 16 - hweight16(*p++); in count_free()
38 return sum; in count_free()
|
| /fs/affs/ |
| D | amigaffs.c | 342 u32 sum; in affs_checksum_block() local
345 sum = 0; in affs_checksum_block()
347 sum += be32_to_cpu(*ptr++); in affs_checksum_block()
348 return sum; in affs_checksum_block()
|
| /fs/romfs/ |
| D | super.c | 456 __u32 sum; in romfs_checksum() local
458 sum = 0; in romfs_checksum()
461 sum += be32_to_cpu(*ptr++); in romfs_checksum()
464 return sum; in romfs_checksum()
|
| /fs/ |
| D | inode.c | 81 int sum = 0; in get_nr_inodes() local
83 sum += per_cpu(nr_inodes, i); in get_nr_inodes()
84 return sum < 0 ? 0 : sum; in get_nr_inodes()
90 int sum = 0; in get_nr_inodes_unused() local
92 sum += per_cpu(nr_unused, i); in get_nr_inodes_unused()
93 return sum < 0 ? 0 : sum; in get_nr_inodes_unused()
|
| /fs/ubifs/ |
| D | find.c | 236 int err = 0, sum, exclude_index = pick_free == 2 ? 1 : 0; in ubifs_find_dirty_leb() local
289 sum = idx_lp->free + idx_lp->dirty; in ubifs_find_dirty_leb()
300 if (sum < min_space || sum < c->half_leb_size) in ubifs_find_dirty_leb()
|