| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| BoolAssignmentChecker.cpp | 78 // be a value that is either 0 or 1. One way to check this is to see if
86 llvm::APSInt One = BVF.getValue(1, valTy);
89 std::tie(StIn, StOut) = CM.assumeInclusiveRangeDual(state, *NV, Zero, One);
|
| /src/external/apache2/llvm/dist/llvm/examples/HowToUseJIT/ |
| HowToUseJIT.cpp | 87 Value *One = builder.getInt32(1);
95 Value *Add = builder.CreateAdd(One, ArgX);
|
| /src/external/apache2/llvm/dist/llvm/examples/HowToUseLLJIT/ |
| HowToUseLLJIT.cpp | 61 Value *One = builder.getInt32(1);
69 Value *Add = builder.CreateAdd(One, ArgX);
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/ |
| structs3.c | 18 struct One
25 struct One one; member in struct:Two
31 typedef struct One tOne;
34 tOne *onep = &two.one;
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/ |
| structs3.c | 18 struct One
25 struct One one; member in struct:Two
31 typedef struct One tOne;
34 tOne *onep = &two.one;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| ScalarEvolutionDivision.h | 65 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One;
|
| /src/external/apache2/llvm/dist/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 13 // consisting of one function as follow:
63 Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
80 ReturnInst::Create(Context, One, RetBB);
83 Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| CharUnits.h | 30 /// char' occupies exactly one byte, so 'character unit' and 'byte' refer to
57 /// One - Construct a CharUnits quantity of one.
58 static CharUnits One() {
118 /// isOne - Test whether the quantity equals one.
|
| /src/external/apache2/llvm/dist/llvm/examples/ParallelJIT/ |
| ParallelJIT.cpp | 64 Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
72 Instruction *Add = BinaryOperator::CreateAdd(One, ArgX, "addresult", BB);
94 Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
111 ReturnInst::Create(Context, One, RetBB);
114 Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
276 // Create one thread for add1 and two threads for fib
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| KnownBits.h | 25 APInt One;
29 KnownBits(APInt Zero, APInt One)
30 : Zero(std::move(Zero)), One(std::move(One)) {}
33 // Default construct Zero and One.
37 KnownBits(unsigned BitWidth) : Zero(BitWidth, 0), One(BitWidth, 0) {}
41 assert(Zero.getBitWidth() == One.getBitWidth() &&
42 "Zero and One should have the same width!");
47 bool hasConflict() const { return Zero.intersects(One); }
52 return Zero.countPopulation() + One.countPopulation() == getBitWidth()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUMCInstLower.cpp | 114 const MCConstantExpr *One = MCConstantExpr::create(4, Ctx);
115 SrcBBSym = MCBinaryExpr::createAdd(SrcBBSym, One, Ctx);
|
| AMDGPUCodeGenPrepare.cpp | 835 /// first one is insufficient. Returns -1 on failure.
877 ConstantInt *One = Builder.getInt32(1);
878 Value *JQ = One;
888 JQ = Builder.CreateOr(JQ, One);
1050 ConstantInt *One = Builder.getInt32(1);
1075 // // One round of UNR (Unsigned integer Newton-Raphson) to improve z.
1105 // One round of UNR.
1117 Q = Builder.CreateSelect(Cond, Builder.CreateAdd(Q, One), Q);
1124 Res = Builder.CreateSelect(Cond, Builder.CreateAdd(Q, One), Q);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| BitTracker.h | 152 // possible bit values. One extension here is the "Ref" type, which
159 One, // Bit = 1.
160 Ref // Bit value same as the one described in RefI.
170 // for one register will be a simple "ref" for another register.
183 // one in which V will be contained. If the RefI.Pos refers to the posi-
195 BitValue(bool B) : Type(B ? One : Zero) {}
212 : (T == 1 ? Type == One : false);
223 // the newly calculated one, and return "true" if the value of *this has
258 return Type == Zero || Type == One;
262 assert(Type == Zero || Type == One);
[all...] |
| HexagonAsmPrinter.cpp | 442 const MCExpr *One = MCConstantExpr::create(1, OutContext);
443 const MCExpr *Sub = MCBinaryExpr::createSub(Expr, One, OutContext);
478 const MCExpr *One = MCConstantExpr::create(1, OutContext);
479 const MCExpr *Sub = MCBinaryExpr::createSub(Expr, One, OutContext);
505 const MCExpr *One = MCConstantExpr::create(1, OutContext);
506 const MCExpr *Sub = MCBinaryExpr::createSub(Expr, One, OutContext);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| AMDGPUEmitPrintf.cpp | 100 auto One = Builder.getInt64(1);
137 auto PtrNext = Builder.CreateGEP(PtrPhi, One);
145 // Add one to the computed length.
150 Len = Builder.CreateAdd(Len, One);
|
| IntegerDivision.cpp | 161 ConstantInt *One;
167 One = Builder.getInt64(1);
173 One = Builder.getInt32(1);
271 Value *SR_1 = Builder.CreateAdd(SR, One);
309 Value *Tmp5 = Builder.CreateShl(R_1, One);
312 Value *Tmp8 = Builder.CreateShl(Q_2, One);
316 Value *Carry = Builder.CreateAnd(Tmp10, One);
332 Value *Tmp13 = Builder.CreateShl(Q_3, One);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| SjLjEHPrepare.cpp | 118 Value *One = ConstantInt::get(Int32Ty, 1);
119 Value *Idxs[2] = { Zero, One };
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| KnownBits.cpp | 25 "Carry can't be zero and one at the same time");
32 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One;
35 APInt LHSKnownUnion = LHS.Zero | LHS.One;
36 APInt RHSKnownUnion = RHS.Zero | RHS.One;
46 KnownOut.One = std::move(PossibleSumOne) & Known;
54 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue());
66 std::swap(RHS.Zero, RHS.One);
75 // a non-negative one, can't wrap into negative.
79 // a negative one, can't wrap into non-negative
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| StraightLineStrengthReduce.cpp | 41 // takes only one add starting from the second iteration.
132 // SLSR candidate. Such a candidate must be in one of the forms described in
159 // candidate with respect to its immediate basis. Note that one instruction
312 // Returns true if GEP has zero or one non-zero index.
346 // to one hash-table look up.
354 // takes only one instruction.
420 APInt One(Idx->getBitWidth(), 1);
421 Idx = ConstantInt::get(Idx->getContext(), One << Idx->getValue());
425 ConstantInt *One = ConstantInt::get(cast<IntegerType>(I->getType()), 1);
426 allocateCandidatesAndFindBasis(Candidate::Add, SE->getSCEV(LHS), One, RHS
[all...] |
| LoopRerollPass.cpp | 203 // For loop with multiple induction variable, remember the one used only to
376 // one for the Base instruction in each DAGRootSet.
520 // 1. It only has one use which is loop increment, and the increment is only
534 // User can only have one or two uses.
574 // Compare : can only have one use, and must be branch
1214 // Make sure all instructions in the loop are in one and only one
1271 // which one is which.
1275 // one, so limit the number of probes we do.
1479 auto One = SE->getOne(BackedgeTakenCount->getType())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/MSP430/ |
| MSP430ISelLowering.cpp | 878 // Transform all store nodes into one single node because all store nodes are
1198 SDValue One = DAG.getConstant(1, dl, VT);
1204 SR = DAG.getNode(ISD::SRA, dl, MVT::i16, SR, One);
1205 SR = DAG.getNode(ISD::AND, dl, MVT::i16, SR, One);
1207 SR = DAG.getNode(ISD::XOR, dl, MVT::i16, SR, One);
1211 SDValue Ops[] = {One, Zero, TargetCC, Flag};
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineMulDivRem.cpp | 61 Value *A = nullptr, *B = nullptr, *One = nullptr;
62 if (match(V, m_LShr(m_OneUse(m_Shl(m_Value(One), m_Value(A))), m_Value(B))) &&
63 match(One, m_One())) {
65 return IC.Builder.CreateShl(One, A);
355 // TODO: We are not checking one-use because the elimination of the multiply
559 // Match as long as at least one of exp has only one use.
569 // Match as long as at least one of exp2 has only one use.
620 /// Fold a divide or remainder with a select instruction divisor when one of th
[all...] |
| InstCombineSelect.cpp | 164 // with. But there's one special-case that we handle here because it can
169 // If the select constants differ by exactly one bit and that's the same
171 // be replaced by bitwise logic to set/clear one bit of the constant result.
199 // Make sure one of the select arms is a power-of-2.
268 // one-use restrictions are eased for other patterns, we still don't want to
304 // TODO: The one-use restrictions for a scalar select could be eased if
356 // one-use here. As with the cast case above, it may be possible to relax the
357 // one-use constraint, but that needs be examined carefully since it may not
423 if (!C1I.isNullValue() && !C2I.isNullValue()) // One side must be zero.
429 /// Try to fold the select into one of the operands to allow furthe
[all...] |
| /src/external/apache2/llvm/dist/llvm/bindings/ocaml/llvm/ |
| llvm.ml | 165 | One
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| MipsSEISelLowering.cpp | 479 // sign/zero-extension is completely overwritten by the new one performed by
886 // sign/zero-extension is completely overwritten by the new one performed by
1410 SDValue One = DAG.getConstant(1, DL, ViaVecTy);
1412 DAG.getNode(ISD::AND, DL, ViaVecTy, Result, One));
1523 SDValue One = DAG.getConstant(1, DL, ResTy);
1524 SDValue Bit = DAG.getNode(ISD::SHL, DL, ResTy, One, truncateVecElts(Op, DAG));
1656 SDValue One = DAG.getConstant(1, DL, VecTy);
1659 DAG.getNode(ISD::SHL, DL, VecTy, One,
1692 SDValue One = DAG.getConstant(1, DL, VecTy);
1695 DAG.getNode(ISD::SHL, DL, VecTy, One,
[all...] |
