1 1.15 christos /* $NetBSD: gets.c,v 1.15 2019/03/31 20:08:45 christos Exp $ */ 2 1.5 cgd 3 1.1 brezak /*- 4 1.1 brezak * Copyright (c) 1993 5 1.1 brezak * The Regents of the University of California. All rights reserved. 6 1.1 brezak * 7 1.1 brezak * Redistribution and use in source and binary forms, with or without 8 1.1 brezak * modification, are permitted provided that the following conditions 9 1.1 brezak * are met: 10 1.1 brezak * 1. Redistributions of source code must retain the above copyright 11 1.1 brezak * notice, this list of conditions and the following disclaimer. 12 1.1 brezak * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 brezak * notice, this list of conditions and the following disclaimer in the 14 1.1 brezak * documentation and/or other materials provided with the distribution. 15 1.8 agc * 3. Neither the name of the University nor the names of its contributors 16 1.1 brezak * may be used to endorse or promote products derived from this software 17 1.1 brezak * without specific prior written permission. 18 1.1 brezak * 19 1.1 brezak * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 1.1 brezak * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 1.1 brezak * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 1.1 brezak * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 1.1 brezak * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 1.1 brezak * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 1.1 brezak * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 1.1 brezak * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 1.1 brezak * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 1.1 brezak * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 1.1 brezak * SUCH DAMAGE. 30 1.1 brezak * 31 1.5 cgd * @(#)gets.c 8.1 (Berkeley) 6/11/93 32 1.1 brezak */ 33 1.1 brezak 34 1.4 brezak #include "stand.h" 35 1.4 brezak 36 1.14 dholland #if 0 /* harmful */ 37 1.4 brezak void 38 1.10 isaki gets(char *buf) 39 1.1 brezak { 40 1.13 dholland kgets(buf, (size_t)-1); 41 1.1 brezak } 42 1.14 dholland #endif 43 1.11 maxv 44 1.11 maxv void 45 1.13 dholland kgets(char *buf, size_t size) 46 1.11 maxv { 47 1.11 maxv int c; 48 1.11 maxv char *lp; 49 1.11 maxv 50 1.11 maxv for (lp = buf;;) { 51 1.15 christos if ((size_t)(lp - buf) == size) { 52 1.11 maxv lp--; 53 1.11 maxv *lp = '\0'; 54 1.11 maxv return; 55 1.11 maxv } 56 1.11 maxv switch (c = getchar() & 0177) { 57 1.11 maxv case '\n': 58 1.11 maxv case '\r': 59 1.11 maxv *lp = '\0'; 60 1.11 maxv putchar('\n'); 61 1.11 maxv return; 62 1.11 maxv case '\b': 63 1.11 maxv case '\177': 64 1.11 maxv if (lp > buf) { 65 1.11 maxv lp--; 66 1.11 maxv putchar('\b'); 67 1.11 maxv putchar(' '); 68 1.11 maxv putchar('\b'); 69 1.11 maxv } 70 1.11 maxv break; 71 1.11 maxv #if HASH_ERASE 72 1.11 maxv case '#': 73 1.11 maxv if (lp > buf) 74 1.11 maxv --lp; 75 1.11 maxv break; 76 1.11 maxv #endif 77 1.11 maxv case 'r' & 037: { 78 1.11 maxv char *p; 79 1.11 maxv 80 1.11 maxv putchar('\n'); 81 1.11 maxv for (p = buf; p < lp; ++p) 82 1.11 maxv putchar(*p); 83 1.11 maxv break; 84 1.11 maxv } 85 1.11 maxv #if AT_ERASE 86 1.11 maxv case '@': 87 1.11 maxv #endif 88 1.11 maxv case 'u' & 037: 89 1.11 maxv case 'w' & 037: 90 1.11 maxv lp = buf; 91 1.11 maxv putchar('\n'); 92 1.11 maxv break; 93 1.11 maxv default: 94 1.11 maxv *lp++ = c; 95 1.11 maxv putchar(c); 96 1.11 maxv break; 97 1.11 maxv } 98 1.11 maxv } 99 1.11 maxv /*NOTREACHED*/ 100 1.11 maxv } 101