Lines Matching refs:it
28 @c On HURD, this calls task_info 3 times. On UNIX, it's a syscall.
54 the function @code{wait4}, which returns totals for a child when it
131 process tries to exceed a limit, it may get a signal, or the system call
132 by which it tried to do so may fail, depending on the resource. Each
133 process initially inherits its limit values from its parent, but it can
150 there is no way for a process to get around it. A process may lower
182 a pointer to a variable of type @code{struct rlimit64}, which allows it
222 a pointer to a variable of type @code{struct rlimit64} which allows it
245 For @code{getrlimit}, the structure is an output; it receives the current
246 values. For @code{setrlimit}, it specifies the new values.
272 The maximum amount of CPU time the process can use. If it runs for
273 longer than this, it gets a signal: @code{SIGXCPU}. The value is
291 its stack past this size, it gets a @code{SIGSEGV} signal.
311 it will never be paged out).
322 The maximum number of files that the process can open. If it tries to
445 get it. This section describes how that determination is made and
446 @glibcadj{} functions to control it.
452 cases, it is not even particularly important. Giving a process a high
457 CPU scheduling is a complex issue and different systems do it in wildly
492 Every process has an absolute priority, and it is represented by a number.
499 accommodate realtime systems, in which it is vital that certain processes
507 one with the higher absolute priority always gets it. This is true even if the
518 absolute priority, it's more interesting. In that case, who gets the
530 change it.
569 than any other process in the system and due to a bug in its program, it
571 a command to kill it because your command would need to get the CPU in
573 the vertical, it controls the horizontal.
585 and lowers it when the process is exceeding it.
588 priority.'' We don't use that term in this manual because it misses the
626 longest to run gets the CPU, and it keeps it until it voluntarily
644 a process gets pushed onto the tail when it becomes ready to run and is
645 popped off the head when the scheduler decides to run it. Note that
648 longer in the ready to run list. When the process stops running, it
655 back to being ready to run, which means it enters the queue at the tail.
662 Functions described in @ref{Basic Scheduling Functions} can change it.
734 @c but it puts it at the head of the run queue, so I'm not sure just what
735 @c the effect is, but it must be subtle.
737 On success, the return value is @code{0}. Otherwise, it is @code{-1}
746 @var{policy} is not @code{SCHED_OTHER} (or it's negative and the
799 There is no task with pid @var{pid} and it is not zero.
824 @c in fact, that's how it's implemented in Linux.
841 On success, the return value is @code{0}. Otherwise, it is @code{-1}
848 There is no task with ID @var{pid} and it is not zero.
866 On Linux, it is 0 for SCHED_OTHER and 1 for everything else.
868 On success, the return value is @code{0}. Otherwise, it is @code{-1}
887 On Linux, it is 0 for SCHED_OTHER and 99 for everything else.
889 On success, the return value is @code{0}. Otherwise, it is @code{-1}
906 the Round Robin scheduling policy, if it is used, for the task with
912 @c reorganized so there is a place to put it (which will be right next
919 that it fails, the return value is @code{-1} and @code{errno} is set
933 immediately ready to run (as opposed to running, which is what it was
934 before). This means that if it has absolute priority higher than 0, it
936 absolute priority and are ready to run, and it will run again when its
937 turn next arrives. If its absolute priority is 0, it is more
945 processes in the system are doing and how fast it executes, this
949 that it fails, the return value is @code{-1} and @code{errno} is set
976 needs of realtime processing, it left the indigenous Absolute Priority
989 absolute priority 0 does not run. If it's already running when the
990 higher priority ready-to-run process comes into existence, it stops
994 priority, which we will refer to as "dynamic priority" because it changes
999 CPU. Sometimes it determines how long turns last. Sometimes it
1002 In Linux, the value is a combination of these things, but mostly it
1004 dynamic priority, the longer a shot it gets on the CPU when it gets one.
1005 If it doesn't use up its time slice before giving up the CPU to do
1006 something like wait for I/O, it is favored for getting the CPU back when
1007 it's ready for it, to finish out its time slice. Other than that,
1010 process' dynamic priority rises every time it is snubbed in the
1041 can raise it at will. A process can also raise the nice value of any
1060 The range of valid nice values depends on the kernel, but typically it
1085 On success, the return value is @code{0}. Otherwise, it is @code{-1}
1098 If the return value is @code{-1}, it could indicate failure, or it could
1157 If the argument @var{id} is 0, it stands for the calling process, its
1247 it is important to never exceed the size of the bitset. The following
1279 The @var{cpu} parameter must not have side effects since it is
1294 The @var{cpu} parameter must not have side effects since it is
1310 The @var{cpu} parameter must not have side effects since it is
1332 the or the function fails for some other reason, it returns @code{-1}
1346 Note that it is not portably possible to use this information to
1361 If the function fails it will return @code{-1} and @code{errno} is set
1404 The amount of memory available in the system and the way it is organized
1406 functions like @code{mmap} it is necessary to know about the size of
1436 but then it is wanted and controlled).
1444 memory. This concept makes it necessary that programs which have to use
1458 stores memory content externally it cannot do this on a byte-by-byte
1471 information adjusted to the page size. In the case of @code{mmap} it is
1475 chunks which are then subdivided by the application code it is useful to
1479 since it only has to allocate memory pages which are fully used. (To do
1480 this optimization it is necessary to know a bit about the memory
1488 runtime about the current page size and no assumptions (except about it
1544 @c This fopens a /proc file and scans it for the requested information.
1580 But it might be possible for the operating system to disable individual
1618 Before starting more threads it should be checked whether the processors
1628 @c it, closes it, without cancellation point, and calls strtod_l with