Home
last modified time | relevance | path

Searched refs:n1 (Results 1 - 25 of 172) sorted by relevance

1234567

/kernel/linux/linux-5.10/arch/alpha/math-emu/
H A Dqrnnd.S43 #define n1 $17 define
53 addq n1,n1,n1
54 bis n1,tmp,n1
56 cmpule d,n1,qb
57 subq n1,d,tmp
58 cmovne qb,tmp,n1
61 addq n1,n
[all...]
/kernel/linux/linux-6.6/arch/alpha/lib/
H A Dudiv-qrnnd.S44 #define n1 $17 define
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,n
[all...]
/kernel/linux/linux-5.10/arch/powerpc/math-emu/
H A Dudivmodti4.c11 _FP_W_TYPE n1, _FP_W_TYPE n0, in _fp_udivmodti4()
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, n in _fp_udivmodti4()
10 _fp_udivmodti4(_FP_W_TYPE q[2], _FP_W_TYPE r[2], _FP_W_TYPE n1, _FP_W_TYPE n0, _FP_W_TYPE d1, _FP_W_TYPE d0) _fp_udivmodti4() argument
[all...]
/kernel/linux/linux-6.6/arch/powerpc/math-emu/
H A Dudivmodti4.c11 _FP_W_TYPE n1, _FP_W_TYPE n0, in _fp_udivmodti4()
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, n in _fp_udivmodti4()
10 _fp_udivmodti4(_FP_W_TYPE q[2], _FP_W_TYPE r[2], _FP_W_TYPE n1, _FP_W_TYPE n0, _FP_W_TYPE d1, _FP_W_TYPE d0) _fp_udivmodti4() argument
[all...]
/kernel/linux/linux-5.10/lib/mpi/
H A Dmpih-div.c33 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()
75 * && divisor_limb > ((n1 << 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()
134 * && divisor_limb > ((n1 << normalization_step in mpihelp_mod_1()
207 mpi_limb_t n1; mpihelp_divrem() local
233 mpi_limb_t n1, n0, n2; mpihelp_divrem() local
316 mpi_limb_t n1, n2; mpihelp_divrem() local
384 mpi_limb_t n1, n0, r; mpihelp_divmod_1() local
[all...]
H A Dlonglong.h144 #define udiv_qrnnd(q, r, n1, n0, d) \
148 : "1" ((USItype)(n1)), \
162 #define udiv_qrnnd(q, r, n1, n0, d) \
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) \
384 __xx.__i.__h = n1; __xx.__i.__l = n0; \
421 #define udiv_qrnnd(q, r, n1, n0, d) \
426 "1" ((USItype)(n1)), \
[all...]
/kernel/linux/linux-6.6/lib/crypto/mpi/
H A Dmpih-div.c33 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()
75 * && divisor_limb > ((n1 << 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()
134 * && divisor_limb > ((n1 << normalization_step in mpihelp_mod_1()
207 mpi_limb_t n1; mpihelp_divrem() local
233 mpi_limb_t n1, n0, n2; mpihelp_divrem() local
316 mpi_limb_t n1, n2; mpihelp_divrem() local
384 mpi_limb_t n1, n0, r; mpihelp_divmod_1() local
[all...]
/kernel/linux/linux-5.10/lib/math/
H A Drational.c44 * n2/d2, n1/d1, and n0/d0 are our successively more accurate in rational_best_approximation()
50 unsigned long n, d, n0, d0, n1, d1, n2, d2; in rational_best_approximation() local
54 n1 = d0 = 1; in rational_best_approximation()
73 n2 = n0 + a * n1; in rational_best_approximation()
86 if (n1) in rational_best_approximation()
87 t = min(t, (max_numerator - n0) / n1); in rational_best_approximation()
94 n1 = n0 + t * n1; in rational_best_approximation()
99 n0 = n1; in rational_best_approximation()
100 n1 in rational_best_approximation()
[all...]
/kernel/linux/linux-5.10/tools/testing/selftests/wireguard/
H A Dnetns.sh36 n1() { pretty 1 "$*"; maybe_exec ip netns exec $netns1 "$@"; } function
98 n1 wg set wg0 \
119 n1 ping -c 10 -f -W 1 192.168.241.2
123 n1 ping6 -c 10 -f -W 1 fd00::2
128 n1 iperf3 -Z -t 3 -c 192.168.241.2
131 n1 iperf3 -s -1 -B fd00::1 &
136 n1 iperf3 -s -1 -B 192.168.241.1 &
143 n1 iperf3 -Z -t 3 -b 0 -u -c fd00::2
153 n1 iperf3 -Z -t 3 -p $(( 5200 + i )) -c 192.168.241.2 &
163 n1 w
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/wireguard/
H A Dnetns.sh38 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...]
/kernel/liteos_a/testsuites/kernel/sample/kernel_base/core/task/full/
H A DIt_los_task_141.c51 UINT32 n1 = 0; in FloatTestInTask() local
59 __asm__ __volatile__("vmrs %0, fpscr\n" : "=r"(n1)::); // n1 is fpscr in FloatTestInTask()
60 g_fpsrc01 = n1; in FloatTestInTask()
61 dprintf("before schual fpscr = %x\n", n1); in FloatTestInTask()
63 __asm__ __volatile__("vmrs %0, fpscr\n" : "=r"(n1)::); // need equals to before delay 's fpscr in FloatTestInTask()
65 g_fpsrc02 = n1; in FloatTestInTask()
66 dprintf("after resume fpscr = %x\n", n1); in FloatTestInTask()
103 UINT32 n1 = 0; in Testcase() local
108 __asm__ __volatile__("vmrs %0, fpscr\n" : "=r"(n1) in Testcase()
[all...]
H A DIt_los_task_142.c51 UINT32 n1 = 0; in ItHwi() local
55 __asm__ __volatile__("vmrs %0, fpscr\n" : "=r"(n1)::); // n1 is fpscr in ItHwi()
56 g_fpsrc03 = n1; in ItHwi()
57 dprintf("after change fpscr = %x\n", n1); in ItHwi()
80 UINT32 n1 = 0; in Testcase() local
84 __asm__ __volatile__("vmrs %0, fpscr\n" : "=r"(n1)::); // n1 is fpscr in Testcase()
85 g_fpsrc01 = n1; in Testcase()
86 dprintf("before schual fpscr = %x\n", n1); in Testcase()
[all...]
/kernel/linux/linux-6.6/lib/math/
H A Drational.c45 * n2/d2, n1/d1, and n0/d0 are our successively more accurate in rational_best_approximation()
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 in rational_best_approximation()
[all...]
/kernel/linux/linux-5.10/drivers/clk/
H A Dclk-si570.c59 * @n1: Clock divider N1
71 unsigned int n1; member
88 * @n1: Divider N1 (output)
95 unsigned int *n1, unsigned int *hs_div) in si570_get_divs()
107 *n1 = ((reg[0] & N1_6_2_MASK) << 2) + ((reg[1] & N1_1_0_MASK) >> 6) + 1; in si570_get_divs()
109 if (*n1 > 1) in si570_get_divs()
110 *n1 &= ~1; in si570_get_divs()
135 err = si570_get_divs(data, &data->rfreq, &data->n1, &data->hs_div); in si570_get_defaults()
143 fdco = fout * data->n1 * data->hs_div; in si570_get_defaults()
163 reg[0] = ((data->n1 in si570_update_rfreq()
94 si570_get_divs(struct clk_si570 *data, u64 *rfreq, unsigned int *n1, unsigned int *hs_div) si570_get_divs() argument
190 unsigned int n1, hs_div; si570_calc_divs() local
225 unsigned int n1, hs_div; si570_recalc_rate() local
245 unsigned int n1, hs_div; si570_round_rate() local
[all...]
/kernel/linux/linux-6.6/drivers/clk/
H A Dclk-si570.c59 * @n1: Clock divider N1
71 unsigned int n1; member
88 * @n1: Divider N1 (output)
95 unsigned int *n1, unsigned int *hs_div) in si570_get_divs()
107 *n1 = ((reg[0] & N1_6_2_MASK) << 2) + ((reg[1] & N1_1_0_MASK) >> 6) + 1; in si570_get_divs()
109 if (*n1 > 1) in si570_get_divs()
110 *n1 &= ~1; in si570_get_divs()
139 err = si570_get_divs(data, &data->rfreq, &data->n1, &data->hs_div); in si570_get_defaults()
147 fdco = fout * data->n1 * data->hs_div; in si570_get_defaults()
167 reg[0] = ((data->n1 in si570_update_rfreq()
94 si570_get_divs(struct clk_si570 *data, u64 *rfreq, unsigned int *n1, unsigned int *hs_div) si570_get_divs() argument
194 unsigned int n1, hs_div; si570_calc_divs() local
229 unsigned int n1, hs_div; si570_recalc_rate() local
249 unsigned int n1, hs_div; si570_round_rate() local
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/mm/
H A Dmigration.c28 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
90 n2 = n1; in migrate()
91 n1 = tmp; in migrate()
123 if (self->nthreads < 2 || self->n1 < 0 || self->n2 < 0)
135 ASSERT_EQ(migrate(ptr, self->n1, self->n2), 0);
149 if (self->nthreads < 2 || self->n1 <
[all...]
/kernel/linux/linux-5.10/tools/testing/selftests/kvm/lib/
H A Delf.c138 for (unsigned int n1 = 0; n1 < hdr.e_phnum; n1++) { in kvm_vm_elf_load()
140 offset = hdr.e_phoff + (n1 * hdr.e_phentsize); in kvm_vm_elf_load()
146 n1, filename, (intmax_t) offset_rv, errno); in kvm_vm_elf_load()
160 n1, (uint64_t) phdr.p_memsz); in kvm_vm_elf_load()
174 n1, seg_vstart, vaddr); in kvm_vm_elf_load()
190 n1, errno, (intmax_t) offset_rv, in kvm_vm_elf_load()
H A Dsparsebit.c383 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()
904 int n1 = __builtin_ctz(nodep->mask & -leading); in node_first_set() local
906 return nodep->idx + n1; in node_first_set()
912 int n1 = __builtin_ctz(~nodep->mask & -leading); in node_first_clear() local
914 return nodep->idx + n1; in node_first_clear()
1375 unsigned int n1; in sparsebit_set_num() local
1430 for (n1 in sparsebit_set_num()
1457 unsigned int n1; sparsebit_clear_num() local
1602 unsigned int n1; sparsebit_dump() local
1690 unsigned int n1; sparsebit_validate_internal() local
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/kvm/lib/
H A Delf.c137 for (unsigned int n1 = 0; n1 < hdr.e_phnum; n1++) { in kvm_vm_elf_load()
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 Dsparsebit.c383 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 in sparsebit_set_num()
1456 unsigned int n1; sparsebit_clear_num() local
1601 unsigned int n1; sparsebit_dump() local
1689 unsigned int n1; sparsebit_validate_internal() local
[all...]
/kernel/linux/linux-5.10/security/selinux/ss/
H A Debitmap.c33 struct ebitmap_node *n1, *n2; in ebitmap_cmp() local
38 n1 = e1->node; in ebitmap_cmp()
40 while (n1 && n2 && in ebitmap_cmp()
41 (n1->startbit == n2->startbit) && in ebitmap_cmp()
42 !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) { in ebitmap_cmp()
43 n1 = n1->next; in ebitmap_cmp()
47 if (n1 || n2) in ebitmap_cmp()
222 struct ebitmap_node *n1, *n2; in ebitmap_contains() local
228 n1 in ebitmap_contains()
[all...]
/kernel/linux/linux-6.6/security/selinux/ss/
H A Debitmap.c33 const struct ebitmap_node *n1, *n2; in ebitmap_cmp() local
38 n1 = e1->node; in ebitmap_cmp()
40 while (n1 && n2 && in ebitmap_cmp()
41 (n1->startbit == n2->startbit) && in ebitmap_cmp()
42 !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) { in ebitmap_cmp()
43 n1 = n1->next; in ebitmap_cmp()
47 if (n1 || n2) in ebitmap_cmp()
223 const struct ebitmap_node *n1, *n2; in ebitmap_contains() local
229 n1 in ebitmap_contains()
[all...]
/kernel/linux/linux-5.10/drivers/clk/meson/
H A Dclk-dualdiv.c41 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()
115 meson_parm_write(clk->map, &dualdiv->n1, setting->n1 - 1); in meson_clk_dualdiv_set_rate()
/kernel/linux/linux-6.6/drivers/clk/meson/
H A Dclk-dualdiv.c41 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()
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/benchs/
H A Drun_common.sh62 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)

Completed in 12 milliseconds

1234567