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
|
/* 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.
*/
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <sys/time.h>
#include <sys/file.h>
#include <sys/ioctl.h>
#include <errno.h>
#include <assert.h>
#include "rpc2.private.h"
#include <rpc2/se.h>
#include <rpc2/secure.h>
#include "cbuf.h"
#include "trace.h"
#ifndef MSG_CONFIRM
#define MSG_CONFIRM 0
#endif
/* The MSG_CONFIRM flag significantly reduces arp traffic with linux-2.4 and
* higher. However... a precompiled binary that uses this flag fails to send
* any packets when run on linux-2.2 kernels. So we initially set msg_confirm
* to match the flag, but if we get an EINVAL error back from sendto we clear
* it. This way we lose the first packet after startup, but retransmission
* should fix that automatically. --JH
*/
static int msg_confirm = MSG_CONFIRM;
static long DefaultRetryCount = 6;
static struct timeval DefaultRetryInterval = {60, 0};
/* Hooks for failure emulation package (libfail)
Libfail will set these to its predicate routines when initialized.
If libfail is not linked in, they remain NULL, and nothing happens.
See documentation for libfail for details.
*/
int (*Fail_SendPredicate)() = NULL,
(*Fail_RecvPredicate)() = NULL;
static long FailPacket(int (*predicate)(), RPC2_PacketBuffer *pb,
struct RPC2_addrinfo *addr, int sock)
{
long drop;
unsigned char ip1, ip2, ip3, ip4;
unsigned char color;
struct sockaddr_in *sin;
unsigned char *inaddr;
if (!predicate)
return 0;
#warning "fail filters can only handle ipv4 addresses"
if (addr->ai_family != PF_INET)
return 0;
sin = (struct sockaddr_in *)addr->ai_addr;
inaddr = (unsigned char *)&sin->sin_addr;
ip1 = inaddr[0]; ip2 = inaddr[1]; ip3 = inaddr[2]; ip4 = inaddr[3];
ntohPktColor(pb);
color = GetPktColor(pb);
htonPktColor(pb);
drop = ((*predicate)(ip1, ip2, ip3, ip4, color, pb, sin, sock) == 0);
return drop;
}
void rpc2_XmitPacket(RPC2_PacketBuffer *pb, struct RPC2_addrinfo *addr,
int confirm)
{
static int log_limit = 0;
int whichSocket, n, flags = 0;
struct timeval tv;
int rc;
say(1, RPC2_DebugLevel, "rpc2_XmitPacket()\n");
#ifdef RPC2DEBUG
if (RPC2_DebugLevel > 9)
{
fprintf(rpc2_logfile, "\t");
rpc2_printaddrinfo(addr, rpc2_logfile);
if (pb->Prefix.sa && pb->Prefix.sa->encrypt)
fprintf(rpc2_logfile, " (secure)");
fprintf(rpc2_logfile, "\n");
rpc2_PrintPacketHeader(pb, rpc2_logfile);
}
#endif
assert(pb->Prefix.MagicNumber == OBJ_PACKETBUFFER);
whichSocket = rpc2_v6RequestSocket;
if (whichSocket == -1 ||
(rpc2_v4RequestSocket != -1 && addr->ai_family == PF_INET))
whichSocket = rpc2_v4RequestSocket;
if (whichSocket == -1)
return; // RPC2_NOCONNECTION
TR_XMIT();
/* Only Internet for now; no name->number translation attempted */
rpc2_Sent.Total++;
rpc2_Sent.Bytes += pb->Prefix.LengthOfPacket;
if (FailPacket(Fail_SendPredicate, pb, addr, whichSocket))
return;
rc = LUA_fail_delay(addr, pb, 1, &tv);
if (rc == -1) { /* drop */
say(9, RPC2_DebugLevel, "Dropping outgoing packet\n");
return;
}
if (rc && rpc2_DelayedSend(whichSocket, addr, pb, &tv)) return; /* delay */
if (confirm)
flags = msg_confirm;
n = secure_sendto(whichSocket, &pb->Header,
pb->Prefix.LengthOfPacket, flags,
addr->ai_addr, addr->ai_addrlen, pb->Prefix.sa);
if (n == -1 && errno == EAGAIN)
{
/* operation failed probably because the send buffer was full. we could
* try to select for write and retry, or we could just consider this
* packet lost on the network.
*/
} else
if (n == -1 && errno == EINVAL && msg_confirm) {
/* maybe the kernel didn't like the MSG_CONFIRM flag. */
msg_confirm = 0;
}
else
if (RPC2_Perror && n != pb->Prefix.LengthOfPacket)
{
char msg[100];
sprintf(msg, "Xmit_Packet socket %d", whichSocket);
perror(msg);
}
/* Log outgoing packets that are larger than the IPv6 MTU
* (- ipv6 hdr, ipv6 fragment hdr, udp hdr, secure spi/seq/iv/icv)
*
* Only log the first 10 oversized packets and only when we know
* for sure that the headers are still unencrypted and thus, useful */
if (log_limit < 10 && pb->Prefix.sa &&
pb->Prefix.LengthOfPacket > (1280 - 40 - 8 - 8 - 24))
{
fprintf(rpc2_logfile,
"XMIT: Sent long packet (subsys %d, opcode %d, length %ld)\n",
ntohl(pb->Header.SubsysId), ntohl(pb->Header.Opcode),
pb->Prefix.LengthOfPacket);
fflush(rpc2_logfile);
log_limit++;
}
}
struct security_association *rpc2_GetSA(uint32_t spi)
{
struct CEntry *ce= __rpc2_GetConn((RPC2_Handle)spi);
return ce ? &ce->sa : NULL;
}
/* Reads the next packet from whichSocket into whichBuff, sets its
LengthOfPacket field, fills in whichHost and whichPort, and
returns 0; Returns -3 iff a too-long packet arrived. Returns -1 on
any other system call error.
Note that whichBuff should at least be able to accomodate 1 byte
more than the longest receivable packet. Only Internet packets are
dealt with currently. */
long rpc2_RecvPacket(IN long whichSocket, OUT RPC2_PacketBuffer *whichBuff)
{
long rc, len;
socklen_t fromlen;
struct sockaddr_storage ss;
say(1, RPC2_DebugLevel, "rpc2_RecvPacket()\n");
assert(whichBuff->Prefix.MagicNumber == OBJ_PACKETBUFFER);
len = whichBuff->Prefix.BufferSize - (long)(&whichBuff->Header) + (long)(whichBuff);
assert(len > 0);
/* WARNING: only Internet works; no warnings */
fromlen = sizeof(ss);
rc = secure_recvfrom(whichSocket, &whichBuff->Header, len, 0,
(struct sockaddr *) &ss, &fromlen,
&whichBuff->Prefix.sa, rpc2_GetSA);
if (rc > len) {
errno = ENOMEM;
rc = -1;
}
if (rc < 0) {
switch (errno) {
case EAGAIN: /* the packet did not decrypt/validate correctly or may
have had a corrupt udp checksum */
case ENOMEM: /* received packet was too large */
case ENOENT: /* no matching security association found */
break;
default:
say(10, RPC2_DebugLevel, "Error in recvfrom: errno = %d\n", errno);
break;
}
return -1;
}
whichBuff->Prefix.PeerAddr =
RPC2_allocaddrinfo((struct sockaddr *)&ss, fromlen,
SOCK_DGRAM, IPPROTO_UDP);
TR_RECV();
if (FailPacket(Fail_RecvPredicate, whichBuff, whichBuff->Prefix.PeerAddr,
whichSocket))
{
errno = EAGAIN;
return (-1);
}
whichBuff->Prefix.LengthOfPacket = rc;
if (rc == len) {
rpc2_Recvd.Giant++;
return(-3);
}
/* Try to get an accurate arrival time estimate for this packet */
/* This ioctl might be used on linux systems only, but you never know */
#if 0 // defined(SIOCGSTAMP)
/* Very nice for accurate network RTT estimates, but we don't measure the time
* it takes for the server to wake up and send back the response. i.e. The
* client will end up assuming the server is faster than it really is so I've
* disabled this code -JH */
rc = ioctl(whichSocket, SIOCGSTAMP, &whichBuff->Prefix.RecvStamp);
if (rc < 0)
#endif
{
FT_GetTimeOfDay(&whichBuff->Prefix.RecvStamp, (struct timezone *)0);
}
return(0);
}
/*
Initializes default retry intervals given the number of
retries desired and the keepalive interval.
Returns 0 on success, -1 on bogus parameters.
*/
long rpc2_InitRetry(IN long HowManyRetries, IN struct timeval *Beta0)
/* HowManyRetries" should be less than 30; -1 for default */
/* Beta0: NULL for default */
{
if (HowManyRetries >= 30) return(-1); /* avoid overflow with 32-bit integers */
Retry_N = (HowManyRetries >= 0) ? HowManyRetries : DefaultRetryCount;
KeepAlive = Beta0 ? *Beta0 : DefaultRetryInterval;
return(0);
}
int RPC2_SetTimeout(RPC2_Handle whichConn, struct timeval timeout)
{
struct CEntry *Conn = rpc2_GetConn(whichConn);
if (!Conn) return RPC2_NOCONNECTION;
Conn->KeepAlive = timeout;
return RPC2_SUCCESS;
}
long rpc2_CancelRetry(struct CEntry *Conn, struct SL_Entry *Sle)
{
/*
* see if we've heard anything from a side effect
* since we've been asleep. If so, pretend we got
* a keepalive at that time, and activate a SLE
* with a timeout of beta_0 after that time.
*/
struct timeval now, lastword;
say(1, RPC2_DebugLevel, "rpc2_CancelRetry()\n");
if (Conn->SEProcs && Conn->SEProcs->SE_GetSideEffectTime &&
(Conn->SEProcs->SE_GetSideEffectTime(Conn->UniqueCID, &lastword) == RPC2_SUCCESS) &&
TIMERISSET(&lastword)) { /* don't bother unless we've actually heard */
FT_GetTimeOfDay(&now, (struct timezone *)0);
SUBTIME(&now, &lastword);
say(9, RPC2_DebugLevel,
"Heard from side effect on %#x %ld.%06ld ago, retry interval was %ld.%06ld\n",
Conn->UniqueCID, now.tv_sec, now.tv_usec,
Sle->RInterval.tv_sec, Sle->RInterval.tv_usec);
if (CMPTIME(&now, &Sle->RInterval, <)) {
Sle->RInterval.tv_sec = Conn->KeepAlive.tv_sec / 3;
Sle->RInterval.tv_usec = Conn->KeepAlive.tv_usec / 3;
SUBTIME(&Sle->RInterval, &now);
say(/*9*/4, RPC2_DebugLevel,
"Supressing retry %d at %ld on %#x, new timeout = %ld.%06ld\n",
Sle->RetryIndex, rpc2_time(), Conn->UniqueCID,
Sle->RInterval.tv_sec, Sle->RInterval.tv_usec);
rpc2_Sent.Cancelled++;
Sle->RetryIndex = 0;
rpc2_ActivateSle(Sle, &Sle->RInterval);
return(1);
}
}
return(0);
}
long rpc2_SendReliably(struct CEntry *Conn, struct SL_Entry *Sle,
RPC2_PacketBuffer *Packet, struct timeval *TimeOut)
{
struct SL_Entry *tlp;
long hopeleft, finalrc;
int rc;
say(1, RPC2_DebugLevel, "rpc2_SendReliably()\n");
TR_SENDRELIABLY();
if (TimeOut != NULL)
{/* create a time bomb */
tlp = rpc2_AllocSle(OTHER, NULL);
rpc2_ActivateSle(tlp, TimeOut);
}
else tlp = NULL;
Conn->reqsize = Packet->Prefix.LengthOfPacket;
Sle->RetryIndex = 0;
/* XXX we should have the size of the expected reply packet */
rc = rpc2_RetryInterval(Conn, 0, &Sle->RInterval,
Packet->Prefix.LengthOfPacket,
sizeof(struct RPC2_PacketHeader), 0);
assert(rc == 0);
/* Do an initial send of the packet */
say(9, RPC2_DebugLevel, "Sending try at %ld on %#x (timeout %ld.%06ld)\n",
rpc2_time(), Conn->UniqueCID,
Sle->RInterval.tv_sec, Sle->RInterval.tv_usec);
if (TestRole(Conn, CLIENT)) /* stamp the outgoing packet */
Packet->Header.TimeStamp = htonl(rpc2_MakeTimeStamp());
rpc2_XmitPacket(Packet, Conn->HostInfo->Addr, 0);
/* Initialize the SL Entry */
rpc2_ActivateSle(Sle, &Sle->RInterval);
finalrc = RPC2_SUCCESS;
do
{
hopeleft = 0;
LWP_WaitProcess((char *)Sle); /* SocketListener will awaken me */
if (tlp && tlp->ReturnCode == TIMEOUT)
{
/* Overall timeout expired: clean up state and quit */
rpc2_IncrementSeqNumber(Conn);
SetState(Conn, C_THINK);
finalrc = RPC2_TIMEOUT;
break; /* while */
}
switch(Sle->ReturnCode)
{
case NAKED:
case ARRIVED:
break; /* switch */
case KEPTALIVE:
hopeleft = 1;
Sle->RetryIndex = 0;
Sle->RInterval.tv_sec = Conn->KeepAlive.tv_sec / 3;
Sle->RInterval.tv_usec = Conn->KeepAlive.tv_usec / 3;
rpc2_ActivateSle(Sle, &Sle->RInterval);
break; /* switch */
case TIMEOUT:
if ((hopeleft = rpc2_CancelRetry(Conn, Sle)))
break; /* switch; we heard from side effect recently */
Sle->RetryIndex += 1;
/* XXX we should have the size of the expected reply packet */
rc = rpc2_RetryInterval(Conn, Sle->RetryIndex,
&Sle->RInterval,
Packet->Prefix.LengthOfPacket,
sizeof(struct RPC2_PacketHeader), 0);
if (rc) break;
hopeleft = 1;
rpc2_ActivateSle(Sle, &Sle->RInterval);
say(9, RPC2_DebugLevel,
"Sending retry %d at %ld on %#x (timeout %ld.%06ld)\n",
Sle->RetryIndex, rpc2_time(), Conn->UniqueCID,
Sle->RInterval.tv_sec, Sle->RInterval.tv_usec);
Packet->Header.Flags = htonl((ntohl(Packet->Header.Flags) | RPC2_RETRY));
if (TestRole(Conn, CLIENT)) /* restamp retries if client */
Packet->Header.TimeStamp = htonl(rpc2_MakeTimeStamp());
rpc2_Sent.Retries += 1;
rpc2_XmitPacket(Packet, Conn->HostInfo->Addr, 0);
break; /* switch */
default: assert(FALSE);
}
}
while (hopeleft);
if (tlp)
{
rpc2_DeactivateSle(tlp, 0); /* delete time bomb */
rpc2_FreeSle(&tlp);
}
return(finalrc);
}
/* For converting packet headers to/from network order */
void rpc2_htonp(RPC2_PacketBuffer *p)
{
p->Header.ProtoVersion = htonl(p->Header.ProtoVersion);
p->Header.RemoteHandle = htonl(p->Header.RemoteHandle);
p->Header.LocalHandle = htonl(p->Header.LocalHandle);
p->Header.Flags = htonl(p->Header.Flags);
p->Header.BodyLength = htonl(p->Header.BodyLength);
p->Header.SeqNumber = htonl(p->Header.SeqNumber);
p->Header.Opcode = htonl(p->Header.Opcode);
p->Header.SEFlags = htonl(p->Header.SEFlags);
p->Header.SEDataOffset = htonl(p->Header.SEDataOffset);
p->Header.SubsysId = htonl(p->Header.SubsysId);
p->Header.ReturnCode = htonl(p->Header.ReturnCode);
p->Header.Lamport = htonl(p->Header.Lamport);
p->Header.Uniquefier = htonl(p->Header.Uniquefier);
p->Header.TimeStamp = htonl(p->Header.TimeStamp);
p->Header.BindTime = htonl(p->Header.BindTime);
}
void rpc2_ntohp(RPC2_PacketBuffer *p)
{
p->Header.ProtoVersion = ntohl(p->Header.ProtoVersion);
p->Header.RemoteHandle = ntohl(p->Header.RemoteHandle);
p->Header.LocalHandle = ntohl(p->Header.LocalHandle);
p->Header.Flags = ntohl(p->Header.Flags);
p->Header.BodyLength = ntohl(p->Header.BodyLength);
p->Header.SeqNumber = ntohl(p->Header.SeqNumber);
p->Header.Opcode = ntohl(p->Header.Opcode);
p->Header.SEFlags = ntohl(p->Header.SEFlags);
p->Header.SEDataOffset = ntohl(p->Header.SEDataOffset);
p->Header.SubsysId = ntohl(p->Header.SubsysId);
p->Header.ReturnCode = ntohl(p->Header.ReturnCode);
p->Header.Lamport = ntohl(p->Header.Lamport);
p->Header.Uniquefier = ntohl(p->Header.Uniquefier);
p->Header.TimeStamp = ntohl(p->Header.TimeStamp);
p->Header.BindTime = ntohl(p->Header.BindTime);
}
void rpc2_InitPacket(RPC2_PacketBuffer *pb, struct CEntry *ce, long bodylen)
{
assert(pb);
memset(&pb->Header, 0, sizeof(struct RPC2_PacketHeader));
pb->Header.ProtoVersion = RPC2_PROTOVERSION;
pb->Header.Lamport = RPC2_LamportTime();
pb->Header.BodyLength = bodylen;
pb->Prefix.LengthOfPacket = sizeof(struct RPC2_PacketHeader) + bodylen;
memset(&pb->Prefix.RecvStamp, 0, sizeof(struct timeval));
if (ce) {
pb->Prefix.sa = &ce->sa;
pb->Header.RemoteHandle = ce->PeerHandle;
pb->Header.LocalHandle = ce->UniqueCID;
pb->Header.SubsysId = ce->SubsysId;
pb->Header.Uniquefier = ce->PeerUnique;
SetPktColor(pb, ce->Color);
}
}
|