Generic.Unix.UnixFiles.Mod 33 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157
  1. (* Aos, Copyright 2001, Pieter Muller, ETH Zurich *)
  2. MODULE UnixFiles; (** AUTHOR "gf"; PURPOSE "Unix file systems" *)
  3. (* derived fron (SPARCOberon) Files.Mod by J. Templ 1.12. 89/14.05.93 *)
  4. IMPORT S := SYSTEM, Unix, Kernel, Modules, Log := KernelLog, Files;
  5. CONST
  6. NBufs = 4; Bufsize = 4096; (*FileTabSize = 1024; ResFiles = 128; *) NoDesc = -1;
  7. Open = 0; Create = 1; Closed = 2; (* file states *)
  8. NoKey = -1;
  9. CreateFlags = Unix.rdwr + Unix.creat + Unix.trunc;
  10. TraceCollection = 0;
  11. (* TraceSearch=1;*)
  12. Trace = {};
  13. VAR
  14. tempno: INTEGER;
  15. openfiles: INTEGER;
  16. searchPath: ARRAY 1024 OF CHAR;
  17. cwd: ARRAY 256 OF CHAR;
  18. unixFS: UnixFileSystem; (* must be unique *)
  19. collection: Collection; (* must be unique *)
  20. TYPE
  21. Filename = ARRAY 256 OF CHAR;
  22. NameSet = OBJECT
  23. VAR
  24. name: ARRAY 64 OF CHAR;
  25. left, right: NameSet;
  26. PROCEDURE Add( CONST filename: ARRAY OF CHAR ): BOOLEAN;
  27. (* add filename if it not already exists. else return false *)
  28. BEGIN
  29. IF filename = name THEN RETURN FALSE END;
  30. IF filename < name THEN
  31. IF left = NIL THEN NEW( left, filename ); RETURN TRUE
  32. ELSE RETURN left.Add( filename )
  33. END
  34. ELSE
  35. IF right = NIL THEN NEW( right, filename ); RETURN TRUE
  36. ELSE RETURN right.Add( filename )
  37. END
  38. END
  39. END Add;
  40. PROCEDURE & Init( CONST filename: ARRAY OF CHAR );
  41. BEGIN
  42. COPY( filename, name );
  43. left := NIL; right := NIL
  44. END Init;
  45. END NameSet;
  46. AliasFileSystem = OBJECT (Files.FileSystem)
  47. VAR
  48. fs: UnixFileSystem;
  49. PROCEDURE & Init*( realFS: UnixFileSystem);
  50. BEGIN
  51. SELF.fs := realFS;
  52. END Init;
  53. PROCEDURE New0( name: ARRAY OF CHAR ): Files.File;
  54. VAR f: Files.File;
  55. BEGIN
  56. f := fs.New0( name );
  57. IF f # NIL THEN f.fs := SELF END;
  58. RETURN f;
  59. END New0;
  60. PROCEDURE Old0( name: ARRAY OF CHAR ): Files.File;
  61. VAR f: Files.File;
  62. BEGIN
  63. f := fs.Old0( name );
  64. IF f # NIL THEN f.fs := SELF END;
  65. RETURN f;
  66. END Old0;
  67. PROCEDURE Delete0( name: ARRAY OF CHAR; VAR key, res: LONGINT );
  68. BEGIN
  69. fs.Delete0( name, key, res );
  70. END Delete0;
  71. PROCEDURE Rename0( old, new: ARRAY OF CHAR; fold: Files.File; VAR res: LONGINT );
  72. BEGIN
  73. fs.Rename0( old, new, fold, res );
  74. END Rename0;
  75. PROCEDURE Enumerate0( mask: ARRAY OF CHAR; flags: SET; enum: Files.Enumerator );
  76. BEGIN
  77. fs.Enumerate0( mask, flags, enum );
  78. END Enumerate0;
  79. PROCEDURE FileKey( name: ARRAY OF CHAR ): LONGINT;
  80. VAR
  81. BEGIN
  82. RETURN fs.FileKey( name );
  83. END FileKey;
  84. PROCEDURE CreateDirectory0( name: ARRAY OF CHAR; VAR res: LONGINT );
  85. BEGIN
  86. fs.CreateDirectory0( name, res );
  87. END CreateDirectory0;
  88. PROCEDURE RemoveDirectory0( name: ARRAY OF CHAR; force: BOOLEAN; VAR key, res: LONGINT );
  89. BEGIN
  90. fs.RemoveDirectory0( name, force, key, res );
  91. END RemoveDirectory0;
  92. END AliasFileSystem;
  93. FinalizeFiles = OBJECT
  94. PROCEDURE EnumFile( f: ANY; VAR cont: BOOLEAN );
  95. VAR F: File;
  96. BEGIN
  97. F := f( File ); F.Finalize(); cont := TRUE
  98. END EnumFile;
  99. END FinalizeFiles;
  100. SearchByFstat = OBJECT
  101. VAR
  102. found: File;
  103. stat: Unix.Status;
  104. PROCEDURE Init( s: Unix.Status );
  105. BEGIN
  106. found := NIL;
  107. stat := s;
  108. END Init;
  109. PROCEDURE EnumFile( f: ANY; VAR cont: BOOLEAN );
  110. BEGIN
  111. WITH f: File DO
  112. IF (stat.ino = f.ino) & (stat.dev = f.dev) THEN
  113. (* possible different name but same file! *)
  114. ResetBuffers( f, stat );
  115. found := f; cont := FALSE;
  116. END;
  117. END;
  118. END EnumFile;
  119. END SearchByFstat;
  120. Collection = OBJECT (* methods in Collection shared by objects Filesystem and File *)
  121. VAR oldFiles, newFiles: Kernel.FinalizedCollection;
  122. ssearch: SearchByFstat;
  123. fileKey: LONGINT;
  124. PROCEDURE & Init*;
  125. BEGIN
  126. NEW( oldFiles ); NEW( newFiles ); NEW(ssearch); fileKey := -1;
  127. END Init;
  128. PROCEDURE AddNew( F: File );
  129. BEGIN {EXCLUSIVE}
  130. IF TraceCollection IN Trace THEN Log.String( "Collections.AddNew: " ); Log.String( F.workName ); Log.Ln; END;
  131. newFiles.Add( F, FinalizeFile );
  132. END AddNew;
  133. PROCEDURE AddOld( F: File );
  134. BEGIN {EXCLUSIVE}
  135. IF TraceCollection IN Trace THEN Log.String( "Collections.AddOld: " ); Log.String( F.workName ); Log.Ln; END;
  136. oldFiles.Add( F, FinalizeFile );
  137. END AddOld;
  138. PROCEDURE ByStat(CONST stat: Unix.Status): File;
  139. BEGIN{EXCLUSIVE}
  140. ssearch.Init(stat);
  141. oldFiles.Enumerate(ssearch.EnumFile);
  142. IF ssearch.found = NIL THEN
  143. newFiles.Enumerate(ssearch.EnumFile)
  144. END;
  145. IF TraceCollection IN Trace THEN
  146. Log.String( "Collections.ByStatus: " ); Log.Ln;
  147. IF ssearch.found = NIL THEN Log.String("not found") ELSE Log.String("found") END;
  148. END;
  149. RETURN ssearch.found;
  150. END ByStat;
  151. PROCEDURE Finalize;
  152. VAR fin: FinalizeFiles;
  153. BEGIN {EXCLUSIVE}
  154. IF TraceCollection IN Trace THEN Log.String( "Collections.Finalize " ); Log.Ln; END;
  155. NEW( fin ); newFiles.Enumerate( fin.EnumFile ); newFiles.Clear(); oldFiles.Enumerate( fin.EnumFile ); oldFiles.Clear();
  156. END Finalize;
  157. PROCEDURE FinalizeFile( obj: ANY );
  158. VAR F: File;
  159. BEGIN
  160. F := obj( File );
  161. IF TraceCollection IN Trace THEN Log.String( "Collections.FinalizeFile " ); Log.String( F.workName ); Log.Ln; END;
  162. F.Finalize()
  163. END FinalizeFile;
  164. END Collection;
  165. UnixFileSystem* = OBJECT (Files.FileSystem)
  166. PROCEDURE & Init;
  167. BEGIN
  168. prefix := ""; vol := NIL; desc := "UnixFS"
  169. END Init;
  170. PROCEDURE New0*( name: ARRAY OF CHAR ): Files.File;
  171. VAR f: File;
  172. BEGIN {EXCLUSIVE}
  173. (*AwaitFinalizingDone;*)
  174. NEW( f, SELF );
  175. f.workName := ""; COPY( name, f.registerName );
  176. f.fd := NoDesc; f.state := Create; f.fsize := 0; f.fpos := 0;
  177. f.swapper := -1; (*all f.buf[i] = NIL*)
  178. f.key := NoKey; f.fs := SELF;
  179. RETURN f
  180. END New0;
  181. PROCEDURE IsDirectory( VAR stat: Unix.Status ): BOOLEAN;
  182. VAR mode: LONGINT;
  183. BEGIN
  184. mode := stat.mode;
  185. RETURN ODD( mode DIV 4000H )
  186. END IsDirectory;
  187. PROCEDURE Old0*( name: ARRAY OF CHAR ): Files.File;
  188. VAR f: File; stat: Unix.Status; fd, r, errno, pos: LONGINT;
  189. oflags: SET; nextdir, path: Filename;
  190. BEGIN {EXCLUSIVE}
  191. IF name = "" THEN RETURN NIL END;
  192. IF IsFullName( name ) THEN
  193. COPY( name, path ); nextdir := "";
  194. ELSE
  195. pos := 0; ScanPath( pos, nextdir ); MakePath( nextdir, name, path );
  196. ScanPath( pos, nextdir )
  197. END;
  198. (*IF (FileTabSize - openfiles) < ResFiles THEN (*! GC *) END;*)
  199. LOOP
  200. r := Unix.access( ADDRESSOF( path ), Unix.R_OK );
  201. IF r >= 0 THEN
  202. r := Unix.access( ADDRESSOF( path ), Unix.W_OK );
  203. IF r < 0 THEN oflags := Unix.rdonly ELSE oflags := Unix.rdwr END;
  204. fd := Unix.open( ADDRESSOF( path ), oflags, {} ); errno := Unix.errno();
  205. IF ((fd < 0) & (errno IN {Unix.ENFILE, Unix.EMFILE})) (* OR (fd >= FileTabSize)*) THEN
  206. (*IF fd > 0 THEN r := Unix.p( fd ) END;*)
  207. (*!GC ;*)
  208. fd := Unix.open( ADDRESSOF( path ), oflags, {} ); errno := Unix.errno();
  209. END;
  210. IF fd >= 0 THEN
  211. r := Unix.fstat( fd, stat );
  212. f := collection.ByStat(stat);
  213. (*f := FindCachedEntry( stat );*)
  214. IF f # NIL THEN
  215. (* use the file already cached *) r := Unix.close( fd );
  216. EXIT
  217. ELSE
  218. (*ELSIF fd < FileTabSize THEN*)
  219. (*AwaitFinalizingDone;*)
  220. NEW( f, SELF );
  221. f.fd := fd; f.dev := stat.dev; f.ino := stat.ino;
  222. f.mtime := stat.mtime.sec; f.fsize := stat.size; f.fpos := 0;
  223. f.state := Open; f.swapper := -1; (*all f.buf[i] = NIL*)
  224. COPY( path, f.workName ); f.registerName := "";
  225. f.tempFile := FALSE;
  226. IF IsDirectory( stat ) THEN
  227. f.flags := {Files.Directory, Files.ReadOnly}
  228. ELSIF oflags = Unix.rdonly THEN
  229. f.flags := {Files.ReadOnly}
  230. END;
  231. f.key := NoKey; f.fs := SELF;
  232. (*fileTab[fd].f := f; (* cache file *)*)
  233. INC( openfiles );
  234. collection.AddOld(f);
  235. (*RegisterFinalizer( f, Cleanup );*)
  236. EXIT
  237. (*ELSE
  238. r := Unix.close( fd );
  239. Halt( f, FALSE, "UnixFiles.File.Old0: too many files open" );
  240. *)
  241. END
  242. END
  243. ELSIF nextdir # "" THEN
  244. MakePath( nextdir, name, path ); ScanPath( pos, nextdir );
  245. ELSE
  246. f := NIL; EXIT
  247. END;
  248. END; (* loop *)
  249. RETURN f
  250. END Old0;
  251. (** Return the unique non-zero key of the named file, if it exists. *)
  252. PROCEDURE FileKey*( name: ARRAY OF CHAR ): LONGINT;
  253. (* Can not be used for Unix files as LONGINT is too small.
  254. In the Unix filesystem a file is identified by
  255. - dev (64 bit (Linux), 32 bit (Solaris, Darwin)) +
  256. - ino (32 bit)
  257. *)
  258. BEGIN
  259. RETURN 0
  260. END FileKey;
  261. PROCEDURE Delete0*( name: ARRAY OF CHAR; VAR key, res: LONGINT );
  262. VAR r: LONGINT;
  263. BEGIN {EXCLUSIVE}
  264. r := Unix.unlink( ADDRESSOF( name ) );
  265. IF r = 0 THEN res := Files.Ok
  266. ELSE res := Unix.errno( )
  267. END;
  268. key := 0;
  269. END Delete0;
  270. (* return remaining old file, if any *)
  271. PROCEDURE TryRename*( old, new: ARRAY OF CHAR; f: Files.File; VAR res: LONGINT ): LONGINT;
  272. CONST Bufsize = 4096;
  273. VAR fdold, fdnew, fo, n, r: LONGINT; ostat, nstat: Unix.Status;
  274. buf: ARRAY Bufsize OF CHAR;
  275. BEGIN {EXCLUSIVE}
  276. fo := NoDesc;
  277. r:= Unix.stat( ADDRESSOF( old ), ostat );
  278. IF r >= 0 THEN
  279. r := Unix.stat( ADDRESSOF( new ), nstat );
  280. IF (r >= 0) & ((ostat.dev # nstat.dev) OR (ostat.ino # nstat.ino)) THEN
  281. r := Unix.unlink( ADDRESSOF( new ) ) (* work around stale nfs handles *);
  282. END;
  283. r := Unix.rename( ADDRESSOF( old ), ADDRESSOF( new ) );
  284. IF r < 0 THEN (* could not rename, try copy *)
  285. res := Unix.errno( );
  286. IF (res = Unix.EXDEV) OR (res = Unix.ETXTBSY) THEN (* cross device link, move the file / file busy frequently happens in VirtualBox *)
  287. fdold := Unix.open( ADDRESSOF( old ), Unix.rdonly, {} );
  288. fo := fdold;
  289. IF fdold < 0 THEN
  290. res := Unix.errno( );
  291. RETURN NoDesc;
  292. END;
  293. fdnew := Unix.open( ADDRESSOF( new ), Unix.rdwr + Unix.creat + Unix.trunc, Unix.rwrwr );
  294. IF fdnew < 0 THEN
  295. res := Unix.errno( );
  296. RETURN NoDesc;
  297. END;
  298. n := Unix.read( fdold, ADDRESSOF( buf ), Bufsize );
  299. WHILE n > 0 DO
  300. r := Unix.write( fdnew, ADDRESSOF( buf ), n );
  301. IF r < 0 THEN
  302. res := Unix.errno();
  303. r := Unix.close( fdold );
  304. r := Unix.close( fdnew );
  305. RETURN NoDesc;
  306. END;
  307. n := Unix.read( fdold, ADDRESSOF( buf ), Bufsize )
  308. END;
  309. r := Unix.unlink( ADDRESSOF( old ) );
  310. r := Unix.close( fdold );
  311. r := Unix.close( fdnew );
  312. res := Files.Ok
  313. ELSE
  314. RETURN NoDesc (* res is Unix.rename return code *)
  315. END
  316. END;
  317. res := Files.Ok
  318. ELSE
  319. res := Unix.errno();
  320. END;
  321. RETURN fo;
  322. END TryRename;
  323. PROCEDURE Rename0*( old, new: ARRAY OF CHAR; f: Files.File; VAR res: LONGINT );
  324. VAR of: LONGINT;
  325. BEGIN
  326. of := TryRename(old, new, f, res);
  327. END Rename0;
  328. PROCEDURE CreateDirectory0*( path: ARRAY OF CHAR; VAR res: LONGINT );
  329. VAR r: LONGINT;
  330. BEGIN {EXCLUSIVE}
  331. r := Unix.mkdir( ADDRESSOF( path ), Unix.rwxrwxrwx );
  332. IF r = 0 THEN res := Files.Ok
  333. ELSE res := Unix.errno( )
  334. END
  335. END CreateDirectory0;
  336. PROCEDURE RemoveDirectory0*( path: ARRAY OF CHAR; force: BOOLEAN; VAR key, res: LONGINT );
  337. VAR r: LONGINT;
  338. BEGIN {EXCLUSIVE}
  339. r := Unix.rmdir( ADDRESSOF( path ) );
  340. IF r = 0 THEN res := Files.Ok
  341. ELSE res := Unix.errno( )
  342. END
  343. END RemoveDirectory0;
  344. PROCEDURE Enumerate0*( mask: ARRAY OF CHAR; flags: SET; enum: Files.Enumerator );
  345. VAR
  346. path, filemask: Filename;
  347. i, j: INTEGER; dirName, fileName, fullName: Filename;
  348. checkSet: NameSet; ent: Unix.Dirent;
  349. PROCEDURE GetEntryName;
  350. VAR i: INTEGER; adr: ADDRESS;
  351. BEGIN
  352. i := -1; adr := ADDRESSOF( ent.name );
  353. REPEAT INC( i ); S.GET( adr, fileName[i] ); INC( adr ) UNTIL fileName[i] = 0X
  354. END GetEntryName;
  355. PROCEDURE EnumDir( CONST dirName: ARRAY OF CHAR );
  356. VAR
  357. dir: ADDRESS;
  358. tm: Unix.TmPtr; date, time: LONGINT;
  359. stat: Unix.Status; r: LONGINT;
  360. BEGIN
  361. dir := Unix.opendir( ADDRESSOF( dirName ) );
  362. IF dir # 0 THEN
  363. ent := Unix.readdir( dir );
  364. WHILE ent # NIL DO
  365. COPY( dirName, fullName );
  366. GetEntryName; AppendName( fullName, fileName );
  367. IF (fileName[0] # '.') & Match( fileName, filemask, 0, 0 ) THEN
  368. IF checkSet.Add( fileName ) THEN (* not a covered name *)
  369. r := Unix.stat( ADDRESSOF( fullName ), stat );
  370. tm := Unix.localtime( stat.mtime );
  371. date := tm.year*200H + (tm.mon + 1)*20H + tm.mday;
  372. time := tm.hour*1000H + tm.min*40H + tm.sec;
  373. flags := {};
  374. IF IsDirectory( stat ) THEN
  375. flags := {Files.ReadOnly, Files.Directory}
  376. ELSE
  377. r := Unix.access( ADDRESSOF( fullName ), Unix.W_OK );
  378. IF r < 0 THEN flags := {Files.ReadOnly} END
  379. END;
  380. enum.PutEntry( fullName, flags, time, date, stat.size );
  381. END
  382. END;
  383. ent := Unix.readdir( dir );
  384. END;
  385. Unix.closedir( dir )
  386. END;
  387. END EnumDir;
  388. BEGIN {EXCLUSIVE}
  389. Files.SplitName( mask, prefix, fullName );
  390. Files.SplitPath( fullName, path, filemask );
  391. NEW( checkSet, "M###N" );
  392. IF path # "" THEN
  393. CleanPath( path );
  394. EnumDir( path )
  395. ELSE
  396. i := 0; j := 0;
  397. LOOP
  398. IF (searchPath[i] = " ") OR (searchPath[i] = 0X) THEN
  399. dirName[j] := 0X;
  400. EnumDir( dirName );
  401. IF searchPath[i] = 0X THEN EXIT
  402. ELSE INC( i ); j := 0
  403. END
  404. ELSE
  405. dirName[j] := searchPath[i]; INC( j ); INC( i )
  406. END
  407. END
  408. END;
  409. checkSet := NIL;
  410. END Enumerate0;
  411. END UnixFileSystem;
  412. Buffer = POINTER TO RECORD (Files.Hint)
  413. chg: BOOLEAN;
  414. org, size: LONGINT;
  415. data: ARRAY Bufsize OF CHAR;
  416. END;
  417. File* = OBJECT (Files.File)
  418. VAR
  419. fd: LONGINT;
  420. workName, registerName: Filename;
  421. tempFile: BOOLEAN;
  422. dev: Unix.DevT;
  423. ino: LONGINT;
  424. mtime: HUGEINT;
  425. fsize, fpos: SIZE;
  426. bufs: ARRAY NBufs OF Buffer;
  427. swapper, state: LONGINT;
  428. PROCEDURE & Init( fs: Files.FileSystem );
  429. BEGIN
  430. SELF.fs := fs; flags := {};
  431. END Init;
  432. PROCEDURE CreateUnixFile;
  433. VAR
  434. stat: Unix.Status; done: BOOLEAN; r: LONGINT;
  435. BEGIN
  436. IF state = Create THEN
  437. GetTempName( registerName, workName ); tempFile := TRUE
  438. ELSIF state = Closed THEN
  439. IF registerName # "" THEN
  440. workName := registerName; registerName := ""; tempFile := FALSE;
  441. ELSE
  442. RETURN;
  443. END;
  444. END;
  445. r := Unix.unlink( ADDRESSOF( workName ) );
  446. (*unlink first to avoid stale NFS handles and to avoid reuse of inodes*)
  447. (*IF (FileTabSize - openfiles) < ResFiles THEN Kernel.GC END;*)
  448. fd := Unix.open( ADDRESSOF( workName ), CreateFlags, Unix.rwrwr );
  449. done := fd >= 0; r := Unix.errno();
  450. IF (~done & (r IN {Unix.ENFILE, Unix.EMFILE})) THEN
  451. Kernel.GC; (*! + wait ? *)
  452. fd := Unix.open( ADDRESSOF( workName ), CreateFlags, Unix.rwrwr );
  453. done := fd >= 0
  454. END;
  455. IF done THEN
  456. (*IF fd >= FileTabSize THEN
  457. r := Unix.close( fd );
  458. Halt( SELF, FALSE, "UnixFiles.File.Create: too many files open" )
  459. ELSE*)
  460. r := Unix.fstat( fd, stat );
  461. dev := stat.dev; ino := stat.ino; mtime := stat.mtime.sec;
  462. state := Open; fpos := 0;
  463. (*fileTab[fd].f := SELF;*)
  464. INC( openfiles );
  465. collection.AddNew(SELF);
  466. (*RegisterFinalizer( SELF, Cleanup );*)
  467. (*END*)
  468. ELSE
  469. Halt( SELF, TRUE, "UnixFiles.File.Create: open failed" );
  470. END
  471. END CreateUnixFile;
  472. PROCEDURE Flush( buf: Buffer );
  473. VAR res: LONGINT; stat: Unix.Status;
  474. BEGIN
  475. IF buf.chg THEN
  476. IF fd = NoDesc THEN CreateUnixFile END;
  477. IF buf.org # fpos THEN res := Unix.lseek( fd, buf.org, 0 ) END;
  478. res := Unix.write( fd, ADDRESSOF( buf.data ), buf.size );
  479. IF res < 0 THEN Halt( SELF, TRUE, "UnixFiles.File.Flush: write failed" ) END;
  480. fpos := buf.org + buf.size; buf.chg := FALSE;
  481. res := Unix.fstat( fd, stat ); mtime := stat.mtime.sec
  482. END
  483. END Flush;
  484. PROCEDURE Set*( VAR r: Files.Rider; pos: LONGINT );
  485. BEGIN {EXCLUSIVE}
  486. SetX( r, pos )
  487. END Set;
  488. PROCEDURE SetX( VAR r: Files.Rider; p: LONGINT );
  489. VAR org, offset, i, n, res: LONGINT; buf: Buffer;
  490. BEGIN
  491. IF p > fsize THEN p := LONGINT(fsize)
  492. ELSIF p < 0 THEN p := 0
  493. END;
  494. offset := p MOD Bufsize; org := p - offset;
  495. i := 0;
  496. WHILE (i < NBufs) & (bufs[i] # NIL) & (org # bufs[i].org) DO INC( i ) END;
  497. IF i < NBufs THEN
  498. IF bufs[i] = NIL THEN
  499. NEW( buf ); buf.chg := FALSE; buf.org := -1;
  500. bufs[i] := buf
  501. ELSE
  502. swapper := i;
  503. buf := bufs[swapper]; Flush( buf )
  504. END
  505. ELSE
  506. swapper := (swapper + 1) MOD NBufs;
  507. buf := bufs[swapper]; Flush( buf )
  508. END;
  509. IF buf.org # org THEN
  510. IF org = fsize THEN
  511. buf.size := 0
  512. ELSE
  513. IF fd = NoDesc THEN CreateUnixFile END;
  514. IF fpos # org THEN res := Unix.lseek( fd, org, 0 ) END;
  515. IF res < 0 THEN Halt( SELF, TRUE, "UnixFiles.File.Set: lseek failed" ) END;
  516. n := Unix.read( fd, ADDRESSOF( buf.data ), Bufsize );
  517. IF n < 0 THEN
  518. IF p < fsize THEN Halt( SELF, TRUE, "UnixFiles.File.Set: read failed" )
  519. ELSE n := 0
  520. END
  521. END;
  522. fpos := org + n; buf.size := n
  523. END;
  524. buf.org := org; buf.chg := FALSE
  525. ELSE
  526. org := buf.org
  527. END;
  528. r.hint := buf; r.apos := org; r.bpos := offset;
  529. r.res := 0; r.eof := FALSE;
  530. r.file := SELF; r.fs := fs
  531. END SetX;
  532. PROCEDURE Pos*( VAR r: Files.Rider ): LONGINT;
  533. BEGIN
  534. RETURN r.apos + r.bpos
  535. END Pos;
  536. PROCEDURE Read*( VAR r: Files.Rider; VAR x: CHAR );
  537. VAR offset: LONGINT; buf: Buffer;
  538. BEGIN {EXCLUSIVE}
  539. buf := r.hint(Buffer); offset := r.bpos;
  540. IF r.apos # buf.org THEN
  541. SetX( r, r.apos + offset );
  542. buf := r.hint(Buffer); offset := r.bpos
  543. END;
  544. IF (offset < buf.size) THEN
  545. x := buf.data[offset]; r.bpos := offset + 1
  546. ELSIF r.apos + offset < fsize THEN
  547. SetX( r, r.apos + offset );
  548. x := r.hint(Buffer).data[0]; r.bpos := 1
  549. ELSE
  550. x := 0X; r.eof := TRUE
  551. END
  552. END Read;
  553. PROCEDURE ReadBytes*( VAR r: Files.Rider; VAR x: ARRAY OF CHAR; ofs, len: LONGINT );
  554. VAR xpos, min, restInBuf, offset: LONGINT; buf: Buffer;
  555. BEGIN {EXCLUSIVE}
  556. x[ofs] := 0X; xpos := ofs;
  557. buf := r.hint(Buffer); offset := r.bpos;
  558. WHILE len > 0 DO
  559. IF (r.apos # buf.org) OR (offset >= Bufsize) THEN
  560. SetX( r, r.apos + offset );
  561. buf := r.hint(Buffer); offset := r.bpos
  562. END;
  563. restInBuf := buf.size - offset;
  564. IF restInBuf = 0 THEN r.res := len; r.eof := TRUE; RETURN
  565. ELSIF len > restInBuf THEN min := restInBuf
  566. ELSE min := len
  567. END;
  568. S.MOVE( ADDRESSOF( buf.data ) + offset, ADDRESSOF( x ) + xpos, min );
  569. INC( offset, min ); r.bpos := offset;
  570. INC( xpos, min ); DEC( len, min )
  571. END;
  572. r.res := 0; r.eof := FALSE;
  573. END ReadBytes;
  574. PROCEDURE Write*( VAR r: Files.Rider; x: CHAR );
  575. VAR buf: Buffer; offset: LONGINT;
  576. BEGIN {EXCLUSIVE}
  577. buf := r.hint(Buffer); offset := r.bpos;
  578. IF (r.apos # buf.org) OR (offset >= Bufsize) THEN
  579. SetX( r, r.apos + offset );
  580. buf := r.hint(Buffer); offset := r.bpos
  581. END;
  582. buf.data[offset] := x; buf.chg := TRUE;
  583. IF offset = buf.size THEN INC( buf.size ); INC( fsize ) END;
  584. r.bpos := offset + 1; r.res := Files.Ok
  585. END Write;
  586. PROCEDURE WriteBytes*( VAR r: Files.Rider; CONST x: ARRAY OF CHAR; ofs, len: LONGINT );
  587. VAR xpos, min, restInBuf, offset: LONGINT; buf: Buffer;
  588. BEGIN {EXCLUSIVE}
  589. xpos := ofs; buf := r.hint(Buffer); offset := r.bpos;
  590. WHILE len > 0 DO
  591. IF (r.apos # buf.org) OR (offset >= Bufsize) THEN
  592. SetX( r, r.apos + offset );
  593. buf := r.hint(Buffer); offset := r.bpos
  594. END;
  595. restInBuf := Bufsize - offset;
  596. IF len > restInBuf THEN min := restInBuf ELSE min := len END;
  597. S.MOVE( ADDRESSOF( x ) + xpos, ADDRESSOF( buf.data ) + offset, min );
  598. INC( offset, min ); r.bpos := offset;
  599. IF offset > buf.size THEN
  600. INC( fsize, offset - buf.size ); buf.size := offset
  601. END;
  602. INC( xpos, min ); DEC( len, min ); buf.chg := TRUE
  603. END;
  604. r.res := Files.Ok
  605. END WriteBytes;
  606. PROCEDURE Length*( ): LONGINT;
  607. BEGIN
  608. RETURN LONGINT(fsize)
  609. END Length;
  610. PROCEDURE GetDate*( VAR t, d: LONGINT );
  611. VAR stat: Unix.Status; r: LONGINT; time: Unix.TmPtr;
  612. BEGIN {EXCLUSIVE}
  613. IF fd = NoDesc THEN CreateUnixFile END;
  614. r := Unix.fstat( fd, stat );
  615. time := Unix.localtime( stat.mtime );
  616. t := time.sec + ASH( time.min, 6 ) + ASH( time.hour, 12 );
  617. d := time.mday + ASH( time.mon + 1, 5 ) + ASH( time.year, 9 );
  618. END GetDate;
  619. PROCEDURE SetDate*( t, d: LONGINT );
  620. TYPE
  621. Time = RECORD actime, modtime: LONGINT END;
  622. VAR
  623. tm: Unix.Tm; buf: Time; r: LONGINT; path: Filename;
  624. BEGIN {EXCLUSIVE}
  625. IF registerName # "" THEN COPY( registerName, path )
  626. ELSE COPY( workName, path )
  627. END;
  628. (* get year and timezone *)
  629. (* fill in new date *)
  630. tm.isdst := -1; tm.sec := t MOD 64; tm.min := t DIV 64 MOD 64;
  631. tm.hour := t DIV 4096 MOD 32;
  632. tm.mday := d MOD 32; tm.mon := d DIV 32 MOD 16 - 1; tm.year := d DIV 512;
  633. tm.wday := 0; tm.yday := 0;
  634. buf.actime := Unix.mktime( tm ); buf.modtime := buf.actime;
  635. r := Unix.utime( ADDRESSOF( path ), ADDRESSOF( buf ) );
  636. END SetDate;
  637. PROCEDURE GetAttributes*( ): SET;
  638. BEGIN {EXCLUSIVE}
  639. RETURN flags
  640. END GetAttributes;
  641. PROCEDURE SetAttributes*( attr: SET );
  642. BEGIN {EXCLUSIVE}
  643. (* flags := attr *)
  644. END SetAttributes;
  645. PROCEDURE Register0*( VAR res: LONGINT );
  646. VAR fo: LONGINT;
  647. BEGIN {EXCLUSIVE}
  648. IF (state = Create) & (registerName # "") THEN
  649. state := Closed (* shortcut renaming *) ;
  650. END;
  651. FlushBuffers;
  652. IF registerName # "" THEN
  653. fo := unixFS.TryRename( workName, registerName, SELF, res );
  654. IF res # Files.Ok THEN
  655. Halt( SELF, FALSE, "UnixFiles.File.Register: rename failed" )
  656. END;
  657. IF fo # NoDesc THEN (* SELF still refers to old file *)
  658. res := Unix.close(fd);
  659. res := Unix.unlink(ADDRESSOF(workName)); (* VirtualBox ! Can only delete file when closed. *)
  660. fd := Unix.open( ADDRESSOF( registerName ), Unix.rdwr, Unix.rwrwr );
  661. END;
  662. workName := registerName; registerName := ""; tempFile := FALSE;
  663. END;
  664. (*collection.Register(SELF);*)
  665. END Register0;
  666. PROCEDURE Update*;
  667. BEGIN {EXCLUSIVE}
  668. FlushBuffers
  669. END Update;
  670. PROCEDURE FlushBuffers;
  671. VAR i: LONGINT;
  672. BEGIN
  673. IF fd = NoDesc THEN CreateUnixFile END;
  674. FOR i := 0 TO NBufs - 1 DO
  675. IF bufs[i] # NIL THEN Flush( bufs[i] ) END
  676. END;
  677. END FlushBuffers;
  678. PROCEDURE Finalize*;
  679. VAR r: LONGINT;
  680. BEGIN {EXCLUSIVE}
  681. IF tempFile THEN
  682. IF fd # NoDesc THEN r := Unix.close(fd) END;
  683. r := Unix.unlink( ADDRESSOF( registerName ) );
  684. fd := NoDesc;
  685. ELSE
  686. FlushBuffers;
  687. IF fd # NoDesc THEN
  688. r := Unix.close( fd );
  689. fd := NoDesc;
  690. END;
  691. END;
  692. DEC( openfiles ); state := Closed;
  693. END Finalize;
  694. PROCEDURE Close;
  695. BEGIN
  696. Finalize;
  697. collection.oldFiles.Remove(SELF);
  698. END Close;
  699. PROCEDURE GetName*( VAR name: ARRAY OF CHAR );
  700. BEGIN {EXCLUSIVE}
  701. IF registerName = "" THEN COPY( workName, name ) ;
  702. ELSE COPY( registerName, name )
  703. END;
  704. CleanPath( name )
  705. END GetName;
  706. END File;
  707. (*===================================================================*)
  708. (** Get the current directory. *)
  709. PROCEDURE GetWorkingDirectory*( VAR path: ARRAY OF CHAR );
  710. BEGIN
  711. COPY( cwd, path )
  712. END GetWorkingDirectory;
  713. (** Change to directory path. *)
  714. PROCEDURE ChangeDirectory*( CONST path: ARRAY OF CHAR; VAR done: BOOLEAN );
  715. VAR r: LONGINT; newdir: Filename;
  716. BEGIN
  717. IF path[0] # '/' THEN
  718. COPY( cwd, newdir ); AppendName( newdir, path );
  719. CleanPath( newdir )
  720. ELSE
  721. COPY( path, newdir );
  722. END;
  723. r := Unix.chdir( ADDRESSOF( newdir ) );
  724. IF r = 0 THEN COPY( newdir, cwd ); done := TRUE ELSE done := FALSE END
  725. END ChangeDirectory;
  726. (*===================================================================*)
  727. PROCEDURE StripPath*( CONST path: ARRAY OF CHAR; VAR name: ARRAY OF CHAR );
  728. VAR i, p: INTEGER; c: CHAR;
  729. BEGIN
  730. i := 0; p := 0;
  731. REPEAT
  732. IF path[i] = '/' THEN p := i + 1 END;
  733. INC( i )
  734. UNTIL path[i] = 0X;
  735. i := 0;
  736. REPEAT c := path[p]; name[i] := c; INC( i ); INC( p ) UNTIL c = 0X
  737. END StripPath;
  738. PROCEDURE CleanPath*( VAR path: ARRAY OF CHAR );
  739. (*
  740. /aaa/../bbb/./ccc/../ddd/. ==> /bbb/ddd
  741. ../aaa ==> CWD/../aaa ==> . . .
  742. *)
  743. VAR
  744. i, prevNameStart, nameStart: INTEGER;
  745. c1, c2, c3: CHAR;
  746. PROCEDURE prependCWD;
  747. VAR tmp: ARRAY 256 OF CHAR;
  748. BEGIN
  749. COPY( cwd, tmp ); AppendName( tmp, path ); COPY( tmp, path )
  750. END prependCWD;
  751. PROCEDURE restart;
  752. BEGIN
  753. IF path[0] = '/' THEN nameStart := 1 ELSE nameStart := 0 END;
  754. i := -1; prevNameStart := -1;
  755. END restart;
  756. PROCEDURE shift( p0, p1: INTEGER );
  757. VAR c: CHAR;
  758. BEGIN
  759. REPEAT c := path[p1]; path[p0] := c; INC( p0 ); INC( p1 ) UNTIL c = 0X;
  760. IF p0 > 1 THEN restart ELSE i := 0 END
  761. END shift;
  762. BEGIN
  763. restart;
  764. REPEAT
  765. INC( i );
  766. IF i = nameStart THEN
  767. c1 := path[i]; c2 := path[i + 1]; c3 := path[i + 2];
  768. IF c1 = '/' THEN shift( i, i + 1 ) (* // *)
  769. ELSIF c1 = '.' THEN
  770. IF c2 = 0X THEN
  771. IF i > 1 THEN DEC( i ) END;
  772. path[i] := 0X
  773. ELSIF c2 = '/' THEN shift( i, i + 2 ); (* ./ *)
  774. ELSIF (c2 = '.') & ((c3 = 0X) OR (c3 = '/')) THEN (* .. *)
  775. IF i = 0 THEN prependCWD; restart
  776. ELSIF c3 = 0X THEN DEC( i ); path[i] := 0X
  777. ELSIF c3 = '/' THEN (* ../ *)
  778. IF prevNameStart >= 0 THEN shift( prevNameStart, i + 3 ) END
  779. END
  780. END
  781. END
  782. ELSIF path[i] = '/' THEN
  783. IF i > 0 THEN prevNameStart := nameStart END;
  784. nameStart := i + 1
  785. END;
  786. UNTIL (i >= 0) & (path[i] = 0X);
  787. IF (i > 1) & (path[i - 1] = '/') THEN path[i - 1] := 0X END;
  788. IF path = "" THEN path := "." END;
  789. END CleanPath;
  790. PROCEDURE Match( CONST name, pat: ARRAY OF CHAR; i, j: INTEGER ): BOOLEAN;
  791. BEGIN
  792. IF (name[i] = 0X) & (pat[j] = 0X) THEN RETURN TRUE
  793. ELSIF pat[j] # "*" THEN RETURN (name[i] = pat[j]) & Match( name, pat, i + 1, j + 1 )
  794. ELSE (* pat[j] = "*", name[i] may be 0X *)
  795. RETURN Match( name, pat, i, j + 1 ) OR ((name[i] # 0X) & Match( name, pat, i + 1, j ))
  796. END
  797. END Match;
  798. PROCEDURE Append( VAR a: Filename; CONST this: ARRAY OF CHAR );
  799. VAR i, j: LONGINT;
  800. BEGIN
  801. i := 0; j := 0;
  802. WHILE a[i] # 0X DO INC( i ) END;
  803. WHILE (i < LEN( a ) - 1) & (this[j] # 0X) DO a[i] := this[j]; INC( i ); INC( j ) END;
  804. a[i] := 0X
  805. END Append;
  806. PROCEDURE AppendName( VAR path: Filename; CONST filename: ARRAY OF CHAR );
  807. VAR i, j, max: LONGINT;
  808. BEGIN
  809. i := 0; j := 0; max := LEN( path ) - 1;
  810. WHILE path[i] # 0X DO INC( i ) END;
  811. IF (i > 0) & (path[i - 1] # "/") THEN path[i] := "/"; INC( i ); path[i] := 0X END;
  812. Append( path, filename );
  813. END AppendName;
  814. PROCEDURE AppendInt( VAR str: Filename; n: LONGINT );
  815. VAR i: LONGINT;
  816. BEGIN
  817. i := 0;
  818. WHILE str[i] # 0X DO INC(i) END;
  819. WHILE n > 0 DO str[i] := CHR( n MOD 10 + ORD('0') ); n := n DIV 10; INC(i) END;
  820. str[i] := 0X
  821. END AppendInt;
  822. PROCEDURE IsFullName( CONST name: ARRAY OF CHAR ): BOOLEAN;
  823. VAR i: INTEGER; ch: CHAR;
  824. BEGIN
  825. i := 0; ch := name[0];
  826. WHILE (ch # 0X) & (ch # "/") DO INC( i ); ch := name[i] END;
  827. RETURN ch = "/"
  828. END IsFullName;
  829. PROCEDURE Halt( f: File; unixError: BOOLEAN; CONST msg: ARRAY OF CHAR );
  830. VAR fd, errno: LONGINT;
  831. workName, registerName: Filename;
  832. BEGIN
  833. IF f = NIL THEN
  834. workName := "???"; registerName := "???"
  835. ELSE
  836. workName := f.workName; registerName := f.registerName; fd := f.fd
  837. END;
  838. IF unixError THEN errno := Unix.errno( ); Unix.Perror( msg ) END;
  839. HALT( 99 )
  840. END Halt;
  841. (*
  842. PROCEDURE RegisterFinalizer( obj: ANY; fin: Heaps.Finalizer );
  843. VAR n: Heaps.FinalizerNode;
  844. BEGIN
  845. NEW( n ); n.finalizer := fin; Heaps.AddFinalizer( obj, n );
  846. END RegisterFinalizer;
  847. *)
  848. (*
  849. PROCEDURE GC;
  850. BEGIN
  851. Kernel.GC;
  852. AwaitFinalizingDone
  853. END GC;
  854. PROCEDURE AwaitFinalizingDone;
  855. BEGIN
  856. (* wait until finalizers have finished! (Cleanup)*)
  857. WHILE Machine.GCacquired DO Objects.Sleep( 10 ) END
  858. END AwaitFinalizingDone;
  859. *)
  860. PROCEDURE ResetBuffers( f: File; VAR stat: Unix.Status );
  861. VAR i: INTEGER;
  862. BEGIN
  863. f.fsize := stat.size;
  864. IF (f.mtime # stat.mtime.sec) THEN
  865. FOR i := 0 TO NBufs - 1 DO
  866. IF f.bufs[i] # NIL THEN f.bufs[i].org := -1; f.bufs[i] := NIL END;
  867. END;
  868. f.swapper := -1; f.mtime := stat.mtime.sec
  869. END
  870. END ResetBuffers;
  871. (*
  872. PROCEDURE FindCachedEntry( VAR stat: Unix.Status ): File;
  873. VAR f: File; i: INTEGER;
  874. BEGIN
  875. FOR i := 0 TO FileTabSize - 1 DO
  876. f := fileTab[i].f;
  877. IF (f # NIL ) & (stat.ino = f.ino) & (stat.dev = f.dev) THEN
  878. (* possible different name but same file! *)
  879. ResetBuffers( f, stat );
  880. RETURN f
  881. END;
  882. END;
  883. RETURN NIL
  884. END FindCachedEntry;
  885. *)
  886. PROCEDURE MakePath( CONST dir, name: ARRAY OF CHAR; VAR dest: ARRAY OF CHAR );
  887. VAR i, j: INTEGER;
  888. BEGIN
  889. i := 0; j := 0;
  890. WHILE dir[i] # 0X DO dest[i] := dir[i]; INC( i ) END;
  891. IF (i>0) & (dest[i - 1] # "/") THEN dest[i] := "/"; INC( i ) END;
  892. WHILE name[j] # 0X DO dest[i] := name[j]; INC( i ); INC( j ) END;
  893. dest[i] := 0X
  894. END MakePath;
  895. PROCEDURE ScanPath( VAR pos: LONGINT; VAR dir: ARRAY OF CHAR );
  896. VAR i: LONGINT; ch: CHAR;
  897. BEGIN
  898. i := 0; ch := searchPath[pos];
  899. WHILE ch = " " DO INC( pos ); ch := searchPath[pos] END;
  900. WHILE ch > " " DO dir[i] := ch; INC( i ); INC( pos ); ch := searchPath[pos] END;
  901. dir[i] := 0X
  902. END ScanPath;
  903. PROCEDURE GetTempName( CONST finalName: ARRAY OF CHAR; VAR tempName: Filename );
  904. VAR n, i, j, pe, pid: LONGINT;
  905. BEGIN
  906. INC(tempno); n := tempno; i := 0; j := 0; pe := 1;
  907. WHILE finalName[j] = ' ' DO INC(j) END; (* skip leading spaces *)
  908. IF finalName[j] # "/" THEN (* relative pathname *)
  909. WHILE cwd[i] # 0X DO tempName[i] := cwd[i]; INC(i) END;
  910. IF tempName[i - 1] # '/' THEN tempName[i] := '/'; INC(i) END;
  911. pe := i - 1
  912. END;
  913. WHILE finalName[j] # 0X DO tempName[i] := finalName[j]; INC(i); INC(j) END;
  914. WHILE (i > pe) & (tempName[i-1] # '/') DO DEC(i) END; (* remove filename *)
  915. tempName[i] := 0X;
  916. Append( tempName, ".tmp." );
  917. AppendInt( tempName, n ); Append( tempName, "." );
  918. pid := Unix.getpid();
  919. AppendInt( tempName, pid )
  920. END GetTempName;
  921. (*
  922. PROCEDURE CloseFiles;
  923. VAR i: LONGINT; f: File;
  924. BEGIN
  925. i := 0;
  926. WHILE i < FileTabSize DO
  927. f := fileTab[i].f;
  928. IF f # NIL THEN f.Close END;
  929. INC( i )
  930. END;
  931. END CloseFiles;
  932. *)
  933. PROCEDURE Install;
  934. VAR aliasFS: AliasFileSystem;
  935. BEGIN
  936. NEW(collection);
  937. NEW( unixFS ); (* Files.Add( unixFS, "" ); *)
  938. NEW( aliasFS, unixFS ); Files.Add( aliasFS, "searcher" )
  939. END Install;
  940. PROCEDURE Initialize;
  941. VAR a: ADDRESS; i: INTEGER; ch: CHAR;
  942. BEGIN
  943. (* get current working directory *)
  944. a := Unix.getenv( ADDRESSOF( "PWD" ) );
  945. IF a > 0 THEN
  946. i := 0;
  947. REPEAT S.GET( a, ch ); INC( a ); cwd[i] := ch; INC( i ) UNTIL ch = 0X;
  948. ELSE
  949. (* $PWD not set *)
  950. a := Unix.getcwd( ADDRESSOF( cwd ), LEN( cwd ) )
  951. END;
  952. i := 0;
  953. WHILE cwd[i] # 0X DO INC( i ) END;
  954. DEC( i );
  955. IF (i > 0) & (cwd[i] = '/') THEN cwd[i] := 0X END;
  956. (* get search pathes *)
  957. a := Unix.getenv( ADDRESSOF( "AOSPATH" ) ); i := 0;
  958. IF a = 0 THEN
  959. Log.String( "UnixFiles.Initialize: environment variable AOSPATH not defined" ); Log.Ln;
  960. (* Unix.exit( 1 ) *)
  961. ELSE
  962. REPEAT
  963. S.GET( a, ch ); INC( a );
  964. IF ch = ":" THEN ch := " " END;
  965. searchPath[i] := ch; INC( i )
  966. UNTIL ch = 0X;
  967. END;
  968. i := 0;
  969. (*
  970. WHILE i < DO fileTab[i].f := NIL; INC( i ) END;
  971. *)
  972. tempno := 1; openfiles := 0;
  973. Modules.InstallTermHandler( Finalization )
  974. END Initialize;
  975. PROCEDURE Finalization;
  976. VAR ft: Files.FileSystemTable; i: LONGINT;
  977. BEGIN
  978. Files.GetList( ft );
  979. IF ft # NIL THEN
  980. FOR i := 0 TO LEN( ft^ ) - 1 DO
  981. IF ft[i] IS AliasFileSystem THEN Files.Remove( ft[i] ) END
  982. END
  983. END;
  984. collection.Finalize;
  985. unixFS.Finalize;
  986. END Finalization;
  987. BEGIN
  988. Initialize;
  989. Install
  990. END UnixFiles.