/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.
|
/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/chrome/browser/policy/ |
registry_dict_win.h | 37 CaseInsensitiveStringCompare> ValueMap; 79 const ValueMap& values() const { return values_; } 83 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 | 243 ValueMap::iterator entry = values_.find(name); 248 ValueMap::const_iterator entry = values_.find(name); 266 ValueMap::iterator entry = values_.find(name); 287 for (ValueMap::const_iterator entry(other.values_.begin()); 357 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/ADT/ValueMap.h" 43 ValueMap<TypeParam*, int> VM1; 49 ValueMap<TypeParam*, int> VM; 63 ValueMap<TypeParam*, int> VM; 64 ValueMap<TypeParam*, int> VM2(16); (void)VM2; 66 ValueMap<TypeParam*, int> VM3(Data, 16); (void)VM3; 72 typename ValueMap<TypeParam*, int>::iterator I = 80 const ValueMap<TypeParam*, int> &CVM = VM; 81 typename ValueMap<TypeParam*, int>::const_iterator CI [all...] |
/external/llvm/include/llvm/CodeGen/ |
FunctionLoweringInfo.h | 69 /// ValueMap - Since we emit code for the function a basic block at a time, 72 DenseMap<const Value*, unsigned> ValueMap; 138 return ValueMap.count(V); 146 unsigned &R = ValueMap[V]; 192 // PHIs with no uses have no ValueMap entry. 193 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); 194 if (It == ValueMap.end())
|
/external/llvm/include/llvm/ADT/ |
ValueMap.h | 1 //===- llvm/ADT/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. 50 /// If FollowRAUW is true, the ValueMap will update mappings on RAUW. If it's 51 /// false, the ValueMap will leave the original mapping in place [all...] |
/art/compiler/dex/ |
local_value_numbering.h | 30 typedef SafeMap<uint64_t, uint16_t> ValueMap; 46 ValueMap::iterator it = value_map_.find(key); 58 ValueMap::const_iterator it = value_map_.find(key); 135 ValueMap value_map_;
|
/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 | 104 ValueToValueMapTy &ValueMap) { 121 Value *OrigPreHeaderVal = ValueMap[OrigHeaderVal]; 344 // Begin by walking OrigHeader and populating ValueMap with an entry for 347 ValueToValueMapTy ValueMap; 352 ValueMap[PN] = PN->getIncomingValueForBlock(OrigPreheader); 378 RemapInstruction(C, ValueMap, 389 ValueMap[Inst] = V; 394 ValueMap[Inst] = C; 414 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...] |
/external/llvm/include/llvm/Transforms/Utils/ |
ValueMapper.h | 18 #include "llvm/ADT/ValueMap.h" 23 typedef ValueMap<const Value *, WeakVH> ValueToValueMapTy;
|
/external/chromium_org/third_party/icu/source/common/ |
propname.cpp | 160 const ValueMap* 164 return (const ValueMap*) (a ? getPointerNull(a) : NULL); 184 const ValueMap* vm = getValueMap(prop); 200 const ValueMap* vm = getValueMap(prop); 597 const ValueMap *inValueMaps; 598 ValueMap *outValueMaps; 599 ValueMap valueMap; 669 inValueMaps=(const ValueMap *)(inBytes+aliases.valueMap_offset); 670 outValueMaps=(ValueMap *)(outBytes+aliases.valueMap_offset) [all...] |
propname.h | 119 /* ValueMap */ 123 * enumerated properties), there is a ValueMap object. This object 135 struct ValueMap { 170 /* to ValueMap objects */ 187 const ValueMap* getValueMap(EnumValue prop) const; 475 * 4: # ValueMap array [x one for each enumerated prop i]
|
/external/llvm/lib/Bitcode/Writer/ |
ValueEnumerator.cpp | 129 ValueMapType::const_iterator I = ValueMap.find(V); 130 assert(I != ValueMap.end() && "Value not in slotcalculator!"); 135 print(dbgs(), ValueMap, "Default"); 201 // Rebuild the modified portion of ValueMap. 203 ValueMap[Values[CstStart].first] = CstStart+1; 312 unsigned &ValueID = ValueMap[V]; 342 ValueMap[V] = Values.size(); 398 if (ValueMap.count(V)) return; 465 ValueMap[BB] = BasicBlocks.size(); 508 /// Remove purged values from the ValueMap [all...] |
ValueEnumerator.h | 49 ValueMapType ValueMap; 72 /// incorporated function. Their reverse mapping is stored in ValueMap.
|
/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(); 400 if (ValueMap.count(V)) return; 467 ValueMap[BB] = BasicBlocks.size(); 510 /// Remove purged values from the ValueMap [all...] |
/external/llvm/lib/Linker/ |
LinkModules.cpp | 385 /// ValueMap - Mapping of values from what they used to be in Src, to what 386 /// they are now in DstM. ValueToValueMapTy is a ValueMap, which involves 389 ValueToValueMapTy ValueMap; 735 ValueMap[SrcGV] = ConstantExpr::getBitCast(NG, TypeMap.get(SrcGV->getType())); 779 ValueMap[SGV] = ConstantExpr::getBitCast(DGV,TypeMap.get(SGV->getType())); 809 ValueMap[SGV] = NewDGV; 833 ValueMap[SF] = ConstantExpr::getBitCast(DGV, TypeMap.get(SF->getType())); [all...] |
/external/llvm/lib/CodeGen/ |
SplitKit.h | 274 typedef DenseMap<std::pair<unsigned, unsigned>, ValueForcePair> ValueMap; 288 ValueMap Values;
|
/external/chromium/base/ |
values.h | 43 typedef std::map<std::string, Value*> ValueMap; 320 explicit key_iterator(ValueMap::const_iterator itr) { itr_ = itr; } 330 ValueMap::const_iterator itr_; 341 ValueMap dictionary_;
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
FunctionLoweringInfo.cpp | 167 unsigned PHIReg = ValueMap[PN]; 197 ValueMap.clear(); 286 unsigned DestReg = ValueMap[PN]; 307 assert(ValueMap.count(V) && "V should have been placed in ValueMap when its" 309 unsigned SrcReg = ValueMap[V]; 344 assert(ValueMap.count(V) && "V should have been placed in ValueMap when " 346 unsigned SrcReg = ValueMap[V];
|
/external/chromium_org/base/ |
values.h | 46 typedef std::map<std::string, Value*> ValueMap; 353 ValueMap::const_iterator it_; 361 ValueMap dictionary_;
|