| /kernel/linux/linux-6.6/kernel/ |
| H A D | pid.c | 56 .numbers = { {
115 ns = pid->numbers[pid->level].ns; in put_pid()
137 struct upid *upid = pid->numbers + i; in free_pid()
247 pid->numbers[i].nr = nr; in alloc_pid()
248 pid->numbers[i].ns = tmp; in alloc_pid()
271 upid = pid->numbers + ns->level; in alloc_pid()
275 for ( ; upid >= pid->numbers; --upid) { in alloc_pid()
291 upid = pid->numbers + i; in alloc_pid()
481 upid = &pid->numbers[ns->level]; in pid_nr_ns()
663 struct_size_t(struct pid, numbers, in pid_idr_init()
[all...] |
| H A D | pid_namespace.c | 51 len = struct_size_t(struct pid, numbers, level + 1); in create_pid_cachep()
|
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | pid.h | 70 struct upid numbers[1]; member
153 ns = pid->numbers[pid->level].ns; in ns_of_pid()
165 return pid->numbers[pid->level].nr == 1; in is_child_reaper()
183 nr = pid->numbers[0].nr; in pid_nr()
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | pid.h | 70 struct upid numbers[]; member
156 ns = pid->numbers[pid->level].ns; in ns_of_pid()
168 return pid->numbers[pid->level].nr == 1; in is_child_reaper()
186 nr = pid->numbers[0].nr; in pid_nr()
|
| /kernel/linux/linux-5.10/kernel/ |
| H A D | pid.c | 56 .numbers = { {
112 ns = pid->numbers[pid->level].ns; in put_pid()
134 struct upid *upid = pid->numbers + i; in free_pid()
244 pid->numbers[i].nr = nr; in alloc_pid()
245 pid->numbers[i].ns = tmp; in alloc_pid()
268 upid = pid->numbers + ns->level; in alloc_pid()
272 for ( ; upid >= pid->numbers; --upid) { in alloc_pid()
288 upid = pid->numbers + i; in alloc_pid()
478 upid = &pid->numbers[ns->level]; in pid_nr_ns()
|
| /kernel/linux/linux-6.6/lib/ |
| H A D | test_scanf.c | 158 /* Selection of interesting numbers to test, copied from test-kstrtox.c */
159 static const unsigned long long numbers[] __initconst = {
206 for (i = 0; i < ARRAY_SIZE(numbers); i++) { \
207 if (value_representable_in_type(T, numbers[i])) \
209 numbers[i], fn); \
211 if (value_representable_in_type(T, -numbers[i])) \
213 -numbers[i], fn); \
292 * Define a pattern of negative and positive numbers to ensure we get
520 * List of numbers separated by delim. Each field width specifier is the
583 * List of numbers separate
[all...] |
| /kernel/linux/linux-6.6/samples/rust/ |
| H A D | rust_minimal.rs | 16 numbers: Vec<i32>,
24 let mut numbers = Vec::new(); variables
25 numbers.try_push(72)?;
26 numbers.try_push(108)?;
27 numbers.try_push(200)?;
29 Ok(RustMinimal { numbers })
35 pr_info!("My numbers are {:?}\n", self.numbers); in drop()
|
| /kernel/linux/linux-6.6/tools/perf/scripts/python/ |
| H A D | task-analyzer.py | 218 def _median(numbers):
220 n = len(numbers)
223 return sorted(numbers)[index]
224 return sum(sorted(numbers)[index - 1 : index + 1]) / 2
227 def _mean(numbers):
228 return sum(numbers) / len(numbers)
|
| /kernel/linux/linux-5.10/arch/m68k/fpsp040/ |
| H A D | sgetem.S | 8 | numbers.
73 | For normalized numbers, leave the mantissa alone, simply load
89 | For denormalized numbers, shift the mantissa until the j-bit = 1,
|
| H A D | scale.S | 62 | The source input is below 1, so we check for denormalized numbers
|
| H A D | fpsp.h | 324 .set VER_4,0x40 | fpsp compatible version numbers
|
| H A D | do_func.S | 10 | denormalized (there are no unnormalized numbers at this
|
| /kernel/linux/linux-6.6/arch/m68k/fpsp040/ |
| H A D | sgetem.S | 8 | numbers.
73 | For normalized numbers, leave the mantissa alone, simply load
89 | For denormalized numbers, shift the mantissa until the j-bit = 1,
|
| H A D | scale.S | 62 | The source input is below 1, so we check for denormalized numbers
|
| H A D | fpsp.h | 324 .set VER_4,0x40 | fpsp compatible version numbers
|
| /kernel/linux/linux-5.10/fs/proc/ |
| H A D | array.c | 214 seq_put_decimal_ull(m, "\t", task_tgid_nr_ns(p, pid->numbers[g].ns)); in task_state()
217 seq_put_decimal_ull(m, "\t", task_pid_nr_ns(p, pid->numbers[g].ns)); in task_state()
220 seq_put_decimal_ull(m, "\t", task_pgrp_nr_ns(p, pid->numbers[g].ns)); in task_state()
223 seq_put_decimal_ull(m, "\t", task_session_nr_ns(p, pid->numbers[g].ns)); in task_state()
667 * For quick read, open code by putting numbers directly in proc_pid_statm()
|
| /kernel/linux/linux-6.6/fs/proc/ |
| H A D | array.c | 211 seq_put_decimal_ull(m, "\t", task_tgid_nr_ns(p, pid->numbers[g].ns)); in task_state()
214 seq_put_decimal_ull(m, "\t", task_pid_nr_ns(p, pid->numbers[g].ns)); in task_state()
217 seq_put_decimal_ull(m, "\t", task_pgrp_nr_ns(p, pid->numbers[g].ns)); in task_state()
220 seq_put_decimal_ull(m, "\t", task_session_nr_ns(p, pid->numbers[g].ns)); in task_state()
692 * For quick read, open code by putting numbers directly in proc_pid_statm()
|
| /kernel/linux/linux-5.10/arch/arm/kernel/ |
| H A D | entry-header.S | 12 @ Bad Abort numbers
|
| H A D | head-nommu.S | 33 * numbers for r1.
217 mov \tmp, \rgnr @ Use static region numbers
|
| /kernel/linux/linux-5.10/arch/ia64/kernel/ |
| H A D | asm-offsets.c | 55 DEFINE(IA64_PID_UPID_OFFSET, offsetof (struct pid, numbers[0])); in foo()
|
| /kernel/linux/linux-6.6/arch/ia64/kernel/ |
| H A D | asm-offsets.c | 55 DEFINE(IA64_PID_UPID_OFFSET, offsetof (struct pid, numbers[0])); in foo()
|
| /kernel/linux/linux-6.6/arch/arm/kernel/ |
| H A D | entry-header.S | 12 @ Bad Abort numbers
|
| H A D | head-nommu.S | 32 * numbers for r1.
218 mov \tmp, \rgnr @ Use static region numbers
|
| /kernel/linux/linux-5.10/arch/arm/crypto/ |
| H A D | poly1305-armv4.pl | 597 @ Sum of two n-bit numbers is n+1 bits wide, sum of three - n+2,
598 @ and so is sum of four. Sum of 2^m n-m-bit numbers and n-bit
606 @ of 52-bit numbers as long as the amount of addends is not a
|
| /kernel/linux/linux-6.6/arch/arm/crypto/ |
| H A D | poly1305-armv4.pl | 597 @ Sum of two n-bit numbers is n+1 bits wide, sum of three - n+2,
598 @ and so is sum of four. Sum of 2^m n-m-bit numbers and n-bit
606 @ of 52-bit numbers as long as the amount of addends is not a
|