/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
H A D | RISCVInstrInfoV.td | 211 class VLXSched<int dataEEW, bit isOrdered, string dataEMUL, string idxEMUL, 213 [!cast<SchedWrite>("WriteVLD" # !if(isOrdered, "O", "U") # "X" # dataEEW # "_" # dataEMUL)], 214 [ReadVLDX, !cast<SchedRead>("ReadVLD" # !if(isOrdered, "O", "U") # "XV_" # idxEMUL)], 217 class VLXSchedMC<int dataEEW, bit isOrdered>: 218 VLXSched<dataEEW, isOrdered, "WorstCase", "WorstCase", forceMasked=1>; 220 class VSXSched<int dataEEW, bit isOrdered, string dataEMUL, string idxEMUL, 222 [!cast<SchedWrite>("WriteVST" # !if(isOrdered, "O", "U") # "X" # dataEEW # "_" # dataEMUL)], 223 [!cast<SchedRead>("ReadVST" # !if(isOrdered, "O", "U") #"X" # dataEEW # "_" # dataEMUL), 224 ReadVSTX, !cast<SchedRead>("ReadVST" # !if(isOrdered, "O", "U") # "XV_" # idxEMUL)], 227 class VSXSchedMC<int dataEEW, bit isOrdered>: [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | IVDescriptors.h | 260 bool isOrdered() const { return IsOrdered; } in isOrdered() function
|
H A D | DependenceAnalysis.h | 130 /// isOrdered - Returns true if dependence is Output, Flow, or Anti 132 bool isOrdered() const { return isOutput() || isFlow() || isAnti(); } in isOrdered() function
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DependenceGraphBuilder.cpp | 341 else if (D->isOrdered() && !D->isLoopIndependent()) { in createMemoryDependencyEdges()
|
H A D | MemoryDependenceAnalysis.cpp | 900 auto isOrdered = [](Instruction *Inst) { in getNonLocalPointerDependency() local 908 if (QueryInst->isVolatile() || isOrdered(QueryInst)) { in getNonLocalPointerDependency()
|
H A D | MemorySSA.cpp | 1745 static inline bool isOrdered(const Instruction *I) { in isOrdered() function 1793 DefCheck = isModSet(ModRef) || isOrdered(I); in createNewAccess() 1815 Def = isModSet(ModRef) || isOrdered(I); in createNewAccess()
|
H A D | InstructionSimplify.cpp | 1873 ((FCmpInst::isOrdered(PredR) && IsAnd) || in simplifyAndOrOfFCmps() 1880 return FCmpInst::isOrdered(PredL) == FCmpInst::isOrdered(PredR) in simplifyAndOrOfFCmps() 1886 ((FCmpInst::isOrdered(PredL) && IsAnd) || in simplifyAndOrOfFCmps() 1893 return FCmpInst::isOrdered(PredL) == FCmpInst::isOrdered(PredR) in simplifyAndOrOfFCmps()
|
H A D | ValueTracking.cpp | 4402 return exactClass(Src, CmpInst::isOrdered(Pred) ? fcNone : fcAllFlags); in fcmpImpliesClass() 8469 } else if (CmpInst::isOrdered(Pred)) { in matchSelectPattern()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopUnrollAndJam.cpp | 714 assert(D->isOrdered() && "Expected an output, flow or anti dep."); in checkDependency()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlan.h | 2017 bool isOrdered() const { return IsOrdered; } in isOrdered() function 2230 bool isOrdered() const { return IsOrdered; }; in isOrdered() function 2254 R->isOrdered()) {}
|
H A D | VPlanRecipes.cpp | 579 if (PhiR->isOrdered()) { in generatePerPart() 1777 if (isOrdered()) { in execute() 2573 unsigned LastPartForNewPhi = isOrdered() ? 1 : State.UF; in execute()
|
H A D | LoopVectorizationLegality.cpp | 1183 return !RdxDesc.hasExactFPMath() || RdxDesc.isOrdered(); in canVectorizeFPMath()
|
H A D | VPlan.cpp | 1064 cast<VPReductionPHIRecipe>(PhiR)->isOrdered()); in execute()
|
H A D | LoopVectorize.cpp | 1104 return !Hints->allowReordering() && RdxDesc.isOrdered(); in useOrderedReductions() 5062 return RdxDesc.isOrdered(); in selectInterleaveCount() 8812 if (!PhiR || !PhiR->isInLoop() || (MinVF.isScalar() && !PhiR->isOrdered())) in adjustRecipesForReductions()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopInterchange.cpp | 125 assert(D->isOrdered() && "Expected an output, flow or anti dep."); in populateDependencyMatrix()
|
H A D | LoopFuse.cpp | 1346 << (DepResult->isOrdered() ? "true" : "false") in dependencesAllowFusion()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | InstrTypes.h | 1075 static bool isOrdered(Predicate predicate);
|
/freebsd/contrib/sqlite3/ |
H A D | sqlite3.c | 23192 Bool isOrdered:1; /* True if the table is not BTREE_UNORDERED */ member 97473 pCur->isOrdered = 1; 97520 pCx->isOrdered = pOrig->isOrdered; 97632 pCx->isOrdered = (pOp->p5!=BTREE_UNORDERED); 97864 assert( pC->isOrdered ); 99825 assert( pC->isOrdered ); 156941 i8 isOrdered; /* True if satisfies ORDER BY */ 157002 i8 isOrdered; /* No. of ORDER BY terms satisfied. -1 for unknown */ 166374 pNew->u.vtab.isOrdered = (i8)(pIdxInfo->orderByConsumed ? 166976 if( pLoop->u.vtab.isOrdered [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | Instructions.cpp | 3841 bool CmpInst::isOrdered(Predicate predicate) { in isOrdered() function in CmpInst
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | CombinerHelper.cpp | 6427 computeRetValAgainstNaN(CmpLHS, CmpRHS, CmpInst::isOrdered(Pred)); in matchFPSelectToMinMax()
|