/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | AliasSetTracker.cpp | 184 ImmutableCallSite C1(getUnknownInst(i)), C2(Inst); 185 if (!C1 || !C2 || AA.getModRefInfo(C1, C2) != MRI_NoModRef || 186 AA.getModRefInfo(C2, C1) != MRI_NoModRef)
|
H A D | BasicAliasAnalysis.cpp | 422 // Use GetLinearExpression to decompose the index into a C1*V+C2 form. 428 // The GEP index scale ("Scale") scales C1*V+C2, yielding (C1*V+C2)*Scale. 429 // This gives us an aggregate computation of (C1*Scale)*V + C2*Scale. 792 ConstantInt *C1 = 799 if (C1 && C2 && C1 == C2) 855 if (C1 && C2) 862 } else if (!LastIndexedStruct || !C1 || !C2) { 881 const uint64_t V1Off = SL->getElementOffset(C1 [all...] |
H A D | InstructionSimplify.cpp | 996 if (Constant *C1 = dyn_cast<Constant>(Op1)) { 997 Constant *Ops[] = { C0, C1 }; 1052 // (X /u C1) /u C2 -> 0 if C1 * C2 overflow 1053 ConstantInt *C1, *C2; 1054 if (!isSigned && match(Op0, m_UDiv(m_Value(X), m_ConstantInt(C1))) && 1057 C1->getValue().umul_ov(C2->getValue(), Overflow); 1161 if (Constant *C1 = dyn_cast<Constant>(Op1)) { 1162 Constant *Ops[] = { C0, C1 }; 1313 if (Constant *C1 1802 ConstantInt *C1 = dyn_cast<ConstantInt>(C); local [all...] |
H A D | ConstantFolding.cpp | 664 // (&GV+C1) - (&GV+C2) -> C1-C2, pointer arithmetic cannot overflow. 1151 Constant *C1 = ConstantExpr::getIntegerCast(CE1->getOperand(0), local 1153 return ConstantFoldCompareInstOperands(Predicate, C0, C1, DL, TLI); 1670 const APFloat &C1 = Op1->getValueAPF(); local 1672 return ConstantFP::get(Ty->getContext(), minnum(C1, C2)); 1676 const APFloat &C1 = Op1->getValueAPF(); local 1678 return ConstantFP::get(Ty->getContext(), maxnum(C1, C2));
|
/freebsd-11.0-release/sys/dev/ep/ |
H A D | if_ep_pccard.c | 74 { PCMCIA_CARD(3COM, 3C1), EP_CHIP_C1 },
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | IfConversion.cpp | 243 static bool IfcvtTokenCmp(IfcvtToken *C1, IfcvtToken *C2) { argument 244 int Incr1 = (C1->Kind == ICDiamond) 245 ? -(int)(C1->NumDups + C1->NumDups2) : (int)C1->NumDups; 252 if (!C1->NeedSubsumption && C2->NeedSubsumption) 254 else if (C1->NeedSubsumption == C2->NeedSubsumption) { 256 if ((unsigned)C1->Kind < (unsigned)C2->Kind) 258 else if (C1->Kind == C2->Kind) 259 return C1 [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | Reassociate.cpp | 104 /// C1) The operand is in the form "X & C", where C is a constant and C != ~0 108 /// C2.2) Any operand E which doesn't fall into C1 and C2.1, we view this 1272 const APInt &C1 = Opnd1->getConstPart(); 1273 if (C1 != ConstOpnd) 1277 Res = createAndInstr(I, X, ~C1); 1278 // ConstOpnd was C2, now C1 ^ C2. 1279 ConstOpnd ^= C1; 1320 const APInt &C1 = Opnd1->getConstPart(); 1322 APInt C3((~C1) ^ C2); 1332 ConstOpnd ^= C1; [all...] |
H A D | MemCpyOptimizer.cpp | 1194 ConstantInt *C1 = dyn_cast<ConstantInt>(MDep->getLength()); 1195 if (!C1 || C1->getValue().getZExtValue() < ByValSize)
|
/freebsd-11.0-release/usr.bin/systat/ |
H A D | ifstat.c | 49 #define C1 0 /* 0-19 */ macro 56 static const int col1 = C1;
|
/freebsd-11.0-release/libexec/getty/ |
H A D | gettytab.h | 113 #define C1 gettynums[14].value macro
|
H A D | subr.c | 256 tmode.c_cflag = C1;
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAG.cpp | 1941 const APInt &C1 = N1C->getAPIntValue(); local 1945 case ISD::SETEQ: return getConstant(C1 == C2, dl, VT); 1946 case ISD::SETNE: return getConstant(C1 != C2, dl, VT); 1947 case ISD::SETULT: return getConstant(C1.ult(C2), dl, VT); 1948 case ISD::SETUGT: return getConstant(C1.ugt(C2), dl, VT); 1949 case ISD::SETULE: return getConstant(C1.ule(C2), dl, VT); 1950 case ISD::SETUGE: return getConstant(C1.uge(C2), dl, VT); 1951 case ISD::SETLT: return getConstant(C1.slt(C2), dl, VT); 1952 case ISD::SETGT: return getConstant(C1.sgt(C2), dl, VT); 1953 case ISD::SETLE: return getConstant(C1 3215 FoldValue(unsigned Opcode, const APInt &C1, const APInt &C2) argument [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Format/ |
H A D | WhitespaceManager.cpp | 22 operator()(const Change &C1, const Change &C2) const { argument 24 C1.OriginalWhitespaceRange.getBegin(),
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 95 bool operator () (const LowerSwitch::CaseRange& C1, argument 98 const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | CoverageMappingGen.cpp | 355 Counter addCounters(Counter C1, Counter C2, Counter C3) { argument 356 return addCounters(addCounters(C1, C2), C3); 359 Counter addCounters(Counter C1, Counter C2, Counter C3, Counter C4) { argument 360 return addCounters(addCounters(C1, C2, C3), C4);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineShifts.cpp | 354 // ((X*C1) << C2) == (X * (C1 << C2)) 595 // (X >>?,exact C1) << C2 --> X << (C2-C1) 611 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2) 615 // (X <<nuw C1) >>u C2 --> X >>u (C2-C1) 629 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in. However, 630 // we can handle (X <<nsw C1) >> 728 Constant *C1, *C2; local [all...] |
H A D | InstructionCombining.cpp | 187 /// 6. Transform: "(A op C1) op (B op C2)" ==> "(A op B) op (C1 op C2)" 188 /// if C1 and C2 are constants. 296 // Transform: "(A op C1) op (B op C2)" ==> "(A op B) op (C1 op C2)" 297 // if C1 and C2 are constants. 304 Constant *C1 = cast<Constant>(Op0->getOperand(1)); local 308 Constant *Folded = ConstantExpr::get(Opcode, C1, C2); 1294 Constant *C1 = nullptr; local 1297 if (isa<Constant>(LHS)) C1 [all...] |
H A D | InstCombineCompares.cpp | 413 Value *C1 = Builder->CreateICmpEQ(Idx, FirstTrueIdx); 416 return BinaryOperator::CreateOr(C1, C2); 433 Value *C1 = Builder->CreateICmpNE(Idx, FirstFalseIdx); 436 return BinaryOperator::CreateAnd(C1, C2); 868 // vice versa). This is because (x /s C1) <s C2 produces different 869 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even 870 // (x /u C1) <u C2. Simply casting the operands and result won't 887 // of form X/C1=C2. We solve for X by multiplying C1 (DivRH 3685 ConstantInt *C1, *C2; local [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | ThreadSafety.cpp | 535 Context intersectContexts(Context C1, Context C2); 537 void intersectBackEdge(Context C1, Context C2); 609 LocalVariableMap::intersectContexts(Context C1, Context C2) { 610 Context Result = C1; 611 for (const auto &P : C1) { 632 // This routine also takes the intersection of C1 and C2, but it does so by 633 // altering the VarDefinitions. C1 must be the result of an earlier call to 635 void LocalVariableMap::intersectBackEdge(Context C1, Context C2) { 636 for (const auto &P : C1) {
|
/freebsd-11.0-release/contrib/openbsm/config/ |
H A D | config.guess | 700 C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
|
/freebsd-11.0-release/contrib/openpam/ |
H A D | config.guess | 752 C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
|
/freebsd-11.0-release/contrib/dialog/ |
H A D | dlg_keys.c | 359 CURSES_NAME(C1), 584 * "~" depending on whether it is C0 or C1), or an escaped single character.
|
/freebsd-11.0-release/crypto/heimdal/ |
H A D | config.guess | 731 C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
|
/freebsd-11.0-release/contrib/tcpdump/ |
H A D | config.guess | 767 C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
|
/freebsd-11.0-release/contrib/sqlite3/ |
H A D | config.guess | 753 C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
|