blob: 87d04a1c4cc06763bbc328932966009f201013f4 (
plain)
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/* Call stacks at program points.
Copyright (C) 2019-2022 Free Software Foundation, Inc.
Contributed by David Malcolm <dmalcolm@redhat.com>.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#ifndef GCC_ANALYZER_CALL_STRING_H
#define GCC_ANALYZER_CALL_STRING_H
namespace ana {
class supergraph;
class supernode;
class call_superedge;
class return_superedge;
/* A string of return_superedge pointers, representing a call stack
at a program point.
This is used to ensure that we generate interprocedurally valid paths
i.e. that we return to the same callsite that called us.
The class stores returning calls ( which may be represented by a
returning superedge ). We do so because this is what we need to compare
against. */
class call_string
{
public:
/* A struct representing an element in the call_string.
Each element represents a path from m_callee to m_caller which represents
returning from function. */
struct element_t
{
element_t (const supernode *caller, const supernode *callee)
: m_caller (caller), m_callee (callee)
{
}
bool operator== (const element_t &other) const;
bool operator!= (const element_t &other) const;
/* Accessors */
function *get_caller_function () const;
function *get_callee_function () const;
const supernode *m_caller;
const supernode *m_callee;
};
call_string () : m_elements () {}
call_string (const call_string &other);
call_string& operator= (const call_string &other);
bool operator== (const call_string &other) const;
void print (pretty_printer *pp) const;
json::value *to_json () const;
hashval_t hash () const;
bool empty_p () const { return m_elements.is_empty (); }
void push_call (const supergraph &sg,
const call_superedge *sedge);
void push_call (const supernode *src,
const supernode *dest);
element_t pop ();
int calc_recursion_depth () const;
static int cmp (const call_string &a,
const call_string &b);
/* Accessors */
const supernode *get_callee_node () const;
const supernode *get_caller_node () const;
unsigned length () const { return m_elements.length (); }
element_t operator[] (unsigned idx) const
{
return m_elements[idx];
}
void validate () const;
private:
auto_vec<element_t> m_elements;
};
} // namespace ana
#endif /* GCC_ANALYZER_CALL_STRING_H */
|
