mirror of
https://github.com/llvm/llvm-project.git
synced 2025-05-04 10:36:06 +00:00
2946cd7010
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
91 lines
2.4 KiB
C++
91 lines
2.4 KiB
C++
//===--- CFGStmtMap.h - Map from Stmt* to CFGBlock* -----------*- C++ -*-===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the CFGStmtMap class, which defines a mapping from
|
|
// Stmt* to CFGBlock*
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
#include "clang/AST/ParentMap.h"
|
|
#include "clang/Analysis/CFG.h"
|
|
#include "clang/Analysis/CFGStmtMap.h"
|
|
|
|
using namespace clang;
|
|
|
|
typedef llvm::DenseMap<const Stmt*, CFGBlock*> SMap;
|
|
static SMap *AsMap(void *m) { return (SMap*) m; }
|
|
|
|
CFGStmtMap::~CFGStmtMap() { delete AsMap(M); }
|
|
|
|
CFGBlock *CFGStmtMap::getBlock(Stmt *S) {
|
|
SMap *SM = AsMap(M);
|
|
Stmt *X = S;
|
|
|
|
// If 'S' isn't in the map, walk the ParentMap to see if one of its ancestors
|
|
// is in the map.
|
|
while (X) {
|
|
SMap::iterator I = SM->find(X);
|
|
if (I != SM->end()) {
|
|
CFGBlock *B = I->second;
|
|
// Memoize this lookup.
|
|
if (X != S)
|
|
(*SM)[X] = B;
|
|
return B;
|
|
}
|
|
|
|
X = PM->getParentIgnoreParens(X);
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
static void Accumulate(SMap &SM, CFGBlock *B) {
|
|
// First walk the block-level expressions.
|
|
for (CFGBlock::iterator I = B->begin(), E = B->end(); I != E; ++I) {
|
|
const CFGElement &CE = *I;
|
|
Optional<CFGStmt> CS = CE.getAs<CFGStmt>();
|
|
if (!CS)
|
|
continue;
|
|
|
|
CFGBlock *&Entry = SM[CS->getStmt()];
|
|
// If 'Entry' is already initialized (e.g., a terminator was already),
|
|
// skip.
|
|
if (Entry)
|
|
continue;
|
|
|
|
Entry = B;
|
|
|
|
}
|
|
|
|
// Look at the label of the block.
|
|
if (Stmt *Label = B->getLabel())
|
|
SM[Label] = B;
|
|
|
|
// Finally, look at the terminator. If the terminator was already added
|
|
// because it is a block-level expression in another block, overwrite
|
|
// that mapping.
|
|
if (Stmt *Term = B->getTerminator())
|
|
SM[Term] = B;
|
|
}
|
|
|
|
CFGStmtMap *CFGStmtMap::Build(CFG *C, ParentMap *PM) {
|
|
if (!C || !PM)
|
|
return nullptr;
|
|
|
|
SMap *SM = new SMap();
|
|
|
|
// Walk all blocks, accumulating the block-level expressions, labels,
|
|
// and terminators.
|
|
for (CFG::iterator I = C->begin(), E = C->end(); I != E; ++I)
|
|
Accumulate(*SM, *I);
|
|
|
|
return new CFGStmtMap(PM, SM);
|
|
}
|
|
|