| /system/extras/memory_replay/ |
| Action.h | 22 class Pointers;
29 virtual uint64_t Execute(Pointers* pointers) = 0;
|
| Pointers.h | 28 class Pointers {
30 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 \
|
| main.cpp | 32 #include "Pointers.h"
71 Pointers pointers(max_allocs);
72 Threads threads(&pointers, max_threads);
76 printf("Total pointers available: %zu\n", pointers.max_pointers());
145 // Free any outstanding pointers.
149 pointers.FreeAll();
184 // pointers needed at once.
|
| Threads.cpp | 38 thread->AddTimeNsecs(action->Execute(thread->pointers()));
48 Threads::Threads(Pointers* pointers, size_t max_threads)
49 : pointers_(pointers), max_threads_(max_threads) {
|
| /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...] |
| ThreadTest.cpp | 24 #include "Pointers.h"
94 TEST(ThreadTest, pointers) {
95 Pointers pointers(2);
98 ASSERT_TRUE(thread.pointers() == nullptr);
99 thread.set_pointers(&pointers);
100 ASSERT_TRUE(thread.pointers() == &pointers);
|
| /external/llvm/lib/Analysis/ |
| AliasAnalysisEvaluator.cpp | 13 // pointers in the function.
147 SetVector<Value *> Pointers;
154 Pointers.insert(&I);
158 Pointers.insert(&*I);
168 Pointers.insert(Callee);
173 Pointers.insert(*AI);
180 Pointers.insert(*OI);
186 errs() << "Function: " << F.getName() << ": " << Pointers.size()
187 << " pointers, " << CallSites.size() << " call sites\n";
190 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
[all...] |
| LoopAccessAnalysis.cpp | 155 Pointers.emplace_back(Ptr, ScStart, ScEnd, WritePtr, DepSetId, ASId, Sc);
205 const SCEV *Start = RtCheck.Pointers[Index].Start;
206 const SCEV *End = RtCheck.Pointers[Index].End;
235 // - We know that pointers in the same equivalence class share
237 // that we can compare pointers
238 // - We wouldn't be able to merge two pointers for which we need
240 // conveniently built such that no two pointers in the same
252 // If we need to check two pointers to the same underlying object
254 // grouping with those pointers. This is because we can easily get
271 // separate checking groups for all pointers
[all...] |
| /external/llvm/unittests/Analysis/ |
| AliasAnalysisTest.cpp | 49 SetVector<Value *> Pointers;
52 Pointers.insert(&A);
55 Pointers.insert(&I);
57 for (Value *P1 : Pointers)
58 for (Value *P2 : Pointers)
|
| /external/llvm/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 95 /// different underlying pointers. Clients, such as the loop vectorizer, will
328 /// that a group of pointers do not overlap.
340 /// Holds the id of the set of pointers that could be dependent because of a
361 Pointers.clear();
375 bool empty() const { return Pointers.empty(); }
377 /// A grouping of pointers. A single memcheck is required between
383 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
384 Low(RtCheck.Pointers[Index].Start) {
400 /// pointers in this group.
403 /// pointers in this group
[all...] |
| /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/IR/ |
| DataLayout.h | 130 PointersTy Pointers;
204 Pointers = DL.Pointers;
316 /// Return target's alignment for stack-based pointers
335 /// If this function is called with a vector of pointers, then the type size
337 /// vector of pointers.
|
| /prebuilts/go/darwin-x86/misc/cgo/test/ |
| issue10303.go | 5 // Issue 10303. Pointers passed to C were not marked as escaping (bug in cgo).
|
| /prebuilts/go/linux-x86/misc/cgo/test/ |
| issue10303.go | 5 // Issue 10303. Pointers passed to C were not marked as escaping (bug in cgo).
|
| /external/javassist/src/main/javassist/bytecode/ |
| CodeIterator.java | 1055 Pointers pointers = new Pointers(0, 0, 0, etable, ca); local
1094 Pointers pointers = new Pointers(currentPos, mark, where, etable, ca); local
[all...] |
| /prebuilts/go/darwin-x86/doc/progs/ |
| go1.go | 126 // Pointers, fully qualified, always legal.
132 // Pointers, type name elided; legal in Go 1.
|
| /prebuilts/go/linux-x86/doc/progs/ |
| go1.go | 126 // Pointers, fully qualified, always legal.
132 // Pointers, type name elided; legal in Go 1.
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 350 // If the start pointers are the same, we just have to compare sizes to see if
376 // If we can't resolve the same pointers to the same object, then we can't
387 // Okay, we have stores to two completely different pointers. Try to
389 // pointers are equal, then we can reason about the two stores.
395 // If the base pointers still differ, we have two completely different stores.
445 /// trivially removed) but a case where two pointers may alias.
799 // Find all of the alloca'd pointers in the entry block.
826 SmallVector<Value *, 4> Pointers;
827 GetUnderlyingObjects(getStoredPointerOperand(&*BBI), Pointers, DL);
831 for (SmallVectorImpl<Value *>::iterator I = Pointers.begin()
[all...] |
