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
79
80
81
82
83
84
85
|
/*
Copyright 2015-2016 David Anderson. All rights reserved.
This program is free software; you can redistribute it and/or
modify it under the terms of version 2 of the GNU General
Public License as published by the Free Software Foundation.
This program is distributed in the hope that it would be
useful, but WITHOUT ANY WARRANTY; without even the implied
warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE.
Further, this software is distributed without any warranty
that it is free of the rightful claim of any third person
regarding infringement or the like. Any license provided
herein, whether implied or otherwise, applies only to this
software file. Patent licenses, if any, provided herein
do not apply to combinations of this program with other
software, or any other product whatsoever.
You should have received a copy of the GNU General Public
License along with this program; if not, write the Free
Software Foundation, Inc., 51 Franklin Street - Fifth Floor,
Boston MA 02110-1301, USA.
*/
#include "globals.h"
#ifdef HAVE_STDINT_H
#include <stdint.h>
#endif /* HAVE_STDINT_H */
#include "dwarf_tsearch.h"
#include "helpertree.h"
#define TRUE 1
#define FALSE 0
/* WARNING: the tree walk functions will, if presented **tree
when *tree is wanted, simply find nothing. No error,
just bad results. So when a walk produces nothing
suspect a code mistake here.
The basic problem is void* is a terrible way to
pass in a pointer. But it's how tsearch was defined
long ago.
*/
struct Helpertree_Base_s testbase;
int main()
{
struct Helpertree_Map_Entry_s *re = 0;
int failcount = 0;
/* Test 1 */
re = helpertree_add_entry(0x1000,0,&testbase);
if (!re) {
printf("FAIL test1\n");
failcount++;
}
re = helpertree_add_entry(0x2000,0,&testbase);
if (!re) {
printf("FAIL test2\n");
failcount++;
}
re = helpertree_find(0x1000,&testbase);
if (!re) {
printf("FAIL test3\n");
failcount++;
}
re = helpertree_find(0x2000,&testbase);
if (!re) {
printf("FAIL test4\n");
failcount++;
}
re = helpertree_find(0x2004,&testbase);
if (re) {
printf("FAIL test5\n");
failcount++;
}
helpertree_clear_statistics(&testbase);
if (failcount) {
return 1;
}
printf("PASS helpertree\n");
return 0;
}
|
