Home
last modified time | relevance | path

Searched refs:_n (Results 1 – 4 of 4) sorted by relevance

/lib/raid6/
A Dneon.c29 #define RAID6_NEON_WRAPPER(_n) \ argument
30 static void raid6_neon ## _n ## _gen_syndrome(int disks, \
33 void raid6_neon ## _n ## _gen_syndrome_real(int, \
36 raid6_neon ## _n ## _gen_syndrome_real(disks, \
40 static void raid6_neon ## _n ## _xor_syndrome(int disks, \
44 void raid6_neon ## _n ## _xor_syndrome_real(int, \
47 raid6_neon ## _n ## _xor_syndrome_real(disks, \
51 struct raid6_calls const raid6_neonx ## _n = { \
52 raid6_neon ## _n ## _gen_syndrome, \
53 raid6_neon ## _n ## _xor_syndrome, \
[all …]
A Drvv.h10 #define RAID6_RVV_WRAPPER(_n) \ argument
11 static void raid6_rvv ## _n ## _gen_syndrome(int disks, \
14 void raid6_rvv ## _n ## _gen_syndrome_real(int d, \
17 raid6_rvv ## _n ## _gen_syndrome_real(disks, \
21 static void raid6_rvv ## _n ## _xor_syndrome(int disks, \
25 void raid6_rvv ## _n ## _xor_syndrome_real(int d, \
29 raid6_rvv ## _n ## _xor_syndrome_real(disks, \
33 struct raid6_calls const raid6_rvvx ## _n = { \
34 raid6_rvv ## _n ## _gen_syndrome, \
35 raid6_rvv ## _n ## _xor_syndrome, \
[all …]
/lib/842/
A D842_compress.c123 struct sw842_hlist_node##b *_n; \
125 hash_for_each_possible(p->htable##b, _n, node, p->data##b[n]) { \
126 if (p->data##b[n] == _n->data) { \
127 p->index##b[n] = _n->index; \
140 struct sw842_hlist_node##b *_n = &(p)->node##b[(i)+(d)]; \
141 hash_del(&_n->node); \
142 _n->data = (p)->data##b[d]; \
144 (unsigned int)_n->index, \
146 (unsigned long)_n->data); \
147 hash_add((p)->htable##b, &_n->node, _n->data); \
/lib/
A Dtimerqueue.c17 #define __node_2_tq(_n) \ argument
18 rb_entry((_n), struct timerqueue_node, node)

Completed in 5 milliseconds