blob: 1e988e4e1d87ff7fa63e15f1d848993efcc4dfa7 (
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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0+ OR GPL-3.0 WITH Qt-GPL-exception-1.0
#pragma once
#include <QHash>
#include <QStack>
namespace Valgrind::Callgrind {
class Function;
class ParseData;
namespace Internal {
/**
* Implementation of Tarjan's strongly connected components algorithm, to find function cycles,
* as suggested by the GProf paper:
*
* ``gprof: A Call Graph Execution Profiler'', by S. Graham, P. Kessler,
* M. McKusick; Proceedings of the SIGPLAN '82 Symposium on Compiler Construction,
* SIGPLAN Notices, Vol. 17, No 6, pp. 120-126, June 1982.
*/
class CycleDetection
{
public:
explicit CycleDetection(ParseData *data);
QVector<const Function *> run(const QVector<const Function *> &input);
private:
ParseData *m_data;
struct Node {
int dfs;
int lowlink;
const Function *function;
};
void tarjan(Node *node);
void tarjanForChildNode(Node *node, Node *childNode);
QHash<const Function *, Node *> m_nodes;
QStack<Node *> m_stack;
QVector<const Function *> m_ret;
int m_depth = 0;
int m_cycle = 0;
};
} // namespace Internal
} // namespace Valgrind::Callgrind
|
