Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 | /* * Copyright (C) 1996, 1997 Claus-Justus Heine This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. * * $Source: /homes/cvs/ftape-stacked/ftape/zftape/zftape-rw.c,v $ * $Revision: 1.2 $ * $Date: 1997/10/05 19:19:08 $ * * This file contains some common code for the r/w code for * zftape. */ #include <linux/config.h> /* for CONFIG_ZFT_DFLT_BLK_SZ */ #include <linux/errno.h> #include <linux/mm.h> #include <asm/segment.h> #include <linux/zftape.h> #include "../zftape/zftape-init.h" #include "../zftape/zftape-eof.h" #include "../zftape/zftape-ctl.h" #include "../zftape/zftape-write.h" #include "../zftape/zftape-read.h" #include "../zftape/zftape-rw.h" #include "../zftape/zftape-vtbl.h" /* Global vars. */ __u8 *zft_deblock_buf; __u8 *zft_hseg_buf; int zft_deblock_segment = -1; zft_status_enum zft_io_state = zft_idle; int zft_header_changed; int zft_bad_sector_map_changed; int zft_qic113; /* conform to old specs. and old zftape */ int zft_use_compression; zft_position zft_pos = { -1, /* seg_pos */ 0, /* seg_byte_pos */ 0, /* tape_pos */ 0 /* volume_pos */ }; unsigned int zft_blk_sz = CONFIG_ZFT_DFLT_BLK_SZ; __s64 zft_capacity; unsigned int zft_written_segments; int zft_label_changed; /* Local vars. */ unsigned int zft_get_seg_sz(unsigned int segment) { int size; TRACE_FUN(ft_t_any); size = FT_SEGMENT_SIZE - count_ones(ftape_get_bad_sector_entry(segment))*FT_SECTOR_SIZE; if (size > 0) { TRACE_EXIT (unsigned)size; } else { TRACE_EXIT 0; } } /* ftape_set_flags(). Claus-Justus Heine, 1994/1995 */ void zft_set_flags(unsigned minor_unit) { TRACE_FUN(ft_t_flow); zft_use_compression = zft_qic_mode = 0; switch (minor_unit & ZFT_MINOR_OP_MASK) { case (ZFT_Q80_MODE | ZFT_ZIP_MODE): case ZFT_ZIP_MODE: zft_use_compression = 1; case 0: case ZFT_Q80_MODE: zft_qic_mode = 1; if (zft_mt_compression) { /* override the default */ zft_use_compression = 1; } break; case ZFT_RAW_MODE: TRACE(ft_t_noise, "switching to raw mode"); break; default: TRACE(ft_t_warn, "Warning:\n" KERN_INFO "Wrong combination of minor device bits.\n" KERN_INFO "Switching to raw read-only mode."); zft_write_protected = 1; break; } TRACE_EXIT; } /* computes the segment and byte offset inside the segment * corresponding to tape_pos. * * tape_pos gives the offset in bytes from the beginning of the * ft_first_data_segment *seg_byte_pos is the offset in the current * segment in bytes * * Of, if this routine was called often one should cache the last data * pos it was called with, but actually this is only needed in * ftape_seek_block(), that is, almost never. */ int zft_calc_seg_byte_coord(int *seg_byte_pos, __s64 tape_pos) { int segment; int seg_sz; TRACE_FUN(ft_t_flow); if (tape_pos == 0) { *seg_byte_pos = 0; segment = ft_first_data_segment; } else { seg_sz = 0; for (segment = ft_first_data_segment; ((tape_pos > 0) && (segment <= ft_last_data_segment)); segment++) { seg_sz = zft_get_seg_sz(segment); tape_pos -= seg_sz; } if(tape_pos >= 0) { /* the case tape_pos > != 0 means that the * argument tape_pos lies beyond the EOT. */ *seg_byte_pos= 0; } else { /* tape_pos < 0 */ segment--; *seg_byte_pos= tape_pos + seg_sz; } } TRACE_EXIT(segment); } /* ftape_calc_tape_pos(). * * computes the offset in bytes from the beginning of the * ft_first_data_segment inverse to ftape_calc_seg_byte_coord * * We should do some caching. But how: * * Each time the header segments are read in, this routine is called * with ft_tracks_per_tape*segments_per_track argumnet. So this should be * the time to reset the cache. * * Also, it might be in the future that the bad sector map gets * changed. -> reset the cache */ static int seg_pos; static __s64 tape_pos; __s64 zft_get_capacity(void) { seg_pos = ft_first_data_segment; tape_pos = 0; while (seg_pos <= ft_last_data_segment) { tape_pos += zft_get_seg_sz(seg_pos ++); } return tape_pos; } __s64 zft_calc_tape_pos(int segment) { int d1, d2, d3; TRACE_FUN(ft_t_any); if (segment > ft_last_data_segment) { TRACE_EXIT zft_capacity; } if (segment < ft_first_data_segment) { TRACE_EXIT 0; } d2 = segment - seg_pos; if (-d2 > 10) { d1 = segment - ft_first_data_segment; if (-d2 > d1) { tape_pos = 0; seg_pos = ft_first_data_segment; d2 = d1; } } if (d2 > 10) { d3 = ft_last_data_segment - segment; if (d2 > d3) { tape_pos = zft_capacity; seg_pos = ft_last_data_segment + 1; d2 = -d3; } } if (d2 > 0) { while (seg_pos < segment) { tape_pos += zft_get_seg_sz(seg_pos++); } } else { while (seg_pos > segment) { tape_pos -= zft_get_seg_sz(--seg_pos); } } TRACE(ft_t_noise, "new cached pos: %d", seg_pos); TRACE_EXIT tape_pos; } /* copy Z-label string to buffer, keeps track of the correct offset in * `buffer' */ void zft_update_label(__u8 *buffer) { TRACE_FUN(ft_t_flow); if (strncmp(&buffer[FT_LABEL], ZFTAPE_LABEL, sizeof(ZFTAPE_LABEL)-1) != 0) { TRACE(ft_t_info, "updating label from \"%s\" to \"%s\"", &buffer[FT_LABEL], ZFTAPE_LABEL); strcpy(&buffer[FT_LABEL], ZFTAPE_LABEL); memset(&buffer[FT_LABEL] + sizeof(ZFTAPE_LABEL) - 1, ' ', FT_LABEL_SZ - sizeof(ZFTAPE_LABEL + 1)); PUT4(buffer, FT_LABEL_DATE, 0); zft_label_changed = zft_header_changed = 1; /* changed */ } TRACE_EXIT; } int zft_verify_write_segments(unsigned int segment, __u8 *data, size_t size, __u8 *buffer) { int result; __u8 *write_buf; __u8 *src_buf; int single; int seg_pos; int seg_sz; int remaining; ft_write_mode_t write_mode; TRACE_FUN(ft_t_flow); seg_pos = segment; seg_sz = zft_get_seg_sz(seg_pos); src_buf = data; single = size <= seg_sz; remaining = size; do { TRACE(ft_t_noise, "\n" KERN_INFO "remaining: %d\n" KERN_INFO "seg_sz : %d\n" KERN_INFO "segment : %d", remaining, seg_sz, seg_pos); if (remaining == seg_sz) { write_buf = src_buf; write_mode = single ? FT_WR_SINGLE : FT_WR_MULTI; remaining = 0; } else if (remaining > seg_sz) { write_buf = src_buf; write_mode = FT_WR_ASYNC; /* don't start tape */ remaining -= seg_sz; } else { /* remaining < seg_sz */ write_buf = buffer; memcpy(write_buf, src_buf, remaining); memset(&write_buf[remaining],'\0',seg_sz-remaining); write_mode = single ? FT_WR_SINGLE : FT_WR_MULTI; remaining = 0; } if ((result = ftape_write_segment(seg_pos, write_buf, write_mode)) != seg_sz) { TRACE(ft_t_err, "Error: " "Couldn't write segment %d", seg_pos); TRACE_EXIT result < 0 ? result : -EIO; /* bail out */ } zft_written_segments ++; seg_sz = zft_get_seg_sz(++seg_pos); src_buf += result; } while (remaining > 0); if (ftape_get_status()->fti_state == writing) { TRACE_CATCH(ftape_loop_until_writes_done(),); TRACE_CATCH(ftape_abort_operation(),); zft_prevent_flush(); } seg_pos = segment; src_buf = data; remaining = size; do { TRACE_CATCH(result = ftape_read_segment(seg_pos, buffer, single ? FT_RD_SINGLE : FT_RD_AHEAD),); if (memcmp(src_buf, buffer, remaining > result ? result : remaining) != 0) { TRACE_ABORT(-EIO, ft_t_err, "Failed to verify written segment %d", seg_pos); } remaining -= result; TRACE(ft_t_noise, "verify successful:\n" KERN_INFO "segment : %d\n" KERN_INFO "segsize : %d\n" KERN_INFO "remaining: %d", seg_pos, result, remaining); src_buf += seg_sz; seg_pos++; } while (remaining > 0); TRACE_EXIT size; } /* zft_erase(). implemented compression-handling * * calculate the first data-segment when using/not using compression. * * update header-segment and compression-map-segment. */ int zft_erase(void) { int result = 0; TRACE_FUN(ft_t_flow); if (!zft_header_read) { TRACE_CATCH(zft_vmalloc_once((void **)&zft_hseg_buf, FT_SEGMENT_SIZE),); /* no need to read the vtbl and compression map */ TRACE_CATCH(ftape_read_header_segment(zft_hseg_buf),); if ((zft_old_ftape = zft_ftape_validate_label(&zft_hseg_buf[FT_LABEL]))) { zft_ftape_extract_file_marks(zft_hseg_buf); } TRACE(ft_t_noise, "ft_first_data_segment: %d, ft_last_data_segment: %d", ft_first_data_segment, ft_last_data_segment); zft_qic113 = (ft_format_code != fmt_normal && ft_format_code != fmt_1100ft && ft_format_code != fmt_425ft); } if (zft_old_ftape) { zft_clear_ftape_file_marks(); zft_old_ftape = 0; /* no longer old ftape */ } PUT2(zft_hseg_buf, FT_CMAP_START, 0); zft_volume_table_changed = 1; zft_capacity = zft_get_capacity(); zft_init_vtbl(); /* the rest must be done in ftape_update_header_segments */ zft_header_read = 1; zft_header_changed = 1; /* force update of timestamp */ result = zft_update_header_segments(); ftape_abort_operation(); zft_reset_position(&zft_pos); zft_set_flags (zft_unit); TRACE_EXIT result; } unsigned int zft_get_time(void) { unsigned int date = FT_TIME_STAMP(2097, 11, 30, 23, 59, 59); /* fun */ return date; } |