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) 1984, 1986, 1987, 1988, 1989 AT&T */ 23 /* All Rights Reserved */ 24 25 26 #ident "%Z%%M% %I% %E% SMI" /* SVr4.0 1.5 */ 27 /* EMACS_MODES: !fill, lnumb, !overwrite, !nodelete, !picture */ 28 29 #include "string.h" 30 31 #include "lp.h" 32 33 /** 34 ** searchlist() - SEARCH (char **) LIST FOR ITEM 35 **/ 36 37 int 38 #if defined(__STDC__) 39 searchlist ( 40 char * item, 41 char ** list 42 ) 43 #else 44 searchlist (item, list) 45 register char *item; 46 register char **list; 47 #endif 48 { 49 if (!list || !*list) 50 return (0); 51 52 else if (STREQU(item, NAME_ANY) || STREQU(item, NAME_ALL)) 53 return (1); 54 55 /* 56 * This is a linear search--we believe that the lists 57 * will be short. 58 */ 59 while (*list) { 60 if ( 61 STREQU(*list, item) 62 || STREQU(*list, NAME_ANY) 63 || STREQU(*list, NAME_ALL) 64 ) 65 return (1); 66 list++; 67 } 68 return (0); 69 } 70 71 /** 72 ** searchlist_with_terminfo() - SEARCH (char **) LIST FOR ITEM 73 **/ 74 75 int 76 #if defined(__STDC__) 77 searchlist_with_terminfo ( 78 char * item, 79 char ** list 80 ) 81 #else 82 searchlist_with_terminfo (item, list) 83 register char *item; 84 register char **list; 85 #endif 86 { 87 if (!list || !*list) 88 return (0); 89 90 else if (STREQU(item, NAME_ANY) || STREQU(item, NAME_ALL)) 91 return (1); 92 93 /* 94 * This is a linear search--we believe that the lists 95 * will be short. 96 */ 97 while (*list) { 98 if ( 99 STREQU(*list, item) 100 || STREQU(*list, NAME_ANY) 101 || STREQU(*list, NAME_ALL) 102 || ( 103 STREQU(*list, NAME_TERMINFO) 104 && isterminfo(item) 105 ) 106 ) 107 return (1); 108 list++; 109 } 110 return (0); 111 } 112