/freebsd-13-stable/contrib/bearssl/src/rsa/ |
H A D | rsa_i15_privexp.c | 33 * We want to invert e modulo phi = (p-1)(q-1). This first 34 * requires computing phi, which is easy since we have the factors 37 * Since p = 3 mod 4 and q = 3 mod 4, phi/4 is an odd integer. 38 * We could invert e modulo phi/4 then patch the result to 39 * modulo phi, but this would involve assembling three modulus-wide 40 * values (phi/4, 1 and e) and calling moddiv, that requires 47 * - We compute phi = k*e + r (Euclidean division of phi by e). 49 * invertible modulo phi). We also have k != 0 since we 58 * the above implies d < r + e*((phi 62 uint16_t *p, *q, *k, *m, *z, *phi; local [all...] |
H A D | rsa_i31_privexp.c | 33 * We want to invert e modulo phi = (p-1)(q-1). This first 34 * requires computing phi, which is easy since we have the factors 37 * Since p = 3 mod 4 and q = 3 mod 4, phi/4 is an odd integer. 38 * We could invert e modulo phi/4 then patch the result to 39 * modulo phi, but this would involve assembling three modulus-wide 40 * values (phi/4, 1 and e) and calling moddiv, that requires 47 * - We compute phi = k*e + r (Euclidean division of phi by e). 49 * invertible modulo phi). We also have k != 0 since we 58 * the above implies d < r + e*((phi 62 uint32_t *p, *q, *k, *m, *z, *phi; local [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 164 MachineBasicBlock::iterator phi = BB->begin(); local 165 while (phi != BB->end() && phi->isPHI()) { 166 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2) 167 if (!preds.count(phi->getOperand(i).getMBB())) { 168 phi->RemoveOperand(i); 169 phi->RemoveOperand(i-1); 173 if (phi->getNumOperands() == 3) { 174 const MachineOperand &Input = phi->getOperand(1); 175 const MachineOperand &Output = phi [all...] |
H A D | ModuloSchedule.cpp | 432 // Adjust the computations below when the phi and the loop definition 636 // requires a phi in the epilog for the last definition from either 782 /// v1 = phi(a, v2) v1 = phi(a, v2) 783 /// v2 = phi(b, v3) v2 = phi(b, v3) 1098 // The loop value is another phi, which has not been scheduled. 1101 // The loop value is another phi, which has been scheduled. 1262 // Map from <LoopReg, InitReg> to phi register for all created phis. Note that 1265 // Map from LoopReg to phi registe 1459 Register KernelRewriter::phi(Register LoopReg, Optional<Register> InitReg, function in class:KernelRewriter [all...] |
H A D | EarlyIfConversion.cpp | 110 /// Information about each phi in the Tail block. 117 PHIInfo(MachineInstr *phi) argument 118 : PHI(phi), TReg(0), FReg(0), CondCycles(0), TCycles(0), FCycles(0) {}
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_repos/ |
H A D | replay.c | 176 apr_hash_index_t *hi, *phi; 185 for (phi = apr_hash_first(pool, props); phi; phi = apr_hash_next(phi)) 187 const char *key = apr_hash_this_key(phi); 188 svn_string_t *val = apr_hash_this_val(phi); 304 for (phi = apr_hash_first(pool, props); phi; phi 173 apr_hash_index_t *hi, *phi; local [all...] |
/freebsd-13-stable/contrib/ntp/clockstuff/ |
H A D | propdelay.c | 434 double phi; local 439 phi = (PI/2.0) - atan((h / (EARTHRADIUS * sin(theta))) + tan(theta/2)); 440 td = dg / (LIGHTSPEED * sin(phi));
|
/freebsd-13-stable/contrib/bearssl/test/ |
H A D | test_math.c | 385 mpz_t n, e, d, p, q, dp, dq, iq, t1, t2, phi; 401 mpz_init(phi); 432 mpz_mul(phi, t1, t2); 433 mpz_invert(d, e, phi);
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGObjCGNU.cpp | 2750 llvm::PHINode *phi = Builder.CreatePHI(v->getType(), 2); local 2751 phi->addIncoming(v, messageBB); 2752 phi->addIncoming(llvm::Constant::getNullValue(v->getType()), startBB); 2753 msgRet = RValue::get(phi); 2756 llvm::PHINode *phi = Builder.CreatePHI(v.getType(), 2); local 2760 phi->addIncoming(v.getPointer(), messageBB); 2761 phi->addIncoming(NullVal.getPointer(), startBB); 2762 msgRet = RValue::getAggregate(Address(phi, v.getAlignment())); 2765 llvm::PHINode *phi = Builder.CreatePHI(v.first->getType(), 2); local 2766 phi [all...] |
H A D | CGExpr.cpp | 4491 llvm::PHINode *phi = local 4493 phi->addIncoming(lhs->getPointer(*this), lhsBlock); 4494 phi->addIncoming(rhs->getPointer(*this), rhsBlock); 4495 Address result(phi, std::min(lhs->getAlignment(), rhs->getAlignment()));
|
H A D | CGExprScalar.cpp | 3311 llvm::PHINode *phi = Builder.CreatePHI(opTy, 2); local 3312 phi->addIncoming(result, initialBB); 3313 phi->addIncoming(handlerResult, overflowBB); 3315 return phi; 4278 // Insert an entry into the phi node for the edge with the value of RHSCond. 4363 // into the phi node for the edge with the value of RHSCond.
|
H A D | CGObjCMac.cpp | 1777 // The phi code below assumes that we haven't needed any control flow yet. 1787 // If we've got a scalar return, build a phi. 1795 // Otherwise, build a phi. 1797 llvm::PHINode *phi = CGF.Builder.CreatePHI(null->getType(), 2); local 1798 phi->addIncoming(result.getScalarVal(), callBB); 1799 phi->addIncoming(null, NullBB); 1800 return RValue::get(phi);
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | MathExtras.h | 72 phi = 1.6180339887498948482; // (0x1.9e3779b97f4a8P+0) https://oeis.org/A001622 member in namespace:llvm::numbers
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/AsmParser/ |
H A D | LLLexer.cpp | 861 INSTKEYWORD(phi, PHI);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | InlineFunction.cpp | 162 PHINode *phi = cast<PHINode>(I); local 163 phi->addIncoming(UnwindDestPHIValues[i], src); 2255 // phi below. 2485 // If we inserted a phi node, check to see if it has a single value (e.g. all
|
/freebsd-13-stable/sys/netpfil/ipfw/ |
H A D | ip_fw_sockopt.c | 3165 struct opcode_obj_rewrite **phi) 3189 *phi = hi; 3164 find_op_rw_range(uint16_t op, struct opcode_obj_rewrite **plo, struct opcode_obj_rewrite **phi) argument
|