ctl_transact.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1983 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)ctl_transact.c 5.8 (Berkeley) 3/1/91";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include <sys/types.h>
39 1.1 cgd #include <sys/socket.h>
40 1.1 cgd #include <sys/time.h>
41 1.1 cgd #include <netinet/in.h>
42 1.1 cgd #include <protocols/talkd.h>
43 1.1 cgd #include <errno.h>
44 1.1 cgd #include "talk_ctl.h"
45 1.1 cgd
46 1.1 cgd #define CTL_WAIT 2 /* time to wait for a response, in seconds */
47 1.1 cgd
48 1.1 cgd /*
49 1.1 cgd * SOCKDGRAM is unreliable, so we must repeat messages if we have
50 1.1 cgd * not recieved an acknowledgement within a reasonable amount
51 1.1 cgd * of time
52 1.1 cgd */
53 1.1 cgd ctl_transact(target, msg, type, rp)
54 1.1 cgd struct in_addr target;
55 1.1 cgd CTL_MSG msg;
56 1.1 cgd int type;
57 1.1 cgd CTL_RESPONSE *rp;
58 1.1 cgd {
59 1.1 cgd int read_mask, ctl_mask, nready, cc;
60 1.1 cgd struct timeval wait;
61 1.1 cgd
62 1.1 cgd msg.type = type;
63 1.1 cgd daemon_addr.sin_addr = target;
64 1.1 cgd daemon_addr.sin_port = daemon_port;
65 1.1 cgd ctl_mask = 1 << ctl_sockt;
66 1.1 cgd
67 1.1 cgd /*
68 1.1 cgd * Keep sending the message until a response of
69 1.1 cgd * the proper type is obtained.
70 1.1 cgd */
71 1.1 cgd do {
72 1.1 cgd wait.tv_sec = CTL_WAIT;
73 1.1 cgd wait.tv_usec = 0;
74 1.1 cgd /* resend message until a response is obtained */
75 1.1 cgd do {
76 1.1 cgd cc = sendto(ctl_sockt, (char *)&msg, sizeof (msg), 0,
77 1.1 cgd (struct sockaddr *)&daemon_addr,
78 1.1 cgd sizeof (daemon_addr));
79 1.1 cgd if (cc != sizeof (msg)) {
80 1.1 cgd if (errno == EINTR)
81 1.1 cgd continue;
82 1.1 cgd p_error("Error on write to talk daemon");
83 1.1 cgd }
84 1.1 cgd read_mask = ctl_mask;
85 1.1 cgd nready = select(32, &read_mask, 0, 0, &wait);
86 1.1 cgd if (nready < 0) {
87 1.1 cgd if (errno == EINTR)
88 1.1 cgd continue;
89 1.1 cgd p_error("Error waiting for daemon response");
90 1.1 cgd }
91 1.1 cgd } while (nready == 0);
92 1.1 cgd /*
93 1.1 cgd * Keep reading while there are queued messages
94 1.1 cgd * (this is not necessary, it just saves extra
95 1.1 cgd * request/acknowledgements being sent)
96 1.1 cgd */
97 1.1 cgd do {
98 1.1 cgd cc = recv(ctl_sockt, (char *)rp, sizeof (*rp), 0);
99 1.1 cgd if (cc < 0) {
100 1.1 cgd if (errno == EINTR)
101 1.1 cgd continue;
102 1.1 cgd p_error("Error on read from talk daemon");
103 1.1 cgd }
104 1.1 cgd read_mask = ctl_mask;
105 1.1 cgd /* an immediate poll */
106 1.1 cgd timerclear(&wait);
107 1.1 cgd nready = select(32, &read_mask, 0, 0, &wait);
108 1.1 cgd } while (nready > 0 && (rp->vers != TALK_VERSION ||
109 1.1 cgd rp->type != type));
110 1.1 cgd } while (rp->vers != TALK_VERSION || rp->type != type);
111 1.1 cgd rp->id_num = ntohl(rp->id_num);
112 1.1 cgd rp->addr.sa_family = ntohs(rp->addr.sa_family);
113 1.1 cgd }
114