PROPOSAL_MAX
for (i = 0; i < PROPOSAL_MAX; i++) {
kex_proposal_free_entries(char *prop[PROPOSAL_MAX])
for (i = 0; i < PROPOSAL_MAX; i++)
kex_prop2buf(struct sshbuf *b, char *proposal[PROPOSAL_MAX])
for (i = 0; i < PROPOSAL_MAX; i++) {
if ((proposal = calloc(PROPOSAL_MAX, sizeof(char *))) == NULL)
for (i = 0; i < PROPOSAL_MAX; i++) {
for (i = 0; i < PROPOSAL_MAX; i++)
for (i = 0; i < PROPOSAL_MAX; i++) {
static const char * const proposal_names[PROPOSAL_MAX] = {
kex_ready(struct ssh *ssh, char *proposal[PROPOSAL_MAX])
kex_setup(struct ssh *ssh, char *proposal[PROPOSAL_MAX])
proposals_match(char *my[PROPOSAL_MAX], char *peer[PROPOSAL_MAX])
kex_proposal_populate_entries(struct ssh *ssh, char *prop[PROPOSAL_MAX],
const char *defpropserver[PROPOSAL_MAX] = { KEX_SERVER };
const char *defpropclient[PROPOSAL_MAX] = { KEX_CLIENT };
void kex_proposal_populate_entries(struct ssh *, char *prop[PROPOSAL_MAX],
void kex_proposal_free_entries(char *prop[PROPOSAL_MAX]);
int kex_ready(struct ssh *, char *[PROPOSAL_MAX]);
int kex_setup(struct ssh *, char *[PROPOSAL_MAX]);
int kex_prop2buf(struct sshbuf *, char *proposal[PROPOSAL_MAX]);
const char *ccp, *proposal[PROPOSAL_MAX] = { KEX_CLIENT };
char *myproposal[PROPOSAL_MAX] = {0}, *keyname = NULL;
for (i = 0; i < PROPOSAL_MAX; i++) {
for (i = 0; i < PROPOSAL_MAX; i++)
char *myproposal[PROPOSAL_MAX] = { KEX_CLIENT };
char *prop[PROPOSAL_MAX], *kexalgs, *ciphers, *macs, *hkalgs;
char *myproposal[PROPOSAL_MAX] = { KEX_CLIENT };
char *myproposal[PROPOSAL_MAX] = { KEX_CLIENT };
char *populated[PROPOSAL_MAX];
char *proposal[PROPOSAL_MAX];
char *myproposal[PROPOSAL_MAX];
char *hkalgs = NULL, *myproposal[PROPOSAL_MAX];