fs/nilfs2/segment.c

513 	struct nilfs_inode_info *ii;
520 	ii = NILFS_I(inode);
522 	if (test_bit(NILFS_I_GCINODE, &ii->i_state))
523 		cno = ii->i_cno;
761 	struct nilfs_inode_info *ii = NILFS_I(inode);
762 	struct inode *btnc_inode = ii->i_assoc_inode;
794 	struct nilfs_inode_info *ii, *n;
800 		list_for_each_entry_safe(ii, n, head, i_dirty) {
801 			list_del_init(&ii->i_dirty);
803 				if (unlikely(ii->i_bh)) {
804 					brelse(ii->i_bh);
805 					ii->i_bh = NULL;
807 			} else if (test_bit(NILFS_I_DIRTY, &ii->i_state)) {
808 				set_bit(NILFS_I_QUEUED, &ii->i_state);
809 				list_add_tail(&ii->i_dirty,
813 			ivec[nv++] = ii;
884 				    struct nilfs_inode_info *ii)
890 	if (test_bit(NILFS_I_BMAP, &ii->i_state)) {
891 		ibh = ii->i_bh;
893 		raw_inode = nilfs_ifile_map_inode(ifile, ii->vfs_inode.i_ino,
895 		nilfs_bmap_write(ii->i_bmap, raw_inode);
902 	struct nilfs_inode_info *ii;
904 	list_for_each_entry(ii, &sci->sc_dirty_files, i_dirty) {
905 		nilfs_fill_in_file_bmap(sci->sc_root->ifile, ii);
906 		set_bit(NILFS_I_COLLECTED, &ii->i_state);
972 	struct nilfs_inode_info *ii;
974 	list_for_each_entry(ii, head, i_dirty) {
975 		if (test_bit(NILFS_I_COLLECTED, &ii->i_state))
976 			clear_bit(NILFS_I_COLLECTED, &ii->i_state);
982 	struct nilfs_inode_info *ii;
984 	list_for_each_entry(ii, head, i_dirty) {
985 		if (!test_and_clear_bit(NILFS_I_COLLECTED, &ii->i_state))
988 		clear_bit(NILFS_I_INODE_SYNC, &ii->i_state);
989 		set_bit(NILFS_I_UPDATED, &ii->i_state);
1109 	struct nilfs_inode_info *ii;
1138 			ii = list_prepare_entry(sci->sc_stage.gc_inode_ptr,
1140 			list_for_each_entry_continue(ii, head, i_dirty) {
1142 					sci, &ii->vfs_inode,
1146 						ii->i_dirty.prev,
1151 				set_bit(NILFS_I_COLLECTED, &ii->i_state);
1159 		ii = list_prepare_entry(sci->sc_stage.dirty_file_ptr, head,
1161 		list_for_each_entry_continue(ii, head, i_dirty) {
1162 			clear_bit(NILFS_I_DIRTY, &ii->i_state);
1164 			err = nilfs_segctor_scan_file(sci, &ii->vfs_inode,
1168 					list_entry(ii->i_dirty.prev,
1246 		ii = sci->sc_dsync_inode;
1247 		if (!test_bit(NILFS_I_BUSY, &ii->i_state))
1250 		err = nilfs_segctor_scan_file_dsync(sci, &ii->vfs_inode);
1933 	struct nilfs_inode_info *ii, *n;
1938 	list_for_each_entry_safe(ii, n, &nilfs->ns_dirty_files, i_dirty) {
1939 		if (!ii->i_bh) {
1945 				ifile, ii->vfs_inode.i_ino, &ibh);
1949 					   err, ii->vfs_inode.i_ino);
1953 			if (likely(!ii->i_bh))
1954 				ii->i_bh = ibh;
1961 		mark_buffer_dirty(ii->i_bh);
1964 		clear_bit(NILFS_I_QUEUED, &ii->i_state);
1965 		set_bit(NILFS_I_BUSY, &ii->i_state);
1966 		list_move_tail(&ii->i_dirty, &sci->sc_dirty_files);
1976 	struct nilfs_inode_info *ii, *n;
1981 	list_for_each_entry_safe(ii, n, &sci->sc_dirty_files, i_dirty) {
1982 		if (!test_and_clear_bit(NILFS_I_UPDATED, &ii->i_state) ||
1983 		    test_bit(NILFS_I_DIRTY, &ii->i_state))
1986 		clear_bit(NILFS_I_BUSY, &ii->i_state);
1987 		brelse(ii->i_bh);
1988 		ii->i_bh = NULL;
1989 		list_del_init(&ii->i_dirty);
1990 		if (!ii->vfs_inode.i_nlink || during_mount) {
1995 			list_add_tail(&ii->i_dirty, &sci->sc_iput_queue);
1999 			iput(&ii->vfs_inode);
2281 	struct nilfs_inode_info *ii;
2290 	ii = NILFS_I(inode);
2291 	if (test_bit(NILFS_I_INODE_SYNC, &ii->i_state) ||
2301 	if (!test_bit(NILFS_I_QUEUED, &ii->i_state) &&
2302 	    !test_bit(NILFS_I_BUSY, &ii->i_state)) {
2308 	sci->sc_dsync_inode = ii;
2415 	struct nilfs_inode_info *ii, *n;
2417 	list_for_each_entry_safe(ii, n, head, i_dirty) {
2418 		if (!test_bit(NILFS_I_UPDATED, &ii->i_state))
2420 		list_del_init(&ii->i_dirty);
2421 		truncate_inode_pages(&ii->vfs_inode.i_data, 0);
2422 		nilfs_btnode_cache_clear(ii->i_assoc_inode->i_mapping);
2423 		iput(&ii->vfs_inode);