| /netbsd-src/sys/arch/m68k/fpsp/ |
| H A D | setox.sa | 82 * Step 1. Set ans := 1.0 84 * Step 2. Return ans := ans + sign(X)*2^(-126). Exit. 91 * Step 1. Filter out extreme cases of input argument. 92 * 1.1 If |X| >= 2^(-65), go to Step 1.3. 93 * 1.2 Go to Step 7. 94 * 1.3 If |X| < 16380 log(2), go to Step 2. 95 * 1.4 Go to Step 8. 104 * Note also that the constant 16380 log(2) used in Step 1.3 106 * to Step 2 guarantees |X| < 16380 log(2). There is no harm 108 * but close to, 16380 log(2) and the branch to Step 9 is [all …]
|
| H A D | slog2.sa | 64 * Step 0. If X < 0, create a NaN and raise the invalid operation 69 * Step 1. Call slognd to obtain Y = log(X), the natural log of X. 72 * Step 2. Compute log_10(X) = log(X) * (1/log(10)). 79 * Step 0. If X < 0, create a NaN and raise the invalid operation 84 * Step 1. Call sLogN to obtain Y = log(X), the natural log of X. 86 * Step 2. Compute log_10(X) = log(X) * (1/log(10)). 93 * Step 0. If X < 0, create a NaN and raise the invalid operation 98 * Step 1. Call slognd to obtain Y = log(X), the natural log of X. 101 * Step 2. Compute log_10(X) = log(X) * (1/log(2)). 108 * Step 0. If X < 0, create a NaN and raise the invalid operation [all …]
|
| H A D | srem_mod.sa | 55 * Step 1. Save and strip signs of X and Y: signX := sign(X), 60 * Step 2. Set L := expo(X)-expo(Y), k := 0, Q := 0. 62 * R := X, go to Step 4. 67 * Step 3. Perform MOD(X,Y) 68 * 3.1 If R = Y, go to Step 9. 70 * 3.3 If j = 0, go to Step 4. 72 * Step 3.1. 74 * Step 4. At this point, R = X - QY = MOD(X,Y). Set 75 * Last_Subtract := false (used in Step 7 below). If 76 * MOD is requested, go to Step 6. [all …]
|
| /netbsd-src/sys/external/bsd/acpica/dist/compiler/ |
| H A D | dtsubtable.c | 291 UINT8 Step; in DtGetSubtableLength() local 315 Step = 5; in DtGetSubtableLength() 320 Step = 9; in DtGetSubtableLength() 325 Step = 10; in DtGetSubtableLength() 330 Step = 1; in DtGetSubtableLength() 334 for (i = 0; i < Step; i++) in DtGetSubtableLength()
|
| /netbsd-src/external/gpl3/gdb/dist/gnulib/import/m4/ |
| H A D | pthread_rwlock_rdlock.m4 | 72 /* Step 13 (can be before or after step 12): 88 /* Step 8 (can be before or after step 7): 94 /* Step 9: The second reader thread requests the lock. */ 100 /* Step 10: Launch a timer, to test whether the next call blocks. */ 103 /* Step 11: Release the baton. */ 106 /* Step 12: The second reader thread requests the lock. */ 117 /* Step 4: Take the baton, so that the second reader thread does not go ahead 121 /* Step 5: Create the second reader thread. */ 124 /* Step 6: Release the baton. */ 127 /* Step 7: The writer thread requests the lock. */ [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 264 bool isSupportedStep(const SCEV* Step); 502 bool LoopPredication::isSupportedStep(const SCEV* Step) { in isSupportedStep() argument 503 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop); in isSupportedStep() 702 auto *Step = RangeCheckIV->getStepRecurrence(*SE); in widenICmpRangeCheck() local 705 if (!isSupportedStep(Step)) { in widenICmpRangeCheck() 721 assert(Step->getType() == in widenICmpRangeCheck() 724 if (Step != CurrLatchCheck.IV->getStepRecurrence(*SE)) { in widenICmpRangeCheck() 729 if (Step->isOne()) in widenICmpRangeCheck() 733 assert(Step->isAllOnesValue() && "Step should be -1!"); in widenICmpRangeCheck() 886 auto *Step = Result->IV->getStepRecurrence(*SE); in parseLoopLatchICmp() local [all …]
|
| H A D | InductiveRangeCheckElimination.cpp | 146 const SCEV *Step = nullptr; member in __anon2c2ab2ad0111::InductiveRangeCheck 161 const SCEV *getStep() const { return Step; } in getStep() 169 Step->print(OS); in print() 404 IRC.Step = IndexAddRec->getStepRecurrence(SE); in extractRangeChecksFromCond() 660 const SCEV *BoundSCEV, const SCEV *Step, in isSafeDecreasingBound() argument 671 assert(SE.isKnownNegative(Step) && "expecting negative step"); in isSafeDecreasingBound() 675 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n"); in isSafeDecreasingBound() 693 const SCEV *StepPlusOne = SE.getAddExpr(Step, SE.getOne(Step->getType())); in isSafeDecreasingBound() 710 const SCEV *BoundSCEV, const SCEV *Step, in isSafeIncreasingBound() argument 723 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n"); in isSafeIncreasingBound() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/ |
| H A D | INSTALL.txt | 8 // Step 1: Organization 21 // Step 2: Configure and Build LLVM 32 // Step 3: (Optional) Verify Your Build 40 // Step 4: Install Clang
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter5/ |
| H A D | toy.cpp | 198 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anonde6ff8cc0111::ForExprAST 202 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 205 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 391 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 394 Step = ParseExpression(); in ParseForExpr() 395 if (!Step) in ParseForExpr() 408 std::move(Step), std::move(Body)); in ParseForExpr() 725 if (Step) { in codegen() 726 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
| H A D | SemaInit.cpp | 3457 void InitializationSequence::Step::Destroy() { in Destroy() 3574 Step S; in AddAddressOverloadResolutionStep() 3585 Step S; in AddDerivedToBaseCastStep() 3597 Step S; in AddReferenceBindingStep() 3604 Step S; in AddFinalCopy() 3611 Step S; in AddExtraneousCopyToTemporary() 3622 Step S; in AddUserConversionStep() 3633 Step S; in AddQualificationConversionStep() 3651 Step S; in AddFunctionReferenceConversionStep() 3658 Step S; in AddAtomicConversionStep() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/TableGen/ |
| H A D | SetTheory.cpp | 180 int Step = 1; in apply() local 186 Step = II->getValue(); in apply() 216 Step *= From <= To ? 1 : -1; in apply() 218 if (Step > 0 && From > To) in apply() 220 else if (Step < 0 && From < To) in apply() 235 From += Step; in apply()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | IVDescriptors.cpp | 939 const SCEV *Step, BinaryOperator *BOp, in InductionDescriptor() argument 941 : StartValue(Start), IK(K), Step(Step), InductionBinOp(BOp) { in InductionDescriptor() 958 assert((IK == IK_FpInduction || Step->getType()->isIntegerTy()) && in InductionDescriptor() 961 assert((IK != IK_FpInduction || Step->getType()->isFloatingPointTy()) && in InductionDescriptor() 977 if (isa<SCEVConstant>(Step)) in getConstIntStepValue() 978 return dyn_cast<ConstantInt>(cast<SCEVConstant>(Step)->getValue()); in getConstIntStepValue() 1030 const SCEV *Step = SE->getUnknown(Addend); in isFPInductionPHI() local 1031 D = InductionDescriptor(StartValue, IK_FpInduction, Step, BOp); in isFPInductionPHI() 1219 const SCEV *Step = AR->getStepRecurrence(*SE); in isInductionPHI() local 1222 const SCEVConstant *ConstStep = dyn_cast<SCEVConstant>(Step); in isInductionPHI() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter6/ |
| H A D | toy.cpp | 218 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anon52ec69cd0111::ForExprAST 222 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 225 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 425 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 428 Step = ParseExpression(); in ParseForExpr() 429 if (!Step) in ParseForExpr() 442 std::move(Step), std::move(Body)); in ParseForExpr() 837 if (Step) { in codegen() 838 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/bsd/ipf/dist/rules/ |
| H A D | firewall | 4 Step 1 - Block out "bad" IP packets. 14 Step 2 - Convert Network Security Policy to filter rules. 22 Step 3 - Create TCP "keep state" rules.
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | ScalarEvolutionExpander.cpp | 338 const SCEV *Step = A->getStepRecurrence(SE); in FactorOutConstant() local 339 const SCEV *StepRem = SE.getConstant(Step->getType(), 0); in FactorOutConstant() 340 if (!FactorOutConstant(Step, StepRem, Factor, SE, DL)) in FactorOutConstant() 347 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant() 1173 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNSW() local 1174 const SCEV *OpAfterExtend = SE.getAddExpr(SE.getSignExtendExpr(Step, WideTy), in IsIncrementNSW() 1177 SE.getSignExtendExpr(SE.getAddExpr(AR, Step), WideTy); in IsIncrementNSW() 1187 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNUW() local 1188 const SCEV *OpAfterExtend = SE.getAddExpr(SE.getZeroExtendExpr(Step, WideTy), in IsIncrementNUW() 1191 SE.getZeroExtendExpr(SE.getAddExpr(AR, Step), WideTy); in IsIncrementNUW() [all …]
|
| /netbsd-src/external/mpl/bind/dist/doc/dnssec-guide/ |
| H A D | recipes.rst | 572 :alt: Upload DS Record Step #1 575 Upload DS Record Step #1 582 :alt: Upload DS Record Step #2 585 Upload DS Record Step #2 593 :alt: Upload DS Record Step #3 596 Upload DS Record Step #3 604 :alt: Upload DS Record Step #4 607 Upload DS Record Step #4 614 :alt: Upload DS Record Step #5 617 Upload DS Record Step # [all...] |
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| H A D | HexagonISelDAGToDAGHVX.cpp | 363 uint8_t ctl(ElemType Pos, unsigned Step) const { in ctl() 364 return Table[Pos][Step]; in ctl() 391 bool route(ElemType *P, RowType *T, unsigned Size, unsigned Step); 405 bool route(ElemType *P, RowType *T, unsigned Size, unsigned Step); 421 bool route(ElemType *P, RowType *T, unsigned Size, unsigned Step); 426 unsigned Step) { in route() argument 452 if (T[U][Step] != S && T[U][Step] != None) in route() 454 T[U][Step] = S; in route() 461 if (Step+1 < Log) { in route() 462 if (UseUp && !route(P, T, Size/2, Step+1)) in route() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter8/ |
| H A D | toy.cpp | 227 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anon3be54bcf0111::ForExprAST 231 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 234 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 448 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 451 Step = ParseExpression(); in ParseForExpr() 452 if (!Step) in ParseForExpr() 465 std::move(Step), std::move(Body)); in ParseForExpr() 948 if (Step) { in codegen() 949 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter3/ |
| H A D | toy.cpp | 221 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anon4bdfba2f0111::ForExprAST 225 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 228 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 442 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 445 Step = ParseExpression(); in ParseForExpr() 446 if (!Step) in ParseForExpr() 459 std::move(Step), std::move(Body)); in ParseForExpr() 943 if (Step) { in codegen() 944 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter7/ |
| H A D | toy.cpp | 226 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anonc768dace0111::ForExprAST 230 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 233 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 447 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 450 Step = ParseExpression(); in ParseForExpr() 451 if (!Step) in ParseForExpr() 464 std::move(Step), std::move(Body)); in ParseForExpr() 949 if (Step) { in codegen() 950 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter2/ |
| H A D | toy.cpp | 221 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anond763492e0111::ForExprAST 225 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 228 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 442 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 445 Step = ParseExpression(); in ParseForExpr() 446 if (!Step) in ParseForExpr() 459 std::move(Step), std::move(Body)); in ParseForExpr() 943 if (Step) { in codegen() 944 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter1/ |
| H A D | toy.cpp | 221 std::unique_ptr<ExprAST> Start, End, Step, Body; member in __anon62e6d82d0111::ForExprAST 225 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 228 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 442 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 445 Step = ParseExpression(); in ParseForExpr() 446 if (!Step) in ParseForExpr() 459 std::move(Step), std::move(Body)); in ParseForExpr() 943 if (Step) { in codegen() 944 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter4/ |
| H A D | toy.cpp | 219 std::unique_ptr<ExprAST> Start, End, Step, Body; member in ForExprAST 223 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step, in ForExprAST() argument 226 Step(std::move(Step)), Body(std::move(Body)) {} in ForExprAST() 425 std::unique_ptr<ExprAST> Step; in ParseForExpr() local 428 Step = ParseExpression(); in ParseForExpr() 429 if (!Step) in ParseForExpr() 442 std::move(Step), std::move(Body)); in ParseForExpr() 926 if (Step) { in codegen() 927 StepVal = Step->codegen(); in codegen()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| H A D | FuzzerTracePC.h | 203 const size_t Step = sizeof(LargeType) / sizeof(uint8_t); in ForEachNonZeroByte() local 204 const size_t StepMask = Step - 1; in ForEachNonZeroByte() 212 for (; P < End; P += Step) in ForEachNonZeroByte() 214 for (size_t I = 0; I < Step; I++, Bundle >>= 8) in ForEachNonZeroByte()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 591 Value *Step, Instruction *DL); 627 virtual Value *getStepVector(Value *Val, int StartIdx, Value *Step, 636 void buildScalarSteps(Value *ScalarIV, Value *Step, Instruction *EntryVal, 646 Value *Step, Value *Start, 896 Value *getStepVector(Value *Val, int StartIdx, Value *Step, 1109 static Value *createStepForVF(IRBuilder<> &B, Constant *Step, ElementCount VF) { in createStepForVF() argument 1110 assert(isa<ConstantInt>(Step) && "Expected an integer step"); in createStepForVF() 1112 Step->getType(), in createStepForVF() 1113 cast<ConstantInt>(Step)->getSExtValue() * VF.getKnownMinValue()); in createStepForVF() 2257 const InductionDescriptor &II, Value *Step, Value *Start, in createVectorIntOrFpInductionPHI() argument [all …]
|