Lines Matching +full:interrupt +full:- +full:less

62 translating path names to inodes\u\s-21\s0\d\**.
64 \** \u\s-21\s0\d Inode is an abbreviation for ``Index node''.
101 cache we ran ``ls \-l''
103 Before the per-process cache this command
129 Table 9. Call times for \fInamei\fP with per-process cache.
161 maintained a simple name-inode association that was used to
194 by a \fIcapability\fP \- a 32-bit number
195 guaranteed to be unique\u\s-22\s0\d \**.
197 \** \u\s-22\s0\d When all the numbers have been exhausted, all outstanding
220 using 10-50 kilobytes of physical memory.
223 After adding the system wide name cache we reran ``ls \-l''
262 The name cache has a hit rate of 70%-80%;
263 the directory offset cache gets a hit rate of 5%-15%.
267 dropped from 25% to less than 13%.
274 This is because less total time is being spent in the kernel,
280 it can either generate an interrupt each time a character is received,
285 an input rate of less than 30 characters per second.
287 they are most efficiently handled with interrupt per character mode,
289 of the terminal multiplexors at each clock interrupt.
295 as a separate interrupt.
301 per-character interrupts.
303 interrupt basis, avoiding the overhead
304 of checking each interface on each clock interrupt.
307 This timer runs less frequently than the clock interrupts,
309 The transition from using silos to an interrupt per character is
318 the clock interrupt routine is no longer required to schedule
319 a software interrupt after each hardware interrupt to drain the silos.
320 The software-interrupt level portion of the clock routine is only
332 The kernel process table is now multi-threaded to allow selective searching
382 As most of the clock-based events need not be done at high priority,
383 the system schedules a lower priority software interrupt to do the less
384 time-critical events such as cpu scheduling and timeout processing.
385 Often there are no such events, and the software interrupt handler
389 if there is nothing to do, the software interrupt is not requested.
390 Often, the high priority interrupt occurs during a period when the
392 Rather than posting a software interrupt that would occur as
394 the hardware clock interrupt handler simply lowers the processor priority
404 To minimize the number of full-sized blocks that must be broken
406 Programs that slowly grow files using write of 1024 bytes or less
424 a directory that is once over-filled will increase the cost
425 of file creation even after the over-filling is corrected.
443 and interface in use; non-local connections use a more conservative size
444 for long-haul networks.
446 On multiply-homed hosts, the local address bound by TCP now always corresponds
468 Multiple messages send with the same destination now require less processing.
478 When \fIexec\fP-ing a new process, the kernel creates the new
507 context in preparation for a non-local goto used to save many more
537 if (scanc(map[i], 1, 47, i - 63))
555 subl3	$64,_i,\-(sp)	subl3	$64,_i,\-(sp)	subl3	$64,_i,r5
559 pushl	\-56(fp)[r3]	pushl	\-56(fp)[r3]	movl	\-56(fp)[r3],r2
610 the C-shell (in doing tilde expansion), \fIls \-l\fP, etc.
617 appropriately-sized buffers.
620 Some C library routines and commonly-used programs use low-level
632 The inordinate expense of sending single-byte packets through
686 efficient because it is all done with in-memory tables.
733 and inline expansions of the ubiquitous byte-swapping functions.
744 The C Run-time Library
750 The memory allocation routines have been tuned to waste less
752 Certain library routines that did file input in one-character reads
759 The C-shell was converted to run on 4.2BSD by
761 While this provided a functioning C-shell,
764 The C-shell has been modified to use the new signal