Lines Matching +full:int +full:- +full:clock +full:- +full:stable +full:- +full:broken
2 .\" Must use -- tbl -- with this one
51 One program may deal with high-level applications such as file system
52 access control and locking. The other may deal with low-level file
62 procedure in some well-specified location (such as a result
65 procedure are extracted from the well-specified location, and the
105 is own retransmission and time-out policy as the RPC layer does not
113 application retransmits RPC messages after short time-outs, the only
120 execute-at-most-once semantics. A server can do this by taking
128 execute-at-most-once semantics. The server is not allowed to examine
135 connection-oriented protocol like TCP is used, an application still
136 needs time-outs and reconnection to handle server crashes.
138 There are other possibilities for transports besides datagram- or
139 connection-oriented protocols. For example, a request-reply protocol
151 is left up to some higher-level software. (The software may use RPC
154 Implementors should think of the RPC protocol as the jump-subroutine
163 identify itself to a service and vice-versa. Security and access
181 Provisions for authenticating the caller to service and vice-versa.
184 worth supporting because of protocol roll-over errors, implementation
206 stable, and mature protocols, a version field of the call message
243 Provisions for authentication of caller to service and vice-versa are
294 0 - 1fffffff&Defined by Sun
295 20000000 - 3fffffff&Defined by user
296 40000000 - 5fffffff&Transient
297 60000000 - 7fffffff&Reserved
298 80000000 - 9fffffff&Reserved
299 a0000000 - bfffffff&Reserved
300 c0000000 - dfffffff&Reserved
301 e0000000 - ffffffff&Reserved
317 However, the protocol itself is a message-passing protocol with which
318 other (non-RPC) protocols can be implemented. Sun currently uses, or
320 (non-RPC) protocols: batching (or pipelining) and broadcast RPC.
335 In broadcast RPC-based protocols, the client sends a broadcast packet
337 unreliable, packet-based protocols (like UDP/IP) as its transports.
348 description language. The message is defined in a top-down style.
414 * followed by a two-armed discriminated union. The union's
425 unsigned int xid;
451 unsigned int rpcvers; /* \fImust be equal to two (2) \fP*/
452 unsigned int prog;
453 unsigned int vers;
454 unsigned int proc;
496 /* \fIprocedure-specific results start here\fP */
499 unsigned int low;
500 unsigned int high;
530 unsigned int low;
531 unsigned int high;
541 open-ended to the rest of the RPC protocol. This section defines
568 unsigned int stamp;
570 unsigned int uid;
571 unsigned int gid;
572 unsigned int gids<10>;
623 The naming is too UNIX-system oriented.
659 a one-to-one correspondence between naming methods and operating
669 vice-versa). The contents of this verifier is primarily an
681 authentication is Diffie-Hellman [3] with 192-bit keys. The
720 \&Nicknames and Clock Synchronization
769 * A 64-bit block of encrypted DES data
798 unsigned int window; /* \fIencrypted window \f(CW*/
810 unsigned int adc_nickname;
819 unsigned int seconds; /* \fIseconds \fP*/
820 unsigned int useconds; /* \fIand microseconds \fP*/
831 * \f(CWadv_timestamp; \fP-- one DES block
832 * \f(CWadc_fullname.window; \fP-- one half DES block
833 * \f(CWadv_winverf; \fP-- one half DES block
842 unsigned int adv_winverf; /* \fIencrypted window verifier \fP*/
855 unsigned int adv_nickname; /* \fInew nickname for client \fP*/
860 \&Diffie-Hellman Encryption
942 that it could be broken. Breaking the conversation key is a far
944 short-lived.
946 The conversation key is encrypted using 56-bit DES keys, yet the
948 selected from the common key as follows. The middle-most 8-bytes
950 lower order bit of each byte, producing a 56-bit key with 8 bits of
964 fragment is a four-byte header followed by 0 to (2**31) - 1 bytes of
969 is the last fragment) and a 31-bit unsigned binary value which is the
971 highest-order bit of the header; the length is the 31 low-order bits.
978 Just as there was a need to describe the XDR data-types in a formal
980 on these XDR data-types in a formal language as well. We use the RPC
1004 * Ping the caller, return the round-trip time
1005 * (in microseconds). Returns -1 if the operation
1037 computing round-trip times from the client to the server and back
1056 .I program-def
1060 program-def:
1062 version-def
1063 version-def *
1066 version-def:
1068 procedure-def
1069 procedure-def *
1072 procedure-def:
1073 type-specifier identifier "(" type-specifier ")"
1100 transport-specific port numbers. This program makes dynamic binding
1132 unsigned int prog;
1133 unsigned int vers;
1134 unsigned int prot;
1135 unsigned int port;
1166 unsigned int prog;
1167 unsigned int vers;
1168 unsigned int proc;
1178 unsigned int port;
1203 unsigned int
1257 via the well-known port mapper's port. The parameters "prog",
1279 Procedure Calls"; XEROX CSL-83-7, October 1983.
1285 Transactions on Information Theory IT-22, November 1976.
1293 [6] Postel, J.; "Transmission Control Protocol - DARPA Internet