Home
last modified time | relevance | path

Searched refs:bitmap1 (Results 1 – 12 of 12) sorted by relevance

/linux/tools/lib/
H A Dbitmap.c21 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, in __bitmap_or() argument
28 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
60 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, in __bitmap_and() argument
68 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
70 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
75 bool __bitmap_equal(const unsigned long *bitmap1, in __bitmap_equal() argument
80 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
84 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
90 bool __bitmap_intersects(const unsigned long *bitmap1, in __bitmap_intersects() argument
95 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
/linux/lib/
H A Dbitmap.c37 bool __bitmap_equal(const unsigned long *bitmap1, in __bitmap_equal() argument
42 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
62 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal()
69 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal()
237 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
239 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
252 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
263 dst[k] = bitmap1[k] ^ bitmap2[k]; in __bitmap_xor()
275 result |= (dst[k] = bitmap1[k] & ~bitmap2[k]); in __bitmap_andnot()
300 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
/linux/fs/ocfs2/
H A Dlocalalloc.c331 || alloc->id1.bitmap1.i_used in ocfs2_load_local_alloc()
332 || alloc->id1.bitmap1.i_total in ocfs2_load_local_alloc()
665 le32_to_cpu(alloc->id1.bitmap1.i_used); in ocfs2_reserve_local_alloc_bits()
687 le32_to_cpu(alloc->id1.bitmap1.i_used); in ocfs2_reserve_local_alloc_bits()
834 if (!alloc->id1.bitmap1.i_total) { in ocfs2_local_alloc_find_clear_bits()
899 le32_to_cpu(alloc->id1.bitmap1.i_total), in ocfs2_local_alloc_find_clear_bits()
910 alloc->id1.bitmap1.i_total = 0; in ocfs2_clear_local_alloc()
911 alloc->id1.bitmap1.i_used = 0; in ocfs2_clear_local_alloc()
959 if (!alloc->id1.bitmap1.i_total) { in ocfs2_sync_local_to_main()
1153 le32_to_cpu(alloc->id1.bitmap1.i_total), in ocfs2_local_alloc_new_window()
[all …]
H A Dsuballoc.c813 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) - in ocfs2_reserve_suballoc_bits()
814 le32_to_cpu(fe->id1.bitmap1.i_used); in ocfs2_reserve_suballoc_bits()
844 (le32_to_cpu(fe->id1.bitmap1.i_total) in ocfs2_reserve_suballoc_bits()
845 - le32_to_cpu(fe->id1.bitmap1.i_used))); in ocfs2_reserve_suballoc_bits()
1647 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used); in ocfs2_alloc_dinode_update_counts()
1666 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used); in ocfs2_rollback_alloc_dinode_counts()
1954 if (le32_to_cpu(fe->id1.bitmap1.i_used) >= in ocfs2_claim_suballoc_bits()
1955 le32_to_cpu(fe->id1.bitmap1.i_total)) { in ocfs2_claim_suballoc_bits()
1959 le32_to_cpu(fe->id1.bitmap1.i_used), in ocfs2_claim_suballoc_bits()
1960 le32_to_cpu(fe->id1.bitmap1.i_total)); in ocfs2_claim_suballoc_bits()
[all …]
H A Dresize.c146 le32_add_cpu(&fe->id1.bitmap1.i_total, num_bits); in ocfs2_update_last_group_and_inode()
151 le32_add_cpu(&fe->id1.bitmap1.i_used, backups); in ocfs2_update_last_group_and_inode()
558 le32_add_cpu(&fe->id1.bitmap1.i_total, input->clusters *cl_bpc); in ocfs2_group_add()
559 le32_add_cpu(&fe->id1.bitmap1.i_used, in ocfs2_group_add()
H A Dioctl.c309 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total); in ocfs2_info_scan_inode_alloc()
311 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total) - in ocfs2_info_scan_inode_alloc()
312 le32_to_cpu(dinode_alloc->id1.bitmap1.i_used); in ocfs2_info_scan_inode_alloc()
582 le32_to_cpu(gb_dinode->id1.bitmap1.i_total); in ocfs2_info_freefrag_scan_bitmap()
584 le32_to_cpu(gb_dinode->id1.bitmap1.i_used); in ocfs2_info_freefrag_scan_bitmap()
H A Dmove_extents.c403 (vict_blkno >= ((u64)le32_to_cpu(ac_dinode->id1.bitmap1.i_total) << in ocfs2_find_victim_alloc_group()
H A Docfs2_fs.h713 } bitmap1; member
H A Dsuper.c1643 numbits = le32_to_cpu(bm_lock->id1.bitmap1.i_total); in ocfs2_statfs()
1644 freebits = numbits - le32_to_cpu(bm_lock->id1.bitmap1.i_used); in ocfs2_statfs()
/linux/tools/testing/selftests/seccomp/
H A Dseccomp_benchmark.c187 unsigned long long native, filter1, filter2, bitmap1, bitmap2; in main() local
227 bitmap1 = timing(CLOCK_PROCESS_CPUTIME_ID, samples) / samples; in main()
228 ksft_print_msg("getpid RET_ALLOW 1 filter (bitmap): %llu ns\n", bitmap1); in main()
262 bitmap1 - native); in main()
270 bitmap1 - native - (bitmap2 - bitmap1)); in main()
277 ret |= compare("native", "≤", "1 bitmap", native, le, bitmap1, in main()
288 bitmap1 - native, approx, bitmap2 - native, skip); in main()
295 bitmap1 - native, skip); in main()
/linux/tools/include/linux/
H A Dbitmap.h16 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
18 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
20 bool __bitmap_equal(const unsigned long *bitmap1,
23 bool __bitmap_intersects(const unsigned long *bitmap1,
/linux/include/linux/
H A Dbitmap.h150 bool __bitmap_equal(const unsigned long *bitmap1,
164 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
166 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
168 void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
170 bool __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
175 bool __bitmap_intersects(const unsigned long *bitmap1,
177 bool __bitmap_subset(const unsigned long *bitmap1,
180 unsigned int __bitmap_weight_and(const unsigned long *bitmap1,
182 unsigned int __bitmap_weight_andnot(const unsigned long *bitmap1,