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