/freebsd-9.3-release/tools/regression/geom_uzip/etalon/ |
H A D | etalon.txt | 13 And the mome raths outgrabe. 23 And stood awhile in thought. 25 And, as in uffish thought he stood, 28 And burbled as it came! 30 One, two! One, two! And through and through 35 "And, has thou slain the Jabberwock? 43 And the mome raths outgrabe.
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | OperatorPrecedence.h | 36 And = 8, // & enumerator in enum:clang::prec::Level
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Basic/ |
H A D | OperatorPrecedence.cpp | 59 case tok::amp: return prec::And;
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | Instruction.cpp | 212 case And: return "and"; 475 /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative. 478 return Opcode == And || Opcode == Or || Opcode == Xor || 509 case And: 522 /// In LLVM, the And and Or operators are idempotent. 525 return Opcode == And || Opcode == Or;
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LowerAtomic.cpp | 58 case AtomicRMWInst::And:
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineShifts.cpp | 108 case Instruction::And: 203 case Instruction::And: 394 Value *And = Builder->CreateAnd(NSh, local 399 return new TruncInst(And, I.getType()); 411 case Instruction::And: 483 bool isValid = true; // Valid only for And, Or, Xor 495 case Instruction::And:
|
H A D | InstCombineCasts.cpp | 178 case Instruction::And: 360 case Instruction::And: 674 case Instruction::And: 690 (Opc == Instruction::And || Opc == Instruction::Or || 825 Value *And = Builder->CreateAnd(A, AndConst, CSrc->getName()+".mask"); local 826 return new ZExtInst(And, CI.getType()); 862 if (SrcI && SrcI->getOpcode() == Instruction::And && SrcI->hasOneUse()) 875 if (BinaryOperator *And = dyn_cast<BinaryOperator>(SrcI->getOperand(0))) 876 if (And->getOpcode() == Instruction::And [all...] |
H A D | InstCombineSimplifyDemanded.cpp | 158 if (I->getOpcode() == Instruction::And) { 234 case Instruction::And: 338 Instruction *And = BinaryOperator::CreateAnd(I->getOperand(0), AndC); local 339 return InsertNewInstWith(And, *I); 353 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() && 1186 case Instruction::And:
|
H A D | InstCombineAndOrXor.cpp | 144 Value *And = Builder->CreateAnd(X, AndRHS); local 145 And->takeName(Op); 146 return BinaryOperator::CreateXor(And, Together); 164 Value *And = Builder->CreateAnd(X, Together); local 165 And->takeName(Op); 166 return BinaryOperator::CreateOr(And, OpRHS); 351 case Instruction::And: 1431 if (I->getOpcode() == Instruction::And && 1578 LAnd->getOpcode() == Instruction::And && 1579 RAnd->getOpcode() == Instruction::And) { 1718 Value *And = Builder->CreateAnd(LHS->getOperand(0), NegCst); local 2117 Value *And = Builder->CreateAnd(Op0NotVal, Op1NotVal, local [all...] |
H A D | InstCombineSelect.cpp | 88 case Instruction::And: 115 case Instruction::And: 546 Value *And = Builder->CreateAnd(AShr, C2->getValue()-C1->getValue()); 547 return ReplaceInstUsesWith(SI, Builder->CreateAdd(And, C1));
|
H A D | InstCombineVectorOps.cpp | 565 case Instruction::And: 628 case Instruction::And: 725 case Instruction::And:
|
/freebsd-9.3-release/contrib/llvm/lib/Target/SystemZ/ |
H A D | SystemZInstrInfo.cpp | 719 if (LogicOp And = interpretAndImmediate(Opcode)) { 720 uint64_t Imm = MI->getOperand(2).getImm() << And.ImmLSB; 722 Imm |= allOnes(And.RegSize) & ~(allOnes(And.ImmSize) << And.ImmLSB); 724 if (isRxSBGMask(Imm, And.RegSize, Start, End)) { 726 if (And.RegSize == 64)
|
/freebsd-9.3-release/usr.bin/make/ |
H A D | cond.c | 91 * will return And for '&' and '&&', Or for '|' and '||', Not for '!', 99 And, enumerator in enum:__anon10792 465 t = And; 939 if (o == And) {
|
/freebsd-9.3-release/contrib/cvs/ |
H A D | acinclude.m4 | 111 # And look through them for GSS_C_NT_HOSTBASED_SERVICE or its alternatives
|
/freebsd-9.3-release/contrib/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 360 And, ///< Bitwise and. enumerator in enum:llvm::MCBinaryExpr::Opcode 402 return Create(And, LHS, RHS, Ctx);
|
/freebsd-9.3-release/contrib/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 100 case Instruction::And:
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCUtil.cpp | 173 // operands of interest. And ret is never followed by a release, so it's 222 case Instruction::And: case Instruction::Or: case Instruction::Xor:
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | ItaniumCXXABI.cpp | 652 llvm::Instruction::BinaryOps And, Or; local 655 And = llvm::Instruction::Or; 656 Or = llvm::Instruction::And; 659 And = llvm::Instruction::And; 707 EqZero = Builder.CreateBinOp(And, EqZero, OrAdjAnd1EqZero); 712 Result = Builder.CreateBinOp(And, PtrEq, Result, 976 // And load the address point from the VTT.
|
H A D | MicrosoftCXXABI.cpp | 1476 llvm::Instruction::BinaryOps And, Or; local 1479 And = llvm::Instruction::Or; 1480 Or = llvm::Instruction::And; 1483 And = llvm::Instruction::And; 1507 Res = Builder.CreateBinOp(And, Res, Cmp); 1522 return Builder.CreateBinOp(And, Res, Cmp0, "memptr.cmp");
|
H A D | CGAtomic.cpp | 266 PostOp = llvm::Instruction::And; 270 Op = llvm::AtomicRMWInst::And; 290 PostOp = llvm::Instruction::And;
|
/freebsd-9.3-release/contrib/llvm/lib/MC/ |
H A D | MCExpr.cpp | 101 case MCBinaryExpr::And: OS << '&'; break; 716 case MCBinaryExpr::And: Result = LHS & RHS; break;
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | APSInt.h | 215 APSInt LLVM_ATTRIBUTE_UNUSED_RESULT And(const APSInt& RHS) const { function in class:llvm::APSInt
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | StmtVisitor.h | 128 BINOP_FALLBACK(And) BINOP_FALLBACK(Xor) BINOP_FALLBACK(Or)
|
/freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 1428 /// SimplifyAndInst - Given operands for an And, see if we can 1435 return ConstantFoldInstOperands(Instruction::And, CLHS->getType(), 1485 if (Value *V = SimplifyAssociativeBinOp(Instruction::And, Op0, Op1, Q, 1489 // And distributes over Or. Try some generic simplifications based on this. 1490 if (Value *V = ExpandBinOp(Instruction::And, Op0, Op1, Instruction::Or, 1494 // And distributes over Xor. Try some generic simplifications based on this. 1495 if (Value *V = ExpandBinOp(Instruction::And, Op0, Op1, Instruction::Xor, 1499 // Or distributes over And. Try some generic simplifications based on this. 1500 if (Value *V = FactorizeBinOp(Instruction::And, Op0, Op1, Instruction::Or, 1507 if (Value *V = ThreadBinOpOverSelect(Instruction::And, Op [all...] |
H A D | CostModel.cpp | 398 case Instruction::And:
|