| /external/skia/src/effects/ |
| SkPorterDuff.cpp | 43 MAKE_PAIR(Xor),
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/ |
| 11.10-3.js | 80 Xor( shiftexp, addexp ),
229 function Xor( s, a ) {
|
| 11.10-1.js | 231 function Xor( s, a ) {
|
| 11.10-2.js | 230 function Xor( s, a ) {
|
| /external/llvm/lib/VMCore/ |
| Instruction.cpp | 125 case Xor: return "xor";
365 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
368 return Opcode == And || Opcode == Or || Opcode == Xor ||
387 case Xor:
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 67 case AtomicRMWInst::Xor:
|
| Reassociate.cpp | 658 /// OptimizeAndOrXor - Optimize a series of operands to an 'and', 'or', or 'xor'
693 // Drop pairs of values for Xor.
694 assert(Opcode == Instruction::Xor);
[all...] |
| JumpThreading.cpp | 427 // Handle the NOT form of XOR.
428 if (I->getOpcode() == Instruction::Xor &&
796 // If this is an otherwise-unfoldable branch on a XOR, see if we can simplify.
797 if (CondInst->getOpcode() == Instruction::Xor &&
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 306 Xor ///< Bitwise exclusive or.
392 return Create(Xor, LHS, RHS, Ctx);
|
| /external/clang/include/clang/AST/ |
| StmtVisitor.h | 129 BINOP_FALLBACK(And) BINOP_FALLBACK(Xor) BINOP_FALLBACK(Or)
|
| /external/llvm/include/llvm/ADT/ |
| APSInt.h | 219 APSInt Xor(const APSInt& RHS) const {
|
| APInt.h | 617 /// Performs a bitwise XOR operation on this APInt and RHS. The result is
620 /// @brief Bitwise XOR assignment operator.
675 /// Performs a bitwise XOR operation on *this and RHS.
676 /// @returns An APInt value representing the bitwise XOR of *this and RHS.
677 /// @brief Bitwise XOR operator.
684 APInt Xor(const APInt& RHS) const {
[all...] |
| /external/llvm/include/llvm/Support/ |
| PatternMatch.h | 375 inline BinaryOp_match<LHS, RHS, Instruction::Xor>
377 return BinaryOp_match<LHS, RHS, Instruction::Xor>(L, R);
589 if (I->getOpcode() == Instruction::Xor)
592 if (CE->getOpcode() == Instruction::Xor)
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineShifts.cpp | 110 case Instruction::Xor:
204 case Instruction::Xor:
412 case Instruction::Xor: {
485 bool isValid = true; // Valid only for And, Or, Xor
494 case Instruction::Xor:
|
| InstCombineCasts.cpp | 175 case Instruction::Xor:
355 case Instruction::Xor:
586 // icmp ne A, B is equal to xor A, B when A and B only really have one bit.
587 // It is also profitable to transform icmp eq into not(xor(A, B)) because that
675 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...] |
| InstCombineAndOrXor.cpp | 204 case Instruction::Xor:
236 // Adding a one to a single bit bit-field should be turned into an XOR
252 // the XOR is to toggle the bit. If it is clear, then the ADD has
258 // Pull the XOR out of the AND.
439 case Instruction::Xor:
[all...] |
| InstCombineSelect.cpp | 90 case Instruction::Xor:
110 case Instruction::Xor:
450 // watch code size carefully. We should consider xor instead of
[all...] |
| InstCombineSimplifyDemanded.cpp | 293 case Instruction::Xor: {
303 // These bits cannot contribute to the result of the 'xor'.
334 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
339 // are flipping are known to be set, then the xor is just resetting those
340 // bits to zero. We can just knock out bits from the 'and' and the 'xor',
[all...] |
| InstCombineCompares.cpp | [all...] |
| /external/llvm/lib/MC/ |
| MCExpr.cpp | 122 case MCBinaryExpr::Xor: OS << '^'; break;
552 case MCBinaryExpr::Xor: Result = LHS ^ RHS; break;
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCISelDAGToDAG.cpp | 473 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS, dl, MVT::i32, LHS,
475 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, Xor,
515 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS8, dl, MVT::i64, LHS,
517 return SDValue(CurDAG->getMachineNode(PPC::CMPLDI, dl, MVT::i64, Xor,
[all...] |
| /external/opencv/cxcore/src/ |
| cxlogic.cpp | 505 ICV_DEF_BIN_LOG_OP_2D( CV_XOR, Xor )
|
| /external/llvm/lib/ExecutionEngine/ |
| ExecutionEngine.cpp | 688 case Instruction::Xor: {
706 case Instruction::Xor: GV.IntVal = LHS.IntVal ^ RHS.IntVal; break;
[all...] |
| /frameworks/compile/libbcc/lib/CodeGen/ |
| CodeEmitter.cpp | 368 case llvm::Instruction::Xor: {
412 case llvm::Instruction::Xor: {
[all...] |
| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | 577 /// i1 add -> xor.
708 // i1 sub -> xor.
[all...] |
