| /linux-6.15/net/rxrpc/ |
| H A D | conn_object.c | 390 unsigned long expire_at, earliest, idle_timestamp, now; in rxrpc_service_connection_reaper() local
398 earliest = now + MAX_JIFFY_OFFSET; in rxrpc_service_connection_reaper()
419 if (time_before(expire_at, earliest)) in rxrpc_service_connection_reaper()
420 earliest = expire_at; in rxrpc_service_connection_reaper()
442 if (earliest != now + MAX_JIFFY_OFFSET) { in rxrpc_service_connection_reaper()
443 _debug("reschedule reaper %ld", (long)earliest - (long)now); in rxrpc_service_connection_reaper()
444 ASSERT(time_after(earliest, now)); in rxrpc_service_connection_reaper()
445 rxrpc_set_service_reap_timer(rxnet, earliest); in rxrpc_service_connection_reaper()
|
| H A D | ar-internal.h | 1462 static inline u32 earliest(u32 seq1, u32 seq2) in earliest() function
|
| /linux-6.15/arch/x86/boot/compressed/ |
| H A D | kaslr.c | 408 u64 earliest = img->start + img->size; in mem_avoid_overlap() local
413 mem_avoid[i].start < earliest) { in mem_avoid_overlap()
415 earliest = overlap->start; in mem_avoid_overlap()
428 if (mem_overlaps(img, &avoid) && (avoid.start < earliest)) { in mem_avoid_overlap()
430 earliest = overlap->start; in mem_avoid_overlap()
439 if (mem_overlaps(img, &avoid) && (avoid.start < earliest)) { in mem_avoid_overlap()
441 earliest = overlap->start; in mem_avoid_overlap()
|
| /linux-6.15/drivers/input/ |
| H A D | ff-memless.c | 113 unsigned long earliest = 0; in ml_schedule_timer() local
133 (++events == 1 || time_before(next_at, earliest))) in ml_schedule_timer()
134 earliest = next_at; in ml_schedule_timer()
142 mod_timer(&ml->timer, earliest); in ml_schedule_timer()
|
| /linux-6.15/Documentation/infiniband/ |
| H A D | tag_matching.rst | 15 message envelopes may match, the pair that includes the earliest posted-send
16 and the earliest posted-receive is the pair that must be used to satisfy the
|
| /linux-6.15/Documentation/scheduler/ |
| H A D | sched-eevdf.rst | 20 with the earliest VD to execute next. It's important to note that this
|
| H A D | sched-deadline.rst | 60 earliest scheduling deadline is selected for execution). Notice that the
68 algorithm selects the task with the earliest scheduling deadline as the one
|
| /linux-6.15/tools/bpf/bpftool/Documentation/ |
| H A D | bpftool-net.rst | 70 **xdpdrv** - Native XDP. runs earliest point in driver's receive path;
|
| /linux-6.15/drivers/parisc/ |
| H A D | Kconfig | 10 The VSC, GSC and HSC busses were used from the earliest 700-series
|
| /linux-6.15/arch/m68k/q40/ |
| H A D | README | 54 went wrong during earliest setup stages of head.S.
|
| /linux-6.15/Documentation/driver-api/ |
| H A D | device_link.rst | 47 The earliest point in time when device links can be added is after
|
| /linux-6.15/Documentation/admin-guide/ |
| H A D | quickly-build-trimmed-linux.rst | 295 Now fetch the latest upstream changes; you again need to specify the earliest
516 to specify the earliest version you care about (or to be precise: its git
|
| H A D | verify-bugs-and-bisect-regressions.rst | 1347 to specify the earliest version you care about (or to be precise: its git
|
| H A D | kernel-parameters.txt | 2743 kernel debugger at the earliest opportunity.
|
| /linux-6.15/Documentation/RCU/Design/Memory-Ordering/ |
| H A D | Tree-RCU-Memory-Ordering.rst | 583 | to end. The earliest reasonable candidate is as soon as the last CPU |
|
| /linux-6.15/Documentation/arch/arm64/ |
| H A D | arm-acpi.rst | 103 not be optimal, with the earliest kernel version that first provides support
|
| /linux-6.15/Documentation/ABI/stable/ |
| H A D | sysfs-driver-mlxreg-io | 582 flow their reset should be released with system power – earliest power
|
| /linux-6.15/Documentation/scsi/ |
| H A D | ncr53c8xx.rst | 107 the earliest 810 rev. 1, the latest 896 (2 channel LVD SCSI controller) and
|
| /linux-6.15/Documentation/RCU/Design/Requirements/ |
| H A D | Requirements.rst | 675 update-side code, and was premeditated, appearing in the earliest
|
| /linux-6.15/Documentation/filesystems/xfs/ |
| H A D | xfs-online-fsck-design.rst | 5321 The earliest form of this was the fork swap mechanism, where the entire
|