/external/llvm/include/llvm/IR/ |
ValueSymbolTable.h | 46 typedef StringMap<Value*> ValueMap; 48 /// @brief An iterator over a ValueMap. 49 typedef ValueMap::iterator iterator; 51 /// @brief A const_iterator over a ValueMap. 52 typedef ValueMap::const_iterator const_iterator; 125 ValueMap vmap; ///< The map that holds the symbol table.
|
ValueMap.h | 1 //===- ValueMap.h - Safe map from Values to data ----------------*- C++ -*-===// 10 // This file defines the ValueMap class. ValueMap maps Value* or any subclass 17 // You can override a ValueMap's Config parameter to control exactly what 19 // legal to call back into the ValueMap from a Config's callbacks. Config 21 // implementations of all the methods ValueMap uses. See ValueMapConfig for 46 /// ValueMap<>. User Configs should inherit from this class to be as compatible 47 /// as possible with future versions of ValueMap. 52 /// If FollowRAUW is true, the ValueMap will update mappings on RAUW. If it's 53 /// false, the ValueMap will leave the original mapping in place [all...] |
/external/chromium_org/chrome/browser/content_settings/ |
content_settings_default_provider.h | 71 typedef std::map<ContentSettingsType, ValuePtr> ValueMap; 73 ValueMap default_settings_;
|
/external/chromium_org/components/policy/core/common/ |
registry_dict_win.h | 39 CaseInsensitiveStringCompare> ValueMap; 80 const ValueMap& values() const { return values_; } 84 ValueMap values_;
|
preg_parser_win_unittest.cc | 39 RegistryDict::ValueMap::const_iterator iter_value_a(a.values().begin()); 40 RegistryDict::ValueMap::const_iterator iter_value_b(b.values().begin());
|
registry_dict_win.cc | 186 ValueMap::iterator entry = values_.find(name); 191 ValueMap::const_iterator entry = values_.find(name); 209 ValueMap::iterator entry = values_.find(name); 230 for (ValueMap::const_iterator entry(other.values_.begin()); 300 for (RegistryDict::ValueMap::const_iterator entry(values_.begin());
|
/external/llvm/unittests/IR/ |
ValueMapTest.cpp | 1 //===- llvm/unittest/ADT/ValueMapTest.cpp - ValueMap unit tests -*- C++ -*-===// 10 #include "llvm/IR/ValueMap.h" 42 ValueMap<TypeParam*, int> VM1; 48 ValueMap<TypeParam*, int> VM; 62 ValueMap<TypeParam*, int> VM; 63 ValueMap<TypeParam*, int> VM2(16); (void)VM2; 65 ValueMap<TypeParam*, int> VM3(Data, 16); (void)VM3; 71 typename ValueMap<TypeParam*, int>::iterator I = 79 const ValueMap<TypeParam*, int> &CVM = VM; 80 typename ValueMap<TypeParam*, int>::const_iterator CI [all...] |
/external/llvm/include/llvm/CodeGen/ |
FunctionLoweringInfo.h | 70 /// ValueMap - Since we emit code for the function a basic block at a time, 73 DenseMap<const Value*, unsigned> ValueMap; 139 return ValueMap.count(V); 147 unsigned &R = ValueMap[V]; 193 // PHIs with no uses have no ValueMap entry. 194 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); 195 if (It == ValueMap.end())
|
StackProtector.h | 23 #include "llvm/IR/ValueMap.h" 48 typedef ValueMap<const AllocaInst *, SSPLayoutKind> SSPLayoutMap;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
nv50_ir_build_util.h | 125 typedef bimap<Location, Value *> ValueMap; 136 inline bool exists(ValueMap&, unsigned int i, unsigned int c); 138 Value *load(ValueMap&, int i, int c, Value *ptr); 139 void store(ValueMap&, int i, int c, Value *ptr, Value *value); 140 Value *acquire(ValueMap&, int i, int c); 143 inline Value *lookup(ValueMap&, unsigned i, unsigned c); 144 inline Value *insert(ValueMap&, unsigned i, unsigned c, Value *v); 286 BuildUtil::DataArray::exists(ValueMap &m, unsigned int i, unsigned int c) 293 BuildUtil::DataArray::lookup(ValueMap &m, unsigned i, unsigned c) 295 ValueMap::r_iterator it = m.r.find(Location(array, arrayIdx, i, c)) [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
nv50_ir_build_util.h | 125 typedef bimap<Location, Value *> ValueMap; 136 inline bool exists(ValueMap&, unsigned int i, unsigned int c); 138 Value *load(ValueMap&, int i, int c, Value *ptr); 139 void store(ValueMap&, int i, int c, Value *ptr, Value *value); 140 Value *acquire(ValueMap&, int i, int c); 143 inline Value *lookup(ValueMap&, unsigned i, unsigned c); 144 inline Value *insert(ValueMap&, unsigned i, unsigned c, Value *v); 286 BuildUtil::DataArray::exists(ValueMap &m, unsigned int i, unsigned int c) 293 BuildUtil::DataArray::lookup(ValueMap &m, unsigned i, unsigned c) 295 ValueMap::r_iterator it = m.r.find(Location(array, arrayIdx, i, c)) [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopRotation.cpp | 128 ValueToValueMapTy &ValueMap) { 145 Value *OrigPreHeaderVal = ValueMap[OrigHeaderVal]; 369 // Begin by walking OrigHeader and populating ValueMap with an entry for 372 ValueToValueMapTy ValueMap; 377 ValueMap[PN] = PN->getIncomingValueForBlock(OrigPreheader); 403 RemapInstruction(C, ValueMap, 414 ValueMap[Inst] = V; 419 ValueMap[Inst] = C; 439 RewriteUsesOfClonedInstructions(OrigHeader, OrigPreheader, ValueMap);
|
/frameworks/compile/slang/BitWriter_2_9/ |
ValueEnumerator.cpp | 131 ValueMapType::const_iterator I = ValueMap.find(V); 132 assert(I != ValueMap.end() && "Value not in slotcalculator!"); 137 print(dbgs(), ValueMap, "Default"); 203 // Rebuild the modified portion of ValueMap. 205 ValueMap[Values[CstStart].first] = CstStart+1; 314 unsigned &ValueID = ValueMap[V]; 344 ValueMap[V] = Values.size(); 354 ValueMap[V] = Values.size(); 410 if (ValueMap.count(V)) return; 477 ValueMap[BB] = BasicBlocks.size() [all...] |
/frameworks/compile/slang/BitWriter_2_9_func/ |
ValueEnumerator.cpp | 131 ValueMapType::const_iterator I = ValueMap.find(V); 132 assert(I != ValueMap.end() && "Value not in slotcalculator!"); 137 print(dbgs(), ValueMap, "Default"); 203 // Rebuild the modified portion of ValueMap. 205 ValueMap[Values[CstStart].first] = CstStart+1; 314 unsigned &ValueID = ValueMap[V]; 344 ValueMap[V] = Values.size(); 354 ValueMap[V] = Values.size(); 410 if (ValueMap.count(V)) return; 477 ValueMap[BB] = BasicBlocks.size() [all...] |
/frameworks/compile/slang/BitWriter_3_2/ |
ValueEnumerator.cpp | 131 ValueMapType::const_iterator I = ValueMap.find(V); 132 assert(I != ValueMap.end() && "Value not in slotcalculator!"); 137 print(dbgs(), ValueMap, "Default"); 203 // Rebuild the modified portion of ValueMap. 205 ValueMap[Values[CstStart].first] = CstStart+1; 314 unsigned &ValueID = ValueMap[V]; 344 ValueMap[V] = Values.size(); 354 ValueMap[V] = Values.size(); 410 if (ValueMap.count(V)) return; 477 ValueMap[BB] = BasicBlocks.size() [all...] |
/art/compiler/dex/ |
global_value_numbering.h | 77 typedef ScopedArenaSafeMap<uint64_t, uint16_t> ValueMap; 88 ValueMap::iterator lb = global_value_map_.lower_bound(key); 106 ValueMap::const_iterator it = global_value_map_.find(key); 228 ValueMap global_value_map_;
|
/external/llvm/include/llvm/Transforms/Utils/ |
ValueMapper.h | 18 #include "llvm/IR/ValueMap.h" 23 typedef ValueMap<const Value *, WeakVH> ValueToValueMapTy;
|
/external/llvm/lib/Target/Mips/ |
MipsMachineFunction.h | 24 #include "llvm/IR/ValueMap.h" 141 ValueMap<const GlobalValue *, const MipsCallEntry *> GlobalCallEntries;
|
/external/llvm/lib/Bitcode/Writer/ |
ValueEnumerator.cpp | 137 ValueMapType::const_iterator I = ValueMap.find(V); 138 assert(I != ValueMap.end() && "Value not in slotcalculator!"); 143 print(dbgs(), ValueMap, "Default"); 198 // Rebuild the modified portion of ValueMap. 200 ValueMap[Values[CstStart].first] = CstStart+1; 309 unsigned &ValueID = ValueMap[V]; 343 ValueMap[V] = Values.size(); 399 if (ValueMap.count(V)) return; 466 ValueMap[BB] = BasicBlocks.size(); 509 /// Remove purged values from the ValueMap [all...] |
ValueEnumerator.h | 51 ValueMapType ValueMap; 78 /// incorporated function. Their reverse mapping is stored in ValueMap.
|
/external/llvm/lib/CodeGen/ |
SplitKit.h | 274 typedef DenseMap<std::pair<unsigned, unsigned>, ValueForcePair> ValueMap; 288 ValueMap Values;
|
/external/llvm/lib/Linker/ |
LinkModules.cpp | 387 /// ValueMap - Mapping of values from what they used to be in Src, to what 388 /// they are now in DstM. ValueToValueMapTy is a ValueMap, which involves 391 ValueToValueMapTy ValueMap; [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
FunctionLoweringInfo.cpp | 203 unsigned PHIReg = ValueMap[PN]; 233 ValueMap.clear(); 322 unsigned DestReg = ValueMap[PN]; 343 assert(ValueMap.count(V) && "V should have been placed in ValueMap when its" 345 unsigned SrcReg = ValueMap[V]; 380 assert(ValueMap.count(V) && "V should have been placed in ValueMap when " 382 unsigned SrcReg = ValueMap[V];
|
/external/chromium_org/base/ |
values.h | 43 typedef std::map<std::string, Value*> ValueMap; 361 ValueMap::const_iterator it_; 369 ValueMap dictionary_;
|
/external/lldb/include/lldb/DataFormatters/ |
FormatManager.h | 36 typedef ValueNavigator::MapType ValueMap;
|