| /system/extras/memory_replay/ |
| 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...] |
| Pointers.h | 28 class Pointers {
30 explicit Pointers(size_t max_allocs);
31 virtual ~Pointers();
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| hlo_matchers.h | 237 // Helper to convert smart to raw pointers for matching.
239 std::vector<const HloInstruction*> Pointers(const Container& container) {
|
| /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...] |
| /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)
|
| /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/include/llvm/IR/ |
| DataLayout.h | 127 PointersTy Pointers;
201 Pointers = DL.Pointers;
313 /// Return target's alignment for stack-based pointers
332 /// If this function is called with a vector of pointers, then the type size
334 /// vector of pointers.
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| DataLayout.h | 140 PointersTy Pointers;
152 /// Pointers in these address spaces are non-integral, and don't have a
195 Pointers = DL.Pointers;
309 /// Return target's alignment for stack-based pointers
319 /// Return the address spaces containing non-integral pointers. Pointers in
345 /// If this function is called with a vector of pointers, then the type size
347 /// vector of pointers.
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| DataLayout.h | 140 PointersTy Pointers;
152 /// Pointers in these address spaces are non-integral, and don't have a
195 Pointers = DL.Pointers;
309 /// Return target's alignment for stack-based pointers
319 /// Return the address spaces containing non-integral pointers. Pointers in
345 /// If this function is called with a vector of pointers, then the type size
347 /// vector of pointers.
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 316 // If the start pointers are the same, we just have to compare sizes to see if
330 // If we can't resolve the same pointers to the same object, then we can't
341 // Okay, we have stores to two completely different pointers. Try to
343 // pointers are equal, then we can reason about the two stores.
349 // If the base pointers still differ, we have two completely different stores.
473 /// trivially removed) but a case where two pointers may alias.
679 // Find all of the alloca'd pointers in the entry block.
706 SmallVector<Value *, 4> Pointers;
707 GetUnderlyingObjects(getStoredPointerOperand(&*BBI), Pointers, DL);
711 for (Value *Pointer : Pointers)
[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/darwin-x86/clang-4393122/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-4479392/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-4579689/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// 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...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/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-4479392/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-4579689/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /external/clang/test/SemaCXX/ |
| constant-expression-cxx11.cpp | 227 namespace Pointers {
[all...] |
