| /glibc-2.36/rt/ |
| D | tst-timer4.c | 49 struct itimerspec it = { }; in thr1() local
50 thr1_err |= timer_settime (timer_thr1, 0, &it, NULL); in thr1()
95 struct itimerspec it = { }; in thr2() local
96 thr2_err |= timer_settime (timer_thr2, 0, &it, NULL); in thr2()
120 struct itimerspec it = { }; in sig1_handler() local
121 if (timer_settime (timer_sig1, 0, &it, NULL)) in sig1_handler()
144 struct itimerspec it = { }; in sig2_handler() local
145 if (timer_settime (timer_sig2, 0, &it, NULL)) in sig2_handler()
290 struct itimerspec it; in do_test() local
291 it.it_value.tv_sec = 0; in do_test()
[all …]
|
| /glibc-2.36/time/ |
| D | tst-itimer.c | 49 struct itimerval it, it_old; in do_test() local
53 TEST_COMPARE (getitimer (timers[i], &it), 0); in do_test()
56 TEST_COMPARE (it.it_interval.tv_sec, 0); in do_test()
57 TEST_COMPARE (it.it_interval.tv_usec, 0); in do_test()
58 TEST_COMPARE (it.it_value.tv_sec, 0); in do_test()
59 TEST_COMPARE (it.it_value.tv_usec, 0); in do_test()
61 it.it_interval.tv_sec = 10; in do_test()
62 it.it_interval.tv_usec = 20; in do_test()
63 TEST_COMPARE (setitimer (timers[i], &it, NULL), 0); in do_test()
84 it.it_interval.tv_sec = 10; in do_test()
[all …]
|
| /glibc-2.36/sysdeps/pthread/ |
| D | tst-cancel19.c | 121 struct itimerval it; in do_test() local
122 it.it_value.tv_sec = 1; in do_test()
123 it.it_value.tv_usec = 0; in do_test()
124 it.it_interval = it.it_value; in do_test()
125 setitimer (ITIMER_REAL, &it, NULL); in do_test()
130 memset (&it, 0, sizeof (it)); in do_test()
131 setitimer (ITIMER_REAL, &it, NULL); in do_test()
146 it.it_value.tv_sec = 1; in do_test()
147 it.it_value.tv_usec = 0; in do_test()
148 it.it_interval = it.it_value; in do_test()
[all …]
|
| /glibc-2.36/posix/ |
| D | tst-vfork2.c | 65 struct itimerval it; in do_test() local
66 it.it_value.tv_sec = 0; in do_test()
67 it.it_value.tv_usec = 200 * 1000; in do_test()
68 it.it_interval = it.it_value; in do_test()
69 if (setitimer (ITIMER_REAL, &it, NULL) < 0) in do_test()
93 memset (&it, 0, sizeof (it)); in do_test()
94 setitimer (ITIMER_REAL, &it, NULL); in do_test()
|
| /glibc-2.36/string/ |
| D | tester.c | 57 const char *it = "<UNSET>"; /* Routine name for message routines. */ variable
66 printf ("%s flunked test %d\n", it, number); in check()
85 it = "strcmp"; in test_strcmp()
148 it = "strcpy"; in test_strcpy()
200 it = "stpcpy"; in test_stpcpy()
282 it = "stpncpy"; in test_stpncpy()
297 it = "strcat"; in test_strcat()
371 it = "strncat"; in test_strncat()
459 it = "strncmp"; in test_strncmp()
481 it = "strncpy"; in test_strncpy()
[all …]
|
| /glibc-2.36/manual/examples/ |
| D | swapcontext.c | 76 struct itimerval it; in main() local
84 it.it_interval.tv_sec = 0; in main()
85 it.it_interval.tv_usec = 1; in main()
86 it.it_value = it.it_interval; in main()
90 || setitimer (ITIMER_PROF, &it, NULL) < 0 in main()
|
| /glibc-2.36/manual/ |
| D | crypt.texi | 30 Sometimes it is necessary to be sure that a user is authorized
52 only discover the passphrase it corresponds to by guessing and
62 especially weak, because it ignores all but the first eight characters
78 string that it returns will consist entirely of printable ASCII
83 it also ensures that the output of the one-way function is different
84 for every user, even if they have the same passphrase. This makes it
86 the attacker could make a guess, run @code{crypt} on it once, and
146 string it returns. It is not safe to call @code{crypt} from multiple
147 threads simultaneously, and the string it returns will be overwritten
166 Instead of static storage, it uses the memory pointed to by its
[all …]
|
| D | resource.texi | 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.
[all …]
|
| D | sysinfo.texi | 2 @c %MENU% Controlling the system and getting information about it
7 for getting information about it. Anyone can generally use the
31 Every Unix system (also known as a host) has a host name, whether it's
33 computer networks were an issue, it's just a word like @samp{chicken}.
36 But any system attached to the Internet or any network like it conforms
73 Confusing things even more is the fact that in the DNS, it is possible for
75 exactly one of them that is the true host name, and it is called the
95 This function returns the host name of the system on which it is called,
113 But you can't count on this to exist, so it is cleaner to handle
118 truncated host name is good enough. If it is, you can ignore the
[all …]
|
| D | getopt.texi | 26 error message to the standard error stream if it encounters an unknown
29 does not print any messages, but it still returns the character @code{?}
36 with a missing required argument, it stores that option character in
63 @c issue. Given print_errors, it may output errors to stderr, which may
84 string can be followed by a colon (@samp{:}) to indicate that it takes a
94 The default is to permute the contents of @var{argv} while scanning it
112 command line option. When no more option arguments are available, it
118 storing it in the variable @var{optarg}. You don't ordinarily need to
119 copy the @code{optarg} string, since it is a pointer into the original
123 included in @var{options}, or a missing option argument, it returns
[all …]
|
| D | lgpl-2.1.texi | 12 of this license document, but changing it is not allowed.
22 freedom to share and change it. By contrast, the GNU General Public
28 Software Foundation and other authors who decide to use it. You can use
29 it too, but we suggest you first think carefully about whether this
37 it if you want it; that you can change the software and use pieces of it
44 you if you distribute copies of the library or if you modify it.
52 it. And you must show them these terms so they know their rights.
58 To protect each distributor, we want to make it very clear that
87 We call this license the @dfn{Lesser} General Public License because it
96 encourage the widest possible use of a certain library, so that it becomes
[all …]
|
| D | freemanuals.texi | 8 the software---it is the lack of good free documentation that we can
22 That wasn't the first time this sort of thing happened, and it was far
26 contract to make it non-free.
59 However, it must be possible to modify all the @emph{technical}
62 obstruct the use of the manual, it is not free, and we need another
63 manual to replace it.
69 realize, before it is too late, that only free manuals contribute to
72 If you are writing documentation, please insist on publishing it under
77 option; it is up to you to raise the issue and say firmly that this is
86 at all. Check the distribution terms of a manual before you buy it,
[all …]
|
| D | syslog.texi | 31 connection it gets. The kernel might report hardware failures on a disk
35 attention immediately. And it may not be just any system administrator
68 Syslog as any other process would (and it properly identifies them as
75 Klogd then passes everything in the message ring to it.
78 that submits a message to it to provide two pieces of classification
79 information with it:
88 more meaning than the system administrator gives to it.
111 do it by writing to the @file{/dev/log} socket. @xref{Submitting Syslog
166 to identify the source of the message, and people conventionally set it
210 on @var{option}. If it does, it tries to open it and connect it as a
[all …]
|
| D | signal.texi | 13 particular kind of event. Some kinds of events make it inadvisable or
19 function and tell the operating system to run it when that particular
73 terminate it with @kbd{C-c}. Whatever key sequence is used, the
111 but it does not raise a signal; instead, @code{open} returns @code{-1}.
151 When a signal is generated, it becomes @dfn{pending}. Normally it
154 of signal is currently @dfn{blocked}, it may remain pending
156 unblocked, it will be delivered immediately. @xref{Blocking Signals}.
172 If the specified action for a kind of signal is to ignore it, then any
177 it.
189 more detail in @ref{Process Completion}.) The information it can get
[all …]
|
| D | job.texi | 24 have, and it is a required feature in the 2001 revision of POSIX.1
51 even if you run just one program, it can use multiple processes
66 Every process belongs to a process group. When a process is created, it
68 process. You can put it in another process group using the
73 The only way to put a process in a different session is to make it the
76 process group, and you can't move it out of that process group again.
99 terminal, it is @dfn{stopped} by the terminal driver; if the
102 Characters}) and a program can stop any job by sending it a
123 allocate a controlling terminal to a session, since it is done for you
127 An individual process disconnects from its controlling terminal when it
[all …]
|
| D | memory.texi | 31 One of the most basic resources a process has available to it is memory.
42 page of all zeroes sometimes has nothing at all backing it -- there's
43 just a flag saying it is all zeroes.
74 described in @ref{Locking Pages} can control it.
82 generally much more of it than anyone needs. Memory allocation within a
87 programmatically. Actually, forking is a third way, but it's not very
91 loading its basic program into it, and executing the program. It is
93 operation takes a program file (an executable), it allocates space to
94 load all the data in the executable, loads it, and transfers control to
95 it. That data is most notably the instructions of the program (the
[all …]
|
| D | pipe.texi | 8 handled in a first-in, first-out (FIFO) order. The pipe has no name; it
16 through it.
19 from a pipe or FIFO file that doesn't have any processes writing to it
22 reading process is treated as an error condition; it generates a
47 use, a process creates a pipe just before it forks one or more child
106 interface is much simpler and easier to use. But it doesn't offer as
123 @c it may get corrupted with async signals and cancellation
130 @c it may get corrupted with async signals and cancellation
142 @c it may get corrupted with async signals and cancellation
151 command to complete, it creates a pipe to the subprocess and returns a
[all …]
|
| /glibc-2.36/sysdeps/mach/hurd/ |
| D | setitimer.c | 143 struct itimerval it; in restart_itimer() local
147 it.it_value = it.it_interval = _hurd_itimerval.it_interval; in restart_itimer()
148 setitimer_locked (&it, NULL, NULL, 1); in restart_itimer()
373 struct itimerval it; in fork_itimer() local
377 it = _hurd_itimerval; in fork_itimer()
378 it.it_value = it.it_interval; in fork_itimer()
380 setitimer_locked (&it, NULL, NULL, 0); in fork_itimer()
|
| /glibc-2.36/ |
| D | COPYING | 7 of this license document, but changing it is not allowed.
12 freedom to share and change it. By contrast, the GNU General Public
17 using it. (Some other Free Software Foundation software is covered by
18 the GNU Lesser General Public License instead.) You can apply it to
24 this service if you wish), that you receive source code or can get it
25 if you want it, that you can change the software or use pieces of it
31 distribute copies of the software, or if you modify it.
53 program proprietary. To prevent this, we have made it clear that any
63 a notice placed by the copyright holder saying it may be distributed
67 that is to say, a work containing the Program or a portion of it,
[all …]
|
| /glibc-2.36/math/ |
| D | gen-auto-libm-tests.c | 1145 handle_input_arg (const char *arg, input_test *it, size_t num_prev_args, in handle_input_arg() argument
1254 if (it->num_input_cases >= SIZE_MAX / num_values) in handle_input_arg()
1256 generic_value **old_inputs = it->inputs; in handle_input_arg()
1257 size_t new_num_input_cases = it->num_input_cases * num_values; in handle_input_arg()
1260 for (size_t i = 0; i < it->num_input_cases; i++) in handle_input_arg()
1278 it->inputs = new_inputs; in handle_input_arg()
1279 it->num_input_cases = new_num_input_cases; in handle_input_arg()
1351 input_test *it = &tf->tests[tf->num_tests]; in add_test() local
1352 it->line = line; in add_test()
1353 it->num_input_cases = 1; in add_test()
[all …]
|
| /glibc-2.36/misc/bits/ |
| D | stab.def | 5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
10 The GNU C Library is distributed in the hope that it will be useful,
30 Desc is supposedly starting line number, but GCC doesn't set it
31 and DBX seems not to miss it. */
55 /* New stab from Solaris. I don't know what it means, but it
59 /* New stab from Solaris. I don't know what it means, but it
67 /* Modula-2 compilation unit. Can someone say what info it contains? */
86 of the definition file. Other is non-zero if it is imported with the
101 can be caught here. If Desc is 0, it means all exceptions are caught
[all …]
|
| /glibc-2.36/iconvdata/testdata/ |
| D | suntzus | 16 within it, has been released as suntzu10.txt (or suntzu10.zip).
30 to safety or to ruin. Hence it is a subject of inquiry
83 upon it, will conquer: let such a one be retained in command!
84 The general that hearkens not to my counsel nor acts upon it,
162 the profitable way of carrying it on.
213 20. Thus it may be known that the leader of armies
214 is the arbiter of the people's fate, the man on whom it
223 to shatter and destroy it is not so good. So, too, it is
224 better to recapture an army entire than to destroy it,
238 4. The rule is, not to besiege walled cities if it
[all …]
|
| /glibc-2.36/sysdeps/arm/ |
| D | strlen.S | 50 Laligned: @ here, we have a word in r2. Does it
60 tst r2, $0xff000000 @ word that has a zero byte in it
62 tstne r2, $0x00ff0000 @ and add up to 3 bytes on to it
67 tst r2, $0x000000ff @ word that has a zero byte in it
69 tstne r2, $0x0000ff00 @ and add up to 3 bytes on to it
|
| /glibc-2.36/sysdeps/hppa/hppa1.1/ |
| D | mul_1.S | 8 ;! The GNU MP Library is free software; you can redistribute it and/or modify
9 ;! it under the terms of the GNU Lesser General Public License as published by
13 ;! The GNU MP Library is distributed in the hope that it will be useful, but
29 ;! This runs at 9 cycles/limb on a PA7000. With the used instructions, it can
31 ;! PA7100 it runs at 7 cycles/limb, and that can not be improved either, since
|
| /glibc-2.36/sysdeps/alpha/ |
| D | rshift.S | 7 # The GNU MP Library is free software; you can redistribute it and/or modify
8 # it under the terms of the GNU Lesser General Public License as published by
12 # The GNU MP Library is distributed in the hope that it will be useful, but
28 # it would take 4 cycles/limb. It should be possible to get down to 3
31 # makes it hard, if not impossible, to get down to 3 cycles/limb:
|