mirror of
https://github.com/llvm/llvm-project.git
synced 2025-05-04 03:36:07 +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
85 lines
2.5 KiB
C++
85 lines
2.5 KiB
C++
//==- BlockCounter.h - ADT for counting block visits -------------*- 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 BlockCounter, an abstract data type used to count
|
|
// the number of times a given block has been visited along a path
|
|
// analyzed by CoreEngine.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "clang/StaticAnalyzer/Core/PathSensitive/BlockCounter.h"
|
|
#include "llvm/ADT/ImmutableMap.h"
|
|
|
|
using namespace clang;
|
|
using namespace ento;
|
|
|
|
namespace {
|
|
|
|
class CountKey {
|
|
const StackFrameContext *CallSite;
|
|
unsigned BlockID;
|
|
|
|
public:
|
|
CountKey(const StackFrameContext *CS, unsigned ID)
|
|
: CallSite(CS), BlockID(ID) {}
|
|
|
|
bool operator==(const CountKey &RHS) const {
|
|
return (CallSite == RHS.CallSite) && (BlockID == RHS.BlockID);
|
|
}
|
|
|
|
bool operator<(const CountKey &RHS) const {
|
|
return std::tie(CallSite, BlockID) < std::tie(RHS.CallSite, RHS.BlockID);
|
|
}
|
|
|
|
void Profile(llvm::FoldingSetNodeID &ID) const {
|
|
ID.AddPointer(CallSite);
|
|
ID.AddInteger(BlockID);
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
typedef llvm::ImmutableMap<CountKey, unsigned> CountMap;
|
|
|
|
static inline CountMap GetMap(void *D) {
|
|
return CountMap(static_cast<CountMap::TreeTy*>(D));
|
|
}
|
|
|
|
static inline CountMap::Factory& GetFactory(void *F) {
|
|
return *static_cast<CountMap::Factory*>(F);
|
|
}
|
|
|
|
unsigned BlockCounter::getNumVisited(const StackFrameContext *CallSite,
|
|
unsigned BlockID) const {
|
|
CountMap M = GetMap(Data);
|
|
CountMap::data_type* T = M.lookup(CountKey(CallSite, BlockID));
|
|
return T ? *T : 0;
|
|
}
|
|
|
|
BlockCounter::Factory::Factory(llvm::BumpPtrAllocator& Alloc) {
|
|
F = new CountMap::Factory(Alloc);
|
|
}
|
|
|
|
BlockCounter::Factory::~Factory() {
|
|
delete static_cast<CountMap::Factory*>(F);
|
|
}
|
|
|
|
BlockCounter
|
|
BlockCounter::Factory::IncrementCount(BlockCounter BC,
|
|
const StackFrameContext *CallSite,
|
|
unsigned BlockID) {
|
|
return BlockCounter(GetFactory(F).add(GetMap(BC.Data),
|
|
CountKey(CallSite, BlockID),
|
|
BC.getNumVisited(CallSite, BlockID)+1).getRoot());
|
|
}
|
|
|
|
BlockCounter
|
|
BlockCounter::Factory::GetEmptyCounter() {
|
|
return BlockCounter(GetFactory(F).getEmptyMap().getRoot());
|
|
}
|