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 | /* * linux/fs/ufs/util.c * * Copyright (C) 1998 * Daniel Pirkl <daniel.pirkl@email.cz> * Charles University, Faculty of Mathematics and Physics */ #include <linux/malloc.h> #include <linux/locks.h> #include "swab.h" #include "util.h" #undef UFS_UTILS_DEBUG #ifdef UFS_UTILS_DEBUG #define UFSD(x) printk("(%s, %d), %s: ", __FILE__, __LINE__, __FUNCTION__); printk x; #else #define UFSD(x) #endif struct ufs_buffer_head * _ubh_bread_ (struct ufs_sb_private_info * uspi, kdev_t dev, unsigned fragment, unsigned size) { struct ufs_buffer_head * ubh; unsigned i, j, count; if (size & ~uspi->s_fmask) return NULL; count = size >> uspi->s_fshift; if (count > UFS_MAXFRAG) return NULL; ubh = (struct ufs_buffer_head *) kmalloc (sizeof (struct ufs_buffer_head), GFP_KERNEL); if (!ubh) return NULL; ubh->fragment = fragment; ubh->count = count; for (i = 0; i < count; i++) if (!(ubh->bh[i] = bread (dev, fragment + i, uspi->s_fsize))) goto failed; for (; i < UFS_MAXFRAG; i++) ubh->bh[i] = NULL; return ubh; failed: for (j = 0; j < i; j++) brelse (ubh->bh[j]); return NULL; } struct ufs_buffer_head * _ubh_bread2_ (struct ufs_sb_private_info * uspi, kdev_t dev, unsigned fragment, unsigned size) { unsigned i, j, count; if (size & ~uspi->s_fmask) return NULL; count = size >> uspi->s_fshift; if (count <= 0 || count > UFS_MAXFRAG) return NULL; USPI_UBH->fragment = fragment; USPI_UBH->count = count; for (i = 0; i < count; i++) if (!(USPI_UBH->bh[i] = bread (dev, fragment + i, uspi->s_fsize))) goto failed; for (; i < UFS_MAXFRAG; i++) USPI_UBH->bh[i] = NULL; return USPI_UBH; failed: for (j = 0; j < i; j++) brelse (USPI_UBH->bh[j]); return NULL; } void ubh_brelse (struct ufs_buffer_head * ubh) { unsigned i; if (!ubh) return; for (i = 0; i < ubh->count; i++) brelse (ubh->bh[i]); kfree (ubh); } void ubh_brelse2 (struct ufs_buffer_head * ubh) { unsigned i; if (!ubh) return; for ( i = 0; i < ubh->count; i++ ) { brelse (ubh->bh[i]); ubh->bh[i] = NULL; } } void ubh_mark_buffer_dirty (struct ufs_buffer_head * ubh, int flag) { unsigned i; if (!ubh) return; for ( i = 0; i < ubh->count; i++ ) mark_buffer_dirty (ubh->bh[i], flag); } void ubh_mark_buffer_uptodate (struct ufs_buffer_head * ubh, int flag) { unsigned i; if (!ubh) return; for ( i = 0; i < ubh->count; i++ ) mark_buffer_uptodate (ubh->bh[i], flag); } void ubh_ll_rw_block (int rw, unsigned nr, struct ufs_buffer_head * ubh[]) { unsigned i; if (!ubh) return; for ( i = 0; i < nr; i++ ) ll_rw_block (rw, ubh[i]->count, ubh[i]->bh); } void ubh_wait_on_buffer (struct ufs_buffer_head * ubh) { unsigned i; if (!ubh) return; for ( i = 0; i < ubh->count; i++ ) wait_on_buffer (ubh->bh[i]); } unsigned ubh_max_bcount (struct ufs_buffer_head * ubh) { unsigned i; unsigned max = 0; if (!ubh) return 0; for ( i = 0; i < ubh->count; i++ ) if ( ubh->bh[i]->b_count > max ) max = ubh->bh[i]->b_count; if (max == 0) printk("Je cosi shnileho v kralovstvi Danskem!\n"); return max; } void ubh_bforget (struct ufs_buffer_head * ubh) { unsigned i; if (!ubh) return; for ( i = 0; i < ubh->count; i++ ) if ( ubh->bh[i] ) bforget (ubh->bh[i]); } int ubh_buffer_dirty (struct ufs_buffer_head * ubh) { unsigned i; unsigned result = 0; if (!ubh) return 0; for ( i = 0; i < ubh->count; i++ ) result |= buffer_dirty(ubh->bh[i]); return result; } void _ubh_ubhcpymem_(struct ufs_sb_private_info * uspi, unsigned char * mem, struct ufs_buffer_head * ubh, unsigned size) { unsigned len, bhno; if ( size > (ubh->count << uspi->s_fshift) ) size = ubh->count << uspi->s_fshift; bhno = 0; while ( size ) { len = min (size, uspi->s_fsize); memcpy (mem, ubh->bh[bhno]->b_data, len); mem += uspi->s_fsize; size -= len; bhno++; } } void _ubh_memcpyubh_(struct ufs_sb_private_info * uspi, struct ufs_buffer_head * ubh, unsigned char * mem, unsigned size) { unsigned len, bhno; if ( size > (ubh->count << uspi->s_fshift) ) size = ubh->count << uspi->s_fshift; bhno = 0; while ( size ) { len = min (size, uspi->s_fsize); memcpy (ubh->bh[bhno]->b_data, mem, len); mem += uspi->s_fsize; size -= len; bhno++; } } |