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
|
/*
* Copyright (C) 2015 Andrei Karas
*
* This file is part of AstDumper.
*
* This program 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 of the License, or
* any later version.
*
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef ANALYSIS_ANALYSIS_H
#define ANALYSIS_ANALYSIS_H
#include "includes.h"
#include <set>
#include <string>
struct Node;
struct WalkItem;
namespace Analysis
{
void startWalkTree(Node *node);
void walkTree(Node *node, const WalkItem &wi, WalkItem &wo);
void analyseNode(Node *node, const WalkItem &wi, WalkItem &wo);
int findBackLocation(Node *node);
void reportParmDeclNullPointer(Node *mainNode,
Node *node,
const WalkItem &wi);
bool checkForReport(Node *node,
const WalkItem &wi);
void addLinkedVar(WalkItem &wi,
const std::string &parent,
const std::string &var);
void removeCheckNullVars(WalkItem &wi);
void removeCheckNullVarsSet(WalkItem &wi,
std::set<std::string> &vars);
Node *skipNop(Node *node);
void mergeNullChecked(WalkItem &wi1, WalkItem &wi2);
void mergeNonNullChecked(WalkItem &wi1, WalkItem &wi2);
void intersectNullChecked(WalkItem &wi, WalkItem &wi1, WalkItem &wi2);
void intersectNonNullChecked(WalkItem &wi, WalkItem &wi1, WalkItem &wi2);
}
#endif // ANALYSIS_ANALYSIS_H
|
