Home
last modified time | relevance | path

Searched refs:n2 (Results 1 – 25 of 160) sorted by relevance

1234567

/dragonfly/crypto/libressl/crypto/gost/
H A Dgost2814789.c77 c2l(in, n2); in Gost2814789_encrypt()
80 n2 ^= f(key, n1 + key->key[0]); n1 ^= f(key, n2 + key->key[1]); in Gost2814789_encrypt()
81 n2 ^= f(key, n1 + key->key[2]); n1 ^= f(key, n2 + key->key[3]); in Gost2814789_encrypt()
82 n2 ^= f(key, n1 + key->key[4]); n1 ^= f(key, n2 + key->key[5]); in Gost2814789_encrypt()
83 n2 ^= f(key, n1 + key->key[6]); n1 ^= f(key, n2 + key->key[7]); in Gost2814789_encrypt()
85 n2 ^= f(key, n1 + key->key[0]); n1 ^= f(key, n2 + key->key[1]); in Gost2814789_encrypt()
100 l2c(n2, out); in Gost2814789_encrypt()
111 c2l(in, n2); in Gost2814789_decrypt()
134 l2c(n2, out); in Gost2814789_decrypt()
151 c2l(p, n2); in Gost2814789_mac()
[all …]
/dragonfly/usr.sbin/mtree/
H A Dspecspec.c102 if (n2 == NULL) { in mismatch()
116 shownode(n2, differ, path); in mismatch()
127 if (n2 != NULL && n2->type == F_LINK) in compare_nodes()
128 n2->flags &= ~F_MODE; in compare_nodes()
131 differs = n2->flags; in compare_nodes()
189 NODE *c1, *c2, *n1, *n2; in walk_in_the_forest() local
203 n1 = n2 = NULL; in walk_in_the_forest()
207 n2 = c2->next; in walk_in_the_forest()
210 n2 = c2; in walk_in_the_forest()
221 n2 = c2; in walk_in_the_forest()
[all …]
/dragonfly/crypto/libressl/crypto/bn/
H A Dbn_mul.c463 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
534 memset(&(t[n2]), 0, n2 * sizeof(BN_ULONG)); in bn_mul_recursive()
544 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_recursive()
548 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_recursive()
551 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_recursive()
673 memset(&(r[n2]), 0, sizeof(BN_ULONG) * n2); in bn_mul_part_recursive()
705 c1 = (int)(bn_add_words(t, r,&(r[n2]), n2)); in bn_mul_part_recursive()
709 c1 -= (int)(bn_sub_words(&(t[n2]), t,&(t[n2]), n2)); in bn_mul_part_recursive()
712 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_part_recursive()
781 fprintf(stderr, " bn_mul_high %d * %d\n",n2,n2); in bn_mul_high()
[all …]
H A Dbn_sqr.c206 int n = n2 / 2; in bn_sqr_recursive()
211 fprintf(stderr, " bn_sqr_recursive %d * %d\n", n2, n2); in bn_sqr_recursive()
213 if (n2 == 4) { in bn_sqr_recursive()
220 } else if (n2 == 8) { in bn_sqr_recursive()
229 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
243 p = &(t[n2*2]); in bn_sqr_recursive()
248 memset(&(t[n2]), 0, n2 * sizeof(BN_ULONG)); in bn_sqr_recursive()
257 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_sqr_recursive()
260 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_sqr_recursive()
267 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_sqr_recursive()
[all …]
/dragonfly/contrib/gmp/mpn/generic/
H A Dmullo_n.c141 mp_size_t n2, n1; in mpn_dc_mullo_n() local
164 n2 = n - n1; in mpn_dc_mullo_n()
170 mpn_mul_n (tp, xp, yp, n2); in mpn_dc_mullo_n()
171 MPN_COPY (rp, tp, n2); in mpn_dc_mullo_n()
175 mpn_mul_basecase (tp + n, xp + n2, n1, yp, n1); in mpn_dc_mullo_n()
177 mpn_mullo_basecase (tp + n, xp + n2, yp, n1); in mpn_dc_mullo_n()
179 mpn_dc_mullo_n (tp + n, xp + n2, yp, n1, tp + n); in mpn_dc_mullo_n()
180 mpn_add_n (rp + n2, tp + n2, tp + n, n1); in mpn_dc_mullo_n()
184 mpn_mul_basecase (tp + n, xp, n1, yp + n2, n1); in mpn_dc_mullo_n()
186 mpn_mullo_basecase (tp + n, xp, yp + n2, n1); in mpn_dc_mullo_n()
[all …]
H A Ddivrem_2.c69 mp_limb_t n1, n0, n2; in mpn_divrem_2() local
146 n2 = np[0]; in mpn_divrem_2()
149 if (n1 > r || (n1 == r && n0 > n2)) in mpn_divrem_2()
168 sub_ddmmss (n1, n0, r, n2, n1, n0); in mpn_divrem_2()
170 n0 = n2 - n0; in mpn_divrem_2()
H A Ddcpi1_divappr_q.c110 mp_limb_t q, n2, n1, n0, d1, d0; in mpn_dcpi1_divappr_q() local
119 n2 = np[0]; in mpn_dcpi1_divappr_q()
125 ASSERT (n2 < d1 || (n2 == d1 && n1 <= d0)); in mpn_dcpi1_divappr_q()
127 if (UNLIKELY (n2 == d1) && n1 == d0) in mpn_dcpi1_divappr_q()
131 ASSERT (cy == n2); in mpn_dcpi1_divappr_q()
135 udiv_qr_3by2 (q, n1, n0, n2, n1, n0, d1, d0, dinv->inv32); in mpn_dcpi1_divappr_q()
H A Ddcpi1_div_qr.c116 mp_limb_t q, n2, n1, n0, d1, d0; in mpn_dcpi1_div_qr() local
125 n2 = np[0]; in mpn_dcpi1_div_qr()
131 ASSERT (n2 < d1 || (n2 == d1 && n1 <= d0)); in mpn_dcpi1_div_qr()
133 if (UNLIKELY (n2 == d1) && n1 == d0) in mpn_dcpi1_div_qr()
137 ASSERT (cy == n2); in mpn_dcpi1_div_qr()
141 udiv_qr_3by2 (q, n1, n0, n2, n1, n0, d1, d0, dinv->inv32); in mpn_dcpi1_div_qr()
/dragonfly/contrib/gcc-8.0/gcc/
H A Domp-general.c71 *n2 = fold_build_pointer_plus_hwi_loc (loc, *n2, 1); in omp_adjust_for_condition()
73 *n2 = fold_build2_loc (loc, PLUS_EXPR, TREE_TYPE (*n2), *n2, in omp_adjust_for_condition()
79 *n2 = fold_build_pointer_plus_hwi_loc (loc, *n2, -1); in omp_adjust_for_condition()
81 *n2 = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (*n2), *n2, in omp_adjust_for_condition()
286 loop->n2, loop->step); in omp_extract_for_data()
296 tree n1, n2; in omp_extract_for_data() local
301 n2 = fold_build2_loc (loc, in omp_extract_for_data()
303 loop->n2, loop->step); in omp_extract_for_data()
309 loop->n2, loop->step); in omp_extract_for_data()
310 n2 = loop->n1; in omp_extract_for_data()
[all …]
H A Dipa-profile.c495 struct cgraph_node *n,*n2; in ipa_profile() local
590 if (n2) in ipa_profile()
597 n2->dump_name (), in ipa_profile()
617 && n2->can_be_discarded_p ()) in ipa_profile()
627 (IPA_NODE_REF (n2)->descriptors)) in ipa_profile()
628 && ipa_get_param_count (IPA_NODE_REF (n2)) in ipa_profile()
630 && (ipa_get_param_count (IPA_NODE_REF (n2)) in ipa_profile()
632 || !stdarg_p (TREE_TYPE (n2->decl)))) in ipa_profile()
657 if (!n2->can_be_discarded_p ()) in ipa_profile()
662 n2 = alias; in ipa_profile()
[all …]
/dragonfly/usr.bin/comm/
H A Dcomm.c65 ssize_t n1, n2; in main() local
112 n1 = n2 = -1; in main()
125 n2 = getline(&line2, &line2len, fp2); in main()
126 if (n2 < 0 && ferror(fp2)) in main()
128 if (n2 > 0 && line2[n2 - 1] == '\n') in main()
129 line2[n2 - 1] = '\0'; in main()
134 if (n2 >= 0 && col2 != NULL) in main()
138 if (n2 < 0) { in main()
/dragonfly/bin/sh/
H A Dparser.c283 n2 = andor(); in list()
286 if (n2 != NULL && n2->type == NPIPE) { in list()
288 } else if (n2 != NULL && n2->type == NREDIR) { in list()
295 n2 = n3; in list()
299 ntop = n2; in list()
407 n2->type = NNOT; in pipeline()
409 return n2; in pipeline()
448 n2 = n1; in command()
451 n2 = n2->nif.elsepart; in command()
489 *app = n2; in command()
[all …]
/dragonfly/contrib/cvs-1.12/src/
H A Dhardlink.c225 Node *n1, *n2; in compare_linkage_lists() local
232 n2 = links2->list->next; in compare_linkage_lists()
234 while (n1 != links1->list && n2 != links2->list) in compare_linkage_lists()
243 p2 = strrchr (n2->key, '/'); in compare_linkage_lists()
245 p2 = n2->key; in compare_linkage_lists()
254 n2 = n2->next; in compare_linkage_lists()
259 return (n1 == links1->list && n2 == links2->list); in compare_linkage_lists()
/dragonfly/crypto/libressl/crypto/idea/
H A Di_skey.c130 long n1,n2,q,r,b1,b2,t; in inverse() local
137 n2=xin; in inverse()
142 r=(n1%n2); in inverse()
143 q=(n1-r)/n2; in inverse()
148 n1=n2; in inverse()
149 n2=r; in inverse()
/dragonfly/usr.bin/enigma/
H A Denigma.c87 int i, n1, n2, nr1, nr2; in main() local
114 n2 = 0; in main()
129 n2++; in main()
130 if(n2==ROTORSZ) n2 = 0; in main()
134 nr2 = n2; in main()
/dragonfly/contrib/ncurses/ncurses/tinfo/
H A Dcomp_parse.c106 check_collisions(char *n1, char *n2, int counter) in check_collisions() argument
113 n2 = ForceBar(nc2, n2); in check_collisions()
118 n2 = skip_index(n2); in check_collisions()
123 for (qstart = n2; (qend = strchr(qstart, '|')); qstart = qend + 1) { in check_collisions()
162 remove_collision(char *n1, char *n2) in remove_collision() argument
164 char *p2 = n2; in remove_collision()
171 p2 = n2 = skip_index(n2); in remove_collision()
176 for (qstart = n2; (qend = name_ending(qstart)); qstart = next_name(qend)) { in remove_collision()
199 _nc_entry_match(char *n1, char *n2) in _nc_entry_match() argument
201 return check_collisions(n1, n2, 0); in _nc_entry_match()
/dragonfly/lib/libc/stdio/
H A Dxprintf_float.c71 n2 = (ep) - (p); \
72 if (n2 > (len)) \
73 n2 = (len); \
74 if (n2 > 0) \
75 ret += __printf_puts(io, (p), n2); \
76 ret += __printf_pad(io, (len) - (n2 > 0 ? n2 : 0), (with)); \
173 int n2; /* XXX: for PRINTANDPAD */ in __printf_render_float() local
H A Dprintf-pos.c185 int n2; in addaster() local
187 n2 = 0; in addaster()
190 n2 = 10 * n2 + to_digit(*cp); in addaster()
195 types->nextarg = n2; in addaster()
211 int n2; in addwaster() local
213 n2 = 0; in addwaster()
216 n2 = 10 * n2 + to_digit(*cp); in addwaster()
221 types->nextarg = n2; in addwaster()
/dragonfly/usr.bin/localedef/
H A Dcharmap.c55 static int cmap_compare_sym(const void *n1, const void *n2);
56 static int cmap_compare_wc(const void *n1, const void *n2);
190 cmap_compare_sym(const void *n1, const void *n2) in cmap_compare_sym() argument
193 const charmap_t *c2 = n2; in cmap_compare_sym()
201 cmap_compare_wc(const void *n1, const void *n2) in cmap_compare_wc() argument
204 const charmap_t *c2 = n2; in cmap_compare_wc()
H A Dcollate.c352 weight_compare(const void *n1, const void *n2) in weight_compare() argument
355 int32_t k2 = ((const weight_t *)n2)->pri; in weight_compare()
364 collsym_compare(const void *n1, const void *n2) in collsym_compare() argument
367 const collsym_t *c2 = n2; in collsym_compare()
381 const collundef_t *c2 = n2; in collundef_compare()
395 const collelem_t *c2 = n2; in element_compare_symbol()
409 const collelem_t *c2 = n2; in element_compare_expand()
420 collchar_compare(const void *n1, const void *n2) in collchar_compare() argument
423 wchar_t k2 = ((const collchar_t *)n2)->wc; in collchar_compare()
432 subst_compare(const void *n1, const void *n2) in subst_compare() argument
[all …]
/dragonfly/contrib/ncurses/ncurses/base/
H A Dlib_instr.c74 int n2; in NCURSES_EXPORT() local
76 n2 = getcchar(cell, 0, 0, 0, 0); in NCURSES_EXPORT()
77 if (n2 > 0 in NCURSES_EXPORT()
78 && (wch = typeCalloc(wchar_t, (unsigned) n2 + 1)) != 0) { in NCURSES_EXPORT()
/dragonfly/usr.sbin/sa/
H A Dmain.c463 double n1, n2; in cmp_avgdkio() local
469 n2 = (double) c2.ci_io / (double) (c2.ci_calls ? c2.ci_calls : 1); in cmp_avgdkio()
471 if (n1 < n2) in cmp_avgdkio()
473 else if (n1 == n2) in cmp_avgdkio()
502 double n1, n2; in cmp_avgcpumem() local
511 n2 = (double) c2.ci_mem / (double) (t2 ? t2 : 1); in cmp_avgcpumem()
513 if (n1 < n2) in cmp_avgcpumem()
515 else if (n1 == n2) in cmp_avgcpumem()
/dragonfly/contrib/gmp/mpz/
H A Dpprime_p.c43 mpz_t n2; in mpz_probab_prime_p() local
55 PTR(n2) = PTR(n); in mpz_probab_prime_p()
56 SIZ(n2) = -SIZ(n); in mpz_probab_prime_p()
57 n = n2; in mpz_probab_prime_p()
/dragonfly/contrib/mpfr/src/
H A Dconst_log2.c49 S (mpz_t *T, mpz_t *P, mpz_t *Q, unsigned long n1, unsigned long n2, int need_P) in S() argument
51 if (n2 == n1 + 1) in S()
73 unsigned long m = (n1 / 2) + (n2 / 2) + (n1 & 1UL & n2); in S()
77 S (T + 1, P + 1, Q + 1, m, n2, need_P); in S()
/dragonfly/lib/libutil/
H A Dlogin_cap.c445 rmultiply(u_quad_t n1, u_quad_t n2) in rmultiply() argument
453 if (n1 == 0 || n2 == 0) in rmultiply()
456 return n2; in rmultiply()
457 if (n2 == 1) in rmultiply()
477 for (b2 = bpw; (((u_quad_t)1 << (b2-1)) & n2) == 0; --b2) in rmultiply()
504 m = (n1 >> 1) * (n2 >> 1); in rmultiply()
511 r = (n1 & n2 & 1) in rmultiply()
512 + (n2 & 1) * (n1 & ~(u_quad_t)1) in rmultiply()
513 + (n1 & 1) * (n2 & ~(u_quad_t)1); in rmultiply()

1234567