1 /*
2  * Copyright (C) 2017 The Android Open Source Project
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  *  * Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  *  * Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in
12  *    the documentation and/or other materials provided with the
13  *    distribution.
14  *
15  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
18  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
19  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
20  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
21  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
22  * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
23  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
24  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
25  * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26  * SUCH DAMAGE.
27  */
28 
29 #include <search.h>
30 
31 #include "header_checks.h"
32 
search_h()33 static void search_h() {
34   TYPE(ENTRY);
35   TYPE(struct entry);
36   STRUCT_MEMBER(ENTRY, char*, key);
37   STRUCT_MEMBER(ENTRY, void*, data);
38 
39   ACTION a;
40   a = FIND;
41   a = ENTER;
42 
43   VISIT v;
44   v = preorder;
45   v = postorder;
46   v = endorder;
47   v = leaf;
48 
49   TYPE(size_t);
50 
51   FUNCTION(hcreate, int (*f)(size_t));
52   FUNCTION(hdestroy, void (*f)(void));
53   FUNCTION(hsearch, ENTRY* (*f)(ENTRY, ACTION));
54   FUNCTION(insque, void (*f)(void*, void*));
55   FUNCTION(lfind, void* (*f)(const void*, const void*, size_t*, size_t,
56                              int (*)(const void*, const void*)));
57   FUNCTION(lsearch, void* (*f)(const void*, void*, size_t*, size_t,
58                                int (*)(const void*, const void*)));
59   FUNCTION(remque, void (*f)(void*));
60   FUNCTION(tdelete, void* (*f)(const void*, void**, int (*)(const void*, const void*)));
61   FUNCTION(tfind, void* (*f)(const void*, void* const*, int (*)(const void*, const void*)));
62   FUNCTION(tsearch, void* (*f)(const void*, void**, int (*)(const void*, const void*)));
63   FUNCTION(twalk, void (*f)(const void*, void (*)(const void*, VISIT, int)));
64 }
65