xref: /titanic_51/usr/src/lib/libeti/menu/common/connect.c (revision bdfc6d18da790deeec2e0eb09c625902defe2498)
1 /*
2  * CDDL HEADER START
3  *
4  * The contents of this file are subject to the terms of the
5  * Common Development and Distribution License, Version 1.0 only
6  * (the "License").  You may not use this file except in compliance
7  * with the License.
8  *
9  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10  * or http://www.opensolaris.org/os/licensing.
11  * See the License for the specific language governing permissions
12  * and limitations under the License.
13  *
14  * When distributing Covered Code, include this CDDL HEADER in each
15  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16  * If applicable, add the following below this CDDL HEADER, with the
17  * fields enclosed by brackets "[]" replaced with your own identifying
18  * information: Portions Copyright [yyyy] [name of copyright owner]
19  *
20  * CDDL HEADER END
21  */
22 /*	Copyright (c) 1988 AT&T	*/
23 /*	  All Rights Reserved  	*/
24 
25 
26 /*
27  * Copyright (c) 1997, by Sun Mircrosystems, Inc.
28  * All rights reserved.
29  */
30 
31 #pragma	ident	"%Z%%M%	%I%	%E% SMI"	/* SVr4.0 1.8	*/
32 
33 /*LINTLIBRARY*/
34 
35 #include <sys/types.h>
36 #include <stdlib.h>
37 #include "private.h"
38 
39 /* Connect and disconnect an item list from a menu */
40 
41 
42 /* Find the maximum length name and description */
43 
44 static void
45 maxlengths(MENU *m)
46 {
47 	int maxn, maxd;
48 	ITEM **ip;
49 
50 	maxn = maxd = 0;
51 	for (ip = Items(m); *ip; ip++) {
52 		if (NameLen(*ip) > maxn) {
53 			maxn = NameLen(*ip);
54 		}
55 		if (DescriptionLen(*ip) > maxd) {
56 			maxd = DescriptionLen(*ip);
57 		}
58 	}
59 	MaxName(m) = maxn;
60 	MaxDesc(m) = maxd;
61 }
62 
63 int
64 _connect(MENU *m, ITEM **items)
65 {
66 	ITEM **ip;
67 	int i;
68 
69 	/* Is the list of items connected to any other menu? */
70 	for (ip = items; *ip; ip++) {
71 		/* Return Null if item points to a menu */
72 		if (Imenu(*ip)) {
73 			return (FALSE);
74 		}
75 	}
76 
77 	for (i = 0, ip = items; *ip; ip++) {
78 		/* Return FALSE if this item is a prevoious item */
79 		if (Imenu(*ip)) {
80 			for (ip = items; *ip; ip++) {
81 				/* Reset index and menu pointers */
82 				Index(*ip) = 0;
83 				Imenu(*ip) = (MENU *) NULL;
84 			}
85 			return (FALSE);
86 		}
87 		if (OneValue(m)) {
88 			/* Set all values to FALSE if selection not allowed */
89 			Value(*ip) = FALSE;
90 		}
91 		Index(*ip) = i++;
92 		Imenu(*ip) = m;
93 	}
94 
95 	Nitems(m) = i;
96 	Items(m) = items;
97 
98 	/* Go pick up the sizes of names and descriptions */
99 	maxlengths(m);
100 
101 	/* Set up match buffer */
102 	if ((Pattern(m) = (char *)malloc((unsigned)MaxName(m)+1)) ==
103 	    (char *)0) {
104 		return (FALSE);
105 	}
106 
107 	IthPattern(m, 0) = '\0';
108 	Pindex(m) = 0;
109 	(void) set_menu_format(m, FRows(m), FCols(m));
110 	Current(m) = IthItem(m, 0);
111 	Top(m) = 0;
112 	return (TRUE);
113 }
114 
115 void
116 _disconnect(MENU *m)
117 {
118 	ITEM **ip;
119 
120 	for (ip = Items(m); *ip; ip++) {
121 		/* Release items for another menu */
122 		Imenu(*ip) = (MENU *) NULL;
123 	}
124 	free(Pattern(m));
125 	Pattern(m) = NULL;
126 	Items(m) = (ITEM **) NULL;
127 	Nitems(m) = 0;
128 }
129