Home
last modified time | relevance | path

Searched refs:n1 (Results 1 – 25 of 628) sorted by relevance

12345678910>>...26

/netbsd-src/external/bsd/pcc/dist/pcc/cc/cpp/
H A Dcpc.c40 void qloop(void (*fun)(ND *), ND *n1, int a0, int a1, int a2, int a3);
43 void expr(ND *n1);
44 void eqcol(ND *n1);
45 void eoror(ND *n1);
46 void eandand(ND *n1);
47 void exor(ND *n1);
48 void eand(ND *n1);
49 void eqne(ND *n1);
50 void eget(ND *n1);
51 void elrs(ND *n1);
[all …]
/netbsd-src/external/gpl3/gcc/dist/libgcc/config/alpha/
H A Dqrnnd.S50 #define n1 $17 macro
60 addq n1,n1,n1
61 bis n1,tmp,n1
63 cmpule d,n1,qb
64 subq n1,d,tmp
65 cmovne qb,tmp,n1
68 addq n1,n1,n1
69 bis n1,tmp,n1
71 cmpule d,n1,qb
72 subq n1,d,tmp
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgcc/config/alpha/
H A Dqrnnd.S50 #define n1 $17 macro
60 addq n1,n1,n1
61 bis n1,tmp,n1
63 cmpule d,n1,qb
64 subq n1,d,tmp
65 cmovne qb,tmp,n1
68 addq n1,n1,n1
69 bis n1,tmp,n1
71 cmpule d,n1,qb
72 subq n1,d,tmp
[all …]
/netbsd-src/external/gpl3/gcc/dist/libquadmath/printf/
H A Ddivrem.c69 mp_limb_t n1; local
73 n1 = np[nsize - 1];
75 if (n1 >= d)
77 n1 -= d;
83 udiv_qrnnd (qp[i], n1, n1, np[i], d);
87 udiv_qrnnd (qp[i], n1, n1, 0, d);
89 np[0] = n1;
96 mp_limb_t n1, n0, n2; local
102 n1 = np[1];
105 if (n1 >= d1 && (n1 > d1 || n0 >= d0))
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libquadmath/printf/
H A Ddivrem.c69 mp_limb_t n1; local
73 n1 = np[nsize - 1];
75 if (n1 >= d)
77 n1 -= d;
83 udiv_qrnnd (qp[i], n1, n1, np[i], d);
87 udiv_qrnnd (qp[i], n1, n1, 0, d);
89 np[0] = n1;
96 mp_limb_t n1, n0, n2; local
102 n1 = np[1];
105 if (n1 >= d1 && (n1 > d1 || n0 >= d0))
[all …]
/netbsd-src/external/gpl3/gcc/dist/libgfortran/generated/
H A Dbessel_r4.c38 extern void bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1,
43 bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x) in bessel_jn_r4() argument
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r4()
60 if (unlikely (n2 < n1)) in bessel_jn_r4()
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r4()
66 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r4()
74 for (i = 1; i <= n2-n1; i++) in bessel_jn_r4()
80 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r4()
82 if (n1 == n2) in bessel_jn_r4()
86 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r4()
[all …]
H A Dbessel_r16.c42 extern void bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1,
47 bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x) in bessel_jn_r16() argument
58 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r16()
64 if (unlikely (n2 < n1)) in bessel_jn_r16()
68 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r16()
70 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r16()
78 for (i = 1; i <= n2-n1; i++) in bessel_jn_r16()
84 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r16()
86 if (n1 == n2) in bessel_jn_r16()
90 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r16()
[all …]
H A Dbessel_r10.c38 extern void bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1,
43 bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x) in bessel_jn_r10() argument
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r10()
60 if (unlikely (n2 < n1)) in bessel_jn_r10()
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r10()
66 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r10()
74 for (i = 1; i <= n2-n1; i++) in bessel_jn_r10()
80 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r10()
82 if (n1 == n2) in bessel_jn_r10()
86 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r10()
[all …]
H A Dbessel_r17.c42 extern void bessel_jn_r17 (gfc_array_r17 * const restrict ret, int n1,
47 bessel_jn_r17 (gfc_array_r17 * const restrict ret, int n1, int n2, GFC_REAL_17 x) in bessel_jn_r17() argument
58 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r17()
64 if (unlikely (n2 < n1)) in bessel_jn_r17()
68 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r17()
70 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r17()
78 for (i = 1; i <= n2-n1; i++) in bessel_jn_r17()
84 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r17()
86 if (n1 == n2) in bessel_jn_r17()
90 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r17()
[all …]
H A Dbessel_r8.c38 extern void bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1,
43 bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x) in bessel_jn_r8() argument
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r8()
60 if (unlikely (n2 < n1)) in bessel_jn_r8()
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r8()
66 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r8()
74 for (i = 1; i <= n2-n1; i++) in bessel_jn_r8()
80 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r8()
82 if (n1 == n2) in bessel_jn_r8()
86 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r8()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgfortran/generated/
H A Dbessel_r4.c38 extern void bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1,
43 bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x) in bessel_jn_r4() argument
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r4()
60 if (unlikely (n2 < n1)) in bessel_jn_r4()
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r4()
66 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r4()
74 for (i = 1; i <= n2-n1; i++) in bessel_jn_r4()
80 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r4()
82 if (n1 == n2) in bessel_jn_r4()
86 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r4()
[all …]
H A Dbessel_r16.c42 extern void bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1,
47 bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x) in bessel_jn_r16() argument
58 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r16()
64 if (unlikely (n2 < n1)) in bessel_jn_r16()
68 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r16()
70 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r16()
78 for (i = 1; i <= n2-n1; i++) in bessel_jn_r16()
84 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r16()
86 if (n1 == n2) in bessel_jn_r16()
90 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r16()
[all …]
H A Dbessel_r10.c38 extern void bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1,
43 bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x) in bessel_jn_r10() argument
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r10()
60 if (unlikely (n2 < n1)) in bessel_jn_r10()
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r10()
66 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r10()
74 for (i = 1; i <= n2-n1; i++) in bessel_jn_r10()
80 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r10()
82 if (n1 == n2) in bessel_jn_r10()
86 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r10()
[all …]
H A Dbessel_r8.c38 extern void bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1,
43 bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x) in bessel_jn_r8() argument
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r8()
60 if (unlikely (n2 < n1)) in bessel_jn_r8()
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1)) in bessel_jn_r8()
66 "(%ld vs. %ld)", (long int) n2-n1, in bessel_jn_r8()
74 for (i = 1; i <= n2-n1; i++) in bessel_jn_r8()
80 ret->base_addr[(n2-n1)*stride] = last1; in bessel_jn_r8()
82 if (n1 == n2) in bessel_jn_r8()
86 ret->base_addr[(n2-n1-1)*stride] = last2; in bessel_jn_r8()
[all …]
/netbsd-src/usr.sbin/mtree/
H A Dspecspec.c106 mismatch(NODE *n1, NODE *n2, int differ, char const *path) in mismatch() argument
110 shownode(n1, differ, path); in mismatch()
113 if (n1 == NULL) { in mismatch()
121 shownode(n1, differ, path); in mismatch()
128 compare_nodes(NODE *n1, NODE *n2, char const *path) in compare_nodes() argument
132 if (n1 != NULL && n1->type == F_LINK) in compare_nodes()
133 n1->flags &= ~F_MODE; in compare_nodes()
137 if (n1 == NULL && n2 != NULL) { in compare_nodes()
139 mismatch(n1, n2, differs, path); in compare_nodes()
142 if (n1 != NULL && n2 == NULL) { in compare_nodes()
[all …]
/netbsd-src/external/lgpl3/gmp/dist/mpn/generic/
H A Dsbpi1_divappr_q.c51 mp_limb_t n1, n0; in mpn_sbpi1_divappr_q() local
83 n1 = np[1]; in mpn_sbpi1_divappr_q()
88 if (UNLIKELY (n1 == d1) && np[1] == d0) in mpn_sbpi1_divappr_q()
92 n1 = np[1]; /* update n1, last loop's value will now be invalid */ in mpn_sbpi1_divappr_q()
96 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv); in mpn_sbpi1_divappr_q()
102 cy = n1 < cy1; in mpn_sbpi1_divappr_q()
103 n1 -= cy1; in mpn_sbpi1_divappr_q()
108 n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1); in mpn_sbpi1_divappr_q()
123 if (UNLIKELY (n1 >= (d1 & flag))) in mpn_sbpi1_divappr_q()
128 if (UNLIKELY (n1 != cy)) in mpn_sbpi1_divappr_q()
[all …]
H A Dsbpi1_div_q.c50 mp_limb_t n1, n0; in mpn_sbpi1_div_q() local
86 n1 = np[1]; in mpn_sbpi1_div_q()
91 if (UNLIKELY (n1 == d1) && np[1] == d0) in mpn_sbpi1_div_q()
95 n1 = np[1]; /* update n1, last loop's value will now be invalid */ in mpn_sbpi1_div_q()
99 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv); in mpn_sbpi1_div_q()
105 cy = n1 < cy1; in mpn_sbpi1_div_q()
106 n1 -= cy1; in mpn_sbpi1_div_q()
111 n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1); in mpn_sbpi1_div_q()
126 if (UNLIKELY (n1 >= (d1 & flag))) in mpn_sbpi1_div_q()
131 if (UNLIKELY (n1 != cy)) in mpn_sbpi1_div_q()
[all …]
H A Dmullo_n.c139 mp_size_t n2, n1; in mpn_dc_mullo_n() local
151 n1 = n >> 1; in mpn_dc_mullo_n()
153 n1 = n * 11 / (size_t) 36; /* n1 ~= n*(1-.694...) */ in mpn_dc_mullo_n()
155 n1 = n * 9 / (size_t) 40; /* n1 ~= n*(1-.775...) */ in mpn_dc_mullo_n()
157 n1 = n * 7 / (size_t) 39; /* n1 ~= n*(1-.821...) */ in mpn_dc_mullo_n()
160 n1 = n / (size_t) 10; /* n1 ~= n*(1-.899...) [TOOM88] */ in mpn_dc_mullo_n()
162 n2 = n - n1; in mpn_dc_mullo_n()
172 if (BELOW_THRESHOLD (n1, MULLO_BASECASE_THRESHOLD)) in mpn_dc_mullo_n()
173 mpn_mul_basecase (tp + n, xp + n2, n1, yp, n1); in mpn_dc_mullo_n()
174 else if (BELOW_THRESHOLD (n1, MULLO_DC_THRESHOLD)) in mpn_dc_mullo_n()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgcc/config/spu/
H A Ddivmodti4.c97 qword mask, r1, n1; in __udivmodti4() local
107 n1 = si_bg (d0, n0); in __udivmodti4()
108 n1 = si_shlqbyi (n1, 4); in __udivmodti4()
109 n1 = si_sf (m1, n1); in __udivmodti4()
110 n1 = si_bgx (d0, n0, n1); in __udivmodti4()
111 n1 = si_shlqbyi (n1, 4); in __udivmodti4()
112 n1 = si_sf (m1, n1); in __udivmodti4()
113 n1 = si_bgx (d0, n0, n1); in __udivmodti4()
114 n1 = si_shlqbyi (n1, 4); in __udivmodti4()
115 n1 = si_sf (m1, n1); in __udivmodti4()
[all …]
/netbsd-src/external/lgpl3/gmp/dist/mpn/pa64/
H A Dudiv.asm47 add,dc n1,n1,n1
48 sub,*<< n1,d,%r22
49 copy %r22,n1')
53 add,dc n1,n1,n1
54 sub n1,d,%r1
56 cmpclr,*<< n1,d,%r0
57 copy %r1,n1
87 std n1,0(remptr) C store remainder
91 shrpd n1,n0,1,n0 C n0 = lo(n1n0 >> 1)
92 shrpd %r0,n1,1,n1 C n1 = hi(n1n0 >> 1)
[all …]
/netbsd-src/external/gpl3/gdb/dist/sim/testsuite/cris/asm/
H A Dscc.ms2 # output: 1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n0\n1\n0\n0\n1\n1\n0\…
/netbsd-src/external/gpl3/gcc/dist/libgfortran/m4/
H A Dbessel.m439 extern void bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1,
44 bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1, int n2, 'rtype_name` x)
55 size_t size = n2 < n1 ? 0 : n2-n1+1;
61 if (unlikely (n2 < n1))
65 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
67 "(%ld vs. %ld)", (long int) n2-n1,
75 for (i = 1; i <= n2-n1; i++)
81 ret->base_addr[(n2-n1)*stride] = last1;
83 if (n1 == n2)
87 ret->base_addr[(n2-n1-1)*stride] = last2;
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgfortran/m4/
H A Dbessel.m439 extern void bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1,
44 bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1, int n2, 'rtype_name` x)
55 size_t size = n2 < n1 ? 0 : n2-n1+1;
61 if (unlikely (n2 < n1))
65 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
67 "(%ld vs. %ld)", (long int) n2-n1,
75 for (i = 1; i <= n2-n1; i++)
81 ret->base_addr[(n2-n1)*stride] = last1;
83 if (n1 == n2)
87 ret->base_addr[(n2-n1-1)*stride] = last2;
[all …]
/netbsd-src/usr.bin/spell/spellprog/
H A Dspellprog.c142 int n1; member
150 { .suf = "ssen", .p1 = ily, .n1 = 4,
152 { .suf = "ssel", .p1 = ily, .n1 = 4,
154 { .suf = "se", .p1 = s, .n1 = 1,
157 { .suf = "s'", .p1 = s, .n1 = 2,
159 { .suf = "s", .p1 = s, .n1 = 1,
161 { .suf = "ecn", .p1 = ncy, .n1 = 1,
163 { .suf = "ycn", .p1 = ncy, .n1 = 1,
165 { .suf = "ytilb", .p1 = nop, .n1 = 0,
167 { .suf = "ytilib", .p1 = bility, .n1 = 5,
[all …]
/netbsd-src/external/lgpl3/gmp/dist/mpn/sparc64/
H A Ddivrem_1.c89 unsigned *qp, n1, n0, q, r, nshift, norm_rmask; in mpn_divrem_1() local
106 n1 = ap[size-1 + HALF_ENDIAN_ADJ(1)]; in mpn_divrem_1()
111 if (n1 == 0) in mpn_divrem_1()
113 n1 = ap[size-2 + HALF_ENDIAN_ADJ(0)]; in mpn_divrem_1()
123 if (n1 < d_limb) in mpn_divrem_1()
125 r = n1; in mpn_divrem_1()
148 n1 = ap[i + adj]; in mpn_divrem_1()
150 r |= ((n1 >> norm_rshift) & norm_rmask); in mpn_divrem_1()
155 nshift = (n1 << norm) | ((n0 >> norm_rshift) & norm_rmask); in mpn_divrem_1()
158 n1 = n0; in mpn_divrem_1()
[all …]

12345678910>>...26