Lines Matching refs:iph2
385 struct ph2handle *iph2;
388 LIST_FOREACH(iph2, &ph2tree, chain) {
389 if (iph2->proposal == NULL && iph2->approval == NULL)
391 if (iph2->approval != NULL) {
392 for (pr = iph2->approval->head; pr != NULL;
397 return iph2;
399 } else if (iph2->proposal != NULL) {
400 for (pr = iph2->proposal->head; pr != NULL;
405 return iph2;
419 struct ph2handle *iph2 = NULL;
421 /* create new iph2 */
422 iph2 = racoon_calloc(1, sizeof(*iph2));
423 if (iph2 == NULL)
426 iph2->status = PHASE1ST_SPAWN;
428 return iph2;
437 initph2(iph2)
438 struct ph2handle *iph2;
440 sched_scrub_param(iph2);
441 iph2->sce = NULL;
442 iph2->scr = NULL;
444 VPTRINIT(iph2->sendbuf);
445 VPTRINIT(iph2->msg1);
448 if (iph2->proposal) {
450 for (pr = iph2->proposal->head; pr != NULL; pr = pr->next)
455 if (iph2->approval) {
456 flushsaprop(iph2->approval);
457 iph2->approval = NULL;
461 if (iph2->spidx_gen) {
462 delsp_bothdir((struct policyindex *)iph2->spidx_gen);
463 racoon_free(iph2->spidx_gen);
464 iph2->spidx_gen = NULL;
467 if (iph2->pfsgrp) {
468 oakley_dhgrp_free(iph2->pfsgrp);
469 iph2->pfsgrp = NULL;
472 VPTRINIT(iph2->dhpriv);
473 VPTRINIT(iph2->dhpub);
474 VPTRINIT(iph2->dhpub_p);
475 VPTRINIT(iph2->dhgxy);
476 VPTRINIT(iph2->id);
477 VPTRINIT(iph2->id_p);
478 VPTRINIT(iph2->nonce);
479 VPTRINIT(iph2->nonce_p);
480 VPTRINIT(iph2->sa);
481 VPTRINIT(iph2->sa_ret);
483 if (iph2->ivm) {
484 oakley_delivm(iph2->ivm);
485 iph2->ivm = NULL;
493 delph2(iph2)
494 struct ph2handle *iph2;
496 initph2(iph2);
498 if (iph2->src) {
499 racoon_free(iph2->src);
500 iph2->src = NULL;
502 if (iph2->dst) {
503 racoon_free(iph2->dst);
504 iph2->dst = NULL;
506 if (iph2->src_id) {
507 racoon_free(iph2->src_id);
508 iph2->src_id = NULL;
510 if (iph2->dst_id) {
511 racoon_free(iph2->dst_id);
512 iph2->dst_id = NULL;
515 if (iph2->proposal) {
516 flushsaprop(iph2->proposal);
517 iph2->proposal = NULL;
520 racoon_free(iph2);
527 insph2(iph2)
528 struct ph2handle *iph2;
530 LIST_INSERT_HEAD(&ph2tree, iph2, chain);
536 remph2(iph2)
537 struct ph2handle *iph2;
539 LIST_REMOVE(iph2, chain);
576 struct ph2handle *iph2, *next;
579 for (iph2 = LIST_FIRST(&ph2tree); iph2 != NULL; iph2 = next) {
580 next = LIST_NEXT(iph2, chain);
581 if (iph2->proposal == NULL && iph2->approval == NULL)
583 if (iph2->approval != NULL) {
584 for (pr = iph2->approval->head; pr != NULL;
589 } else if (iph2->proposal != NULL) {
590 for (pr = iph2->proposal->head; pr != NULL;
598 unbindph12(iph2);
599 remph2(iph2);
600 delph2(iph2);
606 bindph12(iph1, iph2)
608 struct ph2handle *iph2;
610 iph2->ph1 = iph1;
611 LIST_INSERT_HEAD(&iph1->ph2tree, iph2, ph1bind);
615 unbindph12(iph2)
616 struct ph2handle *iph2;
618 if (iph2->ph1 != NULL) {
619 iph2->ph1 = NULL;
620 LIST_REMOVE(iph2, ph1bind);
651 /* create new iph2 */