1 /* 2 * Copyright (c) 1983, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 #if 0 36 static char sccsid[] = "@(#)ctl.c 8.1 (Berkeley) 6/6/93"; 37 #endif 38 static const char rcsid[] = 39 "$Id: ctl.c,v 1.4 1998/01/14 07:20:59 charnier Exp $"; 40 #endif /* not lint */ 41 42 /* 43 * This file handles haggling with the various talk daemons to 44 * get a socket to talk to. sockt is opened and connected in 45 * the progress 46 */ 47 48 #include <sys/types.h> 49 #include <sys/socket.h> 50 #include "talk.h" 51 52 struct sockaddr_in daemon_addr = { sizeof(daemon_addr), AF_INET }; 53 struct sockaddr_in ctl_addr = { sizeof(ctl_addr), AF_INET }; 54 struct sockaddr_in my_addr = { sizeof(my_addr), AF_INET }; 55 56 /* inet addresses of the two machines */ 57 struct in_addr my_machine_addr; 58 struct in_addr his_machine_addr; 59 60 u_short daemon_port; /* port number of the talk daemon */ 61 62 int ctl_sockt; 63 int sockt; 64 int invitation_waiting = 0; 65 66 CTL_MSG msg; 67 68 void 69 open_sockt() 70 { 71 int length; 72 73 my_addr.sin_addr = my_machine_addr; 74 my_addr.sin_port = 0; 75 sockt = socket(AF_INET, SOCK_STREAM, 0); 76 if (sockt <= 0) 77 p_error("Bad socket"); 78 if (bind(sockt, (struct sockaddr *)&my_addr, sizeof(my_addr)) != 0) 79 p_error("Binding local socket"); 80 length = sizeof(my_addr); 81 if (getsockname(sockt, (struct sockaddr *)&my_addr, &length) == -1) 82 p_error("Bad address for socket"); 83 } 84 85 /* open the ctl socket */ 86 void 87 open_ctl() 88 { 89 int length; 90 91 ctl_addr.sin_port = 0; 92 ctl_addr.sin_addr = my_machine_addr; 93 ctl_sockt = socket(AF_INET, SOCK_DGRAM, 0); 94 if (ctl_sockt <= 0) 95 p_error("Bad socket"); 96 if (bind(ctl_sockt, 97 (struct sockaddr *)&ctl_addr, sizeof(ctl_addr)) != 0) 98 p_error("Couldn't bind to control socket"); 99 length = sizeof(ctl_addr); 100 if (getsockname(ctl_sockt, 101 (struct sockaddr *)&ctl_addr, &length) == -1) 102 p_error("Bad address for ctl socket"); 103 } 104 105 /* print_addr is a debug print routine */ 106 void 107 print_addr(addr) 108 struct sockaddr_in addr; 109 { 110 int i; 111 112 printf("addr = %lx, port = %o, family = %o zero = ", 113 (u_long)addr.sin_addr.s_addr, addr.sin_port, addr.sin_family); 114 for (i = 0; i<8;i++) 115 printf("%o ", (int)addr.sin_zero[i]); 116 putchar('\n'); 117 } 118