Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 176) sorted by relevance

12345678

/openssh-portable/
H A Dsc25519.c38 for(i=0;i<32;i++) in reduce_add_sub()
46 for(i=0;i<32;i++) in reduce_add_sub()
63 for (i = 0;i < 66;++i) q2[i] = 0; in barrett_reduce()
74 for(i=0;i<33;i++)r1[i] = x[i]; in barrett_reduce()
106 for(i=0;i<32;i++) t[i] = x[i]; in sc25519_from32bytes()
107 for(i=32;i<64;++i) t[i] = 0; in sc25519_from32bytes()
114 for(i=0;i<16;i++) r->v[i] = x[i]; in shortsc25519_from16bytes()
121 for(i=0;i<64;i++) t[i] = x[i]; in sc25519_from64bytes()
137 for(i=0;i<32;i++) r[i] = x->v[i]; in sc25519_to32bytes()
170 for(i=0;i<32;i++) r->v[i] = x->v[i] + y->v[i]; in sc25519_add()
[all …]
H A Dsntrup761.c523 for (i = 0;i < p;++i) h[i] = fg[i]; in R3_mult()
538 for (i = 0;i < p;++i) g[p-1-i] = in[i]; in R3_recip()
544 for (i = p;i > 0;--i) v[i] = v[i-1]; in R3_recip()
560 for (i = 0;i < p;++i) g[i] = g[i+1]; in R3_recip()
597 for (i = 0;i < p;++i) h[i] = fg[i]; in Rq_mult_small()
631 for (i = p;i > 0;--i) v[i] = v[i-1]; in Rq_recip3()
648 for (i = 0;i < p;++i) g[i] = g[i+1]; in Rq_recip3()
665 for (i = 0;i < p;++i) out[i] = a[i]-F3_freeze(a[i]); in Round()
695 for (i = 0;i < 32;++i) out[i] = h[i]; in Hash_prefix()
834 for (i = 0;i < I;++i) s[i>>3] |= r[i]<<(i&7); in Inputs_encode()
[all …]
H A Dfe25519.c54 for(i=0;i<31;i++) in reduce_add_sub()
88 for(i=30;i>0;i--) in fe25519_freeze()
103 for(i=0;i<32;i++) r->v[i] = x[i]; in fe25519_unpack()
146 for(i=0;i<32;i++) r->v[i] ^= mask & (x->v[i] ^ r->v[i]); in fe25519_cmov()
160 for(i=1;i<32;i++) r->v[i]=0; in fe25519_setone()
166 for(i=0;i<32;i++) r->v[i]=0; in fe25519_setzero()
173 for(i=0;i<32;i++) t.v[i]=x->v[i]; in fe25519_neg()
181 for(i=0;i<32;i++) r->v[i] = x->v[i] + y->v[i]; in fe25519_add()
191 for(i=1;i<31;i++) t[i] = x->v[i] + 0x1fe; in fe25519_sub()
192 for(i=0;i<32;i++) r->v[i] = t[i] - y->v[i]; in fe25519_sub()
[all …]
H A Ded25519.c18 for (i = 0;i < 32;++i) playground[i] = sm[i]; in get_hram()
19 for (i = 32;i < 64;++i) playground[i] = pk[i-32]; in get_hram()
20 for (i = 64;i < smlen;++i) playground[i] = sm[i]; in get_hram()
46 for(i=0;i<32;i++) in crypto_sign_ed25519_keypair()
72 for(i=0;i<mlen;i++) in crypto_sign_ed25519()
74 for(i=0;i<32;i++) in crypto_sign_ed25519()
85 for(i=0;i<32;i++) in crypto_sign_ed25519()
86 sm[i] = r[i]; in crypto_sign_ed25519()
97 for(i=0;i<32;i++) in crypto_sign_ed25519()
134 for(i=0;i<smlen-64;i++) in crypto_sign_ed25519_open()
[all …]
H A Dxmss_wots.c58 for(i = 0; i < params->len; i++){ in expand_seed()
77 for (i = start; i < (start+steps) && i < params->w; i++) { in gen_chain()
112 for (i=0; i < params->len; i++) { in wots_pkgen()
130 for (i=0; i < params->len_1; i++) { in wots_sign()
144 for (i = 0; i < params->len_2; i++) { in wots_sign()
145 basew[params->len_1 + i] = csum_basew[i]; in wots_sign()
150 for (i = 0; i < params->len; i++) { in wots_sign()
168 for (i=0; i < params->len_1; i++) { in wots_pkFromSig()
182 for (i = 0; i < params->len_2; i++) { in wots_pkFromSig()
185 for (i=0; i < params->len; i++) { in wots_pkFromSig()
[all …]
H A Dxmss_hash.c31 int i = 0; in addr_to_byte() local
32 for(i=0;i<8;i++) in addr_to_byte()
33 to_byte(bytes+i*4, addr[i],4); in addr_to_byte()
50 for (i=0; i < keylen; i++) { in core_hash_SHA2()
51 buf[i+n] = key[i]; in core_hash_SHA2()
54 for (i=0; i < inlen; i++) { in core_hash_SHA2()
55 buf[keylen + n + i] = in[i]; in core_hash_SHA2()
113 for (i = 0; i < 2*n; i++) { in hash_h()
114 buf[i] = in[i] ^ bitmask[i]; in hash_h()
135 for (i = 0; i < n; i++) { in hash_f()
[all …]
H A Dxmss_fast.c124 for (i = 0; i < bound; i++) { in l_tree()
205 for (i = 0; i < h-k; i++) { in treehash_setup()
245 for (i = 0; i < n; i++) in treehash_setup()
355 for (i = 0; i < h - k; i++) { in bds_treehash_update()
470 for (i = 0; i < h; i++) { in bds_round()
494 for (i = 0; i < tau; i++) { in bds_round()
614 for (i = 0; i < n; i++) in xmss_sign()
726 for (i = 0; i < n; i++) in xmss_sign_open()
731 for (i = 0; i < *msglen; i++) in xmss_sign_open()
860 for (i = 0; i < n; i++) in xmssmt_sign()
[all …]
H A Dgroupaccess.c53 int i, j, retry = 0; in ga_init() local
73 for (i = 0, j = 0; i < ngroups; i++) in ga_init()
74 if ((gr = getgrgid(groups_bygid[i])) != NULL) in ga_init()
87 int i, j; in ga_match() local
89 for (i = 0; i < ngroups; i++) in ga_match()
91 if (match_pattern(groups_byname[i], groups[j])) in ga_match()
103 int i, found = 0; in ga_match_pattern_list() local
105 for (i = 0; i < ngroups; i++) { in ga_match_pattern_list()
125 int i; in ga_free() local
128 for (i = 0; i < ngroups; i++) in ga_free()
[all …]
H A Dsmult_curve25519_ref.c68 for (i = 0;i < 32;++i) { in mult()
96 for (i = 0;i < 32;++i) { in square()
99 for (j = i + 1;j < i + 32 - j;++j) u += 38 * a[j] * a[i + 32 - j]; in square()
102 u += a[i / 2] * a[i / 2]; in square()
103 u += 38 * a[i / 2 + 16] * a[i / 2 + 16]; in square()
211 /* 2^20 - 2^10 */ for (i = 2;i < 10;i += 2) { square(t0,t1); square(t1,t0); } in recip()
216 /* 2^40 - 2^20 */ for (i = 2;i < 20;i += 2) { square(t0,t1); square(t1,t0); } in recip()
221 /* 2^50 - 2^10 */ for (i = 2;i < 10;i += 2) { square(t1,t0); square(t0,t1); } in recip()
254 for (i = 0;i < 32;++i) e[i] = n[i]; in crypto_scalarmult_curve25519()
258 for (i = 0;i < 32;++i) work[i] = p[i]; in crypto_scalarmult_curve25519()
[all …]
H A Dauth2-chall.c89 int i, j; in remove_kbdint_device() local
91 for (i = 0; devices[i] != NULL; i++) in remove_kbdint_device()
95 i--; in remove_kbdint_device()
105 int i, r; in kbdint_alloc() local
116 for (i = 0; devices[i]; i++) { in kbdint_alloc()
157 int i; in kbdint_next_device() local
167 for (i = 0; devices[i]; i++) { in kbdint_next_device()
271 for (i = 0; i < kbdintctxt->nreq; i++) { in send_userauth_info_request()
280 for (i = 0; i < kbdintctxt->nreq; i++) in send_userauth_info_request()
317 for (i = 0; i < nresp; i++) { in input_userauth_info_response()
[all …]
H A Dsrclimit.c45 int i; in srclimit_init() local
58 for (i = 0; i < max_children; i++) in srclimit_init()
59 child[i].id = -1; in srclimit_init()
92 for (i = 0; i < max_children; i++) { in srclimit_check_allow()
93 if (child[i].id == -1) { in srclimit_check_allow()
94 if (i < first_unused) in srclimit_check_allow()
95 first_unused = i; in srclimit_check_allow()
127 int i; in srclimit_done() local
134 for (i = 0; i < max_children; i++) { in srclimit_done()
135 if (child[i].id == id) { in srclimit_done()
[all …]
H A Dxmss_commons.c21 int32_t i; in to_byte() local
22 for (i = bytes-1; i >= 0; i--) { in to_byte()
23 out[i] = in & 0xff; in to_byte()
31 size_t i;
32 for (i = 0; i < len; i++)
33 printf("%02x", a[i]);
H A Dsshd.c273 for (i = 0; i < num_listen_socks; i++) in close_listen_socks()
284 for (i = 0; i < options.max_startups; i++) in close_startup_pipes()
1148 for (i = 0; i < num_listen_socks; i++)
1154 for (i = 0; i < options.max_startups; i++)
1181 for (i = 0; i < num_listen_socks; i++)
1183 for (i = 0; i < options.max_startups; i++)
1234 for (i = 0; i < num_listen_socks; i++) {
1410 for (i = 0; i < option_size; i++)
1503 for (i = 0; i < ac; i++)
1540 for (i = 0; (int)i < ac; i++)
[all …]
H A Dsshbuf-misc.c41 size_t i, j; in sshbuf_dump_data() local
44 for (i = 0; i < len; i += 16) { in sshbuf_dump_data()
46 for (j = i; j < i + 16; j++) { in sshbuf_dump_data()
53 for (j = i; j < i + 16; j++) { in sshbuf_dump_data()
84 for (i = j = 0; i < len; i++) { in sshbuf_dtob16()
111 for (i = 0; s[i] != '\0'; i++) { in sshbuf_dtob64()
176 size_t i, l; in sshbuf_dtourlb64() local
201 for (i = 0; i < l; i++) { in sshbuf_dtourlb64()
202 if (p[i] == '+') in sshbuf_dtourlb64()
203 p[i] = '-'; in sshbuf_dtourlb64()
[all …]
/openssh-portable/openbsd-compat/
H A Dbcrypt_pbkdf.c78 int i; in bcrypt_hash() local
85 for (i = 0; i < 64; i++) { in bcrypt_hash()
92 for (i = 0; i < BCRYPT_WORDS; i++) in bcrypt_hash()
95 for (i = 0; i < 64; i++) in bcrypt_hash()
99 for (i = 0; i < BCRYPT_WORDS; i++) { in bcrypt_hash()
100 out[4 * i + 3] = (cdata[i] >> 24) & 0xff; in bcrypt_hash()
101 out[4 * i + 2] = (cdata[i] >> 16) & 0xff; in bcrypt_hash()
102 out[4 * i + 1] = (cdata[i] >> 8) & 0xff; in bcrypt_hash()
103 out[4 * i + 0] = cdata[i] & 0xff; in bcrypt_hash()
154 for (i = 1; i < rounds; i++) { in bcrypt_pbkdf()
[all …]
H A Dblowfish.c413 for (i = 0; i < 4; i++, j++) { in Blowfish_stream2word()
434 for (i = 0; i < BLF_N + 2; i++) { in Blowfish_expand0state()
450 for (i = 0; i < 4; i++) { in Blowfish_expand0state()
491 for (i = 0; i < 4; i++) { in Blowfish_expandstate()
521 for (i = 0; i < blocks; i++) { in blf_enc()
534 for (i = 0; i < blocks; i++) { in blf_dec()
546 for (i = 0; i < len; i += 8) { in blf_ecb_encrypt()
568 for (i = 0; i < len; i += 8) { in blf_ecb_decrypt()
590 for (i = 0; i < len; i += 8) { in blf_cbc_encrypt()
655 for (i = 0; i < len; i += 2)
[all …]
H A Dsetproctitle.c76 int i; in compat_init_setproctitle() local
88 for (i = 0; envp[i] != NULL; i++) in compat_init_setproctitle()
99 for (i = 0; i < argc; i++) { in compat_init_setproctitle()
100 if (lastargv == NULL || lastargv + 1 == argv[i]) in compat_init_setproctitle()
101 lastargv = argv[i] + strlen(argv[i]); in compat_init_setproctitle()
103 for (i = 0; envp[i] != NULL; i++) { in compat_init_setproctitle()
104 if (lastargv + 1 == envp[i]) in compat_init_setproctitle()
105 lastargv = envp[i] + strlen(envp[i]); in compat_init_setproctitle()
116 for (i = 0; envp[i] != NULL; i++) in compat_init_setproctitle()
117 environ[i] = strdup(envp[i]); in compat_init_setproctitle()
[all …]
H A Dfmt_scaled.c137 fpart += i; in scan_scaled()
152 whole += i; in scan_scaled()
168 for (i = 0; i < SCALE_LENGTH; i++) { in scan_scaled()
171 if (*p == scale_chars[i] || in scan_scaled()
200 for (i = 0; i < fract_digits -1; i++) in scan_scaled()
222 unsigned int i; in fmt_scaled() local
236 for (i = 0; i < SCALE_LENGTH; i++) { in fmt_scaled()
238 unit = units[i]; in fmt_scaled()
239 fract = (i == 0) ? 0 : abval % scale_factors[i]; in fmt_scaled()
240 number /= scale_factors[i]; in fmt_scaled()
[all …]
H A Dbsd-poll.c43 nfds_t i; in poll() local
49 for (i = 0; i < nfds; i++) { in poll()
50 fd = fds[i].fd; in poll()
68 for (i = 0; i < nfds; i++) { in poll()
69 fd = fds[i].fd; in poll()
93 for (i = 0; i < nfds; i++) { in poll()
94 fd = fds[i].fd; in poll()
95 fds[i].revents = 0; in poll()
99 fds[i].revents |= POLLIN; in poll()
102 fds[i].revents |= POLLOUT; in poll()
[all …]
H A Dinet_ntop.c121 int i; in inet_ntop6() local
130 for (i = 0; i < IN6ADDRSZ; i++) in inet_ntop6()
131 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3)); in inet_ntop6()
134 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) { in inet_ntop6()
135 if (words[i] == 0) { in inet_ntop6()
137 cur.base = i, cur.len = 1; in inet_ntop6()
160 for (i = 0; i < (IN6ADDRSZ / INT16SZ) && tp < ep; i++) { in inet_ntop6()
163 i < (best.base + best.len)) { in inet_ntop6()
164 if (i == best.base) { in inet_ntop6()
172 if (i != 0) { in inet_ntop6()
[all …]
/openssh-portable/regress/
H A Dpercent.sh69 case "$i" in
78 trial $i '%T' NONE
83 trial $i '%%' '%'
84 trial $i '%C' $HASH
85 trial $i '%i' $USERID
87 trial $i '%L' $HOST
91 trial $i '%p' $PORT
93 trial $i '%u' $USER
97 trial $i '%d' $HOME
116 verbose $tid $i tilde
[all …]
H A Dcfginclude.sh9 cat > $OBJ/ssh_config.i << _EOF
15 Include $OBJ/ssh_config.i.*
18 Include $OBJ/ssh_config.i.*
22 Include $OBJ/ssh_config.i.*
29 Include $OBJ/ssh_config.i.*
32 Include $OBJ/ssh_config.i.*
36 Include $OBJ/ssh_config.i.*
120 rm -f $OBJ/ssh_config.i.*
144 rm -f $OBJ/ssh_config.i $OBJ/ssh_config.i.* $OBJ/ssh_config.out
261 rm -f $OBJ/ssh_config.i.*
[all …]
H A Dservcfginclude.sh5 cat > $OBJ/sshd_config.i << _EOF
12 Include $OBJ/sshd_config.i.*
15 Include $OBJ/sshd_config.i.*
19 Include $OBJ/sshd_config.i.*
26 Include $OBJ/sshd_config.i.*
29 Include $OBJ/sshd_config.i.*
33 Include $OBJ/sshd_config.i.*
125 rm -f $OBJ/sshd_config.i.*
130 Include $OBJ/sshd_config.i.*
157 Include $OBJ/sshd_config.i.2
[all …]
H A Dmodpipe.c89 u_int i, wflag = 0, num_mods = 0; in main() local
115 for (i = 0; i < num_mods; i++) { in main()
116 if (mods[i].offset < total || in main()
117 mods[i].offset >= total + s) in main()
119 switch (mods[i].what) { in main()
121 buf[mods[i].offset - total] ^= mods[i].m1; in main()
124 buf[mods[i].offset - total] &= mods[i].m1; in main()
125 buf[mods[i].offset - total] |= mods[i].m2; in main()
143 for (i = 0; wflag && i < num_mods; i++) { in main()
144 if (mods[i].offset < total) in main()
[all …]
/openssh-portable/openbsd-compat/regress/
H A Dclosefromtest.c39 int i, max, fds[NUM_OPENS]; in main() local
42 for (i = 0; i < NUM_OPENS; i++) in main()
43 if ((fds[i] = open("/dev/null", O_RDONLY)) == -1) in main()
45 max = i - 1; in main()
53 for (i = 0; i < max; i++) in main()
54 if (read(fds[i], buf, sizeof(buf)) == -1) in main()
59 for (i = 0; i < NUM_OPENS; i++) in main()
60 if (close(fds[i]) != -1) in main()

12345678