and fix all in-tree references.
Architecture-specific documentation is being moved into Documentation/arch/
as a way of cleaning up the top-level documentation directory and making
the docs hierarchy more closely match the source hierarchy.
Signed-off-by: Costa Shulyupin
---
Documentation/ABI
and fix all in-tree references.
Architecture-specific documentation is being moved into Documentation/arch/
as a way of cleaning up the top-level documentation directory and making
the docs hierarchy more closely match the source hierarchy.
Signed-off-by: Costa Shulyupin
---
Changes in v2
Replace `cpumask_any_and(a, b) >= nr_cpu_ids`
with the more readable `!cpumask_intersects(a, b)`.
Signed-off-by: Costa Shulyupin
---
arch/powerpc/sysdev/xive/common.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/arch/powerpc/sysdev/xive/common.c
b/arch/powerpc/sys
pending on the mask.
Changes in v2:
- Focusing in this patch series on interrupts only.
v1:
- https://lore.kernel.org/lkml/20240516190437.3545310-1-costa.s...@redhat.com/
References:
- Linux Kernel Dynamic CPU Isolation:
https://pretalx.com/devconf-us-2024/talk/AZBQLE/
Costa Shulyupin (3):
sche
housekeeping masks
https://lore.kernel.org/lkml/20240821142312.236970-1-long...@redhat.com/
Signed-off-by: Costa Shulyupin
---
Changes in v2:
- remove unnecessary `err` variable
- add for_each_clear_bit... to clear isolated CPUs
- Address Gleixner's comments:
- use WRITE_ONCE to c
interrupts according change
of housekeeping CPUs to support dynamic CPU isolation.
Signed-off-by: Costa Shulyupin
---
The following code is a proof of concept to validate
and review the correctness of the approach to solving the problem.
C++ comments denote temporary comments.
v2:
- refactor
root \
--qemu-opts '\-drive id=d1,if=none,file=image.qcow2 \
\-device nvme,id=i1,drive=d1,serial=1,bootindex=2'
Signed-off-by: Costa Shulyupin
---
Changes in v2:
- use shell script only
v1:
- https://lore.kernel.org/lkml/20240516190437.3545310-8-costa.s...@redhat.com/
] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
return true;
Conclusion: cpumask_intersects() is at least as efficient as cpumask_any_and(),
if not more so, as it typically performs fewer loops and comparisons.
Signed-off-by: Costa Shulyupin
Reviewed-by: Ming Lei
---
v2: a
