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/* Copyright (c) 1988 AT&T */
2N/A/* All Rights Reserved */
2N/A
2N/A
2N/A/*
2N/A * Copyright (c) 1997, by Sun Mircrosystems, Inc.
2N/A * All rights reserved.
2N/A */
2N/A
2N/A#pragma ident "%Z%%M% %I% %E% SMI" /* SVr4.0 1.10 */
2N/A
2N/A/*LINTLIBRARY*/
2N/A
2N/A#include <sys/types.h>
2N/A#include "private.h"
2N/A
2N/Aint
2N/Amenu_driver(MENU *m, int c)
2N/A{
2N/A int i, n;
2N/A int top;
2N/A ITEM *current;
2N/A int ret;
2N/A
2N/A if (!m) {
2N/A return (E_BAD_ARGUMENT);
2N/A }
2N/A ret = E_OK;
2N/A if (Indriver(m)) {
2N/A return (E_BAD_STATE);
2N/A }
2N/A if (!Posted(m)) {
2N/A return (E_NOT_POSTED);
2N/A }
2N/A top = Top(m);
2N/A current = Current(m);
2N/A
2N/A if (c > KEY_MAX && c < MAX_COMMAND) {
2N/A
2N/A /* Clear the pattern buffer if not one of these requests */
2N/A if (c != REQ_BACK_PATTERN &&
2N/A c != REQ_NEXT_MATCH &&
2N/A c != REQ_PREV_MATCH) {
2N/A Pindex(m) = 0;
2N/A IthPattern(m, 0) = '\0';
2N/A }
2N/A
2N/A switch (c) {
2N/A
2N/A case REQ_RIGHT_ITEM: {
2N/A if (Right(current) == (ITEM *)0) {
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A current = Right(current);
2N/A break;
2N/A }
2N/A case REQ_LEFT_ITEM: {
2N/A if (Left(current) == (ITEM *)0) {
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A current = Left(current);
2N/A break;
2N/A }
2N/A case REQ_UP_ITEM: {
2N/A if (Up(current) == (ITEM *)0) {
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A current = Up(current);
2N/A break;
2N/A }
2N/A case REQ_DOWN_ITEM: {
2N/A if (Down(current) == (ITEM *)0) {
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A current = Down(current);
2N/A break;
2N/A }
2N/A case REQ_SCR_ULINE: {
2N/A if (--top < 0) {
2N/A ++top;
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A current = Up(current);
2N/A break;
2N/A }
2N/A case REQ_SCR_DLINE: {
2N/A if (++top > Rows(m) - Height(m)) {
2N/A --top;
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A current = Down(current);
2N/A break;
2N/A }
2N/A case REQ_SCR_UPAGE: {
2N/A n = min(Height(m), top);
2N/A if (n) {
2N/A top -= n;
2N/A for (i = n; i--; ) {
2N/A current = Up(current);
2N/A }
2N/A } else {
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A break;
2N/A }
2N/A case REQ_SCR_DPAGE: {
2N/A n = min(Height(m), Rows(m) - Height(m) - top);
2N/A if (n) {
2N/A top += n;
2N/A for (i = n; i--; ) {
2N/A current = Down(current);
2N/A }
2N/A } else {
2N/A ret = E_REQUEST_DENIED;
2N/A break;
2N/A }
2N/A break;
2N/A }
2N/A case REQ_FIRST_ITEM: {
2N/A current = IthItem(m, 0);
2N/A break;
2N/A }
2N/A case REQ_LAST_ITEM: {
2N/A current = IthItem(m, Nitems(m)-1);
2N/A break;
2N/A }
2N/A case REQ_NEXT_MATCH: {
2N/A if (IthPattern(m, 0) != NULL) {
2N/A ret = _match(m, NULL, &current);
2N/A } else {
2N/A if (Index(current)+1 >= Nitems(m)) {
2N/A current = IthItem(m, 0);
2N/A } else {
2N/A current = IthItem(m, Index(current)+1);
2N/A }
2N/A }
2N/A break;
2N/A }
2N/A case REQ_NEXT_ITEM: {
2N/A if (Index(current)+1 >= Nitems(m)) {
2N/A if (Cyclic(m)) {
2N/A current = IthItem(m, 0);
2N/A } else {
2N/A ret = E_REQUEST_DENIED;
2N/A }
2N/A } else {
2N/A current = IthItem(m, Index(current)+1);
2N/A }
2N/A break;
2N/A }
2N/A case REQ_PREV_MATCH: {
2N/A if (IthPattern(m, 0) != NULL) {
2N/A ret = _match(m, '\b', &current);
2N/A } else {
2N/A /* This differs from PREV_ITEM in that */
2N/A /* it is cyclic */
2N/A if (Index(current)-1 < 0) {
2N/A current = IthItem(m, Nitems(m)-1);
2N/A } else {
2N/A current = IthItem(m, Index(current)-1);
2N/A }
2N/A }
2N/A break;
2N/A }
2N/A case REQ_PREV_ITEM: {
2N/A if (Index(current)-1 < 0) {
2N/A if (Cyclic(m)) {
2N/A current = IthItem(m, Nitems(m)-1);
2N/A } else {
2N/A ret = E_REQUEST_DENIED;
2N/A }
2N/A } else {
2N/A current = IthItem(m, Index(current)-1);
2N/A }
2N/A break;
2N/A }
2N/A case REQ_TOGGLE_ITEM: {
2N/A if (!OneValue(m)) {
2N/A if (Selectable(Current(m))) {
2N/A Value(Current(m)) ^= TRUE;
2N/A _move_post_item(m, Current(m));
2N/A _show(m);
2N/A } else {
2N/A ret = E_NOT_SELECTABLE;
2N/A }
2N/A } else {
2N/A ret = E_REQUEST_DENIED;
2N/A }
2N/A break;
2N/A }
2N/A case REQ_BACK_PATTERN: {
2N/A if (Pindex(m) > 0) {
2N/A Pindex(m) -= 1;
2N/A IthPattern(m, Pindex(m)) = '\0';
2N/A _position_cursor(m);
2N/A } else {
2N/A ret = E_REQUEST_DENIED;
2N/A }
2N/A break;
2N/A }
2N/A case REQ_CLEAR_PATTERN: {
2N/A /* This was already done at the top */
2N/A break;
2N/A }
2N/A default: {
2N/A ret = E_UNKNOWN_COMMAND;
2N/A }
2N/A }
2N/A } else {
2N/A if (c > 037 && c < 0177) {
2N/A /*LINTED [E_PASS_INT_TO_SMALL_INT]*/
2N/A ret = _match(m, c, &current);
2N/A } else {
2N/A ret = E_UNKNOWN_COMMAND;
2N/A }
2N/A }
2N/A
2N/A /* Verify the location of the top row */
2N/A
2N/A _chk_top(m, &top, current);
2N/A
2N/A /* Go change the actual values of Top and Current and do init/term */
2N/A
2N/A _affect_change(m, top, current);
2N/A
2N/A return (ret);
2N/A}