Home
last modified time | relevance | path

Searched refs:b (Results 1 – 25 of 185) sorted by relevance

12345678

/include/linux/
A Djhash.h38 b -= a; b ^= rol32(a, 6); a += c; \
39 c -= b; c ^= rol32(b, 8); b += a; \
41 b -= a; b ^= rol32(a, 19); a += c; \
42 c -= b; c ^= rol32(b, 4); b += a; \
48 c ^= b; c -= rol32(b, 14); \
50 b ^= a; b -= rol32(a, 25); \
51 c ^= b; c -= rol32(b, 16); \
53 b ^= a; b -= rol32(a, 14); \
54 c ^= b; c -= rol32(b, 24); \
72 u32 a, b, c; in jhash() local
[all …]
A Dsiphash.h35 u64 siphash_3u64(const u64 a, const u64 b, const u64 c,
40 u64 siphash_3u32(const u32 a, const u32 b, const u32 c,
43 static inline u64 siphash_2u32(const u32 a, const u32 b, in siphash_2u32() argument
46 return siphash_1u64((u64)b << 32 | a, key); in siphash_2u32()
102 u32 hsiphash_3u32(const u32 a, const u32 b, const u32 c,
146 #define SIPHASH_PERMUTATION(a, b, c, d) ( \ argument
147 (a) += (b), (b) = rol64((b), 13), (b) ^= (a), (a) = rol64((a), 32), \
150 (c) += (b), (b) = rol64((b), 17), (b) ^= (c), (c) = rol64((c), 32))
157 #define HSIPHASH_PERMUTATION(a, b, c, d) ( \ argument
158 (a) += (b), (b) = rol32((b), 5), (b) ^= (a), (a) = rol32((a), 16), \
[all …]
A Djiffies.h127 #define time_after(a,b) \ argument
130 ((long)((b) - (a)) < 0))
138 #define time_before(a,b) time_after(b,a) argument
150 ((long)((a) - (b)) >= 0))
158 #define time_before_eq(a,b) time_after_eq(b,a) argument
169 (time_after_eq(a,b) && \
181 (time_after_eq(a,b) && \
200 typecheck(__u64, b) && \
212 #define time_before64(a,b) time_after64(b,a) argument
226 typecheck(__u64, b) && \
[all …]
A Dhid-debug.h40 #define hid_dump_input(a,b,c) do { } while (0) argument
41 #define hid_dump_report(a,b,c,d) do { } while (0) argument
42 #define hid_dump_device(a,b) do { } while (0) argument
43 #define hid_dump_field(a,b,c) do { } while (0) argument
44 #define hid_resolv_usage(a,b) do { } while (0) argument
45 #define hid_debug_register(a, b) do { } while (0) argument
49 #define hid_debug_event(a,b) do { } while (0) argument
A Dtnum.h40 struct tnum tnum_add(struct tnum a, struct tnum b);
42 struct tnum tnum_sub(struct tnum a, struct tnum b);
46 struct tnum tnum_and(struct tnum a, struct tnum b);
48 struct tnum tnum_or(struct tnum a, struct tnum b);
50 struct tnum tnum_xor(struct tnum a, struct tnum b);
52 struct tnum tnum_mul(struct tnum a, struct tnum b);
55 struct tnum tnum_intersect(struct tnum a, struct tnum b);
67 static inline bool tnum_equals_const(struct tnum a, u64 b) in tnum_equals_const() argument
69 return tnum_is_const(a) && a.value == b; in tnum_equals_const()
95 bool tnum_in(struct tnum a, struct tnum b);
A Dlibgcc.h30 long long notrace __ashldi3(long long u, word_type b);
31 long long notrace __ashrdi3(long long u, word_type b);
32 word_type notrace __cmpdi2(long long a, long long b);
33 long long notrace __lshrdi3(long long u, word_type b);
35 word_type notrace __ucmpdi2(unsigned long long a, unsigned long long b);
A Dtty_buffer.h25 static inline u8 *char_buf_ptr(struct tty_buffer *b, unsigned int ofs) in char_buf_ptr() argument
27 return b->data + ofs; in char_buf_ptr()
30 static inline u8 *flag_buf_ptr(struct tty_buffer *b, unsigned int ofs) in flag_buf_ptr() argument
32 return char_buf_ptr(b, ofs) + b->size; in flag_buf_ptr()
A Dmin_heap.h97 *(u32 *)(b + n) = t; in swap_words_32()
152 ((char *)b)[n] = t; in swap_bytes()
265 size_t b, c, d; in __min_heap_sift_down_inline() local
272 for (b = a; c = 2 * b + elem_size, (d = c + elem_size) < n;) in __min_heap_sift_down_inline()
277 b = c; in __min_heap_sift_down_inline()
280 while (b != a && func->less(data + a, data + b, args)) in __min_heap_sift_down_inline()
281 b = parent(b, lsbit, elem_size); in __min_heap_sift_down_inline()
284 c = b; in __min_heap_sift_down_inline()
285 while (b != a) { in __min_heap_sift_down_inline()
286 b = parent(b, lsbit, elem_size); in __min_heap_sift_down_inline()
[all …]
A Dargs.h25 #define __CONCAT(a, b) a ## b argument
26 #define CONCATENATE(a, b) __CONCAT(a, b) argument
A Doverflow.h67 #define check_add_overflow(a, b, d) \ argument
79 #define wrapping_add(type, a, b) \ argument
82 __builtin_add_overflow(a, b, &__val); \
113 #define check_sub_overflow(a, b, d) \ argument
125 #define wrapping_sub(type, a, b) \ argument
128 __builtin_sub_overflow(a, b, &__val); \
159 #define check_mul_overflow(a, b, d) \ argument
171 #define wrapping_mul(type, a, b) \ argument
174 __builtin_mul_overflow(a, b, &__val); \
327 #define array_size(a, b) size_mul(a, b) argument
[all …]
A Ddm-bufio.h100 void dm_bufio_release(struct dm_buffer *b);
110 void dm_bufio_mark_buffer_dirty(struct dm_buffer *b);
118 void dm_bufio_mark_partial_buffer_dirty(struct dm_buffer *b,
164 sector_t dm_bufio_get_block_number(struct dm_buffer *b);
165 void *dm_bufio_get_block_data(struct dm_buffer *b);
166 void *dm_bufio_get_aux_data(struct dm_buffer *b);
167 struct dm_bufio_client *dm_bufio_get_client(struct dm_buffer *b);
A Duuid.h16 __u8 b[UUID_SIZE]; member
20 __u8 b[UUID_SIZE]; member
23 #define GUID_INIT(a, b, c, d0, d1, d2, d3, d4, d5, d6, d7) \ argument
26 (b) & 0xff, ((b) >> 8) & 0xff, \
30 #define UUID_INIT(a, b, c, d0, d1, d2, d3, d4, d5, d6, d7) \ argument
33 ((b) >> 8) & 0xff, (b) & 0xff, \
/include/asm-generic/bitops/
A Dsched.h13 static inline int sched_find_first_bit(const unsigned long *b) in sched_find_first_bit() argument
16 if (b[0]) in sched_find_first_bit()
17 return __ffs(b[0]); in sched_find_first_bit()
18 return __ffs(b[1]) + 64; in sched_find_first_bit()
20 if (b[0]) in sched_find_first_bit()
21 return __ffs(b[0]); in sched_find_first_bit()
22 if (b[1]) in sched_find_first_bit()
23 return __ffs(b[1]) + 32; in sched_find_first_bit()
24 if (b[2]) in sched_find_first_bit()
25 return __ffs(b[2]) + 64; in sched_find_first_bit()
[all …]
/include/linux/mtd/
A Dftl.h63 #define BLOCK_FREE(b) ((b) == 0xffffffff) argument
64 #define BLOCK_DELETED(b) (((b) == 0) || ((b) == 0xfffffffe)) argument
66 #define BLOCK_TYPE(b) ((b) & 0x7f) argument
67 #define BLOCK_ADDRESS(b) ((b) & ~0x7f) argument
68 #define BLOCK_NUMBER(b) ((b) >> 9) argument
/include/crypto/
A Dgf128mul.h163 void gf128mul_lle(be128 *a, const be128 *b);
183 u64 b = be64_to_cpu(x->b); in gf128mul_x_lle() local
187 u64 _tt = gf128mul_mask_from_bit(b, 0) & ((u64)0xe1 << 56); in gf128mul_x_lle()
189 r->b = cpu_to_be64((b >> 1) | (a << 63)); in gf128mul_x_lle()
196 u64 b = be64_to_cpu(x->b); in gf128mul_x_bbe() local
201 r->a = cpu_to_be64((a << 1) | (b >> 63)); in gf128mul_x_bbe()
202 r->b = cpu_to_be64((b << 1) ^ _tt); in gf128mul_x_bbe()
209 u64 b = le64_to_cpu(x->b); in gf128mul_x_ble() local
214 r->a = cpu_to_le64((a << 1) | (b >> 63)); in gf128mul_x_ble()
215 r->b = cpu_to_le64((b << 1) ^ _tt); in gf128mul_x_ble()
A Db128ops.h53 __be64 a, b; member
57 __le64 b, a; member
63 r->b = p->b ^ q->b; in be128_xor()
69 r->b = p->b ^ q->b; in le128_xor()
/include/linux/ceph/
A Dbuffer.h25 static inline struct ceph_buffer *ceph_buffer_get(struct ceph_buffer *b) in ceph_buffer_get() argument
27 kref_get(&b->kref); in ceph_buffer_get()
28 return b; in ceph_buffer_get()
31 static inline void ceph_buffer_put(struct ceph_buffer *b) in ceph_buffer_put() argument
33 if (b) in ceph_buffer_put()
34 kref_put(&b->kref, ceph_buffer_release); in ceph_buffer_put()
37 extern int ceph_decode_buffer(struct ceph_buffer **b, void **p, void *end);
/include/net/
A Dcodel.h76 #define codel_time_after(a, b) \ argument
78 typecheck(codel_time_t, b) && \
79 ((s32)((a) - (b)) > 0))
80 #define codel_time_before(a, b) codel_time_after(b, a) argument
82 #define codel_time_after_eq(a, b) \ argument
84 typecheck(codel_time_t, b) && \
85 ((s32)((a) - (b)) >= 0))
86 #define codel_time_before_eq(a, b) codel_time_after_eq(b, a) argument
/include/trace/events/
A Dtlb.h24 #define EM(a,b) TRACE_DEFINE_ENUM(a); argument
25 #define EMe(a,b) TRACE_DEFINE_ENUM(a); argument
35 #define EM(a,b) { a, b }, argument
36 #define EMe(a,b) { a, b } argument
A Derror_report.h35 #define EM(a, b) TRACE_DEFINE_ENUM(a); argument
36 #define EMe(a, b) TRACE_DEFINE_ENUM(a); argument
43 #define EM(a, b) { a, b }, argument
44 #define EMe(a, b) { a, b } argument
/include/asm-generic/
A Dvideo.h79 static inline void fb_writeb(u8 b, volatile void __iomem *addr) in fb_writeb() argument
81 __raw_writeb(b, addr); in fb_writeb()
87 static inline void fb_writew(u16 b, volatile void __iomem *addr) in fb_writew() argument
89 __raw_writew(b, addr); in fb_writew()
95 static inline void fb_writel(u32 b, volatile void __iomem *addr) in fb_writel() argument
97 __raw_writel(b, addr); in fb_writel()
104 static inline void fb_writeq(u64 b, volatile void __iomem *addr) in fb_writeq() argument
106 __raw_writeq(b, addr); in fb_writeq()
/include/vdso/
A Dmath64.h27 static __always_inline u64 mul_u64_u32_add_u64_shr(u64 a, u32 mul, u64 b, unsigned int shift) in mul_u64_u32_add_u64_shr() argument
29 return (u64)((((unsigned __int128)a * mul) + b) >> shift); in mul_u64_u32_add_u64_shr()
37 static inline u64 mul_u32_u32(u32 a, u32 b) in mul_u32_u32() argument
39 return (u64)a * b; in mul_u32_u32()
43 static __always_inline u64 mul_u64_u32_add_u64_shr(u64 a, u32 mul, u64 b, unsigned int shift) in mul_u64_u32_add_u64_shr() argument
49 ovf = __builtin_add_overflow(mul_u32_u32(al, mul), b, &ret); in mul_u64_u32_add_u64_shr()
/include/uapi/linux/
A Dmei_uuid.h15 __u8 b[16]; member
18 #define UUID_LE(a, b, c, d0, d1, d2, d3, d4, d5, d6, d7) \ argument
21 (b) & 0xff, ((b) >> 8) & 0xff, \
A Dcxl_mem.h55 #define ___C(a, b) CXL_MEM_COMMAND_ID_##a argument
56 #define ___DEPRECATED(a, b) CXL_MEM_DEPRECATED_ID_##a argument
61 #define ___C(a, b) { b } argument
62 #define ___DEPRECATED(a, b) { "Deprecated " b } argument
79 #define ___C(a, b) (0) argument
80 #define ___DEPRECATED(a, b) (1) argument
/include/linux/crush/
A Dhash.h18 extern __u32 crush_hash32_2(int type, __u32 a, __u32 b);
19 extern __u32 crush_hash32_3(int type, __u32 a, __u32 b, __u32 c);
20 extern __u32 crush_hash32_4(int type, __u32 a, __u32 b, __u32 c, __u32 d);
21 extern __u32 crush_hash32_5(int type, __u32 a, __u32 b, __u32 c, __u32 d,

Completed in 52 milliseconds

12345678