Lines Matching defs:LL
2105 if (N1C && N1C->getAPIntValue() == 1LL)
2708 SDValue LL, LR, RL, RR, CC0, CC1;
2709 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
2714 LL.getValueType().isInteger()) {
2718 LR.getValueType(), LL, RL);
2725 LR.getValueType(), LL, RL);
2732 LR.getValueType(), LL, RL);
2738 if (LL == RL && isa<ConstantSDNode>(LR) && isa<ConstantSDNode>(RR) &&
2739 Op0 == Op1 && LL.getValueType().isInteger() &&
2744 SDValue ADDNode = DAG.getNode(ISD::ADD, SDLoc(N0), LL.getValueType(),
2745 LL, DAG.getConstant(1, LL.getValueType()));
2748 DAG.getConstant(2, LL.getValueType()), ISD::SETUGE);
2750 // canonicalize equivalent to ll == rl
2751 if (LL == RR && LR == RL) {
2755 if (LL == RL && LR == RR) {
2756 bool isInteger = LL.getValueType().isInteger();
2760 (TLI.isCondCodeLegal(Result, LL.getSimpleValueType()) &&
2764 LL, LR, Result);
3379 SDValue LL, LR, RL, RR, CC0, CC1;
3380 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
3385 LL.getValueType().isInteger()) {
3391 LR.getValueType(), LL, RL);
3400 LR.getValueType(), LL, RL);
3405 // canonicalize equivalent to ll == rl
3406 if (LL == RR && LR == RL) {
3410 if (LL == RL && LR == RR) {
3411 bool isInteger = LL.getValueType().isInteger();
3415 (TLI.isCondCodeLegal(Result, LL.getSimpleValueType()) &&
3419 LL, LR, Result);
4931 SDValue Lo, Hi, LL, LH, RL, RH;
4932 std::tie(LL, LH) = DAG.SplitVectorOperand(N, 0);
4935 Lo = DAG.getNode(N->getOpcode(), DL, LoVT, LL, RL, N->getOperand(2));
5205 SDValue Lo, Hi, CCLo, CCHi, LL, LH, RL, RH;
5207 std::tie(LL, LH) = DAG.SplitVectorOperand(N, 1);
5210 Lo = DAG.getNode(N->getOpcode(), DL, LL.getValueType(), CCLo, LL, RL);
13306 // chain until we find two aliases. If we've seen two aliases, assume we'll
13380 // only through the chain, then we'll miss the trivial dependence on L1
13388 // chain depth. Instead, we'll rule out such configurations here by
