xref: /illumos-gate/usr/src/head/search.h (revision 581cede61ac9c14d8d4ea452562a567189eead78)
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 2003 Sun Microsystems, Inc.  All rights reserved.
28  * Use is subject to license terms.
29  */
30 
31 #ifndef _SEARCH_H
32 #define	_SEARCH_H
33 
34 #pragma ident	"%Z%%M%	%I%	%E% SMI"	/* SVr4.0 1.3.1.11 */
35 
36 #include <sys/feature_tests.h>
37 #include <sys/types.h>
38 
39 #ifdef	__cplusplus
40 extern "C" {
41 #endif
42 
43 /* HSEARCH(3C) */
44 typedef enum { FIND, ENTER } ACTION;
45 
46 #if defined(__EXTENSIONS__) || !defined(_XOPEN_SOURCE)
47 struct qelem {
48 	struct qelem	*q_forw;
49 	struct qelem	*q_back;
50 };
51 #endif /* defined(__EXTENSIONS__) || !defined(_XOPEN_SOURCE) */
52 
53 typedef struct entry { char *key, *data; } ENTRY;
54 
55 #if defined(__STDC__)
56 
57 int hcreate(size_t);
58 void hdestroy(void);
59 ENTRY *hsearch(ENTRY, ACTION);
60 #if defined(__EXTENSIONS__) || !defined(_XOPEN_SOURCE) || defined(_XPG4_2)
61 void insque(void *, void *);
62 void remque(void *);
63 #endif
64 
65 #else /* defined(__STDC__) */
66 
67 int hcreate();
68 void hdestroy();
69 ENTRY *hsearch();
70 #if defined(__EXTENSIONS__) || !defined(_XOPEN_SOURCE) || defined(_XPG4_2)
71 void insque();
72 void remque();
73 #endif
74 
75 #endif /* defined(__STDC__) */
76 
77 /* TSEARCH(3C) */
78 typedef enum { preorder, postorder, endorder, leaf } VISIT;
79 
80 #if defined(__STDC__)
81 void *tdelete(const void *_RESTRICT_KYWD, void **_RESTRICT_KYWD,
82 	int (*)(const void *, const void *));
83 void *tfind(const void *, void *const *, int (*)(const void *, const void *));
84 void *tsearch(const void *, void **, int (*)(const void *, const void *));
85 void twalk(const void *, void (*)(const void *, VISIT, int));
86 #else
87 void *tdelete();
88 void *tfind();
89 void *tsearch();
90 void twalk();
91 #endif
92 
93 #if defined(__STDC__)
94 
95 #if defined(__EXTENSIONS__) || !defined(_XOPEN_SOURCE)
96 /* BSEARCH(3C) */
97 void *bsearch(const void *, const void *, size_t, size_t,
98 	    int (*)(const void *, const void *));
99 #endif /* defined(__EXTENSIONS__) || !defined(_XOPEN_SOURCE) */
100 
101 /* LSEARCH(3C) */
102 void *lfind(const void *, const void *, size_t *, size_t,
103 	    int (*)(const void *, const void *));
104 void *lsearch(const void *, void *, size_t *, size_t,
105 	    int (*)(const void *, const void *));
106 #else
107 void *bsearch();
108 void *lfind();
109 void *lsearch();
110 #endif
111 
112 #ifdef	__cplusplus
113 }
114 #endif
115 
116 #endif	/* _SEARCH_H */
117