2
0

Generic.Unix.UnixFiles.Mod 35 KB

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