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