| /art/test/427-bitwise/src/ |
| Main.java | 173 expectEquals(6, $opt$Xor(5, 3));
174 expectEquals(0, $opt$Xor(0, 0));
175 expectEquals(3, $opt$Xor(0, 3));
176 expectEquals(3, $opt$Xor(3, 0));
177 expectEquals(-4, $opt$Xor(1, -3));
178 expectEquals(9, $opt$Xor(-12, -3));
192 expectEquals(6L, $opt$Xor(5L, 3L));
193 expectEquals(0L, $opt$Xor(0L, 0L));
194 expectEquals(3L, $opt$Xor(0L, 3L));
195 expectEquals(3L, $opt$Xor(3L, 0L))
[all...] |
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| Xor.java | 13 public class Xor extends LogicalBinop {
15 public Xor(NumericType type, Value dest, Value left, Value right) {
25 public Xor asXor() {
41 // The dalvik jit had a bug where the long operations add, sub, or, xor and and would write
|
| /device/linaro/bootloader/edk2/Vlv2DeviceRefCodePkg/AcpiTablesPCAT/ |
| IgdOGBDA.ASL | 113 Xor(PARM, 1, PARM) // Invert the VGA mode polarity
|
| IgdOMOBF.ASL | 427 Xor(PFIT,7,PFIT) // mode setting between stretched and centered only.
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| Instruction.h | 151 /// Return true if this is and/or/xor.
153 return getOpcode() == And || getOpcode() == Or || getOpcode() == Xor;
392 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
396 return Opcode == And || Opcode == Or || Opcode == Xor ||
412 case And: case Or: case Xor:
437 /// In LLVM, the Xor operator is nilpotent.
441 return Opcode == Xor;
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/syntax/ |
| tokens.go | 196 Xor // ^
232 Xor: "^",
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/syntax/ |
| tokens.go | 196 Xor // ^
232 Xor: "^",
|
| /cts/tests/tests/renderscript/src/android/renderscript/cts/ |
| AtomicTest.rs | 50 TEST_OP(Xor)
|
| /prebuilts/go/darwin-x86/test/ |
| 64bit.go | 202 func (a Uint64) Xor(b Uint64) (c Uint64) {
308 func (a Int64) Xor(b Int64) (c Int64) { return a.Uint64().Xor(b.Uint64()).Int64() }
416 "func testInt64Unary(a, plus, xor, minus int64) {\n" +
418 " if n, op, want := ^a, `^`, xor; n != want { ok=false; println(`int64`, op, a, `=`, n, `should be`, want); }\n" +
422 "func testInt64Binary(a, b, add, sub, mul, div, mod, and, or, xor, andnot int64, dodiv bool) {\n" +
432 " if n, op, want := a ^ b, `^`, xor; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
461 "func testUint64Unary(a, plus, xor, minus uint64) {\n" +
463 " if n, op, want := ^a, `^`, xor; n != want { ok=false; println(`uint64`, op, a, `=`, n, `should be`, want); }\n" +
467 "func testUint64Binary(a, b, add, sub, mul, div, mod, and, or, xor, andnot uint64, dodiv bool) {\n"
[all...] |
| /prebuilts/go/linux-x86/test/ |
| 64bit.go | 202 func (a Uint64) Xor(b Uint64) (c Uint64) {
308 func (a Int64) Xor(b Int64) (c Int64) { return a.Uint64().Xor(b.Uint64()).Int64() }
416 "func testInt64Unary(a, plus, xor, minus int64) {\n" +
418 " if n, op, want := ^a, `^`, xor; n != want { ok=false; println(`int64`, op, a, `=`, n, `should be`, want); }\n" +
422 "func testInt64Binary(a, b, add, sub, mul, div, mod, and, or, xor, andnot int64, dodiv bool) {\n" +
432 " if n, op, want := a ^ b, `^`, xor; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
461 "func testUint64Unary(a, plus, xor, minus uint64) {\n" +
463 " if n, op, want := ^a, `^`, xor; n != want { ok=false; println(`uint64`, op, a, `=`, n, `should be`, want); }\n" +
467 "func testUint64Binary(a, b, add, sub, mul, div, mod, and, or, xor, andnot uint64, dodiv bool) {\n"
[all...] |
| /external/swiftshader/third_party/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:
|
| /art/compiler/optimizing/ |
| scheduler_arm.h | 73 M(Xor , unused) \
|
| /external/llvm/lib/IR/ |
| Instruction.cpp | 290 case Xor: return "xor";
552 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
555 return Opcode == And || Opcode == Or || Opcode == Xor ||
588 case Xor:
612 /// In LLVM, the Xor operator is nilpotent.
615 return Opcode == Xor;
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 72 case AtomicRMWInst::Xor:
|
| SpeculativeExecution.cpp | 220 case Instruction::Xor:
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 67 case AtomicRMWInst::Xor:
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
| gdiplusheaders.h | 553 Status Xor(const RectF& rect);
554 Status Xor(const Rect& rect);
555 Status Xor(const Region *region);
556 Status Xor(const GraphicsPath *path);
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZTDC.cpp | 24 // 10: xor i1 (tdc X, M1), (tdc X, M2) -> tdc X, (M1 ^ M2)
32 // 2. All and/or/xor i1 instructions whose both operands have been already
79 // The queue of and/or/xor i1 instructions to be potentially folded.
90 // Tries to convert an i1 and/or/xor instruction, whose both operands
95 // any and/or/xor i1 users to the queue.
105 LI->getOpcode() == Instruction::Xor)) {
303 case Instruction::Xor:
|
