]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/analyzer/function-set.cc
analyzer: add function-set.cc/h
[thirdparty/gcc.git] / gcc / analyzer / function-set.cc
CommitLineData
a6b5f19c
DM
1/* Sets of function names.
2 Copyright (C) 2019-2020 Free Software Foundation, Inc.
3 Contributed by David Malcolm <dmalcolm@redhat.com>.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it
8under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 3, or (at your option)
10any later version.
11
12GCC is distributed in the hope that it will be useful, but
13WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15General Public License for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING3. If not see
19<http://www.gnu.org/licenses/>. */
20
21#include "config.h"
22#include "system.h"
23#include "coretypes.h"
24#include "tree.h"
25#include "selftest.h"
26#include "analyzer/function-set.h"
27
28#if ENABLE_ANALYZER
29
30/* Return true if NAME is within this set. */
31
32bool
33function_set::contains_name_p (const char *name) const
34{
35 /* Binary search. */
36 int min = 0;
37 int max = m_count - 1;
38 while (true)
39 {
40 if (min > max)
41 return false;
42 int midpoint = (min + max) / 2;
43 gcc_assert ((size_t)midpoint < m_count);
44 int cmp = strcmp (name, m_names[midpoint]);
45 if (cmp == 0)
46 return true;
47 else if (cmp < 0)
48 max = midpoint - 1;
49 else
50 min = midpoint + 1;
51 }
52}
53
54/* Return true if FNDECL is within this set. */
55
56bool
57function_set::contains_decl_p (tree fndecl) const
58{
59 gcc_assert (fndecl && DECL_P (fndecl));
60 return contains_name_p (IDENTIFIER_POINTER (DECL_NAME (fndecl)));
61}
62
63/* Assert that the list of names is in sorted order. */
64
65void
66function_set::assert_sorted () const
67{
68#if CHECKING_P
69 for (size_t idx = 1; idx < m_count; idx++)
70 gcc_assert (strcmp (m_names[idx - 1], m_names[idx]) < 0);
71#endif /* #if CHECKING_P */
72}
73
74/* Assert that contains_p is true for all members of the set. */
75
76void
77function_set::assert_sane () const
78{
79#if CHECKING_P
80 for (size_t i = 0; i < m_count; i++)
81 gcc_assert (contains_name_p (m_names[i]));
82#endif /* #if CHECKING_P */
83}
84
85#if CHECKING_P
86
87namespace selftest {
88
89/* Verify that an empty function_set works as expected. */
90
91static void
92test_empty ()
93{
94 function_set fs (NULL, 0);
95 fs.assert_sorted ();
96 fs.assert_sane ();
97 ASSERT_FALSE (fs.contains_name_p (""));
98 ASSERT_FALSE (fs.contains_name_p ("haystack"));
99}
100
101/* Verify that a function_set with an odd number of elements works as
102 expected. */
103
104static void
105test_odd ()
106{
107 static const char * const names[3] = {"alpha", "beta", "gamma"};
108 function_set fs (names, 3);
109 fs.assert_sorted ();
110 fs.assert_sane ();
111 ASSERT_FALSE (fs.contains_name_p (""));
112 ASSERT_FALSE (fs.contains_name_p ("haystack"));
113}
114
115/* Verify that a function_set with an even number of elements works as
116 expected. */
117
118static void
119test_even ()
120{
121 static const char * const names[3] = {"alpha", "beta"};
122 function_set fs (names, 2);
123 fs.assert_sorted ();
124 fs.assert_sane ();
125 ASSERT_FALSE (fs.contains_name_p (""));
126 ASSERT_FALSE (fs.contains_name_p ("haystack"));
127}
128
129/* Verify that a function_set with some nontrivial stdio.h data works as
130 expected. */
131
132static void
133test_stdio_example ()
134{
135 static const char * const example[] = {
136 "__fbufsize",
137 "__flbf",
138 "__fpending",
139 "__fpurge",
140 "__freadable",
141 "__freading",
142 "__fsetlocking",
143 "__fwritable",
144 "__fwriting",
145 "clearerr_unlocked",
146 "feof_unlocked",
147 "ferror_unlocked",
148 "fflush_unlocked",
149 "fgetc_unlocked",
150 "fgets",
151 "fgets_unlocked",
152 "fgetwc_unlocked",
153 "fgetws_unlocked",
154 "fileno_unlocked",
155 "fputc_unlocked",
156 "fputs_unlocked",
157 "fputwc_unlocked",
158 "fputws_unlocked",
159 "fread_unlocked",
160 "fwrite_unlocked",
161 "getc_unlocked",
162 "getwc_unlocked",
163 "putc_unlocked"
164 };
165 const size_t count = sizeof(example) / sizeof (example[0]);
166 function_set fs (example, count);
167 fs.assert_sorted ();
168 fs.assert_sane ();
169 /* Examples of strings not present: before, after and alongside the
170 sorted list. */
171 ASSERT_FALSE (fs.contains_name_p ("___"));
172 ASSERT_FALSE (fs.contains_name_p ("Z"));
173 ASSERT_FALSE (fs.contains_name_p ("fgets_WITH_A_PREFIX"));
174}
175
176/* Run all of the selftests within this file. */
177
178void
179analyzer_function_set_cc_tests ()
180{
181 test_empty ();
182 test_odd ();
183 test_even ();
184 test_stdio_example ();
185}
186
187} // namespace selftest
188
189#endif /* CHECKING_P */
190
191#endif /* #if ENABLE_ANALYZER */