| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 17 #include "llvm/ADT/DenseMap.h"
47 DenseMap<std::pair<const SCEV *, Instruction *>, TrackingVH<Value>>
55 DenseMap<const SCEV *, const Loop *> RelevantLoops;
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 138 DenseMap<MachineInstr*, SUnit*> MISUnitMap;
351 DenseMap<MachineInstr*, SUnit*>::const_iterator I = MISUnitMap.find(MI);
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/MC/ |
| MCMachObjectWriter.h | 13 #include "llvm/ADT/DenseMap.h"
101 DenseMap<const MCSection *, std::vector<RelAndSymbol>> Relocations;
102 DenseMap<const MCSection *, unsigned> IndirectSymBase;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseSet.h | 17 #include "llvm/ADT/DenseMap.h"
25 // Use the empty base class trick so we can create a DenseMap where the buckets
41 /// DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
49 "DenseMap buckets unexpectedly large!");
216 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
221 DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
|
| SCCIterator.h | 26 #include "llvm/ADT/DenseMap.h"
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
161 typename DenseMap<NodeRef, unsigned>::iterator Visited =
|
| ScopedHashTable.h | 34 #include "llvm/ADT/DenseMap.h"
161 DenseMap<K, ValTy*, KInfo> TopLevelMap;
202 typename DenseMap<K, ValTy*, KInfo>::iterator I =
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 17 #include "llvm/ADT/DenseMap.h"
47 DenseMap<std::pair<const SCEV *, Instruction *>, TrackingVH<Value>>
55 DenseMap<const SCEV *, const Loop *> RelevantLoops;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 138 DenseMap<MachineInstr*, SUnit*> MISUnitMap;
351 DenseMap<MachineInstr*, SUnit*>::const_iterator I = MISUnitMap.find(MI);
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/MC/ |
| MCMachObjectWriter.h | 13 #include "llvm/ADT/DenseMap.h"
101 DenseMap<const MCSection *, std::vector<RelAndSymbol>> Relocations;
102 DenseMap<const MCSection *, unsigned> IndirectSymBase;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseSet.h | 17 #include "llvm/ADT/DenseMap.h"
25 // Use the empty base class trick so we can create a DenseMap where the buckets
41 /// DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
49 "DenseMap buckets unexpectedly large!");
216 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
221 DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
|
| SCCIterator.h | 26 #include "llvm/ADT/DenseMap.h"
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
161 typename DenseMap<NodeRef, unsigned>::iterator Visited =
|
| ScopedHashTable.h | 34 #include "llvm/ADT/DenseMap.h"
161 DenseMap<K, ValTy*, KInfo> TopLevelMap;
202 typename DenseMap<K, ValTy*, KInfo>::iterator I =
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 17 #include "llvm/ADT/DenseMap.h"
47 DenseMap<std::pair<const SCEV *, Instruction *>, TrackingVH<Value>>
55 DenseMap<const SCEV *, const Loop *> RelevantLoops;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 138 DenseMap<MachineInstr*, SUnit*> MISUnitMap;
351 DenseMap<MachineInstr*, SUnit*>::const_iterator I = MISUnitMap.find(MI);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/MC/ |
| MCMachObjectWriter.h | 13 #include "llvm/ADT/DenseMap.h"
101 DenseMap<const MCSection *, std::vector<RelAndSymbol>> Relocations;
102 DenseMap<const MCSection *, unsigned> IndirectSymBase;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseSet.h | 17 #include "llvm/ADT/DenseMap.h"
25 // Use the empty base class trick so we can create a DenseMap where the buckets
41 /// DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
49 "DenseMap buckets unexpectedly large!");
216 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
221 DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
|
| SCCIterator.h | 26 #include "llvm/ADT/DenseMap.h"
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
161 typename DenseMap<NodeRef, unsigned>::iterator Visited =
|
| ScopedHashTable.h | 34 #include "llvm/ADT/DenseMap.h"
161 DenseMap<K, ValTy*, KInfo> TopLevelMap;
202 typename DenseMap<K, ValTy*, KInfo>::iterator I =
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 17 #include "llvm/ADT/DenseMap.h"
47 DenseMap<std::pair<const SCEV *, Instruction *>, TrackingVH<Value>>
55 DenseMap<const SCEV *, const Loop *> RelevantLoops;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 138 DenseMap<MachineInstr*, SUnit*> MISUnitMap;
351 DenseMap<MachineInstr*, SUnit*>::const_iterator I = MISUnitMap.find(MI);
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/MC/ |
| MCMachObjectWriter.h | 13 #include "llvm/ADT/DenseMap.h"
101 DenseMap<const MCSection *, std::vector<RelAndSymbol>> Relocations;
102 DenseMap<const MCSection *, unsigned> IndirectSymBase;
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseSet.h | 17 #include "llvm/ADT/DenseMap.h"
25 // Use the empty base class trick so we can create a DenseMap where the buckets
41 /// DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
49 "DenseMap buckets unexpectedly large!");
216 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
221 DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
|
| SCCIterator.h | 26 #include "llvm/ADT/DenseMap.h"
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
161 typename DenseMap<NodeRef, unsigned>::iterator Visited =
|
| ScopedHashTable.h | 34 #include "llvm/ADT/DenseMap.h"
161 DenseMap<K, ValTy*, KInfo> TopLevelMap;
202 typename DenseMap<K, ValTy*, KInfo>::iterator I =
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 17 #include "llvm/ADT/DenseMap.h"
47 DenseMap<std::pair<const SCEV *, Instruction *>, TrackingVH<Value>>
55 DenseMap<const SCEV *, const Loop *> RelevantLoops;
|
