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