1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731
|
/* IKEv2 Message ID tracking, for libreswan
*
* Copyright (C) 2019 Andrew Cagney <cagney@gnu.org>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version. See <https://www.gnu.org/licenses/gpl2.txt>.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*
*/
#include "defs.h"
#include "state.h"
#include "demux.h"
#include "connections.h"
#include "ikev2_msgid.h"
#include "log.h"
#include "ikev2.h" /* for complete_v2_state_transition() */
#include "state_db.h" /* for ike_sa_by_serialno() */
/*
* Logging.
*/
static const char *jam_prefix(struct jambuf *buf, struct ike_sa *ike, struct state *wip_sa)
{
jam(buf, "Message ID: ");
const char *who;
if (wip_sa == NULL) {
who = "lost";
jam(buf, "CHILD #%lu.#LOST", ike->sa.st_serialno);
} else if (IS_CHILD_SA(wip_sa)) {
who = "child";
jam(buf, "CHILD #%lu.#%lu", ike->sa.st_serialno, wip_sa->st_serialno);
} else {
who = "ike";
jam(buf, "IKE #%lu", ike->sa.st_serialno);
}
return who;
}
static void jam_ike_window(struct jambuf *buf, const char *what,
const struct v2_msgid_window *old,
const struct v2_msgid_window *new)
{
jam(buf, " ike.%s.sent=%jd", what, old->sent);
if (new != NULL && old->sent != new->sent) {
jam(buf, "->%jd", new->sent);
}
jam(buf, " ike.%s.recv=%jd", what, old->recv);
if (new != NULL && old->recv != new->recv) {
jam(buf, "->%jd", new->recv);
}
monotime_buf mb;
jam(buf, " ike.%s.last_contact=%s", what,
str_monotime(old->last_contact, &mb));
if (new != NULL && !monotime_eq(old->last_contact, new->last_contact)) {
jam(buf, "->%s", str_monotime(new->last_contact, &mb));
}
}
static void jam_ike_windows(struct jambuf *buf,
const struct v2_msgid_windows *old,
const struct v2_msgid_windows *new)
{
jam_ike_window(buf, "initiator", &old->initiator,
new != NULL ? &new->initiator : NULL);
jam_ike_window(buf, "responder", &old->responder,
new != NULL ? &new->responder : NULL);
}
static void jam_wip_sa(struct jambuf *buf, const char *who,
const struct v2_msgid_wip *old,
const struct v2_msgid_wip *new)
{
jam(buf, " %s.wip.initiator=%jd", who, old->initiator);
if (new != NULL && old->initiator != new->initiator) {
jam(buf, "->%jd", new->initiator);
}
jam(buf, " %s.wip.responder=%jd", who, old->responder);
if (new != NULL && old->responder != new->responder) {
jam(buf, "->%jd", new->responder);
}
}
PRINTF_LIKE_VA(4)
static void jam_v2_msgid(struct jambuf *buf,
struct ike_sa *ike, struct state *wip_sa,
const char *fmt, va_list ap)
{
const char *who = jam_prefix(buf, ike, wip_sa);
jam(buf, " ");
jam_va_list(buf, fmt, ap);
jam(buf, ":");
jam_ike_windows(buf, &ike->sa.st_v2_msgid_windows, NULL);
if (wip_sa != NULL) {
jam_wip_sa(buf, who, &wip_sa->st_v2_msgid_wip, NULL);
}
}
void dbg_v2_msgid(struct ike_sa *ike, struct state *wip_sa,
const char *fmt, ...)
{
LSWDBGP(DBG_BASE, buf) {
va_list ap;
va_start(ap, fmt);
jam_v2_msgid(buf, ike, wip_sa, fmt, ap);
va_end(ap);
}
}
void fail_v2_msgid(where_t where, struct ike_sa *ike, struct state *wip_sa,
const char *fmt, ...)
{
JAMBUF(buf) {
va_list ap;
va_start(ap, fmt);
jam_v2_msgid(buf, ike, wip_sa, fmt, ap);
va_end(ap);
/* XXX: hack - double copy */
pexpect_fail(ike->sa.st_logger, where, PRI_SHUNK, pri_shunk(jambuf_as_shunk(buf)));
}
}
/*
* Dump the MSGIDs along with any changes.
*
* Why not just dump the one that changed in the calling function?
* Because MSGIDs have this strange habit of mysteriously changing
* between calls.
*/
static void dbg_msgids_update(const char *what,
enum message_role message, intmax_t msgid,
struct ike_sa *ike, const struct v2_msgid_windows *old_windows,
struct state *wip_sa, const struct v2_msgid_wip *old_wip)
{
if (DBGP(DBG_BASE)) {
LSWLOG_DEBUG(buf) {
const char *who = jam_prefix(buf, ike, wip_sa);
jam(buf, " %s", what);
switch (message) {
case MESSAGE_REQUEST: jam(buf, " message request %jd", msgid); break;
case MESSAGE_RESPONSE: jam(buf, " message response %jd", msgid); break;
case NO_MESSAGE: break;
default: bad_case(message);
}
jam(buf, ":");
jam_ike_windows(buf, old_windows, &ike->sa.st_v2_msgid_windows);
if (wip_sa != NULL) {
jam_wip_sa(buf, who, old_wip, &wip_sa->st_v2_msgid_wip);
}
}
}
}
/*
* Maintain or reset Message IDs.
*
* When resetting, need to fudge things up sufficient to fool
* ikev2_update_msgid_counters(() into thinking that this is a shiny
* new init request.
*/
static const struct v2_msgid_windows empty_v2_msgid_windows = {
.initiator = {
.sent = -1,
.recv = -1,
},
.responder = {
.sent = -1,
.recv = -1,
},
};
static const struct v2_msgid_wip empty_v2_msgid_wip = {
.initiator = -1,
.responder = -1,
};
void v2_msgid_init_ike(struct ike_sa *ike)
{
monotime_t now = mononow();
struct v2_msgid_windows old_windows = ike->sa.st_v2_msgid_windows;
ike->sa.st_v2_msgid_windows = empty_v2_msgid_windows;
ike->sa.st_v2_msgid_windows.initiator.last_contact = now;
ike->sa.st_v2_msgid_windows.responder.last_contact = now;
struct v2_msgid_wip old_wip = ike->sa.st_v2_msgid_wip;
ike->sa.st_v2_msgid_wip = empty_v2_msgid_wip;
/* pretend there's a sender */
dbg_msgids_update("initializing (IKE SA)", NO_MESSAGE, -1,
ike, &old_windows,
&ike->sa, &old_wip);
}
void v2_msgid_init_child(struct ike_sa *ike, struct child_sa *child)
{
child->sa.st_v2_msgid_windows = empty_v2_msgid_windows;
struct v2_msgid_wip old_child = child->sa.st_v2_msgid_wip;
child->sa.st_v2_msgid_wip = empty_v2_msgid_wip;
/* pretend there's a sender */
dbg_msgids_update("initializing (CHILD SA)", NO_MESSAGE, -1,
ike, &ike->sa.st_v2_msgid_windows, /* unchanged */
&child->sa, &old_child);
}
void v2_msgid_start_responder(struct ike_sa *ike, struct state *responder,
const struct msg_digest *md)
{
enum message_role role = v2_msg_role(md);
if (!pexpect(role == MESSAGE_REQUEST)) {
return;
}
/* extend msgid */
intmax_t msgid = md->hdr.isa_msgid;
const struct v2_msgid_wip wip = responder->st_v2_msgid_wip;
if (DBGP(DBG_BASE) &&
responder->st_v2_msgid_wip.responder != -1) {
FAIL_V2_MSGID(ike, responder,
"responder->st_v2_msgid_wip.responder == -1; was %jd",
responder->st_v2_msgid_wip.responder);
}
responder->st_v2_msgid_wip.responder = msgid;
dbg_msgids_update("responder starting", role, msgid,
ike, &ike->sa.st_v2_msgid_windows,
responder, &wip);
}
/*
* XXX: This is to hack around the broken code that switches from the
* IKE SA to the CHILD SA before sending the reply. Instead, because
* the CHILD SA can fail, the IKE SA should be the one processing the
* message?
*/
void v2_msgid_switch_responder_to_child(struct ike_sa *ike, struct child_sa *child,
struct msg_digest *md, where_t where)
{
enum message_role role = v2_msg_role(md);
if (!pexpect(role == MESSAGE_REQUEST)) {
return;
}
intmax_t md_msgid = md->hdr.isa_msgid;
/* out with the old */
{
const struct v2_msgid_wip ike_wip = ike->sa.st_v2_msgid_wip;
if (DBGP(DBG_BASE) && ike_wip.responder != md_msgid) {
fail_v2_msgid(where, ike, &child->sa,
"ike->sa.st_v2_msgid_wip.responder should be %jd (md's msgid); was %jd",
md_msgid, ike_wip.responder);
}
ike->sa.st_v2_msgid_wip.responder = -1;
dbg_msgids_update("switching from IKE SA responder", role, md_msgid,
ike, &ike->sa.st_v2_msgid_windows,
&ike->sa, &ike_wip);
}
/* in with the new */
{
const struct v2_msgid_wip child_wip = child->sa.st_v2_msgid_wip;
if (DBGP(DBG_BASE) && child_wip.responder != -1) {
fail_v2_msgid(where, ike, &child->sa,
"child->sa.st_v2_msgid_wip.responder should be -1; was %jd",
child_wip.responder);
}
child->sa.st_v2_msgid_wip.responder = md_msgid;
dbg_msgids_update("switching to CHILD SA responder", role, md_msgid,
ike, &ike->sa.st_v2_msgid_windows,
&child->sa, &child_wip);
}
/* and don't forget MD.ST */
switch_md_st(md, &child->sa, where);
}
void v2_msgid_switch_responder_from_aborted_child(struct ike_sa *ike, struct child_sa **childp,
struct msg_digest *md, where_t where)
{
struct child_sa *child = *childp;
enum message_role role = v2_msg_role(md);
if (!pexpect(role == MESSAGE_REQUEST)) {
return;
}
intmax_t md_msgid = md->hdr.isa_msgid;
/* out with the old */
{
const struct v2_msgid_wip child_wip = child->sa.st_v2_msgid_wip;
if (DBGP(DBG_BASE) && child_wip.responder != md_msgid) {
fail_v2_msgid(where, ike, &child->sa,
"child->sa.st_v2_msgid_wip.responder should be %jd (MD's msgid); was %jd",
md_msgid, child_wip.responder);
}
child->sa.st_v2_msgid_wip.responder = -1;
dbg_msgids_update("switching from CHILD SA responder", role, md_msgid,
ike, &ike->sa.st_v2_msgid_windows,
&child->sa, &child_wip);
}
/* in with the new */
{
const struct v2_msgid_wip ike_wip = ike->sa.st_v2_msgid_wip;
if (DBGP(DBG_BASE) && ike_wip.responder != -1) {
fail_v2_msgid(where, ike, &child->sa,
"ike->sa.st_v2_msgid_wip.responder should be -1; was %jd",
ike_wip.responder);
}
ike->sa.st_v2_msgid_wip.responder = md_msgid;
dbg_msgids_update("switching to IKE SA responder", role, md_msgid,
ike, &ike->sa.st_v2_msgid_windows,
&ike->sa, &ike_wip);
}
/* and don't forget MD.ST */
switch_md_st(md, &ike->sa, where);
child->sa.st_dont_send_delete = true; /* just to be sure */
delete_state(&child->sa);
*childp = NULL;
}
void v2_msgid_switch_initiator(struct ike_sa *ike, struct child_sa *child,
const struct msg_digest *md)
{
enum message_role role = v2_msg_role(md);
if (!pexpect(role == MESSAGE_RESPONSE)) {
return;
}
intmax_t msgid = md->hdr.isa_msgid;
/* out with the old */
{
const struct v2_msgid_wip wip = ike->sa.st_v2_msgid_wip;
if (DBGP(DBG_BASE) &&
ike->sa.st_v2_msgid_wip.initiator != msgid) {
FAIL_V2_MSGID(ike, &child->sa,
"ike->sa.st_v2_msgid_wip.initiator == %jd(msgid); was %jd",
msgid, ike->sa.st_v2_msgid_wip.initiator);
}
ike->sa.st_v2_msgid_wip.initiator = -1;
dbg_msgids_update("switching from IKE SA initiator", role, msgid,
ike, &ike->sa.st_v2_msgid_windows,
&ike->sa, &wip);
}
/* in with the new */
{
const struct v2_msgid_wip wip = child->sa.st_v2_msgid_wip;
if (DBGP(DBG_BASE) &&
child->sa.st_v2_msgid_wip.initiator != -1) {
FAIL_V2_MSGID(ike, &child->sa,
"child->sa.st_v2_msgid_wip.initiator == -1; was %jd",
child->sa.st_v2_msgid_wip.initiator);
}
child->sa.st_v2_msgid_wip.initiator = msgid;
dbg_msgids_update("switching to CHILD SA initiator", role, msgid,
ike, &ike->sa.st_v2_msgid_windows,
&child->sa, &wip);
}
}
void v2_msgid_cancel_responder(struct ike_sa *ike, struct state *responder,
const struct msg_digest *md)
{
enum message_role msg_role = v2_msg_role(md);
if (!pexpect(msg_role == MESSAGE_REQUEST)) {
return;
}
/* extend msgid */
intmax_t msgid = md->hdr.isa_msgid;
const struct v2_msgid_wip wip = responder->st_v2_msgid_wip;
/*
* If an encrypted message is corrupt things bail before
* start_responder() but then STF_IGNORE tries to clear it.
*/
if (DBGP(DBG_BASE) &&
responder->st_v2_msgid_wip.responder != msgid) {
FAIL_V2_MSGID(ike, responder,
"responder->st_v2_msgid_wip.responder == %jd(msgid); was %jd",
msgid, responder->st_v2_msgid_wip.responder);
}
responder->st_v2_msgid_wip.responder = -1;
dbg_msgids_update("cancelling responder", msg_role, msgid,
ike, &ike->sa.st_v2_msgid_windows,
responder, &wip);
}
void v2_msgid_update_recv(struct ike_sa *ike, struct state *receiver,
struct msg_digest *md)
{
/* save old value, and add shortcut to new */
const struct v2_msgid_windows old = ike->sa.st_v2_msgid_windows;
struct v2_msgid_windows *new = &ike->sa.st_v2_msgid_windows;
monotime_t time_received = mononow(); /* not strictly correct */
/*
* If the receiver is known, save a copy of the old values.
*
* The receiver (CHILD SA) gets lost (deleted) when processing
* an IKE_AUTH response and authentication fails. When this
* happens all that matters is that the IKE SA is updated.
*/
const struct v2_msgid_wip old_receiver =
receiver != NULL ? receiver->st_v2_msgid_wip : empty_v2_msgid_wip;
enum message_role receiving = v2_msg_role(md);
intmax_t msgid;
const char *update_received_story;
switch (receiving) {
case MESSAGE_REQUEST:
update_received_story = "updating responder received";
/*
* Processing request finished. Scrub it as wip.
*
* XXX: should this done in update_sent() since it is
* when sending the response that things really
* finish?
*/
msgid = md->hdr.isa_msgid; /* zero-extended */
if (receiver != NULL) {
if (DBGP(DBG_BASE) &&
receiver->st_v2_msgid_wip.responder != msgid) {
FAIL_V2_MSGID(ike, receiver,
"wip.responder == %jd(msgid); was %jd",
msgid, receiver->st_v2_msgid_wip.responder);
}
receiver->st_v2_msgid_wip.responder = -1;
} else {
FAIL_V2_MSGID(ike, NULL, "XXX: message request receiver lost!?!");
}
/* last request we received */
new->responder.recv = msgid;
new->responder.last_contact = time_received;
break;
case MESSAGE_RESPONSE:
update_received_story = "updating initiator received";
/*
* Since the response has been successfully processed,
* clear WIP.INITIATOR. This way duplicate
* responses get discarded as there is no receiving
* state.
*
* XXX: Unfortunately the record 'n' send code throws
* a spanner in the works. It calls update_send()
* before update_recv() breaking the assumption that
* WIP.INITIATOR is the old MSGID.
*/
msgid = md->hdr.isa_msgid; /* zero-extended */
if (receiver != NULL) {
if (old_receiver.initiator > msgid) {
/*
* Hack around record 'n' send calling
* update_sent() (setting
* WIP.INITIATOR to the next request)
* midway through processing.
*
* Getting rid of record 'n' send will
* fix this hack.
*/
dbg_v2_msgid(ike, receiver, "XXX: receiver.wip.initiator %jd != receiver.msgid %jd - suspect record'n'called update_sent() before update_recv()",
old_receiver.initiator, msgid);
} else {
if (DBGP(DBG_BASE) && old_receiver.initiator != msgid) {
FAIL_V2_MSGID(ike, receiver,
"receiver.wip.initiator == %jd(msgid); was %jd",
msgid, old_receiver.initiator);
}
receiver->st_v2_msgid_wip.initiator = -1;
}
/* this is what matters */
pexpect(receiver->st_v2_msgid_wip.initiator != msgid);
/*
* clear the retransmits for the old message
*
* XXX: Because the IKE_AUTH initiator
* switches states from IKE->CHILD part way
* through, this code can end up clearing the
* child's retransmits when what is needed is
* to clear the IKE SA's retransmits.
*/
if (receiver->st_retransmit_event != NULL) {
dbg_v2_msgid(ike, receiver, "clearing EVENT_RETRANSMIT as response received");
clear_retransmits(receiver);
} else {
dbg_v2_msgid(ike, receiver, "XXX: no EVENT_RETRANSMIT to clear; suspect IKE->CHILD switch");
}
} else {
/*
* For instance, the IKE_AUTH response is
* rejected and the child (which was the
* receiver) is deleted before this code is
* called.
*
* XXX: if the IKE SA is made the receiver
* this problem goes away.
*/
dbg("Message ID: IKE #%lu XXX: message response receiver lost; probably a deleted child",
ike->sa.st_serialno);
}
/* last response we received */
new->initiator.recv = msgid;
new->initiator.last_contact = time_received;
break;
case NO_MESSAGE:
dbg("Message ID: IKE #%lu skipping update_recv as MD is fake",
ike->sa.st_serialno);
return;
default:
bad_case(receiving);
}
dbg_msgids_update(update_received_story, receiving, msgid,
ike, &old, receiver, &old_receiver);
}
void v2_msgid_update_sent(struct ike_sa *ike, struct state *sender,
struct msg_digest *md, enum message_role sending)
{
struct v2_msgid_windows old = ike->sa.st_v2_msgid_windows;
struct v2_msgid_windows *new = &ike->sa.st_v2_msgid_windows;
struct v2_msgid_wip old_sender = sender->st_v2_msgid_wip;
intmax_t msgid;
const char *update_sent_story;
switch (sending) {
case MESSAGE_REQUEST:
update_sent_story = "updating initiator sent";
/*
* pluto is initiating a new exchange.
*
* Use the next Message ID (which should be what was
* used by the code emitting the message request)
*/
msgid = new->initiator.sent + 1;
sender->st_v2_msgid_wip.initiator = new->initiator.sent = msgid;
#if 0
/*
* XXX: The record 'n' send code calls update_send()
* before update_recv() breaking WIP.INITIATOR's
* expected sequence OLD-MSGID -> -1 -> NEW-MSGID.
*/
if (DBGP(DBG_BASE) && old_sender.initiator != -1) {
FAIL_V2_MSGID(ike, sender,
"sender.wip.initiator == -1; was %jd",
old_sender.initiator);
}
#else
if (old_sender.initiator != -1) {
dbg_v2_msgid(ike, sender, "XXX: expecting sender.wip.initiator %jd == -1 - suspect record'n'send out-of-order?)",
old_sender.initiator);
}
#endif
if (sender->st_retransmit_event == NULL) {
dbg_v2_msgid(ike, sender, "scheduling EVENT_RETRANSMIT");
start_retransmits(sender);
} else {
dbg_v2_msgid(ike, sender, "XXX: EVENT_RETRANSMIT already scheduled -- suspect record'n'send");
}
break;
case MESSAGE_RESPONSE:
update_sent_story = "updating responder sent";
/*
* pluto is responding to MD.
*
* Since this is a response, the MD's Message ID
* trumps what ever is in responder.sent. This way,
* when messages are lost, the counter jumps forward
* to the most recent received.
*/
passert(md != NULL);
pexpect(v2_msg_role(md) == MESSAGE_REQUEST);
/* extend isa_msgid */
msgid = md->hdr.isa_msgid;
new->responder.sent = msgid;
break;
case NO_MESSAGE:
dbg_v2_msgid(ike, sender, "skipping update_send as nothing to send");
return;
default:
bad_case(sending);
}
dbg_msgids_update(update_sent_story, sending, msgid,
ike, &old, sender, &old_sender);
}
struct v2_msgid_pending {
so_serial_t st_serialno;
const enum isakmp_xchg_types ix;
v2_msgid_pending_cb *cb;
const struct state_v2_microcode *transition;
struct v2_msgid_pending *next;
};
void v2_msgid_free(struct state *st)
{
/* find the end; small list? */
struct v2_msgid_pending **pp = &st->st_v2_msgid_windows.initiator.pending;
while (*pp != NULL) {
struct v2_msgid_pending *tbd = *pp;
*pp = tbd->next;
pfree(tbd);
}
}
bool v2_msgid_request_outstanding(struct ike_sa *ike)
{
struct v2_msgid_window *initiator = &ike->sa.st_v2_msgid_windows.initiator;
intmax_t unack = (initiator->sent - initiator->recv);
return (unack != 0); /* well >0 */
}
bool v2_msgid_request_pending(struct ike_sa *ike)
{
struct v2_msgid_window *initiator = &ike->sa.st_v2_msgid_windows.initiator;
return initiator->pending != NULL;
}
void v2_msgid_queue_initiator(struct ike_sa *ike, struct state *st,
enum isakmp_xchg_types ix,
const struct state_v2_microcode *transition,
v2_msgid_pending_cb *callback)
{
struct v2_msgid_window *initiator = &ike->sa.st_v2_msgid_windows.initiator;
/*
* v2_CREATE_CHILD_SA append to last the task.
* v2_INFORMATIONAL v2D append to the last v2D task.
*/
/* find the end; small list? */
struct v2_msgid_pending **pp = &initiator->pending;
while (*pp != NULL) {
if (ix == ISAKMP_v2_INFORMATIONAL && (*pp)->ix != ISAKMP_v2_INFORMATIONAL) {
dbg("%s %d inserting v2D task for #%lu before #%lu CREATE_CHILD_SA", __func__, __LINE__, st->st_serialno, (*pp)->st_serialno);
break;
}
pp = &(*pp)->next;
}
/* append */
struct v2_msgid_pending new = {
.st_serialno = st->st_serialno,
.ix = ix,
.cb = callback,
.transition = transition,
.next = (*pp),
};
*pp = clone_thing(new, "struct initiate_list");
v2_msgid_schedule_next_initiator(ike);
}
static void initiate_next(struct state *st, void *context UNUSED)
{
struct ike_sa *ike = pexpect_ike_sa(st);
if (ike == NULL) {
dbg("IKE SA with pending initiates disappeared");
return;
}
struct v2_msgid_window *initiator = &ike->sa.st_v2_msgid_windows.initiator;
for (intmax_t unack = (initiator->sent - initiator->recv);
unack < ike->sa.st_connection->ike_window && initiator->pending != NULL;
unack++) {
/* make a copy of head, and drop from list */
struct v2_msgid_pending pending = *initiator->pending;
pfree(initiator->pending);
initiator->pending = pending.next;
/* find that state */
struct state *st = state_with_serialno(pending.st_serialno);
if (st == NULL) {
dbg_v2_msgid(ike, NULL,
"can't resume CHILD SA #%lu exchange as child disappeared (unack %jd)",
pending.st_serialno, unack);
continue;
}
dbg_v2_msgid(ike, st, "resuming SA using IKE SA (unack %jd)", unack);
struct child_sa *child = IS_CHILD_SA(st) ? pexpect_child_sa(st) : NULL;
if (pending.transition != NULL) {
/*
* try to check that the transition still applies ...
*/
#if 0
passert(pending.transition->state == st->st_state->kind);
#endif
if (!IS_IKE_SA_ESTABLISHED(&ike->sa) ||
(child != NULL && !IS_CHILD_SA_ESTABLISHED(&child->sa))) {
log_state(RC_LOG, st, "dropping transition: %s",
pending.transition->story);
} else {
set_v2_transition(st, pending.transition, HERE);
stf_status status = pending.transition->processor(ike, child, NULL);
complete_v2_state_transition(st, NULL/*initiate so no md*/, status);
}
} else if (IS_CHILD_SA_ESTABLISHED(st)) {
/*
* this is a continuation of delete message.
* shortcut complete_v2_state_transition()
* to call complete_v2_state_transition, need more work
*/
pending.cb(ike, st, NULL);
v2_msgid_schedule_next_initiator(ike);
} else {
struct msg_digest *md = unsuspend_md(st);
complete_v2_state_transition(st, md, pending.cb(ike, st, md));
release_any_md(&md);
}
}
}
void v2_msgid_schedule_next_initiator(struct ike_sa *ike)
{
struct v2_msgid_window *initiator = &ike->sa.st_v2_msgid_windows.initiator;
/*
* If there appears to be space and there's a pending
* initiate, poke the IKE SA so it tries to initiate things.
*/
if (initiator->pending != NULL) {
intmax_t unack = (initiator->sent - initiator->recv);
/* if this returns NULL, that's ok; will log "LOST" */
struct state *wip_sa = state_by_serialno(initiator->pending->st_serialno);
if (unack < ike->sa.st_connection->ike_window) {
dbg_v2_msgid(ike, wip_sa, "wakeing IKE SA for next initiator (unack %jd)", unack);
schedule_callback(__func__, ike->sa.st_serialno,
initiate_next, NULL);
} else {
dbg_v2_msgid(ike, wip_sa, "next initiator blocked by outstanding response (unack %jd)", unack);
}
} else {
dbg_v2_msgid(ike, &ike->sa, "no pending message initiators to schedule");
}
}
|