xref: /netbsd-src/external/gpl3/gcc.old/dist/gcc/hash-map-tests.c (revision 82d56013d7b633d116a93943de88e08335357a7c)
1 /* Unit tests for hash-map.h.
2    Copyright (C) 2015-2019 Free Software Foundation, Inc.
3 
4 This file is part of GCC.
5 
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
10 
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14 for more details.
15 
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3.  If not see
18 <http://www.gnu.org/licenses/>.  */
19 
20 #include "config.h"
21 #include "system.h"
22 #include "coretypes.h"
23 #include "tm.h"
24 #include "opts.h"
25 #include "hash-set.h"
26 #include "fixed-value.h"
27 #include "alias.h"
28 #include "flags.h"
29 #include "symtab.h"
30 #include "tree-core.h"
31 #include "stor-layout.h"
32 #include "tree.h"
33 #include "stringpool.h"
34 #include "selftest.h"
35 
36 #if CHECKING_P
37 
38 namespace selftest {
39 
40 /* Construct a hash_map <const char *, int> and verify that
41    various operations work correctly.  */
42 
43 static void
44 test_map_of_strings_to_int ()
45 {
46   hash_map <const char *, int> m;
47 
48   const char *ostrich = "ostrich";
49   const char *elephant = "elephant";
50   const char *ant = "ant";
51   const char *spider = "spider";
52   const char *millipede = "Illacme plenipes";
53   const char *eric = "half a bee";
54 
55   /* A fresh hash_map should be empty.  */
56   ASSERT_EQ (0, m.elements ());
57   ASSERT_EQ (NULL, m.get (ostrich));
58 
59   /* Populate the hash_map.  */
60   ASSERT_EQ (false, m.put (ostrich, 2));
61   ASSERT_EQ (false, m.put (elephant, 4));
62   ASSERT_EQ (false, m.put (ant, 6));
63   ASSERT_EQ (false, m.put (spider, 8));
64   ASSERT_EQ (false, m.put (millipede, 750));
65   ASSERT_EQ (false, m.put (eric, 3));
66 
67   /* Verify that we can recover the stored values.  */
68   ASSERT_EQ (6, m.elements ());
69   ASSERT_EQ (2, *m.get (ostrich));
70   ASSERT_EQ (4, *m.get (elephant));
71   ASSERT_EQ (6, *m.get (ant));
72   ASSERT_EQ (8, *m.get (spider));
73   ASSERT_EQ (750, *m.get (millipede));
74   ASSERT_EQ (3, *m.get (eric));
75 
76   /* Verify removing an item.  */
77   m.remove (eric);
78   ASSERT_EQ (5, m.elements ());
79   ASSERT_EQ (NULL, m.get (eric));
80 
81   m.remove (eric);
82   ASSERT_EQ (5, m.elements ());
83   ASSERT_EQ (NULL, m.get (eric));
84 
85   /* A plain char * key is hashed based on its value (address), rather
86      than the string it points to.  */
87   char *another_ant = static_cast <char *> (xcalloc (4, 1));
88   another_ant[0] = 'a';
89   another_ant[1] = 'n';
90   another_ant[2] = 't';
91   another_ant[3] = 0;
92   ASSERT_NE (ant, another_ant);
93   unsigned prev_size = m.elements ();
94   ASSERT_EQ (false, m.put (another_ant, 7));
95   ASSERT_EQ (prev_size + 1, m.elements ());
96 
97   /* Need to use string_hash or nofree_string_hash key types to hash
98      based on the string contents.  */
99   hash_map <nofree_string_hash, int> string_map;
100   ASSERT_EQ (false, string_map.put (ant, 1));
101   ASSERT_EQ (1, string_map.elements ());
102   ASSERT_EQ (true, string_map.put (another_ant, 5));
103   ASSERT_EQ (1, string_map.elements ());
104 }
105 
106 /* Run all of the selftests within this file.  */
107 
108 void
109 hash_map_tests_c_tests ()
110 {
111   test_map_of_strings_to_int ();
112 }
113 
114 } // namespace selftest
115 
116 #endif /* CHECKING_P */
117