Home | History | Annotate | Line # | Download | only in common
gets.c revision 1.1.10.2 
      1 /*	$NetBSD: gets.c,v 1.1.10.2 2006/05/24 15:48:07 tron Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  *
     35  *	@(#)gets.c	8.1 (Berkeley) 6/11/93
     36  */
     37 
     38 #include <sys/cdefs.h>
     39 
     40 #include "bootstrap.h"
     41 
     42 /* gets() with constrained input length */
     43 
     44 void
     45 ngets(char *buf, int n)
     46 {
     47     int c;
     48     char *lp;
     49 
     50     for (lp = buf;;)
     51 	switch (c = getchar() & 0177) {
     52 	case '\n':
     53 	case '\r':
     54 	    *lp = '\0';
     55 	    putchar('\n');
     56 	    return;
     57 	case '\b':
     58 	case '\177':
     59 	    if (lp > buf) {
     60 		lp--;
     61 		putchar('\b');
     62 		putchar(' ');
     63 		putchar('\b');
     64 	    }
     65 	    break;
     66 	case 'r'&037: {
     67 	    char *p;
     68 
     69 	    putchar('\n');
     70 	    for (p = buf; p < lp; ++p)
     71 		putchar(*p);
     72 	    break;
     73 	}
     74 	case 'u'&037:
     75 	case 'w'&037:
     76 	    lp = buf;
     77 	    putchar('\n');
     78 	    break;
     79 	default:
     80 	    if ((n < 1) || ((lp - buf) < n)) {
     81 		*lp++ = c;
     82 		putchar(c);
     83 	    }
     84 	}
     85     /*NOTREACHED*/
     86 }
     87 
     88 int
     89 fgetstr(char *buf, int size, int fd)
     90 {
     91     char	c;
     92     int		err, len;
     93 
     94     size--;	/* leave space for terminator */
     95     len = 0;
     96     while (size != 0) {
     97 	err = read(fd, &c, sizeof(c));
     98 	if (err < 0)		/* read error */
     99 	    return(-1);
    100 	if (err == 0) {		/* EOF */
    101 	    if (len == 0)
    102 		return(-1);	/* nothing to read */
    103 	    break;
    104 	}
    105 	if ((c == '\r') ||	/* line terminators */
    106 	    (c == '\n'))
    107 	    break;
    108 	*buf++ = c;		/* keep char */
    109 	size--;
    110 	len++;
    111     }
    112     *buf = 0;
    113     return(len);
    114 }
    115