[PATCH v2] trace/pid_list: Change gfp flags in pid_list_fill_irq()

From: "levi.yun" pid_list_fill_irq() runs via irq_work. When CONFIG_PREEMPT_RT is disabled, it would run in irq_context. so it shouldn't sleep while memory allocation. Change gfp flags from GFP_KERNEL to GFP_NOWAIT to prevent sleep in irq_work. This change wouldn't impact functionality in pract

[PATCH] irq: export irq_check_status_bit

ror 1 make[4]: *** Deleting file 'Module.symvers' make[3]: *** [Makefile:1396: modules] Error 2 make[2]: *** [debian/rules:7: build-arch] Error 2 dpkg-buildpackage: error: debian/rules binary subprocess returned exit status 2 make[1]: *** [scripts/Makefile.package:83: bindeb-pkg] Error 2

[PATCH] lib/find_bit_bench: fix the unmatched iterations cnt

off-by: Levi Yun --- lib/find_bit_benchmark.c | 30 -- 1 file changed, 16 insertions(+), 14 deletions(-) diff --git a/lib/find_bit_benchmark.c b/lib/find_bit_benchmark.c index 5637c5711db9..766e0487852b 100644 --- a/lib/find_bit_benchmark.c +++ b/lib/find_bit_bench

[PATCH v2 8/8] ufs/util.h: Apply new find_last_zero_bit.

Former find_last_zero_bit in ufs makes complie error when we add find_last_zero_bit in lib/find_bit.c We remove former find_last_zero_bit in ufs which iterates per char, And apply new find_last_zero_bit in lib. Signed-off-by: Levi Yun --- fs/ufs/util.h | 30 +++--- 1

[PATCH v2 5/8] lib/find_bit_bench.c: Add find_last_zero_bit.

find_last_bit returns it as 1. This unmatched return value makes some confusion. So we fix it. Signed-off-by: Levi Yun --- lib/find_bit_benchmark.c | 51 +--- 1 file changed, 37 insertions(+), 14 deletions(-) diff --git a/lib/find_bit_benchmark.c b/lib

[PATCH v2 6/8] lib/find_bit: Add test-module,find_last_zero_bit

Add test module to test find_last_zero_bit and find_each_*_bit_revserse. Signed-off-by: Levi Yun --- lib/Kconfig.debug| 8 ++ lib/Makefile | 1 + lib/test_find_last_bit.c | 235 +++ 3 files changed, 244 insertions(+) create mode

[PATCH v2 7/8] btrfs/free-space-cache.c: Apply find_last_zero_bit

In steal_from_bitmap_to_front function, it finds last_zero_bit from i using for_each_clear_bit. But this makes some overhead that it starts from the 0 bit. By adding find_last_zero_bit, I try to remove this overhead and improve readibility. Signed-off-by: Levi Yun --- fs/btrfs/free-space

[PATCH v2 4/8] bitops/le.h: Add le support for find_last_bit

Inspired find_next_*_bit function series, add find_last_zero_bit. These patch adds declarations for find_last_zero_bit. This patch is for le support of find_last_bit and find_last_bit_zero. Signed-off-by: Levi Yun --- include/asm-generic/bitops/le.h | 20 1 file changed, 20

[PATCH v2 2/8] linux/bitops.h: Add find_each_*_bit_reverse macros

Add reverse routine for find_each_*_bit using find_last_bit and find_last_zero_bit. for correspondant usage wtih find_each_*_bit macros we use same parameters, But when we use these macro different from find_each_*_bit, @size should be a variable NOT constants. Signed-off-by: Levi Yun

[PATCH v2 3/8] bitops/find.h: Add declaration find_last_zero_bit

find_first_*_bit. Signed-off-by: Levi Yun --- include/asm-generic/bitops/find.h | 25 + 1 file changed, 25 insertions(+) diff --git a/include/asm-generic/bitops/find.h b/include/asm-generic/bitops/find.h index 9fdf21302fdf..eeb2d6669f83 100644 --- a/include/asm-generic/bitops

[PATCH v2 1/8] lib/find_bit.c: Add find_last_zero_bit

Inspired find_next_*_bit and find_last_bit, add find_last_zero_bit And add le support about find_last_bit and find_last_zero_bit. Signed-off-by: Levi Yun --- lib/find_bit.c | 64 -- 1 file changed, 62 insertions(+), 2 deletions(-) diff --git a