HomeSort by: relevance | last modified time | path
    Searched refs:Logic (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
CombinerHelper.h 64 MachineInstr *Logic;
248 /// If we have a shift-by-constant of a bitwise logic op that itself has a
250 /// that into 2 independent shifts followed by the logic op.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineAndOrXor.cpp 1159 /// Reduce logic-of-compares with equality to a constant by substituting a
1161 /// Cmp0/Cmp1 switched to handle logic op commutativity.
1163 BinaryOperator &Logic,
1166 bool IsAnd = Logic.getOpcode() == Instruction::And;
1167 assert((IsAnd || Logic.getOpcode() == Instruction::Or) && "Wrong logic op");
1202 return Builder.CreateBinOp(Logic.getOpcode(), Cmp0, SubstituteCmp);
1484 /// an unlikely pattern for a large number of logic ops and fcmps.
1492 // logic op so an fcmp is operand 0 and a matching logic op is operand 1
    [all...]
InstCombineShifts.cpp 326 /// If we have a shift-by-constant of a bitwise logic op that itself has a
328 /// that into 2 independent shifts followed by the logic op. This eliminates a
346 // TODO: Remove the one-use check if the other logic operand (Y) is constant.
357 // Logic ops are commutative, so check each operand for a match.
365 // shift (logic (shift X, C0), Y), C1 -> logic (shift X, C0+C1), (shift Y, C1)
423 if (Instruction *Logic = foldShiftOfShiftedLogic(I, Builder))
424 return Logic;
  /src/external/gpl2/xcvs/dist/contrib/
cvs_acls.in 136 [To simplify the logic and because this would be normal usage.]
150 Replacing shoddy "$universal_off" logic
397 =head1 Program Logic
417 either files or dirs, but not both. (To simplify the logic.)
808 # to simplify the logic (without taking away much functionality).
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
CombinerHelper.cpp 1785 // with any of G_AND/G_OR/G_XOR logic instructions.
1787 // %t2 = LOGIC %t1, %Y
1792 // %root = LOGIC %t3, %t4
1801 // Match a one-use bitwise logic op.
1836 // Logic ops are commutative, so check each operand for a match.
1858 MatchInfo.Logic = LogicMI;
1887 Builder.buildInstr(MatchInfo.Logic->getOpcode(), {Dest}, {Shift1, Shift2});
1891 MatchInfo.Logic->eraseFromParent();
2865 // Matches: logic (hand x, ...), (hand y, ...) -> hand (logic x, y), ..
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 88 STATISTIC(NumFPLogicOpsConv, "Number of logic ops converted to fp ops");
4168 // true. Otherwise, we break the simplification logic in visitREM().
4304 // true. Otherwise, we break the simplification logic in visitREM().
4408 // If X/C can be simplified by the division-by-constant logic, lower
4781 /// If this is a bitwise logic instruction and both operands have the same
4782 /// opcode, try to sink the other opcode after the logic instruction.
4789 LogicOpcode == ISD::XOR) && "Expected logic opcode");
4824 SDValue Logic = DAG.getNode(LogicOpcode, DL, XVT, X, Y);
4825 return DAG.getNode(HandOpcode, DL, VT, Logic);
4841 // widening a binop. Also, don't create a logic op on an illegal type
    [all...]

Completed in 53 milliseconds