Commit | Line | Data |
---|---|---|
720b47f2 AT |
1 | /* |
2 | Copyright (C) Andrew Tridgell 1996 | |
3 | Copyright (C) Paul Mackerras 1996 | |
4 | ||
5 | This program is free software; you can redistribute it and/or modify | |
6 | it under the terms of the GNU General Public License as published by | |
7 | the Free Software Foundation; either version 2 of the License, or | |
8 | (at your option) any later version. | |
9 | ||
10 | This program is distributed in the hope that it will be useful, | |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | GNU General Public License for more details. | |
14 | ||
15 | You should have received a copy of the GNU General Public License | |
16 | along with this program; if not, write to the Free Software | |
17 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
18 | */ | |
19 | ||
20 | /* | |
21 | Utilities used in rsync | |
22 | ||
23 | tridge, June 1996 | |
24 | */ | |
25 | #include "rsync.h" | |
26 | ||
27 | static int total_written = 0; | |
28 | static int total_read = 0; | |
29 | ||
30 | extern int verbose; | |
31 | ||
32 | int write_total(void) | |
33 | { | |
34 | return total_written; | |
35 | } | |
36 | ||
37 | int read_total(void) | |
38 | { | |
39 | return total_read; | |
40 | } | |
41 | ||
42 | static int buffer_f_in = -1; | |
43 | ||
44 | void setup_nonblocking(int f_in,int f_out) | |
45 | { | |
46 | set_blocking(f_out,0); | |
47 | buffer_f_in = f_in; | |
48 | } | |
49 | ||
50 | ||
51 | static char *read_buffer = NULL; | |
52 | static char *read_buffer_p = NULL; | |
53 | static int read_buffer_len = 0; | |
54 | static int read_buffer_size = 0; | |
55 | ||
56 | ||
57 | /* This function was added to overcome a deadlock problem when using | |
58 | * ssh. It looks like we can't allow our receive queue to get full or | |
59 | * ssh will clag up. Uggh. */ | |
60 | static void read_check(int f) | |
61 | { | |
62 | int n; | |
63 | ||
64 | if (read_buffer_len == 0) { | |
65 | read_buffer_p = read_buffer; | |
66 | } | |
67 | ||
68 | if ((n=num_waiting(f)) <= 0) | |
69 | return; | |
70 | ||
71 | if (read_buffer_p != read_buffer) { | |
72 | memmove(read_buffer,read_buffer_p,read_buffer_len); | |
73 | read_buffer_p = read_buffer; | |
74 | } | |
75 | ||
76 | if (n > (read_buffer_size - read_buffer_len)) { | |
77 | read_buffer_size += n; | |
78 | if (!read_buffer) | |
79 | read_buffer = (char *)malloc(read_buffer_size); | |
80 | else | |
81 | read_buffer = (char *)realloc(read_buffer,read_buffer_size); | |
82 | if (!read_buffer) out_of_memory("read check"); | |
83 | read_buffer_p = read_buffer; | |
84 | } | |
85 | ||
86 | n = read(f,read_buffer+read_buffer_len,n); | |
87 | if (n > 0) { | |
88 | read_buffer_len += n; | |
89 | } | |
90 | } | |
91 | ||
92 | ||
93 | static int readfd(int fd,char *buffer,int N) | |
94 | { | |
95 | int ret; | |
96 | int total=0; | |
97 | ||
98 | while (total < N) | |
99 | { | |
100 | if (read_buffer_len > 0) { | |
101 | ret = MIN(read_buffer_len,N-total); | |
102 | memcpy(buffer+total,read_buffer_p,ret); | |
103 | read_buffer_p += ret; | |
104 | read_buffer_len -= ret; | |
105 | } else { | |
106 | ret = read(fd,buffer + total,N - total); | |
107 | } | |
108 | ||
109 | if (ret <= 0) | |
110 | return total; | |
111 | total += ret; | |
112 | } | |
113 | return total; | |
114 | } | |
115 | ||
116 | ||
117 | int read_int(int f) | |
118 | { | |
119 | char b[4]; | |
120 | if (readfd(f,b,4) != 4) { | |
121 | if (verbose > 1) | |
122 | fprintf(stderr,"Error reading %d bytes : %s\n",4,strerror(errno)); | |
123 | exit(1); | |
124 | } | |
125 | total_read += 4; | |
126 | return IVAL(b,0); | |
127 | } | |
128 | ||
129 | void read_buf(int f,char *buf,int len) | |
130 | { | |
131 | if (readfd(f,buf,len) != len) { | |
132 | if (verbose > 1) | |
133 | fprintf(stderr,"Error reading %d bytes : %s\n",len,strerror(errno)); | |
134 | exit(1); | |
135 | } | |
136 | total_read += len; | |
137 | } | |
138 | ||
139 | ||
140 | int read_write(int fd_in,int fd_out,int size) | |
141 | { | |
142 | static char *buf=NULL; | |
143 | static int bufsize = WRITE_BLOCK_SIZE; | |
144 | int total=0; | |
145 | ||
146 | if (!buf) { | |
147 | buf = (char *)malloc(bufsize); | |
148 | if (!buf) out_of_memory("read_write"); | |
149 | } | |
150 | ||
151 | while (total < size) { | |
152 | int n = MIN(size-total,bufsize); | |
153 | read_buf(fd_in,buf,n); | |
154 | if (write(fd_out,buf,n) != n) | |
155 | return total; | |
156 | total += n; | |
157 | } | |
158 | return total; | |
159 | } | |
160 | ||
161 | ||
162 | static int writefd(int fd,char *buf,int len) | |
163 | { | |
164 | int total = 0; | |
165 | fd_set fds; | |
58d433ab | 166 | struct timeval tv; |
720b47f2 AT |
167 | |
168 | if (buffer_f_in == -1) | |
169 | return write(fd,buf,len); | |
170 | ||
171 | while (total < len) { | |
172 | int ret = write(fd,buf+total,len-total); | |
173 | ||
174 | if (ret == 0) return total; | |
175 | ||
176 | if (ret == -1 && errno != EWOULDBLOCK) | |
177 | return total?total:-1; | |
178 | ||
179 | if (ret == -1) { | |
180 | read_check(buffer_f_in); | |
181 | ||
182 | FD_ZERO(&fds); | |
183 | FD_SET(fd,&fds); | |
58d433ab AT |
184 | tv.tv_sec = BLOCKING_TIMEOUT; |
185 | tv.tv_usec = 0; | |
186 | select(16,NULL,&fds,NULL,&tv); | |
720b47f2 AT |
187 | } else { |
188 | total += ret; | |
189 | } | |
190 | } | |
191 | ||
192 | return total; | |
193 | } | |
194 | ||
195 | ||
196 | ||
197 | void write_int(int f,int x) | |
198 | { | |
199 | char b[4]; | |
200 | SIVAL(b,0,x); | |
201 | if (writefd(f,b,4) != 4) { | |
202 | fprintf(stderr,"write_int failed : %s\n",strerror(errno)); | |
203 | exit(1); | |
204 | } | |
205 | total_written += 4; | |
206 | } | |
207 | ||
208 | void write_buf(int f,char *buf,int len) | |
209 | { | |
210 | if (writefd(f,buf,len) != len) { | |
211 | fprintf(stderr,"write_buf failed : %s\n",strerror(errno)); | |
212 | exit(1); | |
213 | } | |
214 | total_written += len; | |
215 | } | |
216 | ||
217 | ||
218 | void write_flush(int f) | |
219 | { | |
220 | } | |
221 | ||
222 |