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