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/include/linux/
H A Dbitmap.h15 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
17 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
19 bool __bitmap_equal(const unsigned long *bitmap1,
22 bool __bitmap_intersects(const unsigned long *bitmap1,
/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/fs/ocfs2/
H A Dlocalalloc.c330 || alloc->id1.bitmap1.i_used
331 || alloc->id1.bitmap1.i_total
336 num_used, le32_to_cpu(alloc->id1.bitmap1.i_used),
337 le32_to_cpu(alloc->id1.bitmap1.i_total),
653 if (le32_to_cpu(alloc->id1.bitmap1.i_used) !=
657 le32_to_cpu(alloc->id1.bitmap1.i_used),
663 free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
664 le32_to_cpu(alloc->id1.bitmap1.i_used);
685 free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
686 le32_to_cpu(alloc->id1.bitmap1
[all...]
H A Dresize.c139 le32_add_cpu(&fe->id1.bitmap1.i_total, num_bits);
144 le32_add_cpu(&fe->id1.bitmap1.i_used, backups);
550 le32_add_cpu(&fe->id1.bitmap1.i_total, input->clusters *cl_bpc);
551 le32_add_cpu(&fe->id1.bitmap1.i_used,
H A Dsuballoc.c726 le32_add_cpu(&fe->id1.bitmap1.i_used, le16_to_cpu(bg->bg_bits) -
728 le32_add_cpu(&fe->id1.bitmap1.i_total, le16_to_cpu(bg->bg_bits));
809 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
810 le32_to_cpu(fe->id1.bitmap1.i_used);
840 (le32_to_cpu(fe->id1.bitmap1.i_total)
841 - le32_to_cpu(fe->id1.bitmap1.i_used)));
1595 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1596 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1614 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1615 di->id1.bitmap1
[all...]
H A Dioctl.c308 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total);
310 le32_to_cpu(dinode_alloc->id1.bitmap1.i_total) -
311 le32_to_cpu(dinode_alloc->id1.bitmap1.i_used);
581 le32_to_cpu(gb_dinode->id1.bitmap1.i_total);
583 le32_to_cpu(gb_dinode->id1.bitmap1.i_used);
H A Docfs2_fs.h713 } bitmap1; member in union:ocfs2_dinode::__anon125
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.h146 bool __bitmap_equal(const unsigned long *bitmap1,
160 bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
162 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
164 void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
166 bool __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
171 bool __bitmap_intersects(const unsigned long *bitmap1,
173 bool __bitmap_subset(const unsigned long *bitmap1,
176 unsigned int __bitmap_weight_and(const unsigned long *bitmap1,
178 unsigned int __bitmap_weight_andnot(const unsigned long *bitmap1,

Completed in 162 milliseconds