Lines Matching full:sockets

47 and one or more associated processes.  Sockets exist within
51 processes communicating through sockets.
52 One such property is the scheme used to name sockets.  For
53 example, in the UNIX communication domain sockets are
55 socket may be named \*(lq/dev/foo\*(rq.  Sockets normally
57 sockets in the same domain (it may be possible to cross domain
84 Sockets are
87 Processes are presumed to communicate only between sockets of
89 nothing that prevents communication between sockets of different
93 Four types of sockets currently are available to a user.
97 stream sockets provides an interface nearly identical to that of pipes\(dg.
101 as simply a pair of connected stream sockets.
112 sockets closely model the facilities found in many contemporary
118 These sockets are normally datagram oriented, though their
120 the protocol.  Raw sockets are not intended for the general user; they
123 esoteric facilities of an existing protocol.  The use of raw sockets
130 Sequenced-packet sockets allow the user to manipulate the
162 in later system calls which operate on sockets.  The domain is specified as
215 address, foreign port> tuples.  UNIX domain sockets need not always
229 binding names to sockets can be fairly complex.
235 sockets is similar in most ways to that of
236 binding names to Internet sockets.
477 Out of band data is a notion specific to stream sockets, and one
488 Discarding sockets
510 Connectionless sockets
512 To this point we have been concerned mostly with sockets which
521 Datagram sockets are created as before.
553 sockets may also use the \fIconnect\fP call to associate
562 Connect requests on datagram sockets return immediately,
567 used with datagram sockets.
580 important details of datagram sockets are described
587 sockets and/or files.  This is done using the \fIselect\fP
662 As an example, to read data from two sockets, \fIs1\fP and