Lines Matching full:file

13 The size of an ordinary file is determined
15 no predetermination of the size of a file is necessary
29 To read or write a file assumed to exist already, it must
36 indicates the name of the file.
40 argument indicates whether the file is to be read, written,
46 .IT "file descriptor" .
47 It is a small integer used to identify the file
49 or otherwise manipulate the file.
51 To create a new file or completely rewrite an old one,
55 creates the given file if it does not exist,
59 also opens the new file for writing
62 returns a file descriptor.
64 The file system maintains no locks visible to the user, nor is there any
65 restriction on the number of users who may have a file
67 Although it is possible for the contents of a file
72 to prevent interference between users of the same file.
74 faced with large, single-file data bases
78 one user is prevented from writing on a file that another
82 a file with an editor that makes
83 a copy of the file being edited.
87 the logical consistency of the file system
90 the same file,
97 byte in the file was the last byte written (or read),
100 For each open file there is a pointer, maintained
111 Once a file is open, the following calls
119 bytes are transmitted between the file specified
143 file that reading
148 file;
156 to zero, the end of the file has been reached.
159 size of the file.
160 It is possible to generate an end-of-file
164 Bytes written affect only those parts of a file implied by
166 count; no other part of the file
168 If the last byte lies beyond the end of the file, the
169 file is made to grow as needed.
173 to the appropriate location in the file.
182 bytes from the beginning of the file, from the current position
183 of the pointer, or from the end of the file,
192 The actual offset from the beginning of the file
198 having to do with I/O and with the file
201 close a file,
202 get the status of a file,
204 of a file,
206 make a link to an existing file,
207 delete a file.
209 IV. IMPLEMENTATION OF THE FILE SYSTEM
212 only a name for the associated file and a pointer to the
213 file itself.
217 of the file.
218 When the file is accessed,
225 The entry found thereby (the file's
228 the description of the file:
234 the physical disk or tape addresses for the file contents
240 the number of links to the file, that is, the number of times it appears in a directory
242 a code indicating whether the file is a directory, an ordinary file, or a special file.
251 Once a file is open,
253 indexed by the file descriptor returned by the
259 file,
261 may be easily related to the information necessary to access the file.
263 When a new file is created,
265 that contains the name of the file and the i-node
267 Making a link to an existing file involves
269 copying the i-number from the original file entry,
271 Removing (deleting) a file is done by
276 any disk blocks in the file
280 contain a file system is divided into a number of
284 There is space in the i-node of each file for 13 device addresses.
287 10 blocks of the file.
288 If the file is larger than 10 blocks,
291 of additional blocks in the file.
297 pointing to 128 blocks of the file.
312 largest file
322 When an I/O request is made to a file whose i-node indicates that it
344 ordinary file specified
348 device name of the indicated special file.
371 of I/O operations required to access a file.
394 sequential blocks of a file,
413 In practice, this method of organizing the file system
416 the fact that each file has a short, unambiguous name
418 and other information needed to access the file.
420 algorithm for checking the consistency of a file system,
429 peculiarities not found in other file system organizations.
431 for the space a file occupies,
432 because all directory entries for a file have equal status.
433 Charging the owner of a file is unfair in general,
434 for one user may create a file, another may link to
435 it, and the first user may delete the file.
437 file, but it should be charged
441 equally among users who have links to a file.