/system/extras/memory_replay/ |
Action.h | 22 class Pointers; 29 virtual uint64_t Execute(Pointers* pointers) = 0;
|
Pointers.h | 28 class Pointers { 30 explicit Pointers(size_t max_allocs); 31 virtual ~Pointers();
|
Thread.h | 25 class Pointers; 42 void set_pointers(Pointers* pointers) { pointers_ = pointers; } 43 Pointers* pointers() { return pointers_; } function in class:Thread 56 Pointers* pointers_ = nullptr;
|
Pointers.cpp | 27 #include "Pointers.h" 29 Pointers::Pointers(size_t max_allocs) { 45 Pointers::~Pointers() { 52 void Pointers::Add(uintptr_t key_pointer, void* pointer) { 61 void* Pointers::Remove(uintptr_t key_pointer) { 77 pointer_data* Pointers::Find(uintptr_t key_pointer) { 90 pointer_data* Pointers::FindEmpty(uintptr_t key_pointer) { 105 size_t Pointers::GetHash(uintptr_t key_pointer) [all...] |
Threads.h | 23 class Pointers; 28 Threads(Pointers* pointers, size_t max_threads); 42 Pointers* pointers_ = nullptr;
|
Action.cpp | 30 #include "Pointers.h" 45 uint64_t Execute(Pointers*) override { return 0; } 65 uint64_t Execute(Pointers* pointers) override { 71 pointers->Add(key_pointer_, memory); 85 uint64_t Execute(Pointers* pointers) override { 91 pointers->Add(key_pointer_, memory); 110 uint64_t Execute(Pointers* pointers) override [all...] |
Android.mk | 7 Pointers.cpp \
|
/system/extras/memory_replay/tests/ |
PointersTest.cpp | 19 #include "Pointers.h" 22 Pointers pointers(1); 24 pointers.Add(0x1234, reinterpret_cast<void*>(0xabcd)); 25 void* memory_pointer = pointers.Remove(0x1234); 30 Pointers pointers(1); 32 pointers.Add(0x1234, reinterpret_cast<void*>(0xabcd)); 33 void* memory_pointer = pointers.Remove(0x1234); 35 pointers.Add(0x1234, reinterpret_cast<void*>(0x5555)) [all...] |
ThreadsTest.cpp | 20 #include "Pointers.h" 25 Pointers pointers(2); 27 Threads threads(&pointers, 1); 45 Pointers pointers(4); 47 Threads threads(&pointers, 1); 87 Pointers pointers(4); 89 Threads threads(&pointers, 1) [all...] |
ActionTest.cpp | 22 #include "Pointers.h" 32 Pointers pointers(1); 33 action->Execute(&pointers); 34 void* pointer = pointers.Remove(0x1234); 54 Pointers pointers(1); 55 pointers.Add(0x1234, malloc(10)); 56 action->Execute(&pointers); 67 Pointers pointers(1) [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
AliasAnalysisEvaluator.cpp | 13 // pointers in the function. 134 SetVector<Value *> Pointers; 139 Pointers.insert(I); 143 Pointers.insert(&*I); 149 Pointers.insert(Callee); 154 Pointers.insert(*AI); 161 Pointers.insert(*OI); 167 errs() << "Function: " << F.getName() << ": " << Pointers.size() 168 << " pointers, " << CallSites.size() << " call sites\n"; 171 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end() [all...] |
/external/llvm/lib/Analysis/ |
AliasAnalysisEvaluator.cpp | 101 SetVector<Value *> Pointers; 108 Pointers.insert(&I); 112 Pointers.insert(&*I); 122 Pointers.insert(Callee); 126 Pointers.insert(DataOp); 133 Pointers.insert(*OI); 139 errs() << "Function: " << F.getName() << ": " << Pointers.size() 140 << " pointers, " << CallSites.size() << " call sites\n"; 143 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end() [all...] |
LoopAccessAnalysis.cpp | 187 Pointers.emplace_back(Ptr, ScStart, ScEnd, WritePtr, DepSetId, ASId, Sc); 237 const SCEV *Start = RtCheck.Pointers[Index].Start; 238 const SCEV *End = RtCheck.Pointers[Index].End; 267 // - We know that pointers in the same equivalence class share 269 // that we can compare pointers 270 // - We wouldn't be able to merge two pointers for which we need 272 // conveniently built such that no two pointers in the same 284 // If we need to check two pointers to the same underlying object 286 // grouping with those pointers. This is because we can easily get 303 // separate checking groups for all pointers [all...] |
/external/llvm/unittests/Analysis/ |
AliasAnalysisTest.cpp | 48 SetVector<Value *> Pointers; 51 Pointers.insert(&A); 54 Pointers.insert(&I); 56 for (Value *P1 : Pointers) 57 for (Value *P2 : Pointers)
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will 300 /// that a group of pointers do not overlap. 314 /// Holds the id of the set of pointers that could be dependent because of a 335 Pointers.clear(); 349 bool empty() const { return Pointers.empty(); } 351 /// A grouping of pointers. A single memcheck is required between 357 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 358 Low(RtCheck.Pointers[Index].Start) { 374 /// pointers in this group. 377 /// pointers in this group [all...] |
/device/linaro/bootloader/edk2/UefiCpuPkg/ResetVector/Vtf0/X64/ |
PageTables.asm | 52 ; Top level Page Directory Pointers (1 * 512GB entry)
58 ; Next level Page Directory Pointers (4 * 1GB entries => 4GB)
|
/external/llvm/lib/IR/ |
DataLayout.cpp | 392 Alignments == Other.Alignments && Pointers == Other.Pointers; 431 return std::lower_bound(Pointers.begin(), Pointers.end(), AddressSpace, 445 if (I == Pointers.end() || I->AddressSpace != AddrSpace) { 446 Pointers.insert(I, PointerAlignElem::get(AddrSpace, ABIAlign, PrefAlign, 547 Pointers.clear(); 582 if (I == Pointers.end() || I->AddressSpace != AS) { 591 if (I == Pointers.end() || I->AddressSpace != AS) { 600 if (I == Pointers.end() || I->AddressSpace != AS) [all...] |
/external/llvm/include/llvm/Analysis/ |
LoopAccessAnalysis.h | 95 /// different underlying pointers. Clients, such as the loop vectorizer, will 331 /// that a group of pointers do not overlap. 343 /// Holds the id of the set of pointers that could be dependent because of a 364 Pointers.clear(); 378 bool empty() const { return Pointers.empty(); } 380 /// A grouping of pointers. A single memcheck is required between 386 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End), 387 Low(RtCheck.Pointers[Index].Start) { 403 /// pointers in this group. 406 /// pointers in this group [all...] |