| /cts/tools/dasm/src/dasm/ |
| DAsm.java | 41 import com.android.dx.rop.cst.Constant;
683 Constant constant = new CstString(v2); local
686 constant);
706 Constant constant = CstType.intern(type); local
709 constant);
738 Constant constant; local
749 constant = CstType.intern(type)
812 Constant constant; local
914 Constant constant; local
1041 Constant constant = new CstFieldRef(CstType.intern(Type local
1068 Constant constant = CstType.intern(type); local
1113 Constant constant = new CstFieldRef(CstType.intern(Type local
1159 Constant constant = CstType.intern(type); local
1253 Constant constant = CstInteger.make(v3); local
1302 Constant constant; local
[all...] |
| /external/llvm/lib/Analysis/ |
| VectorUtils.cpp | 374 if (Constant *C = dyn_cast<Constant>(V))
403 // Extract a value from a vector add operation with a constant zero.
404 Value *Val = nullptr; Constant *Con = nullptr;
406 if (Constant *Elt = Con->getAggregateElement(EltNo))
421 if (auto *C = dyn_cast<Constant>(V))
|
| ScalarEvolutionExpander.cpp | 149 // Fold a cast of a constant.
150 if (Constant *C = dyn_cast<Constant>(V))
175 // Fold a binop with constant operands.
176 if (Constant *CLHS = dyn_cast<Constant>(LHS))
177 if (Constant *CRHS = dyn_cast<Constant>(RHS))
241 // For a Constant, check for a multiple of the given factor.
263 // In a Mul, check if there is a constant operand which is a multipl
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| ConstantHoisting.cpp | 15 // cost. If the constant can be folded into the instruction (the cost is
20 // If the cost is more than TCC_BASIC, then the integer constant can't be folded
21 // into the instruction and it might be beneficial to hoist the constant.
25 // When a constant is hoisted, it is also hidden behind a bitcast to force it to
26 // be live-out of the basic block. Otherwise the constant would be just
29 // certain transformations on them, which would create a new expensive constant.
32 // simple (this means not nested) constant cast expressions. For example:
63 /// \brief Keeps track of the user of a constant and the operand index where the
64 /// constant is used.
72 /// \brief Keeps track of a constant candidate and its uses
[all...] |
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 364 bool equivalentAsOperands(Constant *L, Constant *R) {
377 // Compare constant expressions structurally.
433 // Value subtypes: Argument, Constant, Instruction, BasicBlock,
436 if (isa<Constant>(L))
437 return equivalentAsOperands(cast<Constant>(L), cast<Constant>(R));
|
| /external/llvm/tools/verify-uselistorder/ |
| verify-uselistorder.cpp | 102 /// Maps a value. If it's a constant, maps all of its operands first.
226 if ((isa<Constant>(Op) && !isa<GlobalValue>(*Op)) ||
236 if (auto *C = dyn_cast<Constant>(V))
294 // This mapping doesn't include dangling constant users, since those don't
295 // get serialized. However, checking if users are constant and calling
386 if (auto *C = dyn_cast<Constant>(V))
428 if (auto *C = dyn_cast<Constant>(V))
498 if ((isa<Constant>(Op) && !isa<GlobalValue>(*Op)) ||
|
| /external/v8/src/compiler/ |
| js-call-reducer.cc | 225 // Try to specialize JSCallFunction {node}s with constant {target}s.
279 node, jsgraph()->Constant(bound_target_function), 0);
280 NodeProperties::ReplaceValueInput(node, jsgraph()->Constant(bound_this),
286 jsgraph()->Constant(handle(bound_arguments->get(i), isolate())));
297 // Don't mess with other {node}s that have a constant {target}.
341 jsgraph()->Constant(handle(cell->value(), isolate()));
376 // Try to specialize JSCallConstruct {node}s with constant {target}s.
413 // Don't mess with other {node}s that have a constant {target}.
468 jsgraph()->Constant(handle(cell->value(), isolate()));
|
| js-native-context-specialization.cc | 61 // context (if any), so we can constant-fold those fields, which is
182 receiver_map, jsgraph()->Constant(map));
236 this_value = jsgraph()->Constant(access_info.constant());
250 this_receiver = jsgraph()->Constant(holder);
306 jsgraph()->Constant(HeapNumber::kSize),
347 jsgraph()->Constant(field_type->Classes().Current()));
364 jsgraph()->Constant(transition_map), this_effect, this_control);
450 // Check if we have a constant receiver.
466 Node* value = jsgraph()->Constant(prototype)
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| ValueEnumerator.cpp | 119 // Optimize constant ordering.
191 // Optimize constant ordering.
208 /// OptimizeConstants - Reorder constant pool for denser encoding.
216 // constant pool. This is important so that GEP structure indices come before
217 // gep constant exprs.
321 if (const Constant *C = dyn_cast<Constant>(V)) {
325 // If a constant has operands, enumerate them. This makes sure that if a
326 // constant has uses (for example an array of const ints), that they are
347 // outer constant as used
[all...] |
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| ValueEnumerator.cpp | 119 // Optimize constant ordering.
191 // Optimize constant ordering.
208 /// OptimizeConstants - Reorder constant pool for denser encoding.
216 // constant pool. This is important so that GEP structure indices come before
217 // gep constant exprs.
321 if (const Constant *C = dyn_cast<Constant>(V)) {
325 // If a constant has operands, enumerate them. This makes sure that if a
326 // constant has uses (for example an array of const ints), that they are
347 // outer constant as used
[all...] |
| /frameworks/compile/slang/BitWriter_3_2/ |
| ValueEnumerator.cpp | 119 // Optimize constant ordering.
191 // Optimize constant ordering.
208 /// OptimizeConstants - Reorder constant pool for denser encoding.
216 // constant pool. This is important so that GEP structure indices come before
217 // gep constant exprs.
321 if (const Constant *C = dyn_cast<Constant>(V)) {
325 // If a constant has operands, enumerate them. This makes sure that if a
326 // constant has uses (for example an array of const ints), that they are
347 // outer constant as used
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprComplex.cpp | 124 llvm::Constant *pair = result.getValue();
209 llvm::Constant *Null = llvm::Constant::getNullValue(CGF.ConvertType(Elem));
215 llvm::Constant *Null =
216 llvm::Constant::getNullValue(CGF.ConvertType(Elem));
375 return ComplexPairTy(llvm::Constant::getNullValue(Imag->getType()), Imag);
420 return ComplexPairTy(Val, llvm::Constant::getNullValue(Val->getType()));
601 llvm::Constant *Func = CGF.CGM.CreateBuiltinFunction(FTy, LibCallName);
751 LibCallOp.LHS.second = llvm::Constant::getNullValue(LHSr->getType());
[all...] |
| CGExpr.cpp | 278 llvm::Constant *CleanupFn;
279 llvm::Constant *CleanupArg;
285 CleanupArg = llvm::Constant::getNullValue(CGF.Int8PtrTy);
289 CleanupArg = cast<llvm::Constant>(ReferenceTemporary.getPointer());
320 // If we have a constant temporary array or record try to promote it into a
321 // constant global under the same rules a normal constant would've been
328 if (llvm::Constant *Init = CGF.CGM.EmitConstantExpr(Inner, Ty, &CGF)) {
365 // constant.
411 // If the temporary is a global and has a constant initializer or is
[all...] |
| CGObjC.cpp | 40 static llvm::Constant *getNullForVariable(Address addr) {
48 llvm::Constant *C =
94 llvm::Constant *GV = CGM.GetAddrOfConstantCString(Str).getPointer();
237 // Note that this implementation allows for non-constant strings to be passed
799 llvm::Constant *AtomicHelperFn =
839 llvm::Constant *AtomicHelperFn) {
[all...] |
| CodeGenFunction.h | 357 llvm::Constant *BeginCatchFn;
369 llvm::Constant *beginCatchFn, llvm::Constant *endCatchFn,
370 llvm::Constant *rethrowFn);
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAndOrXor.cpp | 68 /// operands into either a constant true or false, or a brand new ICmp
138 /// OP( BSWAP(x), CONSTANT ) -> BSWAP( OP(x, BSWAP(CONSTANT) ) )
165 Constant *Together = nullptr;
204 // single bit constant.
210 // ADD down to exactly one bit. If the constant we are adding has
236 // the anded constant includes them, clear them now!
255 // the anded constant includes them, clear them now! This only applies to
281 Constant *C = Builder->getInt(AndRHS->getValue() & ShrMask);
300 Value *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi
[all...] |
| /external/v8/src/compiler/arm/ |
| code-generator-arm.cc | 44 Constant constant = ToConstant(instr_->InputAt(index)); local
45 switch (constant.type()) {
46 case Constant::kInt32:
47 return Operand(constant.ToInt32());
48 case Constant::kFloat32:
50 isolate()->factory()->NewNumber(constant.ToFloat32(), TENURED));
51 case Constant::kFloat64:
53 isolate()->factory()->NewNumber(constant.ToFloat64(), TENURED));
54 case Constant::kInt64
[all...] |
| /external/v8/src/compiler/mips/ |
| code-generator-mips.cc | 70 Constant constant = ToConstant(instr_->InputAt(index)); local
71 switch (constant.type()) {
72 case Constant::kInt32:
73 return Operand(constant.ToInt32());
74 case Constant::kFloat32:
76 isolate()->factory()->NewNumber(constant.ToFloat32(), TENURED));
77 case Constant::kFloat64:
79 isolate()->factory()->NewNumber(constant.ToFloat64(), TENURED));
80 case Constant::kInt64
[all...] |
| /external/v8/src/compiler/mips64/ |
| code-generator-mips64.cc | 69 Constant constant = ToConstant(instr_->InputAt(index)); local
70 switch (constant.type()) {
71 case Constant::kInt32:
72 return Operand(constant.ToInt32());
73 case Constant::kInt64:
74 return Operand(constant.ToInt64());
75 case Constant::kFloat32:
77 isolate()->factory()->NewNumber(constant.ToFloat32(), TENURED));
78 case Constant::kFloat64
[all...] |
| /external/v8/src/compiler/s390/ |
| code-generator-s390.cc | 45 Constant constant = ToConstant(instr_->InputAt(index)); local
46 switch (constant.type()) {
47 case Constant::kInt32:
48 return Operand(constant.ToInt32());
49 case Constant::kFloat32:
51 isolate()->factory()->NewNumber(constant.ToFloat32(), TENURED));
52 case Constant::kFloat64:
54 isolate()->factory()->NewNumber(constant.ToFloat64(), TENURED));
55 case Constant::kInt64
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineFunction.cpp | 379 // Print Constant Pool
862 /// Test whether the given two constants can be allocated the same constant pool
864 static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
869 // If they have the same type but weren't the same constant, quickly
885 // Try constant folding a bitcast of both instructions to an integer. If we
887 // the constant folding APIs to do this so that we get the benefit of
891 const_cast<Constant *>(A), DL);
[all...] |
| /frameworks/rs/api/ |
| Specification.cpp | 308 Constant::~Constant() {
375 Constant* constant = systemSpecification.findOrCreateConstant(name, &created); local
376 ConstantSpecification* spec = new ConstantSpecification(constant);
377 constant->addSpecification(spec);
378 constant->updateFinalVersion(info);
385 constant->scanDocumentationTags(scanner, created, specFile);
778 Constant* constant = spec->getConstant() local
[all...] |
| /hardware/intel/img/psb_video/src/ |
| psb_texture.c | 150 signed char *pV, signed short *constant,
719 double yCoeff, uCoeff, vCoeff, Constant;
728 * included in the constant of the transform equation
756 &Constant);
759 psb_convert_coeffs(yCoeff, uCoeff, vCoeff, Constant, /* input coefficients */
770 &Constant);
773 psb_convert_coeffs(yCoeff, uCoeff, vCoeff, Constant,
785 &Constant);
788 psb_convert_coeffs(yCoeff, uCoeff, vCoeff, Constant,
[all...] |
| /external/llvm/lib/Bitcode/Reader/ |
| BitcodeReader.cpp | 53 /// The key of this vector is the placeholder constant, the value is the slot
55 typedef std::vector<std::pair<Constant*, unsigned> > ResolveConstantsTy;
87 Constant *getConstantFwdRef(unsigned Idx, Type *Ty);
[all...] |
| /external/v8/test/unittests/compiler/ |
| js-typed-lowering-unittest.cc | 116 // Constant propagation
122 Parameter(Type::Constant(factory()->minus_zero_value(), zone())));
134 Type::Constant(factory()->NewNumber(0), zone()), zone())));
143 Reduction r = Reduce(Parameter(Type::Constant(null, zone())));
160 Handle<Object> constant = factory()->NewNumber(nan); local
161 Reduction r = Reduce(Parameter(Type::Constant(constant, zone())));
167 Reduce(Parameter(Type::Constant(factory()->nan_value(), zone())));
181 Handle<Object> constant = factory()->NewNumber(value); local
182 Reduction r = Reduce(Parameter(Type::Constant(constant, zone())))
[all...] |
