Static Value-Flow Analysis
Loading...
Searching...
No Matches
NodeIDAllocator.h
Go to the documentation of this file.
1//===- NodeIDAllocator.h -- Allocates node IDs on request ------------------------//
2
3#ifndef NODEIDALLOCATOR_H_
4#define NODEIDALLOCATOR_H_
5
7#include "SVFIR/SVFType.h"
9
10namespace SVF
11{
12
13// Forward declare for the Clusterer.
14class BVDataPTAImpl;
15
21{
22 friend class SVFIRWriter;
23 friend class SVFIRReader;
24
25public:
44
53 static const NodeID nullPointerId;
55
57 static NodeIDAllocator *get(void);
58
60 static void unset(void);
61
64
67
75
78
81
84 {
85 return numObjects;
86 }
87
89 {
90 ++numObjects;
91 ++numNodes;
92 }
93
94private:
96 NodeIDAllocator(void);
97
98private:
112
115
118
119public:
123 {
124 private:
128
131 static const std::string NumObjects;
132 static const std::string RegioningTime;
133 static const std::string DistanceMatrixTime;
134 static const std::string FastClusterTime;
135 static const std::string DendrogramTraversalTime;
136 static const std::string EvalTime;
137 static const std::string TotalTime;
138 static const std::string TheoreticalNumWords;
139 static const std::string OriginalBvNumWords;
140 static const std::string OriginalSbvNumWords;
141 static const std::string NewBvNumWords;
142 static const std::string NewSbvNumWords;
143 static const std::string NumRegions;
144 static const std::string NumGtIntRegions;
145 static const std::string LargestRegion;
146 static const std::string BestCandidate;
147 static const std::string NumNonTrivialRegionObjects;
149
150 public:
157 static std::vector<NodeID> cluster(BVDataPTAImpl *pta, const std::vector<std::pair<NodeID, unsigned>> keys, std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates, std::string evalSubtitle="");
158
159 // Returns a reverse node mapping for mapping generated by cluster().
160 static std::vector<NodeID> getReverseNodeMapping(const std::vector<NodeID> &nodeMapping);
161
163 static void evaluate(const std::vector<NodeID> &nodeMap, const Map<PointsTo, unsigned> pointsToSets, Map<std::string, std::string> &stats, bool accountForOcc);
164
167 static void printStats(std::string title, Map<std::string, std::string> &stats);
168
169 private:
172 static inline size_t condensedIndex(size_t n, size_t i, size_t j);
173
175 static inline unsigned requiredBits(const PointsTo &pts);
176
178 static inline unsigned requiredBits(const size_t n);
179
183 static inline double *getDistanceMatrix(const std::vector<std::pair<const PointsTo *, unsigned>> pointsToSets,
184 const size_t numObjects, const Map<NodeID, unsigned> &nodeMap,
185 double &distanceMatrixTime);
186
190 static inline void traverseDendrogram(std::vector<NodeID> &nodeMap, const int *dendrogram, const size_t numObjects, unsigned &allocCounter, Set<int> &visited, const int index, const std::vector<NodeID> &regionNodeMap);
191
196 static inline std::vector<unsigned> regionObjects(const Map<NodeID, Set<NodeID>> &graph, size_t numObjects, size_t &numLabels);
197
198 // From all the candidates, returns the best mapping for pointsToSets (points-to set -> # occurrences).
199 static inline std::pair<hclust_fast_methods, std::vector<NodeID>> determineBestMapping(
200 const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
201 Map<PointsTo, unsigned> pointsToSets, const std::string &evalSubtitle, double &evalTime);
202
203 };
204};
205
206} // namespace SVF
207
208#endif // ifdef NODEIDALLOCATOR_H_
buffer offset
Definition cJSON.cpp:1113
cJSON * n
Definition cJSON.cpp:2558
int index
Definition cJSON.h:170
static const std::string DistanceMatrixTime
static std::vector< NodeID > cluster(BVDataPTAImpl *pta, const std::vector< std::pair< NodeID, unsigned > > keys, std::vector< std::pair< hclust_fast_methods, std::vector< NodeID > > > &candidates, std::string evalSubtitle="")
static const std::string LargestRegion
static const std::string NumNonTrivialRegionObjects
static const std::string EvalTime
Map< NodePair, std::pair< unsigned, unsigned > > DistOccMap
static std::vector< unsigned > regionObjects(const Map< NodeID, Set< NodeID > > &graph, size_t numObjects, size_t &numLabels)
static const std::string TheoreticalNumWords
static std::pair< hclust_fast_methods, std::vector< NodeID > > determineBestMapping(const std::vector< std::pair< hclust_fast_methods, std::vector< NodeID > > > &candidates, Map< PointsTo, unsigned > pointsToSets, const std::string &evalSubtitle, double &evalTime)
static const std::string BestCandidate
static std::vector< NodeID > getReverseNodeMapping(const std::vector< NodeID > &nodeMapping)
static const std::string OriginalSbvNumWords
static const std::string DendrogramTraversalTime
static const std::string NewSbvNumWords
static double * getDistanceMatrix(const std::vector< std::pair< const PointsTo *, unsigned > > pointsToSets, const size_t numObjects, const Map< NodeID, unsigned > &nodeMap, double &distanceMatrixTime)
static unsigned requiredBits(const PointsTo &pts)
Returns the minimum number of bits required to represent pts in a perfect world.
static void traverseDendrogram(std::vector< NodeID > &nodeMap, const int *dendrogram, const size_t numObjects, unsigned &allocCounter, Set< int > &visited, const int index, const std::vector< NodeID > &regionNodeMap)
static void printStats(std::string title, Map< std::string, std::string > &stats)
static const std::string NumRegions
static size_t condensedIndex(size_t n, size_t i, size_t j)
static void evaluate(const std::vector< NodeID > &nodeMap, const Map< PointsTo, unsigned > pointsToSets, Map< std::string, std::string > &stats, bool accountForOcc)
Fills in *NumWords statistics in stats..
static const std::string RegioningTime
static const std::string NumGtIntRegions
static const std::string FastClusterTime
static const std::string OriginalBvNumWords
static const std::string NewBvNumWords
static const std::string NumObjects
static const std::string TotalTime
NodeID numValues
Number of values allocated, including specials.
static const NodeID nullPointerId
NodeID allocateValueId(void)
Allocate a value ID as determined by the strategy.
static NodeIDAllocator * get(void)
Return (singleton) allocator.
NodeID numSymbols
Number of explicit symbols allocated (e.g., llvm::Values), including specials.
enum Strategy strategy
Strategy to allocate with.
static const NodeID blackHolePointerId
NodeID numType
Total number of svftypes.
static NodeIDAllocator * allocator
Single allocator.
static const NodeID constantObjectId
NodeID allocateTypeId(void)
Allocate an type ID as determined by the strategy.
NodeID allocateObjectId(void)
Allocate an object ID as determined by the strategy.
static const NodeID blackHoleObjectId
Strategy
Allocation strategy to use.
@ SEQ
Allocate objects objects and values sequentially, intermixed.
NodeID numNodes
Total number of objects and values allocated.
NodeID endSymbolAllocation(void)
Notify the allocator that all symbols have had IDs allocated.
NodeID allocateGepObjectId(NodeID base, u32_t offset, u32_t maxFieldLimit)
NodeIDAllocator(void)
Builds a node ID allocator with the strategy specified on the command line.
NodeID getNumObjects(void) const
Returns the total number of memory objects.
static void unset(void)
Deletes the (singleton) allocator.
hclust_fast_methods
Definition fastcluster.h:66
for isBitcode
Definition BasicTypes.h:68
u32_t NodeID
Definition GeneralType.h:56
std::unordered_map< Key, Value, Hash, KeyEqual, Allocator > Map
llvm::IRBuilder IRBuilder
Definition BasicTypes.h:74
unsigned u32_t
Definition GeneralType.h:47