mirror of
https://github.com/torvalds/linux.git
synced 2026-03-08 05:24:39 +01:00
- The 3 patch series "mm, swap: improve cluster scan strategy" from Kairui Song improves performance and reduces the failure rate of swap cluster allocation. - The 4 patch series "support large align and nid in Rust allocators" from Vitaly Wool permits Rust allocators to set NUMA node and large alignment when perforning slub and vmalloc reallocs. - The 2 patch series "mm/damon/vaddr: support stat-purpose DAMOS" from Yueyang Pan extend DAMOS_STAT's handling of the DAMON operations sets for virtual address spaces for ops-level DAMOS filters. - The 3 patch series "execute PROCMAP_QUERY ioctl under per-vma lock" from Suren Baghdasaryan reduces mmap_lock contention during reads of /proc/pid/maps. - The 2 patch series "mm/mincore: minor clean up for swap cache checking" from Kairui Song performs some cleanup in the swap code. - The 11 patch series "mm: vm_normal_page*() improvements" from David Hildenbrand provides code cleanup in the pagemap code. - The 5 patch series "add persistent huge zero folio support" from Pankaj Raghav provides a block layer speedup by optionalls making the huge_zero_pagepersistent, instead of releasing it when its refcount falls to zero. - The 3 patch series "kho: fixes and cleanups" from Mike Rapoport adds a few touchups to the recently added Kexec Handover feature. - The 10 patch series "mm: make mm->flags a bitmap and 64-bit on all arches" from Lorenzo Stoakes turns mm_struct.flags into a bitmap. To end the constant struggle with space shortage on 32-bit conflicting with 64-bit's needs. - The 2 patch series "mm/swapfile.c and swap.h cleanup" from Chris Li cleans up some swap code. - The 7 patch series "selftests/mm: Fix false positives and skip unsupported tests" from Donet Tom fixes a few things in our selftests code. - The 7 patch series "prctl: extend PR_SET_THP_DISABLE to only provide THPs when advised" from David Hildenbrand "allows individual processes to opt-out of THP=always into THP=madvise, without affecting other workloads on the system". It's a long story - the [1/N] changelog spells out the considerations. - The 11 patch series "Add and use memdesc_flags_t" from Matthew Wilcox gets us started on the memdesc project. Please see https://kernelnewbies.org/MatthewWilcox/Memdescs and https://blogs.oracle.com/linux/post/introducing-memdesc. - The 3 patch series "Tiny optimization for large read operations" from Chi Zhiling improves the efficiency of the pagecache read path. - The 5 patch series "Better split_huge_page_test result check" from Zi Yan improves our folio splitting selftest code. - The 2 patch series "test that rmap behaves as expected" from Wei Yang adds some rmap selftests. - The 3 patch series "remove write_cache_pages()" from Christoph Hellwig removes that function and converts its two remaining callers. - The 2 patch series "selftests/mm: uffd-stress fixes" from Dev Jain fixes some UFFD selftests issues. - The 3 patch series "introduce kernel file mapped folios" from Boris Burkov introduces the concept of "kernel file pages". Using these permits btrfs to account its metadata pages to the root cgroup, rather than to the cgroups of random inappropriate tasks. - The 2 patch series "mm/pageblock: improve readability of some pageblock handling" from Wei Yang provides some readability improvements to the page allocator code. - The 11 patch series "mm/damon: support ARM32 with LPAE" from SeongJae Park teaches DAMON to understand arm32 highmem. - The 4 patch series "tools: testing: Use existing atomic.h for vma/maple tests" from Brendan Jackman performs some code cleanups and deduplication under tools/testing/. - The 2 patch series "maple_tree: Fix testing for 32bit compiles" from Liam Howlett fixes a couple of 32-bit issues in tools/testing/radix-tree.c. - The 2 patch series "kasan: unify kasan_enabled() and remove arch-specific implementations" from Sabyrzhan Tasbolatov moves KASAN arch-specific initialization code into a common arch-neutral implementation. - The 3 patch series "mm: remove zpool" from Johannes Weiner removes zspool - an indirection layer which now only redirects to a single thing (zsmalloc). - The 2 patch series "mm: task_stack: Stack handling cleanups" from Pasha Tatashin makes a couple of cleanups in the fork code. - The 37 patch series "mm: remove nth_page()" from David Hildenbrand makes rather a lot of adjustments at various nth_page() callsites, eventually permitting the removal of that undesirable helper function. - The 2 patch series "introduce kasan.write_only option in hw-tags" from Yeoreum Yun creates a KASAN read-only mode for ARM, using that architecture's memory tagging feature. It is felt that a read-only mode KASAN is suitable for use in production systems rather than debug-only. - The 3 patch series "mm: hugetlb: cleanup hugetlb folio allocation" from Kefeng Wang does some tidying in the hugetlb folio allocation code. - The 12 patch series "mm: establish const-correctness for pointer parameters" from Max Kellermann makes quite a number of the MM API functions more accurate about the constness of their arguments. This was getting in the way of subsystems (in this case CEPH) when they attempt to improving their own const/non-const accuracy. - The 7 patch series "Cleanup free_pages() misuse" from Vishal Moola fixes a number of code sites which were confused over when to use free_pages() vs __free_pages(). - The 3 patch series "Add Rust abstraction for Maple Trees" from Alice Ryhl makes the mapletree code accessible to Rust. Required by nouveau and by its forthcoming successor: the new Rust Nova driver. - The 2 patch series "selftests/mm: split_huge_page_test: split_pte_mapped_thp improvements" from David Hildenbrand adds a fix and some cleanups to the thp selftesting code. - The 14 patch series "mm, swap: introduce swap table as swap cache (phase I)" from Chris Li and Kairui Song is the first step along the path to implementing "swap tables" - a new approach to swap allocation and state tracking which is expected to yield speed and space improvements. This patchset itself yields a 5-20% performance benefit in some situations. - The 3 patch series "Some ptdesc cleanups" from Matthew Wilcox utilizes the new memdesc layer to clean up the ptdesc code a little. - The 3 patch series "Fix va_high_addr_switch.sh test failure" from Chunyu Hu fixes some issues in our 5-level pagetable selftesting code. - The 2 patch series "Minor fixes for memory allocation profiling" from Suren Baghdasaryan addresses a couple of minor issues in relatively new memory allocation profiling feature. - The 3 patch series "Small cleanups" from Matthew Wilcox has a few cleanups in preparation for more memdesc work. - The 2 patch series "mm/damon: add addr_unit for DAMON_LRU_SORT and DAMON_RECLAIM" from Quanmin Yan makes some changes to DAMON in furtherance of supporting arm highmem. - The 2 patch series "selftests/mm: Add -Wunreachable-code and fix warnings" from Muhammad Anjum adds that compiler check to selftests code and fixes the fallout, by removing dead code. - The 10 patch series "Improvements to Victim Process Thawing and OOM Reaper Traversal Order" from zhongjinji makes a number of improvements in the OOM killer: mainly thawing a more appropriate group of victim threads so they can release resources. - The 5 patch series "mm/damon: misc fixups and improvements for 6.18" from SeongJae Park is a bunch of small and unrelated fixups for DAMON. - The 7 patch series "mm/damon: define and use DAMON initialization check function" from SeongJae Park implement reliability and maintainability improvements to a recently-added bug fix. - The 2 patch series "mm/damon/stat: expose auto-tuned intervals and non-idle ages" from SeongJae Park provides additional transparency to userspace clients of the DAMON_STAT information. - The 2 patch series "Expand scope of khugepaged anonymous collapse" from Dev Jain removes some constraints on khubepaged's collapsing of anon VMAs. It also increases the success rate of MADV_COLLAPSE against an anon vma. - The 2 patch series "mm: do not assume file == vma->vm_file in compat_vma_mmap_prepare()" from Lorenzo Stoakes moves us further towards removal of file_operations.mmap(). This patchset concentrates upon clearing up the treatment of stacked filesystems. - The 6 patch series "mm: Improve mlock tracking for large folios" from Kiryl Shutsemau provides some fixes and improvements to mlock's tracking of large folios. /proc/meminfo's "Mlocked" field became more accurate. - The 2 patch series "mm/ksm: Fix incorrect accounting of KSM counters during fork" from Donet Tom fixes several user-visible KSM stats inaccuracies across forks and adds selftest code to verify these counters. - The 2 patch series "mm_slot: fix the usage of mm_slot_entry" from Wei Yang addresses some potential but presently benign issues in KSM's mm_slot handling. -----BEGIN PGP SIGNATURE----- iHUEABYKAB0WIQTTMBEPP41GrTpTJgfdBJ7gKXxAjgUCaN3cywAKCRDdBJ7gKXxA jtaPAQDmIuIu7+XnVUK5V11hsQ/5QtsUeLHV3OsAn4yW5/3dEQD/UddRU08ePN+1 2VRB0EwkLAdfMWW7TfiNZ+yhuoiL/AA= =4mhY -----END PGP SIGNATURE----- Merge tag 'mm-stable-2025-10-01-19-00' of git://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm Pull MM updates from Andrew Morton: - "mm, swap: improve cluster scan strategy" from Kairui Song improves performance and reduces the failure rate of swap cluster allocation - "support large align and nid in Rust allocators" from Vitaly Wool permits Rust allocators to set NUMA node and large alignment when perforning slub and vmalloc reallocs - "mm/damon/vaddr: support stat-purpose DAMOS" from Yueyang Pan extend DAMOS_STAT's handling of the DAMON operations sets for virtual address spaces for ops-level DAMOS filters - "execute PROCMAP_QUERY ioctl under per-vma lock" from Suren Baghdasaryan reduces mmap_lock contention during reads of /proc/pid/maps - "mm/mincore: minor clean up for swap cache checking" from Kairui Song performs some cleanup in the swap code - "mm: vm_normal_page*() improvements" from David Hildenbrand provides code cleanup in the pagemap code - "add persistent huge zero folio support" from Pankaj Raghav provides a block layer speedup by optionalls making the huge_zero_pagepersistent, instead of releasing it when its refcount falls to zero - "kho: fixes and cleanups" from Mike Rapoport adds a few touchups to the recently added Kexec Handover feature - "mm: make mm->flags a bitmap and 64-bit on all arches" from Lorenzo Stoakes turns mm_struct.flags into a bitmap. To end the constant struggle with space shortage on 32-bit conflicting with 64-bit's needs - "mm/swapfile.c and swap.h cleanup" from Chris Li cleans up some swap code - "selftests/mm: Fix false positives and skip unsupported tests" from Donet Tom fixes a few things in our selftests code - "prctl: extend PR_SET_THP_DISABLE to only provide THPs when advised" from David Hildenbrand "allows individual processes to opt-out of THP=always into THP=madvise, without affecting other workloads on the system". It's a long story - the [1/N] changelog spells out the considerations - "Add and use memdesc_flags_t" from Matthew Wilcox gets us started on the memdesc project. Please see https://kernelnewbies.org/MatthewWilcox/Memdescs and https://blogs.oracle.com/linux/post/introducing-memdesc - "Tiny optimization for large read operations" from Chi Zhiling improves the efficiency of the pagecache read path - "Better split_huge_page_test result check" from Zi Yan improves our folio splitting selftest code - "test that rmap behaves as expected" from Wei Yang adds some rmap selftests - "remove write_cache_pages()" from Christoph Hellwig removes that function and converts its two remaining callers - "selftests/mm: uffd-stress fixes" from Dev Jain fixes some UFFD selftests issues - "introduce kernel file mapped folios" from Boris Burkov introduces the concept of "kernel file pages". Using these permits btrfs to account its metadata pages to the root cgroup, rather than to the cgroups of random inappropriate tasks - "mm/pageblock: improve readability of some pageblock handling" from Wei Yang provides some readability improvements to the page allocator code - "mm/damon: support ARM32 with LPAE" from SeongJae Park teaches DAMON to understand arm32 highmem - "tools: testing: Use existing atomic.h for vma/maple tests" from Brendan Jackman performs some code cleanups and deduplication under tools/testing/ - "maple_tree: Fix testing for 32bit compiles" from Liam Howlett fixes a couple of 32-bit issues in tools/testing/radix-tree.c - "kasan: unify kasan_enabled() and remove arch-specific implementations" from Sabyrzhan Tasbolatov moves KASAN arch-specific initialization code into a common arch-neutral implementation - "mm: remove zpool" from Johannes Weiner removes zspool - an indirection layer which now only redirects to a single thing (zsmalloc) - "mm: task_stack: Stack handling cleanups" from Pasha Tatashin makes a couple of cleanups in the fork code - "mm: remove nth_page()" from David Hildenbrand makes rather a lot of adjustments at various nth_page() callsites, eventually permitting the removal of that undesirable helper function - "introduce kasan.write_only option in hw-tags" from Yeoreum Yun creates a KASAN read-only mode for ARM, using that architecture's memory tagging feature. It is felt that a read-only mode KASAN is suitable for use in production systems rather than debug-only - "mm: hugetlb: cleanup hugetlb folio allocation" from Kefeng Wang does some tidying in the hugetlb folio allocation code - "mm: establish const-correctness for pointer parameters" from Max Kellermann makes quite a number of the MM API functions more accurate about the constness of their arguments. This was getting in the way of subsystems (in this case CEPH) when they attempt to improving their own const/non-const accuracy - "Cleanup free_pages() misuse" from Vishal Moola fixes a number of code sites which were confused over when to use free_pages() vs __free_pages() - "Add Rust abstraction for Maple Trees" from Alice Ryhl makes the mapletree code accessible to Rust. Required by nouveau and by its forthcoming successor: the new Rust Nova driver - "selftests/mm: split_huge_page_test: split_pte_mapped_thp improvements" from David Hildenbrand adds a fix and some cleanups to the thp selftesting code - "mm, swap: introduce swap table as swap cache (phase I)" from Chris Li and Kairui Song is the first step along the path to implementing "swap tables" - a new approach to swap allocation and state tracking which is expected to yield speed and space improvements. This patchset itself yields a 5-20% performance benefit in some situations - "Some ptdesc cleanups" from Matthew Wilcox utilizes the new memdesc layer to clean up the ptdesc code a little - "Fix va_high_addr_switch.sh test failure" from Chunyu Hu fixes some issues in our 5-level pagetable selftesting code - "Minor fixes for memory allocation profiling" from Suren Baghdasaryan addresses a couple of minor issues in relatively new memory allocation profiling feature - "Small cleanups" from Matthew Wilcox has a few cleanups in preparation for more memdesc work - "mm/damon: add addr_unit for DAMON_LRU_SORT and DAMON_RECLAIM" from Quanmin Yan makes some changes to DAMON in furtherance of supporting arm highmem - "selftests/mm: Add -Wunreachable-code and fix warnings" from Muhammad Anjum adds that compiler check to selftests code and fixes the fallout, by removing dead code - "Improvements to Victim Process Thawing and OOM Reaper Traversal Order" from zhongjinji makes a number of improvements in the OOM killer: mainly thawing a more appropriate group of victim threads so they can release resources - "mm/damon: misc fixups and improvements for 6.18" from SeongJae Park is a bunch of small and unrelated fixups for DAMON - "mm/damon: define and use DAMON initialization check function" from SeongJae Park implement reliability and maintainability improvements to a recently-added bug fix - "mm/damon/stat: expose auto-tuned intervals and non-idle ages" from SeongJae Park provides additional transparency to userspace clients of the DAMON_STAT information - "Expand scope of khugepaged anonymous collapse" from Dev Jain removes some constraints on khubepaged's collapsing of anon VMAs. It also increases the success rate of MADV_COLLAPSE against an anon vma - "mm: do not assume file == vma->vm_file in compat_vma_mmap_prepare()" from Lorenzo Stoakes moves us further towards removal of file_operations.mmap(). This patchset concentrates upon clearing up the treatment of stacked filesystems - "mm: Improve mlock tracking for large folios" from Kiryl Shutsemau provides some fixes and improvements to mlock's tracking of large folios. /proc/meminfo's "Mlocked" field became more accurate - "mm/ksm: Fix incorrect accounting of KSM counters during fork" from Donet Tom fixes several user-visible KSM stats inaccuracies across forks and adds selftest code to verify these counters - "mm_slot: fix the usage of mm_slot_entry" from Wei Yang addresses some potential but presently benign issues in KSM's mm_slot handling * tag 'mm-stable-2025-10-01-19-00' of git://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm: (372 commits) mm: swap: check for stable address space before operating on the VMA mm: convert folio_page() back to a macro mm/khugepaged: use start_addr/addr for improved readability hugetlbfs: skip VMAs without shareable locks in hugetlb_vmdelete_list alloc_tag: fix boot failure due to NULL pointer dereference mm: silence data-race in update_hiwater_rss mm/memory-failure: don't select MEMORY_ISOLATION mm/khugepaged: remove definition of struct khugepaged_mm_slot mm/ksm: get mm_slot by mm_slot_entry() when slot is !NULL hugetlb: increase number of reserving hugepages via cmdline selftests/mm: add fork inheritance test for ksm_merging_pages counter mm/ksm: fix incorrect KSM counter handling in mm_struct during fork drivers/base/node: fix double free in register_one_node() mm: remove PMD alignment constraint in execmem_vmalloc() mm/memory_hotplug: fix typo 'esecially' -> 'especially' mm/rmap: improve mlock tracking for large folios mm/filemap: map entire large folio faultaround mm/fault: try to map the entire file folio in finish_fault() mm/rmap: mlock large folios in try_to_unmap_one() mm/rmap: fix a mlock race condition in folio_referenced_one() ...
478 lines
12 KiB
C
478 lines
12 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* kselftest.h: low-level kselftest framework to include from
|
|
* selftest programs. When possible, please use
|
|
* kselftest_harness.h instead.
|
|
*
|
|
* Copyright (c) 2014 Shuah Khan <shuahkh@osg.samsung.com>
|
|
* Copyright (c) 2014 Samsung Electronics Co., Ltd.
|
|
*
|
|
* Using this API consists of first counting how many tests your code
|
|
* has to run, and then starting up the reporting:
|
|
*
|
|
* ksft_print_header();
|
|
* ksft_set_plan(total_number_of_tests);
|
|
*
|
|
* For each test, report any progress, debugging, etc with:
|
|
*
|
|
* ksft_print_msg(fmt, ...);
|
|
* ksft_perror(msg);
|
|
*
|
|
* and finally report the pass/fail/skip/xfail/xpass state of the test
|
|
* with one of:
|
|
*
|
|
* ksft_test_result(condition, fmt, ...);
|
|
* ksft_test_result_report(result, fmt, ...);
|
|
* ksft_test_result_pass(fmt, ...);
|
|
* ksft_test_result_fail(fmt, ...);
|
|
* ksft_test_result_skip(fmt, ...);
|
|
* ksft_test_result_xfail(fmt, ...);
|
|
* ksft_test_result_xpass(fmt, ...);
|
|
* ksft_test_result_error(fmt, ...);
|
|
* ksft_test_result_code(exit_code, test_name, fmt, ...);
|
|
*
|
|
* When all tests are finished, clean up and exit the program with one of:
|
|
*
|
|
* ksft_finished();
|
|
* ksft_exit(condition);
|
|
* ksft_exit_pass();
|
|
* ksft_exit_fail();
|
|
*
|
|
* If the program wants to report details on why the entire program has
|
|
* failed, it can instead exit with a message (this is usually done when
|
|
* the program is aborting before finishing all tests):
|
|
*
|
|
* ksft_exit_fail_msg(fmt, ...);
|
|
* ksft_exit_fail_perror(msg);
|
|
*
|
|
*/
|
|
#ifndef __KSELFTEST_H
|
|
#define __KSELFTEST_H
|
|
|
|
#ifndef NOLIBC
|
|
#include <errno.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include <stdarg.h>
|
|
#include <stdbool.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <sys/utsname.h>
|
|
#endif
|
|
|
|
#ifndef ARRAY_SIZE
|
|
#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]))
|
|
#endif
|
|
|
|
#if defined(__i386__) || defined(__x86_64__) /* arch */
|
|
/*
|
|
* gcc cpuid.h provides __cpuid_count() since v4.4.
|
|
* Clang/LLVM cpuid.h provides __cpuid_count() since v3.4.0.
|
|
*
|
|
* Provide local define for tests needing __cpuid_count() because
|
|
* selftests need to work in older environments that do not yet
|
|
* have __cpuid_count().
|
|
*/
|
|
#ifndef __cpuid_count
|
|
#define __cpuid_count(level, count, a, b, c, d) \
|
|
__asm__ __volatile__ ("cpuid\n\t" \
|
|
: "=a" (a), "=b" (b), "=c" (c), "=d" (d) \
|
|
: "0" (level), "2" (count))
|
|
#endif
|
|
#endif /* end arch */
|
|
|
|
/* define kselftest exit codes */
|
|
#define KSFT_PASS 0
|
|
#define KSFT_FAIL 1
|
|
#define KSFT_XFAIL 2
|
|
#define KSFT_XPASS 3
|
|
#define KSFT_SKIP 4
|
|
|
|
#ifndef __noreturn
|
|
#define __noreturn __attribute__((__noreturn__))
|
|
#endif
|
|
#define __printf(a, b) __attribute__((format(printf, a, b)))
|
|
|
|
#ifndef __always_unused
|
|
#define __always_unused __attribute__((__unused__))
|
|
#endif
|
|
|
|
#ifndef __maybe_unused
|
|
#define __maybe_unused __attribute__((__unused__))
|
|
#endif
|
|
|
|
/* counters */
|
|
struct ksft_count {
|
|
unsigned int ksft_pass;
|
|
unsigned int ksft_fail;
|
|
unsigned int ksft_xfail;
|
|
unsigned int ksft_xpass;
|
|
unsigned int ksft_xskip;
|
|
unsigned int ksft_error;
|
|
};
|
|
|
|
static struct ksft_count ksft_cnt;
|
|
static unsigned int ksft_plan;
|
|
static bool ksft_debug_enabled;
|
|
|
|
static inline unsigned int ksft_test_num(void)
|
|
{
|
|
return ksft_cnt.ksft_pass + ksft_cnt.ksft_fail +
|
|
ksft_cnt.ksft_xfail + ksft_cnt.ksft_xpass +
|
|
ksft_cnt.ksft_xskip + ksft_cnt.ksft_error;
|
|
}
|
|
|
|
static inline void ksft_inc_pass_cnt(void) { ksft_cnt.ksft_pass++; }
|
|
static inline void ksft_inc_fail_cnt(void) { ksft_cnt.ksft_fail++; }
|
|
static inline void ksft_inc_xfail_cnt(void) { ksft_cnt.ksft_xfail++; }
|
|
static inline void ksft_inc_xpass_cnt(void) { ksft_cnt.ksft_xpass++; }
|
|
static inline void ksft_inc_xskip_cnt(void) { ksft_cnt.ksft_xskip++; }
|
|
static inline void ksft_inc_error_cnt(void) { ksft_cnt.ksft_error++; }
|
|
|
|
static inline int ksft_get_pass_cnt(void) { return ksft_cnt.ksft_pass; }
|
|
static inline int ksft_get_fail_cnt(void) { return ksft_cnt.ksft_fail; }
|
|
static inline int ksft_get_xfail_cnt(void) { return ksft_cnt.ksft_xfail; }
|
|
static inline int ksft_get_xpass_cnt(void) { return ksft_cnt.ksft_xpass; }
|
|
static inline int ksft_get_xskip_cnt(void) { return ksft_cnt.ksft_xskip; }
|
|
static inline int ksft_get_error_cnt(void) { return ksft_cnt.ksft_error; }
|
|
|
|
static inline void ksft_print_header(void)
|
|
{
|
|
/*
|
|
* Force line buffering; If stdout is not connected to a terminal, it
|
|
* will otherwise default to fully buffered, which can cause output
|
|
* duplication if there is content in the buffer when fork()ing. If
|
|
* there is a crash, line buffering also means the most recent output
|
|
* line will be visible.
|
|
*/
|
|
setvbuf(stdout, NULL, _IOLBF, 0);
|
|
|
|
if (!(getenv("KSFT_TAP_LEVEL")))
|
|
printf("TAP version 13\n");
|
|
}
|
|
|
|
static inline void ksft_set_plan(unsigned int plan)
|
|
{
|
|
ksft_plan = plan;
|
|
printf("1..%u\n", ksft_plan);
|
|
}
|
|
|
|
static inline void ksft_print_cnts(void)
|
|
{
|
|
if (ksft_cnt.ksft_xskip > 0)
|
|
printf(
|
|
"# %u skipped test(s) detected. Consider enabling relevant config options to improve coverage.\n",
|
|
ksft_cnt.ksft_xskip
|
|
);
|
|
if (ksft_plan != ksft_test_num())
|
|
printf("# Planned tests != run tests (%u != %u)\n",
|
|
ksft_plan, ksft_test_num());
|
|
printf("# Totals: pass:%u fail:%u xfail:%u xpass:%u skip:%u error:%u\n",
|
|
ksft_cnt.ksft_pass, ksft_cnt.ksft_fail,
|
|
ksft_cnt.ksft_xfail, ksft_cnt.ksft_xpass,
|
|
ksft_cnt.ksft_xskip, ksft_cnt.ksft_error);
|
|
}
|
|
|
|
static inline __printf(1, 2) void ksft_print_msg(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
va_start(args, msg);
|
|
printf("# ");
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
static inline void ksft_print_dbg_msg(const char *msg, ...)
|
|
{
|
|
va_list args;
|
|
|
|
if (!ksft_debug_enabled)
|
|
return;
|
|
|
|
va_start(args, msg);
|
|
ksft_print_msg(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
static inline void ksft_perror(const char *msg)
|
|
{
|
|
ksft_print_msg("%s: %s (%d)\n", msg, strerror(errno), errno);
|
|
}
|
|
|
|
static inline __printf(1, 2) void ksft_test_result_pass(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
ksft_cnt.ksft_pass++;
|
|
|
|
va_start(args, msg);
|
|
printf("ok %u ", ksft_test_num());
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
static inline __printf(1, 2) void ksft_test_result_fail(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
ksft_cnt.ksft_fail++;
|
|
|
|
va_start(args, msg);
|
|
printf("not ok %u ", ksft_test_num());
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
/**
|
|
* ksft_test_result() - Report test success based on truth of condition
|
|
*
|
|
* @condition: if true, report test success, otherwise failure.
|
|
*/
|
|
#define ksft_test_result(condition, fmt, ...) do { \
|
|
if (!!(condition)) \
|
|
ksft_test_result_pass(fmt, ##__VA_ARGS__);\
|
|
else \
|
|
ksft_test_result_fail(fmt, ##__VA_ARGS__);\
|
|
} while (0)
|
|
|
|
static inline __printf(1, 2) void ksft_test_result_xfail(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
ksft_cnt.ksft_xfail++;
|
|
|
|
va_start(args, msg);
|
|
printf("ok %u # XFAIL ", ksft_test_num());
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
static inline __printf(1, 2) void ksft_test_result_xpass(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
ksft_cnt.ksft_xpass++;
|
|
|
|
va_start(args, msg);
|
|
printf("ok %u # XPASS ", ksft_test_num());
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
static inline __printf(1, 2) void ksft_test_result_skip(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
ksft_cnt.ksft_xskip++;
|
|
|
|
va_start(args, msg);
|
|
printf("ok %u # SKIP ", ksft_test_num());
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
/* TODO: how does "error" differ from "fail" or "skip"? */
|
|
static inline __printf(1, 2) void ksft_test_result_error(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
ksft_cnt.ksft_error++;
|
|
|
|
va_start(args, msg);
|
|
printf("not ok %u # error ", ksft_test_num());
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
|
|
static inline __printf(3, 4)
|
|
void ksft_test_result_code(int exit_code, const char *test_name,
|
|
const char *msg, ...)
|
|
{
|
|
const char *tap_code = "ok";
|
|
const char *directive = "";
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
switch (exit_code) {
|
|
case KSFT_PASS:
|
|
ksft_cnt.ksft_pass++;
|
|
break;
|
|
case KSFT_XFAIL:
|
|
directive = " # XFAIL ";
|
|
ksft_cnt.ksft_xfail++;
|
|
break;
|
|
case KSFT_XPASS:
|
|
directive = " # XPASS ";
|
|
ksft_cnt.ksft_xpass++;
|
|
break;
|
|
case KSFT_SKIP:
|
|
directive = " # SKIP ";
|
|
ksft_cnt.ksft_xskip++;
|
|
break;
|
|
case KSFT_FAIL:
|
|
default:
|
|
tap_code = "not ok";
|
|
ksft_cnt.ksft_fail++;
|
|
break;
|
|
}
|
|
|
|
/* Docs seem to call for double space if directive is absent */
|
|
if (!directive[0] && msg)
|
|
directive = " # ";
|
|
|
|
printf("%s %u %s%s", tap_code, ksft_test_num(), test_name, directive);
|
|
errno = saved_errno;
|
|
if (msg) {
|
|
va_start(args, msg);
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
/**
|
|
* ksft_test_result() - Report test success based on truth of condition
|
|
*
|
|
* @condition: if true, report test success, otherwise failure.
|
|
*/
|
|
#define ksft_test_result_report(result, fmt, ...) do { \
|
|
switch (result) { \
|
|
case KSFT_PASS: \
|
|
ksft_test_result_pass(fmt, ##__VA_ARGS__); \
|
|
break; \
|
|
case KSFT_FAIL: \
|
|
ksft_test_result_fail(fmt, ##__VA_ARGS__); \
|
|
break; \
|
|
case KSFT_XFAIL: \
|
|
ksft_test_result_xfail(fmt, ##__VA_ARGS__); \
|
|
break; \
|
|
case KSFT_XPASS: \
|
|
ksft_test_result_xpass(fmt, ##__VA_ARGS__); \
|
|
break; \
|
|
case KSFT_SKIP: \
|
|
ksft_test_result_skip(fmt, ##__VA_ARGS__); \
|
|
break; \
|
|
} } while (0)
|
|
|
|
static inline __noreturn void ksft_exit_pass(void)
|
|
{
|
|
ksft_print_cnts();
|
|
exit(KSFT_PASS);
|
|
}
|
|
|
|
static inline __noreturn void ksft_exit_fail(void)
|
|
{
|
|
ksft_print_cnts();
|
|
exit(KSFT_FAIL);
|
|
}
|
|
|
|
/**
|
|
* ksft_exit() - Exit selftest based on truth of condition
|
|
*
|
|
* @condition: if true, exit self test with success, otherwise fail.
|
|
*/
|
|
#define ksft_exit(condition) do { \
|
|
if (!!(condition)) \
|
|
ksft_exit_pass(); \
|
|
else \
|
|
ksft_exit_fail(); \
|
|
} while (0)
|
|
|
|
/**
|
|
* ksft_finished() - Exit selftest with success if all tests passed
|
|
*/
|
|
#define ksft_finished() \
|
|
ksft_exit(ksft_plan == \
|
|
ksft_cnt.ksft_pass + \
|
|
ksft_cnt.ksft_xfail + \
|
|
ksft_cnt.ksft_xskip)
|
|
|
|
static inline __noreturn __printf(1, 2) void ksft_exit_fail_msg(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
va_start(args, msg);
|
|
printf("Bail out! ");
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
|
|
ksft_print_cnts();
|
|
exit(KSFT_FAIL);
|
|
}
|
|
|
|
static inline __noreturn void ksft_exit_fail_perror(const char *msg)
|
|
{
|
|
ksft_exit_fail_msg("%s: %s (%d)\n", msg, strerror(errno), errno);
|
|
}
|
|
|
|
static inline __noreturn void ksft_exit_xfail(void)
|
|
{
|
|
ksft_print_cnts();
|
|
exit(KSFT_XFAIL);
|
|
}
|
|
|
|
static inline __noreturn void ksft_exit_xpass(void)
|
|
{
|
|
ksft_print_cnts();
|
|
exit(KSFT_XPASS);
|
|
}
|
|
|
|
static inline __noreturn __printf(1, 2) void ksft_exit_skip(const char *msg, ...)
|
|
{
|
|
int saved_errno = errno;
|
|
va_list args;
|
|
|
|
va_start(args, msg);
|
|
|
|
/*
|
|
* FIXME: several tests misuse ksft_exit_skip so produce
|
|
* something sensible if some tests have already been run
|
|
* or a plan has been printed. Those tests should use
|
|
* ksft_test_result_skip or ksft_exit_fail_msg instead.
|
|
*/
|
|
if (ksft_plan || ksft_test_num()) {
|
|
ksft_cnt.ksft_xskip++;
|
|
printf("ok %u # SKIP ", 1 + ksft_test_num());
|
|
} else {
|
|
printf("1..0 # SKIP ");
|
|
}
|
|
if (msg) {
|
|
errno = saved_errno;
|
|
vprintf(msg, args);
|
|
va_end(args);
|
|
}
|
|
if (ksft_test_num())
|
|
ksft_print_cnts();
|
|
exit(KSFT_SKIP);
|
|
}
|
|
|
|
static inline int ksft_min_kernel_version(unsigned int min_major,
|
|
unsigned int min_minor)
|
|
{
|
|
unsigned int major, minor;
|
|
struct utsname info;
|
|
|
|
if (uname(&info) || sscanf(info.release, "%u.%u.", &major, &minor) != 2)
|
|
ksft_exit_fail_msg("Can't parse kernel version\n");
|
|
|
|
return major > min_major || (major == min_major && minor >= min_minor);
|
|
}
|
|
|
|
#endif /* __KSELFTEST_H */
|