OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Pointers
(Results
1 - 12
of
12
) sorted by null
/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
Pointers
(size_t max_allocs);
31
virtual ~
Pointers
();
/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/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
...]
/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
.
/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/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
...]
/external/clang/test/SemaCXX/
constant-expression-cxx11.cpp
227
namespace
Pointers
{
[
all
...]
/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
...]
/external/clang/lib/CodeGen/
CGOpenMPRuntime.cpp
[
all
...]
/external/guice/extensions/struts2/lib/
javassist.jar
/external/robolectric/v1/lib/main/
javassist-3.14.0-GA.jar
Completed in 982 milliseconds