| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68k/ |
| tls-ie-1.d | 7 Tag Type Name/Value
20 Offset Info Type Sym.Value Sym. Name \+ Addend
|
| tls-ld-1.d | 7 Tag Type Name/Value
20 Offset +Info +Type +Sym.Value +Sym. Name \+ Addend
|
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/ThreadReference/ |
| ForceEarlyReturnTest.java | 26 import org.apache.harmony.jpda.tests.framework.jdwp.Value;
52 static Value expectedValue;
60 private String toString(Value value) {
62 switch (value.getTag()) {
64 return (new Boolean(value.getBooleanValue())).toString();
66 return (new Byte(value.getByteValue())).toString();
68 return (new Character(value.getCharValue())).toString();
70 return (new Integer(value.getIntValue())).toString();
72 return (new Short(value.getShortValue())).toString()
[all...] |
| /external/llvm/lib/Analysis/ |
| Loads.cpp | 26 /// \brief Test if A and B will obviously have the same value.
29 /// value in code like this:
37 static bool AreEquivalentAddressValues(const Value *A, const Value *B) {
46 // value or one of them will have an undefined value.
57 /// \brief Check if executing a load of this pointer value cannot trap.
65 bool llvm::isSafeToLoadUnconditionally(Value *V, Instruction *ScanFrom,
75 Value *Base = V;
137 Value *AccessedPtr
[all...] |
| BasicAliasAnalysis.cpp | 56 /// careful with value equivalence. We use reachability to make sure a value
71 static bool isNonEscapingLocalObject(const Value *V) {
96 static bool isEscapeSource(const Value *V) {
110 static uint64_t getObjectSize(const Value *V, const DataLayout &DL,
121 static bool isObjectSmallerThan(const Value *V, uint64_t Size,
161 static bool isObjectSize(const Value *V, uint64_t Size, const DataLayout &DL,
171 /// Analyzes the specified value as a linear expression: "A*V + B", where A and
174 /// Returns the scale and offset values as APInts and return V as a Value*, and
176 /// Value is known to have IntegerType and it may already be sign or zer
[all...] |
| LazyValueInfo.cpp | 1 //===- LazyValueInfo.cpp - Value constraint analysis ------------*- C++ -*-===//
10 // This file defines the interface for lazy computation of value constraint
39 #define DEBUG_TYPE "lazy-value-info"
42 INITIALIZE_PASS_BEGIN(LazyValueInfo, "lazy-value-info",
43 "Lazy Value Information Analysis", false, true)
46 INITIALIZE_PASS_END(LazyValueInfo, "lazy-value-info",
47 "Lazy Value Information Analysis", false, true)
58 /// This is the information tracked by LazyValueInfo for each value.
66 /// This Value has no known value yet
[all...] |
| VectorUtils.cpp | 23 #include "llvm/IR/Value.h"
256 Value *llvm::stripGetElementPtr(Value *Ptr, ScalarEvolution *SE, Loop *Lp) {
272 /// \brief If a value has only one user that is a CastInst, return it.
273 Value *llvm::getUniqueCastUse(Value *Ptr, Loop *Lp, Type *Ty) {
274 Value *UniqueCast = nullptr;
289 Value *llvm::getStrideFromPointer(Value *Ptr, ScalarEvolution *SE, Loop *Lp) {
297 Value *OrigPtr = Ptr
[all...] |
| MemoryBuiltins.cpp | 82 static Function *getCalledFunction(const Value *V, bool LookThroughBitCast) {
86 CallSite CS(const_cast<Value*>(V));
99 /// \brief Returns the allocation data for the given value if it is a call to a
101 static const AllocFnsTy *getAllocationData(const Value *V, AllocType AllocTy,
145 static bool hasNoAliasAttr(const Value *V, bool LookThroughBitCast) {
151 /// \brief Tests if a value is a call or invoke to a library function that
154 bool llvm::isAllocationFn(const Value *V, const TargetLibraryInfo *TLI,
159 /// \brief Tests if a value is a call or invoke to a function that returns a
161 bool llvm::isNoAliasFn(const Value *V, const TargetLibraryInfo *TLI,
169 /// \brief Tests if a value is a call or invoke to a library function tha
[all...] |
| /external/llvm/lib/Target/SystemZ/InstPrinter/ |
| SystemZInstPrinter.cpp | 65 int64_t Value = MI->getOperand(OpNum).getImm();
66 assert(isUInt<N>(Value) && "Invalid uimm argument");
67 O << Value;
72 int64_t Value = MI->getOperand(OpNum).getImm();
73 assert(isInt<N>(Value) && "Invalid simm argument");
74 O << Value;
139 uint64_t Value = MI->getOperand(OpNum).getImm();
140 assert(Value < 16 && "Invalid access register number");
141 O << "%a" << (unsigned int)Value;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 35 bool llvm::objcarc::CanAlterRefCount(const Instruction *Inst, const Value *Ptr,
59 const Value *Op = *I;
72 const Value *Ptr,
85 bool llvm::objcarc::CanUse(const Instruction *Inst, const Value *Ptr,
106 const Value *Op = *OI;
113 // Special-case stores, because we don't care about the stored value, just
115 const Value *Op = GetUnderlyingObjCPtr(SI->getPointerOperand(), DL);
125 const Value *Op = *OI;
136 const Value *Arg, ProvenanceAnalysis &PA) {
224 const Value *Arg
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopIdiomRecognize.cpp | 26 // i64 and larger types when i64 is legal and the value has few bits set. It
125 bool processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
126 unsigned StoreAlignment, Value *SplatValue,
141 PHINode *CntPhi, Value *Var);
173 SmallVector<Value *, 16> Operands(I->value_op_begin(), I->value_op_end());
176 for (Value *Op : Operands)
259 /// getMemSetPatternValue - If a strided store of the specified value is safe to
265 static Constant *getMemSetPatternValue(Value *V, const DataLayout *DL) {
266 // If the value isn't a constant, we can't promote it to being in a constant
305 Value *StoredVal = SI->getValueOperand()
[all...] |
| StraightLineStrengthReduce.cpp | 94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S,
104 Value *Stride;
164 void allocateCandidatesAndFindBasisForAdd(Value *LHS, Value *RHS,
170 void allocateCandidatesAndFindBasisForMul(Value *LHS, Value *RHS,
177 Value *S, uint64_t ElementSize,
182 ConstantInt *Idx, Value *S,
189 void factorArrayIndex(Value *ArrayIdx, const SCEV *Base, uint64_t ElementSize,
195 static Value *emitBump(const Candidate &Basis, const Candidate &C
[all...] |
| /frameworks/opt/bitmap/src/com/android/bitmap/ |
| ContiguousFIFOAggregator.java | 59 private final SparseArray<Value> mTasks;
78 mTasks = new SparseArray<Value>();
107 mTasks.put(hash, new Value(callback, null));
168 final Value value = mTasks.get(hash); local
169 if (value == null || task == null) {
176 value.task = task;
202 final Value value = mTasks.get(hash); local
203 if (value.task == null)
225 final Value value = mTasks.get(hash); local
260 final Value value = mTasks.get(hash); local
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/ |
| iterator_adaptor.hpp | 174 , class Value
186 Value
195 Value, iterator_value<Base>
207 is_same<Value,use_default>
209 , add_reference<Value>
224 BOOST_STATIC_ASSERT((is_convertible<Tr1, Tr2>::value));
238 // Value - if supplied, the value_type of the resulting iterator, unless
247 // Value is supplied, Value& is used. Otherwise
256 , class Value = use_defaul
[all...] |
| /external/llvm/tools/verify-uselistorder/ |
| verify-uselistorder.cpp | 20 // 2. Visit every Value in a deterministic order.
22 // 3. Assign a random number to each Use in the Value's use-list in order.
26 // 5. Sort the use-list using Value::sortUseList(), which is a stable sort.
84 DenseMap<const Value *, unsigned> IDs;
85 std::vector<const Value *> Values;
87 /// \brief Construct a value mapping for module.
89 /// Creates mapping from every value in \c M to an ID. This mapping includes
92 /// Every \a Value that gets serialized in some way should be represented
94 /// the value-ids in the bitcode writer.
100 /// \brief Map a value
[all...] |
| /external/v8/samples/ |
| process.cc | 120 const PropertyCallbackInfo<Value>& info);
122 const PropertyCallbackInfo<Value>& info);
124 const PropertyCallbackInfo<Value>& info);
126 const PropertyCallbackInfo<Value>& info);
129 static void MapGet(Local<Name> name, const PropertyCallbackInfo<Value>& info);
130 static void MapSet(Local<Name> name, Local<Value> value,
131 const PropertyCallbackInfo<Value>& info);
156 static void LogCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
159 Local<Value> arg = args[0]
403 const string& value = (*iter).second; local
420 string value = ObjectToString(value_obj); local
625 string value = arg.substr(index+1); local
[all...] |
| /external/clang/lib/CodeGen/ |
| MicrosoftCXXABI.cpp | 138 llvm::Value *EmitTypeid(CodeGenFunction &CGF, QualType SrcRecordTy,
145 llvm::Value *EmitDynamicCastCall(CodeGenFunction &CGF, Address Value,
150 llvm::Value *EmitDynamicCastToVoid(CodeGenFunction &CGF, Address Value,
159 llvm::Value *
242 llvm::Value *adjustThisParameterInVirtualFunctionPrologue(
243 CodeGenFunction &CGF, GlobalDecl GD, llvm::Value *This) override;
276 llvm::Value *getVTableAddressPointInStructor(
287 llvm::Value *getVirtualFunctionPointer(CodeGenFunction &CGF, GlobalDecl GD
[all...] |
| CGExprCXX.cpp | 28 CodeGenFunction &CGF, const CXXMethodDecl *MD, llvm::Value *Callee,
29 ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam,
73 const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue,
74 llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy,
86 const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue,
87 llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy,
118 llvm::Value *Callee = CGM.GetAddrOfFunction(MD)
[all...] |
| /external/v8/test/cctest/ |
| test-object-observe.cc | 35 inline int32_t ToInt32(v8::Local<v8::Value> value) {
36 return value->Int32Value(v8::Isolate::GetCurrent()->GetCurrentContext())
46 Local<Value> foo = v8_str("foo");
55 Local<Value> observer = CompileRun("observer");
56 Local<Value> obj = CompileRun("obj");
57 Local<Value> notify_fun1 = CompileRun("(function() { obj.foo = 'bar'; })");
58 Local<Value> notify_fun2;
69 Local<Value> notify_fun3;
268 Local<Value> obj = CompileRun("obj = {};")
321 Local<Value> value = local
[all...] |
| test-accessors.cc | 38 using ::v8::Value;
48 const v8::PropertyCallbackInfo<v8::Value>& info) {
54 const v8::PropertyCallbackInfo<v8::Value>& info) {
60 static void handle_property(const v8::FunctionCallbackInfo<v8::Value>& info) {
121 const v8::PropertyCallbackInfo<v8::Value>& info) {
123 int* value = local
124 static_cast<int*>(v8::Local<v8::External>::Cast(info.Data())->Value());
125 info.GetReturnValue().Set(v8_num(*value));
130 Local<Value> value,
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineShifts.cpp | 26 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
45 Value *A; const APInt *B;
49 Value *Rem = Builder->CreateAnd(A, ConstantInt::get(I.getType(), *B-1),
58 /// See if we can compute the specified value, but shifted
69 /// value.
70 static bool CanEvaluateShifted(Value *V, unsigned NumBits, bool isLeftShift,
81 // the value which means that we don't care if the shift has multiple uses.
82 // TODO: Handle opposite shift by exact value.
178 for (Value *IncValue : PN->incoming_values())
188 /// this value inserts the new computation that produces the shifted value
[all...] |
| InstructionCombining.cpp | 79 Value *InstCombiner::EmitGEPOffset(User *GEP) {
121 static bool MaintainNoSignedWrap(BinaryOperator &I, Value *B, Value *C) {
207 Value *A = Op0->getOperand(0);
208 Value *B = Op0->getOperand(1);
209 Value *C = I.getOperand(1);
212 if (Value *V = SimplifyBinOp(Opcode, B, C, DL)) {
236 Value *A = I.getOperand(0);
237 Value *B = Op1->getOperand(0);
238 Value *C = Op1->getOperand(1)
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| SafeStack.cpp | 83 const Value *AllocaPtr;
86 AllocaOffsetRewriter(ScalarEvolution &SE, const Value *AllocaPtr)
112 Value *UnsafeStackPtr = nullptr;
115 /// aligned to this value. We need to re-align the unsafe stack if the
116 /// alignment of any object on the stack exceeds this value.
122 /// \brief Build a value representing a pointer to the unsafe stack pointer.
123 Value *getOrCreateUnsafeStackPtr(IRBuilder<> &IRB, Function &F);
144 Value *moveStaticAllocasToUnsafeStack(IRBuilder<> &IRB, Function &F,
157 Value *StaticTop, bool NeedDynamicTop);
162 void moveDynamicAllocasToUnsafeStack(Function &F, Value *UnsafeStackPtr
[all...] |
| /external/llvm/lib/CodeGen/ |
| CodeGenPrepare.cpp | 71 STATISTIC(NumDbgValueMoved, "Number of debug value instructions moved");
133 ValueMap<Value*, Value*> SunkAddrs;
173 bool optimizeMemoryInst(Instruction *I, Value *Addr,
236 // llvm.dbg.value is far away from the value then iSel may not be able
237 // handle it properly. iSel will drop llvm.dbg.value if it can not
238 // find a node corresponding to the value.
409 // incoming value. If incoming value is not from BB then this i
[all...] |
| /external/llvm/lib/Target/ARM/MCTargetDesc/ |
| ARMMachObjectWriter.cpp | 160 uint32_t Value = Writer->getSymbolAddress(*A, Layout);
239 MRE.r_word1 = Value;
265 uint32_t Value = Writer->getSymbolAddress(*A, Layout);
306 MRE.r_word1 = Value;
319 int64_t Value = (int64_t)FixedValue; // The displacement is signed.
326 Value -= 8;
332 Value -= 4;
339 Value += Writer->getSectionAddress(&S.getSection());
340 Value -= Writer->getSectionAddress(Fragment.getParent());
341 // If the resultant value would be out of range for an internal relocation
[all...] |
