yaffs_guts.c

   1 /*
   2  * YAFFS: Yet Another Flash File System. A NAND-flash specific file system.
   3  *
   4  * Copyright (C) 2002-2007 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 const char *yaffs_guts_c_version =
  15     "$Id: yaffs_guts.c,v 1.116 2010-03-09 04:12:00 charles Exp $";
  16
  17 #include "yportenv.h"
  18 #include "yaffs_trace.h"
  19
  20 #include "yaffsinterface.h"
  21 #include "yaffs_guts.h"
  22 #include "yaffs_tagsvalidity.h"
  23 #include "yaffs_getblockinfo.h"
  24
  25 #include "yaffs_tagscompat.h"
  26 #ifndef CONFIG_YAFFS_USE_OWN_SORT
  27 #include "yaffs_qsort.h"
  28 #endif
  29 #include "yaffs_nand.h"
  30
  31 #include "yaffs_checkptrw.h"
  32
  33 #include "yaffs_nand.h"
  34 #include "yaffs_packedtags2.h"
  35
  36
  37 #define YAFFS_PASSIVE_GC_CHUNKS 2
  38
  39 #include "yaffs_ecc.h"
  40
  41
  42 /* Robustification (if it ever comes about...) */
  43 static void yaffs_RetireBlock(yaffs_Device *dev, int blockInNAND);
  44 static void yaffs_HandleWriteChunkError(yaffs_Device *dev, int chunkInNAND,
  45                 int erasedOk);
  46 static void yaffs_HandleWriteChunkOk(yaffs_Device *dev, int chunkInNAND,
  47                                 const __u8 *data,
  48                                 const yaffs_ExtendedTags *tags);
  49 static void yaffs_HandleUpdateChunk(yaffs_Device *dev, int chunkInNAND,
  50                                 const yaffs_ExtendedTags *tags);
  51
  52 /* Other local prototypes */
  53 static void yaffs_UpdateParent(yaffs_Object *obj);
  54 static int yaffs_UnlinkObject(yaffs_Object *obj);
  55 static int yaffs_ObjectHasCachedWriteData(yaffs_Object *obj);
  56
  57 static void yaffs_HardlinkFixup(yaffs_Device *dev, yaffs_Object *hardList);
  58
  59 static int yaffs_WriteNewChunkWithTagsToNAND(yaffs_Device *dev,
  60                                         const __u8 *buffer,
  61                                         yaffs_ExtendedTags *tags,
  62                                         int useReserve);
  63 static int yaffs_PutChunkIntoFile(yaffs_Object *in, int chunkInInode,
  64                                 int chunkInNAND, int inScan);
  65
  66 static yaffs_Object *yaffs_CreateNewObject(yaffs_Device *dev, int number,
  67                                         yaffs_ObjectType type);
  68 static void yaffs_AddObjectToDirectory(yaffs_Object *directory,
  69                                 yaffs_Object *obj);
  70 static int yaffs_UpdateObjectHeader(yaffs_Object *in, const YCHAR *name,
  71                                 int force, int isShrink, int shadows);
  72 static void yaffs_RemoveObjectFromDirectory(yaffs_Object *obj);
  73 static int yaffs_CheckStructures(void);
  74 static int yaffs_DeleteWorker(yaffs_Object *in, yaffs_Tnode *tn, __u32 level,
  75                         int chunkOffset, int *limit);
  76 static int yaffs_DoGenericObjectDeletion(yaffs_Object *in);
  77
  78 static yaffs_BlockInfo *yaffs_GetBlockInfo(yaffs_Device *dev, int blockNo);
  79
  80
  81 static int yaffs_CheckChunkErased(struct yaffs_DeviceStruct *dev,
  82                                 int chunkInNAND);
  83
  84 static int yaffs_UnlinkWorker(yaffs_Object *obj);
  85
  86 static int yaffs_TagsMatch(const yaffs_ExtendedTags *tags, int objectId,
  87                         int chunkInObject);
  88
  89 static int yaffs_AllocateChunk(yaffs_Device *dev, int useReserve,
  90                                 yaffs_BlockInfo **blockUsedPtr);
  91
  92 static void yaffs_VerifyFreeChunks(yaffs_Device *dev);
  93
  94 static void yaffs_CheckObjectDetailsLoaded(yaffs_Object *in);
  95
  96 static void yaffs_VerifyDirectory(yaffs_Object *directory);
  97 #ifdef YAFFS_PARANOID
  98 static int yaffs_CheckFileSanity(yaffs_Object *in);
  99 #else
 100 #define yaffs_CheckFileSanity(in)
 101 #endif
 102
 103 static void yaffs_InvalidateWholeChunkCache(yaffs_Object *in);
 104 static void yaffs_InvalidateChunkCache(yaffs_Object *object, int chunkId);
 105
 106 static void yaffs_InvalidateCheckpoint(yaffs_Device *dev);
 107
 108 static int yaffs_FindChunkInFile(yaffs_Object *in, int chunkInInode,
 109                                 yaffs_ExtendedTags *tags);
 110
 111 static __u32 yaffs_GetChunkGroupBase(yaffs_Device *dev, yaffs_Tnode *tn,
 112                 unsigned pos);
 113 static yaffs_Tnode *yaffs_FindLevel0Tnode(yaffs_Device *dev,
 114                                         yaffs_FileStructure *fStruct,
 115                                         __u32 chunkId);
 116
 117 static void yaffs_SkipRestOfBlock(yaffs_Device *dev);
 118 static int yaffs_VerifyChunkWritten(yaffs_Device *dev,
 119                                         int chunkInNAND,
 120                                         const __u8 *data,
 121                                         yaffs_ExtendedTags *tags);
 122
 123 /* Function to calculate chunk and offset */
 124
 125 static void yaffs_AddrToChunk(yaffs_Device *dev, loff_t addr, int *chunkOut,
 126                 __u32 *offsetOut)
 127 {
 128         int chunk;
 129         __u32 offset;
 130
 131         chunk  = (__u32)(addr >> dev->chunkShift);
 132
 133         if (dev->chunkDiv == 1) {
 134                 /* easy power of 2 case */
 135                 offset = (__u32)(addr & dev->chunkMask);
 136         } else {
 137                 /* Non power-of-2 case */
 138
 139                 loff_t chunkBase;
 140
 141                 chunk /= dev->chunkDiv;
 142
 143                 chunkBase = ((loff_t)chunk) * dev->nDataBytesPerChunk;
 144                 offset = (__u32)(addr - chunkBase);
 145         }
 146
 147         *chunkOut = chunk;
 148         *offsetOut = offset;
 149 }
 150
 151 /* Function to return the number of shifts for a power of 2 greater than or
 152  * equal to the given number
 153  * Note we don't try to cater for all possible numbers and this does not have to
 154  * be hellishly efficient.
 155  */
 156
 157 static __u32 ShiftsGE(__u32 x)
 158 {
 159         int extraBits;
 160         int nShifts;
 161
 162         nShifts = extraBits = 0;
 163
 164         while (x > 1) {
 165                 if (x & 1)
 166                         extraBits++;
 167                 x >>= 1;
 168                 nShifts++;
 169         }
 170
 171         if (extraBits)
 172                 nShifts++;
 173
 174         return nShifts;
 175 }
 176
 177 /* Function to return the number of shifts to get a 1 in bit 0
 178  */
 179
 180 static __u32 Shifts(__u32 x)
 181 {
 182         int nShifts;
 183
 184         nShifts =  0;
 185
 186         if (!x)
 187                 return 0;
 188
 189         while (!(x&1)) {
 190                 x >>= 1;
 191                 nShifts++;
 192         }
 193
 194         return nShifts;
 195 }
 196
 197
 198
 199 /*
 200  * Temporary buffer manipulations.
 201  */
 202
 203 static int yaffs_InitialiseTempBuffers(yaffs_Device *dev)
 204 {
 205         int i;
 206         __u8 *buf = (__u8 *)1;
 207
 208         memset(dev->tempBuffer, 0, sizeof(dev->tempBuffer));
 209
 210         for (i = 0; buf && i < YAFFS_N_TEMP_BUFFERS; i++) {
 211                 dev->tempBuffer[i].line = 0;    /* not in use */
 212                 dev->tempBuffer[i].buffer = buf =
 213                     YMALLOC_DMA(dev->param.totalBytesPerChunk);
 214         }
 215
 216         return buf ? YAFFS_OK : YAFFS_FAIL;
 217 }
 218
 219 __u8 *yaffs_GetTempBuffer(yaffs_Device *dev, int lineNo)
 220 {
 221         int i, j;
 222
 223         dev->tempInUse++;
 224         if (dev->tempInUse > dev->maxTemp)
 225                 dev->maxTemp = dev->tempInUse;
 226
 227         for (i = 0; i < YAFFS_N_TEMP_BUFFERS; i++) {
 228                 if (dev->tempBuffer[i].line == 0) {
 229                         dev->tempBuffer[i].line = lineNo;
 230                         if ((i + 1) > dev->maxTemp) {
 231                                 dev->maxTemp = i + 1;
 232                                 for (j = 0; j <= i; j++)
 233                                         dev->tempBuffer[j].maxLine =
 234                                             dev->tempBuffer[j].line;
 235                         }
 236
 237                         return dev->tempBuffer[i].buffer;
 238                 }
 239         }
 240
 241         T(YAFFS_TRACE_BUFFERS,
 242           (TSTR("Out of temp buffers at line %d, other held by lines:"),
 243            lineNo));
 244         for (i = 0; i < YAFFS_N_TEMP_BUFFERS; i++)
 245                 T(YAFFS_TRACE_BUFFERS, (TSTR(" %d "), dev->tempBuffer[i].line));
 246
 247         T(YAFFS_TRACE_BUFFERS, (TSTR(" " TENDSTR)));
 248
 249         /*
 250          * If we got here then we have to allocate an unmanaged one
 251          * This is not good.
 252          */
 253
 254         dev->unmanagedTempAllocations++;
 255         return YMALLOC(dev->nDataBytesPerChunk);
 256
 257 }
 258
 259 void yaffs_ReleaseTempBuffer(yaffs_Device *dev, __u8 *buffer,
 260                                     int lineNo)
 261 {
 262         int i;
 263
 264         dev->tempInUse--;
 265
 266         for (i = 0; i < YAFFS_N_TEMP_BUFFERS; i++) {
 267                 if (dev->tempBuffer[i].buffer == buffer) {
 268                         dev->tempBuffer[i].line = 0;
 269                         return;
 270                 }
 271         }
 272
 273         if (buffer) {
 274                 /* assume it is an unmanaged one. */
 275                 T(YAFFS_TRACE_BUFFERS,
 276                   (TSTR("Releasing unmanaged temp buffer in line %d" TENDSTR),
 277                    lineNo));
 278                 YFREE(buffer);
 279                 dev->unmanagedTempDeallocations++;
 280         }
 281
 282 }
 283
 284 /*
 285  * Determine if we have a managed buffer.
 286  */
 287 int yaffs_IsManagedTempBuffer(yaffs_Device *dev, const __u8 *buffer)
 288 {
 289         int i;
 290
 291         for (i = 0; i < YAFFS_N_TEMP_BUFFERS; i++) {
 292                 if (dev->tempBuffer[i].buffer == buffer)
 293                         return 1;
 294         }
 295
 296         for (i = 0; i < dev->param.nShortOpCaches; i++) {
 297                 if (dev->srCache[i].data == buffer)
 298                         return 1;
 299         }
 300
 301         if (buffer == dev->checkpointBuffer)
 302                 return 1;
 303
 304         T(YAFFS_TRACE_ALWAYS,
 305                 (TSTR("yaffs: unmaged buffer detected.\n" TENDSTR)));
 306         return 0;
 307 }
 308
 309
 310
 311 /*
 312  * Chunk bitmap manipulations
 313  */
 314
 315 static Y_INLINE __u8 *yaffs_BlockBits(yaffs_Device *dev, int blk)
 316 {
 317         if (blk < dev->internalStartBlock || blk > dev->internalEndBlock) {
 318                 T(YAFFS_TRACE_ERROR,
 319                         (TSTR("**>> yaffs: BlockBits block %d is not valid" TENDSTR),
 320                         blk));
 321                 YBUG();
 322         }
 323         return dev->chunkBits +
 324                 (dev->chunkBitmapStride * (blk - dev->internalStartBlock));
 325 }
 326
 327 static Y_INLINE void yaffs_VerifyChunkBitId(yaffs_Device *dev, int blk, int chunk)
 328 {
 329         if (blk < dev->internalStartBlock || blk > dev->internalEndBlock ||
 330                         chunk < 0 || chunk >= dev->param.nChunksPerBlock) {
 331                 T(YAFFS_TRACE_ERROR,
 332                 (TSTR("**>> yaffs: Chunk Id (%d:%d) invalid"TENDSTR),
 333                         blk, chunk));
 334                 YBUG();
 335         }
 336 }
 337
 338 static Y_INLINE void yaffs_ClearChunkBits(yaffs_Device *dev, int blk)
 339 {
 340         __u8 *blkBits = yaffs_BlockBits(dev, blk);
 341
 342         memset(blkBits, 0, dev->chunkBitmapStride);
 343 }
 344
 345 static Y_INLINE void yaffs_ClearChunkBit(yaffs_Device *dev, int blk, int chunk)
 346 {
 347         __u8 *blkBits = yaffs_BlockBits(dev, blk);
 348
 349         yaffs_VerifyChunkBitId(dev, blk, chunk);
 350
 351         blkBits[chunk / 8] &= ~(1 << (chunk & 7));
 352 }
 353
 354 static Y_INLINE void yaffs_SetChunkBit(yaffs_Device *dev, int blk, int chunk)
 355 {
 356         __u8 *blkBits = yaffs_BlockBits(dev, blk);
 357
 358         yaffs_VerifyChunkBitId(dev, blk, chunk);
 359
 360         blkBits[chunk / 8] |= (1 << (chunk & 7));
 361 }
 362
 363 static Y_INLINE int yaffs_CheckChunkBit(yaffs_Device *dev, int blk, int chunk)
 364 {
 365         __u8 *blkBits = yaffs_BlockBits(dev, blk);
 366         yaffs_VerifyChunkBitId(dev, blk, chunk);
 367
 368         return (blkBits[chunk / 8] & (1 << (chunk & 7))) ? 1 : 0;
 369 }
 370
 371 static Y_INLINE int yaffs_StillSomeChunkBits(yaffs_Device *dev, int blk)
 372 {
 373         __u8 *blkBits = yaffs_BlockBits(dev, blk);
 374         int i;
 375         for (i = 0; i < dev->chunkBitmapStride; i++) {
 376                 if (*blkBits)
 377                         return 1;
 378                 blkBits++;
 379         }
 380         return 0;
 381 }
 382
 383 static int yaffs_CountChunkBits(yaffs_Device *dev, int blk)
 384 {
 385         __u8 *blkBits = yaffs_BlockBits(dev, blk);
 386         int i;
 387         int n = 0;
 388         for (i = 0; i < dev->chunkBitmapStride; i++) {
 389                 __u8 x = *blkBits;
 390                 while (x) {
 391                         if (x & 1)
 392                                 n++;
 393                         x >>= 1;
 394                 }
 395
 396                 blkBits++;
 397         }
 398         return n;
 399 }
 400
 401 /*
 402  * Verification code
 403  */
 404
 405 static int yaffs_SkipVerification(yaffs_Device *dev)
 406 {
 407         dev=dev;
 408         return !(yaffs_traceMask & (YAFFS_TRACE_VERIFY | YAFFS_TRACE_VERIFY_FULL));
 409 }
 410
 411 static int yaffs_SkipFullVerification(yaffs_Device *dev)
 412 {
 413         dev=dev;
 414         return !(yaffs_traceMask & (YAFFS_TRACE_VERIFY_FULL));
 415 }
 416
 417 static int yaffs_SkipNANDVerification(yaffs_Device *dev)
 418 {
 419         dev=dev;
 420         return !(yaffs_traceMask & (YAFFS_TRACE_VERIFY_NAND));
 421 }
 422
 423 static const char *blockStateName[] = {
 424 "Unknown",
 425 "Needs scanning",
 426 "Scanning",
 427 "Empty",
 428 "Allocating",
 429 "Full",
 430 "Dirty",
 431 "Checkpoint",
 432 "Collecting",
 433 "Dead"
 434 };
 435
 436 static void yaffs_VerifyBlock(yaffs_Device *dev, yaffs_BlockInfo *bi, int n)
 437 {
 438         int actuallyUsed;
 439         int inUse;
 440
 441         if (yaffs_SkipVerification(dev))
 442                 return;
 443
 444         /* Report illegal runtime states */
 445         if (bi->blockState >= YAFFS_NUMBER_OF_BLOCK_STATES)
 446                 T(YAFFS_TRACE_VERIFY, (TSTR("Block %d has undefined state %d"TENDSTR), n, bi->blockState));
 447
 448         switch (bi->blockState) {
 449         case YAFFS_BLOCK_STATE_UNKNOWN:
 450         case YAFFS_BLOCK_STATE_SCANNING:
 451         case YAFFS_BLOCK_STATE_NEEDS_SCANNING:
 452                 T(YAFFS_TRACE_VERIFY, (TSTR("Block %d has bad run-state %s"TENDSTR),
 453                 n, blockStateName[bi->blockState]));
 454         }
 455
 456         /* Check pages in use and soft deletions are legal */
 457
 458         actuallyUsed = bi->pagesInUse - bi->softDeletions;
 459
 460         if (bi->pagesInUse < 0 || bi->pagesInUse > dev->param.nChunksPerBlock ||
 461            bi->softDeletions < 0 || bi->softDeletions > dev->param.nChunksPerBlock ||
 462            actuallyUsed < 0 || actuallyUsed > dev->param.nChunksPerBlock)
 463                 T(YAFFS_TRACE_VERIFY, (TSTR("Block %d has illegal values pagesInUsed %d softDeletions %d"TENDSTR),
 464                 n, bi->pagesInUse, bi->softDeletions));
 465
 466
 467         /* Check chunk bitmap legal */
 468         inUse = yaffs_CountChunkBits(dev, n);
 469         if (inUse != bi->pagesInUse)
 470                 T(YAFFS_TRACE_VERIFY, (TSTR("Block %d has inconsistent values pagesInUse %d counted chunk bits %d"TENDSTR),
 471                         n, bi->pagesInUse, inUse));
 472
 473         /* Check that the sequence number is valid.
 474          * Ten million is legal, but is very unlikely
 475          */
 476         if (dev->param.isYaffs2 &&
 477            (bi->blockState == YAFFS_BLOCK_STATE_ALLOCATING || bi->blockState == YAFFS_BLOCK_STATE_FULL) &&
 478            (bi->sequenceNumber < YAFFS_LOWEST_SEQUENCE_NUMBER || bi->sequenceNumber > 10000000))
 479                 T(YAFFS_TRACE_VERIFY, (TSTR("Block %d has suspect sequence number of %d"TENDSTR),
 480                 n, bi->sequenceNumber));
 481 }
 482
 483 static void yaffs_VerifyCollectedBlock(yaffs_Device *dev, yaffs_BlockInfo *bi,
 484                 int n)
 485 {
 486         yaffs_VerifyBlock(dev, bi, n);
 487
 488         /* After collection the block should be in the erased state */
 489         /* This will need to change if we do partial gc */
 490
 491         if (bi->blockState != YAFFS_BLOCK_STATE_COLLECTING &&
 492                         bi->blockState != YAFFS_BLOCK_STATE_EMPTY) {
 493                 T(YAFFS_TRACE_ERROR, (TSTR("Block %d is in state %d after gc, should be erased"TENDSTR),
 494                         n, bi->blockState));
 495         }
 496 }
 497
 498 static void yaffs_VerifyBlocks(yaffs_Device *dev)
 499 {
 500         int i;
 501         int nBlocksPerState[YAFFS_NUMBER_OF_BLOCK_STATES];
 502         int nIllegalBlockStates = 0;
 503
 504         if (yaffs_SkipVerification(dev))
 505                 return;
 506
 507         memset(nBlocksPerState, 0, sizeof(nBlocksPerState));
 508
 509         for (i = dev->internalStartBlock; i <= dev->internalEndBlock; i++) {
 510                 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, i);
 511                 yaffs_VerifyBlock(dev, bi, i);
 512
 513                 if (bi->blockState < YAFFS_NUMBER_OF_BLOCK_STATES)
 514                         nBlocksPerState[bi->blockState]++;
 515                 else
 516                         nIllegalBlockStates++;
 517         }
 518
 519         T(YAFFS_TRACE_VERIFY, (TSTR(""TENDSTR)));
 520         T(YAFFS_TRACE_VERIFY, (TSTR("Block summary"TENDSTR)));
 521
 522         T(YAFFS_TRACE_VERIFY, (TSTR("%d blocks have illegal states"TENDSTR), nIllegalBlockStates));
 523         if (nBlocksPerState[YAFFS_BLOCK_STATE_ALLOCATING] > 1)
 524                 T(YAFFS_TRACE_VERIFY, (TSTR("Too many allocating blocks"TENDSTR)));
 525
 526         for (i = 0; i < YAFFS_NUMBER_OF_BLOCK_STATES; i++)
 527                 T(YAFFS_TRACE_VERIFY,
 528                   (TSTR("%s %d blocks"TENDSTR),
 529                   blockStateName[i], nBlocksPerState[i]));
 530
 531         if (dev->blocksInCheckpoint != nBlocksPerState[YAFFS_BLOCK_STATE_CHECKPOINT])
 532                 T(YAFFS_TRACE_VERIFY,
 533                  (TSTR("Checkpoint block count wrong dev %d count %d"TENDSTR),
 534                  dev->blocksInCheckpoint, nBlocksPerState[YAFFS_BLOCK_STATE_CHECKPOINT]));
 535
 536         if (dev->nErasedBlocks != nBlocksPerState[YAFFS_BLOCK_STATE_EMPTY])
 537                 T(YAFFS_TRACE_VERIFY,
 538                  (TSTR("Erased block count wrong dev %d count %d"TENDSTR),
 539                  dev->nErasedBlocks, nBlocksPerState[YAFFS_BLOCK_STATE_EMPTY]));
 540
 541         if (nBlocksPerState[YAFFS_BLOCK_STATE_COLLECTING] > 1)
 542                 T(YAFFS_TRACE_VERIFY,
 543                  (TSTR("Too many collecting blocks %d (max is 1)"TENDSTR),
 544                  nBlocksPerState[YAFFS_BLOCK_STATE_COLLECTING]));
 545
 546         T(YAFFS_TRACE_VERIFY, (TSTR(""TENDSTR)));
 547
 548 }
 549
 550 /*
 551  * Verify the object header. oh must be valid, but obj and tags may be NULL in which
 552  * case those tests will not be performed.
 553  */
 554 static void yaffs_VerifyObjectHeader(yaffs_Object *obj, yaffs_ObjectHeader *oh, yaffs_ExtendedTags *tags, int parentCheck)
 555 {
 556         if (obj && yaffs_SkipVerification(obj->myDev))
 557                 return;
 558
 559         if (!(tags && obj && oh)) {
 560                 T(YAFFS_TRACE_VERIFY,
 561                                 (TSTR("Verifying object header tags %p obj %p oh %p"TENDSTR),
 562                                 tags, obj, oh));
 563                 return;
 564         }
 565
 566         if (oh->type <= YAFFS_OBJECT_TYPE_UNKNOWN ||
 567                         oh->type > YAFFS_OBJECT_TYPE_MAX)
 568                 T(YAFFS_TRACE_VERIFY,
 569                         (TSTR("Obj %d header type is illegal value 0x%x"TENDSTR),
 570                         tags->objectId, oh->type));
 571
 572         if (tags->objectId != obj->objectId)
 573                 T(YAFFS_TRACE_VERIFY,
 574                         (TSTR("Obj %d header mismatch objectId %d"TENDSTR),
 575                         tags->objectId, obj->objectId));
 576
 577
 578         /*
 579          * Check that the object's parent ids match if parentCheck requested.
 580          *
 581          * Tests do not apply to the root object.
 582          */
 583
 584         if (parentCheck && tags->objectId > 1 && !obj->parent)
 585                 T(YAFFS_TRACE_VERIFY,
 586                         (TSTR("Obj %d header mismatch parentId %d obj->parent is NULL"TENDSTR),
 587                         tags->objectId, oh->parentObjectId));
 588
 589         if (parentCheck && obj->parent &&
 590                         oh->parentObjectId != obj->parent->objectId &&
 591                         (oh->parentObjectId != YAFFS_OBJECTID_UNLINKED ||
 592                         obj->parent->objectId != YAFFS_OBJECTID_DELETED))
 593                 T(YAFFS_TRACE_VERIFY,
 594                         (TSTR("Obj %d header mismatch parentId %d parentObjectId %d"TENDSTR),
 595                         tags->objectId, oh->parentObjectId, obj->parent->objectId));
 596
 597         if (tags->objectId > 1 && oh->name[0] == 0) /* Null name */
 598                 T(YAFFS_TRACE_VERIFY,
 599                         (TSTR("Obj %d header name is NULL"TENDSTR),
 600                         obj->objectId));
 601
 602         if (tags->objectId > 1 && ((__u8)(oh->name[0])) == 0xff) /* Trashed name */
 603                 T(YAFFS_TRACE_VERIFY,
 604                         (TSTR("Obj %d header name is 0xFF"TENDSTR),
 605                         obj->objectId));
 606 }
 607
 608
 609
 610 static int yaffs_VerifyTnodeWorker(yaffs_Object *obj, yaffs_Tnode *tn,
 611                                         __u32 level, int chunkOffset)
 612 {
 613         int i;
 614         yaffs_Device *dev = obj->myDev;
 615         int ok = 1;
 616
 617         if (tn) {
 618                 if (level > 0) {
 619
 620                         for (i = 0; i < YAFFS_NTNODES_INTERNAL && ok; i++) {
 621                                 if (tn->internal[i]) {
 622                                         ok = yaffs_VerifyTnodeWorker(obj,
 623                                                         tn->internal[i],
 624                                                         level - 1,
 625                                                         (chunkOffset<<YAFFS_TNODES_INTERNAL_BITS) + i);
 626                                 }
 627                         }
 628                 } else if (level == 0) {
 629                         yaffs_ExtendedTags tags;
 630                         __u32 objectId = obj->objectId;
 631
 632                         chunkOffset <<=  YAFFS_TNODES_LEVEL0_BITS;
 633
 634                         for (i = 0; i < YAFFS_NTNODES_LEVEL0; i++) {
 635                                 __u32 theChunk = yaffs_GetChunkGroupBase(dev, tn, i);
 636
 637                                 if (theChunk > 0) {
 638                                         /* T(~0,(TSTR("verifying (%d:%d) %d"TENDSTR),tags.objectId,tags.chunkId,theChunk)); */
 639                                         yaffs_ReadChunkWithTagsFromNAND(dev, theChunk, NULL, &tags);
 640                                         if (tags.objectId != objectId || tags.chunkId != chunkOffset) {
 641                                                 T(~0, (TSTR("Object %d chunkId %d NAND mismatch chunk %d tags (%d:%d)"TENDSTR),
 642                                                         objectId, chunkOffset, theChunk,
 643                                                         tags.objectId, tags.chunkId));
 644                                         }
 645                                 }
 646                                 chunkOffset++;
 647                         }
 648                 }
 649         }
 650
 651         return ok;
 652
 653 }
 654
 655
 656 static void yaffs_VerifyFile(yaffs_Object *obj)
 657 {
 658         int requiredTallness;
 659         int actualTallness;
 660         __u32 lastChunk;
 661         __u32 x;
 662         __u32 i;
 663         yaffs_Device *dev;
 664         yaffs_ExtendedTags tags;
 665         yaffs_Tnode *tn;
 666         __u32 objectId;
 667
 668         if (!obj)
 669                 return;
 670
 671         if (yaffs_SkipVerification(obj->myDev))
 672                 return;
 673
 674         dev = obj->myDev;
 675         objectId = obj->objectId;
 676
 677         /* Check file size is consistent with tnode depth */
 678         lastChunk =  obj->variant.fileVariant.fileSize / dev->nDataBytesPerChunk + 1;
 679         x = lastChunk >> YAFFS_TNODES_LEVEL0_BITS;
 680         requiredTallness = 0;
 681         while (x > 0) {
 682                 x >>= YAFFS_TNODES_INTERNAL_BITS;
 683                 requiredTallness++;
 684         }
 685
 686         actualTallness = obj->variant.fileVariant.topLevel;
 687
 688         /* Check that the chunks in the tnode tree are all correct.
 689          * We do this by scanning through the tnode tree and
 690          * checking the tags for every chunk match.
 691          */
 692
 693         if (yaffs_SkipNANDVerification(dev))
 694                 return;
 695
 696         for (i = 1; i <= lastChunk; i++) {
 697                 tn = yaffs_FindLevel0Tnode(dev, &obj->variant.fileVariant, i);
 698
 699                 if (tn) {
 700                         __u32 theChunk = yaffs_GetChunkGroupBase(dev, tn, i);
 701                         if (theChunk > 0) {
 702                                 /* T(~0,(TSTR("verifying (%d:%d) %d"TENDSTR),objectId,i,theChunk)); */
 703                                 yaffs_ReadChunkWithTagsFromNAND(dev, theChunk, NULL, &tags);
 704                                 if (tags.objectId != objectId || tags.chunkId != i) {
 705                                         T(~0, (TSTR("Object %d chunkId %d NAND mismatch chunk %d tags (%d:%d)"TENDSTR),
 706                                                 objectId, i, theChunk,
 707                                                 tags.objectId, tags.chunkId));
 708                                 }
 709                         }
 710                 }
 711         }
 712 }
 713
 714
 715 static void yaffs_VerifyHardLink(yaffs_Object *obj)
 716 {
 717         if (obj && yaffs_SkipVerification(obj->myDev))
 718                 return;
 719
 720         /* Verify sane equivalent object */
 721 }
 722
 723 static void yaffs_VerifySymlink(yaffs_Object *obj)
 724 {
 725         if (obj && yaffs_SkipVerification(obj->myDev))
 726                 return;
 727
 728         /* Verify symlink string */
 729 }
 730
 731 static void yaffs_VerifySpecial(yaffs_Object *obj)
 732 {
 733         if (obj && yaffs_SkipVerification(obj->myDev))
 734                 return;
 735 }
 736
 737 static void yaffs_VerifyObject(yaffs_Object *obj)
 738 {
 739         yaffs_Device *dev;
 740
 741         __u32 chunkMin;
 742         __u32 chunkMax;
 743
 744         __u32 chunkIdOk;
 745         __u32 chunkInRange;
 746         __u32 chunkShouldNotBeDeleted;
 747         __u32 chunkValid;
 748
 749         if (!obj)
 750                 return;
 751
 752         if (obj->beingCreated)
 753                 return;
 754
 755         dev = obj->myDev;
 756
 757         if (yaffs_SkipVerification(dev))
 758                 return;
 759
 760         /* Check sane object header chunk */
 761
 762         chunkMin = dev->internalStartBlock * dev->param.nChunksPerBlock;
 763         chunkMax = (dev->internalEndBlock+1) * dev->param.nChunksPerBlock - 1;
 764
 765         chunkInRange = (((unsigned)(obj->hdrChunk)) >= chunkMin && ((unsigned)(obj->hdrChunk)) <= chunkMax);
 766         chunkIdOk = chunkInRange || (obj->hdrChunk == 0);
 767         chunkValid = chunkInRange &&
 768                         yaffs_CheckChunkBit(dev,
 769                                         obj->hdrChunk / dev->param.nChunksPerBlock,
 770                                         obj->hdrChunk % dev->param.nChunksPerBlock);
 771         chunkShouldNotBeDeleted = chunkInRange && !chunkValid;
 772
 773         if (!obj->fake &&
 774                         (!chunkIdOk || chunkShouldNotBeDeleted)) {
 775                 T(YAFFS_TRACE_VERIFY,
 776                         (TSTR("Obj %d has chunkId %d %s %s"TENDSTR),
 777                         obj->objectId, obj->hdrChunk,
 778                         chunkIdOk ? "" : ",out of range",
 779                         chunkShouldNotBeDeleted ? ",marked as deleted" : ""));
 780         }
 781
 782         if (chunkValid && !yaffs_SkipNANDVerification(dev)) {
 783                 yaffs_ExtendedTags tags;
 784                 yaffs_ObjectHeader *oh;
 785                 __u8 *buffer = yaffs_GetTempBuffer(dev, __LINE__);
 786
 787                 oh = (yaffs_ObjectHeader *)buffer;
 788
 789                 yaffs_ReadChunkWithTagsFromNAND(dev, obj->hdrChunk, buffer,
 790                                 &tags);
 791
 792                 yaffs_VerifyObjectHeader(obj, oh, &tags, 1);
 793
 794                 yaffs_ReleaseTempBuffer(dev, buffer, __LINE__);
 795         }
 796
 797         /* Verify it has a parent */
 798         if (obj && !obj->fake &&
 799                         (!obj->parent || obj->parent->myDev != dev)) {
 800                 T(YAFFS_TRACE_VERIFY,
 801                         (TSTR("Obj %d has parent pointer %p which does not look like an object"TENDSTR),
 802                         obj->objectId, obj->parent));
 803         }
 804
 805         /* Verify parent is a directory */
 806         if (obj->parent && obj->parent->variantType != YAFFS_OBJECT_TYPE_DIRECTORY) {
 807                 T(YAFFS_TRACE_VERIFY,
 808                         (TSTR("Obj %d's parent is not a directory (type %d)"TENDSTR),
 809                         obj->objectId, obj->parent->variantType));
 810         }
 811
 812         switch (obj->variantType) {
 813         case YAFFS_OBJECT_TYPE_FILE:
 814                 yaffs_VerifyFile(obj);
 815                 break;
 816         case YAFFS_OBJECT_TYPE_SYMLINK:
 817                 yaffs_VerifySymlink(obj);
 818                 break;
 819         case YAFFS_OBJECT_TYPE_DIRECTORY:
 820                 yaffs_VerifyDirectory(obj);
 821                 break;
 822         case YAFFS_OBJECT_TYPE_HARDLINK:
 823                 yaffs_VerifyHardLink(obj);
 824                 break;
 825         case YAFFS_OBJECT_TYPE_SPECIAL:
 826                 yaffs_VerifySpecial(obj);
 827                 break;
 828         case YAFFS_OBJECT_TYPE_UNKNOWN:
 829         default:
 830                 T(YAFFS_TRACE_VERIFY,
 831                 (TSTR("Obj %d has illegaltype %d"TENDSTR),
 832                 obj->objectId, obj->variantType));
 833                 break;
 834         }
 835 }
 836
 837 static void yaffs_VerifyObjects(yaffs_Device *dev)
 838 {
 839         yaffs_Object *obj;
 840         int i;
 841         struct ylist_head *lh;
 842
 843         if (yaffs_SkipVerification(dev))
 844                 return;
 845
 846         /* Iterate through the objects in each hash entry */
 847
 848         for (i = 0; i <  YAFFS_NOBJECT_BUCKETS; i++) {
 849                 ylist_for_each(lh, &dev->objectBucket[i].list) {
 850                         if (lh) {
 851                                 obj = ylist_entry(lh, yaffs_Object, hashLink);
 852                                 yaffs_VerifyObject(obj);
 853                         }
 854                 }
 855         }
 856 }
 857
 858
 859 /*
 860  *  Simple hash function. Needs to have a reasonable spread
 861  */
 862
 863 static Y_INLINE int yaffs_HashFunction(int n)
 864 {
 865         n = abs(n);
 866         return n % YAFFS_NOBJECT_BUCKETS;
 867 }
 868
 869 /*
 870  * Access functions to useful fake objects.
 871  * Note that root might have a presence in NAND if permissions are set.
 872  */
 873
 874 yaffs_Object *yaffs_Root(yaffs_Device *dev)
 875 {
 876         return dev->rootDir;
 877 }
 878
 879 yaffs_Object *yaffs_LostNFound(yaffs_Device *dev)
 880 {
 881         return dev->lostNFoundDir;
 882 }
 883
 884
 885 /*
 886  *  Erased NAND checking functions
 887  */
 888
 889 int yaffs_CheckFF(__u8 *buffer, int nBytes)
 890 {
 891         /* Horrible, slow implementation */
 892         while (nBytes--) {
 893                 if (*buffer != 0xFF)
 894                         return 0;
 895                 buffer++;
 896         }
 897         return 1;
 898 }
 899
 900 static int yaffs_CheckChunkErased(struct yaffs_DeviceStruct *dev,
 901                                 int chunkInNAND)
 902 {
 903         int retval = YAFFS_OK;
 904         __u8 *data = yaffs_GetTempBuffer(dev, __LINE__);
 905         yaffs_ExtendedTags tags;
 906         int result;
 907
 908         result = yaffs_ReadChunkWithTagsFromNAND(dev, chunkInNAND, data, &tags);
 909
 910         if (tags.eccResult > YAFFS_ECC_RESULT_NO_ERROR)
 911                 retval = YAFFS_FAIL;
 912
 913         if (!yaffs_CheckFF(data, dev->nDataBytesPerChunk) || tags.chunkUsed) {
 914                 T(YAFFS_TRACE_NANDACCESS,
 915                   (TSTR("Chunk %d not erased" TENDSTR), chunkInNAND));
 916                 retval = YAFFS_FAIL;
 917         }
 918
 919         yaffs_ReleaseTempBuffer(dev, data, __LINE__);
 920
 921         return retval;
 922
 923 }
 924
 925
 926 static int yaffs_VerifyChunkWritten(yaffs_Device *dev,
 927                                         int chunkInNAND,
 928                                         const __u8 *data,
 929                                         yaffs_ExtendedTags *tags)
 930 {
 931         int retval = YAFFS_OK;
 932         yaffs_ExtendedTags tempTags;
 933         __u8 *buffer = yaffs_GetTempBuffer(dev,__LINE__);
 934         int result;
 935
 936         result = yaffs_ReadChunkWithTagsFromNAND(dev,chunkInNAND,buffer,&tempTags);
 937         if(memcmp(buffer,data,dev->nDataBytesPerChunk) ||
 938                 tempTags.objectId != tags->objectId ||
 939                 tempTags.chunkId  != tags->chunkId ||
 940                 tempTags.byteCount != tags->byteCount)
 941                 retval = YAFFS_FAIL;
 942
 943         yaffs_ReleaseTempBuffer(dev, buffer, __LINE__);
 944
 945         return retval;
 946 }
 947
 948 static int yaffs_WriteNewChunkWithTagsToNAND(struct yaffs_DeviceStruct *dev,
 949                                         const __u8 *data,
 950                                         yaffs_ExtendedTags *tags,
 951                                         int useReserve)
 952 {
 953         int attempts = 0;
 954         int writeOk = 0;
 955         int chunk;
 956
 957         yaffs_InvalidateCheckpoint(dev);
 958
 959         do {
 960                 yaffs_BlockInfo *bi = 0;
 961                 int erasedOk = 0;
 962
 963                 chunk = yaffs_AllocateChunk(dev, useReserve, &bi);
 964                 if (chunk < 0) {
 965                         /* no space */
 966                         break;
 967                 }
 968
 969                 /* First check this chunk is erased, if it needs
 970                  * checking.  The checking policy (unless forced
 971                  * always on) is as follows:
 972                  *
 973                  * Check the first page we try to write in a block.
 974                  * If the check passes then we don't need to check any
 975                  * more.        If the check fails, we check again...
 976                  * If the block has been erased, we don't need to check.
 977                  *
 978                  * However, if the block has been prioritised for gc,
 979                  * then we think there might be something odd about
 980                  * this block and stop using it.
 981                  *
 982                  * Rationale: We should only ever see chunks that have
 983                  * not been erased if there was a partially written
 984                  * chunk due to power loss.  This checking policy should
 985                  * catch that case with very few checks and thus save a
 986                  * lot of checks that are most likely not needed.
 987                  *
 988                  * Mods to the above
 989                  * If an erase check fails or the write fails we skip the
 990                  * rest of the block.
 991                  */
 992
 993                 /* let's give it a try */
 994                 attempts++;
 995
 996 #ifdef CONFIG_YAFFS_ALWAYS_CHECK_CHUNK_ERASED
 997                 bi->skipErasedCheck = 0;
 998 #endif
 999                 if (!bi->skipErasedCheck) {
1000                         erasedOk = yaffs_CheckChunkErased(dev, chunk);
1001                         if (erasedOk != YAFFS_OK) {
1002                                 T(YAFFS_TRACE_ERROR,
1003                                 (TSTR("**>> yaffs chunk %d was not erased"
1004                                 TENDSTR), chunk));
1005
1006                                 /* If not erased, delete this one,
1007                                  * skip rest of block and
1008                                  * try another chunk */
1009                                  yaffs_DeleteChunk(dev,chunk,1,__LINE__);
1010                                  yaffs_SkipRestOfBlock(dev);
1011                                 continue;
1012                         }
1013                 }
1014
1015                 writeOk = yaffs_WriteChunkWithTagsToNAND(dev, chunk,
1016                                 data, tags);
1017
1018                 if(!bi->skipErasedCheck)
1019                         writeOk = yaffs_VerifyChunkWritten(dev, chunk, data, tags);
1020
1021                 if (writeOk != YAFFS_OK) {
1022                         /* Clean up aborted write, skip to next block and
1023                          * try another chunk */
1024                         yaffs_HandleWriteChunkError(dev, chunk, erasedOk);
1025                         continue;
1026                 }
1027
1028                 bi->skipErasedCheck = 1;
1029
1030                 /* Copy the data into the robustification buffer */
1031                 yaffs_HandleWriteChunkOk(dev, chunk, data, tags);
1032
1033         } while (writeOk != YAFFS_OK &&
1034                 (yaffs_wr_attempts <= 0 || attempts <= yaffs_wr_attempts));
1035
1036         if (!writeOk)
1037                 chunk = -1;
1038
1039         if (attempts > 1) {
1040                 T(YAFFS_TRACE_ERROR,
1041                         (TSTR("**>> yaffs write required %d attempts" TENDSTR),
1042                         attempts));
1043
1044                 dev->nRetriedWrites += (attempts - 1);
1045         }
1046
1047         return chunk;
1048 }
1049
1050
1051 /*
1052  * Oldest Dirty Sequence Number handling.
1053  */
1054
1055 /* yaffs_CalcOldestDirtySequence()
1056  * yaffs_FindOldestDirtySequence()
1057  * Calculate the oldest dirty sequence number if we don't know it.
1058  */
1059 static int yaffs_CalcOldestDirtySequence(yaffs_Device *dev)
1060 {
1061         int i;
1062         __u32 seq;
1063         yaffs_BlockInfo *b = 0;
1064
1065         if(!dev->param.isYaffs2)
1066                 return 0;
1067
1068         /* Find the oldest dirty sequence number. */
1069         seq = dev->sequenceNumber;
1070         for (i = dev->internalStartBlock; i <= dev->internalEndBlock; i++) {
1071                 b = yaffs_GetBlockInfo(dev, i);
1072                 if (b->blockState == YAFFS_BLOCK_STATE_FULL &&
1073                     (b->pagesInUse - b->softDeletions) < dev->param.nChunksPerBlock &&
1074                     b->sequenceNumber < seq)
1075                                 seq = b->sequenceNumber;
1076         }
1077         return seq;
1078 }
1079
1080
1081 static void yaffs_FindOldestDirtySequence(yaffs_Device *dev)
1082 {
1083         if(dev->param.isYaffs2 && !dev->oldestDirtySequence)
1084                 dev->oldestDirtySequence =
1085                         yaffs_CalcOldestDirtySequence(dev);
1086
1087 #if 0
1088         if(!yaffs_SkipVerification(dev) &&
1089                 dev->oldestDirtySequence != yaffs_CalcOldestDirtySequence(dev))
1090                 YBUG();
1091
1092 #endif
1093 }
1094
1095 /*
1096  * yaffs_ClearOldestDirtySequence()
1097  * Called when a block is erased or marked bad. (ie. when its sequenceNumber
1098  * becomes invalid). If the value matches the oldest then we clear
1099  * dev->oldestDirtySequence to force its recomputation.
1100  */
1101 static void yaffs_ClearOldestDirtySequence(yaffs_Device *dev, yaffs_BlockInfo *bi)
1102 {
1103
1104         if(!dev->param.isYaffs2)
1105                 return;
1106
1107         if(!bi || bi->sequenceNumber == dev->oldestDirtySequence)
1108                 dev->oldestDirtySequence = 0;
1109 }
1110
1111 /*
1112  * yaffs_UpdateOldestDirtySequence()
1113  * Update the oldest dirty sequence number whenever we dirty a block.
1114  * Only do this if the oldestDirtySequence is actually being tracked.
1115  */
1116 static void yaffs_UpdateOldestDirtySequence(yaffs_Device *dev, yaffs_BlockInfo *bi)
1117 {
1118         if(dev->param.isYaffs2 && dev->oldestDirtySequence){
1119                 if(dev->oldestDirtySequence > bi->sequenceNumber)
1120                         dev->oldestDirtySequence = bi->sequenceNumber;
1121         }
1122 }
1123
1124 /*
1125  * Block retiring for handling a broken block.
1126  */
1127
1128 static void yaffs_RetireBlock(yaffs_Device *dev, int blockInNAND)
1129 {
1130         yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, blockInNAND);
1131
1132         yaffs_InvalidateCheckpoint(dev);
1133
1134         yaffs_ClearOldestDirtySequence(dev,bi);
1135
1136         if (yaffs_MarkBlockBad(dev, blockInNAND) != YAFFS_OK) {
1137                 if (yaffs_EraseBlockInNAND(dev, blockInNAND) != YAFFS_OK) {
1138                         T(YAFFS_TRACE_ALWAYS, (TSTR(
1139                                 "yaffs: Failed to mark bad and erase block %d"
1140                                 TENDSTR), blockInNAND));
1141                 } else {
1142                         yaffs_ExtendedTags tags;
1143                         int chunkId = blockInNAND * dev->param.nChunksPerBlock;
1144
1145                         __u8 *buffer = yaffs_GetTempBuffer(dev, __LINE__);
1146
1147                         memset(buffer, 0xff, dev->nDataBytesPerChunk);
1148                         yaffs_InitialiseTags(&tags);
1149                         tags.sequenceNumber = YAFFS_SEQUENCE_BAD_BLOCK;
1150                         if (dev->param.writeChunkWithTagsToNAND(dev, chunkId -
1151                                 dev->chunkOffset, buffer, &tags) != YAFFS_OK)
1152                                 T(YAFFS_TRACE_ALWAYS, (TSTR("yaffs: Failed to "
1153                                         TCONT("write bad block marker to block %d")
1154                                         TENDSTR), blockInNAND));
1155
1156                         yaffs_ReleaseTempBuffer(dev, buffer, __LINE__);
1157                 }
1158         }
1159
1160         bi->blockState = YAFFS_BLOCK_STATE_DEAD;
1161         bi->gcPrioritise = 0;
1162         bi->needsRetiring = 0;
1163
1164         dev->nRetiredBlocks++;
1165 }
1166
1167 /*
1168  * Functions for robustisizing TODO
1169  *
1170  */
1171
1172 static void yaffs_HandleWriteChunkOk(yaffs_Device *dev, int chunkInNAND,
1173                                 const __u8 *data,
1174                                 const yaffs_ExtendedTags *tags)
1175 {
1176         dev=dev;
1177         chunkInNAND=chunkInNAND;
1178         data=data;
1179         tags=tags;
1180 }
1181
1182 static void yaffs_HandleUpdateChunk(yaffs_Device *dev, int chunkInNAND,
1183                                 const yaffs_ExtendedTags *tags)
1184 {
1185         dev=dev;
1186         chunkInNAND=chunkInNAND;
1187         tags=tags;
1188 }
1189
1190 void yaffs_HandleChunkError(yaffs_Device *dev, yaffs_BlockInfo *bi)
1191 {
1192         if (!bi->gcPrioritise) {
1193                 bi->gcPrioritise = 1;
1194                 dev->hasPendingPrioritisedGCs = 1;
1195                 bi->chunkErrorStrikes++;
1196
1197                 if (bi->chunkErrorStrikes > 3) {
1198                         bi->needsRetiring = 1; /* Too many stikes, so retire this */
1199                         T(YAFFS_TRACE_ALWAYS, (TSTR("yaffs: Block struck out" TENDSTR)));
1200
1201                 }
1202         }
1203 }
1204
1205 static void yaffs_HandleWriteChunkError(yaffs_Device *dev, int chunkInNAND,
1206                 int erasedOk)
1207 {
1208         int blockInNAND = chunkInNAND / dev->param.nChunksPerBlock;
1209         yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, blockInNAND);
1210
1211         yaffs_HandleChunkError(dev, bi);
1212
1213         if (erasedOk) {
1214                 /* Was an actual write failure, so mark the block for retirement  */
1215                 bi->needsRetiring = 1;
1216                 T(YAFFS_TRACE_ERROR | YAFFS_TRACE_BAD_BLOCKS,
1217                   (TSTR("**>> Block %d needs retiring" TENDSTR), blockInNAND));
1218         }
1219
1220         /* Delete the chunk */
1221         yaffs_DeleteChunk(dev, chunkInNAND, 1, __LINE__);
1222         yaffs_SkipRestOfBlock(dev);
1223 }
1224
1225
1226 /*---------------- Name handling functions ------------*/
1227
1228 static __u16 yaffs_CalcNameSum(const YCHAR *name)
1229 {
1230         __u16 sum = 0;
1231         __u16 i = 1;
1232
1233         const YUCHAR *bname = (const YUCHAR *) name;
1234         if (bname) {
1235                 while ((*bname) && (i < (YAFFS_MAX_NAME_LENGTH/2))) {
1236
1237 #ifdef CONFIG_YAFFS_CASE_INSENSITIVE
1238                         sum += yaffs_toupper(*bname) * i;
1239 #else
1240                         sum += (*bname) * i;
1241 #endif
1242                         i++;
1243                         bname++;
1244                 }
1245         }
1246         return sum;
1247 }
1248
1249 static void yaffs_SetObjectName(yaffs_Object *obj, const YCHAR *name)
1250 {
1251 #ifdef CONFIG_YAFFS_SHORT_NAMES_IN_RAM
1252         memset(obj->shortName, 0, sizeof(YCHAR) * (YAFFS_SHORT_NAME_LENGTH+1));
1253         if (name && yaffs_strnlen(name,YAFFS_SHORT_NAME_LENGTH+1) <= YAFFS_SHORT_NAME_LENGTH)
1254                 yaffs_strcpy(obj->shortName, name);
1255         else
1256                 obj->shortName[0] = _Y('\0');
1257 #endif
1258         obj->sum = yaffs_CalcNameSum(name);
1259 }
1260
1261 /*-------------------- TNODES -------------------
1262
1263  * List of spare tnodes
1264  * The list is hooked together using the first pointer
1265  * in the tnode.
1266  */
1267
1268 /* yaffs_CreateTnodes creates a bunch more tnodes and
1269  * adds them to the tnode free list.
1270  * Don't use this function directly
1271  */
1272 static Y_INLINE int yaffs_CalcTnodeSize(yaffs_Device *dev)
1273 {
1274         int tnodeSize;
1275         /* Calculate the tnode size in bytes for variable width tnode support.
1276          * Must be a multiple of 32-bits  */
1277         tnodeSize = (dev->tnodeWidth * YAFFS_NTNODES_LEVEL0)/8;
1278
1279         if (tnodeSize < sizeof(yaffs_Tnode))
1280                 tnodeSize = sizeof(yaffs_Tnode);
1281         return tnodeSize;
1282 }
1283
1284 static int yaffs_CreateTnodes(yaffs_Device *dev, int nTnodes)
1285 {
1286         int i;
1287         int tnodeSize = yaffs_CalcTnodeSize(dev);
1288         yaffs_Tnode *newTnodes;
1289         __u8 *mem;
1290         yaffs_Tnode *curr;
1291         yaffs_Tnode *next;
1292         yaffs_TnodeList *tnl;
1293
1294         if (nTnodes < 1)
1295                 return YAFFS_OK;
1296
1297
1298         /* make these things */
1299
1300         newTnodes = YMALLOC(nTnodes * tnodeSize);
1301         mem = (__u8 *)newTnodes;
1302
1303         if (!newTnodes) {
1304                 T(YAFFS_TRACE_ERROR,
1305                         (TSTR("yaffs: Could not allocate Tnodes" TENDSTR)));
1306                 return YAFFS_FAIL;
1307         }
1308
1309         /* Hook them into the free list */
1310 #if 0
1311         for (i = 0; i < nTnodes - 1; i++) {
1312                 newTnodes[i].internal[0] = &newTnodes[i + 1];
1313 #ifdef CONFIG_YAFFS_TNODE_LIST_DEBUG
1314                 newTnodes[i].internal[YAFFS_NTNODES_INTERNAL] = (void *)1;
1315 #endif
1316         }
1317
1318         newTnodes[nTnodes - 1].internal[0] = dev->freeTnodes;
1319 #ifdef CONFIG_YAFFS_TNODE_LIST_DEBUG
1320         newTnodes[nTnodes - 1].internal[YAFFS_NTNODES_INTERNAL] = (void *)1;
1321 #endif
1322         dev->freeTnodes = newTnodes;
1323 #else
1324         /* New hookup for wide tnodes */
1325         for (i = 0; i < nTnodes - 1; i++) {
1326                 curr = (yaffs_Tnode *) &mem[i * tnodeSize];
1327                 next = (yaffs_Tnode *) &mem[(i+1) * tnodeSize];
1328                 curr->internal[0] = next;
1329         }
1330
1331         curr = (yaffs_Tnode *) &mem[(nTnodes - 1) * tnodeSize];
1332         curr->internal[0] = dev->freeTnodes;
1333         dev->freeTnodes = (yaffs_Tnode *)mem;
1334
1335 #endif
1336
1337
1338         dev->nFreeTnodes += nTnodes;
1339         dev->nTnodesCreated += nTnodes;
1340
1341         /* Now add this bunch of tnodes to a list for freeing up.
1342          * NB If we can't add this to the management list it isn't fatal
1343          * but it just means we can't free this bunch of tnodes later.
1344          */
1345
1346         tnl = YMALLOC(sizeof(yaffs_TnodeList));
1347         if (!tnl) {
1348                 T(YAFFS_TRACE_ERROR,
1349                   (TSTR
1350                    ("yaffs: Could not add tnodes to management list" TENDSTR)));
1351                    return YAFFS_FAIL;
1352         } else {
1353                 tnl->tnodes = newTnodes;
1354                 tnl->next = dev->allocatedTnodeList;
1355                 dev->allocatedTnodeList = tnl;
1356         }
1357
1358         T(YAFFS_TRACE_ALLOCATE, (TSTR("yaffs: Tnodes added" TENDSTR)));
1359
1360         return YAFFS_OK;
1361 }
1362
1363 /* GetTnode gets us a clean tnode. Tries to make allocate more if we run out */
1364
1365 static yaffs_Tnode *yaffs_GetTnodeRaw(yaffs_Device *dev)
1366 {
1367         yaffs_Tnode *tn = NULL;
1368
1369 #ifdef CONFIG_YAFFS_VALGRIND_TEST
1370         tn = YMALLOC(yaffs_CalcTnodeSize(dev));
1371         if(tn)
1372                 dev->nTnodesCreated++;
1373 #else
1374         /* If there are none left make more */
1375         if (!dev->freeTnodes)
1376                 yaffs_CreateTnodes(dev, YAFFS_ALLOCATION_NTNODES);
1377
1378         if (dev->freeTnodes) {
1379                 tn = dev->freeTnodes;
1380 #ifdef CONFIG_YAFFS_TNODE_LIST_DEBUG
1381                 if (tn->internal[YAFFS_NTNODES_INTERNAL] != (void *)1) {
1382                         /* Hoosterman, this thing looks like it isn't in the list */
1383                         T(YAFFS_TRACE_ALWAYS,
1384                           (TSTR("yaffs: Tnode list bug 1" TENDSTR)));
1385                 }
1386 #endif
1387                 dev->freeTnodes = dev->freeTnodes->internal[0];
1388                 dev->nFreeTnodes--;
1389         }
1390 #endif
1391         dev->nCheckpointBlocksRequired = 0; /* force recalculation*/
1392
1393         return tn;
1394 }
1395
1396 static yaffs_Tnode *yaffs_GetTnode(yaffs_Device *dev)
1397 {
1398         yaffs_Tnode *tn = yaffs_GetTnodeRaw(dev);
1399         int tnodeSize = yaffs_CalcTnodeSize(dev);
1400
1401         if (tn)
1402                 memset(tn, 0, tnodeSize);
1403
1404         return tn;
1405 }
1406
1407 /* FreeTnode frees up a tnode and puts it back on the free list */
1408 static void yaffs_FreeTnode(yaffs_Device *dev, yaffs_Tnode *tn)
1409 {
1410         if (tn) {
1411 #ifdef CONFIG_YAFFS_VALGRIND_TEST
1412                 YFREE(tn);
1413                 dev->nTnodesCreated--;
1414 #else
1415 #ifdef CONFIG_YAFFS_TNODE_LIST_DEBUG
1416                 if (tn->internal[YAFFS_NTNODES_INTERNAL] != 0) {
1417                         /* Hoosterman, this thing looks like it is already in the list */
1418                         T(YAFFS_TRACE_ALWAYS,
1419                           (TSTR("yaffs: Tnode list bug 2" TENDSTR)));
1420                 }
1421                 tn->internal[YAFFS_NTNODES_INTERNAL] = (void *)1;
1422 #endif
1423                 tn->internal[0] = dev->freeTnodes;
1424                 dev->freeTnodes = tn;
1425                 dev->nFreeTnodes++;
1426 #endif
1427         }
1428         dev->nCheckpointBlocksRequired = 0; /* force recalculation*/
1429 }
1430
1431 static void yaffs_DeinitialiseTnodes(yaffs_Device *dev)
1432 {
1433         /* Free the list of allocated tnodes */
1434         yaffs_TnodeList *tmp;
1435
1436         while (dev->allocatedTnodeList) {
1437                 tmp = dev->allocatedTnodeList->next;
1438
1439                 YFREE(dev->allocatedTnodeList->tnodes);
1440                 YFREE(dev->allocatedTnodeList);
1441                 dev->allocatedTnodeList = tmp;
1442
1443         }
1444
1445         dev->freeTnodes = NULL;
1446         dev->nFreeTnodes = 0;
1447         dev->nTnodesCreated = 0;
1448 }
1449
1450 static void yaffs_InitialiseTnodes(yaffs_Device *dev)
1451 {
1452         dev->allocatedTnodeList = NULL;
1453         dev->freeTnodes = NULL;
1454         dev->nFreeTnodes = 0;
1455         dev->nTnodesCreated = 0;
1456 }
1457
1458
1459 void yaffs_LoadLevel0Tnode(yaffs_Device *dev, yaffs_Tnode *tn, unsigned pos,
1460                 unsigned val)
1461 {
1462         __u32 *map = (__u32 *)tn;
1463         __u32 bitInMap;
1464         __u32 bitInWord;
1465         __u32 wordInMap;
1466         __u32 mask;
1467
1468         pos &= YAFFS_TNODES_LEVEL0_MASK;
1469         val >>= dev->chunkGroupBits;
1470
1471         bitInMap = pos * dev->tnodeWidth;
1472         wordInMap = bitInMap / 32;
1473         bitInWord = bitInMap & (32 - 1);
1474
1475         mask = dev->tnodeMask << bitInWord;
1476
1477         map[wordInMap] &= ~mask;
1478         map[wordInMap] |= (mask & (val << bitInWord));
1479
1480         if (dev->tnodeWidth > (32 - bitInWord)) {
1481                 bitInWord = (32 - bitInWord);
1482                 wordInMap++;;
1483                 mask = dev->tnodeMask >> (/*dev->tnodeWidth -*/ bitInWord);
1484                 map[wordInMap] &= ~mask;
1485                 map[wordInMap] |= (mask & (val >> bitInWord));
1486         }
1487 }
1488
1489 static __u32 yaffs_GetChunkGroupBase(yaffs_Device *dev, yaffs_Tnode *tn,
1490                 unsigned pos)
1491 {
1492         __u32 *map = (__u32 *)tn;
1493         __u32 bitInMap;
1494         __u32 bitInWord;
1495         __u32 wordInMap;
1496         __u32 val;
1497
1498         pos &= YAFFS_TNODES_LEVEL0_MASK;
1499
1500         bitInMap = pos * dev->tnodeWidth;
1501         wordInMap = bitInMap / 32;
1502         bitInWord = bitInMap & (32 - 1);
1503
1504         val = map[wordInMap] >> bitInWord;
1505
1506         if      (dev->tnodeWidth > (32 - bitInWord)) {
1507                 bitInWord = (32 - bitInWord);
1508                 wordInMap++;;
1509                 val |= (map[wordInMap] << bitInWord);
1510         }
1511
1512         val &= dev->tnodeMask;
1513         val <<= dev->chunkGroupBits;
1514
1515         return val;
1516 }
1517
1518 /* ------------------- End of individual tnode manipulation -----------------*/
1519
1520 /* ---------Functions to manipulate the look-up tree (made up of tnodes) ------
1521  * The look up tree is represented by the top tnode and the number of topLevel
1522  * in the tree. 0 means only the level 0 tnode is in the tree.
1523  */
1524
1525 /* FindLevel0Tnode finds the level 0 tnode, if one exists. */
1526 static yaffs_Tnode *yaffs_FindLevel0Tnode(yaffs_Device *dev,
1527                                         yaffs_FileStructure *fStruct,
1528                                         __u32 chunkId)
1529 {
1530         yaffs_Tnode *tn = fStruct->top;
1531         __u32 i;
1532         int requiredTallness;
1533         int level = fStruct->topLevel;
1534
1535         dev=dev;
1536
1537         /* Check sane level and chunk Id */
1538         if (level < 0 || level > YAFFS_TNODES_MAX_LEVEL)
1539                 return NULL;
1540
1541         if (chunkId > YAFFS_MAX_CHUNK_ID)
1542                 return NULL;
1543
1544         /* First check we're tall enough (ie enough topLevel) */
1545
1546         i = chunkId >> YAFFS_TNODES_LEVEL0_BITS;
1547         requiredTallness = 0;
1548         while (i) {
1549                 i >>= YAFFS_TNODES_INTERNAL_BITS;
1550                 requiredTallness++;
1551         }
1552
1553         if (requiredTallness > fStruct->topLevel)
1554                 return NULL; /* Not tall enough, so we can't find it */
1555
1556         /* Traverse down to level 0 */
1557         while (level > 0 && tn) {
1558                 tn = tn->internal[(chunkId >>
1559                         (YAFFS_TNODES_LEVEL0_BITS +
1560                                 (level - 1) *
1561                                 YAFFS_TNODES_INTERNAL_BITS)) &
1562                         YAFFS_TNODES_INTERNAL_MASK];
1563                 level--;
1564         }
1565
1566         return tn;
1567 }
1568
1569 /* AddOrFindLevel0Tnode finds the level 0 tnode if it exists, otherwise first expands the tree.
1570  * This happens in two steps:
1571  *  1. If the tree isn't tall enough, then make it taller.
1572  *  2. Scan down the tree towards the level 0 tnode adding tnodes if required.
1573  *
1574  * Used when modifying the tree.
1575  *
1576  *  If the tn argument is NULL, then a fresh tnode will be added otherwise the specified tn will
1577  *  be plugged into the ttree.
1578  */
1579
1580 static yaffs_Tnode *yaffs_AddOrFindLevel0Tnode(yaffs_Device *dev,
1581                                         yaffs_FileStructure *fStruct,
1582                                         __u32 chunkId,
1583                                         yaffs_Tnode *passedTn)
1584 {
1585         int requiredTallness;
1586         int i;
1587         int l;
1588         yaffs_Tnode *tn;
1589
1590         __u32 x;
1591
1592
1593         /* Check sane level and page Id */
1594         if (fStruct->topLevel < 0 || fStruct->topLevel > YAFFS_TNODES_MAX_LEVEL)
1595                 return NULL;
1596
1597         if (chunkId > YAFFS_MAX_CHUNK_ID)
1598                 return NULL;
1599
1600         /* First check we're tall enough (ie enough topLevel) */
1601
1602         x = chunkId >> YAFFS_TNODES_LEVEL0_BITS;
1603         requiredTallness = 0;
1604         while (x) {
1605                 x >>= YAFFS_TNODES_INTERNAL_BITS;
1606                 requiredTallness++;
1607         }
1608
1609
1610         if (requiredTallness > fStruct->topLevel) {
1611                 /* Not tall enough, gotta make the tree taller */
1612                 for (i = fStruct->topLevel; i < requiredTallness; i++) {
1613
1614                         tn = yaffs_GetTnode(dev);
1615
1616                         if (tn) {
1617                                 tn->internal[0] = fStruct->top;
1618                                 fStruct->top = tn;
1619                                 fStruct->topLevel++;
1620                         } else {
1621                                 T(YAFFS_TRACE_ERROR,
1622                                         (TSTR("yaffs: no more tnodes" TENDSTR)));
1623                                 return NULL;
1624                         }
1625                 }
1626         }
1627
1628         /* Traverse down to level 0, adding anything we need */
1629
1630         l = fStruct->topLevel;
1631         tn = fStruct->top;
1632
1633         if (l > 0) {
1634                 while (l > 0 && tn) {
1635                         x = (chunkId >>
1636                              (YAFFS_TNODES_LEVEL0_BITS +
1637                               (l - 1) * YAFFS_TNODES_INTERNAL_BITS)) &
1638                             YAFFS_TNODES_INTERNAL_MASK;
1639
1640
1641                         if ((l > 1) && !tn->internal[x]) {
1642                                 /* Add missing non-level-zero tnode */
1643                                 tn->internal[x] = yaffs_GetTnode(dev);
1644                                 if(!tn->internal[x])
1645                                         return NULL;
1646                         } else if (l == 1) {
1647                                 /* Looking from level 1 at level 0 */
1648                                 if (passedTn) {
1649                                         /* If we already have one, then release it.*/
1650                                         if (tn->internal[x])
1651                                                 yaffs_FreeTnode(dev, tn->internal[x]);
1652                                         tn->internal[x] = passedTn;
1653
1654                                 } else if (!tn->internal[x]) {
1655                                         /* Don't have one, none passed in */
1656                                         tn->internal[x] = yaffs_GetTnode(dev);
1657                                         if(!tn->internal[x])
1658                                                 return NULL;
1659                                 }
1660                         }
1661
1662                         tn = tn->internal[x];
1663                         l--;
1664                 }
1665         } else {
1666                 /* top is level 0 */
1667                 if (passedTn) {
1668                         memcpy(tn, passedTn, (dev->tnodeWidth * YAFFS_NTNODES_LEVEL0)/8);
1669                         yaffs_FreeTnode(dev, passedTn);
1670                 }
1671         }
1672
1673         return tn;
1674 }
1675
1676 static int yaffs_FindChunkInGroup(yaffs_Device *dev, int theChunk,
1677                                 yaffs_ExtendedTags *tags, int objectId,
1678                                 int chunkInInode)
1679 {
1680         int j;
1681
1682         for (j = 0; theChunk && j < dev->chunkGroupSize; j++) {
1683                 if (yaffs_CheckChunkBit(dev, theChunk / dev->param.nChunksPerBlock,
1684                                 theChunk % dev->param.nChunksPerBlock)) {
1685
1686                         if(dev->chunkGroupSize == 1)
1687                                 return theChunk;
1688                         else {
1689                                 yaffs_ReadChunkWithTagsFromNAND(dev, theChunk, NULL,
1690                                                                 tags);
1691                                 if (yaffs_TagsMatch(tags, objectId, chunkInInode)) {
1692                                         /* found it; */
1693                                         return theChunk;
1694                                 }
1695                         }
1696                 }
1697                 theChunk++;
1698         }
1699         return -1;
1700 }
1701
1702
1703 /* DeleteWorker scans backwards through the tnode tree and deletes all the
1704  * chunks and tnodes in the file
1705  * Returns 1 if the tree was deleted.
1706  * Returns 0 if it stopped early due to hitting the limit and the delete is incomplete.
1707  */
1708
1709 static int yaffs_DeleteWorker(yaffs_Object *in, yaffs_Tnode *tn, __u32 level,
1710                               int chunkOffset, int *limit)
1711 {
1712         int i;
1713         int chunkInInode;
1714         int theChunk;
1715         yaffs_ExtendedTags tags;
1716         int foundChunk;
1717         yaffs_Device *dev = in->myDev;
1718
1719         int allDone = 1;
1720
1721         if (tn) {
1722                 if (level > 0) {
1723                         for (i = YAFFS_NTNODES_INTERNAL - 1; allDone && i >= 0;
1724                              i--) {
1725                                 if (tn->internal[i]) {
1726                                         if (limit && (*limit) < 0) {
1727                                                 allDone = 0;
1728                                         } else {
1729                                                 allDone =
1730                                                         yaffs_DeleteWorker(in,
1731                                                                 tn->
1732                                                                 internal
1733                                                                 [i],
1734                                                                 level -
1735                                                                 1,
1736                                                                 (chunkOffset
1737                                                                         <<
1738                                                                         YAFFS_TNODES_INTERNAL_BITS)
1739                                                                 + i,
1740                                                                 limit);
1741                                         }
1742                                         if (allDone) {
1743                                                 yaffs_FreeTnode(dev,
1744                                                                 tn->
1745                                                                 internal[i]);
1746                                                 tn->internal[i] = NULL;
1747                                         }
1748                                 }
1749                         }
1750                         return (allDone) ? 1 : 0;
1751                 } else if (level == 0) {
1752                         int hitLimit = 0;
1753
1754                         for (i = YAFFS_NTNODES_LEVEL0 - 1; i >= 0 && !hitLimit;
1755                                         i--) {
1756                                 theChunk = yaffs_GetChunkGroupBase(dev, tn, i);
1757                                 if (theChunk) {
1758
1759                                         chunkInInode = (chunkOffset <<
1760                                                 YAFFS_TNODES_LEVEL0_BITS) + i;
1761
1762                                         foundChunk =
1763                                                 yaffs_FindChunkInGroup(dev,
1764                                                                 theChunk,
1765                                                                 &tags,
1766                                                                 in->objectId,
1767                                                                 chunkInInode);
1768
1769                                         if (foundChunk > 0) {
1770                                                 yaffs_DeleteChunk(dev,
1771                                                                   foundChunk, 1,
1772                                                                   __LINE__);
1773                                                 in->nDataChunks--;
1774                                                 if (limit) {
1775                                                         *limit = *limit - 1;
1776                                                         if (*limit <= 0)
1777                                                                 hitLimit = 1;
1778                                                 }
1779
1780                                         }
1781
1782                                         yaffs_LoadLevel0Tnode(dev, tn, i, 0);
1783                                 }
1784
1785                         }
1786                         return (i < 0) ? 1 : 0;
1787
1788                 }
1789
1790         }
1791
1792         return 1;
1793
1794 }
1795
1796 static void yaffs_SoftDeleteChunk(yaffs_Device *dev, int chunk)
1797 {
1798         yaffs_BlockInfo *theBlock;
1799
1800         T(YAFFS_TRACE_DELETION, (TSTR("soft delete chunk %d" TENDSTR), chunk));
1801
1802         theBlock = yaffs_GetBlockInfo(dev, chunk / dev->param.nChunksPerBlock);
1803         if (theBlock) {
1804                 theBlock->softDeletions++;
1805                 dev->nFreeChunks++;
1806                 yaffs_UpdateOldestDirtySequence(dev,theBlock);
1807         }
1808 }
1809
1810 /* SoftDeleteWorker scans backwards through the tnode tree and soft deletes all the chunks in the file.
1811  * All soft deleting does is increment the block's softdelete count and pulls the chunk out
1812  * of the tnode.
1813  * Thus, essentially this is the same as DeleteWorker except that the chunks are soft deleted.
1814  */
1815
1816 static int yaffs_SoftDeleteWorker(yaffs_Object *in, yaffs_Tnode *tn,
1817                                   __u32 level, int chunkOffset)
1818 {
1819         int i;
1820         int theChunk;
1821         int allDone = 1;
1822         yaffs_Device *dev = in->myDev;
1823
1824         if (tn) {
1825                 if (level > 0) {
1826
1827                         for (i = YAFFS_NTNODES_INTERNAL - 1; allDone && i >= 0;
1828                              i--) {
1829                                 if (tn->internal[i]) {
1830                                         allDone =
1831                                             yaffs_SoftDeleteWorker(in,
1832                                                                    tn->
1833                                                                    internal[i],
1834                                                                    level - 1,
1835                                                                    (chunkOffset
1836                                                                     <<
1837                                                                     YAFFS_TNODES_INTERNAL_BITS)
1838                                                                    + i);
1839                                         if (allDone) {
1840                                                 yaffs_FreeTnode(dev,
1841                                                                 tn->
1842                                                                 internal[i]);
1843                                                 tn->internal[i] = NULL;
1844                                         } else {
1845                                                 /* Hoosterman... how could this happen? */
1846                                         }
1847                                 }
1848                         }
1849                         return (allDone) ? 1 : 0;
1850                 } else if (level == 0) {
1851
1852                         for (i = YAFFS_NTNODES_LEVEL0 - 1; i >= 0; i--) {
1853                                 theChunk = yaffs_GetChunkGroupBase(dev, tn, i);
1854                                 if (theChunk) {
1855                                         /* Note this does not find the real chunk, only the chunk group.
1856                                          * We make an assumption that a chunk group is not larger than
1857                                          * a block.
1858                                          */
1859                                         yaffs_SoftDeleteChunk(dev, theChunk);
1860                                         yaffs_LoadLevel0Tnode(dev, tn, i, 0);
1861                                 }
1862
1863                         }
1864                         return 1;
1865
1866                 }
1867
1868         }
1869
1870         return 1;
1871
1872 }
1873
1874 static void yaffs_SoftDeleteFile(yaffs_Object *obj)
1875 {
1876         if (obj->deleted &&
1877             obj->variantType == YAFFS_OBJECT_TYPE_FILE && !obj->softDeleted) {
1878                 if (obj->nDataChunks <= 0) {
1879                         /* Empty file with no duplicate object headers, just delete it immediately */
1880                         yaffs_FreeTnode(obj->myDev,
1881                                         obj->variant.fileVariant.top);
1882                         obj->variant.fileVariant.top = NULL;
1883                         T(YAFFS_TRACE_TRACING,
1884                           (TSTR("yaffs: Deleting empty file %d" TENDSTR),
1885                            obj->objectId));
1886                         yaffs_DoGenericObjectDeletion(obj);
1887                 } else {
1888                         yaffs_SoftDeleteWorker(obj,
1889                                                obj->variant.fileVariant.top,
1890                                                obj->variant.fileVariant.
1891                                                topLevel, 0);
1892                         obj->softDeleted = 1;
1893                 }
1894         }
1895 }
1896
1897 /* Pruning removes any part of the file structure tree that is beyond the
1898  * bounds of the file (ie that does not point to chunks).
1899  *
1900  * A file should only get pruned when its size is reduced.
1901  *
1902  * Before pruning, the chunks must be pulled from the tree and the
1903  * level 0 tnode entries must be zeroed out.
1904  * Could also use this for file deletion, but that's probably better handled
1905  * by a special case.
1906  *
1907  * This function is recursive. For levels > 0 the function is called again on
1908  * any sub-tree. For level == 0 we just check if the sub-tree has data.
1909  * If there is no data in a subtree then it is pruned.
1910  */
1911
1912 static yaffs_Tnode *yaffs_PruneWorker(yaffs_Device *dev, yaffs_Tnode *tn,
1913                                 __u32 level, int del0)
1914 {
1915         int i;
1916         int hasData;
1917
1918         if (tn) {
1919                 hasData = 0;
1920
1921                 if(level > 0){
1922                         for (i = 0; i < YAFFS_NTNODES_INTERNAL; i++) {
1923                                 if (tn->internal[i]) {
1924                                         tn->internal[i] =
1925                                                 yaffs_PruneWorker(dev, tn->internal[i],
1926                                                         level - 1,
1927                                                         (i == 0) ? del0 : 1);
1928                                 }
1929
1930                                 if (tn->internal[i])
1931                                         hasData++;
1932                         }
1933                 } else {
1934                         int tnodeSize_u32 = yaffs_CalcTnodeSize(dev)/sizeof(__u32);
1935                         __u32 *map = (__u32 *)tn;
1936
1937                         for(i = 0; !hasData && i < tnodeSize_u32; i++){
1938                                 if(map[i])
1939                                         hasData++;
1940                         }
1941                 }
1942
1943                 if (hasData == 0 && del0) {
1944                         /* Free and return NULL */
1945
1946                         yaffs_FreeTnode(dev, tn);
1947                         tn = NULL;
1948                 }
1949
1950         }
1951
1952         return tn;
1953
1954 }
1955
1956 static int yaffs_PruneFileStructure(yaffs_Device *dev,
1957                                 yaffs_FileStructure *fStruct)
1958 {
1959         int i;
1960         int hasData;
1961         int done = 0;
1962         yaffs_Tnode *tn;
1963
1964         if (fStruct->topLevel > 0) {
1965                 fStruct->top =
1966                     yaffs_PruneWorker(dev, fStruct->top, fStruct->topLevel, 0);
1967
1968                 /* Now we have a tree with all the non-zero branches NULL but the height
1969                  * is the same as it was.
1970                  * Let's see if we can trim internal tnodes to shorten the tree.
1971                  * We can do this if only the 0th element in the tnode is in use
1972                  * (ie all the non-zero are NULL)
1973                  */
1974
1975                 while (fStruct->topLevel && !done) {
1976                         tn = fStruct->top;
1977
1978                         hasData = 0;
1979                         for (i = 1; i < YAFFS_NTNODES_INTERNAL; i++) {
1980                                 if (tn->internal[i])
1981                                         hasData++;
1982                         }
1983
1984                         if (!hasData) {
1985                                 fStruct->top = tn->internal[0];
1986                                 fStruct->topLevel--;
1987                                 yaffs_FreeTnode(dev, tn);
1988                         } else {
1989                                 done = 1;
1990                         }
1991                 }
1992         }
1993
1994         return YAFFS_OK;
1995 }
1996
1997 /*-------------------- End of File Structure functions.-------------------*/
1998
1999 /* yaffs_CreateFreeObjects creates a bunch more objects and
2000  * adds them to the object free list.
2001  */
2002 static int yaffs_CreateFreeObjects(yaffs_Device *dev, int nObjects)
2003 {
2004         int i;
2005         yaffs_Object *newObjects;
2006         yaffs_ObjectList *list;
2007
2008         if (nObjects < 1)
2009                 return YAFFS_OK;
2010
2011         /* make these things */
2012         newObjects = YMALLOC(nObjects * sizeof(yaffs_Object));
2013         list = YMALLOC(sizeof(yaffs_ObjectList));
2014
2015         if (!newObjects || !list) {
2016                 if (newObjects){
2017                         YFREE(newObjects);
2018                         newObjects = NULL;
2019                 }
2020                 if (list){
2021                         YFREE(list);
2022                         list = NULL;
2023                 }
2024                 T(YAFFS_TRACE_ALLOCATE,
2025                   (TSTR("yaffs: Could not allocate more objects" TENDSTR)));
2026                 return YAFFS_FAIL;
2027         }
2028
2029         /* Hook them into the free list */
2030         for (i = 0; i < nObjects - 1; i++) {
2031                 newObjects[i].siblings.next =
2032                                 (struct ylist_head *)(&newObjects[i + 1]);
2033         }
2034
2035         newObjects[nObjects - 1].siblings.next = (void *)dev->freeObjects;
2036         dev->freeObjects = newObjects;
2037         dev->nFreeObjects += nObjects;
2038         dev->nObjectsCreated += nObjects;
2039
2040         /* Now add this bunch of Objects to a list for freeing up. */
2041
2042         list->objects = newObjects;
2043         list->next = dev->allocatedObjectList;
2044         dev->allocatedObjectList = list;
2045
2046         return YAFFS_OK;
2047 }
2048
2049
2050 /* AllocateEmptyObject gets us a clean Object. Tries to make allocate more if we run out */
2051 static yaffs_Object *yaffs_AllocateEmptyObject(yaffs_Device *dev)
2052 {
2053         yaffs_Object *tn = NULL;
2054
2055 #ifdef CONFIG_YAFFS_VALGRIND_TEST
2056         tn = YMALLOC(sizeof(yaffs_Object));
2057         if(tn)
2058                 dev->nObjectsCreated++;
2059 #else
2060         /* If there are none left make more */
2061         if (!dev->freeObjects)
2062                 yaffs_CreateFreeObjects(dev, YAFFS_ALLOCATION_NOBJECTS);
2063
2064         if (dev->freeObjects) {
2065                 tn = dev->freeObjects;
2066                 dev->freeObjects =
2067                         (yaffs_Object *) (dev->freeObjects->siblings.next);
2068                 dev->nFreeObjects--;
2069         }
2070 #endif
2071         if (tn) {
2072                 /* Now sweeten it up... */
2073
2074                 memset(tn, 0, sizeof(yaffs_Object));
2075                 tn->beingCreated = 1;
2076
2077                 tn->myDev = dev;
2078                 tn->hdrChunk = 0;
2079                 tn->variantType = YAFFS_OBJECT_TYPE_UNKNOWN;
2080                 YINIT_LIST_HEAD(&(tn->hardLinks));
2081                 YINIT_LIST_HEAD(&(tn->hashLink));
2082                 YINIT_LIST_HEAD(&tn->siblings);
2083
2084
2085                 /* Now make the directory sane */
2086                 if (dev->rootDir) {
2087                         tn->parent = dev->rootDir;
2088                         ylist_add(&(tn->siblings), &dev->rootDir->variant.directoryVariant.children);
2089                 }
2090
2091                 /* Add it to the lost and found directory.
2092                  * NB Can't put root or lostNFound in lostNFound so
2093                  * check if lostNFound exists first
2094                  */
2095                 if (dev->lostNFoundDir)
2096                         yaffs_AddObjectToDirectory(dev->lostNFoundDir, tn);
2097
2098                 tn->beingCreated = 0;
2099         }
2100
2101         dev->nCheckpointBlocksRequired = 0; /* force recalculation*/
2102
2103         return tn;
2104 }
2105
2106 static yaffs_Object *yaffs_CreateFakeDirectory(yaffs_Device *dev, int number,
2107                                                __u32 mode)
2108 {
2109
2110         yaffs_Object *obj =
2111             yaffs_CreateNewObject(dev, number, YAFFS_OBJECT_TYPE_DIRECTORY);
2112         if (obj) {
2113                 obj->fake = 1;          /* it is fake so it might have no NAND presence... */
2114                 obj->renameAllowed = 0; /* ... and we're not allowed to rename it... */
2115                 obj->unlinkAllowed = 0; /* ... or unlink it */
2116                 obj->deleted = 0;
2117                 obj->unlinked = 0;
2118                 obj->yst_mode = mode;
2119                 obj->myDev = dev;
2120                 obj->hdrChunk = 0;      /* Not a valid chunk. */
2121         }
2122
2123         return obj;
2124
2125 }
2126
2127 static void yaffs_UnhashObject(yaffs_Object *tn)
2128 {
2129         int bucket;
2130         yaffs_Device *dev = tn->myDev;
2131
2132         /* If it is still linked into the bucket list, free from the list */
2133         if (!ylist_empty(&tn->hashLink)) {
2134                 ylist_del_init(&tn->hashLink);
2135                 bucket = yaffs_HashFunction(tn->objectId);
2136                 dev->objectBucket[bucket].count--;
2137         }
2138 }
2139
2140 /*  FreeObject frees up a Object and puts it back on the free list */
2141 static void yaffs_FreeObject(yaffs_Object *tn)
2142 {
2143         yaffs_Device *dev = tn->myDev;
2144
2145         T(YAFFS_TRACE_OS, (TSTR("FreeObject %p inode %p"TENDSTR), tn, tn->myInode));
2146
2147         if (!tn)
2148                 YBUG();
2149         if (tn->parent)
2150                 YBUG();
2151         if (!ylist_empty(&tn->siblings))
2152                 YBUG();
2153
2154
2155         if (tn->myInode) {
2156                 /* We're still hooked up to a cached inode.
2157                  * Don't delete now, but mark for later deletion
2158                  */
2159                 tn->deferedFree = 1;
2160                 return;
2161         }
2162
2163         yaffs_UnhashObject(tn);
2164
2165 #ifdef CONFIG_YAFFS_VALGRIND_TEST
2166         YFREE(tn);
2167         dev->nObjectsCreated--;
2168         tn = NULL;
2169 #else
2170         /* Link into the free list. */
2171         tn->siblings.next = (struct ylist_head *)(dev->freeObjects);
2172         dev->freeObjects = tn;
2173         dev->nFreeObjects++;
2174 #endif
2175         dev->nCheckpointBlocksRequired = 0; /* force recalculation*/
2176 }
2177
2178
2179 void yaffs_HandleDeferedFree(yaffs_Object *obj)
2180 {
2181         if (obj->deferedFree)
2182                 yaffs_FreeObject(obj);
2183 }
2184
2185
2186 static void yaffs_DeinitialiseObjects(yaffs_Device *dev)
2187 {
2188         /* Free the list of allocated Objects */
2189
2190         yaffs_ObjectList *tmp;
2191
2192         while (dev->allocatedObjectList) {
2193                 tmp = dev->allocatedObjectList->next;
2194                 YFREE(dev->allocatedObjectList->objects);
2195                 YFREE(dev->allocatedObjectList);
2196
2197                 dev->allocatedObjectList = tmp;
2198         }
2199
2200         dev->freeObjects = NULL;
2201         dev->nFreeObjects = 0;
2202         dev->nObjectsCreated = 0;
2203 }
2204
2205 static void yaffs_InitialiseObjects(yaffs_Device *dev)
2206 {
2207         int i;
2208
2209         dev->allocatedObjectList = NULL;
2210         dev->freeObjects = NULL;
2211         dev->nFreeObjects = 0;
2212
2213         for (i = 0; i < YAFFS_NOBJECT_BUCKETS; i++) {
2214                 YINIT_LIST_HEAD(&dev->objectBucket[i].list);
2215                 dev->objectBucket[i].count = 0;
2216         }
2217 }
2218
2219 static int yaffs_FindNiceObjectBucket(yaffs_Device *dev)
2220 {
2221         int i;
2222         int l = 999;
2223         int lowest = 999999;
2224
2225
2226         /* Search for the shortest list or one that
2227          * isn't too long.
2228          */
2229
2230         for (i = 0; i < 10 && lowest > 4; i++) {
2231                 dev->bucketFinder++;
2232                 dev->bucketFinder %= YAFFS_NOBJECT_BUCKETS;
2233                 if (dev->objectBucket[dev->bucketFinder].count < lowest) {
2234                         lowest = dev->objectBucket[dev->bucketFinder].count;
2235                         l = dev->bucketFinder;
2236                 }
2237
2238         }
2239
2240         return l;
2241 }
2242
2243 static int yaffs_CreateNewObjectNumber(yaffs_Device *dev)
2244 {
2245         int bucket = yaffs_FindNiceObjectBucket(dev);
2246
2247         /* Now find an object value that has not already been taken
2248          * by scanning the list.
2249          */
2250
2251         int found = 0;
2252         struct ylist_head *i;
2253
2254         __u32 n = (__u32) bucket;
2255
2256         /* yaffs_CheckObjectHashSanity();  */
2257
2258         while (!found) {
2259                 found = 1;
2260                 n += YAFFS_NOBJECT_BUCKETS;
2261                 if (1 || dev->objectBucket[bucket].count > 0) {
2262                         ylist_for_each(i, &dev->objectBucket[bucket].list) {
2263                                 /* If there is already one in the list */
2264                                 if (i && ylist_entry(i, yaffs_Object,
2265                                                 hashLink)->objectId == n) {
2266                                         found = 0;
2267                                 }
2268                         }
2269                 }
2270         }
2271
2272         return n;
2273 }
2274
2275 static void yaffs_HashObject(yaffs_Object *in)
2276 {
2277         int bucket = yaffs_HashFunction(in->objectId);
2278         yaffs_Device *dev = in->myDev;
2279
2280         ylist_add(&in->hashLink, &dev->objectBucket[bucket].list);
2281         dev->objectBucket[bucket].count++;
2282 }
2283
2284 yaffs_Object *yaffs_FindObjectByNumber(yaffs_Device *dev, __u32 number)
2285 {
2286         int bucket = yaffs_HashFunction(number);
2287         struct ylist_head *i;
2288         yaffs_Object *in;
2289
2290         ylist_for_each(i, &dev->objectBucket[bucket].list) {
2291                 /* Look if it is in the list */
2292                 if (i) {
2293                         in = ylist_entry(i, yaffs_Object, hashLink);
2294                         if (in->objectId == number) {
2295
2296                                 /* Don't tell the VFS about this one if it is defered free */
2297                                 if (in->deferedFree)
2298                                         return NULL;
2299
2300                                 return in;
2301                         }
2302                 }
2303         }
2304
2305         return NULL;
2306 }
2307
2308 yaffs_Object *yaffs_CreateNewObject(yaffs_Device *dev, int number,
2309                                     yaffs_ObjectType type)
2310 {
2311         yaffs_Object *theObject=NULL;
2312         yaffs_Tnode *tn = NULL;
2313
2314         if (number < 0)
2315                 number = yaffs_CreateNewObjectNumber(dev);
2316
2317         if (type == YAFFS_OBJECT_TYPE_FILE) {
2318                 tn = yaffs_GetTnode(dev);
2319                 if (!tn)
2320                         return NULL;
2321         }
2322
2323         theObject = yaffs_AllocateEmptyObject(dev);
2324         if (!theObject){
2325                 if(tn)
2326                         yaffs_FreeTnode(dev,tn);
2327                 return NULL;
2328         }
2329
2330
2331         if (theObject) {
2332                 theObject->fake = 0;
2333                 theObject->renameAllowed = 1;
2334                 theObject->unlinkAllowed = 1;
2335                 theObject->objectId = number;
2336                 yaffs_HashObject(theObject);
2337                 theObject->variantType = type;
2338 #ifdef CONFIG_YAFFS_WINCE
2339                 yfsd_WinFileTimeNow(theObject->win_atime);
2340                 theObject->win_ctime[0] = theObject->win_mtime[0] =
2341                     theObject->win_atime[0];
2342                 theObject->win_ctime[1] = theObject->win_mtime[1] =
2343                     theObject->win_atime[1];
2344
2345 #else
2346
2347                 theObject->yst_atime = theObject->yst_mtime =
2348                     theObject->yst_ctime = Y_CURRENT_TIME;
2349 #endif
2350                 switch (type) {
2351                 case YAFFS_OBJECT_TYPE_FILE:
2352                         theObject->variant.fileVariant.fileSize = 0;
2353                         theObject->variant.fileVariant.scannedFileSize = 0;
2354                         theObject->variant.fileVariant.shrinkSize = 0xFFFFFFFF; /* max __u32 */
2355                         theObject->variant.fileVariant.topLevel = 0;
2356                         theObject->variant.fileVariant.top = tn;
2357                         break;
2358                 case YAFFS_OBJECT_TYPE_DIRECTORY:
2359                         YINIT_LIST_HEAD(&theObject->variant.directoryVariant.
2360                                         children);
2361                         YINIT_LIST_HEAD(&theObject->variant.directoryVariant.
2362                                         dirty);
2363                         break;
2364                 case YAFFS_OBJECT_TYPE_SYMLINK:
2365                 case YAFFS_OBJECT_TYPE_HARDLINK:
2366                 case YAFFS_OBJECT_TYPE_SPECIAL:
2367                         /* No action required */
2368                         break;
2369                 case YAFFS_OBJECT_TYPE_UNKNOWN:
2370                         /* todo this should not happen */
2371                         break;
2372                 }
2373         }
2374
2375         return theObject;
2376 }
2377
2378 static yaffs_Object *yaffs_FindOrCreateObjectByNumber(yaffs_Device *dev,
2379                                                       int number,
2380                                                       yaffs_ObjectType type)
2381 {
2382         yaffs_Object *theObject = NULL;
2383
2384         if (number > 0)
2385                 theObject = yaffs_FindObjectByNumber(dev, number);
2386
2387         if (!theObject)
2388                 theObject = yaffs_CreateNewObject(dev, number, type);
2389
2390         return theObject;
2391
2392 }
2393
2394
2395 static YCHAR *yaffs_CloneString(const YCHAR *str)
2396 {
2397         YCHAR *newStr = NULL;
2398         int len;
2399
2400         if (!str)
2401                 str = _Y("");
2402
2403         len = yaffs_strnlen(str,YAFFS_MAX_ALIAS_LENGTH);
2404         newStr = YMALLOC((len + 1) * sizeof(YCHAR));
2405         if (newStr){
2406                 yaffs_strncpy(newStr, str,len);
2407                 newStr[len] = 0;
2408         }
2409         return newStr;
2410
2411 }
2412
2413 /*
2414  * Mknod (create) a new object.
2415  * equivalentObject only has meaning for a hard link;
2416  * aliasString only has meaning for a symlink.
2417  * rdev only has meaning for devices (a subset of special objects)
2418  */
2419
2420 static yaffs_Object *yaffs_MknodObject(yaffs_ObjectType type,
2421                                        yaffs_Object *parent,
2422                                        const YCHAR *name,
2423                                        __u32 mode,
2424                                        __u32 uid,
2425                                        __u32 gid,
2426                                        yaffs_Object *equivalentObject,
2427                                        const YCHAR *aliasString, __u32 rdev)
2428 {
2429         yaffs_Object *in;
2430         YCHAR *str = NULL;
2431
2432         yaffs_Device *dev = parent->myDev;
2433
2434         /* Check if the entry exists. If it does then fail the call since we don't want a dup.*/
2435         if (yaffs_FindObjectByName(parent, name))
2436                 return NULL;
2437
2438         if (type == YAFFS_OBJECT_TYPE_SYMLINK) {
2439                 str = yaffs_CloneString(aliasString);
2440                 if (!str)
2441                         return NULL;
2442         }
2443
2444         in = yaffs_CreateNewObject(dev, -1, type);
2445
2446         if (!in){
2447                 if(str)
2448                         YFREE(str);
2449                 return NULL;
2450         }
2451
2452
2453
2454
2455
2456         if (in) {
2457                 in->hdrChunk = 0;
2458                 in->valid = 1;
2459                 in->variantType = type;
2460
2461                 in->yst_mode = mode;
2462
2463 #ifdef CONFIG_YAFFS_WINCE
2464                 yfsd_WinFileTimeNow(in->win_atime);
2465                 in->win_ctime[0] = in->win_mtime[0] = in->win_atime[0];
2466                 in->win_ctime[1] = in->win_mtime[1] = in->win_atime[1];
2467
2468 #else
2469                 in->yst_atime = in->yst_mtime = in->yst_ctime = Y_CURRENT_TIME;
2470
2471                 in->yst_rdev = rdev;
2472                 in->yst_uid = uid;
2473                 in->yst_gid = gid;
2474 #endif
2475                 in->nDataChunks = 0;
2476
2477                 yaffs_SetObjectName(in, name);
2478                 in->dirty = 1;
2479
2480                 yaffs_AddObjectToDirectory(parent, in);
2481
2482                 in->myDev = parent->myDev;
2483
2484                 switch (type) {
2485                 case YAFFS_OBJECT_TYPE_SYMLINK:
2486                         in->variant.symLinkVariant.alias = str;
2487                         break;
2488                 case YAFFS_OBJECT_TYPE_HARDLINK:
2489                         in->variant.hardLinkVariant.equivalentObject =
2490                                 equivalentObject;
2491                         in->variant.hardLinkVariant.equivalentObjectId =
2492                                 equivalentObject->objectId;
2493                         ylist_add(&in->hardLinks, &equivalentObject->hardLinks);
2494                         break;
2495                 case YAFFS_OBJECT_TYPE_FILE:
2496                 case YAFFS_OBJECT_TYPE_DIRECTORY:
2497                 case YAFFS_OBJECT_TYPE_SPECIAL:
2498                 case YAFFS_OBJECT_TYPE_UNKNOWN:
2499                         /* do nothing */
2500                         break;
2501                 }
2502
2503                 if (yaffs_UpdateObjectHeader(in, name, 0, 0, 0) < 0) {
2504                         /* Could not create the object header, fail the creation */
2505                         yaffs_DeleteObject(in);
2506                         in = NULL;
2507                 }
2508
2509                 yaffs_UpdateParent(parent);
2510         }
2511
2512         return in;
2513 }
2514
2515 yaffs_Object *yaffs_MknodFile(yaffs_Object *parent, const YCHAR *name,
2516                         __u32 mode, __u32 uid, __u32 gid)
2517 {
2518         return yaffs_MknodObject(YAFFS_OBJECT_TYPE_FILE, parent, name, mode,
2519                                 uid, gid, NULL, NULL, 0);
2520 }
2521
2522 yaffs_Object *yaffs_MknodDirectory(yaffs_Object *parent, const YCHAR *name,
2523                                 __u32 mode, __u32 uid, __u32 gid)
2524 {
2525         return yaffs_MknodObject(YAFFS_OBJECT_TYPE_DIRECTORY, parent, name,
2526                                  mode, uid, gid, NULL, NULL, 0);
2527 }
2528
2529 yaffs_Object *yaffs_MknodSpecial(yaffs_Object *parent, const YCHAR *name,
2530                                 __u32 mode, __u32 uid, __u32 gid, __u32 rdev)
2531 {
2532         return yaffs_MknodObject(YAFFS_OBJECT_TYPE_SPECIAL, parent, name, mode,
2533                                  uid, gid, NULL, NULL, rdev);
2534 }
2535
2536 yaffs_Object *yaffs_MknodSymLink(yaffs_Object *parent, const YCHAR *name,
2537                                 __u32 mode, __u32 uid, __u32 gid,
2538                                 const YCHAR *alias)
2539 {
2540         return yaffs_MknodObject(YAFFS_OBJECT_TYPE_SYMLINK, parent, name, mode,
2541                                 uid, gid, NULL, alias, 0);
2542 }
2543
2544 /* yaffs_Link returns the object id of the equivalent object.*/
2545 yaffs_Object *yaffs_Link(yaffs_Object *parent, const YCHAR *name,
2546                         yaffs_Object *equivalentObject)
2547 {
2548         /* Get the real object in case we were fed a hard link as an equivalent object */
2549         equivalentObject = yaffs_GetEquivalentObject(equivalentObject);
2550
2551         if (yaffs_MknodObject
2552             (YAFFS_OBJECT_TYPE_HARDLINK, parent, name, 0, 0, 0,
2553              equivalentObject, NULL, 0)) {
2554                 return equivalentObject;
2555         } else {
2556                 return NULL;
2557         }
2558
2559 }
2560
2561 static int yaffs_ChangeObjectName(yaffs_Object *obj, yaffs_Object *newDir,
2562                                 const YCHAR *newName, int force, int shadows)
2563 {
2564         int unlinkOp;
2565         int deleteOp;
2566
2567         yaffs_Object *existingTarget;
2568
2569         if (newDir == NULL)
2570                 newDir = obj->parent;   /* use the old directory */
2571
2572         if (newDir->variantType != YAFFS_OBJECT_TYPE_DIRECTORY) {
2573                 T(YAFFS_TRACE_ALWAYS,
2574                   (TSTR
2575                    ("tragedy: yaffs_ChangeObjectName: newDir is not a directory"
2576                     TENDSTR)));
2577                 YBUG();
2578         }
2579
2580         /* TODO: Do we need this different handling for YAFFS2 and YAFFS1?? */
2581         if (obj->myDev->param.isYaffs2)
2582                 unlinkOp = (newDir == obj->myDev->unlinkedDir);
2583         else
2584                 unlinkOp = (newDir == obj->myDev->unlinkedDir
2585                             && obj->variantType == YAFFS_OBJECT_TYPE_FILE);
2586
2587         deleteOp = (newDir == obj->myDev->deletedDir);
2588
2589         existingTarget = yaffs_FindObjectByName(newDir, newName);
2590
2591         /* If the object is a file going into the unlinked directory,
2592          *   then it is OK to just stuff it in since duplicate names are allowed.
2593          *   else only proceed if the new name does not exist and if we're putting
2594          *   it into a directory.
2595          */
2596         if ((unlinkOp ||
2597              deleteOp ||
2598              force ||
2599              (shadows > 0) ||
2600              !existingTarget) &&
2601             newDir->variantType == YAFFS_OBJECT_TYPE_DIRECTORY) {
2602                 yaffs_SetObjectName(obj, newName);
2603                 obj->dirty = 1;
2604
2605                 yaffs_AddObjectToDirectory(newDir, obj);
2606
2607                 if (unlinkOp)
2608                         obj->unlinked = 1;
2609
2610                 /* If it is a deletion then we mark it as a shrink for gc purposes. */
2611                 if (yaffs_UpdateObjectHeader(obj, newName, 0, deleteOp, shadows) >= 0)
2612                         return YAFFS_OK;
2613         }
2614
2615         return YAFFS_FAIL;
2616 }
2617
2618 int yaffs_RenameObject(yaffs_Object *oldDir, const YCHAR *oldName,
2619                 yaffs_Object *newDir, const YCHAR *newName)
2620 {
2621         yaffs_Object *obj = NULL;
2622         yaffs_Object *existingTarget = NULL;
2623         int force = 0;
2624         int result;
2625         yaffs_Device *dev;
2626
2627
2628         if (!oldDir || oldDir->variantType != YAFFS_OBJECT_TYPE_DIRECTORY)
2629                 YBUG();
2630         if (!newDir || newDir->variantType != YAFFS_OBJECT_TYPE_DIRECTORY)
2631                 YBUG();
2632
2633         dev = oldDir->myDev;
2634
2635 #ifdef CONFIG_YAFFS_CASE_INSENSITIVE
2636         /* Special case for case insemsitive systems (eg. WinCE).
2637          * While look-up is case insensitive, the name isn't.
2638          * Therefore we might want to change x.txt to X.txt
2639         */
2640         if (oldDir == newDir && yaffs_strcmp(oldName, newName) == 0)
2641                 force = 1;
2642 #endif
2643
2644         if(yaffs_strnlen(newName,YAFFS_MAX_NAME_LENGTH+1) > YAFFS_MAX_NAME_LENGTH)
2645                 /* ENAMETOOLONG */
2646                 return YAFFS_FAIL;
2647
2648         obj = yaffs_FindObjectByName(oldDir, oldName);
2649
2650         if (obj && obj->renameAllowed) {
2651
2652                 /* Now do the handling for an existing target, if there is one */
2653
2654                 existingTarget = yaffs_FindObjectByName(newDir, newName);
2655                 if (existingTarget &&
2656                         existingTarget->variantType == YAFFS_OBJECT_TYPE_DIRECTORY &&
2657                         !ylist_empty(&existingTarget->variant.directoryVariant.children)) {
2658                         /* There is a target that is a non-empty directory, so we fail */
2659                         return YAFFS_FAIL;      /* EEXIST or ENOTEMPTY */
2660                 } else if (existingTarget && existingTarget != obj) {
2661                         /* Nuke the target first, using shadowing,
2662                          * but only if it isn't the same object.
2663                          *
2664                          * Note we must disable gc otherwise it can mess up the shadowing.
2665                          *
2666                          */
2667                         dev->isDoingGC=1;
2668                         yaffs_ChangeObjectName(obj, newDir, newName, force,
2669                                                 existingTarget->objectId);
2670                         existingTarget->isShadowed = 1;
2671                         yaffs_UnlinkObject(existingTarget);
2672                         dev->isDoingGC=0;
2673                 }
2674
2675                 result = yaffs_ChangeObjectName(obj, newDir, newName, 1, 0);
2676
2677                 yaffs_UpdateParent(oldDir);
2678                 if(newDir != oldDir)
2679                         yaffs_UpdateParent(newDir);
2680
2681                 return result;
2682         }
2683         return YAFFS_FAIL;
2684 }
2685
2686 /*------------------------- Block Management and Page Allocation ----------------*/
2687
2688 static int yaffs_InitialiseBlocks(yaffs_Device *dev)
2689 {
2690         int nBlocks = dev->internalEndBlock - dev->internalStartBlock + 1;
2691
2692         dev->blockInfo = NULL;
2693         dev->chunkBits = NULL;
2694
2695         dev->allocationBlock = -1;      /* force it to get a new one */
2696
2697         /* If the first allocation strategy fails, thry the alternate one */
2698         dev->blockInfo = YMALLOC(nBlocks * sizeof(yaffs_BlockInfo));
2699         if (!dev->blockInfo) {
2700                 dev->blockInfo = YMALLOC_ALT(nBlocks * sizeof(yaffs_BlockInfo));
2701                 dev->blockInfoAlt = 1;
2702         } else
2703                 dev->blockInfoAlt = 0;
2704
2705         if (dev->blockInfo) {
2706                 /* Set up dynamic blockinfo stuff. */
2707                 dev->chunkBitmapStride = (dev->param.nChunksPerBlock + 7) / 8; /* round up bytes */
2708                 dev->chunkBits = YMALLOC(dev->chunkBitmapStride * nBlocks);
2709                 if (!dev->chunkBits) {
2710                         dev->chunkBits = YMALLOC_ALT(dev->chunkBitmapStride * nBlocks);
2711                         dev->chunkBitsAlt = 1;
2712                 } else
2713                         dev->chunkBitsAlt = 0;
2714         }
2715
2716         if (dev->blockInfo && dev->chunkBits) {
2717                 memset(dev->blockInfo, 0, nBlocks * sizeof(yaffs_BlockInfo));
2718                 memset(dev->chunkBits, 0, dev->chunkBitmapStride * nBlocks);
2719                 return YAFFS_OK;
2720         }
2721
2722         return YAFFS_FAIL;
2723 }
2724
2725 static void yaffs_DeinitialiseBlocks(yaffs_Device *dev)
2726 {
2727         if (dev->blockInfoAlt && dev->blockInfo)
2728                 YFREE_ALT(dev->blockInfo);
2729         else if (dev->blockInfo)
2730                 YFREE(dev->blockInfo);
2731
2732         dev->blockInfoAlt = 0;
2733
2734         dev->blockInfo = NULL;
2735
2736         if (dev->chunkBitsAlt && dev->chunkBits)
2737                 YFREE_ALT(dev->chunkBits);
2738         else if (dev->chunkBits)
2739                 YFREE(dev->chunkBits);
2740         dev->chunkBitsAlt = 0;
2741         dev->chunkBits = NULL;
2742 }
2743
2744 static int yaffs_BlockNotDisqualifiedFromGC(yaffs_Device *dev,
2745                                         yaffs_BlockInfo *bi)
2746 {
2747
2748         if (!dev->param.isYaffs2)
2749                 return 1;       /* disqualification only applies to yaffs2. */
2750
2751         if (!bi->hasShrinkHeader)
2752                 return 1;       /* can gc */
2753
2754         yaffs_FindOldestDirtySequence(dev);
2755
2756         /* Can't do gc of this block if there are any blocks older than this one that have
2757          * discarded pages.
2758          */
2759         return (bi->sequenceNumber <= dev->oldestDirtySequence);
2760 }
2761
2762 /*
2763  * yaffs_FindRefreshBlock()
2764  * periodically finds the oldest full block by sequence number for refreshing.
2765  * Only for yaffs2.
2766  */
2767 static __u32 yaffs_FindRefreshBlock(yaffs_Device *dev)
2768 {
2769         __u32 b ;
2770
2771         __u32 oldest = 0;
2772         __u32 oldestSequence = 0;
2773
2774         yaffs_BlockInfo *bi;
2775
2776         /*
2777          * If refresh period < 10 then refreshing is disabled.
2778          */
2779         if(dev->param.refreshPeriod < 10 ||
2780                 !dev->param.isYaffs2)
2781                 return oldest;
2782
2783         /*
2784          * Fix broken values.
2785          */
2786         if(dev->refreshSkip > dev->param.refreshPeriod)
2787                 dev->refreshSkip = dev->param.refreshPeriod;
2788
2789         if(dev->refreshSkip > 0){
2790                 dev->refreshSkip--;
2791                 return oldest;
2792         }
2793
2794         /*
2795          * Refresh skip is now zero.
2796          * We'll do a refresh this time around....
2797          * Update the refresh skip and find the oldest block.
2798          */
2799         dev->refreshSkip = dev->param.refreshPeriod;
2800         dev->refreshCount++;
2801
2802         for (b = dev->internalStartBlock; b <=dev->internalEndBlock; b++){
2803
2804                 bi = yaffs_GetBlockInfo(dev, b);
2805
2806
2807                 if (bi->blockState == YAFFS_BLOCK_STATE_FULL){
2808
2809                         if(oldest < 1 ||
2810                                 bi->sequenceNumber < oldestSequence){
2811                                 oldest = b;
2812                                 oldestSequence = bi->sequenceNumber;
2813                         }
2814                 }
2815         }
2816
2817         if (oldest > 0) {
2818                 T(YAFFS_TRACE_GC,
2819                   (TSTR("GC refresh count %d selected block %d with sequenceNumber %d" TENDSTR),
2820                    dev->refreshCount, oldest, oldestSequence));
2821         }
2822
2823         return oldest;
2824 }
2825
2826 /*
2827  * FindDiretiestBlock is used to select the dirtiest block (or close enough)
2828  * for garbage collection.
2829  */
2830
2831 static int yaffs_FindBlockForGarbageCollection(yaffs_Device *dev,
2832                                         int aggressive)
2833 {
2834         int b = dev->currentDirtyChecker;
2835
2836         int i;
2837         int iterations;
2838         int dirtiest = -1;
2839         int pagesInUse = 0;
2840         int prioritised = 0;
2841         yaffs_BlockInfo *bi;
2842         int pendingPrioritisedExist = 0;
2843
2844         /* First let's see if we need to grab a prioritised block */
2845         if (dev->hasPendingPrioritisedGCs) {
2846                 for (i = dev->internalStartBlock; i < dev->internalEndBlock && !prioritised; i++) {
2847
2848                         bi = yaffs_GetBlockInfo(dev, i);
2849                         /* yaffs_VerifyBlock(dev,bi,i); */
2850
2851                         if (bi->gcPrioritise) {
2852                                 pendingPrioritisedExist = 1;
2853                                 if (bi->blockState == YAFFS_BLOCK_STATE_FULL &&
2854                                    yaffs_BlockNotDisqualifiedFromGC(dev, bi)) {
2855                                         pagesInUse = (bi->pagesInUse - bi->softDeletions);
2856                                         dirtiest = i;
2857                                         prioritised = 1;
2858                                         aggressive = 1; /* Fool the non-aggressive skip logiv below */
2859                                 }
2860                         }
2861                 }
2862
2863                 if (!pendingPrioritisedExist) /* None found, so we can clear this */
2864                         dev->hasPendingPrioritisedGCs = 0;
2865         }
2866
2867         /* If we're doing aggressive GC then we are happy to take a less-dirty block, and
2868          * search harder.
2869          * else (we're doing a leasurely gc), then we only bother to do this if the
2870          * block has only a few pages in use.
2871          */
2872
2873         dev->nonAggressiveSkip--;
2874
2875         if (!aggressive && (dev->nonAggressiveSkip > 0))
2876                 return -1;
2877
2878         if (!prioritised)
2879                 pagesInUse =
2880                         (aggressive) ? dev->param.nChunksPerBlock : YAFFS_PASSIVE_GC_CHUNKS + 1;
2881
2882         if (aggressive)
2883                 iterations =
2884                     dev->internalEndBlock - dev->internalStartBlock + 1;
2885         else {
2886                 iterations =
2887                     dev->internalEndBlock - dev->internalStartBlock + 1;
2888                 iterations = iterations / 16;
2889                 if (iterations > 200)
2890                         iterations = 200;
2891         }
2892
2893         for (i = 0; i <= iterations && pagesInUse > 0 && !prioritised; i++) {
2894                 b++;
2895                 if (b < dev->internalStartBlock || b > dev->internalEndBlock)
2896                         b = dev->internalStartBlock;
2897
2898                 if (b < dev->internalStartBlock || b > dev->internalEndBlock) {
2899                         T(YAFFS_TRACE_ERROR,
2900                           (TSTR("**>> Block %d is not valid" TENDSTR), b));
2901                         YBUG();
2902                 }
2903
2904                 bi = yaffs_GetBlockInfo(dev, b);
2905
2906                 if (bi->blockState == YAFFS_BLOCK_STATE_FULL &&
2907                         (bi->pagesInUse - bi->softDeletions) < pagesInUse &&
2908                                 yaffs_BlockNotDisqualifiedFromGC(dev, bi)) {
2909                         dirtiest = b;
2910                         pagesInUse = (bi->pagesInUse - bi->softDeletions);
2911                 }
2912         }
2913
2914         dev->currentDirtyChecker = b;
2915
2916         if (dirtiest > 0) {
2917                 T(YAFFS_TRACE_GC,
2918                   (TSTR("GC Selected block %d with %d free, prioritised:%d" TENDSTR), dirtiest,
2919                    dev->param.nChunksPerBlock - pagesInUse, prioritised));
2920         }
2921
2922         if (dirtiest > 0)
2923                 dev->nonAggressiveSkip = 4;
2924
2925         return dirtiest;
2926 }
2927
2928 static void yaffs_BlockBecameDirty(yaffs_Device *dev, int blockNo)
2929 {
2930         yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, blockNo);
2931
2932         int erasedOk = 0;
2933
2934         /* If the block is still healthy erase it and mark as clean.
2935          * If the block has had a data failure, then retire it.
2936          */
2937
2938         T(YAFFS_TRACE_GC | YAFFS_TRACE_ERASE,
2939                 (TSTR("yaffs_BlockBecameDirty block %d state %d %s"TENDSTR),
2940                 blockNo, bi->blockState, (bi->needsRetiring) ? "needs retiring" : ""));
2941
2942         yaffs_ClearOldestDirtySequence(dev,bi);
2943
2944         bi->blockState = YAFFS_BLOCK_STATE_DIRTY;
2945
2946         if (!bi->needsRetiring) {
2947                 yaffs_InvalidateCheckpoint(dev);
2948                 erasedOk = yaffs_EraseBlockInNAND(dev, blockNo);
2949                 if (!erasedOk) {
2950                         dev->nErasureFailures++;
2951                         T(YAFFS_TRACE_ERROR | YAFFS_TRACE_BAD_BLOCKS,
2952                           (TSTR("**>> Erasure failed %d" TENDSTR), blockNo));
2953                 }
2954         }
2955
2956         if (erasedOk &&
2957             ((yaffs_traceMask & YAFFS_TRACE_ERASE) || !yaffs_SkipVerification(dev))) {
2958                 int i;
2959                 for (i = 0; i < dev->param.nChunksPerBlock; i++) {
2960                         if (!yaffs_CheckChunkErased
2961                             (dev, blockNo * dev->param.nChunksPerBlock + i)) {
2962                                 T(YAFFS_TRACE_ERROR,
2963                                   (TSTR
2964                                    (">>Block %d erasure supposedly OK, but chunk %d not erased"
2965                                     TENDSTR), blockNo, i));
2966                         }
2967                 }
2968         }
2969
2970         if (erasedOk) {
2971                 /* Clean it up... */
2972                 bi->blockState = YAFFS_BLOCK_STATE_EMPTY;
2973                 bi->sequenceNumber = 0;
2974                 dev->nErasedBlocks++;
2975                 bi->pagesInUse = 0;
2976                 bi->softDeletions = 0;
2977                 bi->hasShrinkHeader = 0;
2978                 bi->skipErasedCheck = 1;  /* This is clean, so no need to check */
2979                 bi->gcPrioritise = 0;
2980                 yaffs_ClearChunkBits(dev, blockNo);
2981
2982                 T(YAFFS_TRACE_ERASE,
2983                   (TSTR("Erased block %d" TENDSTR), blockNo));
2984         } else {
2985                 dev->nFreeChunks -= dev->param.nChunksPerBlock; /* We lost a block of free space */
2986
2987                 yaffs_RetireBlock(dev, blockNo);
2988                 T(YAFFS_TRACE_ERROR | YAFFS_TRACE_BAD_BLOCKS,
2989                   (TSTR("**>> Block %d retired" TENDSTR), blockNo));
2990         }
2991 }
2992
2993 static int yaffs_FindBlockForAllocation(yaffs_Device *dev)
2994 {
2995         int i;
2996
2997         yaffs_BlockInfo *bi;
2998
2999         if (dev->nErasedBlocks < 1) {
3000                 /* Hoosterman we've got a problem.
3001                  * Can't get space to gc
3002                  */
3003                 T(YAFFS_TRACE_ERROR,
3004                   (TSTR("yaffs tragedy: no more erased blocks" TENDSTR)));
3005
3006                 return -1;
3007         }
3008
3009         /* Find an empty block. */
3010
3011         for (i = dev->internalStartBlock; i <= dev->internalEndBlock; i++) {
3012                 dev->allocationBlockFinder++;
3013                 if (dev->allocationBlockFinder < dev->internalStartBlock
3014                     || dev->allocationBlockFinder > dev->internalEndBlock) {
3015                         dev->allocationBlockFinder = dev->internalStartBlock;
3016                 }
3017
3018                 bi = yaffs_GetBlockInfo(dev, dev->allocationBlockFinder);
3019
3020                 if (bi->blockState == YAFFS_BLOCK_STATE_EMPTY) {
3021                         bi->blockState = YAFFS_BLOCK_STATE_ALLOCATING;
3022                         dev->sequenceNumber++;
3023                         bi->sequenceNumber = dev->sequenceNumber;
3024                         dev->nErasedBlocks--;
3025                         T(YAFFS_TRACE_ALLOCATE,
3026                           (TSTR("Allocated block %d, seq  %d, %d left" TENDSTR),
3027                            dev->allocationBlockFinder, dev->sequenceNumber,
3028                            dev->nErasedBlocks));
3029                         return dev->allocationBlockFinder;
3030                 }
3031         }
3032
3033         T(YAFFS_TRACE_ALWAYS,
3034           (TSTR
3035            ("yaffs tragedy: no more erased blocks, but there should have been %d"
3036             TENDSTR), dev->nErasedBlocks));
3037
3038         return -1;
3039 }
3040
3041
3042
3043 static int yaffs_CalcCheckpointBlocksRequired(yaffs_Device *dev)
3044 {
3045         if (!dev->nCheckpointBlocksRequired &&
3046            dev->param.isYaffs2) {
3047                 /* Not a valid value so recalculate */
3048                 int nBytes = 0;
3049                 int nBlocks;
3050                 int devBlocks = (dev->param.endBlock - dev->param.startBlock + 1);
3051                 int tnodeSize = yaffs_CalcTnodeSize(dev);
3052
3053                 nBytes += sizeof(yaffs_CheckpointValidity);
3054                 nBytes += sizeof(yaffs_CheckpointDevice);
3055                 nBytes += devBlocks * sizeof(yaffs_BlockInfo);
3056                 nBytes += devBlocks * dev->chunkBitmapStride;
3057                 nBytes += (sizeof(yaffs_CheckpointObject) + sizeof(__u32)) * (dev->nObjectsCreated - dev->nFreeObjects);
3058                 nBytes += (tnodeSize + sizeof(__u32)) * (dev->nTnodesCreated - dev->nFreeTnodes);
3059                 nBytes += sizeof(yaffs_CheckpointValidity);
3060                 nBytes += sizeof(__u32); /* checksum*/
3061
3062                 /* Round up and add 2 blocks to allow for some bad blocks, so add 3 */
3063
3064                 nBlocks = (nBytes/(dev->nDataBytesPerChunk * dev->param.nChunksPerBlock)) + 3;
3065
3066                 dev->nCheckpointBlocksRequired = nBlocks;
3067         }
3068
3069         return dev->nCheckpointBlocksRequired;
3070 }
3071
3072 /*
3073  * Check if there's space to allocate...
3074  * Thinks.... do we need top make this ths same as yaffs_GetFreeChunks()?
3075  */
3076 static int yaffs_CheckSpaceForAllocation(yaffs_Device *dev)
3077 {
3078         int reservedChunks;
3079         int reservedBlocks = dev->param.nReservedBlocks;
3080         int checkpointBlocks;
3081
3082         if (dev->param.isYaffs2) {
3083                 checkpointBlocks =  yaffs_CalcCheckpointBlocksRequired(dev) -
3084                                     dev->blocksInCheckpoint;
3085                 if (checkpointBlocks < 0)
3086                         checkpointBlocks = 0;
3087         } else {
3088                 checkpointBlocks = 0;
3089         }
3090
3091         reservedChunks = ((reservedBlocks + checkpointBlocks) * dev->param.nChunksPerBlock);
3092
3093         return (dev->nFreeChunks > reservedChunks);
3094 }
3095
3096 static int yaffs_AllocateChunk(yaffs_Device *dev, int useReserve,
3097                 yaffs_BlockInfo **blockUsedPtr)
3098 {
3099         int retVal;
3100         yaffs_BlockInfo *bi;
3101
3102         if (dev->allocationBlock < 0) {
3103                 /* Get next block to allocate off */
3104                 dev->allocationBlock = yaffs_FindBlockForAllocation(dev);
3105                 dev->allocationPage = 0;
3106         }
3107
3108         if (!useReserve && !yaffs_CheckSpaceForAllocation(dev)) {
3109                 /* Not enough space to allocate unless we're allowed to use the reserve. */
3110                 return -1;
3111         }
3112
3113         if (dev->nErasedBlocks < dev->param.nReservedBlocks
3114                         && dev->allocationPage == 0) {
3115                 T(YAFFS_TRACE_ALLOCATE, (TSTR("Allocating reserve" TENDSTR)));
3116         }
3117
3118         /* Next page please.... */
3119         if (dev->allocationBlock >= 0) {
3120                 bi = yaffs_GetBlockInfo(dev, dev->allocationBlock);
3121
3122                 retVal = (dev->allocationBlock * dev->param.nChunksPerBlock) +
3123                         dev->allocationPage;
3124                 bi->pagesInUse++;
3125                 yaffs_SetChunkBit(dev, dev->allocationBlock,
3126                                 dev->allocationPage);
3127
3128                 dev->allocationPage++;
3129
3130                 dev->nFreeChunks--;
3131
3132                 /* If the block is full set the state to full */
3133                 if (dev->allocationPage >= dev->param.nChunksPerBlock) {
3134                         bi->blockState = YAFFS_BLOCK_STATE_FULL;
3135                         dev->allocationBlock = -1;
3136                 }
3137
3138                 if (blockUsedPtr)
3139                         *blockUsedPtr = bi;
3140
3141                 return retVal;
3142         }
3143
3144         T(YAFFS_TRACE_ERROR,
3145                         (TSTR("!!!!!!!!! Allocator out !!!!!!!!!!!!!!!!!" TENDSTR)));
3146
3147         return -1;
3148 }
3149
3150 static int yaffs_GetErasedChunks(yaffs_Device *dev)
3151 {
3152         int n;
3153
3154         n = dev->nErasedBlocks * dev->param.nChunksPerBlock;
3155
3156         if (dev->allocationBlock > 0)
3157                 n += (dev->param.nChunksPerBlock - dev->allocationPage);
3158
3159         return n;
3160
3161 }
3162
3163 /*
3164  * yaffs_SkipRestOfBlock() skips over the rest of the allocation block
3165  * if we don't want to write to it.
3166  */
3167 static void yaffs_SkipRestOfBlock(yaffs_Device *dev)
3168 {
3169         if(dev->allocationBlock > 0){
3170                 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, dev->allocationBlock);
3171                 if(bi->blockState == YAFFS_BLOCK_STATE_ALLOCATING){
3172                         bi->blockState = YAFFS_BLOCK_STATE_FULL;
3173                         dev->allocationBlock = -1;
3174                 }
3175         }
3176 }
3177
3178
3179 static int yaffs_GarbageCollectBlock(yaffs_Device *dev, int block,
3180                 int wholeBlock)
3181 {
3182         int oldChunk;
3183         int newChunk;
3184         int markNAND;
3185         int retVal = YAFFS_OK;
3186         int cleanups = 0;
3187         int i;
3188         int isCheckpointBlock;
3189         int matchingChunk;
3190         int maxCopies;
3191
3192         int chunksBefore = yaffs_GetErasedChunks(dev);
3193         int chunksAfter;
3194
3195         yaffs_ExtendedTags tags;
3196
3197         yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, block);
3198
3199         yaffs_Object *object;
3200
3201         isCheckpointBlock = (bi->blockState == YAFFS_BLOCK_STATE_CHECKPOINT);
3202
3203
3204         T(YAFFS_TRACE_TRACING,
3205                         (TSTR("Collecting block %d, in use %d, shrink %d, wholeBlock %d" TENDSTR),
3206                          block,
3207                          bi->pagesInUse,
3208                          bi->hasShrinkHeader,
3209                          wholeBlock));
3210
3211         /*yaffs_VerifyFreeChunks(dev); */
3212
3213         if(bi->blockState == YAFFS_BLOCK_STATE_FULL)
3214                 bi->blockState = YAFFS_BLOCK_STATE_COLLECTING;
3215
3216         bi->hasShrinkHeader = 0;        /* clear the flag so that the block can erase */
3217
3218         /* Take off the number of soft deleted entries because
3219          * they're going to get really deleted during GC.
3220          */
3221         if(dev->gcChunk == 0) /* first time through for this block */
3222                 dev->nFreeChunks -= bi->softDeletions;
3223
3224         dev->isDoingGC = 1;
3225
3226         if (isCheckpointBlock ||
3227                         !yaffs_StillSomeChunkBits(dev, block)) {
3228                 T(YAFFS_TRACE_TRACING,
3229                                 (TSTR
3230                                  ("Collecting block %d that has no chunks in use" TENDSTR),
3231                                  block));
3232                 yaffs_BlockBecameDirty(dev, block);
3233         } else {
3234
3235                 __u8 *buffer = yaffs_GetTempBuffer(dev, __LINE__);
3236
3237                 yaffs_VerifyBlock(dev, bi, block);
3238
3239                 maxCopies = (wholeBlock) ? dev->param.nChunksPerBlock : 10;
3240                 oldChunk = block * dev->param.nChunksPerBlock + dev->gcChunk;
3241
3242                 for (/* init already done */;
3243                      retVal == YAFFS_OK &&
3244                      dev->gcChunk < dev->param.nChunksPerBlock &&
3245                      (bi->blockState == YAFFS_BLOCK_STATE_COLLECTING) &&
3246                      maxCopies > 0;
3247                      dev->gcChunk++, oldChunk++) {
3248                         if (yaffs_CheckChunkBit(dev, block, dev->gcChunk)) {
3249
3250                                 /* This page is in use and might need to be copied off */
3251
3252                                 maxCopies--;
3253
3254                                 markNAND = 1;
3255
3256                                 yaffs_InitialiseTags(&tags);
3257
3258                                 yaffs_ReadChunkWithTagsFromNAND(dev, oldChunk,
3259                                                                 buffer, &tags);
3260
3261                                 object =
3262                                     yaffs_FindObjectByNumber(dev,
3263                                                              tags.objectId);
3264
3265                                 T(YAFFS_TRACE_GC_DETAIL,
3266                                   (TSTR
3267                                    ("Collecting chunk in block %d, %d %d %d " TENDSTR),
3268                                    dev->gcChunk, tags.objectId, tags.chunkId,
3269                                    tags.byteCount));
3270
3271                                 if (object && !yaffs_SkipVerification(dev)) {
3272                                         if (tags.chunkId == 0)
3273                                                 matchingChunk = object->hdrChunk;
3274                                         else if (object->softDeleted)
3275                                                 matchingChunk = oldChunk; /* Defeat the test */
3276                                         else
3277                                                 matchingChunk = yaffs_FindChunkInFile(object, tags.chunkId, NULL);
3278
3279                                         if (oldChunk != matchingChunk)
3280                                                 T(YAFFS_TRACE_ERROR,
3281                                                   (TSTR("gc: page in gc mismatch: %d %d %d %d"TENDSTR),
3282                                                   oldChunk, matchingChunk, tags.objectId, tags.chunkId));
3283
3284                                 }
3285
3286                                 if (!object) {
3287                                         T(YAFFS_TRACE_ERROR,
3288                                           (TSTR
3289                                            ("page %d in gc has no object: %d %d %d "
3290                                             TENDSTR), oldChunk,
3291                                             tags.objectId, tags.chunkId, tags.byteCount));
3292                                 }
3293
3294                                 if (object &&
3295                                     object->deleted &&
3296                                     object->softDeleted &&
3297                                     tags.chunkId != 0) {
3298                                         /* Data chunk in a soft deleted file, throw it away
3299                                          * It's a soft deleted data chunk,
3300                                          * No need to copy this, just forget about it and
3301                                          * fix up the object.
3302                                          */
3303
3304                                         object->nDataChunks--;
3305
3306                                         if (object->nDataChunks <= 0) {
3307                                                 /* remeber to clean up the object */
3308                                                 dev->gcCleanupList[cleanups] =
3309                                                     tags.objectId;
3310                                                 cleanups++;
3311                                         }
3312                                         markNAND = 0;
3313                                 } else if (0) {
3314                                         /* Todo object && object->deleted && object->nDataChunks == 0 */
3315                                         /* Deleted object header with no data chunks.
3316                                          * Can be discarded and the file deleted.
3317                                          */
3318                                         object->hdrChunk = 0;
3319                                         yaffs_FreeTnode(object->myDev,
3320                                                         object->variant.
3321                                                         fileVariant.top);
3322                                         object->variant.fileVariant.top = NULL;
3323                                         yaffs_DoGenericObjectDeletion(object);
3324
3325                                 } else if (object) {
3326                                         /* It's either a data chunk in a live file or
3327                                          * an ObjectHeader, so we're interested in it.
3328                                          * NB Need to keep the ObjectHeaders of deleted files
3329                                          * until the whole file has been deleted off
3330                                          */
3331                                         tags.serialNumber++;
3332
3333                                         dev->nGCCopies++;
3334
3335                                         if (tags.chunkId == 0) {
3336                                                 /* It is an object Id,
3337                                                  * We need to nuke the shrinkheader flags first
3338                                                  * Also need to clean up shadowing.
3339                                                  * We no longer want the shrinkHeader flag since its work is done
3340                                                  * and if it is left in place it will mess up scanning.
3341                                                  */
3342
3343                                                 yaffs_ObjectHeader *oh;
3344                                                 oh = (yaffs_ObjectHeader *)buffer;
3345                                                 oh->isShrink = 0;
3346                                                 tags.extraIsShrinkHeader = 0;
3347                                                 oh->shadowsObject = 0;
3348                                                 oh->inbandShadowsObject = 0;
3349                                                 if(object->variantType == YAFFS_OBJECT_TYPE_FILE)
3350                                                         oh->fileSize = object->variant.fileVariant.fileSize;
3351                                                 tags.extraShadows = 0;
3352
3353                                                 yaffs_VerifyObjectHeader(object, oh, &tags, 1);
3354                                                 newChunk =
3355                                                     yaffs_WriteNewChunkWithTagsToNAND(dev,(__u8 *) oh, &tags, 1);
3356                                         } else
3357                                                 newChunk =
3358                                                     yaffs_WriteNewChunkWithTagsToNAND(dev, buffer, &tags, 1);
3359
3360                                         if (newChunk < 0) {
3361                                                 retVal = YAFFS_FAIL;
3362                                         } else {
3363
3364                                                 /* Ok, now fix up the Tnodes etc. */
3365
3366                                                 if (tags.chunkId == 0) {
3367                                                         /* It's a header */
3368                                                         object->hdrChunk =  newChunk;
3369                                                         object->serial =   tags.serialNumber;
3370                                                 } else {
3371                                                         /* It's a data chunk */
3372