check.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883
  1. /* check.c - Check and repair a PC/MS-DOS file system
  2. Copyright (C) 1993 Werner Almesberger <werner.almesberger@lrc.di.epfl.ch>
  3. Copyright (C) 1998 Roman Hodek <Roman.Hodek@informatik.uni-erlangen.de>
  4. This program is free software: you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation, either version 3 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program. If not, see <http://www.gnu.org/licenses/>.
  14. On Debian systems, the complete text of the GNU General Public License
  15. can be found in /usr/share/common-licenses/GPL-3 file.
  16. */
  17. /* FAT32, VFAT, Atari format support, and various fixes additions May 1998
  18. * by Roman Hodek <Roman.Hodek@informatik.uni-erlangen.de> */
  19. #include <stdio.h>
  20. #include <stdlib.h>
  21. #include <string.h>
  22. #include <limits.h>
  23. #include <time.h>
  24. #include "common.h"
  25. #include "dosfsck.h"
  26. #include "io.h"
  27. #include "fat.h"
  28. #include "file.h"
  29. #include "lfn.h"
  30. #include "check.h"
  31. static DOS_FILE *root;
  32. /* get start field of a dir entry */
  33. #define FSTART(p,fs) \
  34. ((unsigned long)CF_LE_W(p->dir_ent.start) | \
  35. (fs->fat_bits == 32 ? CF_LE_W(p->dir_ent.starthi) << 16 : 0))
  36. #define MODIFY(p,i,v) \
  37. do { \
  38. if (p->offset) { \
  39. p->dir_ent.i = v; \
  40. fs_write(p->offset+offsetof(DIR_ENT,i), \
  41. sizeof(p->dir_ent.i),&p->dir_ent.i); \
  42. } \
  43. } while(0)
  44. #define MODIFY_START(p,v,fs) \
  45. do { \
  46. unsigned long __v = (v); \
  47. if (!p->offset) { \
  48. /* writing to fake entry for FAT32 root dir */ \
  49. if (!__v) die("Oops, deleting FAT32 root dir!"); \
  50. fs->root_cluster = __v; \
  51. p->dir_ent.start = CT_LE_W(__v&0xffff); \
  52. p->dir_ent.starthi = CT_LE_W(__v>>16); \
  53. __v = CT_LE_L(__v); \
  54. fs_write((loff_t)offsetof(struct boot_sector,root_cluster), \
  55. sizeof(((struct boot_sector *)0)->root_cluster), \
  56. &__v); \
  57. } \
  58. else { \
  59. MODIFY(p,start,CT_LE_W((__v)&0xffff)); \
  60. if (fs->fat_bits == 32) \
  61. MODIFY(p,starthi,CT_LE_W((__v)>>16)); \
  62. } \
  63. } while(0)
  64. loff_t alloc_rootdir_entry(DOS_FS *fs, DIR_ENT *de, const char *pattern)
  65. {
  66. static int curr_num = 0;
  67. loff_t offset;
  68. if (fs->root_cluster) {
  69. DIR_ENT d2;
  70. int i = 0, got = 0;
  71. unsigned long clu_num, prev = 0;
  72. loff_t offset2;
  73. clu_num = fs->root_cluster;
  74. offset = cluster_start(fs,clu_num);
  75. while (clu_num > 0 && clu_num != -1) {
  76. fs_read(offset,sizeof(DIR_ENT),&d2);
  77. if (IS_FREE(d2.name) && d2.attr != VFAT_LN_ATTR) {
  78. got = 1;
  79. break;
  80. }
  81. i += sizeof(DIR_ENT);
  82. offset += sizeof(DIR_ENT);
  83. if ((i % fs->cluster_size) == 0) {
  84. prev = clu_num;
  85. if ((clu_num = next_cluster(fs,clu_num)) == 0 || clu_num == -1)
  86. break;
  87. offset = cluster_start(fs,clu_num);
  88. }
  89. }
  90. if (!got) {
  91. /* no free slot, need to extend root dir: alloc next free cluster
  92. * after previous one */
  93. if (!prev)
  94. die("Root directory has no cluster allocated!");
  95. for (clu_num = prev+1; clu_num != prev; clu_num++) {
  96. if (clu_num >= fs->clusters+2) clu_num = 2;
  97. if (!fs->fat[clu_num].value)
  98. break;
  99. }
  100. if (clu_num == prev)
  101. die("Root directory full and no free cluster");
  102. set_fat(fs,prev,clu_num);
  103. set_fat(fs,clu_num,-1);
  104. set_owner(fs, clu_num, get_owner(fs, fs->root_cluster));
  105. /* clear new cluster */
  106. memset( &d2, 0, sizeof(d2) );
  107. offset = cluster_start(fs,clu_num);
  108. for( i = 0; i < fs->cluster_size; i += sizeof(DIR_ENT) )
  109. fs_write( offset+i, sizeof(d2), &d2 );
  110. }
  111. memset(de,0,sizeof(DIR_ENT));
  112. while (1) {
  113. sprintf(de->name,pattern,curr_num);
  114. clu_num = fs->root_cluster;
  115. i = 0;
  116. offset2 = cluster_start(fs,clu_num);
  117. while (clu_num > 0 && clu_num != -1) {
  118. fs_read(offset2,sizeof(DIR_ENT),&d2);
  119. if (offset2 != offset &&
  120. !strncmp(d2.name,de->name,MSDOS_NAME))
  121. break;
  122. i += sizeof(DIR_ENT);
  123. offset2 += sizeof(DIR_ENT);
  124. if ((i % fs->cluster_size) == 0) {
  125. if ((clu_num = next_cluster(fs,clu_num)) == 0 ||
  126. clu_num == -1)
  127. break;
  128. offset2 = cluster_start(fs,clu_num);
  129. }
  130. }
  131. if (clu_num == 0 || clu_num == -1)
  132. break;
  133. if (++curr_num >= 10000) die("Unable to create unique name");
  134. }
  135. }
  136. else {
  137. DIR_ENT *root;
  138. int next_free = 0, scan;
  139. root = alloc(fs->root_entries*sizeof(DIR_ENT));
  140. fs_read(fs->root_start,fs->root_entries*sizeof(DIR_ENT),root);
  141. while (next_free < fs->root_entries)
  142. if (IS_FREE(root[next_free].name) &&
  143. root[next_free].attr != VFAT_LN_ATTR)
  144. break;
  145. else next_free++;
  146. if (next_free == fs->root_entries)
  147. die("Root directory is full.");
  148. offset = fs->root_start+next_free*sizeof(DIR_ENT);
  149. memset(de,0,sizeof(DIR_ENT));
  150. while (1) {
  151. sprintf(de->name,pattern,curr_num);
  152. for (scan = 0; scan < fs->root_entries; scan++)
  153. if (scan != next_free &&
  154. !strncmp(root[scan].name,de->name,MSDOS_NAME))
  155. break;
  156. if (scan == fs->root_entries) break;
  157. if (++curr_num >= 10000) die("Unable to create unique name");
  158. }
  159. free(root);
  160. }
  161. ++n_files;
  162. return offset;
  163. }
  164. static char *path_name(DOS_FILE *file)
  165. {
  166. static char path[PATH_MAX*2];
  167. if (!file) *path = 0;
  168. else {
  169. if (strlen(path_name(file->parent)) > PATH_MAX)
  170. die("Path name too long.");
  171. if (strcmp(path,"/") != 0) strcat(path,"/");
  172. strcpy(strrchr(path,0),file->lfn?file->lfn:file_name(file->dir_ent.name));
  173. }
  174. return path;
  175. }
  176. static int day_n[] = { 0,31,59,90,120,151,181,212,243,273,304,334,0,0,0,0 };
  177. /* JanFebMarApr May Jun Jul Aug Sep Oct Nov Dec */
  178. /* Convert a MS-DOS time/date pair to a UNIX date (seconds since 1 1 70). */
  179. time_t date_dos2unix(unsigned short time,unsigned short date)
  180. {
  181. int month,year;
  182. time_t secs;
  183. month = ((date >> 5) & 15)-1;
  184. year = date >> 9;
  185. secs = (time & 31)*2+60*((time >> 5) & 63)+(time >> 11)*3600+86400*
  186. ((date & 31)-1+day_n[month]+(year/4)+year*365-((year & 3) == 0 &&
  187. month < 2 ? 1 : 0)+3653);
  188. /* days since 1.1.70 plus 80's leap day */
  189. return secs;
  190. }
  191. static char *file_stat(DOS_FILE *file)
  192. {
  193. static char temp[100];
  194. struct tm *tm;
  195. char tmp[100];
  196. time_t date;
  197. date = date_dos2unix(CF_LE_W(file->dir_ent.time),CF_LE_W(file->
  198. dir_ent.date));
  199. tm = localtime(&date);
  200. strftime(tmp,99,"%H:%M:%S %b %d %Y",tm);
  201. sprintf(temp," Size %u bytes, date %s",CF_LE_L(file->dir_ent.size),tmp);
  202. return temp;
  203. }
  204. static int bad_name(unsigned char *name)
  205. {
  206. int i, spc, suspicious = 0;
  207. char *bad_chars = atari_format ? "*?\\/:" : "*?<>|\"\\/:";
  208. /* Do not complain about (and auto-correct) the extended attribute files
  209. * of OS/2. */
  210. if (strncmp(name,"EA DATA SF",11) == 0 ||
  211. strncmp(name,"WP ROOT SF",11) == 0) return 0;
  212. for (i = 0; i < 8; i++) {
  213. if (name[i] < ' ' || name[i] == 0x7f) return 1;
  214. if (name[i] > 0x7f) ++suspicious;
  215. if (strchr(bad_chars,name[i])) return 1;
  216. }
  217. for (i = 8; i < 11; i++) {
  218. if (name[i] < ' ' || name[i] == 0x7f) return 1;
  219. if (name[i] > 0x7f) ++suspicious;
  220. if (strchr(bad_chars,name[i])) return 1;
  221. }
  222. spc = 0;
  223. for (i = 0; i < 8; i++) {
  224. if (name[i] == ' ')
  225. spc = 1;
  226. else if (spc)
  227. /* non-space after a space not allowed, space terminates the name
  228. * part */
  229. return 1;
  230. }
  231. spc = 0;
  232. for (i = 8; i < 11; i++) {
  233. if (name[i] == ' ')
  234. spc = 1;
  235. else if (spc)
  236. /* non-space after a space not allowed, space terminates the name
  237. * part */
  238. return 1;
  239. }
  240. /* Under GEMDOS, chars >= 128 are never allowed. */
  241. if (atari_format && suspicious)
  242. return 1;
  243. /* Only complain about too much suspicious chars in interactive mode,
  244. * never correct them automatically. The chars are all basically ok, so we
  245. * shouldn't auto-correct such names. */
  246. if (interactive && suspicious > 6)
  247. return 1;
  248. return 0;
  249. }
  250. static void drop_file(DOS_FS *fs,DOS_FILE *file)
  251. {
  252. unsigned long cluster;
  253. MODIFY(file,name[0],DELETED_FLAG);
  254. for (cluster = FSTART(file,fs); cluster > 0 && cluster <
  255. fs->clusters+2; cluster = next_cluster(fs,cluster))
  256. set_owner(fs,cluster,NULL);
  257. --n_files;
  258. }
  259. static void truncate_file(DOS_FS *fs,DOS_FILE *file,unsigned long clusters)
  260. {
  261. int deleting;
  262. unsigned long walk,next,prev;
  263. walk = FSTART(file,fs);
  264. prev = 0;
  265. if ((deleting = !clusters)) MODIFY_START(file,0,fs);
  266. while (walk > 0 && walk != -1) {
  267. next = next_cluster(fs,walk);
  268. if (deleting) set_fat(fs,walk,0);
  269. else if ((deleting = !--clusters)) set_fat(fs,walk,-1);
  270. prev = walk;
  271. walk = next;
  272. }
  273. }
  274. static void auto_rename(DOS_FILE *file)
  275. {
  276. DOS_FILE *first,*walk;
  277. unsigned long int number;
  278. if (!file->offset) return; /* cannot rename FAT32 root dir */
  279. first = file->parent ? file->parent->first : root;
  280. number = 0;
  281. while (1) {
  282. sprintf(file->dir_ent.name, "FSCK%04d", number / 1000);
  283. sprintf(file->dir_ent.name, "%03d", number % 1000);
  284. for (walk = first; walk; walk = walk->next)
  285. if (walk != file && !strncmp(walk->dir_ent.name,file->dir_ent.
  286. name,MSDOS_NAME)) break;
  287. if (!walk) {
  288. fs_write(file->offset,MSDOS_NAME,file->dir_ent.name);
  289. return;
  290. }
  291. number++;
  292. if (number > 9999999) {
  293. die("Too many files need repair.");
  294. }
  295. }
  296. die("Can't generate a unique name.");
  297. }
  298. static void rename_file(DOS_FILE *file)
  299. {
  300. unsigned char name[46];
  301. unsigned char *walk,*here;
  302. if (!file->offset) {
  303. printf( "Cannot rename FAT32 root dir\n" );
  304. return; /* cannot rename FAT32 root dir */
  305. }
  306. while (1) {
  307. printf("New name: ");
  308. fflush(stdout);
  309. if (fgets(name,45,stdin)) {
  310. if ((here = strchr(name,'\n'))) *here = 0;
  311. for (walk = strrchr(name,0); walk >= name && (*walk == ' ' ||
  312. *walk == '\t'); walk--);
  313. walk[1] = 0;
  314. for (walk = name; *walk == ' ' || *walk == '\t'; walk++);
  315. if (file_cvt(walk,file->dir_ent.name)) {
  316. fs_write(file->offset,MSDOS_NAME,file->dir_ent.name);
  317. return;
  318. }
  319. }
  320. }
  321. }
  322. static int handle_dot(DOS_FS *fs,DOS_FILE *file,int dots)
  323. {
  324. char *name;
  325. name = strncmp(file->dir_ent.name,MSDOS_DOT,MSDOS_NAME) ? ".." : ".";
  326. if (!(file->dir_ent.attr & ATTR_DIR)) {
  327. printf("%s\n Is a non-directory.\n",path_name(file));
  328. if (interactive)
  329. printf("1) Drop it\n2) Auto-rename\n3) Rename\n"
  330. "4) Convert to directory\n");
  331. else printf(" Auto-renaming it.\n");
  332. switch (interactive ? get_key("1234","?") : '2') {
  333. case '1':
  334. drop_file(fs,file);
  335. return 1;
  336. case '2':
  337. auto_rename(file);
  338. printf(" Renamed to %s\n",file_name(file->dir_ent.name));
  339. return 0;
  340. case '3':
  341. rename_file(file);
  342. return 0;
  343. case '4':
  344. MODIFY(file,size,CT_LE_L(0));
  345. MODIFY(file,attr,file->dir_ent.attr | ATTR_DIR);
  346. break;
  347. }
  348. }
  349. if (!dots) {
  350. printf("Root contains directory \"%s\". Dropping it.\n",name);
  351. drop_file(fs,file);
  352. return 1;
  353. }
  354. return 0;
  355. }
  356. static int check_file(DOS_FS *fs,DOS_FILE *file)
  357. {
  358. DOS_FILE *owner;
  359. int restart;
  360. unsigned long expect,curr,this,clusters,prev,walk,clusters2;
  361. if (file->dir_ent.attr & ATTR_DIR) {
  362. if (CF_LE_L(file->dir_ent.size)) {
  363. printf("%s\n Directory has non-zero size. Fixing it.\n",
  364. path_name(file));
  365. MODIFY(file,size,CT_LE_L(0));
  366. }
  367. if (file->parent && !strncmp(file->dir_ent.name,MSDOS_DOT,MSDOS_NAME)) {
  368. expect = FSTART(file->parent,fs);
  369. if (FSTART(file,fs) != expect) {
  370. printf("%s\n Start (%ld) does not point to parent (%ld)\n",
  371. path_name(file),FSTART(file,fs),expect);
  372. MODIFY_START(file,expect,fs);
  373. }
  374. return 0;
  375. }
  376. if (file->parent && !strncmp(file->dir_ent.name,MSDOS_DOTDOT,
  377. MSDOS_NAME)) {
  378. expect = file->parent->parent ? FSTART(file->parent->parent,fs):0;
  379. if (fs->root_cluster && expect == fs->root_cluster)
  380. expect = 0;
  381. if (FSTART(file,fs) != expect) {
  382. printf("%s\n Start (%lu) does not point to .. (%lu)\n",
  383. path_name(file),FSTART(file,fs),expect);
  384. MODIFY_START(file,expect,fs);
  385. }
  386. return 0;
  387. }
  388. if (FSTART(file,fs)==0){
  389. printf ("%s\n Start does point to root directory. Deleting dir. \n",
  390. path_name(file));
  391. MODIFY(file,name[0],DELETED_FLAG);
  392. return 0;
  393. }
  394. }
  395. if (FSTART(file,fs) >= fs->clusters+2) {
  396. printf("%s\n Start cluster beyond limit (%lu > %lu). Truncating file.\n",
  397. path_name(file),FSTART(file,fs),fs->clusters+1);
  398. if (!file->offset)
  399. die( "Bad FAT32 root directory! (bad start cluster)\n" );
  400. MODIFY_START(file,0,fs);
  401. }
  402. clusters = prev = 0;
  403. for (curr = FSTART(file,fs) ? FSTART(file,fs) :
  404. -1; curr != -1; curr = next_cluster(fs,curr)) {
  405. if (!fs->fat[curr].value || bad_cluster(fs,curr)) {
  406. printf("%s\n Contains a %s cluster (%lu). Assuming EOF.\n",
  407. path_name(file),fs->fat[curr].value ? "bad" : "free",curr);
  408. if (prev) set_fat(fs,prev,-1);
  409. else if (!file->offset)
  410. die( "FAT32 root dir starts with a bad cluster!" );
  411. else MODIFY_START(file,0,fs);
  412. break;
  413. }
  414. if (!(file->dir_ent.attr & ATTR_DIR) && CF_LE_L(file->dir_ent.size) <=
  415. (unsigned long long)clusters*fs->cluster_size) {
  416. printf("%s\n File size is %u bytes, cluster chain length is > %llu "
  417. "bytes.\n Truncating file to %u bytes.\n",path_name(file),
  418. CF_LE_L(file->dir_ent.size),(unsigned long long)clusters*fs->cluster_size,
  419. CF_LE_L(file->dir_ent.size));
  420. truncate_file(fs,file,clusters);
  421. break;
  422. }
  423. if ((owner = get_owner(fs,curr))) {
  424. int do_trunc = 0;
  425. printf("%s and\n",path_name(owner));
  426. printf("%s\n share clusters.\n",path_name(file));
  427. clusters2 = 0;
  428. for (walk = FSTART(owner,fs); walk > 0 && walk != -1; walk =
  429. next_cluster(fs,walk))
  430. if (walk == curr) break;
  431. else clusters2++;
  432. restart = file->dir_ent.attr & ATTR_DIR;
  433. if (!owner->offset) {
  434. printf( " Truncating second to %llu bytes because first "
  435. "is FAT32 root dir.\n", (unsigned long long)clusters2*fs->cluster_size );
  436. do_trunc = 2;
  437. }
  438. else if (!file->offset) {
  439. printf( " Truncating first to %llu bytes because second "
  440. "is FAT32 root dir.\n", (unsigned long long)clusters*fs->cluster_size );
  441. do_trunc = 1;
  442. }
  443. else if (interactive)
  444. printf("1) Truncate first to %llu bytes%s\n"
  445. "2) Truncate second to %llu bytes\n",(unsigned long long)clusters*fs->cluster_size,
  446. restart ? " and restart" : "",(unsigned long long)clusters2*fs->cluster_size);
  447. else printf(" Truncating second to %llu bytes.\n",(unsigned long long)clusters2*
  448. fs->cluster_size);
  449. if (do_trunc != 2 &&
  450. (do_trunc == 1 ||
  451. (interactive && get_key("12","?") == '1'))) {
  452. prev = 0;
  453. clusters = 0;
  454. for (this = FSTART(owner,fs); this > 0 && this != -1; this =
  455. next_cluster(fs,this)) {
  456. if (this == curr) {
  457. if (prev) set_fat(fs,prev,-1);
  458. else MODIFY_START(owner,0,fs);
  459. MODIFY(owner,size,CT_LE_L((unsigned long long)clusters*fs->cluster_size));
  460. if (restart) return 1;
  461. while (this > 0 && this != -1) {
  462. set_owner(fs,this,NULL);
  463. this = next_cluster(fs,this);
  464. }
  465. this = curr;
  466. break;
  467. }
  468. clusters++;
  469. prev = this;
  470. }
  471. if (this != curr)
  472. die("Internal error: didn't find cluster %d in chain"
  473. " starting at %d",curr,FSTART(owner,fs));
  474. }
  475. else {
  476. if (prev) set_fat(fs,prev,-1);
  477. else MODIFY_START(file,0,fs);
  478. break;
  479. }
  480. }
  481. set_owner(fs,curr,file);
  482. clusters++;
  483. prev = curr;
  484. }
  485. if (!(file->dir_ent.attr & ATTR_DIR) && CF_LE_L(file->dir_ent.size) >
  486. (unsigned long long)clusters*fs->cluster_size) {
  487. printf("%s\n File size is %u bytes, cluster chain length is %llu bytes."
  488. "\n Truncating file to %lu bytes.\n",path_name(file),CF_LE_L(file->
  489. dir_ent.size),(unsigned long long)clusters*fs->cluster_size,(unsigned long long)clusters*fs->cluster_size);
  490. MODIFY(file,size,CT_LE_L((unsigned long long)clusters*fs->cluster_size));
  491. }
  492. return 0;
  493. }
  494. static int check_files(DOS_FS *fs,DOS_FILE *start)
  495. {
  496. while (start) {
  497. if (check_file(fs,start)) return 1;
  498. start = start->next;
  499. }
  500. return 0;
  501. }
  502. static int check_dir(DOS_FS *fs,DOS_FILE **root,int dots)
  503. {
  504. DOS_FILE *parent,**walk,**scan;
  505. int dot,dotdot,skip,redo;
  506. int good,bad;
  507. if (!*root) return 0;
  508. parent = (*root)->parent;
  509. good = bad = 0;
  510. for (walk = root; *walk; walk = &(*walk)->next)
  511. if (bad_name((*walk)->dir_ent.name)) bad++;
  512. else good++;
  513. if (*root && parent && good+bad > 4 && bad > good/2) {
  514. printf("%s\n Has a large number of bad entries. (%d/%d)\n",
  515. path_name(parent),bad,good+bad);
  516. if (!dots) printf( " Not dropping root directory.\n" );
  517. else if (!interactive) printf(" Not dropping it in auto-mode.\n");
  518. else if (get_key("yn","Drop directory ? (y/n)") == 'y') {
  519. truncate_file(fs,parent,0);
  520. MODIFY(parent,name[0],DELETED_FLAG);
  521. /* buglet: deleted directory stays in the list. */
  522. return 1;
  523. }
  524. }
  525. dot = dotdot = redo = 0;
  526. walk = root;
  527. while (*walk) {
  528. if (!strncmp((*walk)->dir_ent.name,MSDOS_DOT,MSDOS_NAME) ||
  529. !strncmp((*walk)->dir_ent.name,MSDOS_DOTDOT,MSDOS_NAME)) {
  530. if (handle_dot(fs,*walk,dots)) {
  531. *walk = (*walk)->next;
  532. continue;
  533. }
  534. if (!strncmp((*walk)->dir_ent.name,MSDOS_DOT,MSDOS_NAME)) dot++;
  535. else dotdot++;
  536. }
  537. if (!((*walk)->dir_ent.attr & ATTR_VOLUME) &&
  538. bad_name((*walk)->dir_ent.name)) {
  539. printf("%s\n Bad file name.\n",path_name(*walk));
  540. if (interactive)
  541. printf("1) Drop file\n2) Rename file\n3) Auto-rename\n"
  542. "4) Keep it\n");
  543. else printf(" Auto-renaming it.\n");
  544. switch (interactive ? get_key("1234","?") : '3') {
  545. case '1':
  546. drop_file(fs,*walk);
  547. walk = &(*walk)->next;
  548. continue;
  549. case '2':
  550. rename_file(*walk);
  551. redo = 1;
  552. break;
  553. case '3':
  554. auto_rename(*walk);
  555. printf(" Renamed to %s\n",file_name((*walk)->dir_ent.
  556. name));
  557. break;
  558. case '4':
  559. break;
  560. }
  561. }
  562. /* don't check for duplicates of the volume label */
  563. if (!((*walk)->dir_ent.attr & ATTR_VOLUME)) {
  564. scan = &(*walk)->next;
  565. skip = 0;
  566. while (*scan && !skip) {
  567. if (!((*scan)->dir_ent.attr & ATTR_VOLUME) &&
  568. !strncmp((*walk)->dir_ent.name,(*scan)->dir_ent.name,MSDOS_NAME)) {
  569. printf("%s\n Duplicate directory entry.\n First %s\n",
  570. path_name(*walk),file_stat(*walk));
  571. printf(" Second %s\n",file_stat(*scan));
  572. if (interactive)
  573. printf("1) Drop first\n2) Drop second\n3) Rename first\n"
  574. "4) Rename second\n5) Auto-rename first\n"
  575. "6) Auto-rename second\n");
  576. else printf(" Auto-renaming second.\n");
  577. switch (interactive ? get_key("123456","?") : '6') {
  578. case '1':
  579. drop_file(fs,*walk);
  580. *walk = (*walk)->next;
  581. skip = 1;
  582. break;
  583. case '2':
  584. drop_file(fs,*scan);
  585. *scan = (*scan)->next;
  586. continue;
  587. case '3':
  588. rename_file(*walk);
  589. printf(" Renamed to %s\n",path_name(*walk));
  590. redo = 1;
  591. break;
  592. case '4':
  593. rename_file(*scan);
  594. printf(" Renamed to %s\n",path_name(*walk));
  595. redo = 1;
  596. break;
  597. case '5':
  598. auto_rename(*walk);
  599. printf(" Renamed to %s\n",file_name((*walk)->dir_ent.
  600. name));
  601. break;
  602. case '6':
  603. auto_rename(*scan);
  604. printf(" Renamed to %s\n",file_name((*scan)->dir_ent.
  605. name));
  606. break;
  607. }
  608. }
  609. scan = &(*scan)->next;
  610. }
  611. if (skip) continue;
  612. }
  613. if (!redo) walk = &(*walk)->next;
  614. else {
  615. walk = root;
  616. dot = dotdot = redo = 0;
  617. }
  618. }
  619. if (dots && !dot)
  620. printf("%s\n \".\" is missing. Can't fix this yet.\n",
  621. path_name(parent));
  622. if (dots && !dotdot)
  623. printf("%s\n \"..\" is missing. Can't fix this yet.\n",
  624. path_name(parent));
  625. return 0;
  626. }
  627. static void test_file(DOS_FS *fs,DOS_FILE *file,int read_test)
  628. {
  629. DOS_FILE *owner;
  630. unsigned long walk,prev,clusters,next_clu;
  631. prev = clusters = 0;
  632. for (walk = FSTART(file,fs); walk > 0 && walk < fs->clusters+2;
  633. walk = next_clu) {
  634. next_clu = next_cluster(fs,walk);
  635. if ((owner = get_owner(fs,walk))) {
  636. if (owner == file) {
  637. printf("%s\n Circular cluster chain. Truncating to %lu "
  638. "cluster%s.\n",path_name(file),clusters,clusters == 1 ? "" :
  639. "s");
  640. if (prev) set_fat(fs,prev,-1);
  641. else if (!file->offset)
  642. die( "Bad FAT32 root directory! (bad start cluster)\n" );
  643. else MODIFY_START(file,0,fs);
  644. }
  645. break;
  646. }
  647. if (bad_cluster(fs,walk)) break;
  648. if (read_test) {
  649. if (fs_test(cluster_start(fs,walk),fs->cluster_size)) {
  650. prev = walk;
  651. clusters++;
  652. }
  653. else {
  654. printf("%s\n Cluster %lu (%lu) is unreadable. Skipping it.\n",
  655. path_name(file),clusters,walk);
  656. if (prev) set_fat(fs,prev,next_cluster(fs,walk));
  657. else MODIFY_START(file,next_cluster(fs,walk),fs);
  658. set_fat(fs,walk,-2);
  659. }
  660. }
  661. set_owner(fs,walk,file);
  662. }
  663. for (walk = FSTART(file,fs); walk > 0 && walk < fs->clusters+2;
  664. walk = next_cluster(fs,walk))
  665. if (bad_cluster(fs,walk)) break;
  666. else if (get_owner(fs,walk) == file) set_owner(fs,walk,NULL);
  667. else break;
  668. }
  669. static void undelete(DOS_FS *fs,DOS_FILE *file)
  670. {
  671. unsigned long clusters,left,prev,walk;
  672. clusters = left = (CF_LE_L(file->dir_ent.size)+fs->cluster_size-1)/
  673. fs->cluster_size;
  674. prev = 0;
  675. for (walk = FSTART(file,fs); left && walk >= 2 && walk <
  676. fs->clusters+2 && !fs->fat[walk].value; walk++) {
  677. left--;
  678. if (prev) set_fat(fs,prev,walk);
  679. prev = walk;
  680. }
  681. if (prev) set_fat(fs,prev,-1);
  682. else MODIFY_START(file,0,fs);
  683. if (left)
  684. printf("Warning: Did only undelete %lu of %lu cluster%s.\n",clusters-left,
  685. clusters,clusters == 1 ? "" : "s");
  686. }
  687. static void new_dir( void )
  688. {
  689. lfn_reset();
  690. }
  691. static void add_file(DOS_FS *fs,DOS_FILE ***chain,DOS_FILE *parent,
  692. loff_t offset,FDSC **cp)
  693. {
  694. DOS_FILE *new;
  695. DIR_ENT de;
  696. FD_TYPE type;
  697. if (offset)
  698. fs_read(offset,sizeof(DIR_ENT),&de);
  699. else {
  700. memcpy(de.name," ",MSDOS_NAME);
  701. de.attr = ATTR_DIR;
  702. de.size = de.time = de.date = 0;
  703. de.start = CT_LE_W(fs->root_cluster & 0xffff);
  704. de.starthi = CT_LE_W((fs->root_cluster >> 16) & 0xffff);
  705. }
  706. if ((type = file_type(cp,de.name)) != fdt_none) {
  707. if (type == fdt_undelete && (de.attr & ATTR_DIR))
  708. die("Can't undelete directories.");
  709. file_modify(cp,de.name);
  710. fs_write(offset,1,&de);
  711. }
  712. if (IS_FREE(de.name)) {
  713. lfn_check_orphaned();
  714. return;
  715. }
  716. if (de.attr == VFAT_LN_ATTR) {
  717. lfn_add_slot(&de,offset);
  718. return;
  719. }
  720. new = qalloc(&mem_queue,sizeof(DOS_FILE));
  721. new->lfn = lfn_get(&de);
  722. new->offset = offset;
  723. memcpy(&new->dir_ent,&de,sizeof(de));
  724. new->next = new->first = NULL;
  725. new->parent = parent;
  726. if (type == fdt_undelete) undelete(fs,new);
  727. **chain = new;
  728. *chain = &new->next;
  729. if (list) {
  730. printf("Checking file %s",path_name(new));
  731. if (new->lfn)
  732. printf(" (%s)", file_name(new->dir_ent.name) );
  733. printf("\n");
  734. }
  735. if (offset &&
  736. strncmp(de.name,MSDOS_DOT,MSDOS_NAME) != 0 &&
  737. strncmp(de.name,MSDOS_DOTDOT,MSDOS_NAME) != 0)
  738. ++n_files;
  739. test_file(fs,new,test);
  740. }
  741. static int subdirs(DOS_FS *fs,DOS_FILE *parent,FDSC **cp);
  742. static int scan_dir(DOS_FS *fs,DOS_FILE *this,FDSC **cp)
  743. {
  744. DOS_FILE **chain;
  745. int i;
  746. unsigned long clu_num;
  747. chain = &this->first;
  748. i = 0;
  749. clu_num = FSTART(this,fs);
  750. new_dir();
  751. while (clu_num > 0 && clu_num != -1) {
  752. add_file(fs,&chain,this,cluster_start(fs,clu_num)+(i % fs->
  753. cluster_size),cp);
  754. i += sizeof(DIR_ENT);
  755. if (!(i % fs->cluster_size))
  756. if ((clu_num = next_cluster(fs,clu_num)) == 0 || clu_num == -1)
  757. break;
  758. }
  759. lfn_check_orphaned();
  760. if (check_dir(fs,&this->first,this->offset)) return 0;
  761. if (check_files(fs,this->first)) return 1;
  762. return subdirs(fs,this,cp);
  763. }
  764. static int subdirs(DOS_FS *fs,DOS_FILE *parent,FDSC **cp)
  765. {
  766. DOS_FILE *walk;
  767. for (walk = parent ? parent->first : root; walk; walk = walk->next)
  768. if (walk->dir_ent.attr & ATTR_DIR)
  769. if (strncmp(walk->dir_ent.name,MSDOS_DOT,MSDOS_NAME) &&
  770. strncmp(walk->dir_ent.name,MSDOS_DOTDOT,MSDOS_NAME))
  771. if (scan_dir(fs,walk,file_cd(cp,walk->dir_ent.name))) return 1;
  772. return 0;
  773. }
  774. int scan_root(DOS_FS *fs)
  775. {
  776. DOS_FILE **chain;
  777. int i;
  778. root = NULL;
  779. chain = &root;
  780. new_dir();
  781. if (fs->root_cluster) {
  782. add_file(fs,&chain,NULL,0,&fp_root);
  783. }
  784. else {
  785. for (i = 0; i < fs->root_entries; i++)
  786. add_file(fs,&chain,NULL,fs->root_start+i*sizeof(DIR_ENT),&fp_root);
  787. }
  788. lfn_check_orphaned();
  789. (void) check_dir(fs,&root,0);
  790. if (check_files(fs,root)) return 1;
  791. return subdirs(fs,NULL,&fp_root);
  792. }
  793. /* Local Variables: */
  794. /* tab-width: 8 */
  795. /* End: */