| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/ |
| 11.10-1.js | 231 function Xor( s, a ) {
|
| 11.10-2.js | 230 function Xor( s, a ) {
|
| 11.10-3.js | 80 Xor( shiftexp, addexp ),
229 function Xor( s, a ) {
|
| /external/llvm/include/llvm/ADT/ |
| APSInt.h | 232 APSInt Xor(const APSInt& RHS) const {
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSimplifyDemanded.cpp | 289 case Instruction::Xor: {
299 // These bits cannot contribute to the result of the 'xor'.
330 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
335 // are flipping are known to be set, then the xor is just resetting those
336 // bits to zero. We can just knock out bits from the 'and' and the 'xor',
571 // Turn this into a xor if LHS is 2^n-1 and the remaining bits are known
576 Instruction *Xor = BinaryOperator::CreateXor(I->getOperand(1), C0);
577 return InsertNewInstWith(Xor, *I);
[all...] |
| InstCombineCompares.cpp | [all...] |
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 333 Xor ///< Bitwise exclusive or.
419 return Create(Xor, LHS, RHS, Ctx);
|
| /external/llvm/include/llvm/ |
| Instructions.h | 582 Xor,
[all...] |
| /external/v8/src/mips/ |
| macro-assembler-mips.cc | 423 // Xor original key with a seed.
677 void MacroAssembler::Xor(Register rd, Register rs, const Operand& rt) {
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm.ml | 167 | Xor
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant.jar | |
| /prebuilts/tools/common/ant/ |
| ant.jar | |
| /tools/motodev/src/plugins/certmanager/lib/ |
| bcprov-jdk15on-147.jar | |
