summaryrefslogtreecommitdiff
path: root/usr/src/lib/libeti/menu/common/topitem.c
blob: fc2ff74e941a4c550b7fc725a0d1878a9b737ca7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
 * CDDL HEADER START
 *
 * The contents of this file are subject to the terms of the
 * Common Development and Distribution License, Version 1.0 only
 * (the "License").  You may not use this file except in compliance
 * with the License.
 *
 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
 * or http://www.opensolaris.org/os/licensing.
 * See the License for the specific language governing permissions
 * and limitations under the License.
 *
 * When distributing Covered Code, include this CDDL HEADER in each
 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
 * If applicable, add the following below this CDDL HEADER, with the
 * fields enclosed by brackets "[]" replaced with your own identifying
 * information: Portions Copyright [yyyy] [name of copyright owner]
 *
 * CDDL HEADER END
 */
/*	Copyright (c) 1988 AT&T	*/
/*	  All Rights Reserved  	*/


/*
 * Copyright (c) 1997, by Sun Mircrosystems, Inc.
 * All rights reserved.
 */

#pragma	ident	"%Z%%M%	%I%	%E% SMI"	/* SVr4.0 1.9	*/

/*LINTLIBRARY*/

#include <sys/types.h>
#include "private.h"

int
set_top_row(MENU *m, int top)
{
	ITEM *current;

	if (m) {
		if (Indriver(m)) {
			return (E_BAD_STATE);
		}
		if (!Items(m)) {
			return (E_NOT_CONNECTED);
		}
		if (top < 0 || top > Rows(m) - Height(m)) {
			return (E_BAD_ARGUMENT);
		}
		if (top != Top(m)) {
			/* Get linking information if not already there */
			if (LinkNeeded(m)) {
				_link_items(m);
			}
			/* Set current to toprow */
			current = IthItem(m, RowMajor(m) ? top * Cols(m) : top);
			Pindex(m) = 0;		/* Clear the pattern buffer */
			IthPattern(m, Pindex(m)) = '\0';
			_affect_change(m, top, current);
		}
	} else {
		return (E_BAD_ARGUMENT);
	}
	return (E_OK);
}

int
top_row(MENU *m)
{
	if (m && Items(m) && IthItem(m, 0)) {
		return (Top(m));
	} else {
		return (-1);
	}
}