Static Value-Flow Analysis
FlowSensitiveStat.cpp
Go to the documentation of this file.
1 //===- FlowSensitiveStat.cpp -- Statistics for flow-sensitive pointer analysis-//
2 //
3 // SVF: Static Value-Flow Analysis
4 //
5 // Copyright (C) <2013-2017> <Yulei Sui>
6 //
7 
8 // This program is free software: you can redistribute it and/or modify
9 // it under the terms of the GNU Affero General Public License as published by
10 // the Free Software Foundation, either version 3 of the License, or
11 // (at your option) any later version.
12 
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU Affero General Public License for more details.
17 
18 // You should have received a copy of the GNU Affero General Public License
19 // along with this program. If not, see <http://www.gnu.org/licenses/>.
20 //
21 //===-----------------------------------------------------------------------===//
22 
23 /*
24  * FlowSensitiveStat.cpp
25  *
26  * Created on: 27/11/2013
27  * Author: yesen
28  */
29 
30 #include "WPA/Andersen.h"
31 #include "WPA/WPAStat.h"
32 #include "WPA/FlowSensitive.h"
33 #include "MemoryModel/PointsTo.h"
34 
35 using namespace SVF;
36 using namespace SVFUtil;
37 
42 {
43  _NumOfNullPtr = 0;
44  _NumOfConstantPtr = 0;
45  _NumOfBlackholePtr = 0;
46  _MaxPtsSize = _MaxTopLvlPtsSize = 0;
47  _AvgPtsSize = _AvgTopLvlPtsSize = 0;
48  _AvgAddrTakenVarPtsSize = _NumOfAddrTakeVar = 0;
49  _MaxAddrTakenVarPts = 0;
50  _TotalPtsSize = 0;
51 
52  for (int i=IN; i<=OUT; i++)
53  {
55  _NumOfSVFGNodesHaveInOut[i] = 0;
56  _NumOfFormalInSVFGNodesHaveInOut[i] = 0;
57  _NumOfFormalOutSVFGNodesHaveInOut[i] = 0;
58  _NumOfActualInSVFGNodesHaveInOut[i] = 0;
59  _NumOfActualOutSVFGNodesHaveInOut[i] = 0;
60  _NumOfLoadSVFGNodesHaveInOut[i] = 0;
61  _NumOfStoreSVFGNodesHaveInOut[i] = 0;
62  _NumOfMSSAPhiSVFGNodesHaveInOut[i] = 0;
63 
65  _NumOfVarHaveINOUTPts[i] = 0;
66  _NumOfVarHaveEmptyINOUTPts[i] = 0;
67  _NumOfVarHaveINOUTPtsInFormalIn[i] = 0;
68  _NumOfVarHaveINOUTPtsInFormalOut[i] = 0;;
69  _NumOfVarHaveINOUTPtsInActualIn[i] = 0;
70  _NumOfVarHaveINOUTPtsInActualOut[i] = 0;
71  _NumOfVarHaveINOUTPtsInLoad[i] = 0;
72  _NumOfVarHaveINOUTPtsInStore[i] = 0;
73  _NumOfVarHaveINOUTPtsInMSSAPhi[i] = 0;
74  _PotentialNumOfVarHaveINOUTPts[i] = 0;
75 
76  _MaxInOutPtsSize[i] = 0;
77  _AvgInOutPtsSize[i] = 0;
78  }
79 }
80 
85 {
86  assert(SVFUtil::isa<FlowSensitive>(fspta) && "not an flow-sensitive pta pass!! what else??");
87  endClk();
88 
89  clearStat();
90 
91  SVFIR* pag = fspta->getPAG();
92 
93  // stat null ptr number
94  statNullPtr();
95 
96  // stat points-to set information
97  statPtsSize();
98 
99  // stat address-taken variables' points-to
100  statAddrVarPtsSize();
101 
102  u32_t fiObjNumber = 0;
103  u32_t fsObjNumber = 0;
104  Set<SymID> nodeSet;
105  for (SVFIR::const_iterator nodeIt = pag->begin(), nodeEit = pag->end(); nodeIt != nodeEit; nodeIt++)
106  {
107  NodeID nodeId = nodeIt->first;
108  PAGNode* pagNode = nodeIt->second;
109  if(SVFUtil::isa<ObjVar>(pagNode))
110  {
111  const MemObj * memObj = pag->getBaseObj(nodeId);
112  SymID baseId = memObj->getId();
113  if (nodeSet.insert(baseId).second)
114  {
115  if (memObj->isFieldInsensitive())
116  fiObjNumber++;
117  else
118  fsObjNumber++;
119  }
120  }
121  }
122 
123  PTNumStatMap["FIObjNum"] = fiObjNumber;
124  PTNumStatMap["FSObjNum"] = fsObjNumber;
125 
126  unsigned numOfCopy = 0;
127  unsigned numOfStore = 0;
128  SVFG::iterator svfgNodeIt = fspta->svfg->begin();
129  SVFG::iterator svfgNodeEit = fspta->svfg->end();
130  for (; svfgNodeIt != svfgNodeEit; ++svfgNodeIt)
131  {
132  SVFGNode* svfgNode = svfgNodeIt->second;
133  if (SVFUtil::isa<CopySVFGNode>(svfgNode))
134  numOfCopy++;
135  else if (SVFUtil::isa<StoreSVFGNode>(svfgNode))
136  numOfStore++;
137  }
138 
140 
141  timeStatMap["TotalTime"] = (endTime - startTime)/TIMEINTERVAL;
142  timeStatMap["SolveTime"] = fspta->solveTime;
143  timeStatMap["SCCTime"] = fspta->sccTime;
144  timeStatMap["ProcessTime"] = fspta->processTime;
145  timeStatMap["PropagationTime"] = fspta->propagationTime;
146  timeStatMap["DirectPropaTime"] = fspta->directPropaTime;
147  timeStatMap["IndirectPropaTime"] = fspta->indirectPropaTime;
148  timeStatMap["Strong/WeakUpdTime"] = fspta->updateTime;
149  timeStatMap["AddrTime"] = fspta->addrTime;
150  timeStatMap["CopyTime"] = fspta->copyTime;
151  timeStatMap["GepTime"] = fspta->gepTime;
152  timeStatMap["LoadTime"] = fspta->loadTime;
153  timeStatMap["StoreTime"] = fspta->storeTime;
154  timeStatMap["UpdateCGTime"] = fspta->updateCallGraphTime;
155  timeStatMap["PhiTime"] = fspta->phiTime;
156 
157  PTNumStatMap["TotalPointers"] = pag->getValueNodeNum() + pag->getFieldValNodeNum();
158  PTNumStatMap["TotalObjects"] = pag->getObjectNodeNum() + pag->getFieldObjNodeNum();
159 
160  PTNumStatMap["Pointers"] = pag->getValueNodeNum();
161  PTNumStatMap["MemObjects"] = pag->getObjectNodeNum();
162  PTNumStatMap["DummyFieldPtrs"] = pag->getFieldValNodeNum();
163  PTNumStatMap["FieldObjs"] = pag->getFieldObjNodeNum();
164 
165  PTNumStatMap["CopysNum"] = numOfCopy;
166  PTNumStatMap["StoresNum"] = numOfStore;
167 
168  PTNumStatMap["SolveIterations"] = fspta->numOfIteration;
169 
170  PTNumStatMap["IndEdgeSolved"] = fspta->getNumOfResolvedIndCallEdge();
171 
172  PTNumStatMap["NullPointer"] = _NumOfNullPtr;
173  PTNumStatMap["PointsToConstPtr"] = _NumOfConstantPtr;
174  PTNumStatMap["PointsToBlkPtr"] = _NumOfBlackholePtr;
175 
176  PTNumStatMap["StrongUpdates"] = fspta->svfgHasSU.count();
177 
179  PTNumStatMap["SNodesHaveIN"] = _NumOfSVFGNodesHaveInOut[IN];
180  PTNumStatMap["SNodesHaveOUT"] = _NumOfSVFGNodesHaveInOut[OUT];
181 
182  PTNumStatMap["FI_SNodesHaveIN"] = _NumOfFormalInSVFGNodesHaveInOut[IN];
183  PTNumStatMap["FI_SNodesHaveOUT"] = _NumOfFormalInSVFGNodesHaveInOut[OUT];
184 
185  PTNumStatMap["FO_SNodesHaveIN"] = _NumOfFormalOutSVFGNodesHaveInOut[IN];
186  PTNumStatMap["FO_SNodesHaveOUT"] = _NumOfFormalOutSVFGNodesHaveInOut[OUT];
187 
188  PTNumStatMap["AI_SNodesHaveIN"] = _NumOfActualInSVFGNodesHaveInOut[IN];
189  PTNumStatMap["AI_SNodesHaveOUT"] = _NumOfActualInSVFGNodesHaveInOut[OUT];
190 
191  PTNumStatMap["AO_SNodesHaveIN"] = _NumOfActualOutSVFGNodesHaveInOut[IN];
192  PTNumStatMap["AO_SNodesHaveOUT"] = _NumOfActualOutSVFGNodesHaveInOut[OUT];
193 
194  PTNumStatMap["LD_SNodesHaveIN"] = _NumOfLoadSVFGNodesHaveInOut[IN];
195  PTNumStatMap["LD_SNodesHaveOUT"] = _NumOfLoadSVFGNodesHaveInOut[OUT];
196 
197  PTNumStatMap["ST_SNodesHaveIN"] = _NumOfStoreSVFGNodesHaveInOut[IN];
198  PTNumStatMap["ST_SNodesHaveOUT"] = _NumOfStoreSVFGNodesHaveInOut[OUT];
199 
200  PTNumStatMap["PHI_SNodesHaveIN"] = _NumOfMSSAPhiSVFGNodesHaveInOut[IN];
201  PTNumStatMap["PHI_SNodesHaveOUT"] = _NumOfMSSAPhiSVFGNodesHaveInOut[OUT];
202 
203  /*-----------------------------------------------------*/
204  // SVFIR nodes.
205  PTNumStatMap["VarHaveIN"] = _NumOfVarHaveINOUTPts[IN];
206  PTNumStatMap["VarHaveOUT"] = _NumOfVarHaveINOUTPts[OUT];
207 
208  PTNumStatMap["PotentialVarHaveIN"] = _PotentialNumOfVarHaveINOUTPts[IN];
209  PTNumStatMap["PotentialVarHaveOUT"] = _PotentialNumOfVarHaveINOUTPts[OUT];
210 
211  PTNumStatMap["VarHaveEmptyIN"] = _NumOfVarHaveEmptyINOUTPts[IN];
212  PTNumStatMap["VarHaveEmptyOUT"] = _NumOfVarHaveEmptyINOUTPts[OUT];
213 
214  PTNumStatMap["VarHaveIN_FI"] = _NumOfVarHaveINOUTPtsInFormalIn[IN];
215  PTNumStatMap["VarHaveOUT_FI"] = _NumOfVarHaveINOUTPtsInFormalIn[OUT];
216 
217  PTNumStatMap["VarHaveIN_FO"] = _NumOfVarHaveINOUTPtsInFormalOut[IN];
218  PTNumStatMap["VarHaveOUT_FO"] = _NumOfVarHaveINOUTPtsInFormalOut[OUT];
219 
220  PTNumStatMap["VarHaveIN_AI"] = _NumOfVarHaveINOUTPtsInActualIn[IN];
221  PTNumStatMap["VarHaveOUT_AI"] = _NumOfVarHaveINOUTPtsInActualIn[OUT];
222 
223  PTNumStatMap["VarHaveIN_AO"] = _NumOfVarHaveINOUTPtsInActualOut[IN];
224  PTNumStatMap["VarHaveOUT_AO"] = _NumOfVarHaveINOUTPtsInActualOut[OUT];
225 
226  PTNumStatMap["VarHaveIN_LD"] = _NumOfVarHaveINOUTPtsInLoad[IN];
227  PTNumStatMap["VarHaveOUT_LD"] = _NumOfVarHaveINOUTPtsInLoad[OUT];
228 
229  PTNumStatMap["VarHaveIN_ST"] = _NumOfVarHaveINOUTPtsInStore[IN];
230  PTNumStatMap["VarHaveOUT_ST"] = _NumOfVarHaveINOUTPtsInStore[OUT];
231 
232  PTNumStatMap["VarHaveIN_PHI"] = _NumOfVarHaveINOUTPtsInMSSAPhi[IN];
233  PTNumStatMap["VarHaveOUT_PHI"] = _NumOfVarHaveINOUTPtsInMSSAPhi[OUT];
234 
235  PTNumStatMap["MaxPtsSize"] = _MaxPtsSize;
236  PTNumStatMap["MaxTopLvlPtsSize"] = _MaxTopLvlPtsSize;
237  PTNumStatMap["MaxINPtsSize"] = _MaxInOutPtsSize[IN];
238  PTNumStatMap["MaxOUTPtsSize"] = _MaxInOutPtsSize[OUT];
239 
240  timeStatMap["AvgPtsSize"] = _AvgPtsSize;
241  timeStatMap["AvgTopLvlPtsSize"] = _AvgTopLvlPtsSize;
242 
243  PTNumStatMap["NumOfAddrTakenVar"] = _NumOfAddrTakeVar;
244  timeStatMap["AvgAddrTakenVarPts"] = (_NumOfAddrTakeVar == 0) ?
245  0 : ((double)_AvgAddrTakenVarPtsSize / _NumOfAddrTakeVar);
246  PTNumStatMap["MaxAddrTakenVarPts"] = _MaxAddrTakenVarPts;
247 
248  timeStatMap["AvgINPtsSize"] = _AvgInOutPtsSize[IN];
249  timeStatMap["AvgOUTPtsSize"] = _AvgInOutPtsSize[OUT];
250 
251  PTNumStatMap["ProcessedAddr"] = fspta->numOfProcessedAddr;
252  PTNumStatMap["ProcessedCopy"] = fspta->numOfProcessedCopy;
253  PTNumStatMap["ProcessedGep"] = fspta->numOfProcessedGep;
254  PTNumStatMap["ProcessedLoad"] = fspta->numOfProcessedLoad;
255  PTNumStatMap["ProcessedStore"] = fspta->numOfProcessedStore;
256  PTNumStatMap["ProcessedPhi"] = fspta->numOfProcessedPhi;
257  PTNumStatMap["ProcessedAParam"] = fspta->numOfProcessedActualParam;
258  PTNumStatMap["ProcessedFRet"] = fspta->numOfProcessedFormalRet;
259  PTNumStatMap["ProcessedMSSANode"] = fspta->numOfProcessedMSSANode;
260 
261  PTNumStatMap["NumOfNodesInSCC"] = fspta->numOfNodesInSCC;
262  PTNumStatMap["MaxSCCSize"] = fspta->maxSCCSize;
263  PTNumStatMap["NumOfSCC"] = fspta->numOfSCC;
264  timeStatMap["AverageSCCSize"] = (fspta->numOfSCC == 0) ? 0 :
265  ((double)fspta->numOfNodesInSCC / fspta->numOfSCC);
266 
267  PTAStat::printStat("Flow-Sensitive Pointer Analysis Statistics");
268 }
269 
271 {
272  _NumOfNullPtr = 0;
273  for (SVFIR::iterator iter = fspta->getPAG()->begin(), eiter = fspta->getPAG()->end();
274  iter != eiter; ++iter)
275  {
276  NodeID pagNodeId = iter->first;
277  PAGNode* pagNode = iter->second;
278  SVFStmt::SVFStmtSetTy& inComingStore = pagNode->getIncomingEdges(SVFStmt::Store);
279  SVFStmt::SVFStmtSetTy& outGoingLoad = pagNode->getOutgoingEdges(SVFStmt::Load);
280  if (inComingStore.empty()==false || outGoingLoad.empty()==false)
281  {
283  const PointsTo& pts = fspta->getPts(pagNodeId);
284  if(fspta->containBlackHoleNode(pts))
285  {
286  _NumOfConstantPtr++;
287  }
288  if(fspta->containConstantNode(pts))
289  {
290  _NumOfBlackholePtr++;
291  }
292  if(pts.empty())
293  {
294  std::string str;
295  std::stringstream rawstr(str);
296  if (!SVFUtil::isa<DummyValVar>(pagNode) && !SVFUtil::isa<DummyObjVar>(pagNode))
297  {
298  // if a pointer is in dead function, we do not care
299  if(pagNode->getValue()->ptrInUncalledFunction() == false)
300  {
301  _NumOfNullPtr++;
302  rawstr << "##Null Pointer : (NodeID " << pagNode->getId()
303  << ") PtrName:" << pagNode->getValue()->getName();
304  writeWrnMsg(rawstr.str());
305  }
306  }
307  else
308  {
309  _NumOfNullPtr++;
310  rawstr << "##Null Pointer : (NodeID " << pagNode->getId();
311  writeWrnMsg(rawstr.str());
312  }
313  }
314  }
315  }
316 }
317 
322 {
323  // TODO: needs to be made to work for persistent.
324  if (SVFUtil::isa<FlowSensitive::MutDFPTDataTy>(fspta->getPTDataTy()))
325  {
326  // stat of IN set
327  statInOutPtsSize(fspta->getDFInputMap(), IN);
328  // stat of OUT set
329  statInOutPtsSize(fspta->getDFOutputMap(), OUT);
330  }
331 
333  u32_t totalValidTopLvlPointers = 0;
334  u32_t topTopLvlPtsSize = 0;
335  for (SVFIR::iterator iter = fspta->getPAG()->begin(), eiter = fspta->getPAG()->end();
336  iter != eiter; ++iter)
337  {
338  NodeID node = iter->first;
339  if (fspta->getPAG()->isValidTopLevelPtr(iter->second) == false)
340  continue;
341  u32_t size = fspta->getPts(node).count();
342 
343  totalValidTopLvlPointers++;
344  topTopLvlPtsSize+=size;
345 
346  if(size > _MaxPtsSize) _MaxPtsSize = size;
347 
348  if (size > _MaxTopLvlPtsSize) _MaxTopLvlPtsSize = size;
349  }
350 
351  if (totalValidTopLvlPointers != 0)
352  _AvgTopLvlPtsSize = (double)topTopLvlPtsSize/totalValidTopLvlPointers;
353 
354  _TotalPtsSize += topTopLvlPtsSize;
355  u32_t totalPointer = totalValidTopLvlPointers + _NumOfVarHaveINOUTPts[IN] + _NumOfVarHaveINOUTPts[OUT];
356  if (totalPointer != 0)
357  _AvgPtsSize = (double) _TotalPtsSize / totalPointer;
358 }
359 
361 {
362  // Get number of nodes which have IN/OUT set
363  _NumOfSVFGNodesHaveInOut[inOrOut] = data.size();
364 
365  u32_t inOutPtsSize = 0;
366  DFInOutMap::const_iterator it = data.begin();
367  DFInOutMap::const_iterator eit = data.end();
368  for (; it != eit; ++it)
369  {
370  const SVFGNode* node = fspta->svfg->getSVFGNode(it->first);
371 
372  // Count number of SVFG nodes have IN/OUT set.
373  if (SVFUtil::isa<FormalINSVFGNode>(node))
374  _NumOfFormalInSVFGNodesHaveInOut[inOrOut]++;
375  else if (SVFUtil::isa<FormalOUTSVFGNode>(node))
376  _NumOfFormalOutSVFGNodesHaveInOut[inOrOut]++;
377  else if (SVFUtil::isa<ActualINSVFGNode>(node))
378  _NumOfActualInSVFGNodesHaveInOut[inOrOut]++;
379  else if (SVFUtil::isa<ActualOUTSVFGNode>(node))
380  _NumOfActualOutSVFGNodesHaveInOut[inOrOut]++;
381  else if (SVFUtil::isa<LoadSVFGNode>(node))
382  _NumOfLoadSVFGNodesHaveInOut[inOrOut]++;
383  else if (SVFUtil::isa<StoreSVFGNode>(node))
384  _NumOfStoreSVFGNodesHaveInOut[inOrOut]++;
385  else if (SVFUtil::isa<MSSAPHISVFGNode>(node))
386  _NumOfMSSAPhiSVFGNodesHaveInOut[inOrOut]++;
387  else
388  assert(false && "unexpected node have IN/OUT set");
389 
390  /*-----------------------------------------------------*/
391 
392  // Count SVFIR nodes and their points-to set size.
393  const PtsMap& cptsMap = it->second;
394  PtsMap::const_iterator ptsIt = cptsMap.begin();
395  PtsMap::const_iterator ptsEit = cptsMap.end();
396  for (; ptsIt != ptsEit; ++ptsIt)
397  {
398  if (ptsIt->second.empty())
399  {
400  _NumOfVarHaveEmptyINOUTPts[inOrOut]++;
401  continue;
402  }
403 
404  u32_t ptsNum = ptsIt->second.count();
405 
406  // Only node with non-empty points-to set are counted.
407  _NumOfVarHaveINOUTPts[inOrOut]++;
408 
409  if (SVFUtil::isa<FormalINSVFGNode>(node))
410  _NumOfVarHaveINOUTPtsInFormalIn[inOrOut]++;
411  else if (SVFUtil::isa<FormalOUTSVFGNode>(node))
412  _NumOfVarHaveINOUTPtsInFormalOut[inOrOut]++;
413  else if (SVFUtil::isa<ActualINSVFGNode>(node))
414  _NumOfVarHaveINOUTPtsInActualIn[inOrOut]++;
415  else if (SVFUtil::isa<ActualOUTSVFGNode>(node))
416  _NumOfVarHaveINOUTPtsInActualOut[inOrOut]++;
417  else if (SVFUtil::isa<LoadSVFGNode>(node))
418  _NumOfVarHaveINOUTPtsInLoad[inOrOut]++;
419  else if (SVFUtil::isa<StoreSVFGNode>(node))
420  _NumOfVarHaveINOUTPtsInStore[inOrOut]++;
421  else if (SVFUtil::isa<MSSAPHISVFGNode>(node))
422  _NumOfVarHaveINOUTPtsInMSSAPhi[inOrOut]++;
423  else
424  assert(false && "unexpected node have IN/OUT set");
425 
426  inOutPtsSize += ptsNum;
427 
428  if (ptsNum > _MaxInOutPtsSize[inOrOut])
429  _MaxInOutPtsSize[inOrOut] = ptsNum;
430 
431  if (ptsNum > _MaxPtsSize) _MaxPtsSize = ptsNum;
432  }
433  }
434 
435  if (_NumOfVarHaveINOUTPts[inOrOut] != 0)
436  _AvgInOutPtsSize[inOrOut] = (double)inOutPtsSize / _NumOfVarHaveINOUTPts[inOrOut];
437 
438  _TotalPtsSize += inOutPtsSize;
439 
440  // How many IN/OUT PTSs could we have *potentially* had?
441  // l'-o->l, l''-o->l, ..., means there is a possibility of 1 IN PTS.
442  // *p = q && { o } in pts_ander(p) means there is a possibility of 1 OUT PTS.
443  // For OUTs at stores, we must also account for WU/SUs.
444  const SVFG *svfg = fspta->svfg;
445  for (SVFG::const_iterator it = svfg->begin(); it != svfg->end(); ++it)
446  {
447  const SVFGNode *sn = it->second;
448 
449  // Unique objects coming into s.
450  NodeBS incomingObjects;
451  for (const SVFGEdge *e : sn->getInEdges())
452  {
453  const IndirectSVFGEdge *ie = SVFUtil::dyn_cast<IndirectSVFGEdge>(e);
454  if (!ie) continue;
455  for (NodeID o : ie->getPointsTo()) incomingObjects.set(o);
456  }
457 
458  _PotentialNumOfVarHaveINOUTPts[IN] += incomingObjects.count();
459 
460  if (const StoreSVFGNode *store = SVFUtil::dyn_cast<StoreSVFGNode>(sn))
461  {
462  NodeID p = store->getPAGDstNodeID();
463  // Reuse incomingObjects; what's already in there will be propagated forwarded
464  // as a WU/SU, and what's not (first defined at the store), will be added.
465  for (NodeID o : fspta->ander->getPts(p)) incomingObjects.set(o);
466 
467  _PotentialNumOfVarHaveINOUTPts[OUT] += incomingObjects.count();
468  }
469  }
470 }
471 
476 {
477  SVFG::SVFGNodeIDToNodeMapTy::const_iterator it = fspta->svfg->begin();
478  SVFG::SVFGNodeIDToNodeMapTy::const_iterator eit = fspta->svfg->end();
479  for (; it != eit; ++it)
480  {
481  const SVFGNode* node = it->second;
482  if (const StoreSVFGNode* store = SVFUtil::dyn_cast<StoreSVFGNode>(node))
483  {
484  calculateAddrVarPts(store->getPAGDstNodeID(), store);
485  }
486  }
487 }
488 
493 {
494  const PointsTo& pts = fspta->getPts(pointer);
495  _NumOfAddrTakeVar += pts.count();
496  PointsTo::iterator ptsIt = pts.begin();
497  PointsTo::iterator ptsEit = pts.end();
498  for (; ptsIt != ptsEit; ++ptsIt)
499  {
500  const NodeID ptd = *ptsIt;
501 
502  const PointsTo& cpts = fspta->getDFOutPtsSet(svfg_node, ptd);
503  _AvgAddrTakenVarPtsSize += cpts.count();
504  if (cpts.count() > _MaxAddrTakenVarPts)
505  _MaxAddrTakenVarPts = cpts.count();
506  }
507 }
508 
509 
#define TIMEINTERVAL
Definition: SVFType.h:512
cJSON * p
Definition: cJSON.cpp:2559
const char *const string
Definition: cJSON.h:172
void calculateAddrVarPts(NodeID pointer, const SVFGNode *node)
FlowSensitive::PtsMap PtsMap
Definition: WPAStat.h:89
FlowSensitive::DFInOutMap DFInOutMap
Definition: WPAStat.h:88
void statInOutPtsSize(const DFInOutMap &data, ENUM_INOUT inOrOut)
iterator begin()
Iterators.
Definition: GenericGraph.h:627
IDToNodeMapTy::const_iterator const_iterator
Definition: GenericGraph.h:607
IDToNodeMapTy::iterator iterator
Node Iterators.
Definition: GenericGraph.h:606
const GEdgeSetTy & getInEdges() const
Definition: GenericGraph.h:434
u32_t getValueNodeNum() const
Definition: IRGraph.h:186
u32_t getObjectNodeNum() const
Definition: IRGraph.h:190
const NodeBS & getPointsTo() const
Definition: SVFGEdge.h:60
SymID getId() const
Get the memory object id.
bool isFieldInsensitive() const
Return true if its field limit is 0.
void performStat() override
Definition: PTAStat.cpp:52
bool empty() const
Returns true if set is empty.
Definition: PointsTo.cpp:98
const_iterator end() const
Definition: PointsTo.h:132
u32_t count() const
Returns number of elements.
Definition: PointsTo.cpp:111
const_iterator begin() const
Definition: PointsTo.h:128
NodeID getId() const
Get ID.
Definition: GenericGraph.h:260
Definition: SVFG.h:66
static SVFIR * getPAG(bool buildFromFile=false)
Singleton design here to make sure we only have one instance during any analysis.
Definition: SVFIR.h:115
u32_t getFieldObjNodeNum() const
Definition: SVFIR.h:338
u32_t getFieldValNodeNum() const
Node and edge statistics.
Definition: SVFIR.h:334
const MemObj * getBaseObj(NodeID id) const
Definition: SVFIR.h:459
virtual void printStat(std::string str="")
Definition: SVFStat.cpp:66
GenericNode< SVFVar, SVFStmt >::GEdgeSetTy SVFStmtSetTy
const std::string & getName() const
Definition: SVFValue.h:243
bool ptrInUncalledFunction() const
Definition: SVFValue.h:264
SVFStmt::SVFStmtSetTy & getIncomingEdges(SVFStmt::PEDGEK kind)
Get incoming SVFIR statements (edges)
Definition: SVFVariables.h:137
SVFStmt::SVFStmtSetTy & getOutgoingEdges(SVFStmt::PEDGEK kind)
Get outgoing SVFIR statements (edges)
Definition: SVFVariables.h:142
const SVFValue * getValue() const
Get/has methods of the components.
Definition: SVFVariables.h:83
void set(unsigned Idx)
unsigned count() const
void writeWrnMsg(const std::string &msg)
Writes a message run through wrnMsg.
Definition: SVFUtil.cpp:66
for isBitcode
Definition: BasicTypes.h:68
u32_t NodeID
Definition: GeneralType.h:55
unsigned SymID
Definition: GeneralType.h:57
unsigned u32_t
Definition: GeneralType.h:46
std::unordered_set< Key, Hash, KeyEqual, Allocator > Set
Definition: GeneralType.h:96