Searched refs:BITS_PER_LONG (Results 251 - 275 of 558) sorted by relevance
<<11121314151617181920>>
/linux-master/include/linux/ |
H A D | xarray.h | 45 #define BITS_PER_XA_VALUE (BITS_PER_LONG - 1) 1149 #define XA_MARK_LONGS DIV_ROUND_UP(XA_CHUNK_SIZE, BITS_PER_LONG) 1648 xas->xa_index = order < BITS_PER_LONG ? (index >> order) << order : 0; 1721 if (XA_CHUNK_SIZE == BITS_PER_LONG) {
|
/linux-master/arch/m68k/mm/ |
H A D | mcfmmu.c | 28 unsigned long context_map[LAST_CONTEXT / BITS_PER_LONG + 1];
|
/linux-master/arch/powerpc/include/asm/ |
H A D | bitops.h | 46 #define PPC_BITLSHIFT(be) (BITS_PER_LONG - 1 - (be))
|
/linux-master/drivers/infiniband/core/ |
H A D | umem.c | 104 GENMASK(BITS_PER_LONG - 1,
|
/linux-master/drivers/gpu/drm/i915/ |
H A D | intel_wakeref.h | 162 GENMASK(BITS_PER_LONG - 1, __INTEL_WAKEREF_PUT_LAST_BIT__)
|
/linux-master/include/linux/i3c/ |
H A D | master.h | 342 unsigned long addrslots[((I2C_MAX_ADDR + 1) * 2) / BITS_PER_LONG];
|
/linux-master/fs/ |
H A D | pidfs.c | 127 #if BITS_PER_LONG == 32
|
H A D | select.c | 428 set = ~(~0UL << (n & (BITS_PER_LONG-1))); 429 n /= BITS_PER_LONG; 456 max += n * BITS_PER_LONG; 523 i += BITS_PER_LONG; 527 for (j = 0; j < BITS_PER_LONG; ++j, ++i, bit <<= 1) {
|
/linux-master/lib/ |
H A D | generic-radix-tree.c | 36 DIV_ROUND_UP(BITS_PER_LONG - GENRADIX_NODE_SHIFT, GENRADIX_ARY_SHIFT)
|
/linux-master/arch/powerpc/kexec/ |
H A D | core.c | 210 #define cpu_to_be_ulong __PASTE(cpu_to_be, BITS_PER_LONG)
|
/linux-master/arch/riscv/include/asm/ |
H A D | vector.h | 151 unsigned long vl, vtype_inval = 1UL << (BITS_PER_LONG - 1);
|
/linux-master/arch/riscv/kvm/ |
H A D | vcpu_onereg.c | 625 for (i = 0; i < BITS_PER_LONG; i++) { 626 ext_id = i + reg_num * BITS_PER_LONG; 648 for_each_set_bit(i, ®_val, BITS_PER_LONG) { 649 ext_id = i + reg_num * BITS_PER_LONG;
|
H A D | vcpu_pmu.c | 174 for_each_set_bit(i, &cmask, BITS_PER_LONG) { 604 pmc->cinfo.width = BITS_PER_LONG - 1;
|
/linux-master/arch/x86/kvm/vmx/ |
H A D | vmenter.S | 12 #define WORD_SIZE (BITS_PER_LONG / 8)
|
/linux-master/fs/bcachefs/ |
H A D | btree_iter.h | 85 unsigned long *w = trans->paths_allocated + *idx / BITS_PER_LONG; 89 * - and we know that nr_paths is a multiple of BITS_PER_LONG, 92 unsigned long v = *w >> (*idx & (BITS_PER_LONG - 1)); 98 *idx += BITS_PER_LONG; 99 *idx &= ~(BITS_PER_LONG - 1);
|
/linux-master/fs/btrfs/ |
H A D | messages.c | 257 #if BITS_PER_LONG == 32
|
/linux-master/net/netlink/ |
H A D | genetlink.c | 408 BITS_PER_LONG); 411 mc_groups_longs * BITS_PER_LONG, 417 mc_groups_longs * BITS_PER_LONG); 426 if (id + n_groups > mc_groups_longs * BITS_PER_LONG) { 510 mc_groups_longs * BITS_PER_LONG); 525 mc_groups_longs * BITS_PER_LONG);
|
/linux-master/scripts/mod/ |
H A D | file2alias.c | 20 #define BITS_PER_LONG 32 macro 23 #define BITS_PER_LONG 64 macro 743 for (i = min / BITS_PER_LONG; i < max / BITS_PER_LONG + 1; i++) 746 if (arr[i / BITS_PER_LONG] & (1L << (i%BITS_PER_LONG)))
|
/linux-master/drivers/gpio/ |
H A D | gpio-winbond.c | 357 for_each_set_bit(i, ¶ms.gpios, BITS_PER_LONG) { 575 for_each_set_bit(i, ¶ms.gpios, BITS_PER_LONG)
|
/linux-master/fs/ocfs2/ |
H A D | ocfs2.h | 888 #if BITS_PER_LONG == 64 891 #elif BITS_PER_LONG == 32
|
/linux-master/kernel/time/ |
H A D | time.c | 384 # if BITS_PER_LONG == 32 411 # if BITS_PER_LONG == 32
|
/linux-master/lib/crypto/mpi/ |
H A D | mpicoder.c | 55 nbits -= count_leading_zeros(buffer[0]) - (BITS_PER_LONG - 8); 484 nbits -= count_leading_zeros(*buff) - (BITS_PER_LONG - 8);
|
/linux-master/drivers/md/bcache/ |
H A D | util.h | 294 #if BITS_PER_LONG == 32 303 #if BITS_PER_LONG == 32
|
/linux-master/arch/x86/kernel/ |
H A D | unwind_orc.c | 71 printk_deferred("%0*lx: %0*lx (%pB)\n", BITS_PER_LONG/4, 72 (unsigned long)sp, BITS_PER_LONG/4,
|
/linux-master/drivers/scsi/lpfc/ |
H A D | lpfc_mem.c | 81 bytes = ((BITS_PER_LONG - 1 + max_xri) / BITS_PER_LONG) *
|
Completed in 248 milliseconds
<<11121314151617181920>>