| /external/chromium_org/third_party/skia/src/effects/ |
| SkPorterDuff.cpp | 36 MAKE_PAIR(Xor),
|
| /external/skia/src/effects/ |
| SkPorterDuff.cpp | 36 MAKE_PAIR(Xor),
|
| /external/llvm/lib/IR/ |
| Instruction.cpp | 214 case Xor: return "xor";
474 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
477 return Opcode == And || Opcode == Or || Opcode == Xor ||
510 case Xor:
534 /// In LLVM, the Xor operator is nilpotent.
537 return Opcode == Xor;
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 67 case AtomicRMWInst::Xor:
|
| LoopRotation.cpp | 190 case Instruction::Xor:
|
| 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
660 // because the expression was "X xor X" or consisted of 2^Bitwidth additions:
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 380 Xor ///< Bitwise exclusive or.
466 return Create(Xor, LHS, RHS, Ctx);
|
| /external/clang/include/clang/AST/ |
| StmtVisitor.h | 128 BINOP_FALLBACK(And) BINOP_FALLBACK(Xor) BINOP_FALLBACK(Or)
|
| /external/llvm/lib/Analysis/ |
| CostModel.cpp | 140 case Instruction::Xor: {
|
| /external/llvm/lib/Transforms/InstCombine/ |
| 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:
|
| InstCombineSimplifyDemanded.cpp | 203 } else if (I->getOpcode() == Instruction::Xor) {
303 case Instruction::Xor: {
313 // These bits cannot contribute to the result of the 'xor'.
344 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
349 // are flipping are known to be set, then the xor is just resetting those
350 // bits to zero. We can just knock out bits from the 'and' and the 'xor',
585 // Turn this into a xor if LHS is 2^n-1 and the remaining bits are known
590 Instruction *Xor = BinaryOperator::CreateXor(I->getOperand(1), C0);
591 return InsertNewInstWith(Xor, *I);
[all...] |
| InstCombineCasts.cpp | 180 case Instruction::Xor:
362 case Instruction::Xor:
590 // icmp ne A, B is equal to xor A, B when A and B only really have one bit.
591 // It is also profitable to transform icmp eq into not(xor(A, B)) because that
676 case Instruction::Xor:
687 // If the operation is an AND/OR/XOR and the bits to clear are zero in the
691 Opc == Instruction::Xor)) {
[all...] |
| InstCombineVectorOps.cpp | 533 case Instruction::Xor:
596 case Instruction::Xor: {
693 case Instruction::Xor:
[all...] |
| InstCombineAndOrXor.cpp | 141 case Instruction::Xor:
173 // Adding a one to a single bit bit-field should be turned into an XOR
189 // the XOR is to toggle the bit. If it is clear, then the ADD has
195 // Pull the XOR out of the AND.
372 case Instruction::Xor:
[all...] |
| InstCombineSelect.cpp | 90 case Instruction::Xor:
110 case Instruction::Xor:
525 // watch code size carefully. We should consider xor instead of
[all...] |
| InstCombineCompares.cpp | [all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCUtil.cpp | 222 case Instruction::And: case Instruction::Or: case Instruction::Xor:
|
| /external/llvm/lib/MC/ |
| MCExpr.cpp | 117 case MCBinaryExpr::Xor: OS << '^'; break;
732 case MCBinaryExpr::Xor: Result = LHS ^ RHS; break;
|
| /external/llvm/include/llvm/ADT/ |
| APSInt.h | 232 APSInt Xor(const APSInt& RHS) const {
|
| APInt.h | 714 /// \brief Bitwise XOR assignment operator.
716 /// Performs a bitwise XOR operation on this APInt and RHS. The result is
790 /// \brief Bitwise XOR operator.
792 /// Performs a bitwise XOR operation on *this and RHS.
794 /// \returns An APInt value representing the bitwise XOR of *this and RHS.
802 /// \brief Bitwise XOR function.
804 /// Performs a bitwise XOR operation on *this and RHS. This is implemented
807 /// \returns An APInt value representing the bitwise XOR of *this and RHS.
808 APInt Xor(const APInt &RHS) const { return this->operator^(RHS); }
[all...] |
| /external/llvm/include/llvm/Support/ |
| 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)
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| 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,
[all...] |
| /art/compiler/utils/mips/ |
| assembler_mips.h | 239 void Xor(Register rd, Register rs, Register rt);
|
| /external/llvm/lib/Target/CppBackend/ |
| CPPBackend.cpp | 870 case Instruction::Xor: Out << "getXor("; break;
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| ThreadSanitizer.cpp | 189 else if (op == AtomicRMWInst::Xor)
|
