Lines Matching full:there

148 there is a distinct switch of environments.
162 There is no
169 that there is no need to swap read-only
188 only comes into play when there is
191 when there is enough memory
221 there are no I/O buffers in the
253 there is a process table with
294 There is no detectable sharing of primary memory between the two processes.
395 If there is not enough primary memory,
425 Thus there are two specific algorithms
432 There is a slight penalty for larger processes.
492 Thus there need be no allocation of events
497 because there is no memory associated with events,
519 This race condition happens because there is no memory associated with
529 then there is no problem.
615 there is an array of entry points into the device drivers.
681 There are,
695 it is almost certain that there is a
699 There is a system primitive to
708 This means that there are times
737 There are guidelines and conventions
793 soon as there is anything on the queue
796 Each time there is a completion interrupt,
814 There are two input queues (raw and canonical)
819 The main difference is that there is also code
843 there are devices that fit no general category.
923 blocks and there is strict accounting of
925 there is no need to compact or garbage collect.
990 there are 25,000 files containing 130M bytes of data-file content.
1067 there is room for some (usually between 10 and 50) open files.
1152 There is a type of unnamed
1166 There are also checks and synchronization
1215 There are some other things that the system
1224 There are some features that are missed in some