Home | History | Annotate | Download | only in racoon

Lines Matching full:pair

184 	struct prop_pair **pair;
186 /* get proposal pair */
187 pair = get_proppair(sa, IPSECDOI_TYPE_PH1);
188 if (pair == NULL)
192 newsa = get_ph1approval(iph1, pair);
194 free_proppair(pair);
209 get_ph1approval(iph1, pair)
211 struct prop_pair **pair;
225 if (pair[i] == NULL)
227 for (s = pair[i]; s; s = s->next) {
247 if (pair[i] == NULL)
249 for (s = pair[i]; s; s = s->next) {
892 struct prop_pair **pair;
895 /* get proposal pair */
896 pair = get_proppair(iph2->sa, IPSECDOI_TYPE_PH2);
897 if (pair == NULL)
901 ret = get_ph2approval(iph2, pair);
902 free_proppair(pair);
933 /* get proposal pair of SA sent. */
937 "failed to get prop pair.\n");
943 /* get proposal pair of SA replayed */
947 "failed to get prop pair.\n");
1114 get_ph2approval(iph2, pair)
1116 struct prop_pair **pair;
1127 if (pair[i] == NULL)
1130 "pair[%d]: %p\n", i, pair[i]);
1131 print_proppair(LLV_DEBUG, pair[i]);;
1134 ret = get_ph2approvalx(iph2, pair[i]);
1250 free_proppair(pair)
1251 struct prop_pair **pair;
1256 free_proppair0(pair[i]);
1257 pair[i] = NULL;
1259 racoon_free(pair);
1263 free_proppair0(pair)
1264 struct prop_pair *pair;
1268 p = pair;
1290 struct prop_pair **pair = NULL;
1315 pair = racoon_calloc(1, MAXPROPPAIRLEN * sizeof(*pair));
1316 if (pair == NULL) {
1321 memset(pair, 0, sizeof(pair));
1375 if (get_transform(prop, pair, &num_p) < 0) {
1390 if (!pair[i])
1393 plog(LLV_DEBUG, LOCATION, NULL, "pair %d:\n", i);
1394 print_proppair(LLV_DEBUG, pair[i]);
1397 for (p = pair[i]; p; p = p->next) {
1411 if (pair[i]->next) {
1415 pair[i]->prop->p_no);
1421 for (p = pair[i]; p; p = q) {
1425 pair[i] = NULL;
1430 pair[i]->prop->p_no, nprop);
1442 return pair;
1444 if (pair != NULL)
1445 racoon_free(pair);
1456 get_transform(prop, pair, num_p)
1458 struct prop_pair **pair;
1537 for (q = pair[prop->p_no]; q && q->next; q = q->next)
1547 pair[prop->p_no] = p;
1563 get_sabyproppair(pair, iph1)
1564 struct prop_pair *pair;
1575 for (p = pair; p; p = p->next) {
1596 for (p = pair; p; p = p->next) {
1631 struct prop_pair **pair, *p;
1638 pair = get_proppair(iph2->sa_ret, IPSECDOI_TYPE_PH2);
1639 if (pair == NULL)
1642 if (pair[i])
1645 if (i == MAXPROPPAIRLEN || pair[i]->tnext) {
1653 for (p = pair[i]; p; p = p->next) {
1679 free_proppair(pair);
1691 struct prop_pair **pair = NULL;
1703 /* get proposal pair */
1704 pair = get_proppair(sa0, IPSECDOI_TYPE_PH2);
1705 if (pair == NULL)
1711 if (pair[pp->prop_no] == NULL)
1719 for (p = pair[pp->prop_no]; p; p = p->tnext) {
1750 for (p = pair[pp->prop_no]; p; p = p->tnext) {
1782 if (pair != NULL)
1783 racoon_free(pair);