-
Notifications
You must be signed in to change notification settings - Fork 0
/
tfs.c
1750 lines (1406 loc) · 41.1 KB
/
tfs.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "tfs.h"
/**
* Test if the PATH start with FILE://
*/
void testStartOfPath(const char *path) {
if (path[0] == 'F' && path[1] == 'I' && path[2] == 'L' && path[3] == 'E'
&& path[4] == ':' && path[5] == '/' && path[6] == '/') {
}
else {
error er;
er.val = 1;
er.message = "The PATH do not start with FILE://";
testerror(er);
}
}
/**
* Tokenize argl every "/" in array of tokens ( argv )
* return the number of value in argv
*/
int tokenize_Path(char* argl, char** argv) {
int i;
argv[0] = strtok(argl, "/");
for (i = 0; argv[i] != NULL; ++i)
argv[i+1] = strtok(NULL, "/");
return i;
}
/**
* Print the array of tokens
*/
void printTokenPath(int size,char** tokens) {
int i;
for (i = 0; i < size; i++) {
printf("%s \n", tokens[i]);
}
}
/**
* return the array of tokens with one step forward
*/
char** iterateInPath(char** tokens, int * size) {
char ** tok2;
if (*size > 0) {
*size = *size - 1;
tok2 = &(tokens[1]);
}else{
error er;
er.val=1;
er.message="iterate limit of Path OR PATH INCORRECT!!";
testerror(er);
}
return tok2;
}
/**
*Test SIZE of a nameEntry and if it end by \0
*return the size of the nameEntry
*/
int testNameEntry(char* nameEntry){
error er;
int ASCII_END_FOUND = 0;
int sizeNameEntry=0;
int i;
for (i = 0; i < SIZE_MAX_NAME_ENTRY; i++) {
if (nameEntry[i] == '\0') {
sizeNameEntry=i;
ASCII_END_FOUND = 1;
break;
}
sizeNameEntry++;
}
if(sizeNameEntry<1){
er.val = 1;
er.message = "the name of the folder is smaller than 1 characters :\n";
testerror(er);
}
if (!ASCII_END_FOUND) {
er.val = 1;
er.message = "the name of the folder is bigger than SIZE_MAX_NAME_ENTRY :\n ";
testerror(er);
}
return sizeNameEntry;
}
/**
*Do a copy of path in copyPath without the start of path
*/
void copyConstPathWithoutStart(const char *path, char copyPath[]) {
int i;
//copy of the const path in copyPah
for (i = 0; i < MAX_SIZE_PATH; i++) {
if (path[i] != '\0') {
//+7 -> we dont need FILE://
copyPath[i] = path[i + 7];
} else {
break;
}
}
}
/**
* Verification of Path and creation of variable for the next operations
*/
int initPath_Size(const char *path, int *size,char **tabOfPath) {
testStartOfPath(path);
char copyPath[MAX_SIZE_PATH];
copyConstPathWithoutStart(path, copyPath);
*size = tokenize_Path(copyPath, tabOfPath);
//the user want create or delete in the HOST
if (strcmp(tabOfPath[0], "HOST") == 0) {
perror("use the unix command instead");
return -1;
/*
//1 step
tabOfPath=iterateInPath(tabOfPath,&size);
int succes=-1;
if (FLAG == FLAG_RMDIR) {
succes = rmdir(path);
}else if(FLAG == FLAG_MKDIR){
succes = mkdir(path, mode);
}
if(succes==-1){
er.val=1;
er.message="ERROR MKDIR IN HOST";
//testerror(er);
}
return 0;
*/
}
return 0;
}
uint32_t static getblockNumber_Of_File(uint32_t nbFile);
uint32_t static positionInBlock_Of_File(uint32_t nbFile ,uint32_t blockNumber);
error static add_OF_FLAG_FreeListe(partition p, uint32_t numberOfValueToAdd, int FLAG);
uint32_t static remove_OF_FLAG_FreeListe(partition p, int FLAG);
// the numbering of block start at 0 in every partition , the block 0 is the TTTFS Description Block
error static readBlockOfPartition (partition p,block b,uint32_t numberBlock);
error static writeBlockOfPartition (partition p,block b,uint32_t numberBlock);
file* initFile();
file* getFile_Of_FileTab(partition p,uint32_t nbFile);
error static writeFile_Of_FileTab(partition p,file* file);
descriptionBlock* initDescriptionBlock();
error static readDescriptionBlock(partition p, descriptionBlock* dB);
error static writeDescriptionBlock(partition p,descriptionBlock* dB);
int static insertInFolderIndirect(partition p, file* fileParent,
char* nameEntry, int numberOfNewFile ,block* b1,int numberB1 ,int iter);
int static insertInBlock(block * b, uint32_t nbFileParent,char* nameEntry,int numberOfNewFile);
int static insertInFolder(partition p, file* fileParent,char* nameEntry,int numberOfNewFile);
error static addEntry(partition p,uint32_t parentFolder , char* nameEntry,int FLAG);
error static deleteEntry(partition p,uint32_t nbFileParent ,uint32_t nbFile, int FLAG_SECURE , int FOLDER_OPTION);
void static delete_File_Indirect2(partition p, uint32_t nbBlock, int FLAG, int FLAG_SECURE);
void static delete_File_Indirect1(partition p, uint32_t nbBlock,int FLAG, int FLAG_SECURE);
void static delete_File_Direct(partition p, uint32_t nbBlock, int FLAG, int FLAG_SECURE);
void static cleanBlock(partition p, uint32_t nbBlock , int FLAG,int FLAG_SECURE);
uint32_t static searchEntryInFolder(partition p, uint32_t parentFolder,uint32_t nbFile ,char *nameEntry, int FLAG_SEARCH);
uint32_t static searchEntryInBlock(block * b, uint32_t nbBlock,uint32_t nbFile,char* nameEntry , int FLAG_SEARCH);
int static createEmptyEntry(partition p, uint32_t parentFolder,int FLAG);
int static initDisk_Partition(disk_id *disk, partition *p, char **tabOfPath, int *size);
int static tfs_RM_MK_DIR(const char *path, mode_t mode , int FLAG);
/********************************************************/
/**
*
*/
// Tableau de toutes les structures de fichier.
tfs_FILE tabOfFiles[tfs_BUFSIZ]={};
/**
* Format the partition (nbpartition ) of a File ( nameFile ) with Max files
*/
int tfs_format(char* nameFile,int nbPartition,int maxFiles){
error er;
disk_id *disk = malloc(sizeof(*disk));
if(disk==NULL){
er.val=1;
er.message="ERROR MALLOC disk in TFS_FORMAT";
testerror(er);
}
/********************************************************/
/**
* TTTFS Description Block
*/
block *b;
b = initBlock();
er = start_disk(nameFile, disk);
testerror(er);
int positionFirstBlock=firstblockPositionOfPartition(nbPartition,*disk);
int sizePartition=getSizePartition(nbPartition,*disk);
if(positionFirstBlock ==-1){
er.val=1;
er.message="The partition selected do not exist in the tfs";
testerror(er);
}
partition *p=malloc(sizeof(partition));
if(p==NULL){
er.val=1;
er.message="ERROR MALLOC partition in TFS_FORMAT";
testerror(er);
}
p->disque=disk;
p->firstPositionInTFS=positionFirstBlock;
er=readBlockOfPartition(*p,*b,0);
testerror(er);
if(nombre32bitsToValue(b->valeur[0])==TTTFS_MAGIC_NUMBER){
fprintf(stderr, "the partition already have "
"the magic number so tfs_format already been use \n");
return 1;
}
int nbFreeBlock =sizePartition-1;
/********************************************************/
/** MAX FILE
*
*/
int nbOfBlockForFileTab = maxFiles/(TTTFS_NUMBER_OF_FILE_IN_ONE_BLOCK);
nbOfBlockForFileTab++;
//printf("\n nb of block for file tab : %d\n",nbOfBlockForFileTab);
//+1 is the root folder un-delatable
if(nbFreeBlock-(nbOfBlockForFileTab+maxFiles+1)<0){
fprintf(stderr, "\n-mf file_count argument,"
" the number of maximum files enter : %d is NOT CORRECT \n"
"because is bigger than what is possible even, if all files have the minimun size.\n"
"The maxmimum is %d files in this partition\n",maxFiles,
nbFreeBlock-(nbOfBlockForFileTab+1));
return 1;
}
free(b->valeur[0]);
b->valeur[0] = valueToNombre32bits(TTTFS_MAGIC_NUMBER);
free(b->valeur[1]);
b->valeur[1] = valueToNombre32bits(TFS_VOLUME_BLOCK_SIZE);
free(b->valeur[2]);
b->valeur[2] = valueToNombre32bits(sizePartition);
//-1 because of the root
free(b->valeur[5]);
b->valeur[5] = valueToNombre32bits(maxFiles);
/********************************************************/
/**
* WRITE BLOCK OF DESCRIPTION
*/
er=writeBlockOfPartition(*p,*b,0);
testerror(er);
/********************************************************/
/**
* TTTFS File Table
*/
maxFiles=maxFiles+1;// to add the ROOT un-delatable
int i;
for(i=maxFiles-1; i>-1 ; i--){
er=add_OF_FLAG_FreeListe(*p,i,FLAG_FILE);
testerror(er);
}
/********************************************************/
/**
* TTTFS Data blocks & Free Blocks Chain
*/
int j;
int limit = nbOfBlockForFileTab;
for(j=sizePartition-1;j>limit;j--){
er=add_OF_FLAG_FreeListe(*p,j,FLAG_BLOCK);
testerror(er);
}
/********************************************************/
/**
* CREATE THE ROOT
*/
int result=createEmptyEntry(*p,0,FLAG_ENTRY_FOLDER);
if(result==-1){
er.val=1;
er.message="error at creation of root folder , you should retry tfs_format";
testerror(er);
}
/********************************************************/
/**
* FREE MEMORY
*/
freeBlock(b);
stop_disk(*disk);
freeDisk(disk);
free(p);
printf("SUCCES -> Format of %s\n",nameFile);
return 0;
}
/**
* determine the blocknumber of the partition where is located the nbfile file
*/
uint32_t getblockNumber_Of_File(uint32_t nbFile) {
if (nbFile < 0) {
error er;
er.val = 1;
er.message = "in getblockNumber_Of_File the value of nbFile is <1 ";
testerror(er);
}
return (nbFile / (TTTFS_NUMBER_OF_FILE_IN_ONE_BLOCK)) + 1;
}
//determine the position of the nbfile fil in the blocknumber of the partition
uint32_t positionInBlock_Of_File(uint32_t nbFile, uint32_t blockNumber) {
if (blockNumber < 0) {
error er;
er.val = 1;
er.message =
"in positionInBlock_Of_File the value of blockNumber is negative or 0";
testerror(er);
}
if(nbFile >= TTTFS_NUMBER_OF_FILE_IN_ONE_BLOCK){
nbFile =nbFile % (TTTFS_NUMBER_OF_FILE_IN_ONE_BLOCK);
}
return nbFile*(TTTFS_NUMBER_OF_INT_IN_KEY_OF_FILE_TABLE);
/*else {
return nbFile*TTTFS_NUMBER_OF_FILE_IN_ONE_BLOCK
- ((blockNumber - 1) * TTTFS_NUMBER_OF_FILE_IN_ONE_BLOCK);
}*/
}
//return the file n of the FileTab
file* getFile_Of_FileTab(partition p, uint32_t nbFile) {
file * file=NULL;
file = initFile();
uint32_t blockNumber = getblockNumber_Of_File(nbFile);
uint32_t positionInBlock = positionInBlock_Of_File(nbFile, blockNumber);
error er;
block * b;
b = initBlock();
er = readBlockOfPartition(p, *b, blockNumber);
testerror(er);
file->tfs_size = nombre32bitsToValue(b->valeur[positionInBlock]);
file->tfs_type = nombre32bitsToValue(b->valeur[positionInBlock + 1]);
file->tfs_subtype = nombre32bitsToValue(b->valeur[positionInBlock + 2]);
//3 to 12 include
int i;
for (i = 0; i < DIRECT_TAB; i++) {
file->tfs_direct[i] = nombre32bitsToValue(
b->valeur[positionInBlock + 3 + i]);
}
file->tfs_indirect1 = nombre32bitsToValue(
b->valeur[positionInBlock + 3 + DIRECT_TAB]);
file->tfs_indirect2 = nombre32bitsToValue(
b->valeur[positionInBlock + 4 + DIRECT_TAB]);
file->tfs_next_free = nombre32bitsToValue(
b->valeur[positionInBlock + 5 + DIRECT_TAB]);
file->nbFile=nbFile;
freeBlock(b);
return file;
}
void static printFile(file* file) {
printf("-----FILE DESCRIPTION--\n");
printf("FILE NUMBER : %d\n", file->nbFile);
printf("tfs size : %d\n", file->tfs_size);
printf("tfs type : %d\n", file->tfs_type);
printf("tfs subtype : %d\n", file->tfs_subtype);
printf("tfs direct : \n");
int i;
for (i = 0; i < DIRECT_TAB; i++) {
printf("tfs direct[%d] : %d\n", i, file->tfs_direct[i]);
}
printf("tfs indirect1 : %d\n", file->tfs_indirect1);
printf("tfs indirect2 : %d\n", file->tfs_indirect2);
printf("tfs next_free : %d\n", file->tfs_next_free);
printf("----------------------\n");
}
//write the info of *file of the nbFile in the partition p
error static writeFile_Of_FileTab(partition p, file* file) {
error er;
uint32_t blockNumber = getblockNumber_Of_File(file->nbFile);
uint32_t positionInBlock = positionInBlock_Of_File(file->nbFile, blockNumber);
block * b;
b = initBlock();
er = readBlockOfPartition(p, *b, blockNumber);
testerror(er);
free(b->valeur[positionInBlock]);
b->valeur[positionInBlock] = valueToNombre32bits(file->tfs_size);
free(b->valeur[positionInBlock+1]);
b->valeur[positionInBlock + 1] = valueToNombre32bits(file->tfs_type);
free(b->valeur[positionInBlock+2]);
b->valeur[positionInBlock + 2] = valueToNombre32bits(file->tfs_subtype);
//3 to 12 include
int i;
for (i = 0; i < DIRECT_TAB; i++) {
free(b->valeur[positionInBlock+ 3 + i]);
b->valeur[positionInBlock + 3 + i] = valueToNombre32bits(
file->tfs_direct[i]);
}
free(b->valeur[positionInBlock + 3 + DIRECT_TAB]);
b->valeur[positionInBlock + 3 + DIRECT_TAB] = valueToNombre32bits(
file->tfs_indirect1);
free(b->valeur[positionInBlock + 4 + DIRECT_TAB]);
b->valeur[positionInBlock + 4 + DIRECT_TAB] = valueToNombre32bits(
file->tfs_indirect2);
free(b->valeur[positionInBlock + 5 + DIRECT_TAB]);
b->valeur[positionInBlock + 5 + DIRECT_TAB] = valueToNombre32bits(
file->tfs_next_free);
er = writeBlockOfPartition(p, *b, blockNumber);
freeBlock(b);
return er;
}
/********************************************************/
/**
* DELETE RECURSIVLY FILES IN BLOCK IF IT IS A FOLDER
* ADD FREE FILE TO FREE FILE LIST
* ADD FREE BLOCK TO FREE BLOCK LIST
* DELETE WITH SECURITY IF FLAG SECURE IS FLAG DELETE SECURE
*/
void static cleanBlock(partition p, uint32_t nbBlock, int FLAG_TYPE,
int FLAG_SECURE) {
error er;
block * b;
b = initBlock();
if (FLAG_TYPE == FLAG_ENTRY_FOLDER) {
er = readBlockOfPartition(p, *b, nbBlock);
int i;
int nbFile;
int positioninblock;
for (i = 0; i < TTTFS_VOLUME_BLOCK_SIZE;i = i + (SIZE_ENTRY_IN_FOLDER)) {
positioninblock = i / TFS_VOLUME_DIVISION_OCTAL;
//printf("dans clean val i : %d\n",i);
if (i < SIZE_ENTRY_IN_FOLDER * 2) {
} else {
nbFile = nombre32bitsToValue(b->valeur[positioninblock]);
if (nbFile != 0) {
deleteEntry(p, nbBlock, nbFile, FLAG_SECURE,
FLAG_DELETE_FOLDER);
er = add_OF_FLAG_FreeListe(p, nbFile, FLAG_FILE);
testerror(er);
}
}
}
}
freeBlock(b);
if (FLAG_SECURE == FLAG_DELETE_SECURE) {
block * b2;
b2 = initBlock();
er = writeBlockOfPartition(p, *b2, nbBlock);
testerror(er);
freeBlock(b2);
}
er = add_OF_FLAG_FreeListe(p, nbBlock, FLAG_BLOCK);
testerror(er);
}
void static delete_File_Direct(partition p, uint32_t nbBlock, int FLAG_TYPE, int FLAG_SECURE) {
error er;
cleanBlock(p, nbBlock, FLAG_TYPE,FLAG_SECURE);
er = add_OF_FLAG_FreeListe(p, nbBlock, FLAG_BLOCK);
testerror(er);
}
void static delete_File_Indirect1(partition p, uint32_t nbBlock,int FLAG_TYPE, int FLAG_SECURE) {
error er;
block *b;
b = initBlock();
er = readBlockOfPartition(p, *b, nbBlock);
testerror(er);
int i;
uint32_t tmp;
for (i = 0; i < TTTFS_VOLUME_BLOCK_SIZE ; i++) {
tmp = nombre32bitsToValue(b->valeur[i]);
if (tmp != 0) {
delete_File_Direct(p, tmp, FLAG_TYPE , FLAG_SECURE);
}
}
freeBlock(b);
}
void static delete_File_Indirect2(partition p, uint32_t nbBlock, int FLAG_TYPE, int FLAG_SECURE) {
error er;
block *b;
b = initBlock();
er = readBlockOfPartition(p, *b, nbBlock);
testerror(er);
int i;
uint32_t tmp;
for (i = 0; i < TTTFS_VOLUME_BLOCK_SIZE ; i++) {
tmp = nombre32bitsToValue(b->valeur[i]);
if (tmp != 0) {
delete_File_Indirect1(p, tmp, FLAG_TYPE, FLAG_SECURE);
}
}
freeBlock(b);
}
/**
* Delete nbfile from the disk and FileTab and the link inside the parent folder
*/
error static deleteEntry(partition p,uint32_t nbFileParent ,uint32_t nbFile, int FLAG_SECURE , int FLAG_FOLDER_OPTION) {
error er;
int FLAG_TYPE;
file * fileParent=NULL;
file * fileFolder=NULL;
fileParent = getFile_Of_FileTab(p, nbFileParent);
fileFolder = getFile_Of_FileTab(p, nbFile);
int succes = searchEntryInFolder(p, nbFileParent, nbFile, NULL,FLAG_SEARCH_DELETE);
if (succes != -2) {
er.val = -1;
er.message = "error delete";
return er;
}
//file->tfs_size = 0;
if(fileFolder->tfs_type == 0){
FLAG_TYPE=FLAG_ENTRY_FILE;
}
else if(fileFolder->tfs_type == 1 && FLAG_FOLDER_OPTION==FLAG_DELETE_FOLDER){
FLAG_TYPE=FLAG_ENTRY_FOLDER;
}
else{
er.val=1;
er.message="Impossible to delete a folder without option FOLDER";
testerror(er);
}
//file->tfs_subtype = 0;
int i;
for (i = 0; i < DIRECT_TAB; i++) {
if (fileFolder->tfs_direct[i] != 0) {
delete_File_Direct(p, fileFolder->tfs_direct[i],FLAG_TYPE, FLAG_DELETE_SECURE);
}
//file->tfs_direct[i] = 0;
}
if (fileFolder->tfs_indirect1 != 0) {
delete_File_Indirect1(p, fileFolder->tfs_indirect1,FLAG_TYPE, FLAG_DELETE_SECURE);
//file->tfs_indirect1 = 0;
}
if (fileFolder->tfs_indirect2 != 0) {
delete_File_Indirect2(p, fileFolder->tfs_indirect2,FLAG_TYPE, FLAG_DELETE_SECURE);
//file->tfs_indirect2 = 0;
}
//file->tfs_next_free = 0;
er=add_OF_FLAG_FreeListe(p,nbFile,FLAG_FILE);// add the new free file entry in the free file list
testerror(er);
fileParent->tfs_size=(fileParent->tfs_size)-(SIZE_ENTRY_IN_FOLDER);
er=writeFile_Of_FileTab(p,fileParent);
free(fileFolder);
free(fileParent);
er.val = 0;
er.message = "Delete SUCCES of file";
return er;
}
//read the numberBlock block of the p partition
error readBlockOfPartition(partition p, block b, uint32_t numberBlock) {
error er;
uint32_t positionOnTFS = (p.firstPositionInTFS) + numberBlock;
//printf("number block a lire : %d\n",positionOnTFS);
er = read_block(*(p.disque), b, positionOnTFS);
return er;
}
//write the numberBlock block of the p partition
error writeBlockOfPartition(partition p, block b, uint32_t numberBlock) {
error er;
uint32_t positionOnTFS = p.firstPositionInTFS + numberBlock;
er = write_block(*(p.disque), b, positionOnTFS);
return er;
}
descriptionBlock* initDescriptionBlock() {
descriptionBlock * dB = NULL;
dB= malloc(sizeof (descriptionBlock ));
if(dB==NULL){
error er;
er.val=1;
er.message="ERROR MALLOC initDescriptionBlock";
testerror(er);
}
return dB;
}
file* initFile() {
file * f = NULL;
f = malloc(sizeof(file));
if (f == NULL) {
error er;
er.val=1;
er.message="error malloc file in INITFILE ";
testerror(er);
}
f->nbFile=0;
int i;
for (i = 0; i < DIRECT_TAB; i++) {
f->tfs_direct[i] = 0;
}
f->tfs_indirect1 = 0;
f->tfs_indirect2 = 0;
f->tfs_size = 0;
f->tfs_subtype = 0;
f->tfs_type = 0;
f->tfs_next_free = 0;
return f;
}
/**
* the block or file entry is set to free
* FLAG is block or file
*/
error add_OF_FLAG_FreeListe(partition p, uint32_t numberOfValueToAdd, int FLAG) {
error er;
descriptionBlock * dB;
dB = initDescriptionBlock();
er = readDescriptionBlock(p, dB);
uint32_t old;
block * b;
file * file;
if (FLAG == FLAG_BLOCK) {
b = initBlock();
old = dB->volumeFirstFreeBlock;
// get the new first block
er = readBlockOfPartition(p, *b, numberOfValueToAdd);
testerror(er);
} else if (FLAG == FLAG_FILE) {
old = dB->volumeFirstFreeFile;
file = getFile_Of_FileTab(p, numberOfValueToAdd);
} else {
er.val = 1;
er.message = "BAD FLAG USE IN putBlockInFreeBlockList";
return er;
}
if (old != 0) {
if (FLAG == FLAG_BLOCK) {
//put at the end of the new first block the old first free block
free(b->valeur[TFS_VOLUME_NUMBER_VALUE_BY_BLOCK - 1]);
b->valeur[TFS_VOLUME_NUMBER_VALUE_BY_BLOCK - 1] =
valueToNombre32bits(old);
} else if (FLAG == FLAG_FILE) {
file->tfs_next_free = old;
}
} else {
//there is no free Block or free file in the list so the new free block/file tfs_next-free go on imself
if (FLAG == FLAG_BLOCK) {
free(b->valeur[TFS_VOLUME_NUMBER_VALUE_BY_BLOCK - 1]);
b->valeur[TFS_VOLUME_NUMBER_VALUE_BY_BLOCK - 1] =
valueToNombre32bits(numberOfValueToAdd);
} else if (FLAG == FLAG_FILE) {
//file = initFile();
//printf("dans ADD file number : %d",file->nbFile);
file->tfs_next_free = numberOfValueToAdd;
}
}
/********************************************************/
/**
* write the new block or the new free file of the filetab
*/
if (FLAG == FLAG_BLOCK) {
er = writeBlockOfPartition(p, *b, numberOfValueToAdd);
testerror(er);
//put in the descriptionBlock the new first free block
dB->volumeFirstFreeBlock = numberOfValueToAdd;
dB->volumeFreeBlockNb = (dB->volumeFreeBlockNb) + 1;
freeBlock(b);
} else if (FLAG == FLAG_FILE) {
er = writeFile_Of_FileTab(p,file);
testerror(er);
//put in the descriptionBlock the new first free file
dB->volumeFirstFreeFile = numberOfValueToAdd;
dB->volumeFreeFileNb = (dB->volumeFreeFileNb) + 1;
free(file);
}
/********************************************************/
/**
* //write the new descriptionBlock
*/
er = writeDescriptionBlock(p, dB);
testerror(er);
free(dB);
er.val = 0;
er.message = "new block or file add at first with succes";
return er;
}
/**
* Return the number of the removed Block or File in free List
* return -1 if free list is empty
*/
uint32_t remove_OF_FLAG_FreeListe(partition p, int FLAG) {
error er;
descriptionBlock * dB;
dB = initDescriptionBlock();
er = readDescriptionBlock(p, dB);
testerror(er);
uint32_t tmp;
uint32_t tmp2;
file * file;
block * b;
if (FLAG == FLAG_BLOCK) {
if (dB->volumeFreeBlockNb < 1) {
return -1;
}
tmp = dB->volumeFirstFreeBlock;
b = initBlock();
er = readBlockOfPartition(p, *b, tmp);
testerror(er);
tmp2 = nombre32bitsToValue(
b->valeur[TFS_VOLUME_NUMBER_VALUE_BY_BLOCK - 1]);
//b = initBlock();
} else if (FLAG == FLAG_FILE) {
if (dB->volumeFreeFileNb < 1) {
return -1;
}
tmp = dB->volumeFirstFreeFile;
//file = initFile();
file = getFile_Of_FileTab(p, tmp);
testerror(er);
tmp2 = file->tfs_next_free;
}
else {
er.val = 1;
er.message = "BAD FLAG USE IN putBlockInFreeBlockList";
testerror(er);
}
if (FLAG == FLAG_BLOCK) {
dB->volumeFirstFreeBlock = tmp2;
dB->volumeFreeBlockNb = (dB->volumeFreeBlockNb) - 1;
freeBlock(b);
} else if (FLAG == FLAG_FILE) {
dB->volumeFirstFreeFile = tmp2;
dB->volumeFreeFileNb = (dB->volumeFreeFileNb) - 1;
free(file);
}
er = writeDescriptionBlock(p, dB);
testerror(er);
free(dB);
return tmp;
}
error static readDescriptionBlock(partition p, descriptionBlock* dB) {
error er;
if (dB == NULL) {
er.val = 1;
er.message = "argument of readDescriptionBlock is NULL";
return er;
}
block * b;
b = initBlock();
er = readBlockOfPartition(p, *b, 0);
if (er.val != 0) {
return er;
}
dB->magic = nombre32bitsToValue(b->valeur[0]);
dB->volumeBlockSize = nombre32bitsToValue(b->valeur[1]);
dB->volumeBlockCount = nombre32bitsToValue(b->valeur[2]);
dB->volumeFreeBlockNb = nombre32bitsToValue(b->valeur[3]);
dB->volumeFirstFreeBlock = nombre32bitsToValue(b->valeur[4]);
dB->volumeMaxFile = nombre32bitsToValue(b->valeur[5]);
dB->volumeFreeFileNb = nombre32bitsToValue(b->valeur[6]);
dB->volumeFirstFreeFile = nombre32bitsToValue(b->valeur[7]);
freeBlock(b);
er.val = 0;
er.message = "readDescriptionBlock SUCCES";
return er;
}
error static writeDescriptionBlock(partition p, descriptionBlock* dB) {
error er;
block * b;
b = initBlock();
int i;
for(i=0 ; i<8 ; i++){
free(b->valeur[i]);
}
b->valeur[0] = valueToNombre32bits(dB->magic);
b->valeur[1] = valueToNombre32bits(dB->volumeBlockSize);
b->valeur[2] = valueToNombre32bits(dB->volumeBlockCount);
b->valeur[3] = valueToNombre32bits(dB->volumeFreeBlockNb);
b->valeur[4] = valueToNombre32bits(dB->volumeFirstFreeBlock);
b->valeur[5] = valueToNombre32bits(dB->volumeMaxFile);
b->valeur[6] = valueToNombre32bits(dB->volumeFreeFileNb);
b->valeur[7] = valueToNombre32bits(dB->volumeFirstFreeFile);
er = writeBlockOfPartition(p, *b, 0);
freeBlock(b);
return er;
}
/**
* return 1 if file is a folder
*/
int static isFolder(file* file) {
if (file == NULL) {
return -1;
}
if (file->tfs_type == 1) {
return 1;
} else {
return 0;
}
}
/**
* return the number of the new file in File Table of
*
* the new empty folder or the new empty file
*
* in all case the new entry have a Block in the directBlock
*
* return -1 if no more free file or free block available
*/
int createEmptyEntry(partition p, uint32_t parentFolder,int FLAG) {
error er;
uint32_t numberOfFile = remove_OF_FLAG_FreeListe(p, FLAG_FILE);
if(numberOfFile==-1){
return -1;
}
uint32_t numberOfBlock = remove_OF_FLAG_FreeListe(p, FLAG_BLOCK);
file * file=NULL;
file = getFile_Of_FileTab(p, numberOfFile);
if(numberOfBlock==-1){
//no more free block !!
er=add_OF_FLAG_FreeListe(p,numberOfFile,FLAG_FILE);
testerror(er);
free(file);
return -1;
}
//printf("numberblock : %d\n",numberOfBlock);
//printf("numberfile : %d\n",numberOfFile);
if (FLAG == FLAG_ENTRY_FOLDER) {