| /external/eigen/Eigen/src/Core/ |
| CwiseNullaryOp.h | 24 * It is the return type of the Ones(), Zero(), Constant(), Identity() and Random() methods,
107 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
130 * it is redundant to pass \a size as argument, so Zero() should be used
170 * it is redundant to pass \a nbRows and \a nbCols as arguments, so Zero() should be used
192 * it is redundant to pass \a size as argument, so Zero() should be used
410 // zero:
412 /** \returns an expression of a zero matrix.
418 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
424 * \sa Zero(), Zero(Index
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| BitTracker.h | 108 Zero, // Bit = 0.
145 BitValue(bool B) : Type(B ? One : Zero) {}
160 return T == 0 ? Type == Zero
207 return Type == Zero || Type == One;
210 assert(Type == Zero || Type == One);
394 // Sign/zero extension.
|
| HexagonAsmPrinter.cpp | 475 const MCExpr *Zero = MCConstantExpr::create(0, OutContext);
476 TmpInst.addOperand(MCOperand::createExpr(Zero));
|
| HexagonBitTracker.cpp | 32 // P is sign- or zero-extended, locate the virtual register holding that
144 // registers. Such parameters can be sign- or zero-extended at the
254 return rr0(RegisterCell(W0).fill(0, W0, BT::BitValue::Zero), Outputs);
263 RC.fill(0, L, BT::BitValue::Zero);
279 RC.fill(PW, RW, BT::BitValue::Zero);
366 RPC.fill(0, 2, BT::BitValue::Zero);
607 RC[im(2)] = BT::BitValue::Zero;
619 : RC[BX].is(1) ? BT::BitValue::Zero
628 const BT::BitValue Zero = BT::BitValue::Zero;
[all...] |
| /external/llvm/unittests/ExecutionEngine/MCJIT/ |
| MCJITTestBase.h | 172 Value *Zero = ConstantInt::get(Context, APInt(32, 0));
173 Builder.CreateCondBr(Builder.CreateICmpEQ(Param, Zero),
|
| /frameworks/base/tools/aapt2/ |
| ResourceValues.h | 315 Zero = 0,
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 381 // If we have a concrete value, see if it's zero.
387 llvm::APSInt Zero = IntType.getZeroValue();
389 // Check if zero is in the set of possible values.
390 if (Ranges->Intersect(BV, F, Zero, Zero).isEmpty())
393 // Zero is a possible value, but it is not the /only/ possible value.
427 // Special case: references are known to be non-zero.
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| BDCSVD.h | 222 m_computed = MatrixXr::Zero(this->m_diagSize + 1, this->m_diagSize );
232 if (compU) m_naiveU = MatrixXr::Zero(this->m_diagSize + 1, this->m_diagSize + 1 );
233 else m_naiveU = MatrixXr::Zero(2, this->m_diagSize + 1 );
235 if (compV) m_naiveV = MatrixXr::Zero(this->m_diagSize, this->m_diagSize);
258 m_computed = Matrix<int, Dynamic, Dynamic>::Zero(rows(), cols());
262 if (this->m_computeFullU) this->m_matrixU = Matrix<int, Dynamic, Dynamic>::Zero(rows(), rows());
263 if (this->m_computeFullV) this->m_matrixV = Matrix<int, Dynamic, Dynamic>::Zero(cols(), cols());
319 MatrixX temp = MatrixX::Zero(naiveU.rows(), naiveU.cols());
335 MatrixX temp = MatrixX::Zero(naiveV.rows(), naiveV.cols());
492 m_computed.block(firstCol + shift, firstCol + shift, n, n) << MatrixXr::Zero(n, n)
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Vector2.java | 31 public final static Vector2 Zero = new Vector2(0, 0);
|
| Vector3.java | 39 public final static Vector3 Zero = new Vector3(0, 0, 0);
|
| /external/llvm/lib/CodeGen/ |
| SjLjEHPrepare.cpp | 132 Value *Zero = ConstantInt::get(Int32Ty, 0);
134 Value *Idxs[2] = { Zero, One };
|
| /external/llvm/lib/Transforms/Scalar/ |
| StraightLineStrengthReduce.cpp | 294 // Returns true if GEP has zero or one non-zero index.
441 ConstantInt *Zero = ConstantInt::get(cast<IntegerType>(I->getType()), 0);
442 allocateCandidatesAndFindBasis(Candidate::Mul, SE->getSCEV(LHS), Zero, RHS,
|
| /external/llvm/unittests/IR/ |
| ConstantsTest.cpp | 27 Constant* Zero = ConstantInt::get(Int1, 0);
34 EXPECT_EQ(Zero, ConstantExpr::getAdd(One, One));
38 EXPECT_EQ(Zero, ConstantExpr::getAdd(NegOne, One));
42 EXPECT_EQ(Zero, ConstantExpr::getAdd(NegOne, NegOne));
46 EXPECT_EQ(Zero, ConstantExpr::getSub(NegOne, One));
50 EXPECT_EQ(Zero, ConstantExpr::getSub(One, NegOne));
54 EXPECT_EQ(Zero, ConstantExpr::getSub(One, One));
62 EXPECT_EQ(One, ConstantExpr::getShl(One, Zero));
94 EXPECT_EQ(Zero, ConstantExpr::getSRem(NegOne, One));
98 EXPECT_EQ(Zero, ConstantExpr::getURem(NegOne, One))
[all...] |
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmsio1.c | 172 cmsUInt16Number Zero[2] = { 0x8080, 0x8080 };
176 EmptyTab = cmsBuildTabulatedToneCurve16(ContextID, 2, Zero);
862 // does not fully support relative colorimetric because they cannot deal with non-zero black points, but
[all...] |
| cmsvirt.c | 827 cmsUInt16Number Zero[2] = { 0, 0 };
847 EmptyTab = cmsBuildTabulatedToneCurve16(ContextID, 2, Zero);
[all...] |
| /external/llvm/include/llvm/ProfileData/ |
| CoverageMapping.h | 43 enum CounterKind { Zero, CounterValueReference, Expression };
56 Counter() : Kind(Zero), ID(0) {}
60 bool isZero() const { return Kind == Zero; }
80 /// \brief Return the counter that represents the number zero.
334 /// \brief The execution count, or zero if no count was recorded.
|
| /external/llvm/lib/Target/Mips/ |
| MipsSEISelDAGToDAG.cpp | 90 // Check if MI is "addiu $dst, $zero, 0" or "daddiu $dst, $zero, 0".
92 (MI.getOperand(1).getReg() == Mips::ZERO) &&
95 ZeroReg = Mips::ZERO;
119 // contains the zero register.
259 // now, just make the DAG type-correct by asserting the upper bits are zero.
268 // constant-zero node.
638 // Extract the run of set bits starting with bit zero from the bitwise
672 // Extract the run of set bits starting with bit zero, and test that the
738 SDValue Zero = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), DL
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 81 // If the GEP has all zero indices, it doesn't offset the pointer. If it
233 // Move all alloca's of zero byte objects to the entry block and merge them
235 // allocate and return a unique pointer, even for a zero byte allocation.
237 // For a zero sized alloca there is no point in doing an array allocation.
249 // If the entry block doesn't start with a zero-size alloca then move
264 // Replace this zero-sized alloca with the one at the start of the entry
551 auto *Zero = ConstantInt::get(IdxType, 0);
554 Zero,
651 // not a constant, but having any value but zero would lead to undefined
652 // behavior, replace it with zero
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| IntegerDivision.cpp | 161 ConstantInt *Zero;
167 Zero = Builder.getInt64(0);
173 Zero = Builder.getInt32(0);
236 // First off, check for special cases: dividend or divisor is zero, divisor
252 Value *Ret0_1 = Builder.CreateICmpEQ(Divisor, Zero);
253 Value *Ret0_2 = Builder.CreateICmpEQ(Dividend, Zero);
261 Value *RetVal = Builder.CreateSelect(Ret0, Zero, Dividend);
275 Value *SkipLoop = Builder.CreateICmpEQ(SR_1, Zero);
321 Value *Tmp12 = Builder.CreateICmpEQ(SR_2, Zero);
345 Carry_1->addIncoming(Zero, Preheader)
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprAgg.cpp | 346 llvm::Value *Zero = llvm::ConstantInt::get(CGF.PtrDiffTy, 0);
347 llvm::Value *IdxStart[] = { Zero, Zero };
364 llvm::Value *IdxEnd[] = { Zero, Size };
378 /// equivalent to zero-initialization.
410 llvm::Value *zero = llvm::ConstantInt::get(CGF.SizeTy, 0); local
411 llvm::Value *indices[] = { zero, zero };
474 // Any remaining elements need to be zero-initialized, possibly
653 // Zero-initialize. (Strictly speaking, we only need to intializ
[all...] |
| CGDecl.cpp | 681 // zero-initialized. If the variable might be accessed in its
682 // initializer, zero-initialize before running the initializer, then
699 llvm::Value *zero = llvm::ConstantPointerNull::get(ty); local
703 EmitARCInitWeak(tempLV.getAddress(), zero);
707 EmitStoreOfScalar(zero, tempLV, /* isInitialization */ true);
799 /// non-zero parts of the specified initializer with equal or fewer than
803 // Zero and Undef never requires any extra stores.
843 "called emitStoresForInitAfterMemset for zero or undef value.");
890 // If a non-zero global is <= 32 bytes, always use a memcpy. If it is large,
1602 llvm::Value *zero = llvm::ConstantInt::get(CGF.SizeTy, 0); local
[all...] |
| /external/llvm/lib/Analysis/ |
| ConstantFolding.cpp | 169 Constant *Zero = Constant::getNullValue(DstEltTy);
175 Constant *Elt = Zero;
182 // Zero extend the element to the right size.
284 // If this element is zero or undefined, we can just return since *CurPtr is
285 // zero initialized.
593 // is all undef or zero, we know what it loads.
639 // All the bits of Op0 that the 'and' could be masking are already zero.
643 // All the bits of Op1 that the 'and' could be masking are already zero.
830 // The element size is 0. This may be [0 x Ty]*, so just use a zero
835 // The element size is non-zero divide the offset by the elemen
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeVectorOps.cpp | 765 // Broadcast the mask so that the entire vector is all-one or all zero.
852 // lanes into the appropriate locations, a blend of zero into the high bits,
862 // Build up a zero vector to blend into this one.
866 SDValue Zero = DAG.getNode(ISD::BUILD_VECTOR, DL, SrcVT, BuildVectorOperands);
869 // lanes from the zero vector.
[all...] |
| /external/llvm/lib/IR/ |
| ConstantFold.cpp | 114 Value *Zero =
116 IdxList.push_back(Zero);
122 IdxList.push_back(Zero);
127 IdxList.push_back(Zero);
134 // This GEP is inbounds because all indices are zero.
276 // If the extract is known to be all zeros, return zero.
284 // TODO: Handle the 'partially zero' case.
298 // If the extract is known to be all zeros, return zero.
306 // TODO: Handle the 'partially zero' case.
314 // If extracting something that is completely zero, return 0
[all...] |
| /external/llvm/lib/Target/MSP430/ |
| MSP430ISelLowering.cpp | [all...] |
