HomeSort by: relevance | last modified time | path
    Searched defs:Bound (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/Dynamic/
Registry.cpp 777 llvm::Optional<DynTypedMatcher> Bound = Result->tryBind(BindID);
778 if (Bound.hasValue()) {
779 return VariantMatcher::SingleMatcher(*Bound);
Parser.cpp 401 llvm::Optional<DynTypedMatcher> Bound = Result->tryBind(BindID);
402 if (Bound.hasValue()) {
403 *Value = VariantMatcher::SingleMatcher(*Bound);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DemandedBits.cpp 510 APInt Bound = (LHS.Zero & RHS.Zero) | (LHS.One & RHS.One);
513 // Let demand ripple to the right but only up to any set bit in Bound.
515 // Bound = ----1-
517 APInt RBound = Bound.reverseBits();
DependenceAnalysis.cpp 548 LLVM_DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
1025 const SCEV *Bound = SE->getMinusSCEV(S, Size);
1026 if (const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(Bound)) {
1063 // Loop bound may be smaller (e.g., a char).
1064 // Should zero extend loop bound, since it's always >= 0.
1065 // This routine collects upper bound and extends or truncates if needed.
1068 // Return null if no bound available.
1137 // loop's upper bound. If a dependence exists, the dependence direction is
1342 // Check Delta/(2*ConstCoeff) against upper loop bound
1545 // New bound check - modification to Banerjee's e3 chec
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGExpr.cpp 624 // If a glvalue to which a reference is directly bound designates neither
890 // FIXME: Sema doesn't treat [1] as a flexible array member if the bound
938 // Don't load the size if it's a lower bound.
962 // For the vector indexing extension, the bound is the number of elements.
1000 llvm::Value *Bound = getArrayIndexingBound(*this, Base, IndexedType);
1001 if (!Bound)
1006 llvm::Value *BoundVal = Builder.CreateIntCast(Bound, SizeTy, false);
1071 /// derive a more accurate bound on the alignment of the pointer.
3932 // Requesting lower bound or upper bound, but without provided length an
    [all...]

Completed in 79 milliseconds