dossubs.c 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <bio.h>
  4. #include <auth.h>
  5. #include <fcall.h>
  6. #include "iotrack.h"
  7. #include "dat.h"
  8. #include "fns.h"
  9. static uchar isdos[256];
  10. int
  11. isdosfs(uchar *buf)
  12. {
  13. /*
  14. * When dynamic disc managers move the disc partition,
  15. * they make it start with 0xE9.
  16. */
  17. if(buf[0] == 0xE9)
  18. return 1;
  19. /*
  20. * Check if the jump displacement (magic[1]) is too short for a FAT.
  21. */
  22. if(buf[0] == 0xEB && buf[2] == 0x90 && buf[1] >= 0x30)
  23. return 1;
  24. return 0;
  25. }
  26. int
  27. dosfs(Xfs *xf)
  28. {
  29. Iosect *p, *p1;
  30. Dosboot *b;
  31. Fatinfo *fi;
  32. Dosboot32 *b32;
  33. Dosbpb *bp;
  34. long fisec, extflags;
  35. int i;
  36. if(!isdos['a']){
  37. for(i = 'a'; i <= 'z'; i++)
  38. isdos[i] = 1;
  39. for(i = 'A'; i <= 'Z'; i++)
  40. isdos[i] = 1;
  41. for(i = '0'; i <= '9'; i++)
  42. isdos[i] = 1;
  43. isdos['$'] = 1;
  44. isdos['%'] = 1;
  45. isdos['''] = 1;
  46. isdos['-'] = 1;
  47. isdos['_'] = 1;
  48. isdos['@'] = 1;
  49. isdos['~'] = 1;
  50. isdos['`'] = 1;
  51. isdos['!'] = 1;
  52. isdos['('] = 1;
  53. isdos[')'] = 1;
  54. isdos['{'] = 1;
  55. isdos['}'] = 1;
  56. isdos['^'] = 1;
  57. isdos['#'] = 1;
  58. isdos['&'] = 1;
  59. }
  60. p = getsect(xf, 0);
  61. if(p == 0)
  62. return -1;
  63. b = (Dosboot*)p->iobuf;
  64. if(b->clustsize == 0 || isdosfs(p->iobuf) == 0){
  65. putsect(p);
  66. return -1;
  67. }
  68. bp = malloc(sizeof(Dosbpb));
  69. memset(bp, 0, sizeof(Dosbpb)); /* clear lock */
  70. xf->ptr = bp;
  71. xf->fmt = 1;
  72. bp->sectsize = GSHORT(b->sectsize);
  73. bp->clustsize = b->clustsize;
  74. bp->nresrv = GSHORT(b->nresrv);
  75. bp->nfats = b->nfats;
  76. bp->rootsize = GSHORT(b->rootsize);
  77. bp->volsize = GSHORT(b->volsize);
  78. if(bp->volsize == 0)
  79. bp->volsize = GLONG(b->bigvolsize);
  80. bp->mediadesc = b->mediadesc;
  81. bp->fatsize = GSHORT(b->fatsize);
  82. bp->fataddr = GSHORT(b->nresrv);
  83. bp->fatinfo = 0;
  84. if(bp->fatsize == 0){ /* is FAT32 */
  85. if(chatty)
  86. bootsecdump32(2, xf, (Dosboot32*)b);
  87. xf->isfat32 = 1;
  88. b32 = (Dosboot32*)b;
  89. bp->fatsize = GLONG(b32->fatsize32);
  90. if(bp->fatsize == 0){
  91. putsect(p);
  92. return -1;
  93. }
  94. bp->dataaddr = bp->fataddr + bp->nfats*bp->fatsize;
  95. bp->rootaddr = 0;
  96. bp->rootstart = GLONG(b32->rootstart);
  97. /*
  98. * disable fat mirroring?
  99. */
  100. extflags = GSHORT(b32->extflags);
  101. if(extflags & 0x0080){
  102. for(i = 0; i < 4; i++){
  103. if(extflags & (1 << i)){
  104. bp->fataddr += i * bp->fatsize;
  105. bp->nfats = 1;
  106. break;
  107. }
  108. }
  109. }
  110. /*
  111. * fat free list info
  112. */
  113. bp->freeptr = FATRESRV;
  114. fisec = GSHORT(b32->infospec);
  115. if(fisec != 0 && fisec < GSHORT(b32->nresrv)){
  116. p1 = getsect(xf, fisec);
  117. if(p1 != nil){
  118. fi = (Fatinfo*)p1->iobuf;
  119. if(GLONG(fi->sig1) == FATINFOSIG1 && GLONG(fi->sig) == FATINFOSIG){
  120. bp->fatinfo = fisec;
  121. bp->freeptr = GLONG(fi->nextfree);
  122. bp->freeclusters = GLONG(fi->freeclust);
  123. chat("fat info: %ld free clusters, next free %ld\n", bp->freeclusters, bp->freeptr);
  124. }
  125. putsect(p1);
  126. }
  127. }
  128. }else{
  129. if(chatty)
  130. bootdump(2, b);
  131. bp->rootaddr = bp->fataddr + bp->nfats*bp->fatsize;
  132. bp->rootstart = 0;
  133. i = bp->rootsize*DOSDIRSIZE + bp->sectsize-1;
  134. i /= bp->sectsize;
  135. bp->dataaddr = bp->rootaddr + i;
  136. bp->freeptr = FATRESRV;
  137. }
  138. bp->fatclusters = FATRESRV+(bp->volsize - bp->dataaddr)/bp->clustsize;
  139. if(xf->isfat32)
  140. bp->fatbits = 32;
  141. else if(bp->fatclusters < 4087)
  142. bp->fatbits = 12;
  143. else
  144. bp->fatbits = 16;
  145. chat("fatbits=%d (%d clusters)...", bp->fatbits, bp->fatclusters);
  146. for(i=0; i<b->nfats; i++)
  147. chat("fat %d: %ld...", i, bp->fataddr+i*bp->fatsize);
  148. chat("root: %ld...", bp->rootaddr);
  149. chat("data: %ld...", bp->dataaddr);
  150. putsect(p);
  151. return 0;
  152. }
  153. /*
  154. * initialize f to the root directory
  155. * this file has no Dosdir entry,
  156. * so we special case it all over.
  157. */
  158. void
  159. rootfile(Xfile *f)
  160. {
  161. Dosptr *dp;
  162. dp = f->ptr;
  163. memset(dp, 0, sizeof(Dosptr));
  164. dp->prevaddr = -1;
  165. }
  166. int
  167. isroot(ulong addr)
  168. {
  169. return addr == 0;
  170. }
  171. int
  172. getfile(Xfile *f)
  173. {
  174. Dosptr *dp;
  175. Iosect *p;
  176. dp = f->ptr;
  177. if(dp->p)
  178. panic("getfile");
  179. p = getsect(f->xf, dp->addr);
  180. if(p == nil)
  181. return -1;
  182. /*
  183. * we could also make up a Dosdir for the root
  184. */
  185. dp->d = nil;
  186. if(!isroot(dp->addr)){
  187. if(f->qid.path != QIDPATH(dp)){
  188. chat("qid mismatch f=%#llux d=%#lux...", f->qid.path, QIDPATH(dp));
  189. putsect(p);
  190. errno = Enonexist;
  191. return -1;
  192. }
  193. dp->d = (Dosdir *)&p->iobuf[dp->offset];
  194. }
  195. dp->p = p;
  196. return 0;
  197. }
  198. void
  199. putfile(Xfile *f)
  200. {
  201. Dosptr *dp;
  202. dp = f->ptr;
  203. if(!dp->p)
  204. panic("putfile");
  205. putsect(dp->p);
  206. dp->p = nil;
  207. dp->d = nil;
  208. }
  209. long
  210. getstart(Xfs *xf, Dosdir *d)
  211. {
  212. long start;
  213. start = GSHORT(d->start);
  214. if(xf->isfat32)
  215. start |= GSHORT(d->hstart)<<16;
  216. return start;
  217. }
  218. void
  219. putstart(Xfs *xf, Dosdir *d, long start)
  220. {
  221. PSHORT(d->start, start);
  222. if(xf->isfat32)
  223. PSHORT(d->hstart, start>>16);
  224. }
  225. /*
  226. * return the disk cluster for the iclust cluster in f
  227. */
  228. long
  229. fileclust(Xfile *f, long iclust, int cflag)
  230. {
  231. Dosbpb *bp;
  232. Dosptr *dp;
  233. Dosdir *d;
  234. long start, clust, nskip, next;
  235. bp = f->xf->ptr;
  236. dp = f->ptr;
  237. d = dp->d;
  238. next = 0;
  239. /*
  240. * asking for the cluster of the root directory
  241. * is not a well-formed question, since the root directory
  242. * does not begin on a cluster boundary.
  243. */
  244. if(!f->xf->isfat32 && isroot(dp->addr))
  245. return -1;
  246. if(f->xf->isfat32 && isroot(dp->addr)){
  247. start = bp->rootstart;
  248. }else{
  249. start = getstart(f->xf, d);
  250. if(start == 0){
  251. if(!cflag)
  252. return -1;
  253. mlock(bp);
  254. start = falloc(f->xf);
  255. unmlock(bp);
  256. if(start <= 0)
  257. return -1;
  258. puttime(d, 0);
  259. putstart(f->xf, d, start);
  260. dp->p->flags |= BMOD;
  261. dp->clust = 0;
  262. }
  263. }
  264. if(dp->clust == 0 || iclust < dp->iclust){
  265. clust = start;
  266. nskip = iclust;
  267. }else{
  268. clust = dp->clust;
  269. nskip = iclust - dp->iclust;
  270. }
  271. if(chatty > 1 && nskip > 0)
  272. chat("clust %#lx, skip %ld...", clust, nskip);
  273. if(clust <= 0)
  274. return -1;
  275. if(nskip > 0){
  276. mlock(bp);
  277. while(--nskip >= 0){
  278. next = getfat(f->xf, clust);
  279. if(chatty > 1)
  280. chat("->%#lx", next);
  281. if(next > 0){
  282. clust = next;
  283. continue;
  284. }else if(!cflag)
  285. break;
  286. if(d && (d->attr&DSYSTEM)){
  287. next = cfalloc(f);
  288. if(next < 0)
  289. break;
  290. /* cfalloc will call putfat for us, since clust may change */
  291. } else {
  292. next = falloc(f->xf);
  293. if(next < 0)
  294. break;
  295. putfat(f->xf, clust, next);
  296. }
  297. clust = next;
  298. }
  299. unmlock(bp);
  300. if(next <= 0)
  301. return -1;
  302. dp->clust = clust;
  303. dp->iclust = iclust;
  304. }
  305. if(chatty > 1)
  306. chat(" clust(%#lx)=%#lx...", iclust, clust);
  307. return clust;
  308. }
  309. /*
  310. * return the disk sector for the isect disk sector in f
  311. */
  312. long
  313. fileaddr(Xfile *f, long isect, int cflag)
  314. {
  315. Dosbpb *bp;
  316. Dosptr *dp;
  317. long clust;
  318. bp = f->xf->ptr;
  319. dp = f->ptr;
  320. if(!f->xf->isfat32 && isroot(dp->addr)){
  321. if(isect*bp->sectsize >= bp->rootsize*DOSDIRSIZE)
  322. return -1;
  323. return bp->rootaddr + isect;
  324. }
  325. clust = fileclust(f, isect/bp->clustsize, cflag);
  326. if(clust < 0)
  327. return -1;
  328. return clust2sect(bp, clust) + isect%bp->clustsize;
  329. }
  330. /*
  331. * translate names
  332. */
  333. void
  334. fixname(char *buf)
  335. {
  336. int c;
  337. char *p;
  338. p = buf;
  339. while(c = *p){
  340. if(c == ':' && trspaces)
  341. *p = ' ';
  342. p++;
  343. }
  344. }
  345. /*
  346. * classify the file name as one of
  347. * Invalid - contains a bad character
  348. * Short - short valid 8.3 name, no lowercase letters
  349. * ShortLower - short valid 8.3 name except for lowercase letters
  350. * Long - long name
  351. */
  352. int
  353. classifyname(char *buf)
  354. {
  355. char *p, *dot;
  356. int c, isextended, is8dot3, islower, ndot;
  357. p = buf;
  358. isextended = 0;
  359. islower = 0;
  360. dot = nil;
  361. ndot = 0;
  362. while(c = (uchar)*p){
  363. if(c&0x80) /* UTF8 */
  364. isextended = 1;
  365. else if(c == '.'){
  366. dot = p;
  367. ndot++;
  368. }else if(strchr("+,:;=[] ", c))
  369. isextended = 1;
  370. else if(!isdos[c])
  371. return Invalid;
  372. if('a' <= c && c <= 'z')
  373. islower = 1;
  374. p++;
  375. }
  376. is8dot3 = (ndot==0 && p-buf <= 8) || (ndot==1 && dot-buf <= 8 && p-(dot+1) <= 3);
  377. if(!isextended && is8dot3){
  378. if(islower)
  379. return ShortLower;
  380. return Short;
  381. }
  382. return Long;
  383. }
  384. /*
  385. * make an alias for a valid long file name
  386. */
  387. void
  388. mkalias(char *name, char *sname, int id)
  389. {
  390. Rune r;
  391. char *s, *e, sid[10];
  392. int i, esuf, v;
  393. e = strrchr(name, '.');
  394. if(e == nil)
  395. e = strchr(name, '\0');
  396. s = name;
  397. i = 0;
  398. while(s < e && i < 6){
  399. if(isdos[(uchar)*s])
  400. sname[i++] = *s++;
  401. else
  402. s += chartorune(&r, s);
  403. }
  404. v = snprint(sid, 10, "%d", id);
  405. if(i + 1 + v > 8)
  406. i = 8 - 1 - v;
  407. sname[i++] = '~';
  408. strcpy(&sname[i], sid);
  409. i += v;
  410. sname[i++] = '.';
  411. esuf = i + 3;
  412. if(esuf > 12)
  413. panic("bad mkalias");
  414. while(*e && i < esuf){
  415. if(isdos[(uchar)*e])
  416. sname[i++] = *e++;
  417. else
  418. e += chartorune(&r, e);
  419. }
  420. if(sname[i-1] == '.')
  421. i--;
  422. sname[i] = '\0';
  423. }
  424. /*
  425. * check for valid plan 9 names,
  426. * rewrite ' ' to ':'
  427. */
  428. char isfrog[256]={
  429. /*NUL*/ 1, 1, 1, 1, 1, 1, 1, 1,
  430. /*BKS*/ 1, 1, 1, 1, 1, 1, 1, 1,
  431. /*DLE*/ 1, 1, 1, 1, 1, 1, 1, 1,
  432. /*CAN*/ 1, 1, 1, 1, 1, 1, 1, 1,
  433. /* [' '] 1, let's try this -rsc */
  434. ['/'] 1,
  435. [0x7f] 1,
  436. };
  437. int
  438. nameok(char *elem)
  439. {
  440. while(*elem) {
  441. if(*elem == ' ' && trspaces)
  442. *elem = ':';
  443. if(isfrog[*(uchar*)elem])
  444. return 0;
  445. elem++;
  446. }
  447. return 1;
  448. }
  449. /*
  450. * look for a directory entry matching name
  451. * always searches for long names which match a short name
  452. */
  453. int
  454. searchdir(Xfile *f, char *name, Dosptr *dp, int cflag, int longtype)
  455. {
  456. Xfs *xf;
  457. Iosect *p;
  458. Dosbpb *bp;
  459. Dosdir *d;
  460. char buf[261], *bname;
  461. int isect, addr, o, addr1, addr2, prevaddr, prevaddr1, o1, islong, have, need, sum;
  462. xf = f->xf;
  463. bp = xf->ptr;
  464. addr1 = -1;
  465. addr2 = -1;
  466. prevaddr1 = -1;
  467. o1 = 0;
  468. islong = 0;
  469. sum = -1;
  470. need = 1;
  471. if(longtype!=Short && cflag)
  472. need += (utflen(name) + DOSRUNE-1) / DOSRUNE;
  473. memset(dp, 0, sizeof(Dosptr));
  474. dp->prevaddr = -1;
  475. dp->naddr = -1;
  476. dp->paddr = ((Dosptr *)f->ptr)->addr;
  477. dp->poffset = ((Dosptr *)f->ptr)->offset;
  478. have = 0;
  479. addr = -1;
  480. bname = nil;
  481. for(isect=0;; isect++){
  482. prevaddr = addr;
  483. addr = fileaddr(f, isect, cflag);
  484. if(addr < 0)
  485. break;
  486. p = getsect(xf, addr);
  487. if(p == 0)
  488. break;
  489. for(o=0; o<bp->sectsize; o+=DOSDIRSIZE){
  490. d = (Dosdir *)&p->iobuf[o];
  491. if(d->name[0] == 0x00){
  492. chat("end dir(0)...");
  493. putsect(p);
  494. if(!cflag)
  495. return -1;
  496. /*
  497. * addr1 & o1 are the start of the dirs
  498. * addr2 is the optional second cluster used if the long name
  499. * entry does not fit within the addr1 cluster
  500. *
  501. * have tells us the number of contiguous free dirs
  502. * starting at addr1.o1; need are necessary to hold the long name.
  503. */
  504. if(addr1 < 0){
  505. addr1 = addr;
  506. prevaddr1 = prevaddr;
  507. o1 = o;
  508. }
  509. if(addr2 < 0 && (bp->sectsize-o)/DOSDIRSIZE + have < need){
  510. addr2 = fileaddr(f, isect+1, cflag);
  511. if(addr2 < 0)
  512. goto breakout;
  513. }else if(addr2 < 0)
  514. addr2 = addr;
  515. if(addr2 == addr1)
  516. addr2 = -1;
  517. dp->addr = addr1;
  518. dp->offset = o1;
  519. dp->prevaddr = prevaddr1;
  520. dp->naddr = addr2;
  521. return 0;
  522. }
  523. if(d->name[0] == DOSEMPTY){
  524. if(chatty)
  525. fprint(2, "empty dir\n");
  526. have++;
  527. if(addr1 == -1){
  528. addr1 = addr;
  529. o1 = o;
  530. prevaddr1 = prevaddr;
  531. }
  532. if(addr2 == -1 && have >= need)
  533. addr2 = addr;
  534. continue;
  535. }
  536. have = 0;
  537. if(addr2 == -1)
  538. addr1 = -1;
  539. dirdump(d);
  540. if((d->attr & 0xf) == 0xf){
  541. bname = getnamesect(buf, bname, p->iobuf + o, &islong, &sum, 1);
  542. continue;
  543. }
  544. if(d->attr & DVLABEL){
  545. islong = 0;
  546. continue;
  547. }
  548. if(islong != 1 || sum != aliassum(d) || cistrcmp(bname, name) != 0){
  549. bname = buf;
  550. getname(buf, d);
  551. }
  552. islong = 0;
  553. if(cistrcmp(bname, name) != 0)
  554. continue;
  555. if(chatty)
  556. fprint(2, "found\n");
  557. if(cflag){
  558. putsect(p);
  559. return -1;
  560. }
  561. dp->addr = addr;
  562. dp->prevaddr = prevaddr;
  563. dp->offset = o;
  564. dp->p = p;
  565. dp->d = d;
  566. return 0;
  567. }
  568. putsect(p);
  569. }
  570. breakout:
  571. chat("end dir(1)...");
  572. return -1;
  573. }
  574. int
  575. emptydir(Xfile *f)
  576. {
  577. Xfs *xf = f->xf;
  578. Dosbpb *bp = xf->ptr;
  579. int isect, addr, o;
  580. Iosect *p;
  581. Dosdir *d;
  582. for(isect=0;; isect++){
  583. addr = fileaddr(f, isect, 0);
  584. if(addr < 0)
  585. break;
  586. p = getsect(xf, addr);
  587. if(p == 0)
  588. return -1;
  589. for(o=0; o<bp->sectsize; o+=DOSDIRSIZE){
  590. d = (Dosdir *)&p->iobuf[o];
  591. if(d->name[0] == 0x00){
  592. putsect(p);
  593. return 0;
  594. }
  595. if(d->name[0] == DOSEMPTY)
  596. continue;
  597. if(d->name[0] == '.')
  598. continue;
  599. if(d->attr&DVLABEL)
  600. continue;
  601. putsect(p);
  602. return -1;
  603. }
  604. putsect(p);
  605. }
  606. return 0;
  607. }
  608. long
  609. readdir(Xfile *f, void *vbuf, long offset, long count)
  610. {
  611. Xfs *xf;
  612. Dosbpb *bp;
  613. Dir dir;
  614. int isect, addr, o, islong, sum;
  615. Iosect *p;
  616. Dosdir *d;
  617. long rcnt, n;
  618. char *name, snamebuf[8+1+3+1], namebuf[DOSNAMELEN];
  619. uchar *buf;
  620. buf = vbuf;
  621. rcnt = 0;
  622. xf = f->xf;
  623. bp = xf->ptr;
  624. if(count <= 0)
  625. return 0;
  626. islong = 0;
  627. sum = -1;
  628. name = nil;
  629. for(isect=0;; isect++){
  630. addr = fileaddr(f, isect, 0);
  631. if(addr < 0)
  632. break;
  633. p = getsect(xf, addr);
  634. if(p == 0)
  635. return -1;
  636. for(o=0; o<bp->sectsize; o+=DOSDIRSIZE){
  637. d = (Dosdir *)&p->iobuf[o];
  638. if(d->name[0] == 0x00){
  639. putsect(p);
  640. return rcnt;
  641. }
  642. if(d->name[0] == DOSEMPTY)
  643. continue;
  644. dirdump(d);
  645. if(d->name[0] == '.'){
  646. if(d->name[1] == ' ' || d->name[1] == 0)
  647. continue;
  648. if(d->name[1] == '.' &&
  649. (d->name[2] == ' ' || d->name[2] == 0))
  650. continue;
  651. }
  652. if((d->attr & 0xf) == 0xf){
  653. name = getnamesect(namebuf, name, p->iobuf+o, &islong, &sum, 1);
  654. continue;
  655. }
  656. if(d->attr & DVLABEL){
  657. islong = 0;
  658. continue;
  659. }
  660. dir.name = snamebuf;
  661. getdir(xf, &dir, d, addr, o);
  662. if(islong == 1 && nameok(name) && sum == aliassum(d))
  663. dir.name = name;
  664. islong = 0;
  665. n = convD2M(&dir, &buf[rcnt], count - rcnt);
  666. name = nil;
  667. if(n <= BIT16SZ){ /* no room for next entry */
  668. putsect(p);
  669. return rcnt;
  670. }
  671. rcnt += n;
  672. if(offset > 0){
  673. offset -= rcnt;
  674. rcnt = 0;
  675. islong = 0;
  676. continue;
  677. }
  678. if(rcnt == count){
  679. putsect(p);
  680. return rcnt;
  681. }
  682. }
  683. putsect(p);
  684. }
  685. return rcnt;
  686. }
  687. /*
  688. * set up ndp for a directory's parent
  689. * the hardest part is setting up paddr
  690. */
  691. int
  692. walkup(Xfile *f, Dosptr *ndp)
  693. {
  694. Dosbpb *bp;
  695. Dosptr *dp;
  696. Dosdir *xd;
  697. Iosect *p;
  698. long k, o, so, start, pstart, ppstart, st, ppclust;
  699. bp = f->xf->ptr;
  700. dp = f->ptr;
  701. memset(ndp, 0, sizeof(Dosptr));
  702. ndp->prevaddr = -1;
  703. ndp->naddr = -1;
  704. ndp->addr = dp->paddr;
  705. ndp->offset = dp->poffset;
  706. chat("walkup: paddr=%#lx...", dp->paddr);
  707. /*
  708. * root's paddr is always itself
  709. */
  710. if(isroot(dp->paddr))
  711. return 0;
  712. /*
  713. * find the start of our parent's directory
  714. */
  715. p = getsect(f->xf, dp->paddr);
  716. if(p == nil)
  717. goto error;
  718. xd = (Dosdir *)&p->iobuf[dp->poffset];
  719. dirdump(xd);
  720. start = getstart(f->xf, xd);
  721. chat("start=%#lx...", start);
  722. if(start == 0)
  723. goto error;
  724. putsect(p);
  725. /*
  726. * verify that parent's . points to itself
  727. */
  728. p = getsect(f->xf, clust2sect(bp, start));
  729. if(p == nil)
  730. goto error;
  731. xd = (Dosdir *)p->iobuf;
  732. dirdump(xd);
  733. st = getstart(f->xf, xd);
  734. if(xd->name[0]!='.' || xd->name[1]!=' ' || start!=st)
  735. goto error;
  736. /*
  737. * parent's .. is the next entry, and has start of parent's parent
  738. */
  739. xd++;
  740. dirdump(xd);
  741. if(xd->name[0] != '.' || xd->name[1] != '.')
  742. goto error;
  743. pstart = getstart(f->xf, xd);
  744. putsect(p);
  745. /*
  746. * we're done if parent is root
  747. */
  748. if(pstart == 0 || f->xf->isfat32 && pstart == bp->rootstart)
  749. return 0;
  750. /*
  751. * verify that parent's . points to itself
  752. */
  753. p = getsect(f->xf, clust2sect(bp, pstart));
  754. if(p == 0){
  755. chat("getsect %ld failed\n", pstart);
  756. goto error;
  757. }
  758. xd = (Dosdir *)p->iobuf;
  759. dirdump(xd);
  760. st = getstart(f->xf, xd);
  761. if(xd->name[0]!='.' || xd->name[1]!=' ' || pstart!=st)
  762. goto error;
  763. /*
  764. * parent's parent's .. is the next entry, and has start of parent's parent's parent
  765. */
  766. xd++;
  767. dirdump(xd);
  768. if(xd->name[0] != '.' || xd->name[1] != '.')
  769. goto error;
  770. ppstart = getstart(f->xf, xd);
  771. putsect(p);
  772. /*
  773. * open parent's parent's parent, and walk through it until parent's parent is found
  774. * need this to find parent's parent's addr and offset
  775. */
  776. ppclust = ppstart;
  777. if(f->xf->isfat32 && ppclust == 0){
  778. ppclust = bp->rootstart;
  779. chat("ppclust 0, resetting to rootstart\n");
  780. }
  781. k = ppclust ? clust2sect(bp, ppclust) : bp->rootaddr;
  782. p = getsect(f->xf, k);
  783. if(p == nil){
  784. chat("getsect %ld failed\n", k);
  785. goto error;
  786. }
  787. xd = (Dosdir *)p->iobuf;
  788. dirdump(xd);
  789. if(ppstart){
  790. st = getstart(f->xf, xd);
  791. if(xd->name[0]!='.' || xd->name[1]!=' ' || ppstart!=st)
  792. goto error;
  793. }
  794. for(so=1;; so++){
  795. for(o=0; o<bp->sectsize; o+=DOSDIRSIZE){
  796. xd = (Dosdir *)&p->iobuf[o];
  797. if(xd->name[0] == 0x00){
  798. chat("end dir\n");
  799. goto error;
  800. }
  801. if(xd->name[0] == DOSEMPTY)
  802. continue;
  803. st = getstart(f->xf, xd);
  804. if(st == pstart)
  805. goto out;
  806. }
  807. if(ppclust){
  808. if(so%bp->clustsize == 0){
  809. mlock(bp);
  810. ppclust = getfat(f->xf, ppclust);
  811. unmlock(bp);
  812. if(ppclust < 0){
  813. chat("getfat %ld failed\n", ppclust);
  814. goto error;
  815. }
  816. }
  817. k = clust2sect(bp, ppclust) +
  818. so%bp->clustsize;
  819. }else{
  820. if(so*bp->sectsize >= bp->rootsize*DOSDIRSIZE)
  821. goto error;
  822. k = bp->rootaddr + so;
  823. }
  824. putsect(p);
  825. p = getsect(f->xf, k);
  826. if(p == 0){
  827. chat("getsect %ld failed\n", k);
  828. goto error;
  829. }
  830. }
  831. out:
  832. putsect(p);
  833. ndp->paddr = k;
  834. ndp->poffset = o;
  835. return 0;
  836. error:
  837. if(p)
  838. putsect(p);
  839. return -1;
  840. }
  841. long
  842. readfile(Xfile *f, void *vbuf, long offset, long count)
  843. {
  844. Xfs *xf = f->xf;
  845. Dosbpb *bp = xf->ptr;
  846. Dosptr *dp = f->ptr;
  847. Dosdir *d = dp->d;
  848. int isect, addr, o, c;
  849. Iosect *p;
  850. uchar *buf;
  851. long length, rcnt;
  852. rcnt = 0;
  853. length = GLONG(d->length);
  854. buf = vbuf;
  855. if(offset >= length)
  856. return 0;
  857. if(offset+count >= length)
  858. count = length - offset;
  859. isect = offset/bp->sectsize;
  860. o = offset%bp->sectsize;
  861. while(count > 0){
  862. addr = fileaddr(f, isect++, 0);
  863. if(addr < 0)
  864. break;
  865. c = bp->sectsize - o;
  866. if(c > count)
  867. c = count;
  868. p = getsect(xf, addr);
  869. if(p == 0)
  870. return -1;
  871. memmove(&buf[rcnt], &p->iobuf[o], c);
  872. putsect(p);
  873. count -= c;
  874. rcnt += c;
  875. o = 0;
  876. }
  877. return rcnt;
  878. }
  879. long
  880. writefile(Xfile *f, void *vbuf, long offset, long count)
  881. {
  882. Xfs *xf = f->xf;
  883. Dosbpb *bp = xf->ptr;
  884. Dosptr *dp = f->ptr;
  885. Dosdir *d = dp->d;
  886. int isect, addr = 0, o, c;
  887. Iosect *p;
  888. uchar *buf;
  889. long length, rcnt = 0, dlen;
  890. buf = vbuf;
  891. isect = offset/bp->sectsize;
  892. o = offset%bp->sectsize;
  893. while(count > 0){
  894. addr = fileaddr(f, isect++, 1);
  895. if(addr < 0)
  896. break;
  897. c = bp->sectsize - o;
  898. if(c > count)
  899. c = count;
  900. if(c == bp->sectsize){
  901. p = getosect(xf, addr);
  902. p->flags = 0;
  903. }else{
  904. p = getsect(xf, addr);
  905. if(p == nil)
  906. return -1;
  907. }
  908. memmove(&p->iobuf[o], &buf[rcnt], c);
  909. p->flags |= BMOD;
  910. putsect(p);
  911. count -= c;
  912. rcnt += c;
  913. o = 0;
  914. }
  915. if(rcnt <= 0 && addr < 0)
  916. return -1;
  917. length = 0;
  918. dlen = GLONG(d->length);
  919. if(rcnt > 0)
  920. length = offset+rcnt;
  921. else if(dp->addr && dp->clust){
  922. c = bp->clustsize*bp->sectsize;
  923. if(dp->iclust > (dlen+c-1)/c)
  924. length = c*dp->iclust;
  925. }
  926. if(length > dlen)
  927. PLONG(d->length, length);
  928. puttime(d, 0);
  929. dp->p->flags |= BMOD;
  930. return rcnt;
  931. }
  932. int
  933. truncfile(Xfile *f, long length)
  934. {
  935. Xfs *xf = f->xf;
  936. Dosbpb *bp = xf->ptr;
  937. Dosptr *dp = f->ptr;
  938. Dosdir *d = dp->d;
  939. long clust, next, n;
  940. mlock(bp);
  941. clust = getstart(f->xf, d);
  942. n = length;
  943. if(n <= 0)
  944. putstart(f->xf, d, 0);
  945. else
  946. n -= bp->sectsize;
  947. while(clust > 0){
  948. next = getfat(xf, clust);
  949. if(n <= 0)
  950. putfat(xf, clust, 0);
  951. else
  952. n -= bp->clustsize*bp->sectsize;
  953. clust = next;
  954. }
  955. unmlock(bp);
  956. PLONG(d->length, length);
  957. dp->iclust = 0;
  958. dp->clust = 0;
  959. dp->p->flags |= BMOD;
  960. return 0;
  961. }
  962. void
  963. putdir(Dosdir *d, Dir *dp)
  964. {
  965. if(dp->mode != ~0){
  966. if(dp->mode & 2)
  967. d->attr &= ~DRONLY;
  968. else
  969. d->attr |= DRONLY;
  970. if(dp->mode & DMEXCL)
  971. d->attr |= DSYSTEM;
  972. else
  973. d->attr &= ~DSYSTEM;
  974. }
  975. if(dp->mtime != ~0)
  976. puttime(d, dp->mtime);
  977. }
  978. /*
  979. * should extend this to deal with
  980. * creation and access dates
  981. */
  982. void
  983. getdir(Xfs *xfs, Dir *dp, Dosdir *d, int addr, int offset)
  984. {
  985. if(d == nil || addr == 0)
  986. panic("getdir on root");
  987. dp->type = 0;
  988. dp->dev = 0;
  989. getname(dp->name, d);
  990. dp->qid.path = addr*(Sectorsize/DOSDIRSIZE) +
  991. offset/DOSDIRSIZE;
  992. dp->qid.vers = 0;
  993. if(d->attr & DRONLY)
  994. dp->mode = 0444;
  995. else
  996. dp->mode = 0666;
  997. dp->atime = gtime(d);
  998. dp->mtime = dp->atime;
  999. dp->qid.type = QTFILE;
  1000. if(d->attr & DDIR){
  1001. dp->qid.type = QTDIR;
  1002. dp->mode |= DMDIR|0111;
  1003. dp->length = 0;
  1004. }else
  1005. dp->length = GLONG(d->length);
  1006. if(d->attr & DSYSTEM){
  1007. dp->mode |= DMEXCL;
  1008. if(iscontig(xfs, d))
  1009. dp->mode |= DMAPPEND;
  1010. }
  1011. dp->uid = "bill";
  1012. dp->muid = "bill";
  1013. dp->gid = "trog";
  1014. }
  1015. void
  1016. getname(char *p, Dosdir *d)
  1017. {
  1018. int c, i;
  1019. for(i=0; i<8; i++){
  1020. c = d->name[i];
  1021. if(c == '\0' || c == ' ')
  1022. break;
  1023. if(i == 0 && c == 0x05)
  1024. c = 0xe5;
  1025. *p++ = c;
  1026. }
  1027. for(i=0; i<3; i++){
  1028. c = d->ext[i];
  1029. if(c == '\0' || c == ' ')
  1030. break;
  1031. if(i == 0)
  1032. *p++ = '.';
  1033. *p++ = c;
  1034. }
  1035. *p = 0;
  1036. }
  1037. static char*
  1038. getnamerunes(char *dst, uchar *buf, int step)
  1039. {
  1040. int i;
  1041. Rune r;
  1042. char dbuf[DOSRUNE * UTFmax + 1], *d;
  1043. d = dbuf;
  1044. r = 1;
  1045. for(i = 1; r && i < 11; i += 2){
  1046. r = buf[i] | (buf[i+1] << 8);
  1047. d += runetochar(d, &r);
  1048. }
  1049. for(i = 14; r && i < 26; i += 2){
  1050. r = buf[i] | (buf[i+1] << 8);
  1051. d += runetochar(d, &r);
  1052. }
  1053. for(i = 28; r && i < 32; i += 2){
  1054. r = buf[i] | (buf[i+1] << 8);
  1055. d += runetochar(d, &r);
  1056. }
  1057. if(step == 1)
  1058. dst -= d - dbuf;
  1059. memmove(dst, dbuf, d - dbuf);
  1060. if(step == -1){
  1061. dst += d - dbuf;
  1062. *dst = '\0';
  1063. }
  1064. return dst;
  1065. }
  1066. char*
  1067. getnamesect(char *dbuf, char *d, uchar *buf, int *islong, int *sum, int step)
  1068. {
  1069. /*
  1070. * validation checks to make sure we're
  1071. * making up a consistent name
  1072. */
  1073. if(buf[11] != 0xf || buf[12] != 0){
  1074. *islong = 0;
  1075. return nil;
  1076. }
  1077. if(step == 1){
  1078. if((buf[0] & 0xc0) == 0x40){
  1079. *islong = buf[0] & 0x3f;
  1080. *sum = buf[13];
  1081. d = dbuf + DOSNAMELEN;
  1082. *--d = '\0';
  1083. }else if(*islong && *islong == buf[0] + 1 && *sum == buf[13]){
  1084. *islong = buf[0];
  1085. }else{
  1086. *islong = 0;
  1087. return nil;
  1088. }
  1089. }else{
  1090. if(*islong + 1 == (buf[0] & 0xbf) && *sum == buf[13]){
  1091. *islong = buf[0] & 0x3f;
  1092. if(buf[0] & 0x40)
  1093. *sum = -1;
  1094. }else{
  1095. *islong = 0;
  1096. *sum = -1;
  1097. return nil;
  1098. }
  1099. }
  1100. if(*islong > 20){
  1101. *islong = 0;
  1102. *sum = -1;
  1103. return nil;
  1104. }
  1105. return getnamerunes(d, buf, step);
  1106. }
  1107. void
  1108. putname(char *p, Dosdir *d)
  1109. {
  1110. int i;
  1111. memset(d->name, ' ', sizeof d->name+sizeof d->ext);
  1112. for(i=0; i<sizeof d->name; i++){
  1113. if(*p == 0 || *p == '.')
  1114. break;
  1115. d->name[i] = toupper(*p++);
  1116. }
  1117. p = strrchr(p, '.');
  1118. if(p){
  1119. for(i=0; i<sizeof d->ext; i++){
  1120. if(*++p == 0)
  1121. break;
  1122. d->ext[i] = toupper(*p);
  1123. }
  1124. }
  1125. }
  1126. static void
  1127. putnamesect(uchar *slot, Rune *longname, int curslot, int first, int sum)
  1128. {
  1129. Rune r;
  1130. Dosdir ds;
  1131. int i, j;
  1132. memset(&ds, 0xff, sizeof ds);
  1133. ds.attr = 0xf;
  1134. ds.reserved[0] = 0;
  1135. ds.reserved[1] = sum;
  1136. ds.start[0] = 0;
  1137. ds.start[1] = 0;
  1138. if(first)
  1139. ds.name[0] = 0x40 | curslot;
  1140. else
  1141. ds.name[0] = curslot;
  1142. memmove(slot, &ds, sizeof ds);
  1143. j = (curslot-1) * DOSRUNE;
  1144. for(i = 1; i < 11; i += 2){
  1145. r = longname[j++];
  1146. slot[i] = r;
  1147. slot[i+1] = r >> 8;
  1148. if(r == 0)
  1149. return;
  1150. }
  1151. for(i = 14; i < 26; i += 2){
  1152. r = longname[j++];
  1153. slot[i] = r;
  1154. slot[i+1] = r >> 8;
  1155. if(r == 0)
  1156. return;
  1157. }
  1158. for(i = 28; i < 32; i += 2){
  1159. r = longname[j++];
  1160. slot[i] = r;
  1161. slot[i+1] = r >> 8;
  1162. if(r == 0)
  1163. return;
  1164. }
  1165. }
  1166. int
  1167. aliassum(Dosdir *d)
  1168. {
  1169. int i, sum;
  1170. if(d == nil)
  1171. return -1;
  1172. sum = 0;
  1173. for(i = 0; i < 11; i++)
  1174. sum = (((sum&1)<<7) | ((sum&0xfe)>>1)) + d->name[i];
  1175. return sum & 0xff;
  1176. }
  1177. int
  1178. putlongname(Xfs *xf, Dosptr *ndp, char *name, char sname[13])
  1179. {
  1180. Dosbpb *bp;
  1181. Dosdir tmpd;
  1182. Rune longname[DOSNAMELEN+1];
  1183. int i, first, sum, nds, len;
  1184. /* calculate checksum */
  1185. putname(sname, &tmpd);
  1186. sum = aliassum(&tmpd);
  1187. bp = xf->ptr;
  1188. first = 1;
  1189. len = utftorunes(longname, name, DOSNAMELEN);
  1190. if(chatty){
  1191. chat("utftorunes %s =", name);
  1192. for(i=0; i<len; i++)
  1193. chat(" %.4X", longname[i]);
  1194. chat("\n");
  1195. }
  1196. for(nds = (len + DOSRUNE-1) / DOSRUNE; nds > 0; nds--){
  1197. putnamesect(&ndp->p->iobuf[ndp->offset], longname, nds, first, sum);
  1198. first = 0;
  1199. ndp->offset += 32;
  1200. if(ndp->offset == bp->sectsize){
  1201. chat("long name moving over sector boundary\n");
  1202. ndp->p->flags |= BMOD;
  1203. putsect(ndp->p);
  1204. ndp->p = nil;
  1205. /*
  1206. * switch to the next cluster for a long entry
  1207. * naddr should be set up correctly by searchdir
  1208. */
  1209. ndp->prevaddr = ndp->addr;
  1210. ndp->addr = ndp->naddr;
  1211. ndp->naddr = -1;
  1212. if(ndp->addr == -1)
  1213. return -1;
  1214. ndp->p = getsect(xf, ndp->addr);
  1215. if(ndp->p == nil)
  1216. return -1;
  1217. ndp->offset = 0;
  1218. ndp->d = (Dosdir *)&ndp->p->iobuf[ndp->offset];
  1219. }
  1220. }
  1221. return 0;
  1222. }
  1223. long
  1224. getfat(Xfs *xf, int n)
  1225. {
  1226. Dosbpb *bp = xf->ptr;
  1227. Iosect *p;
  1228. ulong k, sect;
  1229. int o, fb;
  1230. if(n < FATRESRV || n >= bp->fatclusters)
  1231. return -1;
  1232. fb = bp->fatbits;
  1233. k = (fb * n) >> 3;
  1234. if(k >= bp->fatsize*bp->sectsize)
  1235. panic("getfat");
  1236. sect = k/bp->sectsize + bp->fataddr;
  1237. o = k%bp->sectsize;
  1238. p = getsect(xf, sect);
  1239. if(p == nil)
  1240. return -1;
  1241. k = p->iobuf[o++];
  1242. if(o >= bp->sectsize){
  1243. putsect(p);
  1244. p = getsect(xf, sect+1);
  1245. if(p == nil)
  1246. return -1;
  1247. o = 0;
  1248. }
  1249. k |= p->iobuf[o++]<<8;
  1250. if(fb == 32){
  1251. /* fat32 is really fat28 */
  1252. k |= p->iobuf[o++] << 16;
  1253. k |= (p->iobuf[o] & 0x0f) << 24;
  1254. fb = 28;
  1255. }
  1256. putsect(p);
  1257. if(fb == 12){
  1258. if(n&1)
  1259. k >>= 4;
  1260. else
  1261. k &= 0xfff;
  1262. }
  1263. if(chatty > 1)
  1264. chat("fat(%#x)=%#lx...", n, k);
  1265. /*
  1266. * This is a very strange check for out of range.
  1267. * As a concrete example, for a 16-bit FAT,
  1268. * FFF8 through FFFF all signify ``end of cluster chain.''
  1269. * This generalizes to other-sized FATs.
  1270. */
  1271. if(k >= (1 << fb) - 8)
  1272. return -1;
  1273. return k;
  1274. }
  1275. void
  1276. putfat(Xfs *xf, int n, ulong val)
  1277. {
  1278. Fatinfo *fi;
  1279. Dosbpb *bp;
  1280. Iosect *p;
  1281. ulong k, sect, esect;
  1282. int o;
  1283. bp = xf->ptr;
  1284. if(n < FATRESRV || n >= bp->fatclusters)
  1285. panic("putfat n=%d", n);
  1286. k = (bp->fatbits * n) >> 3;
  1287. if(k >= bp->fatsize*bp->sectsize)
  1288. panic("putfat");
  1289. sect = k/bp->sectsize + bp->fataddr;
  1290. esect = sect + bp->nfats * bp->fatsize;
  1291. for(; sect<esect; sect+=bp->fatsize){
  1292. o = k%bp->sectsize;
  1293. p = getsect(xf, sect);
  1294. if(p == nil)
  1295. continue;
  1296. switch(bp->fatbits){
  1297. case 12:
  1298. if(n&1){
  1299. p->iobuf[o] &= 0x0f;
  1300. p->iobuf[o++] |= val<<4;
  1301. if(o >= bp->sectsize){
  1302. p->flags |= BMOD;
  1303. putsect(p);
  1304. p = getsect(xf, sect+1);
  1305. if(p == nil)
  1306. continue;
  1307. o = 0;
  1308. }
  1309. p->iobuf[o] = val>>4;
  1310. }else{
  1311. p->iobuf[o++] = val;
  1312. if(o >= bp->sectsize){
  1313. p->flags |= BMOD;
  1314. putsect(p);
  1315. p = getsect(xf, sect+1);
  1316. if(p == nil)
  1317. continue;
  1318. o = 0;
  1319. }
  1320. p->iobuf[o] &= 0xf0;
  1321. p->iobuf[o] |= (val>>8) & 0x0f;
  1322. }
  1323. break;
  1324. case 16:
  1325. p->iobuf[o++] = val;
  1326. p->iobuf[o] = val>>8;
  1327. break;
  1328. case 32: /* fat32 is really fat28 */
  1329. p->iobuf[o++] = val;
  1330. p->iobuf[o++] = val>>8;
  1331. p->iobuf[o++] = val>>16;
  1332. p->iobuf[o] = (p->iobuf[o] & 0xf0) | ((val>>24) & 0x0f);
  1333. break;
  1334. default:
  1335. panic("putfat fatbits");
  1336. }
  1337. p->flags |= BMOD;
  1338. putsect(p);
  1339. }
  1340. if(val == 0)
  1341. bp->freeclusters++;
  1342. else
  1343. bp->freeclusters--;
  1344. if(bp->fatinfo){
  1345. p = getsect(xf, bp->fatinfo);
  1346. if(p != nil){
  1347. fi = (Fatinfo*)p->iobuf;
  1348. PLONG(fi->nextfree, bp->freeptr);
  1349. PLONG(fi->freeclust, bp->freeclusters);
  1350. p->flags |= BMOD;
  1351. putsect(p);
  1352. }
  1353. }
  1354. }
  1355. /*
  1356. * Contiguous falloc; if we can, use lastclust+1.
  1357. * Otherwise, move the file to get some space.
  1358. * If there just isn't enough contiguous space
  1359. * anywhere on disk, fail.
  1360. */
  1361. int
  1362. cfalloc(Xfile *f)
  1363. {
  1364. int l;
  1365. if((l=makecontig(f, 8)) >= 0)
  1366. return l;
  1367. return makecontig(f, 1);
  1368. }
  1369. /*
  1370. * Check whether a file is contiguous.
  1371. */
  1372. int
  1373. iscontig(Xfs *xf, Dosdir *d)
  1374. {
  1375. long clust, next;
  1376. clust = getstart(xf, d);
  1377. if(clust <= 0)
  1378. return 1;
  1379. for(;;) {
  1380. next = getfat(xf, clust);
  1381. if(next < 0)
  1382. return 1;
  1383. if(next != clust+1)
  1384. return 0;
  1385. clust = next;
  1386. }
  1387. return 0; /* not reached */
  1388. }
  1389. /*
  1390. * Make a file contiguous, with nextra clusters of
  1391. * free space after it for later expansion.
  1392. * Return the number of the first new cluster.
  1393. */
  1394. int
  1395. makecontig(Xfile *f, int nextra)
  1396. {
  1397. Dosbpb *bp;
  1398. Dosdir *d;
  1399. Dosptr *dp;
  1400. Xfs *xf;
  1401. Iosect *wp, *rp;
  1402. long clust, next, last, start, rclust, wclust, eclust, ostart;
  1403. int isok, i, n, nclust, nrun, rs, ws;
  1404. xf = f->xf;
  1405. bp = xf->ptr;
  1406. dp = f->ptr;
  1407. d = dp->d;
  1408. isok = 1;
  1409. nclust = 0;
  1410. clust = fileclust(f, 0, 0);
  1411. chat("clust %#lux", clust);
  1412. if(clust != -1) {
  1413. for(;;) {
  1414. nclust++;
  1415. chat(".");
  1416. next = getfat(xf, clust);
  1417. if(next <= 0)
  1418. break;
  1419. if(next != clust+1)
  1420. isok = 0;
  1421. clust = next;
  1422. }
  1423. }
  1424. chat("nclust %d\n", nclust);
  1425. if(isok && clust != -1) {
  1426. eclust = clust+1; /* eclust = first cluster past file */
  1427. assert(eclust == fileclust(f, 0, 0)+nclust);
  1428. for(i=0; i<nextra; i++)
  1429. if(getfat(xf, eclust+i) != 0)
  1430. break;
  1431. if(i == nextra) { /* they were all free */
  1432. chat("eclust=%#lx, getfat eclust-1 = %#lux\n", eclust, getfat(xf, eclust-1));
  1433. assert(getfat(xf, eclust-1) == 0xffffffff);
  1434. putfat(xf, eclust-1, eclust);
  1435. putfat(xf, eclust, 0xffffffff);
  1436. bp->freeptr = clust+1; /* to help keep the blocks free */
  1437. return eclust;
  1438. }
  1439. }
  1440. /* need to search for nclust+nextra contiguous free blocks */
  1441. last = -1;
  1442. n = bp->freeptr;
  1443. nrun = 0;
  1444. for(;;){
  1445. if(getfat(xf, n) == 0) {
  1446. if(last+1 == n)
  1447. nrun++;
  1448. else
  1449. nrun = 1;
  1450. if(nrun >= nclust+nextra)
  1451. break;
  1452. last = n;
  1453. }
  1454. if(++n >= bp->fatclusters)
  1455. n = FATRESRV;
  1456. if(n == bp->freeptr) {
  1457. errno = Econtig;
  1458. return -1;
  1459. }
  1460. }
  1461. bp->freeptr = n+1;
  1462. /* copy old data over */
  1463. start = n+1 - nrun;
  1464. /* sanity check */
  1465. for(i=0; i<nclust+nextra; i++)
  1466. assert(getfat(xf, start+i) == 0);
  1467. chat("relocate chain %lux -> 0x%lux len %d\n", fileclust(f, 0, 0), start, nclust);
  1468. wclust = start;
  1469. for(rclust = fileclust(f, 0, 0); rclust > 0; rclust = next){
  1470. rs = clust2sect(bp, rclust);
  1471. ws = clust2sect(bp, wclust);
  1472. for(i=0; i<bp->clustsize; i++, rs++, ws++){
  1473. rp = getsect(xf, rs);
  1474. if(rp == nil)
  1475. return -1;
  1476. wp = getosect(xf, ws);
  1477. assert(wp != nil);
  1478. memmove(wp->iobuf, rp->iobuf, bp->sectsize);
  1479. wp->flags = BMOD;
  1480. putsect(rp);
  1481. putsect(wp);
  1482. }
  1483. chat("move cluster %#lx -> %#lx...", rclust, wclust);
  1484. next = getfat(xf, rclust);
  1485. putfat(xf, wclust, wclust+1);
  1486. wclust++;
  1487. }
  1488. /* now wclust points at the first new cluster; chain it in */
  1489. chat("wclust 0x%lux start 0x%lux (fat->0x%lux) nclust %d\n", wclust, start, getfat(xf, start), nclust);
  1490. assert(wclust == start+nclust);
  1491. putfat(xf, wclust, 0xffffffff); /* end of file */
  1492. /* update directory entry to point at new start */
  1493. ostart = fileclust(f, 0, 0);
  1494. putstart(xf, d, start);
  1495. /* check our work */
  1496. i = 0;
  1497. clust = fileclust(f, 0, 0);
  1498. if(clust != -1) {
  1499. for(;;) {
  1500. i++;
  1501. next = getfat(xf, clust);
  1502. if(next <= 0)
  1503. break;
  1504. assert(next == clust+1);
  1505. clust = next;
  1506. }
  1507. }
  1508. chat("chain check: len %d\n", i);
  1509. assert(i == nclust+1);
  1510. /* succeeded; remove old chain. */
  1511. for(rclust = ostart; rclust > 0; rclust = next){
  1512. next = getfat(xf, rclust);
  1513. putfat(xf, rclust, 0); /* free cluster */
  1514. }
  1515. return start+nclust;
  1516. }
  1517. int
  1518. falloc(Xfs *xf)
  1519. {
  1520. Dosbpb *bp = xf->ptr;
  1521. Iosect *p;
  1522. int n, i, k;
  1523. n = bp->freeptr;
  1524. for(;;){
  1525. if(getfat(xf, n) == 0)
  1526. break;
  1527. if(++n >= bp->fatclusters)
  1528. n = FATRESRV;
  1529. if(n == bp->freeptr)
  1530. return -1;
  1531. }
  1532. bp->freeptr = n+1;
  1533. if(bp->freeptr >= bp->fatclusters)
  1534. bp->freeptr = FATRESRV;
  1535. putfat(xf, n, 0xffffffff);
  1536. k = clust2sect(bp, n);
  1537. for(i=0; i<bp->clustsize; i++){
  1538. p = getosect(xf, k+i);
  1539. memset(p->iobuf, 0, bp->sectsize);
  1540. p->flags = BMOD;
  1541. putsect(p);
  1542. }
  1543. return n;
  1544. }
  1545. void
  1546. ffree(Xfs *xf, long start)
  1547. {
  1548. putfat(xf, start, 0);
  1549. }
  1550. long
  1551. clust2sect(Dosbpb *bp, long clust)
  1552. {
  1553. return bp->dataaddr + (clust - FATRESRV) * bp->clustsize;
  1554. }
  1555. long
  1556. sect2clust(Dosbpb *bp, long sect)
  1557. {
  1558. long c;
  1559. c = (sect - bp->dataaddr) / bp->clustsize + FATRESRV;
  1560. assert(sect == clust2sect(bp, c));
  1561. return c;
  1562. }
  1563. void
  1564. puttime(Dosdir *d, long s)
  1565. {
  1566. Tm *t;
  1567. ushort x;
  1568. if(s == 0)
  1569. s = time(0);
  1570. t = localtime(s);
  1571. x = (t->hour<<11) | (t->min<<5) | (t->sec>>1);
  1572. PSHORT(d->time, x);
  1573. x = ((t->year-80)<<9) | ((t->mon+1)<<5) | t->mday;
  1574. PSHORT(d->date, x);
  1575. }
  1576. long
  1577. gtime(Dosdir *dp)
  1578. {
  1579. Tm tm;
  1580. int i;
  1581. i = GSHORT(dp->time);
  1582. tm.hour = i >> 11;
  1583. tm.min = (i >> 5) & 63;
  1584. tm.sec = (i & 31) << 1;
  1585. i = GSHORT(dp->date);
  1586. tm.year = 80 + (i >> 9);
  1587. tm.mon = ((i >> 5) & 15) - 1;
  1588. tm.mday = i & 31;
  1589. tm.zone[0] = '\0';
  1590. tm.tzoff = 0;
  1591. return tm2sec(&tm);
  1592. }
  1593. /*
  1594. * structure dumps for debugging
  1595. */
  1596. void
  1597. bootdump(int fd, Dosboot *b)
  1598. {
  1599. Biobuf bp;
  1600. Binit(&bp, fd, OWRITE);
  1601. Bprint(&bp, "magic: 0x%2.2x 0x%2.2x 0x%2.2x\n",
  1602. b->magic[0], b->magic[1], b->magic[2]);
  1603. Bprint(&bp, "version: \"%8.8s\"\n", (char*)b->version);
  1604. Bprint(&bp, "sectsize: %d\n", GSHORT(b->sectsize));
  1605. Bprint(&bp, "clustsize: %d\n", b->clustsize);
  1606. Bprint(&bp, "nresrv: %d\n", GSHORT(b->nresrv));
  1607. Bprint(&bp, "nfats: %d\n", b->nfats);
  1608. Bprint(&bp, "rootsize: %d\n", GSHORT(b->rootsize));
  1609. Bprint(&bp, "volsize: %d\n", GSHORT(b->volsize));
  1610. Bprint(&bp, "mediadesc: 0x%2.2x\n", b->mediadesc);
  1611. Bprint(&bp, "fatsize: %d\n", GSHORT(b->fatsize));
  1612. Bprint(&bp, "trksize: %d\n", GSHORT(b->trksize));
  1613. Bprint(&bp, "nheads: %d\n", GSHORT(b->nheads));
  1614. Bprint(&bp, "nhidden: %ld\n", GLONG(b->nhidden));
  1615. Bprint(&bp, "bigvolsize: %ld\n", GLONG(b->bigvolsize));
  1616. Bprint(&bp, "driveno: %d\n", b->driveno);
  1617. Bprint(&bp, "reserved0: 0x%2.2x\n", b->reserved0);
  1618. Bprint(&bp, "bootsig: 0x%2.2x\n", b->bootsig);
  1619. Bprint(&bp, "volid: 0x%8.8lux\n", GLONG(b->volid));
  1620. Bprint(&bp, "label: \"%11.11s\"\n", (char*)b->label);
  1621. Bterm(&bp);
  1622. }
  1623. void
  1624. bootdump32(int fd, Dosboot32 *b)
  1625. {
  1626. Biobuf bp;
  1627. Binit(&bp, fd, OWRITE);
  1628. Bprint(&bp, "magic: 0x%2.2x 0x%2.2x 0x%2.2x\n",
  1629. b->magic[0], b->magic[1], b->magic[2]);
  1630. Bprint(&bp, "version: \"%8.8s\"\n", (char*)b->version);
  1631. Bprint(&bp, "sectsize: %d\n", GSHORT(b->sectsize));
  1632. Bprint(&bp, "clustsize: %d\n", b->clustsize);
  1633. Bprint(&bp, "nresrv: %d\n", GSHORT(b->nresrv));
  1634. Bprint(&bp, "nfats: %d\n", b->nfats);
  1635. Bprint(&bp, "rootsize: %d\n", GSHORT(b->rootsize));
  1636. Bprint(&bp, "volsize: %d\n", GSHORT(b->volsize));
  1637. Bprint(&bp, "mediadesc: 0x%2.2x\n", b->mediadesc);
  1638. Bprint(&bp, "fatsize: %d\n", GSHORT(b->fatsize));
  1639. Bprint(&bp, "trksize: %d\n", GSHORT(b->trksize));
  1640. Bprint(&bp, "nheads: %d\n", GSHORT(b->nheads));
  1641. Bprint(&bp, "nhidden: %ld\n", GLONG(b->nhidden));
  1642. Bprint(&bp, "bigvolsize: %ld\n", GLONG(b->bigvolsize));
  1643. Bprint(&bp, "fatsize32: %ld\n", GLONG(b->fatsize32));
  1644. Bprint(&bp, "extflags: %d\n", GSHORT(b->extflags));
  1645. Bprint(&bp, "version: %d\n", GSHORT(b->version1));
  1646. Bprint(&bp, "rootstart: %ld\n", GLONG(b->rootstart));
  1647. Bprint(&bp, "infospec: %d\n", GSHORT(b->infospec));
  1648. Bprint(&bp, "backupboot: %d\n", GSHORT(b->backupboot));
  1649. Bprint(&bp, "reserved: %d %d %d %d %d %d %d %d %d %d %d %d\n",
  1650. b->reserved[0], b->reserved[1], b->reserved[2], b->reserved[3],
  1651. b->reserved[4], b->reserved[5], b->reserved[6], b->reserved[7],
  1652. b->reserved[8], b->reserved[9], b->reserved[10], b->reserved[11]);
  1653. Bterm(&bp);
  1654. }
  1655. void
  1656. bootsecdump32(int fd, Xfs *xf, Dosboot32 *b32)
  1657. {
  1658. Fatinfo *fi;
  1659. Iosect *p1;
  1660. int fisec, bsec, res;
  1661. fprint(fd, "\nfat32\n");
  1662. bootdump32(fd, b32);
  1663. res = GSHORT(b32->nresrv);
  1664. bsec = GSHORT(b32->backupboot);
  1665. if(bsec < res && bsec != 0){
  1666. p1 = getsect(xf, bsec);
  1667. if(p1 == nil)
  1668. fprint(fd, "\ncouldn't get backup boot sector: %r\n");
  1669. else{
  1670. fprint(fd, "\nbackup boot\n");
  1671. bootdump32(fd, (Dosboot32*)p1->iobuf);
  1672. putsect(p1);
  1673. }
  1674. }else if(bsec != 0xffff)
  1675. fprint(fd, "bad backup boot sector: %d reserved %d\n", bsec, res);
  1676. fisec = GSHORT(b32->infospec);
  1677. if(fisec < res && fisec != 0){
  1678. p1 = getsect(xf, fisec);
  1679. if(p1 == nil)
  1680. fprint(fd, "\ncouldn't get fat info sector: %r\n");
  1681. else{
  1682. fprint(fd, "\nfat info %d\n", fisec);
  1683. fi = (Fatinfo*)p1->iobuf;
  1684. fprint(fd, "sig1: 0x%lux sb 0x%lux\n", GLONG(fi->sig1), FATINFOSIG1);
  1685. fprint(fd, "sig: 0x%lux sb 0x%lux\n", GLONG(fi->sig), FATINFOSIG);
  1686. fprint(fd, "freeclust: %lud\n", GLONG(fi->freeclust));
  1687. fprint(fd, "nextfree: %lud\n", GLONG(fi->nextfree));
  1688. fprint(fd, "reserved: %lud %lud %lud\n", GLONG(fi->resrv), GLONG(fi->resrv+4), GLONG(fi->resrv+8));
  1689. putsect(p1);
  1690. }
  1691. }else if(fisec != 0xffff)
  1692. fprint(2, "bad fat info sector: %d reserved %d\n", bsec, res);
  1693. }
  1694. void
  1695. dirdump(void *vdbuf)
  1696. {
  1697. static char attrchar[] = "rhsvda67";
  1698. Dosdir *d;
  1699. char *name, namebuf[DOSNAMELEN];
  1700. char buf[128], *s, *ebuf;
  1701. uchar *dbuf;
  1702. int i;
  1703. if(!chatty)
  1704. return;
  1705. d = vdbuf;
  1706. ebuf = buf + sizeof(buf);
  1707. if(d->attr == 0xf){
  1708. dbuf = vdbuf;
  1709. name = namebuf + DOSNAMELEN;
  1710. *--name = '\0';
  1711. name = getnamerunes(name, dbuf, 1);
  1712. seprint(buf, ebuf, "\"%s\" %2.2x %2.2ux %2.2ux %d", name, dbuf[0], dbuf[12], dbuf[13], GSHORT(d->start));
  1713. }else{
  1714. s = seprint(buf, ebuf, "\"%.8s.%.3s\" ", (char*)d->name, (char*)d->ext);
  1715. for(i=7; i>=0; i--)
  1716. *s++ = d->attr&(1<<i) ? attrchar[i] : '-';
  1717. i = GSHORT(d->time);
  1718. s = seprint(s, ebuf, " %2.2d:%2.2d:%2.2d", i>>11, (i>>5)&63, (i&31)<<1);
  1719. i = GSHORT(d->date);
  1720. s = seprint(s, ebuf, " %2.2d.%2.2d.%2.2d", 80+(i>>9), (i>>5)&15, i&31);
  1721. i = GSHORT(d->ctime);
  1722. s = seprint(s, ebuf, " %2.2d:%2.2d:%2.2d", i>>11, (i>>5)&63, (i&31)<<1);
  1723. i = GSHORT(d->cdate);
  1724. s = seprint(s, ebuf, " %2.2d.%2.2d.%2.2d", 80+(i>>9), (i>>5)&15, i&31);
  1725. i = GSHORT(d->adate);
  1726. s = seprint(s, ebuf, " %2.2d.%2.2d.%2.2d", 80+(i>>9), (i>>5)&15, i&31);
  1727. seprint(s, ebuf, " %d %d", GSHORT(d->start), GSHORT(d->length));
  1728. }
  1729. chat("%s\n", buf);
  1730. }
  1731. int
  1732. cistrcmp(char *s1, char *s2)
  1733. {
  1734. int c1, c2;
  1735. while(*s1){
  1736. c1 = *s1++;
  1737. c2 = *s2++;
  1738. if(c1 >= 'A' && c1 <= 'Z')
  1739. c1 -= 'A' - 'a';
  1740. if(c2 >= 'A' && c2 <= 'Z')
  1741. c2 -= 'A' - 'a';
  1742. if(c1 != c2)
  1743. return c1 - c2;
  1744. }
  1745. return -*s2;
  1746. }
  1747. int
  1748. utftorunes(Rune *rr, char *s, int n)
  1749. {
  1750. Rune *r, *re;
  1751. int c;
  1752. r = rr;
  1753. re = r + n - 1;
  1754. while(c = (uchar)*s){
  1755. if(c < Runeself){
  1756. *r = c;
  1757. s++;
  1758. }else
  1759. s += chartorune(r, s);
  1760. r++;
  1761. if(r >= re)
  1762. break;
  1763. }
  1764. *r = 0;
  1765. return r - rr;
  1766. }