OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:MapTy
(Results
1 - 10
of
10
) sorted by null
/external/clang/lib/AST/
ParentMap.cpp
21
typedef llvm::DenseMap<Stmt*, Stmt*>
MapTy
;
23
static void BuildParentMap(
MapTy
& M, Stmt* S) {
44
MapTy
*M = new
MapTy
();
51
delete (
MapTy
*) Impl;
56
BuildParentMap(*(
MapTy
*) Impl, S);
61
MapTy
* M = (
MapTy
*) Impl;
62
MapTy
::iterator I = M->find(S);
ExprConstant.cpp
292
typedef std::map<const Expr*, APValue>
MapTy
;
293
typedef
MapTy
::const_iterator temp_iterator;
295
MapTy
Temporaries;
[
all
...]
/external/clang/lib/StaticAnalyzer/Checkers/
CheckObjCInstMethSignature.cpp
92
typedef llvm::DenseMap<Selector,ObjCMethodDecl*>
MapTy
;
93
MapTy
IMeths;
113
MapTy
::iterator MI = IMeths.find(S);
RetainCountChecker.cpp
516
typedef llvm::DenseMap<ObjCSummaryKey, const RetainSummary *>
MapTy
;
517
MapTy
M;
525
MapTy
::iterator I = M.find(K);
556
MapTy
::iterator I = M.find(ObjCSummaryKey(II, S));
[
all
...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
FunctionSummary.h
46
typedef llvm::DenseMap<const Decl*, FunctionSummary*>
MapTy
;
47
MapTy
Map;
52
MapTy
::iterator findOrInsertSummary(const Decl *D) {
53
MapTy
::iterator I = Map.find(D);
63
MapTy
::iterator I = findOrInsertSummary(D);
68
MapTy
::const_iterator I = Map.find(D);
75
MapTy
::iterator I = findOrInsertSummary(D);
86
MapTy
::const_iterator I = Map.find(D);
94
MapTy
::const_iterator I = Map.find(D);
/external/llvm/tools/llvm-objdump/
MCFunction.h
74
typedef std::vector<std::pair<uint64_t, MCBasicBlock> >
MapTy
;
75
MapTy
Blocks;
86
typedef
MapTy
::const_iterator iterator;
/external/llvm/include/llvm/ADT/
DenseSet.h
27
typedef DenseMap<ValueT, char, ValueInfoT>
MapTy
;
28
MapTy
TheMap;
63
typename
MapTy
::iterator I;
66
typedef typename
MapTy
::iterator::difference_type difference_type;
72
Iterator(const typename
MapTy
::iterator &i) : I(i) {}
83
typename
MapTy
::const_iterator I;
86
typedef typename
MapTy
::const_iterator::difference_type difference_type;
92
ConstIterator(const typename
MapTy
::const_iterator &i) : I(i) {}
/external/llvm/lib/VMCore/
ConstantsContext.h
518
typedef std::map<MapKey, ConstantClass *>
MapTy
;
519
typedef std::map<ConstantClass *, typename
MapTy
::iterator> InverseMapTy;
524
MapTy
Map;
533
typename
MapTy
::iterator map_begin() { return Map.begin(); }
534
typename
MapTy
::iterator map_end() { return Map.end(); }
537
for (typename
MapTy
::iterator I=Map.begin(), E=Map.end();
549
typename
MapTy
::iterator InsertOrGetItem(std::pair<MapKey, ConstantClass *>
552
std::pair<typename
MapTy
::iterator, bool> IP = Map.insert(InsertVal);
558
typename
MapTy
::iterator FindExistingElement(ConstantClass *CP) {
567
typename
MapTy
::iterator I
[
all
...]
/external/llvm/lib/Analysis/
ConstantFolding.cpp
401
Type *
MapTy
;
403
MapTy
= Type::getInt32PtrTy(C->getContext());
405
MapTy
= Type::getInt64PtrTy(C->getContext());
407
MapTy
= IntegerType::get(C->getContext(),
409
MapTy
= PointerType::getUnqual(
MapTy
);
413
C = FoldBitCast(C,
MapTy
, TD);
[
all
...]
/external/llvm/lib/Transforms/Scalar/
ObjCARC.cpp
50
typedef DenseMap<KeyT, size_t>
MapTy
;
51
MapTy
Map;
68
for (typename
MapTy
::const_iterator I = Map.begin(), E = Map.end();
82
std::pair<typename
MapTy
::iterator, bool> Pair =
95
std::pair<typename
MapTy
::iterator, bool> Pair =
107
typename
MapTy
::const_iterator It = Map.find(Key);
117
typename
MapTy
::iterator It = Map.find(Key);
[
all
...]
Completed in 542 milliseconds