/* This file is part of the sample code and exercises * used by the class "Advanced Programming in the UNIX * Environment" taught by Jan Schaumann * at Stevens Institute of * Technology. * * https://stevens.netmeister.org/631/ */ /* $NetBSD: socketpair.c,v 1.3 2003/08/07 10:30:50 agc Exp $ * * Copyright (c) 1986, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH * DAMAGE. * * @(#)socketpair.c 8.1 (Berkeley) 6/8/93 */ #include #include #include #include #include #include #define DATA1 "In Xanadu, did Kubla Khan . . ." #define DATA2 "A stately pleasure dome decree . . ." /* * This program creates a pair of connected sockets then forks and * communicates over them. This is very similar to communication with pipes, * however, socketpairs are two-way communications objects. Therefore I can * send messages in both directions. */ int main() { int sockets[2], child; char buf[BUFSIZ]; if (socketpair(AF_UNIX, SOCK_STREAM, 0, sockets) < 0) { perror("opening stream socket pair"); exit(1); } /* Note: Execution order of parent/child is not guaranteed! Hence, * order of data being sent/read is entirely undefined. Do not * rely on any order, even if you repeatedly observe it to follow * what you perceive as a pattern. */ if ((child = fork()) == -1) perror("fork"); else if (child) { close(sockets[0]); if (read(sockets[1], buf, BUFSIZ) < 0) perror("reading stream message"); printf("Parent (%d) --> reading: %s\n", getpid(), buf); printf("Parent (%d) --> sending: %s\n", getpid(), DATA1); if (write(sockets[1], DATA1, sizeof(DATA1)) < 0) perror("writing stream message"); close(sockets[1]); } else { close(sockets[1]); if (read(sockets[0], buf, BUFSIZ) < 0) perror("reading stream message"); printf("Child (%d) --> reading: %s\n", getpid(), buf); printf("Child (%d) --> sending: %s\n", getpid(), DATA2); if (write(sockets[0], DATA2, sizeof(DATA2)) < 0) perror("writing stream message"); close(sockets[0]); } return 0; }