| /linux/arch/alpha/lib/ |
| A D | udiv-qrnnd.S | 54 addq n1,n1,n1 55 bis n1,tmp,n1 62 addq n1,n1,n1 70 addq n1,n1,n1 78 addq n1,n1,n1 97 srl n1,1,n1 104 addq n1,n1,n1 112 addq n1,n1,n1 120 addq n1,n1,n1 128 addq n1,n1,n1 [all …]
|
| /linux/arch/powerpc/math-emu/ |
| A D | udivmodti4.c | 20 if (d0 > n1) in _fp_udivmodti4() 36 udiv_qrnnd (q1, n1, 0, n1, d0); in _fp_udivmodti4() 59 n1 = (n1 << bm) | (n0 >> (_FP_W_TYPE_SIZE - bm)); in _fp_udivmodti4() 99 n1 = (n1 << bm) | (n0 >> b); in _fp_udivmodti4() 102 udiv_qrnnd (q1, n1, n2, n1, d0); in _fp_udivmodti4() 127 r1 = n1; in _fp_udivmodti4() 147 sub_ddmmss (n1, n0, n1, n0, d1, d0); in _fp_udivmodti4() 168 n1 = (n1 << bm) | (n0 >> b); in _fp_udivmodti4() 171 udiv_qrnnd (q0, n1, n2, n1, d1); in _fp_udivmodti4() 174 if (m1 > n1 || (m1 == n1 && m0 > n0)) in _fp_udivmodti4() [all …]
|
| /linux/lib/crypto/mpi/ |
| A D | mpih-div.c | 85 n1 = n0; in mpihelp_mod_1() 144 n1 = n0; in mpihelp_mod_1() 214 n1 -= d; in mpihelp_divrem() 220 udiv_qrnnd(qp[i], n1, n1, np[i], d); in mpihelp_divrem() 224 udiv_qrnnd(qp[i], n1, n1, 0, d); in mpihelp_divrem() 242 if (n1 >= d1 && (n1 > d1 || n0 >= d0)) { in mpihelp_divrem() 243 sub_ddmmss(n1, n0, n1, n0, d1, d0); in mpihelp_divrem() 278 if (n1 > r || (n1 == r && n0 > n2)) { in mpihelp_divrem() 281 sub_ddmmss(n1, n0, n1, n0, 0, d0); in mpihelp_divrem() 288 sub_ddmmss(n1, n0, r, n2, n1, n0); in mpihelp_divrem() [all …]
|
| 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 426 "1" ((USItype)(n1)), \ 546 "1" ((USItype)(n1)), \ 554 "1" ((USItype)(n1)), \ 988 : "r" ((USItype)(n1)), \ 1049 : "r" ((USItype)(n1)), \ 1135 "1" ((USItype)(n1)), \ 1314 __r1 = (n1) % __d1; \ [all …]
|
| /linux/tools/testing/selftests/wireguard/ |
| A D | netns.sh | 100 n1 wg set wg0 \ 125 n1 ping6 -c 10 -f -W 1 fd00::2 133 n1 iperf3 -s -1 -B fd00::1 & 213 n1 wg set wg0 listen-port 9999 215 n1 ping6 -W 1 -c 1 fd00::2 219 n1 wg set wg0 listen-port 9998 221 n1 ping -W 1 -c 1 192.168.241.2 247 n1 ping -W 1 -c 1 192.168.241.2 250 n1 ping -W 1 -c 1 192.168.241.2 340 n1 ping -W 1 -c 1 192.168.241.2 [all …]
|
| /linux/lib/math/ |
| 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/drivers/clk/ |
| A D | clk-si570.c | 81 unsigned int n1; member 114 if (*n1 > 1) in si570_get_divs() 115 *n1 &= ~1; in si570_get_divs() 199 unsigned int n1, hs_div; in si570_calc_divs() local 207 if (!n1 || (n1 & 1)) in si570_calc_divs() 208 n1++; in si570_calc_divs() 209 while (n1 <= 128) { in si570_calc_divs() 214 *out_n1 = n1; in si570_calc_divs() 219 n1 += (n1 == 1 ? 1 : 2); in si570_calc_divs() 234 unsigned int n1, hs_div; in si570_recalc_rate() local [all …]
|
| /linux/tools/testing/selftests/mm/ |
| 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); 175 ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0); [all …]
|
| /linux/tools/testing/selftests/kvm/lib/ |
| 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()
|
| A D | sparsebit.c | 386 assert(n1 < MASK_BITS); in node_add() 905 return nodep->idx + n1; in node_first_set() 1374 unsigned int n1; in sparsebit_set_num() local 1429 for (n1 = 0; n1 < MASK_BITS; n1++) { in sparsebit_set_num() 1456 unsigned int n1; in sparsebit_clear_num() local 1492 for (n1 = 0; n1 < MASK_BITS; n1++) { in sparsebit_clear_num() 1601 unsigned int n1; in sparsebit_dump() local 1605 for (n1 = 0; n1 < MASK_BITS; n1++) { in sparsebit_dump() 1609 for (; n1 < MASK_BITS; n1++) { in sparsebit_dump() 1689 unsigned int n1; in sparsebit_validate_internal() local [all …]
|
| /linux/security/selinux/ss/ |
| 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() 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() 232 n1 = n1->next; in ebitmap_contains() [all …]
|
| /linux/tools/testing/selftests/bpf/benchs/ |
| 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/ |
| 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()
|
| A D | clk-dualdiv.h | 14 unsigned int n1; member 22 struct parm n1; member
|
| /linux/arch/mips/bcm63xx/ |
| 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/media/pci/cobalt/ |
| 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/drivers/mfd/ |
| 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/scripts/coccinelle/iterators/ |
| 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/ |
| 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/crypto/ |
| 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/net/dccp/ccids/lib/ |
| 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/ |
| 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/arch/powerpc/platforms/ps3/ |
| A D | repository.c | 45 _dump_field("n1: ", n1, func, line); in _dump_node_name() 57 _dump_field("n1: ", n1, func, line); in _dump_node() 122 result = lv1_read_repository_node(lpar_id, n1, n2, n3, n4, &v1, in read_node() 128 dump_node_name(lpar_id, n1, n2, n3, n4); in read_node() 132 dump_node(lpar_id, n1, n2, n3, n4, v1, v2); in read_node() 1053 dump_node(0, n1, n2, n3, n4, v1, v2); in create_node() 1066 static int delete_node(u64 n1, u64 n2, u64 n3, u64 n4) in delete_node() argument 1070 dump_node(0, n1, n2, n3, n4, 0, 0); in delete_node() 1072 result = lv1_delete_repository_node(n1, n2, n3, n4); in delete_node() 1087 result = create_node(n1, n2, n3, n4, v1, v2); in write_node() [all …]
|
| /linux/arch/sparc/math-emu/ |
| 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/ |
| A D | sfp-util.h | 32 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 39 __r1 = (n1) % __d1; \ 40 __q1 = (n1) / __d1; \
|