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

/linux-master/tools/lib/
H A Dbitmap.c21 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, argument
28 dst[k] = bitmap1[k] | bitmap2[k];
60 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, argument
68 result |= (dst[k] = bitmap1[k] & bitmap2[k]);
70 result |= (dst[k] = bitmap1[k] & bitmap2[k] &
75 bool __bitmap_equal(const unsigned long *bitmap1, argument
80 if (bitmap1[k] != bitmap2[k])
84 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
90 bool __bitmap_intersects(const unsigned long *bitmap1, argument
95 if (bitmap1[
[all...]
/linux-master/lib/
H A Dbitmap.c37 bool __bitmap_equal(const unsigned long *bitmap1, argument
42 if (bitmap1[k] != bitmap2[k])
46 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
53 bool __bitmap_or_equal(const unsigned long *bitmap1, argument
62 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k])
69 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k];
229 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, argument
237 result |= (dst[k] = bitmap1[k] & bitmap2[k]);
239 result |= (dst[k] = bitmap1[k] & bitmap2[k] &
245 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, argument
256 __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) argument
267 __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) argument
295 __bitmap_intersects(const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) argument
310 __bitmap_subset(const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) argument
344 __bitmap_weight_and(const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) argument
351 __bitmap_weight_andnot(const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) argument
[all...]
/linux-master/tools/testing/selftests/seccomp/
H A Dseccomp_benchmark.c187 unsigned long long native, filter1, filter2, bitmap1, bitmap2; local
227 bitmap1 = timing(CLOCK_PROCESS_CPUTIME_ID, samples) / samples;
228 ksft_print_msg("getpid RET_ALLOW 1 filter (bitmap): %llu ns\n", bitmap1);
262 bitmap1 - native);
270 bitmap1 - native - (bitmap2 - bitmap1));
277 ret |= compare("native", "���", "1 bitmap", native, le, bitmap1,
288 bitmap1 - native, approx, bitmap2 - native, skip);
295 bitmap1 - native, skip);
/linux-master/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-master/fs/ocfs2/
H A Dlocalalloc.c331 || alloc->id1.bitmap1.i_used
332 || alloc->id1.bitmap1.i_total
337 num_used, le32_to_cpu(alloc->id1.bitmap1.i_used),
338 le32_to_cpu(alloc->id1.bitmap1.i_total),
654 if (le32_to_cpu(alloc->id1.bitmap1.i_used) !=
658 le32_to_cpu(alloc->id1.bitmap1.i_used),
664 free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
665 le32_to_cpu(alloc->id1.bitmap1.i_used);
686 free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
687 le32_to_cpu(alloc->id1.bitmap1
[all...]
H A Dsuballoc.c730 le32_add_cpu(&fe->id1.bitmap1.i_used, le16_to_cpu(bg->bg_bits) -
732 le32_add_cpu(&fe->id1.bitmap1.i_total, le16_to_cpu(bg->bg_bits));
813 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
814 le32_to_cpu(fe->id1.bitmap1.i_used);
844 (le32_to_cpu(fe->id1.bitmap1.i_total)
845 - le32_to_cpu(fe->id1.bitmap1.i_used)));
1647 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1648 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1666 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1667 di->id1.bitmap1
[all...]
H A Dresize.c146 le32_add_cpu(&fe->id1.bitmap1.i_total, num_bits);
151 le32_add_cpu(&fe->id1.bitmap1.i_used, backups);
558 le32_add_cpu(&fe->id1.bitmap1.i_total, input->clusters *cl_bpc);
559 le32_add_cpu(&fe->id1.bitmap1.i_used,
H A Dioctl.c309 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total);
311 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total) -
312 le32_to_cpu(dinode_alloc->id1.bitmap1.i_used);
582 le32_to_cpu(gb_dinode->id1.bitmap1.i_total);
584 le32_to_cpu(gb_dinode->id1.bitmap1.i_used);
H A Docfs2_fs.h713 } bitmap1; member in union:ocfs2_dinode::__anon100
H A Dmove_extents.c403 (vict_blkno >= ((u64)le32_to_cpu(ac_dinode->id1.bitmap1.i_total) <<
H A Dsuper.c1641 numbits = le32_to_cpu(bm_lock->id1.bitmap1.i_total);
1642 freebits = numbits - le32_to_cpu(bm_lock->id1.bitmap1.i_used);
/linux-master/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,

Completed in 203 milliseconds