/freebsd-9.3-release/sys/sparc64/include/ |
H A D | ktr.h | 85 udiv r2, r3, r2 ; \ 93 udiv r2, r3, r2 ; \
|
/freebsd-9.3-release/contrib/compiler-rt/lib/arm/ |
H A D | udivsi3.S | 39 udiv r0, r0, r1
|
/freebsd-9.3-release/contrib/llvm/include/llvm/Support/ |
H A D | ConstantRange.h | 234 /// udiv - Return a new range representing the possible values resulting 237 ConstantRange udiv(const ConstantRange &Other) const;
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | APSInt.h | 100 *this = udiv(RHS); 111 return IsUnsigned ? APSInt(udiv(RHS), true) : APSInt(sdiv(RHS), false);
|
H A D | APInt.h | 68 /// of the operation. For example, sdiv and udiv. However, because the bit 899 APInt LLVM_ATTRIBUTE_UNUSED_RESULT udiv(const APInt &RHS) const; 1809 inline APInt udiv(const APInt &LHS, const APInt &RHS) { return LHS.udiv(RHS); }
|
/freebsd-9.3-release/sys/sparc64/sparc64/ |
H A D | swtch.S | 177 udiv %l3, %l5, %l6 246 udiv %l3, %l5, %l6
|
H A D | mp_exception.S | 46 udiv r2, r3, r4 ; \
|
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | APInt.cpp | 1323 x_new = (this->udiv(x_old) + x_old).udiv(two); 1340 APInt midpoint((nextSquare - square).udiv(two)); 1406 q1 = signedMin.udiv(anc); // initialize q1 = 2p/abs(nc) 1408 q2 = signedMin.udiv(ad); // initialize q2 = 2p/abs(d) 1451 q1 = signedMin.udiv(nc); // initialize q1 = 2p/nc 1453 q2 = signedMax.udiv(d); // initialize q2 = (2p-1)/d 1842 APInt APInt::udiv(const APInt& RHS) const { 1882 return (-(*this)).udiv(-RHS); 1883 return -((-(*this)).udiv(RH [all...] |
H A D | ConstantRange.cpp | 627 ConstantRange::udiv(const ConstantRange &RHS) const { function in class:ConstantRange 633 APInt Lower = getUnsignedMin().udiv(RHS.getUnsignedMax()); 645 APInt Upper = getUnsignedMax().udiv(RHS_umin) + 1;
|
H A D | APFloat.cpp | 3458 significand = significand.udiv(divisor);
|
/freebsd-9.3-release/contrib/gcc/config/sparc/ |
H A D | lb1spl.asm | 10 .global .udiv 12 .udiv:
|
H A D | lb1spc.asm | 118 .global .udiv 122 .udiv:
|
/freebsd-9.3-release/contrib/gcc/ |
H A D | libgcc2.h | 260 #define __udivdi3 __NDW(udiv,3)
|
H A D | expmed.c | 122 struct rtx_def udiv; rtunion udiv_fld1; member in struct:__anon1152 169 PUT_CODE (&all.udiv, UDIV); 170 XEXP (&all.udiv, 0) = &all.reg; 171 XEXP (&all.udiv, 1) = &all.reg; 217 PUT_MODE (&all.udiv, mode); 230 udiv_cost[mode] = rtx_cost (&all.udiv, SET);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Lex/ |
H A D | LiteralSupport.cpp | 903 OverflowOccurred |= Val.udiv(RadixVal) != OldVal;
|
/freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
H A D | LazyValueInfo.cpp | 738 Result.markConstantRange(LHSRange.udiv(RHSRange));
|
H A D | ConstantFolding.cpp | 781 APInt NewIdx = Offset.udiv(ElemSize);
|
H A D | ScalarEvolution.cpp | 605 // Lexicographically compare udiv expressions. 2134 return LHS; // X udiv 1 --> x 2135 // If the denominator is zero, the result of the udiv is undefined. Don't 3360 return setUnsignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y))); 3501 return setSignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y))); 5602 // back edge count. (Ideally we would have an "isexact" bit for udiv). We know 5611 // computed by this udiv could be smaller than the number of well-defined 6608 APInt ExitVal = (End + A).udiv(A);
|
H A D | InstructionSimplify.cpp | 1994 // 'udiv CI2, x' produces [0, CI2]. 1997 // 'udiv x, CI2' produces [0, UINT_MAX / CI2]. 2000 Upper = NegOne.udiv(CI2->getValue()) + 1; 2319 // x udiv y <=u x.
|
/freebsd-9.3-release/contrib/llvm/lib/AsmParser/ |
H A D | LLLexer.cpp | 648 INSTKEYWORD(udiv, UDiv); INSTKEYWORD(sdiv, SDiv); INSTKEYWORD(fdiv, FDiv);
|
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/Interpreter/ |
H A D | Execution.cpp | 697 // Additional macros to execute binary operations udiv/sdiv/urem/srem since 734 case Instruction::UDiv: INTEGER_VECTOR_FUNCTION(udiv) break; 776 case Instruction::UDiv: R.IntVal = Src1.IntVal.udiv(Src2.IntVal); break; 2033 case Instruction::UDiv: Dest.IntVal = Op0.IntVal.udiv(Op1.IntVal); break;
|
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/ |
H A D | ExecutionEngine.cpp | 746 case Instruction::UDiv:GV.IntVal = LHS.IntVal.udiv(RHS.IntVal); break;
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 1056 return ConstantInt::get(CI1->getContext(), C1V.udiv(C2V));
|
/freebsd-9.3-release/crypto/openssl/crypto/bn/asm/ |
H A D | sparcv8.S | 340 udiv %o1,%o2,%o0
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAG.cpp | 1837 // treat a udiv as a logical right shift by the power of 2 known to 2823 Outputs.push_back(getConstant(C1.udiv(C2), SVT));
|