Lines Matching +full:- +full:single +full:- +full:end

74 faced with large, single-file data bases
142 If the read pointer is so near the end of the
146 would cause reading beyond the end, only sufficient
147 bytes are transmitted to reach the end of the
149 also, typewriter-like terminals
156 to zero, the end of the file has been reached.
160 It is possible to generate an end-of-file
168 If the last byte lies beyond the end of the file, the
171 To do random (direct-access) I/O
183 of the pointer, or from the end of the file,
215 .IT i-number
219 its i-number is used as an index into
221 .IT i-list \|)
226 .IT i-node \|)
230 the user and group-\*sID\*n of its owner
249 into an i-number
252 its device, i-number, and read/write pointer are stored in a system table
264 an i-node is allocated for it and a directory entry is made
265 that contains the name of the file and the i-node
269 copying the i-number from the original file entry,
270 and incrementing the link-count field of the i-node.
273 link-count of the i-node specified by its directory entry
275 If the link-count drops to 0,
277 are freed and the i-node is de-allocated.
281 512-byte
284 There is space in the i-node of each file for 13 device addresses.
293 of the i-node to point to
294 a double-indirect block naming
300 a triple-indirect block.
304 bytes numbered below 5120 can be read with a single
322 When an I/O request is made to a file whose i-node indicates that it
343 argument is the i-number and device name of the
349 This table is searched for each i-number/device pair
356 the i-number is replaced by the i-number of the root
375 of a single byte.
386 Conversely, if a single byte is read, the system determines
396 pre-reads the next block.
404 a single byte at a time, but the gain is not immense;
410 The notion of the i-list is an unusual feature
427 the linearly organized i-list.
428 At the same time the notion of the i-list induces certain