| /external/google-breakpad/src/processor/ |
| cfi_frame_info-inl.h | 51 typedef CFIFrameInfo::RegisterValueMap<RegisterType> ValueMap;
52 ValueMap callee_registers;
53 ValueMap caller_registers;
55 typename ValueMap::const_iterator caller_none = caller_registers.end();
75 typename ValueMap::const_iterator caller_entry;
|
| /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
49 /// ValueMap<>. User Configs should inherit from this class to be as compatible
50 /// as possible with future versions of ValueMap.
55 /// If FollowRAUW is true, the ValueMap will update mappings on RAUW. If it's
56 /// false, the ValueMap will leave the original mapping in place
[all...] |
| /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 | 75 /// ValueMap - Since we emit code for the function a basic block at a time,
78 DenseMap<const Value *, unsigned> ValueMap;
161 return ValueMap.count(V);
172 unsigned &R = ValueMap[V];
218 // PHIs with no uses have no ValueMap entry.
219 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN);
220 if (It == ValueMap.end())
|
| StackProtector.h | 23 #include "llvm/IR/ValueMap.h"
48 typedef ValueMap<const AllocaInst *, SSPLayoutKind> SSPLayoutMap;
|
| PseudoSourceValue.h | 20 #include "llvm/IR/ValueMap.h"
148 ValueMap<const GlobalValue *,
|
| /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...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| ValueEnumerator.cpp | 137 ValueMapType::const_iterator I = ValueMap.find(V);
138 assert(I != ValueMap.end() && "Value not in slotcalculator!");
143 print(dbgs(), ValueMap, "Default");
221 // Rebuild the modified portion of ValueMap.
223 ValueMap[Values[CstStart].first] = CstStart+1;
311 unsigned &ValueID = ValueMap[V];
341 ValueMap[V] = Values.size();
351 ValueMap[V] = Values.size();
417 if (ValueMap.count(C))
478 ValueMap[&*BB] = BasicBlocks.size()
[all...] |
| ValueEnumerator.h | 55 ValueMapType ValueMap;
83 /// incorporated function. Their reverse mapping is stored in ValueMap.
|
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| ValueEnumerator.cpp | 137 ValueMapType::const_iterator I = ValueMap.find(V);
138 assert(I != ValueMap.end() && "Value not in slotcalculator!");
143 print(dbgs(), ValueMap, "Default");
221 // Rebuild the modified portion of ValueMap.
223 ValueMap[Values[CstStart].first] = CstStart+1;
311 unsigned &ValueID = ValueMap[V];
341 ValueMap[V] = Values.size();
351 ValueMap[V] = Values.size();
417 if (ValueMap.count(C))
478 ValueMap[&*BB] = BasicBlocks.size()
[all...] |
| ValueEnumerator.h | 55 ValueMapType ValueMap;
83 /// incorporated function. Their reverse mapping is stored in ValueMap.
|
| /frameworks/compile/slang/BitWriter_3_2/ |
| ValueEnumerator.cpp | 137 ValueMapType::const_iterator I = ValueMap.find(V);
138 assert(I != ValueMap.end() && "Value not in slotcalculator!");
143 print(dbgs(), ValueMap, "Default");
221 // Rebuild the modified portion of ValueMap.
223 ValueMap[Values[CstStart].first] = CstStart+1;
311 unsigned &ValueID = ValueMap[V];
341 ValueMap[V] = Values.size();
351 ValueMap[V] = Values.size();
417 if (ValueMap.count(C))
478 ValueMap[&*BB] = BasicBlocks.size()
[all...] |
| ValueEnumerator.h | 58 ValueMapType ValueMap;
86 /// incorporated function. Their reverse mapping is stored in ValueMap.
|
| /external/llvm/lib/Linker/ |
| IRMover.cpp | 386 /// in DstM. ValueToValueMapTy is a ValueMap, which involves some overhead
389 ValueToValueMapTy ValueMap;
502 void findNeededSubprograms(ValueToValueMapTy &ValueMap);
[all...] |
| /external/llvm/lib/CodeGen/ |
| SplitKit.h | 274 typedef DenseMap<std::pair<unsigned, unsigned>, ValueForcePair> ValueMap;
288 ValueMap Values;
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRotation.cpp | 55 ValueToValueMapTy &ValueMap) {
72 Value *OrigPreHeaderVal = ValueMap[OrigHeaderVal];
204 // Begin by walking OrigHeader and populating ValueMap with an entry for
207 ValueToValueMapTy ValueMap;
212 ValueMap[PN] = PN->getIncomingValueForBlock(OrigPreheader);
240 RemapInstruction(C, ValueMap,
252 ValueMap[Inst] = V;
257 ValueMap[Inst] = C;
277 RewriteUsesOfClonedInstructions(OrigHeader, OrigPreheader, ValueMap);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| ValueMapper.h | 18 #include "llvm/IR/ValueMap.h"
23 typedef ValueMap<const Value *, WeakVH> ValueToValueMapTy;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| FunctionLoweringInfo.cpp | 258 unsigned PHIReg = ValueMap[PN];
333 ValueMap.clear();
419 unsigned DestReg = ValueMap[PN];
440 assert(ValueMap.count(V) && "V should have been placed in ValueMap when its"
442 unsigned SrcReg = ValueMap[V];
477 assert(ValueMap.count(V) && "V should have been placed in ValueMap when "
479 unsigned SrcReg = ValueMap[V];
|
| /external/llvm/lib/ProfileData/ |
| InstrProf.cpp | 246 ValueMapType *ValueMap) {
247 if (!ValueMap)
252 std::lower_bound(ValueMap->begin(), ValueMap->end(), Value,
255 if (Result != ValueMap->end())
265 ValueMapType *ValueMap) {
267 VData[I].Value = remapValue(VData[I].Value, ValueKind, ValueMap);
|
| /external/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 400 ValueMapType::const_iterator I = ValueMap.find(V);
401 assert(I != ValueMap.end() && "Value not in slotcalculator!");
406 print(dbgs(), ValueMap, "Default");
478 // Rebuild the modified portion of ValueMap.
480 ValueMap[Values[CstStart].first] = CstStart+1;
567 unsigned &ValueID = ValueMap[V];
601 ValueMap[V] = Values.size();
667 if (ValueMap.count(C))
723 ValueMap[&BB] = BasicBlocks.size();
757 /// Remove purged values from the ValueMap
[all...] |
| ValueEnumerator.h | 57 ValueMapType ValueMap;
89 /// incorporated function. Their reverse mapping is stored in ValueMap.
|
| /external/libchrome/base/ |
| values.h | 46 typedef std::map<std::string, Value*> ValueMap;
373 ValueMap::const_iterator it_;
383 ValueMap dictionary_;
|
| /external/libweave/third_party/chromium/base/ |
| values.h | 45 typedef std::map<std::string, Value*> ValueMap;
361 ValueMap::const_iterator it_;
371 ValueMap dictionary_;
|
| values.cc | 369 ValueMap::const_iterator current_entry = dictionary_.find(key);
375 ValueMap::iterator dict_iterator = dictionary_.begin();
435 std::pair<ValueMap::iterator, bool> ins_res =
611 ValueMap::const_iterator entry_iterator = dictionary_.find(key);
731 ValueMap::iterator entry_iterator = dictionary_.find(key);
802 for (ValueMap::const_iterator current_entry(dictionary_.begin());
|
