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 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752
|
/* BLURB lgpl
Coda File System
Release 5
Copyright (c) 1987-1999 Carnegie Mellon University
Additional copyrights listed below
This code is distributed "AS IS" without warranty of any kind under
the terms of the GNU Library General Public Licence Version 2, as
shown in the file LICENSE. The technical and financial contributors to
Coda are listed in the file CREDITS.
Additional copyrights
#*/
/*
IBM COPYRIGHT NOTICE
Copyright (C) 1986
International Business Machines Corporation
All Rights Reserved
This file contains some code identical to or derived from the 1986
version of the Andrew File System ("AFS"), which is owned by the IBM
Corporation. This code is provided "AS IS" and IBM does not warrant
that it is free of infringement of any intellectual rights of any
third party. IBM disclaims liability of any kind for any damages
whatsoever resulting directly or indirectly from use of this software
or of any derivative work. Carnegie Mellon University has obtained
permission to modify, distribute and sublicense this code, which is
based on Version 2 of AFS and does not contain the features and
enhancements that are part of Version 3 of AFS. Version 3 of AFS is
commercially available and supported by Transarc Corporation,
Pittsburgh, PA.
*/
/*
Routines for MultiRPC
*/
#include <stdio.h>
#include <string.h>
#include <sys/file.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <sys/time.h>
#include <errno.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include "rpc2.private.h"
#include <rpc2/se.h>
#include "trace.h"
#include "cbuf.h"
#include <rpc2/multi.h>
extern void rpc2_IncrementSeqNumber();
extern long HandleResult();
extern void rpc2_PrintPacketHeader();
extern long SetupMulticast();
typedef struct {
struct CEntry *ceaddr;
RPC2_PacketBuffer *req;
struct SL_Entry *sle;
long retcode;
} MultiCon;
typedef struct {
struct SL_Entry **pending;
long indexlen;
long *indexlist;
} PacketCon;
static void SetupConns(int HowMany, MultiCon *mcon,
RPC2_Handle ConnHandleList[]);
static void SetupPackets(int HowMany, MultiCon *mcon,
RPC2_Handle ConnHandleList[],
SE_Descriptor SDescList[], RPC2_PacketBuffer *Request);
static MultiCon *InitMultiCon(int HowMany);
static void FreeMultiCon(int HowMany, MultiCon *mcon);
static long mrpc_SendPacketsReliably();
static PacketCon *InitPacketCon(int HowMany);
static void FreePacketCon(PacketCon *pcon);
long exchange(PacketCon *pcon, int cur_ind);
static void MSend_Cleanup(int HowMany, MultiCon *mcon,
SE_Descriptor SDescList[],
struct timeval *Timeout, PacketCon *pcon);
static inline long EXIT_MRPC(long code, int HowMany, RPC2_Integer *RCList, MultiCon *context);
#define GOODSEDLE(i) (SDescList && SDescList[i].Tag != OMITSE)
long RPC2_MultiRPC(IN HowMany, IN ConnHandleList, IN RCList, IN MCast,
IN Request, IN SDescList, IN UnpackMulti, IN OUT ArgInfo,
IN BreathOfLife)
int HowMany; /* no of connections involved */
RPC2_Handle ConnHandleList[];
RPC2_Integer RCList[]; /* NULL or list of per-connection return codes */
RPC2_Multicast *MCast; /* NULL if multicast not used */
RPC2_PacketBuffer *Request;/* Gets clobbered during call: BEWARE */
SE_Descriptor SDescList[];
long (*UnpackMulti)();
ARG_INFO *ArgInfo;
struct timeval *BreathOfLife;
{
MultiCon *mcon;
int host;
int SomeConnsOK;
long rc = 0;
rpc2_Enter();
say(1, RPC2_DebugLevel, "Entering RPC2_MultiRPC\n");
TR_MULTI();
/* perform sanity checks */
assert(Request->Prefix.MagicNumber == OBJ_PACKETBUFFER);
/* get context pointer */
mcon = InitMultiCon(HowMany);
/* verify and set connection state */
SetupConns(HowMany, mcon, ConnHandleList);
/* prepare all of the packets */
SetupPackets(HowMany, mcon, ConnHandleList, SDescList, Request);
/* call UnpackMulti on all bad connections;
if there are NO good connections, exit */
SomeConnsOK = FALSE;
for (host = 0; host < HowMany; host++) {
if (mcon[host].retcode > RPC2_ELIMIT) {
SomeConnsOK = TRUE;
} else {
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, NULL,
mcon[host].retcode, host) == -1) {
return EXIT_MRPC(rc, HowMany, RCList, mcon);
}
}
}
if (!SomeConnsOK) /* NO usable connections */
return EXIT_MRPC(rc, HowMany, RCList, mcon);
/* finally safe to update the state of the good connections */
for (host = 0; host < HowMany; host++) {
if (mcon[host].retcode > RPC2_ELIMIT) {
SetState(mcon[host].ceaddr, C_AWAITREPLY);
}
}
/* send packets and await replies */
say(9, RPC2_DebugLevel, "Sending requests\n");
rc = mrpc_SendPacketsReliably(HowMany, mcon, ConnHandleList,
ArgInfo, SDescList, UnpackMulti,BreathOfLife);
switch((int) rc) {
case RPC2_SUCCESS:
break;
case RPC2_TIMEOUT:
case RPC2_FAIL:
say(9, RPC2_DebugLevel,
"mrpc_SendPacketsReliably()--> %s\n", RPC2_ErrorMsg(rc));
break;
default:
say(9, RPC2_DebugLevel,
"Bad return code for mrpc_SendPacketsReliably: %ld\n", rc);
rc = RPC2_FAIL;
}
host = HowMany - 1;
return EXIT_MRPC(rc, HowMany, RCList, mcon);
}
/* easier to manage than the former macro definition */
static inline long
EXIT_MRPC(long code, int HowMany, RPC2_Integer *RCList, MultiCon *mcon)
{
int i;
/* copy arguments into the return code lists, possibly translating
error codes */
if (RCList) {
for (i = 0; i < HowMany; i++ )
RCList[i] = mcon[i].retcode;
}
FreeMultiCon(HowMany, mcon);
rpc2_Quit(code);
}
static void SetupConns(int HowMany, MultiCon *mcon,
RPC2_Handle ConnHandleList[])
{
struct CEntry *thisconn;
int host;
long rc, setype = -1; /* -1 ==> first time through loop */
/* verify the handles; don't update the connection state of the "good" connections yet */
for (host = 0; host < HowMany; host++)
{
thisconn = mcon[host].ceaddr = rpc2_GetConn(ConnHandleList[host]);
if (!thisconn) {
mcon[host].retcode = RPC2_NOCONNECTION;
continue;
}
assert(thisconn->MagicNumber == OBJ_CENTRY);
if (!TestRole(thisconn, CLIENT))
{
mcon[host].retcode = RPC2_FAIL;
continue;
}
switch ((int) (thisconn->State & 0x0000ffff))
{
case C_HARDERROR:
mcon[host].retcode = RPC2_FAIL;
break;
case C_THINK:
/* wait to update connection state */
break;
default:
/* This isn't the behavior the manual claims, but it's what I need. -JJK */
{
if (TRUE/*EnqueueRequest*/)
{
say(1, RPC2_DebugLevel, "Enqueuing on connection %#x\n", ConnHandleList[host]);
LWP_WaitProcess((char *)thisconn);
say(1, RPC2_DebugLevel, "Dequeueing on connection %#x\n", ConnHandleList[host]);
host = 0; /* !!! restart loop !!! */
break;
}
else {
/* can't continue if ANY connections are busy */
rc = RPC2_MGRPBUSY;
goto exit_fail;
}
}
}
}
/* insist that all connections have the same side-effect type (or none) */
for (host = 0; host < HowMany; host++)
if (mcon[host].retcode > RPC2_ELIMIT)
{
long this_setype = mcon[host].ceaddr->SEProcs ?
mcon[host].ceaddr->SEProcs->SideEffectType: 0;
if (setype == -1) /* first time through loop */
setype = this_setype;
if (this_setype != setype) {
rc = RPC2_FAIL; /* better return code ? */
goto exit_fail;
}
}
/* We delay updating the state of the "good" connections until we know */
/* FOR SURE that mrpc_SendPacketsReliably() will be called. */
return;
exit_fail:
for (host = 0; host < HowMany; host++)
if (mcon[host].retcode > RPC2_ELIMIT)
mcon[host].retcode = rc;
return;
}
static void SetupPackets(int HowMany, MultiCon *mcon,
RPC2_Handle ConnHandleList[],
SE_Descriptor SDescList[], RPC2_PacketBuffer *Request)
{
struct CEntry *thisconn;
RPC2_PacketBuffer *thisreq;
int host;
/* allocate and setup HowMany request packets */
/* we won't send on bad connections, so don't bother to set them up */
for (host = 0; host < HowMany; host++) {
if (mcon[host].retcode <= RPC2_ELIMIT)
continue;
RPC2_AllocBuffer(Request->Header.BodyLength, &thisreq);
/* preserve address of allocated packet */
mcon[host].req = thisreq;
thisconn = mcon[host].ceaddr;
/* initialize header fields to defaults, and copy body of request packet */
rpc2_InitPacket(thisreq, thisconn, Request->Header.BodyLength);
memcpy(thisreq->Body, Request->Body, Request->Header.BodyLength);
/* complete non-default header fields */
thisreq->Header.SeqNumber = thisconn->NextSeqNumber;
thisreq->Header.Opcode = Request->Header.Opcode; /* set by client */
thisreq->Header.BindTime = 0;
thisreq->Header.Flags = 0;
}
/* Notify side effect routine, if any. */
if (SDescList != NULL) {
/* We have already verified that all connections have the same side-effect type (or none), */
/* so we can simply invoke the procedure corresponding to the first GOOD connection. */
thisconn = 0;
for (host = 0; host < HowMany; host++)
if (mcon[host].retcode > RPC2_ELIMIT)
{
thisconn = mcon[host].ceaddr;
break;
}
if (thisconn && thisconn->SEProcs && thisconn->SEProcs->SE_MultiRPC1)
{
long *seretcode;
RPC2_PacketBuffer **preqs;
assert((seretcode = (long *)malloc(HowMany * sizeof(long))) != NULL);
assert((preqs = (RPC2_PacketBuffer **)malloc(HowMany * sizeof(RPC2_PacketBuffer *))) != NULL);
for (host = 0; host < HowMany; host++) {
seretcode[host] = mcon[host].retcode;
preqs[host] = mcon[host].req;
}
(*thisconn->SEProcs->SE_MultiRPC1)(HowMany, ConnHandleList, SDescList, preqs, seretcode);
for (host = 0; host < HowMany; host++) {
/* Has the sideeffect modified the original request? */
if (mcon[host].req != preqs[host]) {
RPC2_FreeBuffer(&mcon[host].req);
mcon[host].req = preqs[host];
}
if (seretcode[host] == RPC2_SUCCESS)
continue;
/* Any new errors? */
if (mcon[host].retcode != seretcode[host])
{
if (seretcode[host] > RPC2_FLIMIT) {
SetState(mcon[host].ceaddr, C_THINK); /* reset connection state */
mcon[host].retcode = RPC2_SEFAIL1;
} else {
rpc2_SetConnError(mcon[host].ceaddr);
mcon[host].retcode = RPC2_SEFAIL2;
}
}
}
free(preqs);
free(seretcode);
}
}
/* complete setup of the individual packets */
/* we won't send on bad connections, so don't bother to set them up */
for (host = 0; host < HowMany; host++) {
if (mcon[host].retcode <= RPC2_ELIMIT)
continue;
thisconn = mcon[host].ceaddr;
thisreq = mcon[host].req;
/* create call entry */
mcon[host].sle = rpc2_AllocSle(OTHER, thisconn);
mcon[host].sle->TElem.BackPointer = (char *)mcon[host].sle;
/* convert to network order */
rpc2_htonp(thisreq);
/* Encrypt appropriate portions of the packet */
rpc2_ApplyE(thisreq, thisconn);
}
}
/* Get a free context */
static MultiCon *InitMultiCon(int count)
{
MultiCon *mcon;
int i;
mcon = (MultiCon *) calloc(count, sizeof(MultiCon));
assert(mcon);
for (i = 0; i < count; i++)
mcon[i].retcode = RPC2_ABANDONED;
return(mcon);
}
/* deallocate buffers and free allocated arrays */
void FreeMultiCon(int HowMany, MultiCon *mcon)
{
int i;
for (i = 0; i < HowMany; i++) {
if(mcon[i].sle)
rpc2_FreeSle(&mcon[i].sle);
if (mcon[i].req)
RPC2_FreeBuffer(&mcon[i].req);
if (mcon[i].ceaddr)
LWP_NoYieldSignal((char *)mcon[i].ceaddr);
}
free(mcon);
}
/* MultiRPC version */
static long mrpc_SendPacketsReliably(
int HowMany,
MultiCon *mcon,
RPC2_Handle ConnHandleList[], /* array of connection ids */
ARG_INFO *ArgInfo, /* Structure of client information
(built in MakeMulti) */
SE_Descriptor SDescList[], /* array of side effect descriptors */
long (*UnpackMulti)(), /* pointer to unpacking routine */
struct timeval *TimeOut) /* client specified timeout */
{
struct SL_Entry *slp;
RPC2_PacketBuffer *preply; /* RPC2 Response buffers */
struct CEntry *c_entry;
long finalrc, secode = 0;
long thispacket, hopeleft, i;
int packets = 1; /* packet counter for LWP yield */
int busy = 0;
int goodpackets = 0; /* packets with good connection state */
PacketCon *pcon;
unsigned long timestamp;
int rc;
#define EXIT_MRPC_SPR(rc)\
{\
MSend_Cleanup(HowMany, mcon, SDescList, TimeOut, pcon);\
return(rc);\
}
say(1, RPC2_DebugLevel, "mrpc_SendPacketsReliably()\n");
TR_MSENDRELIABLY();
/* find a context */
/* the packet_con management should be redone to ensure that allocation never fails! */
pcon = InitPacketCon(HowMany);
/*
if((pcon = InitPacketCon(HowMany)) == NULL)
for(i = 0; i < HowMany; i++)
{
if (mcon[i].sle == NULL) continue;
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, NULL, RPC2_FAIL, i) == -1)
return(RPC2_FAIL);
}
*/
if (TimeOut) { /* create a time bomb */
/* allocate timer entry */
slp = pcon->pending[HowMany] = rpc2_AllocSle(OTHER, NULL);
rpc2_ActivateSle(slp, TimeOut);
}
timestamp = rpc2_MakeTimeStamp();
say(9, RPC2_DebugLevel, "Sending initial packets at time %lu\n", timestamp);
/* Do an initial send of packets on all good connections */
/* for estimating the effiency of the calculation */
/* should separate this into separate LWP for efficiency */
for (thispacket = HowMany - 1; thispacket >= 0; thispacket--)
{
/* initialize permuted index array */
pcon->indexlist[thispacket] = thispacket;
slp = mcon[thispacket].sle;
if (!slp) /* something is wrong with connection - don't send packet */
{
if (mcon[thispacket].retcode > RPC2_ELIMIT)
mcon[thispacket].retcode = RPC2_FAIL;
exchange(pcon, thispacket);
busy++;
continue;
}
pcon->pending[goodpackets++] = slp; /* build array of good packets */
/* send the packet and activate socket listener entry */
/* offer control to Socket Listener every 32 packets to prevent buffer overflow */
if ((packets++ & 0x1f) && (packets < pcon->indexlen - 6)) {
LWP_DispatchProcess();
timestamp = rpc2_MakeTimeStamp();
}
mcon[thispacket].req->Header.TimeStamp = htonl(timestamp);
mcon[thispacket].ceaddr->reqsize =
mcon[thispacket].req->Prefix.LengthOfPacket;
slp->RetryIndex = 0;
/* XXX we should have the size of the expected reply packet */
rc = rpc2_RetryInterval(mcon[thispacket].ceaddr, 0, &slp->RInterval,
mcon[thispacket].req->Prefix.LengthOfPacket,
sizeof(struct RPC2_PacketHeader), 0);
assert(rc == 0);
rpc2_ActivateSle(slp, &slp->RInterval);
rpc2_XmitPacket(mcon[thispacket].req,
mcon[thispacket].ceaddr->HostInfo->Addr, 0);
}
/* don't forget to account for the Timer entry */
if (TimeOut)
goodpackets++;
if (busy == HowMany)
EXIT_MRPC_SPR(RPC2_FAIL) /* no packets were sent */
if (busy == 0) finalrc = RPC2_SUCCESS; /* RPC2_FAIL if anything goes wrong */
else finalrc = RPC2_FAIL;
do {
hopeleft = 0;
/* wait for SocketListener to tap me on the shoulder */
LWP_MwaitProcess(1, (char **)pcon->pending);
if (TimeOut && pcon->pending[HowMany]->ReturnCode == TIMEOUT)
/* Overall timeout expired: clean up state and quit */
EXIT_MRPC_SPR(RPC2_TIMEOUT)
/* the loop below looks at a decreasing list of sl entries using the permuted index array for sorting */
for(i = 0; i < pcon->indexlen; i++)
{
thispacket = pcon->indexlist[i];
c_entry = mcon[thispacket].ceaddr;
slp = mcon[thispacket].sle;
switch(slp->ReturnCode)
{
case WAITING:
hopeleft = 1; /* someday we will be told about this packet */
break; /* switch */
case ARRIVED:
/* know this hasn't yet been processd */
say(9, RPC2_DebugLevel, "Request reliably sent on 0x%p\n", c_entry);
/* remove current connection from future examination */
i = exchange(pcon, i);
/* At this point the final reply has been received;
SocketListener has already decrypted it. */
preply = (RPC2_PacketBuffer *)slp->data;
mcon[thispacket].retcode = preply->Header.ReturnCode;
/* Do preliminary side effect processing: */
/* Notify side effect routine, if any */
if (GOODSEDLE(thispacket) && c_entry->SEProcs != NULL &&
c_entry->SEProcs->SE_MultiRPC2 != NULL)
secode = (*c_entry->SEProcs->SE_MultiRPC2)
(ConnHandleList[thispacket],
&(SDescList[thispacket]), preply);
if (secode < RPC2_FLIMIT)
{
rpc2_SetConnError(c_entry);
finalrc = RPC2_FAIL;
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, preply, RPC2_SEFAIL2, thispacket) == -1)
/* enough responses, return */
EXIT_MRPC_SPR(finalrc)
else
/* continue waiting for responses */
break;
}
/* return code may be LWP_SUCCESS or LWP_ENOWAIT */
/* LWP_NoYieldSignal((char *)c_entry);*/
/* Continue side effect processing: */
if (GOODSEDLE(thispacket) && (secode != RPC2_SUCCESS ||
SDescList[thispacket].LocalStatus == SE_FAILURE ||
SDescList[thispacket].RemoteStatus == SE_FAILURE))
{
finalrc = RPC2_FAIL;
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, preply, RPC2_SEFAIL1, thispacket) == -1)
/* enough responses, return */
EXIT_MRPC_SPR(finalrc)
else
/* continue waiting for responses */
break;
}
/* RPC2_SUCCESS if ARRIVED and SE's are OK */
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, preply, RPC2_SUCCESS, thispacket) == -1)
/* enough responses, return */
EXIT_MRPC_SPR(finalrc)
else
/* continue waiting for responses */
break;
case KEPTALIVE:
hopeleft = 1;
slp->RetryIndex = 0;
slp->RInterval.tv_sec = c_entry->KeepAlive.tv_sec / 3;
slp->RInterval.tv_usec = c_entry->KeepAlive.tv_usec / 3;
rpc2_ActivateSle(slp, &slp->RInterval);
break; /* switch */
case NAKED: /* explicitly NAK'ed this time or earlier */
say(9, RPC2_DebugLevel, "Request NAK'ed on 0x%p\n", c_entry);
rpc2_SetConnError(c_entry); /* does signal on ConnHandle also */
i = exchange(pcon, i);
finalrc = RPC2_FAIL;
mcon[thispacket].retcode = RPC2_NAKED;
/* call side-effect routine, and ignore result */
if (GOODSEDLE(thispacket) &&
c_entry->SEProcs != NULL && c_entry->SEProcs->SE_MultiRPC2 != NULL)
(*c_entry->SEProcs->SE_MultiRPC2)(ConnHandleList[thispacket], &(SDescList[thispacket]), NULL);
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, NULL, RPC2_NAKED, thispacket) == -1)
/* enough responses, return */
EXIT_MRPC_SPR(finalrc)
else
/* continue waiting for responses */
break;
case TIMEOUT:
if ((hopeleft = rpc2_CancelRetry(c_entry, slp)))
break; /* switch, we heard from side effect */
slp->RetryIndex++;
/* XXX we should have the size of the expected reply
* packet, somewhere.. */
rc = rpc2_RetryInterval(c_entry, slp->RetryIndex,
&slp->RInterval,
mcon[thispacket].req->Prefix.LengthOfPacket,
sizeof(struct RPC2_PacketHeader), 0);
if (rc) {
say(9, RPC2_DebugLevel, "Request failed on 0x%p\n", c_entry);
rpc2_SetConnError(c_entry); /* does signal on ConnHandle also */
/* remote site is now declared dead; mark all inactive connections to there likewise */
i = exchange(pcon, i);
finalrc = RPC2_FAIL;
mcon[thispacket].retcode = RPC2_DEAD;
/* call side-effect routine, and ignore result */
if (GOODSEDLE(thispacket) && c_entry->SEProcs != NULL && c_entry->SEProcs->SE_MultiRPC2 != NULL)
(*c_entry->SEProcs->SE_MultiRPC2)(ConnHandleList[thispacket], &(SDescList[thispacket]), NULL);
if ((*UnpackMulti)(HowMany, ConnHandleList, ArgInfo, NULL, RPC2_DEAD, thispacket) == -1)
/* enough responses, return */
EXIT_MRPC_SPR(finalrc)
else
/* continue waiting for responses */
break;
}
/* else retry with the next Beta value for timeout */
hopeleft = 1;
rpc2_ActivateSle(slp, &slp->RInterval);
say(9, RPC2_DebugLevel, "Sending retry %d at %ld on %#x (timeout %ld.%06ld)\n", slp->RetryIndex, rpc2_time(), c_entry->UniqueCID, slp->RInterval.tv_sec, slp->RInterval.tv_usec);
mcon[thispacket].req->Header.Flags = htonl((ntohl(mcon[thispacket].req->Header.Flags) | RPC2_RETRY));
mcon[thispacket].req->Header.TimeStamp = htonl(rpc2_MakeTimeStamp());
rpc2_Sent.Retries += 1; /* RPC retries are currently NOT multicasted! -JJK */
rpc2_XmitPacket(mcon[thispacket].req,
c_entry->HostInfo->Addr, 0);
break; /* switch */
default: /* abort */
/* BUSY ReturnCode should never go into switch */
assert(FALSE);
}
}
} while (hopeleft);
EXIT_MRPC_SPR(finalrc)
#undef EXIT_MRPC_SPR
}
static PacketCon *InitPacketCon(int count)
{
PacketCon *pcon;
/* allocate new context */
pcon = (PacketCon *) malloc(sizeof(PacketCon));
assert(pcon);
pcon->pending = (struct SL_Entry **)calloc(count+2, sizeof(struct SL_Entry *));
assert(pcon->pending);
pcon->indexlen = count;
pcon->indexlist = (long *)malloc(count * sizeof(long));
assert(pcon->indexlist);
return(pcon);
}
void FreePacketCon(PacketCon *pcon)
{
free(pcon->indexlist);
free(pcon->pending);
free(pcon);
}
/* exchange two elements of the socket listener element array */
/* returns value for loop counter: decrements it iff elements */
/* are physically exchanged */
long exchange(PacketCon *pcon, int cur_ind)
{
long tmp;
pcon->indexlen--;
if (cur_ind == pcon->indexlen) return(cur_ind);
tmp = pcon->indexlist[cur_ind];
pcon->indexlist[cur_ind] = pcon->indexlist[pcon->indexlen];
pcon->indexlist[pcon->indexlen] = tmp;
return(cur_ind - 1);
}
/* Clean up state before exiting mrpc_SendPacketsReliably */
static void MSend_Cleanup(int HowMany, MultiCon *mcon,
SE_Descriptor SDescList[],
struct timeval *Timeout, PacketCon *pcon)
{
long thispacket, i;
struct SL_Entry *slp;
for (i = 0; i < pcon->indexlen; i++)
{
thispacket = pcon->indexlist[i];
slp = mcon[thispacket].sle;
TM_Remove(rpc2_TimerQueue, &slp->TElem);
/* Call side-effect routine and increment connection sequence number for abandoned requests */
if (GOODSEDLE(thispacket) && mcon[thispacket].ceaddr->SEProcs && mcon[thispacket].ceaddr->SEProcs->SE_MultiRPC2)
(*mcon[thispacket].ceaddr->SEProcs->SE_MultiRPC2)(mcon[thispacket].ceaddr->UniqueCID, &SDescList[thispacket], NULL);
rpc2_IncrementSeqNumber(mcon[thispacket].ceaddr);
SetState(mcon[thispacket].ceaddr, C_THINK);
/* LWP_NoYieldSignal((char *)mcon[thispacket].ceaddr);*/
}
if (Timeout) {
slp = pcon->pending[HowMany]; /* Tag assumed to be TIMEENTRY */
if (slp->ReturnCode == WAITING)
{
/* delete time bomb if it has not fired */
TM_Remove(rpc2_TimerQueue, &slp->TElem);
}
rpc2_FreeSle(&slp); /* free timer entry */
}
FreePacketCon(pcon);
}
|