/linux/arch/alpha/lib/ |
H A D | udiv-qrnnd.S | 44 #define n1 $17 macro 54 addq n1,n1,n1 55 bis n1,tmp,n1 57 cmpule d,n1,qb 58 subq n1,d,tmp 59 cmovne qb,tmp,n1 62 addq n1,n1,n1 63 bis n1,tmp,n1 65 cmpule d,n1,qb 66 subq n1,d,tmp [all …]
|
/linux/arch/powerpc/math-emu/ |
H A D | udivmodti4.c | 11 _FP_W_TYPE n1, _FP_W_TYPE n0, in _fp_udivmodti4() argument 20 if (d0 > n1) in _fp_udivmodti4() 24 udiv_qrnnd (q0, n0, n1, n0, d0); in _fp_udivmodti4() 36 udiv_qrnnd (q1, n1, 0, n1, d0); in _fp_udivmodti4() 37 udiv_qrnnd (q0, n0, n1, n0, d0); in _fp_udivmodti4() 47 if (d0 > n1) in _fp_udivmodti4() 59 n1 = (n1 << bm) | (n0 >> (_FP_W_TYPE_SIZE - bm)); in _fp_udivmodti4() 63 udiv_qrnnd (q0, n0, n1, n0, d0); in _fp_udivmodti4() 86 n1 -= d0; in _fp_udivmodti4() 98 n2 = n1 >> b; in _fp_udivmodti4() [all …]
|
/linux/lib/crypto/mpi/ |
H A D | mpih-div.c | 33 mpi_limb_t n1, n0, r; in mpihelp_mod_1() local 70 n1 = dividend_ptr[dividend_size - 1]; in mpihelp_mod_1() 71 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1() 82 ((n1 << normalization_steps) in mpihelp_mod_1() 85 n1 = n0; in mpihelp_mod_1() 88 n1 << normalization_steps, in mpihelp_mod_1() 129 n1 = dividend_ptr[dividend_size - 1]; in mpihelp_mod_1() 130 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1() 141 ((n1 << normalization_steps) in mpihelp_mod_1() 144 n1 = n0; in mpihelp_mod_1() [all …]
|
H A D | longlong.h | 144 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 148 : "1" ((USItype)(n1)), \ 162 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 164 (q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \ 339 #define udiv_qrnnd(q, r, n1, n0, d) \ 341 (q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \ 379 #define sdiv_qrnnd(q, r, n1, n0, d) \ argument 384 __xx.__i.__h = n1; __xx.__i.__l = n0; \ 421 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 426 "1" ((USItype)(n1)), \ [all …]
|
/linux/tools/testing/selftests/wireguard/ |
H A D | netns.sh | 38 n1() { pretty 1 "$*"; maybe_exec ip netns exec $netns1 "$@"; } function 100 n1 wg set wg0 \ 121 n1 ping -c 10 -f -W 1 192.168.241.2 125 n1 ping6 -c 10 -f -W 1 fd00::2 130 n1 iperf3 -Z -t 3 -c 192.168.241.2 133 n1 iperf3 -s -1 -B fd00::1 & 138 n1 iperf3 -s -1 -B 192.168.241.1 & 145 n1 iperf3 -Z -t 3 -b 0 -u -c fd00::2 154 n1 iperf3 -Z -t 3 -p $(( 5200 + i )) -c 192.168.241.2 & 163 n1 w [all...] |
/linux/drivers/clk/ |
H A D | clk-si570.c | 81 unsigned int n1; member 100 unsigned int *n1, unsigned int *hs_div) in si570_get_divs() argument 112 *n1 = ((reg[0] & N1_6_2_MASK) << 2) + ((reg[1] & N1_1_0_MASK) >> 6) + 1; in si570_get_divs() 114 if (*n1 > 1) in si570_get_divs() 115 *n1 &= ~1; in si570_get_divs() 144 err = si570_get_divs(data, &data->rfreq, &data->n1, &data->hs_div); in si570_get_defaults() 152 fdco = fout * data->n1 * data->hs_div; in si570_get_defaults() 172 reg[0] = ((data->n1 - 1) << 6) | in si570_update_rfreq() 199 unsigned int n1, hs_div; in si570_calc_divs() local 206 n1 = div_u64(div_u64(FDCO_MIN, hs_div), frequency); in si570_calc_divs() [all …]
|
/linux/lib/math/ |
H A D | rational.c | 51 unsigned long n, d, n0, d0, n1, d1, n2, d2; in rational_best_approximation() local 55 n1 = d0 = 1; in rational_best_approximation() 74 n2 = n0 + a * n1; in rational_best_approximation() 87 if (n1) in rational_best_approximation() 88 t = min(t, (max_numerator - n0) / n1); in rational_best_approximation() 95 n1 = n0 + t * n1; in rational_best_approximation() 100 n0 = n1; in rational_best_approximation() 101 n1 = n2; in rational_best_approximation() 105 *best_numerator = n1; in rational_best_approximation()
|
/linux/tools/testing/selftests/mm/ |
H A D | migration.c | 28 int n1; in FIXTURE() local 38 self->n1 = -1; in FIXTURE_SETUP() 43 if (self->n1 == -1) { in FIXTURE_SETUP() 44 self->n1 = n; in FIXTURE_SETUP() 63 int migrate(uint64_t *ptr, int n1, int n2) in migrate() argument 95 n2 = n1; in migrate() 96 n1 = tmp; in migrate() 128 if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0) 140 ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0); 154 if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0) [all …]
|
/linux/security/selinux/ss/ |
H A D | ebitmap.c | 30 const struct ebitmap_node *n1, *n2; in ebitmap_cmp() local 35 n1 = e1->node; in ebitmap_cmp() 37 while (n1 && n2 && (n1->startbit == n2->startbit) && in ebitmap_cmp() 38 !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) { in ebitmap_cmp() 39 n1 = n1->next; in ebitmap_cmp() 43 if (n1 || n2) in ebitmap_cmp() 221 const struct ebitmap_node *n1, *n2; in ebitmap_contains() local 227 n1 = e1->node; in ebitmap_contains() 230 while (n1 && n2 && (n1->startbit <= n2->startbit)) { in ebitmap_contains() 231 if (n1->startbit < n2->startbit) { in ebitmap_contains() [all …]
|
/linux/tools/testing/selftests/kvm/lib/ |
H A D | elf.c | 137 for (unsigned int n1 = 0; n1 < hdr.e_phnum; n1++) { in kvm_vm_elf_load() local 139 offset = hdr.e_phoff + (n1 * hdr.e_phentsize); in kvm_vm_elf_load() 145 n1, filename, (intmax_t) offset_rv, errno); in kvm_vm_elf_load() 159 n1, (uint64_t) phdr.p_memsz); in kvm_vm_elf_load() 172 n1, seg_vstart, vaddr); in kvm_vm_elf_load() 188 n1, errno, (intmax_t) offset_rv, in kvm_vm_elf_load()
|
H A D | sparsebit.c | 383 unsigned int n1 = (prev->idx + MASK_BITS + prev->num_after - 1) in node_add() local 386 assert(n1 < MASK_BITS); in node_add() 387 assert(!(nodep->mask & (1 << n1))); in node_add() 388 nodep->mask |= (1 << n1); in node_add() 903 int n1 = __builtin_ctz(nodep->mask & -leading); in node_first_set() local 905 return nodep->idx + n1; in node_first_set() 911 int n1 = __builtin_ctz(~nodep->mask & -leading); in node_first_clear() local 913 return nodep->idx + n1; in node_first_clear() 1374 unsigned int n1; in sparsebit_set_num() local 1429 for (n1 = 0; n1 < MASK_BITS; n1++) { in sparsebit_set_num() [all …]
|
/linux/tools/testing/selftests/bpf/benchs/ |
H A D | run_common.sh | 62 summary=$(echo $2 | tail -n1) 69 summary=$(echo $2 | tail -n1) 76 summary=$(echo $2 | tail -n1) 83 summary=$(echo $2 | tail -n1) 90 summary=$(echo $2 | tail -n1)
|
/linux/drivers/clk/meson/ |
H A D | clk-dualdiv.c | 41 return DIV_ROUND_CLOSEST(parent_rate, p->n1); in __dualdiv_param_to_rate() 44 p->n1 * p->m1 + p->n2 * p->m2); in __dualdiv_param_to_rate() 55 setting.n1 = meson_parm_read(clk->map, &dualdiv->n1) + 1; in meson_clk_dualdiv_recalc_rate() 74 for (i = 0; table[i].n1; i++) { in __dualdiv_get_setting() 120 meson_parm_write(clk->map, &dualdiv->n1, setting->n1 - 1); in meson_clk_dualdiv_set_rate()
|
/linux/arch/mips/bcm63xx/ |
H A D | cpu.c | 164 unsigned int tmp, n1, n2, m1; in detect_cpu_clock() local 168 n1 = (tmp & MIPSPLLCTL_N1_MASK) >> MIPSPLLCTL_N1_SHIFT; in detect_cpu_clock() 171 n1 += 1; in detect_cpu_clock() 174 return (16 * 1000000 * n1 * n2) / m1; in detect_cpu_clock() 179 unsigned int tmp, n1, n2, m1; in detect_cpu_clock() local 183 n1 = (tmp & DMIPSPLLCFG_N1_MASK) >> DMIPSPLLCFG_N1_SHIFT; in detect_cpu_clock() 186 return (16 * 1000000 * n1 * n2) / m1; in detect_cpu_clock()
|
/linux/drivers/mfd/ |
H A D | pcf50633-core.c | 85 int n, n1, idx = 0; in dump_regs_show() local 97 for (n1 = 0; n1 < sizeof(dump); n1++) in dump_regs_show() 100 dump[n1] = 0x00; in dump_regs_show() 102 dump[n1] = pcf50633_reg_read(pcf, n + n1); in dump_regs_show()
|
/linux/drivers/media/pci/cobalt/ |
H A D | cobalt-cpld.c | 124 unsigned mult, hsdiv, n1; member 236 u8 n1, hsdiv; in cobalt_cpld_set_freq() local 258 n1 = multipliers[i_best].n1 - 1; in cobalt_cpld_set_freq() 264 regs[0] = (hsdiv << 5) | (n1 >> 2); in cobalt_cpld_set_freq() 265 regs[1] = ((n1 & 0x3) << 6) | (rfreq >> 32); in cobalt_cpld_set_freq()
|
/linux/scripts/coccinelle/iterators/ |
H A D | for_each_child.cocci | 25 expression list [n1] es; 55 expression list [r.n1] es; 84 expression list [r.n1] es; 117 expression list [r.n1] es; 150 expression list[r.n1] es; 173 expression list[r.n1] es; 188 expression list[r.n1] es; 219 expression list[r.n1] es; 243 expression list[r.n1] es; 277 expression list[r.n1] es;
|
/linux/fs/hfs/ |
H A D | string.c | 98 const unsigned char *n1, *n2; in hfs_compare_dentry() local 107 n1 = str; in hfs_compare_dentry() 110 if (caseorder[*n1++] != caseorder[*n2++]) in hfs_compare_dentry()
|
/linux/net/dccp/ccids/lib/ |
H A D | packet_history.c | 152 static void __do_track_loss(struct tfrc_rx_hist *h, struct sk_buff *skb, u64 n1) in __do_track_loss() argument 157 if (!dccp_loss_free(s0, s1, n1)) { /* gap between S0 and S1 */ in __do_track_loss() 159 tfrc_rx_hist_entry_from_skb(tfrc_rx_hist_entry(h, 1), skb, n1); in __do_track_loss() 178 u64 n1 = tfrc_rx_hist_entry(h, 1)->tfrchrx_ndp; in __one_after_loss() local 180 if (dccp_loss_free(s2, s1, n1)) { in __one_after_loss() 228 u64 n1 = tfrc_rx_hist_entry(h, 1)->tfrchrx_ndp; in __two_after_loss() local 230 if (dccp_loss_free(s3, s1, n1)) { in __two_after_loss()
|
/linux/arch/m68k/include/asm/ |
H A D | uaccess.h | 190 #define ____constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)\ argument 216 "10: addq.l #"#n1",%0\n" \ 228 #define ___constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)\ argument 229 ____constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3) 230 #define __constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3) \ argument 231 ___constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, \ 232 __suffix##n1, __suffix##n2, __suffix##n3)
|
/linux/crypto/ |
H A D | rsa.c | 29 MPI n1; in rsa_check_payload() local 34 n1 = mpi_alloc(0); in rsa_check_payload() 35 if (!n1) in rsa_check_payload() 38 if (mpi_sub_ui(n1, n, 1) || mpi_cmp(x, n1) >= 0) { in rsa_check_payload() 39 mpi_free(n1); in rsa_check_payload() 43 mpi_free(n1); in rsa_check_payload()
|
/linux/drivers/md/bcache/ |
H A D | btree.c | 1409 struct bset *n1 = btree_bset_first(new_nodes[i]); in btree_gc_coalesce() local 1419 if (__set_blocks(n1, n1->keys + keys + in btree_gc_coalesce() 1436 if (__set_blocks(n1, n1->keys + n2->keys, in btree_gc_coalesce() 1446 BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c->cache)) > in btree_gc_coalesce() 1452 memcpy(bset_bkey_last(n1), in btree_gc_coalesce() 1456 n1->keys += keys; in btree_gc_coalesce() 1457 r[i].keys = n1->keys; in btree_gc_coalesce() 2255 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local 2270 n1 = btree_node_alloc_replacement(b, op); in btree_split() 2271 if (IS_ERR(n1)) in btree_split() [all …]
|
/linux/include/scsi/ |
H A D | iscsi_proto.h | 34 static inline int iscsi_sna_lt(u32 n1, u32 n2) in iscsi_sna_lt() argument 36 return (s32)(n1 - n2) < 0; in iscsi_sna_lt() 39 static inline int iscsi_sna_lte(u32 n1, u32 n2) in iscsi_sna_lte() argument 41 return (s32)(n1 - n2) <= 0; in iscsi_sna_lte() 44 static inline int iscsi_sna_gt(u32 n1, u32 n2) in iscsi_sna_gt() argument 46 return (s32)(n1 - n2) > 0; in iscsi_sna_gt() 49 static inline int iscsi_sna_gte(u32 n1, u32 n2) in iscsi_sna_gte() argument 51 return (s32)(n1 - n2) >= 0; in iscsi_sna_gte()
|
/linux/arch/sparc/math-emu/ |
H A D | sfp-util_64.h | 76 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 82 __r1 = (n1) % __d1; \ 83 __q1 = (n1) / __d1; \
|
/linux/arch/sh/math-emu/ |
H A D | sfp-util.h | 32 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 39 __r1 = (n1) % __d1; \ 40 __q1 = (n1) / __d1; \
|