arch/alpha/math-emu/sfp-util.h
21
#define udiv_qrnnd(q, r, n1, n0, d) \
arch/alpha/math-emu/sfp-util.h
23
(q) = __udiv_qrnnd (&__r, (n1), (n0), (d)); \
arch/m68k/include/asm/uaccess.h
190
#define ____constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)\
arch/m68k/include/asm/uaccess.h
216
"10: addq.l #"#n1",%0\n" \
arch/m68k/include/asm/uaccess.h
228
#define ___constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)\
arch/m68k/include/asm/uaccess.h
229
____constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)
arch/m68k/include/asm/uaccess.h
230
#define __constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3) \
arch/m68k/include/asm/uaccess.h
231
___constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, \
arch/m68k/include/asm/uaccess.h
232
__suffix##n1, __suffix##n2, __suffix##n3)
arch/mips/bcm63xx/cpu.c
164
unsigned int tmp, n1, n2, m1;
arch/mips/bcm63xx/cpu.c
168
n1 = (tmp & MIPSPLLCTL_N1_MASK) >> MIPSPLLCTL_N1_SHIFT;
arch/mips/bcm63xx/cpu.c
171
n1 += 1;
arch/mips/bcm63xx/cpu.c
174
return (16 * 1000000 * n1 * n2) / m1;
arch/mips/bcm63xx/cpu.c
179
unsigned int tmp, n1, n2, m1;
arch/mips/bcm63xx/cpu.c
183
n1 = (tmp & DMIPSPLLCFG_N1_MASK) >> DMIPSPLLCFG_N1_SHIFT;
arch/mips/bcm63xx/cpu.c
186
return (16 * 1000000 * n1 * n2) / m1;
arch/mips/include/asm/mach-bcm63xx/bcm63xx_regs.h
402
#define ADSLPLLCTL_VAL(n1, n2, m1ref, m2ref, m1cpu, m1bus, m2bus) \
arch/mips/include/asm/mach-bcm63xx/bcm63xx_regs.h
403
(((n1) << ADSLPLLCTL_N1_SHIFT) | \
arch/powerpc/include/asm/sfp-machine.h
280
#define udiv_qrnnd(q, r, n1, n0, d) \
arch/powerpc/include/asm/sfp-machine.h
287
__r1 = (n1) % __d1; \
arch/powerpc/include/asm/sfp-machine.h
288
__q1 = (n1) / __d1; \
arch/powerpc/math-emu/udivmodti4.c
102
udiv_qrnnd (q1, n1, n2, n1, d0);
arch/powerpc/math-emu/udivmodti4.c
107
udiv_qrnnd (q0, n0, n1, n0, d0);
arch/powerpc/math-emu/udivmodti4.c
11
_FP_W_TYPE n1, _FP_W_TYPE n0,
arch/powerpc/math-emu/udivmodti4.c
118
if (d1 > n1)
arch/powerpc/math-emu/udivmodti4.c
127
r1 = n1;
arch/powerpc/math-emu/udivmodti4.c
144
if (n1 > d1 || n0 >= d0)
arch/powerpc/math-emu/udivmodti4.c
147
sub_ddmmss (n1, n0, n1, n0, d1, d0);
arch/powerpc/math-emu/udivmodti4.c
155
r1 = n1;
arch/powerpc/math-emu/udivmodti4.c
167
n2 = n1 >> b;
arch/powerpc/math-emu/udivmodti4.c
168
n1 = (n1 << bm) | (n0 >> b);
arch/powerpc/math-emu/udivmodti4.c
171
udiv_qrnnd (q0, n1, n2, n1, d1);
arch/powerpc/math-emu/udivmodti4.c
174
if (m1 > n1 || (m1 == n1 && m0 > n0))
arch/powerpc/math-emu/udivmodti4.c
183
sub_ddmmss (n1, n0, n1, n0, m1, m0);
arch/powerpc/math-emu/udivmodti4.c
184
r0 = (n1 << b) | (n0 >> bm);
arch/powerpc/math-emu/udivmodti4.c
185
r1 = n1 >> bm;
arch/powerpc/math-emu/udivmodti4.c
20
if (d0 > n1)
arch/powerpc/math-emu/udivmodti4.c
24
udiv_qrnnd (q0, n0, n1, n0, d0);
arch/powerpc/math-emu/udivmodti4.c
36
udiv_qrnnd (q1, n1, 0, n1, d0);
arch/powerpc/math-emu/udivmodti4.c
37
udiv_qrnnd (q0, n0, n1, n0, d0);
arch/powerpc/math-emu/udivmodti4.c
47
if (d0 > n1)
arch/powerpc/math-emu/udivmodti4.c
59
n1 = (n1 << bm) | (n0 >> (_FP_W_TYPE_SIZE - bm));
arch/powerpc/math-emu/udivmodti4.c
63
udiv_qrnnd (q0, n0, n1, n0, d0);
arch/powerpc/math-emu/udivmodti4.c
86
n1 -= d0;
arch/powerpc/math-emu/udivmodti4.c
98
n2 = n1 >> b;
arch/powerpc/math-emu/udivmodti4.c
99
n1 = (n1 << bm) | (n0 >> b);
arch/powerpc/platforms/ps3/repository.c
1049
static int create_node(u64 n1, u64 n2, u64 n3, u64 n4, u64 v1, u64 v2)
arch/powerpc/platforms/ps3/repository.c
1053
dump_node(0, n1, n2, n3, n4, v1, v2);
arch/powerpc/platforms/ps3/repository.c
1055
result = lv1_create_repository_node(n1, n2, n3, n4, v1, v2);
arch/powerpc/platforms/ps3/repository.c
1066
static int delete_node(u64 n1, u64 n2, u64 n3, u64 n4)
arch/powerpc/platforms/ps3/repository.c
1070
dump_node(0, n1, n2, n3, n4, 0, 0);
arch/powerpc/platforms/ps3/repository.c
1072
result = lv1_delete_repository_node(n1, n2, n3, n4);
arch/powerpc/platforms/ps3/repository.c
1083
static int write_node(u64 n1, u64 n2, u64 n3, u64 n4, u64 v1, u64 v2)
arch/powerpc/platforms/ps3/repository.c
1087
result = create_node(n1, n2, n3, n4, v1, v2);
arch/powerpc/platforms/ps3/repository.c
109
static int read_node(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, u64 n4,
arch/powerpc/platforms/ps3/repository.c
1092
result = lv1_write_repository_node(n1, n2, n3, n4, v1, v2);
arch/powerpc/platforms/ps3/repository.c
122
result = lv1_read_repository_node(lpar_id, n1, n2, n3, n4, &v1,
arch/powerpc/platforms/ps3/repository.c
128
dump_node_name(lpar_id, n1, n2, n3, n4);
arch/powerpc/platforms/ps3/repository.c
132
dump_node(lpar_id, n1, n2, n3, n4, v1, v2);
arch/powerpc/platforms/ps3/repository.c
41
static void _dump_node_name(unsigned int lpar_id, u64 n1, u64 n2, u64 n3,
arch/powerpc/platforms/ps3/repository.c
45
_dump_field("n1: ", n1, func, line);
arch/powerpc/platforms/ps3/repository.c
53
static void _dump_node(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, u64 n4,
arch/powerpc/platforms/ps3/repository.c
57
_dump_field("n1: ", n1, func, line);
arch/riscv/kvm/vcpu_onereg.c
928
int n1 = sizeof(struct kvm_riscv_csr) / sizeof(unsigned long);
arch/riscv/kvm/vcpu_onereg.c
932
for (int i = 0; i < n1; i++) {
arch/riscv/kvm/vcpu_onereg.c
981
return n1 + n2 + n3;
arch/sh/math-emu/sfp-util.h
32
#define udiv_qrnnd(q, r, n1, n0, d) \
arch/sh/math-emu/sfp-util.h
39
__r1 = (n1) % __d1; \
arch/sh/math-emu/sfp-util.h
40
__q1 = (n1) / __d1; \
arch/sparc/math-emu/sfp-util_32.h
105
"1" ((USItype)(n1)), \
arch/sparc/math-emu/sfp-util_32.h
77
#define udiv_qrnnd(q, r, n1, n0, d) \
arch/sparc/math-emu/sfp-util_64.h
76
#define udiv_qrnnd(q, r, n1, n0, d) \
arch/sparc/math-emu/sfp-util_64.h
82
__r1 = (n1) % __d1; \
arch/sparc/math-emu/sfp-util_64.h
83
__q1 = (n1) / __d1; \
crypto/rsa.c
29
MPI n1;
crypto/rsa.c
34
n1 = mpi_alloc(0);
crypto/rsa.c
35
if (!n1)
crypto/rsa.c
38
if (mpi_sub_ui(n1, n, 1) || mpi_cmp(x, n1) >= 0) {
crypto/rsa.c
39
mpi_free(n1);
crypto/rsa.c
43
mpi_free(n1);
drivers/clk/baikal-t1/ccu-pll.c
172
unsigned long num, denom, n1, d1, nri;
drivers/clk/baikal-t1/ccu-pll.c
209
n1 = nf_max;
drivers/clk/baikal-t1/ccu-pll.c
212
n1 = 1;
drivers/clk/baikal-t1/ccu-pll.c
216
&n1, &d1);
drivers/clk/baikal-t1/ccu-pll.c
220
freq = ccu_pll_calc_freq(parent_rate, nri, n1, d1);
drivers/clk/baikal-t1/ccu-pll.c
225
*nf = n1;
drivers/clk/clk-si570.c
100
unsigned int *n1, unsigned int *hs_div)
drivers/clk/clk-si570.c
112
*n1 = ((reg[0] & N1_6_2_MASK) << 2) + ((reg[1] & N1_1_0_MASK) >> 6) + 1;
drivers/clk/clk-si570.c
114
if (*n1 > 1)
drivers/clk/clk-si570.c
115
*n1 &= ~1;
drivers/clk/clk-si570.c
144
err = si570_get_divs(data, &data->rfreq, &data->n1, &data->hs_div);
drivers/clk/clk-si570.c
152
fdco = fout * data->n1 * data->hs_div;
drivers/clk/clk-si570.c
172
reg[0] = ((data->n1 - 1) << 6) |
drivers/clk/clk-si570.c
199
unsigned int n1, hs_div;
drivers/clk/clk-si570.c
206
n1 = div_u64(div_u64(FDCO_MIN, hs_div), frequency);
drivers/clk/clk-si570.c
207
if (!n1 || (n1 & 1))
drivers/clk/clk-si570.c
208
n1++;
drivers/clk/clk-si570.c
209
while (n1 <= 128) {
drivers/clk/clk-si570.c
210
fdco = (u64)frequency * (u64)hs_div * (u64)n1;
drivers/clk/clk-si570.c
214
*out_n1 = n1;
drivers/clk/clk-si570.c
219
n1 += (n1 == 1 ? 1 : 2);
drivers/clk/clk-si570.c
234
unsigned int n1, hs_div;
drivers/clk/clk-si570.c
237
err = si570_get_divs(data, &rfreq, &n1, &hs_div);
drivers/clk/clk-si570.c
243
rfreq = div_u64(rfreq, hs_div * n1);
drivers/clk/clk-si570.c
254
unsigned int n1, hs_div;
drivers/clk/clk-si570.c
268
n1 = data->n1;
drivers/clk/clk-si570.c
272
err = si570_calc_divs(req->rate, data, &rfreq, &n1, &hs_div);
drivers/clk/clk-si570.c
297
err = si570_calc_divs(frequency, data, &data->rfreq, &data->n1,
drivers/clk/clk-si570.c
309
(((data->n1 - 1) >> 2) & N1_6_2_MASK));
drivers/clk/clk-si570.c
81
unsigned int n1;
drivers/clk/meson/a1-peripherals.c
1646
.n1 = {
drivers/clk/meson/a1-peripherals.c
172
.n1 = 733,
drivers/clk/meson/a1-peripherals.c
1753
.n1 = {
drivers/clk/meson/a1-peripherals.c
182
.n1 = {
drivers/clk/meson/axg-aoclk.c
84
.n1 = 733,
drivers/clk/meson/axg-aoclk.c
93
.n1 = {
drivers/clk/meson/c3-peripherals.c
82
.n1 = {
drivers/clk/meson/clk-dualdiv.c
120
meson_parm_write(clk->map, &dualdiv->n1, setting->n1 - 1);
drivers/clk/meson/clk-dualdiv.c
41
return DIV_ROUND_CLOSEST(parent_rate, p->n1);
drivers/clk/meson/clk-dualdiv.c
44
p->n1 * p->m1 + p->n2 * p->m2);
drivers/clk/meson/clk-dualdiv.c
55
setting.n1 = meson_parm_read(clk->map, &dualdiv->n1) + 1;
drivers/clk/meson/clk-dualdiv.c
74
for (i = 0; table[i].n1; i++) {
drivers/clk/meson/clk-dualdiv.h
14
unsigned int n1;
drivers/clk/meson/clk-dualdiv.h
22
struct parm n1;
drivers/clk/meson/g12a-aoclk.c
115
.n1 = {
drivers/clk/meson/g12a-aoclk.c
206
.n1 = {
drivers/clk/meson/g12a-aoclk.c
89
.n1 = 733,
drivers/clk/meson/gxbb-aoclk.c
70
.n1 = 733,
drivers/clk/meson/gxbb-aoclk.c
79
.n1 = {
drivers/clk/meson/s4-peripherals.c
103
.n1 = {
drivers/clk/meson/s4-peripherals.c
339
.n1 = {
drivers/clk/meson/s4-peripherals.c
446
.n1 = {
drivers/clk/meson/s4-peripherals.c
93
.n1 = 733,
drivers/clk/meson/t7-peripherals.c
196
.n1 = {
drivers/clk/meson/t7-peripherals.c
302
.n1 = {
drivers/clk/meson/t7-peripherals.c
76
.n1 = 733, .m1 = 8,
drivers/clk/meson/t7-peripherals.c
85
.n1 = {
drivers/crypto/stm32/stm32-cryp.c
453
u8 n1;
drivers/crypto/stm32/stm32-cryp.c
458
n1 = ((b & R_SHIFT_4_MASK) >> 4) | (b & ~(R_SHIFT_4_MASK >> 4));
drivers/crypto/stm32/stm32-cryp.c
460
n1 = ((n1 & R_SHIFT_2_MASK) >> 2) | (n1 & ~(R_SHIFT_2_MASK >> 2));
drivers/crypto/stm32/stm32-cryp.c
462
n1 = (n1 & R_SHIFT_1_MASK) >> 1;
drivers/crypto/stm32/stm32-cryp.c
472
return n1 | n2;
drivers/gpu/drm/solomon/ssd130x.c
879
u8 n1 = buf[i * width + j];
drivers/gpu/drm/solomon/ssd130x.c
882
data_array[array_idx++] = (n2 & 0xf0) | (n1 >> 4);
drivers/hid/hid-core.c
2691
int n1 = strrchr(hdev_a->phys, separator) - hdev_a->phys;
drivers/hid/hid-core.c
2694
if (n1 != n2 || n1 <= 0 || n2 <= 0)
drivers/hid/hid-core.c
2697
return !strncmp(hdev_a->phys, hdev_b->phys, n1);
drivers/md/bcache/btree.c
1405
struct bset *n1 = btree_bset_first(new_nodes[i]);
drivers/md/bcache/btree.c
1415
if (__set_blocks(n1, n1->keys + keys +
drivers/md/bcache/btree.c
1432
if (__set_blocks(n1, n1->keys + n2->keys,
drivers/md/bcache/btree.c
1442
BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c->cache)) >
drivers/md/bcache/btree.c
1448
memcpy(bset_bkey_last(n1),
drivers/md/bcache/btree.c
1452
n1->keys += keys;
drivers/md/bcache/btree.c
1453
r[i].keys = n1->keys;
drivers/md/bcache/btree.c
2242
struct btree *n1, *n2 = NULL, *n3 = NULL;
drivers/md/bcache/btree.c
2257
n1 = btree_node_alloc_replacement(b, op);
drivers/md/bcache/btree.c
2258
if (IS_ERR(n1))
drivers/md/bcache/btree.c
2261
split = set_blocks(btree_bset_first(n1),
drivers/md/bcache/btree.c
2262
block_bytes(n1->c->cache)) > (btree_blocks(b) * 4) / 5;
drivers/md/bcache/btree.c
2267
trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys);
drivers/md/bcache/btree.c
2279
mutex_lock(&n1->write_lock);
drivers/md/bcache/btree.c
2282
bch_btree_insert_keys(n1, op, insert_keys, replace_key);
drivers/md/bcache/btree.c
2289
while (keys < (btree_bset_first(n1)->keys * 3) / 5)
drivers/md/bcache/btree.c
2290
keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1),
drivers/md/bcache/btree.c
2293
bkey_copy_key(&n1->key,
drivers/md/bcache/btree.c
2294
bset_bkey_idx(btree_bset_first(n1), keys));
drivers/md/bcache/btree.c
2295
keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys));
drivers/md/bcache/btree.c
2297
btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys;
drivers/md/bcache/btree.c
2298
btree_bset_first(n1)->keys = keys;
drivers/md/bcache/btree.c
2301
bset_bkey_last(btree_bset_first(n1)),
drivers/md/bcache/btree.c
2311
trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys);
drivers/md/bcache/btree.c
2313
mutex_lock(&n1->write_lock);
drivers/md/bcache/btree.c
2314
bch_btree_insert_keys(n1, op, insert_keys, replace_key);
drivers/md/bcache/btree.c
2317
bch_keylist_add(&parent_keys, &n1->key);
drivers/md/bcache/btree.c
2318
bch_btree_node_write(n1, &cl);
drivers/md/bcache/btree.c
2319
mutex_unlock(&n1->write_lock);
drivers/md/bcache/btree.c
2335
bch_btree_set_root(n1);
drivers/md/bcache/btree.c
2347
rw_unlock(true, n1);
drivers/md/bcache/btree.c
2357
bkey_put(b->c, &n1->key);
drivers/md/bcache/btree.c
2358
btree_node_free(n1);
drivers/md/bcache/btree.c
2359
rw_unlock(true, n1);
drivers/md/bcache/btree.c
2365
n1 == ERR_PTR(-EAGAIN))
drivers/media/cec/platform/meson/ao-cec-g12a.c
228
unsigned long n1;
drivers/media/cec/platform/meson/ao-cec-g12a.c
240
n1 = FIELD_GET(CECB_CLK_CNTL_N1, reg0) + 1;
drivers/media/cec/platform/meson/ao-cec-g12a.c
246
f1 = DIV_ROUND_CLOSEST(parent_rate, n1);
drivers/media/cec/platform/meson/ao-cec-g12a.c
255
n1 = FIELD_GET(CECB_CLK_CNTL_N1, reg0) + 1;
drivers/media/cec/platform/meson/ao-cec-g12a.c
257
return DIV_ROUND_CLOSEST(parent_rate, n1);
drivers/media/pci/cobalt/cobalt-cpld.c
124
unsigned mult, hsdiv, n1;
drivers/media/pci/cobalt/cobalt-cpld.c
236
u8 n1, hsdiv;
drivers/media/pci/cobalt/cobalt-cpld.c
258
n1 = multipliers[i_best].n1 - 1;
drivers/media/pci/cobalt/cobalt-cpld.c
264
regs[0] = (hsdiv << 5) | (n1 >> 2);
drivers/media/pci/cobalt/cobalt-cpld.c
265
regs[1] = ((n1 & 0x3) << 6) | (rfreq >> 32);
drivers/media/tuners/mc44s803.c
205
u32 r1, r2, n1, n2, lo1, lo2, freq, val;
drivers/media/tuners/mc44s803.c
213
n1 = (c->frequency + MC44S803_IF1 + 500000) / 1000000;
drivers/media/tuners/mc44s803.c
214
freq = MC44S803_OSC / r1 * n1;
drivers/media/tuners/mc44s803.c
215
lo1 = ((60 * n1) + (r1 / 2)) / r1;
drivers/media/tuners/mc44s803.c
234
MC44S803_REG_SM(n1-2, MC44S803_LO1);
drivers/media/tuners/mt20xx.c
71
int n1=1,n2,f;
drivers/media/tuners/mt20xx.c
82
n2=-n1;
drivers/media/tuners/mt20xx.c
83
f=n1*(f1-f2);
drivers/media/tuners/mt20xx.c
87
tuner_dbg("spurtest n1=%d n2=%d ftest=%d\n",n1,n2,f);
drivers/media/tuners/mt20xx.c
90
tuner_dbg("mt2032 spurcheck triggered: %d\n",n1);
drivers/media/tuners/mt20xx.c
92
n1++;
drivers/media/tuners/mt20xx.c
93
} while (n1<5);
drivers/media/usb/gspca/t613.c
577
static const u8 n1[] =
drivers/media/usb/gspca/t613.c
607
reg_w_buf(gspca_dev, n1, sizeof n1);
drivers/of/resolver.c
133
const char *n1 = kbasename(dn1->full_name);
drivers/of/resolver.c
136
return of_node_cmp(n1, n2);
drivers/of/unittest.c
827
struct device_node *n1, *n2, *n21, *n22, *nchangeset, *nremove, *parent, *np;
drivers/of/unittest.c
833
n1 = __of_node_dup(NULL, "n1");
drivers/of/unittest.c
834
unittest(n1, "testcase setup failure\n");
drivers/of/unittest.c
862
n1->parent = parent;
drivers/of/unittest.c
871
unittest(!of_changeset_attach_node(&chgset, n1), "fail attach n1\n");
drivers/of/unittest.c
872
unittest(!of_changeset_add_property(&chgset, n1, ppname_n1), "fail add prop name\n");
drivers/of/unittest.c
924
of_node_put(n1);
drivers/pinctrl/core.c
1183
struct pinctrl_state *state, *n1;
drivers/pinctrl/core.c
1187
list_for_each_entry_safe(state, n1, &p->states, node) {
drivers/pinctrl/devicetree.c
52
struct pinctrl_dt_map *dt_map, *n1;
drivers/pinctrl/devicetree.c
54
list_for_each_entry_safe(dt_map, n1, &p->dt_maps, node) {
drivers/ssb/main.c
848
u32 n1, n2, clock, m1, m2, m3, mc;
drivers/ssb/main.c
850
n1 = (n & SSB_CHIPCO_CLK_N1);
drivers/ssb/main.c
862
n1 = clkfactor_f6_resolve(n1);
drivers/ssb/main.c
866
n1 += SSB_CHIPCO_CLK_T2_BIAS;
drivers/ssb/main.c
868
WARN_ON(!((n1 >= 2) && (n1 <= 7)));
drivers/ssb/main.c
880
clock = SSB_CHIPCO_CLK_BASE2 * n1 * n2;
drivers/ssb/main.c
883
clock = SSB_CHIPCO_CLK_BASE1 * n1 * n2;
drivers/staging/fbtft/fb_ssd1325.c
130
u8 n1;
drivers/staging/fbtft/fb_ssd1325.c
139
n1 = rgb565_to_g16(vmem16[y * par->info->var.xres + x]);
drivers/staging/fbtft/fb_ssd1325.c
142
*buf = (n1 << 4) | n2;
drivers/staging/media/meson/vdec/codec_vp9.c
1496
const int n1 = count[coef_count_cxt_start + 1];
drivers/staging/media/meson/vdec/codec_vp9.c
1502
{ n0, n1 + n2 },
drivers/staging/media/meson/vdec/codec_vp9.c
1503
{ n1, n2 }
drivers/thermal/imx_thermal.c
374
int n1;
drivers/thermal/imx_thermal.c
410
n1 = ocotp_ana1 >> 20;
drivers/thermal/imx_thermal.c
414
do_div(temp64, 15423 * n1 - 4148468);
drivers/thermal/imx_thermal.c
416
data->c2 = n1 * data->c1 + 28581;
drivers/thunderbolt/test.c
2757
int n1, n2, i;
drivers/thunderbolt/test.c
2766
n1 = 0;
drivers/thunderbolt/test.c
2768
n1++;
drivers/thunderbolt/test.c
2769
KUNIT_ASSERT_NE(test, n1, 0);
drivers/thunderbolt/test.c
2776
KUNIT_ASSERT_EQ(test, n1, n2);
drivers/thunderbolt/test.c
2780
for (i = 0; i < n1; i++) {
drivers/tty/n_gsm.c
1574
unsigned int ftype, i, adaption, prio, n1, k;
drivers/tty/n_gsm.c
1579
n1 = FIELD_GET(PN_N_FIELD_N1, get_unaligned_le16(¶ms->n_bits));
drivers/tty/n_gsm.c
1582
if (n1 < MIN_MTU) {
drivers/tty/n_gsm.c
1620
if (n1 > gsm->mru || n1 > dlci->mtu) {
drivers/tty/n_gsm.c
1627
n1);
drivers/tty/n_gsm.c
1630
dlci->mtu = n1;
drivers/tty/n_gsm.c
1651
if (n1 > gsm->mru) {
drivers/tty/n_gsm.c
1654
} else if (n1 > MAX_MTU) {
drivers/tty/n_gsm.c
1658
dlci->mtu = n1;
drivers/video/fbdev/savage/savagefb_driver.c
1813
unsigned char config1, m, n, n1, n2, sr8, cr3f, cr66 = 0, tmp;
drivers/video/fbdev/savage/savagefb_driver.c
1935
n1 = n & 0x1f;
drivers/video/fbdev/savage/savagefb_driver.c
1937
par->MCLK = ((1431818 * (m+2)) / (n1+2) / (1 << n2) + 50) / 100;
drivers/video/fbdev/savage/savagefb_driver.c
422
unsigned char n1, n2, best_n1=16+2, best_n2=2, best_m=125+2;
drivers/video/fbdev/savage/savagefb_driver.c
437
for (n1=min_n1+2; n1<=max_n1+2; n1++) {
drivers/video/fbdev/savage/savagefb_driver.c
438
m = (freq * n1 * (1 << n2) + HALF_BASE_FREQ) /
drivers/video/fbdev/savage/savagefb_driver.c
442
if ((m * BASE_FREQ >= freq_min * n1) &&
drivers/video/fbdev/savage/savagefb_driver.c
443
(m * BASE_FREQ <= freq_max * n1)) {
drivers/video/fbdev/savage/savagefb_driver.c
444
diff = freq * (1 << n2) * n1 - BASE_FREQ * m;
drivers/video/fbdev/savage/savagefb_driver.c
450
best_n1 = n1;
drivers/video/fbdev/savage/savagefb_driver.c
469
unsigned char n1, n2;
drivers/video/fbdev/savage/savagefb_driver.c
475
for (n1 = min_n1+2; n1 <= max_n1+2; n1++) {
drivers/video/fbdev/savage/savagefb_driver.c
476
m = (freq * n1 * (1 << n2) + HALF_BASE_FREQ) /
drivers/video/fbdev/savage/savagefb_driver.c
480
if ((m * BASE_FREQ >= freq_min * n1) &&
drivers/video/fbdev/savage/savagefb_driver.c
481
(m * BASE_FREQ <= freq_max * n1)) {
drivers/video/fbdev/savage/savagefb_driver.c
482
diff = freq * (1 << n2) * n1 - BASE_FREQ * m;
drivers/video/fbdev/savage/savagefb_driver.c
488
best_n1 = n1;
fs/hfs/string.c
102
const unsigned char *n1, *n2;
fs/hfs/string.c
111
n1 = str;
fs/hfs/string.c
114
if (caseorder[*n1++] != caseorder[*n2++])
fs/hpfs/name.c
76
const unsigned char *n1, unsigned l1,
fs/hpfs/name.c
83
unsigned char c1 = upcase(hpfs_sb(s)->sb_cp_table,n1[i]);
fs/ntfs3/index.c
1806
struct indx_node *n1 = fnd->nodes[level];
fs/ntfs3/index.c
1807
struct INDEX_HDR *hdr1 = &n1->index->ihdr;
fs/ntfs3/index.c
1821
indx_write(indx, ni, n1, 0);
fs/ntfs3/index.c
1903
indx_write(indx, ni, n1, 0);
fs/ntfs3/index.c
1931
indx_write(indx, ni, n1, 0);
fs/ntfs3/namei.c
443
const char *n1 = str;
fs/ntfs3/namei.c
456
if ((c1 = *n1++) == (c2 = *n2++))
fs/xfs/libxfs/xfs_dir2.h
29
const struct xfs_name *n1,
fs/xfs/libxfs/xfs_dir2.h
32
if (n1 == n2)
fs/xfs/libxfs/xfs_dir2.h
34
if (n1->len != n2->len)
fs/xfs/libxfs/xfs_dir2.h
36
return !memcmp(n1->name, n2->name, n1->len);
include/math-emu/op-4.h
341
#define umul_ppppmnnn(p3,p2,p1,p0,m,n2,n1,n0) \
include/math-emu/op-4.h
345
umul_ppmm(p2,_t,m,n1); \
include/net/llc_conn.h
54
u32 n1; /* max nbr octets in I PDU */
include/scsi/iscsi_proto.h
34
static inline int iscsi_sna_lt(u32 n1, u32 n2)
include/scsi/iscsi_proto.h
36
return (s32)(n1 - n2) < 0;
include/scsi/iscsi_proto.h
39
static inline int iscsi_sna_lte(u32 n1, u32 n2)
include/scsi/iscsi_proto.h
41
return (s32)(n1 - n2) <= 0;
include/scsi/iscsi_proto.h
44
static inline int iscsi_sna_gt(u32 n1, u32 n2)
include/scsi/iscsi_proto.h
46
return (s32)(n1 - n2) > 0;
include/scsi/iscsi_proto.h
49
static inline int iscsi_sna_gte(u32 n1, u32 n2)
include/scsi/iscsi_proto.h
51
return (s32)(n1 - n2) >= 0;
lib/crypto/curve25519-hacl64.c
576
static __always_inline void ladder_bigloop_cmult_big_loop(u8 *n1, u64 *nq,
lib/crypto/curve25519-hacl64.c
582
u8 byte = n1[i];
lib/crypto/curve25519-hacl64.c
588
static void ladder_cmult(u64 *result, u8 *n1, u64 *q)
lib/crypto/curve25519-hacl64.c
597
ladder_bigloop_cmult_big_loop(n1, nq, nqpq, nq2, nqpq2, q, 32);
lib/crypto/mpi/longlong.h
1007
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
1049
: "r" ((USItype)(n1)), \
lib/crypto/mpi/longlong.h
1107
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
1135
"1" ((USItype)(n1)), \
lib/crypto/mpi/longlong.h
1177
#define sdiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
1182
__xx.__i.__h = n1; __xx.__i.__l = n0; \
lib/crypto/mpi/longlong.h
1308
#define __udiv_qrnnd_c(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
1314
__r1 = (n1) % __d1; \
lib/crypto/mpi/longlong.h
1315
__q1 = (n1) / __d1; \
lib/crypto/mpi/longlong.h
144
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
148
: "1" ((USItype)(n1)), \
lib/crypto/mpi/longlong.h
162
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
164
(q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \
lib/crypto/mpi/longlong.h
339
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
341
(q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \
lib/crypto/mpi/longlong.h
379
#define sdiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
384
__xx.__i.__h = n1; __xx.__i.__l = n0; \
lib/crypto/mpi/longlong.h
421
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
426
"1" ((USItype)(n1)), \
lib/crypto/mpi/longlong.h
541
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
546
"1" ((USItype)(n1)), \
lib/crypto/mpi/longlong.h
549
#define sdiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
554
"1" ((USItype)(n1)), \
lib/crypto/mpi/longlong.h
622
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
626
__x.__i.__h = (n1); __x.__i.__l = (n0); \
lib/crypto/mpi/longlong.h
705
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
709
__xx.__i.__h = (n1); __xx.__i.__l = (n0); \
lib/crypto/mpi/longlong.h
983
#define udiv_qrnnd(q, r, n1, n0, d) \
lib/crypto/mpi/longlong.h
988
: "r" ((USItype)(n1)), \
lib/crypto/mpi/mpih-div.c
129
n1 = dividend_ptr[dividend_size - 1];
lib/crypto/mpi/mpih-div.c
130
r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);
lib/crypto/mpi/mpih-div.c
141
((n1 << normalization_steps)
lib/crypto/mpi/mpih-div.c
144
n1 = n0;
lib/crypto/mpi/mpih-div.c
147
n1 << normalization_steps,
lib/crypto/mpi/mpih-div.c
207
mpi_limb_t n1;
lib/crypto/mpi/mpih-div.c
211
n1 = np[nsize - 1];
lib/crypto/mpi/mpih-div.c
213
if (n1 >= d) {
lib/crypto/mpi/mpih-div.c
214
n1 -= d;
lib/crypto/mpi/mpih-div.c
220
udiv_qrnnd(qp[i], n1, n1, np[i], d);
lib/crypto/mpi/mpih-div.c
224
udiv_qrnnd(qp[i], n1, n1, 0, d);
lib/crypto/mpi/mpih-div.c
226
np[0] = n1;
lib/crypto/mpi/mpih-div.c
233
mpi_limb_t n1, n0, n2;
lib/crypto/mpi/mpih-div.c
239
n1 = np[1];
lib/crypto/mpi/mpih-div.c
242
if (n1 >= d1 && (n1 > d1 || n0 >= d0)) {
lib/crypto/mpi/mpih-div.c
243
sub_ddmmss(n1, n0, n1, n0, d1, d0);
lib/crypto/mpi/mpih-div.c
256
if (n1 == d1) {
lib/crypto/mpi/mpih-div.c
264
add_ssaaaa(n1, n0, r - d0,
lib/crypto/mpi/mpih-div.c
269
n1 = d0 - (d0 != 0 ? 1 : 0);
lib/crypto/mpi/mpih-div.c
272
udiv_qrnnd(q, r, n1, n0, d1);
lib/crypto/mpi/mpih-div.c
273
umul_ppmm(n1, n0, d0, q);
lib/crypto/mpi/mpih-div.c
278
if (n1 > r || (n1 == r && n0 > n2)) {
lib/crypto/mpi/mpih-div.c
281
sub_ddmmss(n1, n0, n1, n0, 0, d0);
lib/crypto/mpi/mpih-div.c
288
sub_ddmmss(n1, n0, r, n2, n1, n0);
lib/crypto/mpi/mpih-div.c
290
np[1] = n1;
lib/crypto/mpi/mpih-div.c
316
mpi_limb_t n1, n2;
lib/crypto/mpi/mpih-div.c
33
mpi_limb_t n1, n0, r;
lib/crypto/mpi/mpih-div.c
336
umul_ppmm(n1, n0, d1, q);
lib/crypto/mpi/mpih-div.c
338
while (n1 > r
lib/crypto/mpi/mpih-div.c
339
|| (n1 == r
lib/crypto/mpi/mpih-div.c
345
n1 -= n0 < d1;
lib/crypto/mpi/mpih-div.c
384
mpi_limb_t n1, n0, r;
lib/crypto/mpi/mpih-div.c
419
n1 = dividend_ptr[dividend_size - 1];
lib/crypto/mpi/mpih-div.c
420
r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);
lib/crypto/mpi/mpih-div.c
431
((n1 << normalization_steps)
lib/crypto/mpi/mpih-div.c
434
n1 = n0;
lib/crypto/mpi/mpih-div.c
437
n1 << normalization_steps,
lib/crypto/mpi/mpih-div.c
477
n1 = dividend_ptr[dividend_size - 1];
lib/crypto/mpi/mpih-div.c
478
r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);
lib/crypto/mpi/mpih-div.c
489
((n1 << normalization_steps)
lib/crypto/mpi/mpih-div.c
492
n1 = n0;
lib/crypto/mpi/mpih-div.c
495
n1 << normalization_steps,
lib/crypto/mpi/mpih-div.c
70
n1 = dividend_ptr[dividend_size - 1];
lib/crypto/mpi/mpih-div.c
71
r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);
lib/crypto/mpi/mpih-div.c
82
((n1 << normalization_steps)
lib/crypto/mpi/mpih-div.c
85
n1 = n0;
lib/crypto/mpi/mpih-div.c
88
n1 << normalization_steps,
lib/crypto/x86/curve25519.h
1110
static void fsquare_times(u64 *o, const u64 *inp, u64 *tmp, u32 n1)
lib/crypto/x86/curve25519.h
1114
for (i = (u32)0U; i < n1 - (u32)1U; i = i + (u32)1U)
lib/math/rational.c
100
n0 = n1;
lib/math/rational.c
101
n1 = n2;
lib/math/rational.c
105
*best_numerator = n1;
lib/math/rational.c
51
unsigned long n, d, n0, d0, n1, d1, n2, d2;
lib/math/rational.c
55
n1 = d0 = 1;
lib/math/rational.c
74
n2 = n0 + a * n1;
lib/math/rational.c
87
if (n1)
lib/math/rational.c
88
t = min(t, (max_numerator - n0) / n1);
lib/math/rational.c
95
n1 = n0 + t * n1;
lib/zstd/compress/huf_compress.c
699
int const n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
lib/zstd/compress/huf_compress.c
701
huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
lib/zstd/compress/huf_compress.c
702
huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb;
net/bluetooth/smp.c
233
const u8 n1[16], const u8 n2[16], const u8 a1[7],
net/bluetooth/smp.c
250
SMP_DBG("n1 %16phN n2 %16phN", n1, n2);
net/bluetooth/smp.c
263
memcpy(m + 32, n1, 16);
net/bluetooth/smp.c
286
const u8 n1[16], const u8 n2[16], const u8 r[16],
net/bluetooth/smp.c
294
SMP_DBG("n1 %16phN n2 %16phN", n1, n2);
net/bluetooth/smp.c
302
memcpy(m + 49, n1, 16);
net/bluetooth/smp.c
3607
const u8 n1[16] = {
net/bluetooth/smp.c
3624
err = smp_f5(tfm_cmac, w, n1, n2, a1, a2, mackey, ltk);
net/bluetooth/smp.c
3642
const u8 n1[16] = {
net/bluetooth/smp.c
3660
err = smp_f6(tfm_cmac, w, n1, n2, r, io_cap, a1, a2, res);
net/ceph/osdmap.c
2970
struct rb_node *n1 = rb_first(locs1);
net/ceph/osdmap.c
2974
for ( ; n1 && n2; n1 = rb_next(n1), n2 = rb_next(n2)) {
net/ceph/osdmap.c
2976
rb_entry(n1, struct crush_loc_node, cl_node);
net/ceph/osdmap.c
2985
if (!n1 && n2)
net/ceph/osdmap.c
2987
if (n1 && !n2)
net/core/neighbour.c
1323
struct neighbour *n2, *n1 = neigh;
net/core/neighbour.c
1341
n1 = n2;
net/core/neighbour.c
1343
READ_ONCE(n1->output)(n1, skb);
net/core/neighbour.c
651
struct neighbour *n1, *rc, *n;
net/core/neighbour.c
703
neigh_for_each_in_bucket(n1, &nht->hash_heads[hash_val]) {
net/core/neighbour.c
704
if (dev == n1->dev && !memcmp(n1->primary_key, n->primary_key, key_len)) {
net/core/neighbour.c
706
neigh_hold(n1);
net/core/neighbour.c
707
rc = n1;
net/llc/af_llc.c
1114
llc->n1 = opt;
net/llc/af_llc.c
1192
val = llc->n1; break;
net/mac80211/tx.c
4905
int i, n1 = 0, n2;
net/mac80211/tx.c
4914
n1 = i & 0xfe;
net/mac80211/tx.c
4918
n2 = n1;
net/mac80211/tx.c
4919
for (i = IEEE80211_MAX_TIM_LEN - 1; i >= n1; i--) {
net/mac80211/tx.c
4927
skb_put_u8(skb, n1 | mcast_traffic);
net/mac80211/tx.c
4929
skb_put_data(skb, ps->tim + n1, n2 - n1 + 1);
security/selinux/ss/ebitmap.c
221
const struct ebitmap_node *n1, *n2;
security/selinux/ss/ebitmap.c
227
n1 = e1->node;
security/selinux/ss/ebitmap.c
230
while (n1 && n2 && (n1->startbit <= n2->startbit)) {
security/selinux/ss/ebitmap.c
231
if (n1->startbit < n2->startbit) {
security/selinux/ss/ebitmap.c
232
n1 = n1->next;
security/selinux/ss/ebitmap.c
245
if ((n1->maps[i] & n2->maps[i]) != n2->maps[i])
security/selinux/ss/ebitmap.c
250
n1 = n1->next;
security/selinux/ss/ebitmap.c
30
const struct ebitmap_node *n1, *n2;
security/selinux/ss/ebitmap.c
35
n1 = e1->node;
security/selinux/ss/ebitmap.c
37
while (n1 && n2 && (n1->startbit == n2->startbit) &&
security/selinux/ss/ebitmap.c
38
!memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) {
security/selinux/ss/ebitmap.c
39
n1 = n1->next;
security/selinux/ss/ebitmap.c
43
if (n1 || n2)
tools/bpf/bpftool/gen.c
45
size_t i, n1 = strlen(str), n2 = strlen(suffix);
tools/bpf/bpftool/gen.c
47
if (n1 < n2)
tools/bpf/bpftool/gen.c
51
if (str[n1 - i - 1] != suffix[n2 - i - 1])
tools/lib/bpf/btf_relocate.c
86
static int cmp_btf_name_size(const void *n1, const void *n2)
tools/lib/bpf/btf_relocate.c
88
const struct btf_name_info *ni1 = n1;
tools/lib/bpf/linker.c
1488
const char *n1, *n2;
tools/lib/bpf/linker.c
1492
n1 = n2 = NULL;
tools/lib/bpf/linker.c
1498
n1 = btf__str_by_offset(btf1, t1->name_off);
tools/lib/bpf/linker.c
1500
if (strcmp(n1, n2) != 0) {
tools/lib/bpf/linker.c
1502
sym_name, n1, n2);
tools/lib/bpf/linker.c
1538
n1 = btf__str_by_offset(btf1, t1->name_off);
tools/lib/bpf/linker.c
1540
if (strcmp(n1, n2) != 0) {
tools/lib/bpf/linker.c
1542
sym_name, btf_kind_str(t1), n1, n2);
tools/lib/bpf/linker.c
1561
sym_name, btf_kind_str(t1), n1, t1->size, t2->size);
tools/lib/bpf/linker.c
1584
pr_warn("global '%s': incompatible func '%s' linkage\n", sym_name, n1);
tools/lib/bpf/linker.c
1596
pr_warn("global '%s': incompatible var '%s' linkage\n", sym_name, n1);
tools/lib/bpf/linker.c
1620
n1 = btf__str_by_offset(btf1, m1->name_off);
tools/lib/bpf/linker.c
1622
if (strcmp(n1, n2) != 0) {
tools/lib/bpf/linker.c
1624
sym_name, i, n1, n2);
tools/lib/bpf/linker.c
1629
sym_name, i, n1);
tools/mm/slabinfo.c
1118
char *n1, *n2;
tools/mm/slabinfo.c
1120
n1 = a1->name;
tools/mm/slabinfo.c
1123
n1 = a1->ref;
tools/mm/slabinfo.c
1126
if (strcasecmp(n1, n2) > 0) {
tools/perf/builtin-sched.c
4470
struct schedstat_domain *dptr, *n1;
tools/perf/builtin-sched.c
4474
list_for_each_entry_safe(dptr, n1, &cptr->domain_head, domain_list) {
tools/testing/selftests/bpf/progs/exceptions_fail.c
164
static bool rbless(struct bpf_rb_node *n1, const struct bpf_rb_node *n2)
tools/testing/selftests/kvm/lib/elf.c
137
for (unsigned int n1 = 0; n1 < hdr.e_phnum; n1++) {
tools/testing/selftests/kvm/lib/elf.c
139
offset = hdr.e_phoff + (n1 * hdr.e_phentsize);
tools/testing/selftests/kvm/lib/elf.c
145
n1, filename, (intmax_t) offset_rv, errno);
tools/testing/selftests/kvm/lib/elf.c
159
n1, (uint64_t) phdr.p_memsz);
tools/testing/selftests/kvm/lib/elf.c
172
n1, seg_vstart, vaddr);
tools/testing/selftests/kvm/lib/elf.c
188
n1, errno, (intmax_t) offset_rv,
tools/testing/selftests/kvm/lib/kvm_util.c
2071
unsigned int n1;
tools/testing/selftests/kvm/lib/kvm_util.c
2073
for (n1 = 0; n1 < ARRAY_SIZE(exit_reasons_known); n1++) {
tools/testing/selftests/kvm/lib/kvm_util.c
2074
if (exit_reason == exit_reasons_known[n1].reason)
tools/testing/selftests/kvm/lib/kvm_util.c
2075
return exit_reasons_known[n1].name;
tools/testing/selftests/kvm/lib/sparsebit.c
1374
unsigned int n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1429
for (n1 = 0; n1 < MASK_BITS; n1++) {
tools/testing/selftests/kvm/lib/sparsebit.c
1430
if (!(nodep->mask & (1 << n1))) {
tools/testing/selftests/kvm/lib/sparsebit.c
1431
nodep->mask |= 1 << n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1456
unsigned int n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1492
for (n1 = 0; n1 < MASK_BITS; n1++) {
tools/testing/selftests/kvm/lib/sparsebit.c
1493
if (nodep->mask & (1 << n1)) {
tools/testing/selftests/kvm/lib/sparsebit.c
1494
nodep->mask &= ~(1 << n1);
tools/testing/selftests/kvm/lib/sparsebit.c
1601
unsigned int n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1605
for (n1 = 0; n1 < MASK_BITS; n1++) {
tools/testing/selftests/kvm/lib/sparsebit.c
1606
if (nodep->mask & (1 << n1)) {
tools/testing/selftests/kvm/lib/sparsebit.c
1607
low = high = nodep->idx + n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1609
for (; n1 < MASK_BITS; n1++) {
tools/testing/selftests/kvm/lib/sparsebit.c
1610
if (nodep->mask & (1 << n1))
tools/testing/selftests/kvm/lib/sparsebit.c
1611
high = nodep->idx + n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1616
if ((n1 == MASK_BITS) && nodep->num_after)
tools/testing/selftests/kvm/lib/sparsebit.c
1689
unsigned int n1;
tools/testing/selftests/kvm/lib/sparsebit.c
1699
for (n1 = 0; n1 < MASK_BITS; n1++)
tools/testing/selftests/kvm/lib/sparsebit.c
1700
if (nodep->mask & (1 << n1))
tools/testing/selftests/kvm/lib/sparsebit.c
383
unsigned int n1 = (prev->idx + MASK_BITS + prev->num_after - 1)
tools/testing/selftests/kvm/lib/sparsebit.c
386
assert(n1 < MASK_BITS);
tools/testing/selftests/kvm/lib/sparsebit.c
387
assert(!(nodep->mask & (1 << n1)));
tools/testing/selftests/kvm/lib/sparsebit.c
388
nodep->mask |= (1 << n1);
tools/testing/selftests/kvm/lib/sparsebit.c
903
int n1 = __builtin_ctz(nodep->mask & -leading);
tools/testing/selftests/kvm/lib/sparsebit.c
905
return nodep->idx + n1;
tools/testing/selftests/kvm/lib/sparsebit.c
911
int n1 = __builtin_ctz(~nodep->mask & -leading);
tools/testing/selftests/kvm/lib/sparsebit.c
913
return nodep->idx + n1;
tools/testing/selftests/kvm/lib/x86/processor.c
425
for (uint16_t n1 = 0; n1 <= 0x1ffu; n1++) {
tools/testing/selftests/kvm/lib/x86/processor.c
426
pml4e = &pml4e_start[n1];
tools/testing/selftests/kvm/lib/x86/processor.c
476
((uint64_t) n1 << 27)
tools/testing/selftests/mm/migration.c
129
if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
tools/testing/selftests/mm/migration.c
141
ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
tools/testing/selftests/mm/migration.c
155
if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
tools/testing/selftests/mm/migration.c
176
ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
tools/testing/selftests/mm/migration.c
192
if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
tools/testing/selftests/mm/migration.c
206
ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
tools/testing/selftests/mm/migration.c
224
if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
tools/testing/selftests/mm/migration.c
248
ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
tools/testing/selftests/mm/migration.c
261
if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
tools/testing/selftests/mm/migration.c
273
ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
tools/testing/selftests/mm/migration.c
287
if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
tools/testing/selftests/mm/migration.c
308
ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
tools/testing/selftests/mm/migration.c
31
int n1;
tools/testing/selftests/mm/migration.c
41
self->n1 = -1;
tools/testing/selftests/mm/migration.c
46
if (self->n1 == -1) {
tools/testing/selftests/mm/migration.c
47
self->n1 = n;
tools/testing/selftests/mm/migration.c
66
int migrate(uint64_t *ptr, int n1, int n2)
tools/testing/selftests/mm/migration.c
98
n2 = n1;
tools/testing/selftests/mm/migration.c
99
n1 = tmp;