| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineModuleInfoImpls.cpp | 35 DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) {
36 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end());
40 Map.clear();
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| FunctionSummary.cpp | 20 for (const auto &I : Map)
27 for (const auto &I : Map)
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| DeclLookups.h | 79 if (StoredDeclsMap *Map = Primary->buildLookup())
80 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()),
81 all_lookups_iterator(Map->end(), Map->end()));
93 if (StoredDeclsMap *Map = Primary->getLookupPtr())
94 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()),
95 all_lookups_iterator(Map->end(), Map->end()))
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| FunctionSummary.h | 58 MapTy Map;
62 MapTy::iterator I = Map.find(D);
63 if (I != Map.end())
68 I = Map.insert(KVPair(D, FunctionSummary())).first;
69 assert(I != Map.end());
90 MapTy::const_iterator I = Map.find(D);
91 if (I != Map.end() && I->second.InlineChecked)
108 MapTy::const_iterator I = Map.find(D);
109 if (I != Map.end())
115 MapTy::const_iterator I = Map.find(D)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| BlotMapVector.h | 23 /// Map keys to indices in Vector.
25 MapTy Map;
34 assert(Vector.size() >= Map.size()); // May differ due to blotting.
35 for (typename MapTy::const_iterator I = Map.begin(), E = Map.end(); I != E;
42 assert(!I->first || (Map.count(I->first) &&
43 Map[I->first] == size_t(I - Vector.begin())));
57 Map.insert(std::make_pair(Arg, size_t(0)));
69 Map.insert(std::make_pair(InsertPair.first, size_t(0)));
80 typename MapTy::iterator It = Map.find(Key)
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerValueBitMap.h | 1 //===- FuzzerValueBitMap.h - INTERNAL - Bit map -----------------*- C++ -* ===//
19 // A bit map containing kMapSizeInWords bits.
28 void Reset() { memset(Map, 0, sizeof(Map)); }
37 uintptr_t Old = Map[WordIdx];
39 Map[WordIdx] = New;
52 return Map[WordIdx] & (1UL << BitIdx);
61 if (uintptr_t M = Map[i])
68 uintptr_t Map[kMapSizeInWords] __attribute__((aligned(512)));
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| ValueMap.h | 1 //===- ValueMap.h - Safe map from Values to data ----------------*- C++ -*-===//
75 /// Returns a mutex that should be acquired around any changes to the map.
93 MapT Map;
104 : Map(NumInitBuckets), Data() {}
106 : Map(NumInitBuckets), Data(Data) {}
122 /// Get the mapped metadata, if it's in the map.
135 inline iterator begin() { return iterator(Map.begin()); }
136 inline iterator end() { return iterator(Map.end()); }
137 inline const_iterator begin() const { return const_iterator(Map.begin()); }
138 inline const_iterator end() const { return const_iterator(Map.end());
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| InfoByHwMode.h | 21 #include <map>
61 typedef std::map<unsigned,InfoT> MapType;
67 InfoByHwMode(const MapType &M) : Map(M) {}
70 iterator begin() { return Map.begin(); }
72 iterator end() { return Map.end(); }
74 const_iterator begin() const { return Map.begin(); }
76 const_iterator end() const { return Map.end(); }
78 bool empty() const { return Map.empty(); }
81 bool hasMode(unsigned M) const { return Map.find(M) != Map.end();
[all...] |
| InfoByHwMode.cpp | 35 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))});
54 return Map == T.Map;
60 return Map < T.Map;
64 auto F = Map.find(Mode);
65 if (F != Map.end())
67 // If Mode is not in the map, look up the default mode. If it exists,
69 auto D = Map.find(DefaultMode);
70 if (D != Map.end()
[all...] |
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| map.bench.cpp | 11 #include <map>
39 // - End contains a hint to the end of the map.
52 std::vector<std::map<uint64_t, int64_t> > Maps;
54 std::vector<typename std::map<uint64_t, int64_t>::const_iterator> >
77 auto& map = R.Maps.emplace_back(); local
80 hints.push_back(map.insert(std::make_pair(2 * I + 2, 0)).first);
103 benchmark::DoNotOptimize(std::map<uint64_t, int64_t>());
115 auto& Map = Data.Maps.front();
119 std::map<uint64_t, int64_t>(Map.begin(), Map.end()))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Serialization/ |
| ModuleFile.cpp | 34 const ContinuousRangeMap<Key, Offset, InitialCapacity> &Map) {
35 if (Map.begin() == Map.end())
41 for (typename MapType::const_iterator I = Map.begin(), IEnd = Map.end();
62 dumpLocalRemap("Source location offset local -> global map", SLocRemap);
66 dumpLocalRemap("Identifier ID local -> global map", IdentifierRemap);
70 dumpLocalRemap("Macro ID local -> global map", MacroRemap);
74 dumpLocalRemap("Submodule ID local -> global map", SubmoduleRemap);
78 dumpLocalRemap("Selector ID local -> global map", SelectorRemap)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| UniqueVector.h | 14 #include <map>
31 // Map - Used to handle the correspondence of entry to ID.
32 std::map<T, unsigned> Map;
41 // Check if the entry is already in the map.
42 unsigned &Val = Map[Entry];
58 // Search for entry in the map.
59 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
62 if (MI != Map.end()) return MI->second
[all...] |
| MapVector.h | 1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===//
9 // This file implements a map that provides insertion order iteration. The
31 /// This class implements a map that also provides access to all stored values
38 MapType Map;
43 "The mapped_type of the specified Map must be an integral type");
56 Map.clear();
65 Map.reserve(NumEntries);
89 Map.clear();
94 std::swap(Map, RHS.Map);
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Pointer.cpp | 142 InitMap *Map = getInitMap();
143 if (!Map)
145 if (Map == (InitMap *)-1)
147 return Map->isInitialized(getIndex());
160 InitMap *&Map = getInitMap();
161 if (Map == (InitMap *)-1)
163 if (Map == nullptr)
164 Map = InitMap::allocate(Desc->getNumElems());
165 if (Map->initialize(getIndex())) {
166 free(Map);
[all...] |
| /src/usr.sbin/ypserv/yptest/ |
| yptest.c | 52 const char *Map = "passwd.byname";
71 Status = yp_match(Domain, Map, Key, KeyLen, &Value, &ValLen);
78 Status = yp_first(Domain, Map, &Key2, &KeyLen, &Value, &ValLen);
87 Status = yp_next(Domain, Map, Key2, KeyLen, &Key2,
97 Status = yp_master(Domain, Map, &Key2);
104 Status = yp_order(Domain, Map, &Order);
127 Status = yp_all(Domain, Map, &Callback);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Lex/ |
| DirectoryLookup.h | 43 /// Map - This is the HeaderMap if this is a headermap lookup.
45 const HeaderMap *Map;
48 DLU(const HeaderMap *Map) : Map(Map) {}
59 /// Whether this is a header map used when building a framework.
74 /// This ctor *does not take ownership* of 'Map'.
75 DirectoryLookup(const HeaderMap *Map, SrcMgr::CharacteristicKind DT,
77 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap),
107 return isHeaderMap() ? u.Map : nullptr
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| IntervalMap.h | 22 * Interval Map implementation.
24 * Interval Map makes the following assumptions:
33 #include <Map.h>
36 class IntervalMap : public Map<Key_t, Value_t>
44 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
130 return get (key, Map<Key_t, Value_t>::REL_EQ);
135 IntervalMap<Key_t, Value_t>::get (Key_t key, typename Map<Key_t, Value_t>::Relation rel)
146 case Map<Key_t, Value_t>::REL_LT:
152 case Map<Key_t, Value_t>::REL_GT:
158 case Map<Key_t, Value_t>::REL_LE
[all...] |
| Map.h | 27 class Map
40 virtual ~Map () { };
|
| ExpGroup.h | 25 #include "Map.h"
43 Map <LoadObject*, int> *loadObjsMap;
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| IntervalMap.h | 22 * Interval Map implementation.
24 * Interval Map makes the following assumptions:
33 #include <Map.h>
36 class IntervalMap : public Map<Key_t, Value_t>
44 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
130 return get (key, Map<Key_t, Value_t>::REL_EQ);
135 IntervalMap<Key_t, Value_t>::get (Key_t key, typename Map<Key_t, Value_t>::Relation rel)
146 case Map<Key_t, Value_t>::REL_LT:
152 case Map<Key_t, Value_t>::REL_GT:
158 case Map<Key_t, Value_t>::REL_LE
[all...] |
| Map.h | 27 class Map
40 virtual ~Map () { };
|
| ExpGroup.h | 25 #include "Map.h"
43 Map <LoadObject*, int> *loadObjsMap;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/ |
| tsan_dense_alloc_test.cc | 20 #include <map>
40 int *v = alloc.Map(idx);
46 int *v = alloc.Map(idx);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| RDFRegisters.h | 18 #include <map>
31 // Template class for a map translating uint32_t into arbitrary types.
32 // The map will act like an indexed set: upon insertion of a new object,
37 IndexedSet() { Map.reserve(N); }
40 // Index Idx corresponds to Map[Idx-1].
41 assert(Idx != 0 && !Map.empty() && Idx-1 < Map.size());
42 return Map[Idx-1];
47 auto F = llvm::find(Map, Val);
48 if (F != Map.end()
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/ |
| HashTable.h | 43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index,
45 : Map(&Map), Index(Index), IsEnd(IsEnd) {}
48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) {
49 int I = Map.Present.find_first();
61 Map = R.Map;
70 return (Map == R.Map) && (Index == R.Index)
[all...] |
