2N/A/*
2N/A * CDDL HEADER START
2N/A *
2N/A * The contents of this file are subject to the terms of the
2N/A * Common Development and Distribution License, Version 1.0 only
2N/A * (the "License"). You may not use this file except in compliance
2N/A * with the License.
2N/A *
2N/A * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
2N/A * or http://www.opensolaris.org/os/licensing.
2N/A * See the License for the specific language governing permissions
2N/A * and limitations under the License.
2N/A *
2N/A * When distributing Covered Code, include this CDDL HEADER in each
2N/A * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
2N/A * If applicable, add the following below this CDDL HEADER, with the
2N/A * fields enclosed by brackets "[]" replaced with your own identifying
2N/A * information: Portions Copyright [yyyy] [name of copyright owner]
2N/A *
2N/A * CDDL HEADER END
2N/A */
2N/A/*
2N/A * Copyright 1997 Sun Microsystems, Inc. All rights reserved.
2N/A * Use is subject to license terms.
2N/A */
2N/A
2N/A/* Copyright (c) 1988 AT&T */
2N/A/* All Rights Reserved */
2N/A
2N/A/*
2N/A * University Copyright- Copyright (c) 1982, 1986, 1988
2N/A * The Regents of the University of California
2N/A * All Rights Reserved
2N/A *
2N/A * University Acknowledgment- Portions of this document are derived from
2N/A * software developed by the University of California, Berkeley, and its
2N/A * contributors.
2N/A */
2N/A
2N/A#pragma ident "%Z%%M% %I% %E% SMI"
2N/A
2N/A/*LINTLIBRARY*/
2N/A
2N/A#include <sys/types.h>
2N/A#include "curses_inc.h"
2N/A
2N/A/* Place a char onto the beginning of the input queue. */
2N/A
2N/Aint
2N/Aungetch(int ch)
2N/A{
2N/A int i = cur_term->_chars_on_queue, j = i - 1;
2N/A chtype *inputQ = cur_term->_input_queue;
2N/A
2N/A /* Place the character at the beg of the Q */
2N/A /*
2N/A * Here is commented out because 'ch' should deal with a single byte
2N/A * character only. So ISCBIT(ch) is 0 every time.
2N/A *
2N/A * register chtype r;
2N/A *
2N/A * if (ISCBIT(ch)) {
2N/A * r = RBYTE(ch);
2N/A * ch = LBYTE(ch);
2N/A * -* do the right half first to maintain the byte order *-
2N/A * if (r != MBIT && ungetch(r) == ERR)
2N/A * return (ERR);
2N/A * }
2N/A */
2N/A
2N/A while (i > 0)
2N/A inputQ[i--] = inputQ[j--];
2N/A cur_term->_ungotten++;
2N/A inputQ[0] = -ch;
2N/A cur_term->_chars_on_queue++;
2N/A return (0);
2N/A}