direct/test-framework/yaffs_ramem2k.c

   1 /*
   2  * YAFFS: Yet Another Flash File System. A NAND-flash specific file system.
   3  *
   4  * Copyright (C) 2002-2011 Aleph One Ltd.
   5  *   for Toby Churchill Ltd and Brightstar Engineering
   6  *
   7  * Created by Charles Manning <charles@aleph1.co.uk>
   8  *
   9  * This program is free software; you can redistribute it and/or modify
  10  * it under the terms of the GNU General Public License version 2 as
  11  * published by the Free Software Foundation.
  12  */
  13
  14 /*
  15  * yaffs_ramem2k.c: RAM emulation in-kernel for 2K pages (YAFFS2)
  16  */
  17
  18
  19 #ifndef __KERNEL__
  20 #define CONFIG_YAFFS_RAM_ENABLED
  21 #else
  22 #include <linux/config.h>
  23 #endif
  24
  25 #ifdef CONFIG_YAFFS_RAM_ENABLED
  26
  27 #include "yportenv.h"
  28 #include "yaffs_trace.h"
  29
  30 #include "yaffs_nandemul2k.h"
  31 #include "yaffs_guts.h"
  32 #include "yaffs_packedtags2.h"
  33
  34
  35
  36 #define EM_SIZE_IN_MEG (32)
  37 #define PAGE_DATA_SIZE  (2048)
  38 #define PAGE_SPARE_SIZE (64)
  39 #define PAGES_PER_BLOCK (64)
  40
  41
  42
  43 #define EM_SIZE_IN_BYTES (EM_SIZE_IN_MEG * (1<<20))
  44
  45 #define PAGE_TOTAL_SIZE (PAGE_DATA_SIZE+PAGE_SPARE_SIZE)
  46
  47 #define BLOCK_TOTAL_SIZE (PAGES_PER_BLOCK * PAGE_TOTAL_SIZE)
  48
  49 #define BLOCKS_PER_MEG ((1<<20)/(PAGES_PER_BLOCK * PAGE_DATA_SIZE))
  50
  51
  52 typedef struct
  53 {
  54         u8 data[PAGE_TOTAL_SIZE]; // Data + spare
  55         int empty;      // is this empty?
  56 } nandemul_Page;
  57
  58
  59 typedef struct
  60 {
  61         nandemul_Page *page[PAGES_PER_BLOCK];
  62         int damaged;
  63 } nandemul_Block;
  64
  65
  66
  67 typedef struct
  68 {
  69         nandemul_Block**block;
  70         int nBlocks;
  71 } nandemul_Device;
  72
  73 static nandemul_Device ned;
  74
  75 static int sizeInMB = EM_SIZE_IN_MEG;
  76
  77
  78 static void nandemul_yield(int n)
  79 {
  80 #ifdef __KERNEL__
  81         if(n > 0) schedule_timeout(n);
  82 #endif
  83
  84 }
  85
  86
  87 static void nandemul_ReallyEraseBlock(int blockNumber)
  88 {
  89         int i;
  90
  91         nandemul_Block *blk;
  92
  93         if(blockNumber < 0 || blockNumber >= ned.nBlocks)
  94         {
  95                 return;
  96         }
  97
  98         blk = ned.block[blockNumber];
  99
 100         for(i = 0; i < PAGES_PER_BLOCK; i++)
 101         {
 102                 memset(blk->page[i],0xff,sizeof(nandemul_Page));
 103                 blk->page[i]->empty = 1;
 104         }
 105         nandemul_yield(2);
 106 }
 107
 108
 109 static int nandemul2k_CalcNBlocks(void)
 110 {
 111         return EM_SIZE_IN_MEG * BLOCKS_PER_MEG;
 112 }
 113
 114
 115
 116 static int  CheckInit(void)
 117 {
 118         static int initialised = 0;
 119
 120         int i,j;
 121
 122         int fail = 0;
 123         int nBlocks;
 124
 125         int nAllocated = 0;
 126
 127         if(initialised)
 128         {
 129                 return YAFFS_OK;
 130         }
 131
 132
 133         ned.nBlocks = nBlocks = nandemul2k_CalcNBlocks();
 134
 135
 136         ned.block = malloc(sizeof(nandemul_Block*) * nBlocks );
 137
 138         if(!ned.block) return YAFFS_FAIL;
 139
 140
 141
 142
 143
 144         for(i=fail=0; i <nBlocks; i++)
 145         {
 146
 147                 nandemul_Block *blk;
 148
 149                 if(!(blk = ned.block[i] = malloc(sizeof(nandemul_Block))))
 150                 {
 151                  fail = 1;
 152                 }
 153                 else
 154                 {
 155                         for(j = 0; j < PAGES_PER_BLOCK; j++)
 156                         {
 157                                 if((blk->page[j] = malloc(sizeof(nandemul_Page))) == 0)
 158                                 {
 159                                         fail = 1;
 160                                 }
 161                         }
 162                         nandemul_ReallyEraseBlock(i);
 163                         ned.block[i]->damaged = 0;
 164                         nAllocated++;
 165                 }
 166         }
 167
 168         if(fail)
 169         {
 170                 //Todo thump pages
 171
 172                 for(i = 0; i < nAllocated; i++)
 173                 {
 174                         kfree(ned.block[i]);
 175                 }
 176                 kfree(ned.block);
 177
 178                 yaffs_trace(YAFFS_TRACE_ALWAYS,
 179                         "Allocation failed, could only allocate %dMB of %dMB requested.\n",
 180                         nAllocated/64,sizeInMB);
 181                 return 0;
 182         }
 183
 184         ned.nBlocks = nBlocks;
 185
 186         initialised = 1;
 187
 188         return 1;
 189 }
 190
 191 int nandemul2k_WriteChunkWithTagsToNAND(struct yaffs_dev *dev,int nand_chunk,const u8 *data, const struct yaffs_ext_tags *tags)
 192 {
 193         int blk;
 194         int pg;
 195         int i;
 196
 197         u8 *x;
 198
 199
 200         blk = nand_chunk/PAGES_PER_BLOCK;
 201         pg = nand_chunk%PAGES_PER_BLOCK;
 202
 203
 204         if(data)
 205         {
 206                 x = ned.block[blk]->page[pg]->data;
 207
 208                 for(i = 0; i < PAGE_DATA_SIZE; i++)
 209                 {
 210                         x[i] &=data[i];
 211                 }
 212
 213                 ned.block[blk]->page[pg]->empty = 0;
 214         }
 215
 216
 217         if(tags)
 218         {
 219                 x = &ned.block[blk]->page[pg]->data[PAGE_DATA_SIZE];
 220
 221                 yaffs_pack_tags2((struct yaffs_packed_tags2 *)x,tags, !dev->param.no_tags_ecc);
 222
 223         }
 224
 225         if(tags || data)
 226         {
 227                 nandemul_yield(1);
 228         }
 229
 230         return YAFFS_OK;
 231 }
 232
 233
 234 int nandemul2k_ReadChunkWithTagsFromNAND(struct yaffs_dev *dev,int nand_chunk, u8 *data, struct yaffs_ext_tags *tags)
 235 {
 236         int blk;
 237         int pg;
 238
 239         u8 *x;
 240
 241
 242
 243         blk = nand_chunk/PAGES_PER_BLOCK;
 244         pg = nand_chunk%PAGES_PER_BLOCK;
 245
 246
 247         if(data)
 248         {
 249                 memcpy(data,ned.block[blk]->page[pg]->data,PAGE_DATA_SIZE);
 250         }
 251
 252
 253         if(tags)
 254         {
 255                 x = &ned.block[blk]->page[pg]->data[PAGE_DATA_SIZE];
 256
 257                 yaffs_unpack_tags2(tags,(struct yaffs_packed_tags2 *)x, !dev->param.no_tags_ecc);
 258         }
 259
 260         return YAFFS_OK;
 261 }
 262
 263
 264 static int nandemul2k_CheckChunkErased(struct yaffs_dev *dev,int nand_chunk)
 265 {
 266         int blk;
 267         int pg;
 268         int i;
 269
 270
 271
 272         blk = nand_chunk/PAGES_PER_BLOCK;
 273         pg = nand_chunk%PAGES_PER_BLOCK;
 274
 275
 276         for(i = 0; i < PAGE_TOTAL_SIZE; i++)
 277         {
 278                 if(ned.block[blk]->page[pg]->data[i] != 0xFF)
 279                 {
 280                         return YAFFS_FAIL;
 281                 }
 282         }
 283
 284         return YAFFS_OK;
 285
 286 }
 287
 288 int nandemul2k_EraseBlockInNAND(struct yaffs_dev *dev, int blockNumber)
 289 {
 290
 291
 292         if(blockNumber < 0 || blockNumber >= ned.nBlocks)
 293         {
 294                 yaffs_trace(YAFFS_TRACE_ALWAYS,
 295                         "Attempt to erase non-existant block %d\n",
 296                         blockNumber);
 297         }
 298         else if(ned.block[blockNumber]->damaged)
 299         {
 300                 yaffs_trace(YAFFS_TRACE_ALWAYS,
 301                         "Attempt to erase damaged block %d\n",
 302                         blockNumber);
 303         }
 304         else
 305         {
 306                 nandemul_ReallyEraseBlock(blockNumber);
 307         }
 308
 309         return YAFFS_OK;
 310 }
 311
 312 int nandemul2k_InitialiseNAND(struct yaffs_dev *dev)
 313 {
 314         CheckInit();
 315         return YAFFS_OK;
 316 }
 317
 318 int nandemul2k_MarkNANDBlockBad(struct yaffs_dev *dev, int block_no)
 319 {
 320
 321         u8 *x;
 322
 323         x = &ned.block[block_no]->page[0]->data[PAGE_DATA_SIZE];
 324
 325         memset(x,0,sizeof(struct yaffs_packed_tags2));
 326
 327
 328         return YAFFS_OK;
 329
 330 }
 331
 332 int nandemul2k_QueryNANDBlock(struct yaffs_dev *dev, int block_no, enum yaffs_block_state *state, u32  *seq_number)
 333 {
 334         struct yaffs_ext_tags tags;
 335         int chunkNo;
 336
 337         *seq_number = 0;
 338
 339         chunkNo = block_no * dev->param.chunks_per_block;
 340
 341         nandemul2k_ReadChunkWithTagsFromNAND(dev,chunkNo,NULL,&tags);
 342         if(tags.block_bad)
 343         {
 344                 *state = YAFFS_BLOCK_STATE_DEAD;
 345         }
 346         else if(!tags.chunk_used)
 347         {
 348                 *state = YAFFS_BLOCK_STATE_EMPTY;
 349         }
 350         else if(tags.chunk_used)
 351         {
 352                 *state = YAFFS_BLOCK_STATE_NEEDS_SCAN;
 353                 *seq_number = tags.seq_number;
 354         }
 355         return YAFFS_OK;
 356 }
 357
 358 int nandemul2k_GetBytesPerChunk(void) { return PAGE_DATA_SIZE;}
 359
 360 int nandemul2k_GetChunksPerBlock(void) { return PAGES_PER_BLOCK; }
 361 int nandemul2k_GetNumberOfBlocks(void) {return nandemul2k_CalcNBlocks();}
 362
 363
 364 #endif //YAFFS_RAM_ENABLED
 365