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 | /* raid0.c : Multiple Devices driver for Linux Copyright (C) 1994-96 Marc ZYNGIER <zyngier@ufr-info-p7.ibp.fr> or <maz@gloups.fdn.fr> RAID-0 management functions. 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. You should have received a copy of the GNU General Public License (for example /usr/src/linux/COPYING); if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include <linux/module.h> #include <linux/md.h> #include <linux/raid0.h> #include <linux/malloc.h> #define MAJOR_NR MD_MAJOR #define MD_DRIVER #define MD_PERSONALITY static void create_strip_zones (int minor, struct md_dev *mddev) { int i, j, c=0; int current_offset=0; struct real_dev *smallest_by_zone; struct raid0_data *data=(struct raid0_data *) mddev->private; data->nr_strip_zones=1; for (i=1; i<mddev->nb_dev; i++) { for (j=0; j<i; j++) if (mddev->devices[i].size==mddev->devices[j].size) { c=1; break; } if (!c) data->nr_strip_zones++; c=0; } data->strip_zone=kmalloc (sizeof(struct strip_zone)*data->nr_strip_zones, GFP_KERNEL); data->smallest=NULL; for (i=0; i<data->nr_strip_zones; i++) { data->strip_zone[i].dev_offset=current_offset; smallest_by_zone=NULL; c=0; for (j=0; j<mddev->nb_dev; j++) if (mddev->devices[j].size>current_offset) { data->strip_zone[i].dev[c++]=mddev->devices+j; if (!smallest_by_zone || smallest_by_zone->size > mddev->devices[j].size) smallest_by_zone=mddev->devices+j; } data->strip_zone[i].nb_dev=c; data->strip_zone[i].size=(smallest_by_zone->size-current_offset)*c; if (!data->smallest || data->smallest->size > data->strip_zone[i].size) data->smallest=data->strip_zone+i; data->strip_zone[i].zone_offset=i ? (data->strip_zone[i-1].zone_offset+ data->strip_zone[i-1].size) : 0; current_offset=smallest_by_zone->size; } } static int raid0_run (int minor, struct md_dev *mddev) { int cur=0, i=0, size, zone0_size, nb_zone; struct raid0_data *data; MOD_INC_USE_COUNT; mddev->private=kmalloc (sizeof (struct raid0_data), GFP_KERNEL); data=(struct raid0_data *) mddev->private; create_strip_zones (minor, mddev); nb_zone=data->nr_zones= md_size[minor]/data->smallest->size + (md_size[minor]%data->smallest->size ? 1 : 0); data->hash_table=kmalloc (sizeof (struct raid0_hash)*nb_zone, GFP_KERNEL); size=data->strip_zone[cur].size; i=0; while (cur<data->nr_strip_zones) { data->hash_table[i].zone0=data->strip_zone+cur; if (size>=data->smallest->size)/* If we completely fill the slot */ { data->hash_table[i++].zone1=NULL; size-=data->smallest->size; if (!size) { if (++cur==data->nr_strip_zones) continue; size=data->strip_zone[cur].size; } continue; } if (++cur==data->nr_strip_zones) /* Last dev, set unit1 as NULL */ { data->hash_table[i].zone1=NULL; continue; } zone0_size=size; /* Here, we use a 2nd dev to fill the slot */ size=data->strip_zone[cur].size; data->hash_table[i++].zone1=data->strip_zone+cur; size-=(data->smallest->size - zone0_size); } return (0); } static int raid0_stop (int minor, struct md_dev *mddev) { struct raid0_data *data=(struct raid0_data *) mddev->private; kfree (data->hash_table); kfree (data->strip_zone); kfree (data); MOD_DEC_USE_COUNT; return 0; } /* * FIXME - We assume some things here : * - requested buffers NEVER bigger than chunk size, * - requested buffers NEVER cross stripes limits. * Of course, those facts may not be valid anymore (and surely won't...) * Hey guys, there's some work out there ;-) */ static int raid0_map (struct md_dev *mddev, kdev_t *rdev, unsigned long *rsector, unsigned long size) { struct raid0_data *data=(struct raid0_data *) mddev->private; static struct raid0_hash *hash; struct strip_zone *zone; struct real_dev *tmp_dev; int blk_in_chunk, factor, chunk, chunk_size; long block, rblock; factor=FACTOR(mddev); chunk_size=(1UL << FACTOR_SHIFT(factor)); block=*rsector >> 1; hash=data->hash_table+(block/data->smallest->size); /* Sanity check */ if ((chunk_size*2)<(*rsector % (chunk_size*2))+size) { printk ("raid0_convert : can't convert block across chunks or bigger than %dk %ld %ld\n", chunk_size, *rsector, size); return (-1); } if (block >= (hash->zone0->size + hash->zone0->zone_offset)) { if (!hash->zone1) { printk ("raid0_convert : hash->zone1==NULL for block %ld\n", block); return (-1); } zone=hash->zone1; } else zone=hash->zone0; blk_in_chunk=block & (chunk_size -1); chunk=(block - zone->zone_offset) / (zone->nb_dev<<FACTOR_SHIFT(factor)); tmp_dev=zone->dev[(block >> FACTOR_SHIFT(factor)) % zone->nb_dev]; rblock=(chunk << FACTOR_SHIFT(factor)) + blk_in_chunk + zone->dev_offset; *rdev=tmp_dev->dev; *rsector=rblock<<1; return (0); } static int raid0_status (char *page, int minor, struct md_dev *mddev) { int sz=0; #undef MD_DEBUG #ifdef MD_DEBUG int j, k; struct raid0_data *data=(struct raid0_data *) mddev->private; sz+=sprintf (page+sz, " "); for (j=0; j<data->nr_zones; j++) { sz+=sprintf (page+sz, "[z%d", data->hash_table[j].zone0-data->strip_zone); if (data->hash_table[j].zone1) sz+=sprintf (page+sz, "/z%d] ", data->hash_table[j].zone1-data->strip_zone); else sz+=sprintf (page+sz, "] "); } sz+=sprintf (page+sz, "\n"); for (j=0; j<data->nr_strip_zones; j++) { sz+=sprintf (page+sz, " z%d=[", j); for (k=0; k<data->strip_zone[j].nb_dev; k++) sz+=sprintf (page+sz, "%s/", partition_name(data->strip_zone[j].dev[k]->dev)); sz--; sz+=sprintf (page+sz, "] zo=%d do=%d s=%d\n", data->strip_zone[j].zone_offset, data->strip_zone[j].dev_offset, data->strip_zone[j].size); } #endif return sz; } static struct md_personality raid0_personality= { "raid0", raid0_map, raid0_run, raid0_stop, raid0_status, NULL, /* no ioctls */ 0 }; #ifndef MODULE void raid0_init (void) { register_md_personality (RAID0, &raid0_personality); } #else int init_module (void) { return (register_md_personality (RAID0, &raid0_personality)); } void cleanup_module (void) { unregister_md_personality (RAID0); } #endif |