Home | History | Annotate | Line # | Download | only in tftp
tftpsubs.c revision 1.1.1.2
      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 static char sccsid[] = "@(#)tftpsubs.c	8.1 (Berkeley) 6/6/93";
     36 #endif /* not lint */
     37 
     38 /* Simple minded read-ahead/write-behind subroutines for tftp user and
     39    server.  Written originally with multiple buffers in mind, but current
     40    implementation has two buffer logic wired in.
     41 
     42    Todo:  add some sort of final error check so when the write-buffer
     43    is finally flushed, the caller can detect if the disk filled up
     44    (or had an i/o error) and return a nak to the other side.
     45 
     46 			Jim Guyton 10/85
     47  */
     48 
     49 #include <sys/types.h>
     50 #include <sys/socket.h>
     51 #include <sys/ioctl.h>
     52 #include <netinet/in.h>
     53 #include <arpa/tftp.h>
     54 
     55 #include <stdio.h>
     56 #include <unistd.h>
     57 
     58 #include "tftpsubs.h"
     59 
     60 #define PKTSIZE SEGSIZE+4       /* should be moved to tftp.h */
     61 
     62 struct bf {
     63 	int counter;            /* size of data in buffer, or flag */
     64 	char buf[PKTSIZE];      /* room for data packet */
     65 } bfs[2];
     66 
     67 				/* Values for bf.counter  */
     68 #define BF_ALLOC -3             /* alloc'd but not yet filled */
     69 #define BF_FREE  -2             /* free */
     70 /* [-1 .. SEGSIZE] = size of data in the data buffer */
     71 
     72 static int nextone;		/* index of next buffer to use */
     73 static int current;		/* index of buffer in use */
     74 
     75 				/* control flags for crlf conversions */
     76 int newline = 0;		/* fillbuf: in middle of newline expansion */
     77 int prevchar = -1;		/* putbuf: previous char (cr check) */
     78 
     79 static struct tftphdr *rw_init();
     80 
     81 struct tftphdr *w_init() { return rw_init(0); }         /* write-behind */
     82 struct tftphdr *r_init() { return rw_init(1); }         /* read-ahead */
     83 
     84 static struct tftphdr *
     85 rw_init(x)			/* init for either read-ahead or write-behind */
     86 	int x;			/* zero for write-behind, one for read-head */
     87 {
     88 	newline = 0;		/* init crlf flag */
     89 	prevchar = -1;
     90 	bfs[0].counter =  BF_ALLOC;     /* pass out the first buffer */
     91 	current = 0;
     92 	bfs[1].counter = BF_FREE;
     93 	nextone = x;                    /* ahead or behind? */
     94 	return (struct tftphdr *)bfs[0].buf;
     95 }
     96 
     97 
     98 /* Have emptied current buffer by sending to net and getting ack.
     99    Free it and return next buffer filled with data.
    100  */
    101 int
    102 readit(file, dpp, convert)
    103 	FILE *file;                     /* file opened for read */
    104 	struct tftphdr **dpp;
    105 	int convert;                    /* if true, convert to ascii */
    106 {
    107 	struct bf *b;
    108 
    109 	bfs[current].counter = BF_FREE; /* free old one */
    110 	current = !current;             /* "incr" current */
    111 
    112 	b = &bfs[current];              /* look at new buffer */
    113 	if (b->counter == BF_FREE)      /* if it's empty */
    114 		read_ahead(file, convert);      /* fill it */
    115 /*      assert(b->counter != BF_FREE);*//* check */
    116 	*dpp = (struct tftphdr *)b->buf;        /* set caller's ptr */
    117 	return b->counter;
    118 }
    119 
    120 /*
    121  * fill the input buffer, doing ascii conversions if requested
    122  * conversions are  lf -> cr,lf  and cr -> cr, nul
    123  */
    124 void
    125 read_ahead(file, convert)
    126 	FILE *file;                     /* file opened for read */
    127 	int convert;                    /* if true, convert to ascii */
    128 {
    129 	register int i;
    130 	register char *p;
    131 	register int c;
    132 	struct bf *b;
    133 	struct tftphdr *dp;
    134 
    135 	b = &bfs[nextone];              /* look at "next" buffer */
    136 	if (b->counter != BF_FREE)      /* nop if not free */
    137 		return;
    138 	nextone = !nextone;             /* "incr" next buffer ptr */
    139 
    140 	dp = (struct tftphdr *)b->buf;
    141 
    142 	if (convert == 0) {
    143 		b->counter = read(fileno(file), dp->th_data, SEGSIZE);
    144 		return;
    145 	}
    146 
    147 	p = dp->th_data;
    148 	for (i = 0 ; i < SEGSIZE; i++) {
    149 		if (newline) {
    150 			if (prevchar == '\n')
    151 				c = '\n';       /* lf to cr,lf */
    152 			else    c = '\0';       /* cr to cr,nul */
    153 			newline = 0;
    154 		}
    155 		else {
    156 			c = getc(file);
    157 			if (c == EOF) break;
    158 			if (c == '\n' || c == '\r') {
    159 				prevchar = c;
    160 				c = '\r';
    161 				newline = 1;
    162 			}
    163 		}
    164 	       *p++ = c;
    165 	}
    166 	b->counter = (int)(p - dp->th_data);
    167 }
    168 
    169 /* Update count associated with the buffer, get new buffer
    170    from the queue.  Calls write_behind only if next buffer not
    171    available.
    172  */
    173 int
    174 writeit(file, dpp, ct, convert)
    175 	FILE *file;
    176 	struct tftphdr **dpp;
    177 	int ct, convert;
    178 {
    179 	bfs[current].counter = ct;      /* set size of data to write */
    180 	current = !current;             /* switch to other buffer */
    181 	if (bfs[current].counter != BF_FREE)     /* if not free */
    182 		(void)write_behind(file, convert); /* flush it */
    183 	bfs[current].counter = BF_ALLOC;        /* mark as alloc'd */
    184 	*dpp =  (struct tftphdr *)bfs[current].buf;
    185 	return ct;                      /* this is a lie of course */
    186 }
    187 
    188 /*
    189  * Output a buffer to a file, converting from netascii if requested.
    190  * CR,NUL -> CR  and CR,LF => LF.
    191  * Note spec is undefined if we get CR as last byte of file or a
    192  * CR followed by anything else.  In this case we leave it alone.
    193  */
    194 int
    195 write_behind(file, convert)
    196 	FILE *file;
    197 	int convert;
    198 {
    199 	char *buf;
    200 	int count;
    201 	register int ct;
    202 	register char *p;
    203 	register int c;                 /* current character */
    204 	struct bf *b;
    205 	struct tftphdr *dp;
    206 
    207 	b = &bfs[nextone];
    208 	if (b->counter < -1)            /* anything to flush? */
    209 		return 0;               /* just nop if nothing to do */
    210 
    211 	count = b->counter;             /* remember byte count */
    212 	b->counter = BF_FREE;           /* reset flag */
    213 	dp = (struct tftphdr *)b->buf;
    214 	nextone = !nextone;             /* incr for next time */
    215 	buf = dp->th_data;
    216 
    217 	if (count <= 0) return -1;      /* nak logic? */
    218 
    219 	if (convert == 0)
    220 		return write(fileno(file), buf, count);
    221 
    222 	p = buf;
    223 	ct = count;
    224 	while (ct--) {                  /* loop over the buffer */
    225 	    c = *p++;                   /* pick up a character */
    226 	    if (prevchar == '\r') {     /* if prev char was cr */
    227 		if (c == '\n')          /* if have cr,lf then just */
    228 		   fseek(file, -1, 1);  /* smash lf on top of the cr */
    229 		else
    230 		   if (c == '\0')       /* if have cr,nul then */
    231 			goto skipit;    /* just skip over the putc */
    232 		/* else just fall through and allow it */
    233 	    }
    234 	    putc(c, file);
    235 skipit:
    236 	    prevchar = c;
    237 	}
    238 	return count;
    239 }
    240 
    241 
    242 /* When an error has occurred, it is possible that the two sides
    243  * are out of synch.  Ie: that what I think is the other side's
    244  * response to packet N is really their response to packet N-1.
    245  *
    246  * So, to try to prevent that, we flush all the input queued up
    247  * for us on the network connection on our host.
    248  *
    249  * We return the number of packets we flushed (mostly for reporting
    250  * when trace is active).
    251  */
    252 
    253 int
    254 synchnet(f)
    255 	int	f;		/* socket to flush */
    256 {
    257 	int i, j = 0;
    258 	char rbuf[PKTSIZE];
    259 	struct sockaddr_in from;
    260 	int fromlen;
    261 
    262 	while (1) {
    263 		(void) ioctl(f, FIONREAD, &i);
    264 		if (i) {
    265 			j++;
    266 			fromlen = sizeof from;
    267 			(void) recvfrom(f, rbuf, sizeof (rbuf), 0,
    268 				(struct sockaddr *)&from, &fromlen);
    269 		} else {
    270 			return(j);
    271 		}
    272 	}
    273 }
    274