/freebsd-10.2-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LowerAtomic.cpp | 67 case AtomicRMWInst::Xor:
|
H A D | LoopRotation.cpp | 190 case Instruction::Xor:
|
H A D | Reassociate.cpp | 114 /// Utility class representing a non-constant Xor-operand. We classify 115 /// non-constant Xor-Operands into two categories: 346 /// X occurring LHS + RHS times. If op is "Xor" for example then the combined 1108 // Drop pairs of values for Xor. 1109 assert(Opcode == Instruction::Xor); 1152 // Xor-Rule 1: (x | c1) ^ c2 = (x | c1) ^ (c1 ^ c1) ^ c2 1198 // Xor-Rule 2: 1201 // = (x & ~c1) ^ (x & c2) ^ c1 // Xor-Rule 1 1202 // = (x & c3) ^ c1, where c3 = ~c1 ^ c2 // Xor-rule 3 1223 // Xor [all...] |
/freebsd-10.2-release/contrib/llvm/lib/IR/ |
H A D | Instruction.cpp | 214 case Xor: return "xor"; 475 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative. 478 return Opcode == And || Opcode == Or || Opcode == Xor || 511 case Xor: 535 /// In LLVM, the Xor operator is nilpotent. 538 return Opcode == Xor;
|
/freebsd-10.2-release/contrib/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 380 Xor ///< Bitwise exclusive or. enumerator in enum:llvm::MCBinaryExpr::Opcode 466 return Create(Xor, LHS, RHS, Ctx);
|
/freebsd-10.2-release/contrib/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 102 case Instruction::Xor:
|
/freebsd-10.2-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineShifts.cpp | 110 case Instruction::Xor: 205 case Instruction::Xor: 413 case Instruction::Xor: { 483 bool isValid = true; // Valid only for And, Or, Xor 492 case Instruction::Xor:
|
H A D | InstCombineSimplifyDemanded.cpp | 203 } else if (I->getOpcode() == Instruction::Xor) { 303 case Instruction::Xor: { 590 Instruction *Xor = BinaryOperator::CreateXor(I->getOperand(1), C0); local 591 return InsertNewInstWith(Xor, *I); 1188 case Instruction::Xor:
|
H A D | InstCombineAndOrXor.cpp | 141 case Instruction::Xor: 372 case Instruction::Xor: 1123 case Instruction::Xor: 1715 APInt Xor = LHSCst->getValue() ^ RHSCst->getValue(); local 1716 if (Xor.isPowerOf2()) { 1717 Value *NegCst = Builder->getInt(~Xor); 1905 APInt Xor = CI1->getValue() ^ CI2->getValue(); 1906 if (!Xor.isAllOnesValue()) return 0; 2156 B->getOpcode() == Instruction::Xor)) { 2373 E1->getOpcode() == Instruction::Xor [all...] |
H A D | InstCombineCasts.cpp | 180 case Instruction::Xor: 362 case Instruction::Xor: 676 case Instruction::Xor: 691 Opc == Instruction::Xor)) { 873 if (SrcI && SrcI->getOpcode() == Instruction::Xor && SrcI->hasOneUse()) 1027 case Instruction::Xor:
|
H A D | InstCombineVectorOps.cpp | 567 case Instruction::Xor: 630 case Instruction::Xor: { 727 case Instruction::Xor:
|
H A D | InstCombineCompares.cpp | 1081 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI) 1090 // the operation, just stop using the Xor. 1664 case Instruction::Xor: 2135 Value *Xor = Builder->CreateXor(Op0, Op1, I.getName()+"tmp"); local 2136 return BinaryOperator::CreateNot(Xor); 2779 case Instruction::Xor: 2899 Value *Xor = Builder->CreateXor(C, NC); local 2900 return new ICmpInst(I.getPredicate(), A, Xor); 2971 Value *Xor = Builder->CreateXor(A, B, I.getName() + ".unshifted"); local 2973 return new ICmpInst(Pred, Xor, Builde [all...] |
H A D | InstCombineSelect.cpp | 90 case Instruction::Xor: 110 case Instruction::Xor:
|
/freebsd-10.2-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCUtil.cpp | 222 case Instruction::And: case Instruction::Or: case Instruction::Xor:
|
/freebsd-10.2-release/contrib/llvm/lib/MC/ |
H A D | MCExpr.cpp | 117 case MCBinaryExpr::Xor: OS << '^'; break; 732 case MCBinaryExpr::Xor: Result = LHS ^ RHS; break;
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | StmtVisitor.h | 128 BINOP_FALLBACK(And) BINOP_FALLBACK(Xor) BINOP_FALLBACK(Or)
|
/freebsd-10.2-release/contrib/llvm/include/llvm/ADT/ |
H A D | APSInt.h | 232 APSInt LLVM_ATTRIBUTE_UNUSED_RESULT Xor(const APSInt& RHS) const { function in class:llvm::APSInt
|
H A D | APInt.h | 812 APInt LLVM_ATTRIBUTE_UNUSED_RESULT Xor(const APInt &RHS) const { 1850 inline APInt Xor(const APInt &LHS, const APInt &RHS) { return LHS ^ RHS; }
|
/freebsd-10.2-release/contrib/llvm/tools/lldb/source/Expression/ |
H A D | IRInterpreter.cpp | 530 case Instruction::Xor: 637 case Instruction::Xor: 721 case Instruction::Xor:
|
/freebsd-10.2-release/contrib/llvm/include/llvm/Support/ |
H A D | PatternMatch.h | 478 inline BinaryOp_match<LHS, RHS, Instruction::Xor> 480 return BinaryOp_match<LHS, RHS, Instruction::Xor>(L, R); 723 if (O->getOpcode() == Instruction::Xor)
|
/freebsd-10.2-release/contrib/llvm/lib/Analysis/ |
H A D | CostModel.cpp | 400 case Instruction::Xor: {
|
/freebsd-10.2-release/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCISelDAGToDAG.cpp | 498 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS, dl, MVT::i32, LHS, 500 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, Xor, 540 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS8, dl, MVT::i64, LHS, 542 return SDValue(CurDAG->getMachineNode(PPC::CMPLDI, dl, MVT::i64, Xor,
|
/freebsd-10.2-release/contrib/llvm/lib/Target/CppBackend/ |
H A D | CPPBackend.cpp | 870 case Instruction::Xor: Out << "getXor("; break; 1211 case Instruction::Xor: 1231 case Instruction::Xor: Out << "Instruction::Xor"; break; 1573 case AtomicRMWInst::Xor: Operation = "AtomicRMWInst::Xor"; break;
|
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | ThreadSanitizer.cpp | 189 else if (op == AtomicRMWInst::Xor)
|
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | CGAtomic.cpp | 282 PostOp = llvm::Instruction::Xor; 286 Op = llvm::AtomicRMWInst::Xor;
|